Applications of random sampling in computational geometry, II
@inproceedings{Clarkson1988ApplicationsOR, title={Applications of random sampling in computational geometry, II}, author={K. Clarkson}, booktitle={SCG '88}, year={1988} }
Random sampling is used for several new geometric algorithms. The algorithms are “Las Vegas,” and their expected bounds are with respect to the random behavior of the algorithms. One algorithm reports all the intersecting pairs of a set of line segments in the plane, and requires <italic>&Ogr;</italic>(<italic>A</italic> + <italic>n</italic> log <italic>n</italic>) expected time, where <italic>A</italic> is the size of the answer, the number of intersecting pairs reported. The algorithm… CONTINUE READING
Figures and Topics from this paper
Figures
1,081 Citations
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
- Mathematics, Computer Science
- SCG '88
- 1988
- 65
Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems
- Mathematics, Computer Science
- SCG '94
- 1994
- 18
A deterministic algorithm for partitioning arrangements of lines and its application
- Mathematics, Computer Science
- SCG '89
- 1989
- 30
Tail estimates for the space complexity of randomized incremental algorithms
- Mathematics, Computer Science
- SODA '92
- 1992
- 5
Constructing levels in arrangements and higher order Voronoi diagrams
- Mathematics, Computer Science
- SCG '94
- 1994
- 109
- PDF
Almost optimal set covers in finite VC-dimension: (preliminary version)
- Mathematics, Computer Science
- SCG '94
- 1994
- 41