An optimal convex hull algorithm and new results on cuttings
- 1 January 1991
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Optimal randomized parallel algorithms for computational geometryAlgorithmica, 1992
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- A singly-exponential stratification scheme for real semi-algebraic varieties and its applicationsPublished by Springer Nature ,1989
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- 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