New applications of random sampling in computational geometry

@article{Clarkson1987NewAO,
  title={New applications of random sampling in computational geometry},
  author={K. Clarkson},
  journal={Discrete & Computational Geometry},
  year={1987},
  volume={2},
  pages={195-222}
}
  • K. Clarkson
  • Published 1987
  • Mathematics, Computer Science
  • Discrete & Computational Geometry
  • This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry. One new algorithm creates a search structure for arrangements of hyperplanes by sampling the hyperplanes and using information from the resulting arrangement to divide and conquer. This algorithm requiresO(sd+ε) expected preprocessing time to build a search structure for an arrangement ofs hyperplanes ind dimensions. The expectation, as with all expected times reported here, is… CONTINUE READING
    344 Citations
    A deterministic view of random sampling and its use in geometry
    • B. Chazelle, J. Friedman
    • Mathematics, Computer Science
    • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
    • 1988
    • 133
    • PDF
    Polling: a new randomized sampling technique for computational geometry
    • 47
    • PDF
    A deterministic view of random sampling and its use in geometry
    • 185
    • Highly Influenced
    Dynamic point location in arrangements of hyperplanes
    • 15
    Lines in space: Combinatorics and algorithms
    • 40
    • PDF
    On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
    • T. Chan, P. Lee
    • Mathematics, Computer Science
    • Symposium on Computational Geometry
    • 2014
    • Highly Influenced
    • PDF
    Optimal randomized parallel algorithms for computational geometry
    • 13
    • PDF
    The discrepancy method in computational geometry
    • B. Chazelle
    • Mathematics, Computer Science
    • Handbook of Discrete and Computational Geometry, 2nd Ed.
    • 2004
    • 28
    • PDF
    Random sampling in geometric optimization: new insights and applications
    • 15
    • Highly Influenced

    References

    SHOWING 1-10 OF 51 REFERENCES
    The power of geometric duality
    • 180
    Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
    • 65
    Voronoi Diagrams from Convex Hulls
    • K. Brown
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 1979
    • 294
    Optimum algorithms for two random sampling problems
    • J. Vitter
    • Computer Science
    • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
    • 1983
    • 16
    How to Search in History
    • 17
    • PDF
    Geometric Retrieval Problems
    • 27
    A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
    • 107
    The Ultimate Planar Convex Hull Algorithm?
    • 402
    • PDF
    Partition trees for triangle counting and other range searching problems
    • E. Welzl
    • Mathematics, Computer Science
    • SCG '88
    • 1988
    • 106
    • PDF