On the ultimate convex hull algorithm in practice

  title={On the ultimate convex hull algorithm in practice},
  author={Mary M. McQueen and Godfried T. Toussaint},
  journal={Pattern Recognition Letters},
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

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.

A note on linear expected time algorithms for finding convex hulls

  • L. Devroye, G.T
  • Computing
  • 1981

A timeand-storage efficient implementation of an optimal planar convex hull algorithm

  • B. K. Bhattacharya, G.T
  • Technical Report No. SOCS-81.40,
  • 1981

Personal Communication to G . Toussaint as described in Toussaint , G . T . ' Computational Geometric Problems in Pattern Recognition

  • J. Kittler, K. S. Fu, L. F. Pau
  • Pattern Recognition Theory and Applications…
  • 1981

Similar Papers

Loading similar papers…