M. Golin
R. Sedgewick
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 Ο(√n) of the points by showing that a simple superset of the remaining points has size c√n + ο(√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.
- BS.J.L. Bentley and M.I. Shamos, "Divide and Conquer for Linear Expected Time," Information Processing Letters 7(2) (Feb. 1978) 87-91.Google Scholar
Cross Ref
- DT.L. Devroye and G.T. Toussaint, "A Note on Linear Expected Time Algorithms for Finding Convex Hulls," Computing, 26 (1981) 361-366Google Scholar
- Ed.W.F. Eddy, "A new convex hull algorithm for planar sets," A CM Transactions on Mathematical Software, 3 (1977). Google ScholarDigital Library
- GS.G.R. Grimmet and D.R. Stirzaker, Probability and Random Processes, Clarendon Press, Oxford. (1985).Google Scholar
- OL.M.H. Overmars and J. van Leeuwen, "Further Comments on Bvkat's Convex Hull Algorithm," Information Processing Letters, 10(4,5) (July 1980) 209-212.Google ScholarCross Ref
- PS.F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer- Verlag, ,New York. (1985). Google ScholarDigital Library
- RS.A. R~nyi and R. Sulanke Ueb.r die kon vexe Hulle yon n zufallig gewahlten Punkten. I," Z. Wahrschien, 2 (1963) 75-84.Google ScholarCross Ref
- Ru.W. Rudin, Principles of Mathematical Analysis, 3d ed., McGraw Hill, New York. (1976).Google Scholar
- Se.R. Sedgewick, Algorithms, Addison-Wesley, Reading Mass. (1983). Google ScholarDigital Library
Index Terms
- Analysis of a simple yet efficient convex hull algorithm
Recommendations
Finding the convex hull of a simple polygon
We describe a new algorithm for finding the convex hull of any simple polygon specified by a sequence of m vertices. An earlier convex hull finder of ours is limited to polygons which remain simple (i.e., nonselfintersecting) when locally non-convex ...
-Concave hull, a generalization of convex hull
Bounding hulls such as convex hull, -shape, -hull, concave hull, crust, etc. offer a wide variety of useful applications. In this paper, we explore another bounding hull, namely -concave hull, as a generalization of convex hull. The parameter determines ...
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
Comments