• DOI:10.1016/0167-8655(85)90039-X
Corpus ID: 14501096

On the ultimate convex hull algorithm in practice

@article{McQueen1985OnTU,
  title={On the ultimate convex hull algorithm in practice},
  author={M. M. McQueen and G. Toussaint},
  journal={Pattern Recognit. Lett.},
  year={1985},
  volume={3},
  pages={29-34}
}

• M. M. McQueen, G. Toussaint
• Published 1985
• Mathematics, Computer Science
• Pattern Recognit. Lett.

Kirkpatrick and Seidel [13,14] recently proposed an algorithm for computing the convex hull of n points in the plane that runs in O(n log h) worst case time, where h denotes the number of points on the convex hull of the set. Here a modification of their algorithm is proposed that is believed to run in O(n) expected time for many reasonable distributions of points. The above O(n log h) algorithmsare experimentally compared to the O(n log n) 'throw-away' algorithms of Akl, Devroye and Toussaint… Expand

View via Publisher

cgm.cs.mcgill.ca

Save to Library

Create Alert

Cite

Launch Research Feed