PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL
Computational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex hull is the set of points that form a convex...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitas Udayana
2013-11-01
|
Series: | E-Jurnal Matematika |
Subjects: | |
Online Access: | https://ojs.unud.ac.id/index.php/mtk/article/view/7843 |
_version_ | 1818536403332497408 |
---|---|
author | AGUS EKA ARIESTA G.K. GANDHIADI NI KETUT TARI TASTRAWATI I PUTU EKA NILA KENCANA |
author_facet | AGUS EKA ARIESTA G.K. GANDHIADI NI KETUT TARI TASTRAWATI I PUTU EKA NILA KENCANA |
author_sort | AGUS EKA ARIESTA |
collection | DOAJ |
description | Computational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex hull is the set of points that form a convex polygon that covers the entire set of points. The algorithms for determining the convex hull, among others, Graham Scan, Jarvis March, and Divide and Conquer. In the two-dimensional case, Graham Scan algorithm is highly efficient in the use of time complexity. This article discusses the quest convex hull of the data bank debtors, some of the data used to look at the classification accuracy of the convex hull formed. The coordinates of all the data found by using principal component analysis.After the data are analyzed, we get the accuracy of classification by 74%. |
first_indexed | 2024-12-11T18:37:30Z |
format | Article |
id | doaj.art-cab34231d9ae4e1ca8964024e2ab91d2 |
institution | Directory Open Access Journal |
issn | 2303-1751 |
language | English |
last_indexed | 2024-12-11T18:37:30Z |
publishDate | 2013-11-01 |
publisher | Universitas Udayana |
record_format | Article |
series | E-Jurnal Matematika |
spelling | doaj.art-cab34231d9ae4e1ca8964024e2ab91d22022-12-22T00:54:43ZengUniversitas UdayanaE-Jurnal Matematika2303-17512013-11-0124465210.24843/MTK.2013.v02.i04.p0587843PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULLAGUS EKA ARIESTA0G.K. GANDHIADI1NI KETUT TARI TASTRAWATI2I PUTU EKA NILA KENCANA3Faculty of Mathematics and Natural Sciences, Udayana UniversityFaculty of Mathematics and Natural Science, Udayana UniversityFaculty of Mathematics and Natural Science, Udayana UniversityFaculty of Mathematics and Natural Science, Udayana UniversityComputational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex hull is the set of points that form a convex polygon that covers the entire set of points. The algorithms for determining the convex hull, among others, Graham Scan, Jarvis March, and Divide and Conquer. In the two-dimensional case, Graham Scan algorithm is highly efficient in the use of time complexity. This article discusses the quest convex hull of the data bank debtors, some of the data used to look at the classification accuracy of the convex hull formed. The coordinates of all the data found by using principal component analysis.After the data are analyzed, we get the accuracy of classification by 74%.https://ojs.unud.ac.id/index.php/mtk/article/view/7843Computational geometryconvex hullgraham scanprincipal component analysis |
spellingShingle | AGUS EKA ARIESTA G.K. GANDHIADI NI KETUT TARI TASTRAWATI I PUTU EKA NILA KENCANA PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL E-Jurnal Matematika Computational geometry convex hull graham scan principal component analysis |
title | PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL |
title_full | PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL |
title_fullStr | PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL |
title_full_unstemmed | PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL |
title_short | PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL |
title_sort | pengklasifikasian debitur dengan menggunakan algoritma graham scan dalam pengaplikasian convex hull |
topic | Computational geometry convex hull graham scan principal component analysis |
url | https://ojs.unud.ac.id/index.php/mtk/article/view/7843 |
work_keys_str_mv | AT agusekaariesta pengklasifikasiandebiturdenganmenggunakanalgoritmagrahamscandalampengaplikasianconvexhull AT gkgandhiadi pengklasifikasiandebiturdenganmenggunakanalgoritmagrahamscandalampengaplikasianconvexhull AT niketuttaritastrawati pengklasifikasiandebiturdenganmenggunakanalgoritmagrahamscandalampengaplikasianconvexhull AT iputuekanilakencana pengklasifikasiandebiturdenganmenggunakanalgoritmagrahamscandalampengaplikasianconvexhull |