@inproceedings{f9a7d354d8fe43a789a561cd15c66a55,

title = "Analysis of a simple yet efficient convex hull algorithm",

abstract = "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(√n) of the points by showing that a simple superset of the remaining points has size c√n + o(√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.",

author = "Mordecai Golin and Robert Sedgewick",

year = "1988",

month = jan,

day = "6",

doi = "10.1145/73393.73409",

language = "English (US)",

series = "Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988",

publisher = "Association for Computing Machinery, Inc",

pages = "153--163",

booktitle = "Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988",

note = "4th Annual Symposium on Computational Geometry, SCG 1988 ; Conference date: 06-06-1988 Through 08-06-1988",

}