On the ultimate convex hull algorithm in practice

Authors:
Mary M Mcqueen;Godfried T Toussaint
Affiliations:
School of Computer Science, McGill University, 805 Sherbrooke Street West, Montreal, Quebec H3A 2K6, Canada;School of Computer Science, McGill University, 805 Sherbrooke Street West, Montreal, Quebec H3A 2K6, Canada
Venue:
Pattern Recognition Letters
Year:
1985

Citing 8
Cited 1

A Lower Bound to Finding Convex Hulls

Journal of the ACM (JACM)
A New Convex Hull Algorithm for Planar Sets

ACM Transactions on Mathematical Software (TOMS)
An optimal real-time algorithm for planar convex hulls

Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The Ultimate Planar Convex Hull Algorithm ?

The Ultimate Planar Convex Hull Algorithm ?
Computational geometry.

Computational geometry.
Time bounds for selection

Journal of Computer and System Sciences

From Binary to Grey Scale Convex Hulls

Fundamenta Informaticae

Quantified Score

Hi-index	0.10

Visualization

Abstract

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 [2, 8, 20]. The results suggest that although the O(n Log h) algorithms may be the 'ultimate' ones in theory, they are of little practical value from the point of view of running time.