An optimal convex hull algorithm in any fixed dimension
- 1 October 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (4) , 377-409
- https://doi.org/10.1007/bf02573985
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Small-dimensional linear programming and convex hulls made easyDiscrete & Computational Geometry, 1991
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971