License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2019.65
URN: urn:nbn:de:0030-drops-104690
Go to the corresponding LIPIcs Volume Portal

Löffler, Maarten

A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)

LIPIcs-SoCG-2019-65.pdf (3 MB)


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.

BibTeX - Entry

  author =	{Maarten L{\"o}ffler},
  title =	{{A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)}},
  booktitle =	{35th International Symposium on Computational Geometry (SoCG 2019)},
  pages =	{65:1--65:2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-104-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{129},
  editor =	{Gill Barequet and Yusu Wang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-104690},
  doi =		{10.4230/LIPIcs.SoCG.2019.65},
  annote =	{Keywords: convex hull, efficiency}

Keywords: convex hull, efficiency
Collection: 35th International Symposium on Computational Geometry (SoCG 2019)
Issue Date: 2019
Date of publication: 11.06.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI