Analysis of a Simple Yet Efficient Convex Hull Algorithm
This paper is concerned with a simple, rather intuitive preprocessing step that is likely to improve the average-case performance of any convex hull algorithm. For n points randomly distributed in the unit square, we show that a simple linear pass through the points can eliminate all but O(sqrt n) of the
points by showing that a simple superset of the remaining points has size
c sqrt n + o(sqrt n). We give a full implementation of the method, which should be useful in any practical application for finding convex hulls. Most of the paper is concerned with an analysis of the number of points eliminated by the
procedure, including derivation of an exact expression for c. Extensions to higher dimensions are also considered.