Cutting hyperplanes for divide-and-conquer

This publication has 25 references indexed in Scilit:

• An optimal convex hull algorithm in any fixed dimension
  Discrete & Computational Geometry, 1993
• Cutting hyperplane arrangements
  Discrete & Computational Geometry, 1991
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications
  Theoretical Computer Science, 1991
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
  ACM Transactions on Graphics, 1990
• Probabilistic construction of deterministic algorithms: Approximating packing integer programs
  Journal of Computer and System Sciences, 1988
• A Randomized Algorithm for Closest-Point Queries
  SIAM Journal on Computing, 1988
• Linear programming in O(n × 3d) time
  Information Processing Letters, 1986
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
  SIAM Journal on Computing, 1984
• Linear Programming in Linear Time When the Dimension Is Fixed
  Journal of the ACM, 1984
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
  Theory of Probability & Its Applications, 1971