Cutting hyperplanes for divide-and-conquer
Open Access
- 1 February 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 9 (2) , 145-158
- https://doi.org/10.1007/bf02189314
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An optimal convex hull algorithm in any fixed dimensionDiscrete & Computational Geometry, 1993
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- A singly exponential stratification scheme for real semi-algebraic varieties and its applicationsTheoretical Computer Science, 1991
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- 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
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971