eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-06-11
65:1
65:2
10.4230/LIPIcs.SoCG.2019.65
article
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)
Löffler, Maarten
1
Dept. of Information and Computing Sciences, Utrecht University, The Netherlands
We have verified experimentally that there is at least one point set on which Andrew’s algorithm (based on Graham’s scan) to compute the convex hull of a set of points in the plane is significantly faster than a brute-force approach, thus supporting existing theoretical analysis with practical evidence. Specifically, we determined that executing Andrew’s algorithm on the point set P = {(1,4), (2,8), (3,10), (4,1), (5,7), (6,3), (7,9), (8,5), (9,2), (10,6)} takes 41 minutes and 18 seconds; the brute-force approach takes 3 hours, 49 minutes, and 5 seconds.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol129-socg2019/LIPIcs.SoCG.2019.65/LIPIcs.SoCG.2019.65.pdf
convex hull
efficiency