# On the ultimate convex hull algorithm in practice

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

- Published in Pattern Recognition Letters 1985
DOI:10.1016/0167-8655(85)90039-X

Kirkpatrick and Seidel [I 3,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) algorithms are experimentally compared to the O(n log n) 'throw-away' algorithms of Akl, Devroye and… CONTINUE READING