Authors:

AGUS EKA ARIESTA, G.K. GANDHIADI, NI KETUT TARI TASTRAWATI, I PUTU EKA NILA KENCANA

Abstract:

“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%.”

Keywords

Keyword Not Available

Downloads:

Download data is not yet available.

References

References Not Available

PDF:

https://jurnal.harianregional.com/mtk/full-7843

Published

2013-11-29

How To Cite

ARIESTA, AGUS EKA et al. PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL.E-Jurnal Matematika, [S.l.], v. 2, n. 4, p. 46-52, nov. 2013. ISSN 2303-1751. Available at: https://jurnal.harianregional.com/mtk/id-7843. Date accessed: 28 Aug. 2025. doi:https://doi.org/10.24843/MTK.2013.v02.i04.p058.

Citation Format

ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian

Issue

Vol 2 No 4 (2013)

Section

Articles

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License