Open AccessPerbandingan Algoritma Convex Hull: Jarvis March dan Graham Scan
Author(s) -
Fenina Adline Twince Tobing,
Prayogo Prayogo
Publication year - 2020
Publication title -
ultimatics : jurnal ilmu teknik informatika/ultimatics : jurnal teknik informatika
Language(s) - English
Resource type - Journals
eISSN - 2581-186X
pISSN - 2085-4552
DOI - 10.31937/ti.v12i2.1800
Subject(s) - convex hull , algorithm , point (geometry) , regular polygon , computer science , hull , output sensitive algorithm , mathematical optimization , mathematics , convex combination , engineering , convex optimization , geometry , marine engineering
Comparison of algorithms is needed to determine the level of efficiency of an algorithm. The existence of a speed comparison in an algorithm that will make a unique shape is sometimes a problem that must be solved by comparing one algorithm with another. This problem can be solved by using Jarvis March and Graham Scan where this algorithm will create a unique shape of a point followed by testing the speed comparison of the two algorithms and the result can be stated that the Graham Scan algorithm in general works faster than the algorithm Jarvis March.