# Applications of random sampling in computational geometry, II

@inproceedings{Clarkson1988ApplicationsOR, title={Applications of random sampling in computational geometry, II}, author={Kenneth L. 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…

## Figures and Topics from this paper

## 1,118 Citations

Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental

- Computer Science, MathematicsSCG '88
- 1988

An algorithm of this kind is given for computing the intersection of a set of halfspaces in three dimensions, resulting in a Las Vegas algorithm for the diameter requiring n expected time.

Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems

- Computer Science, MathematicsSCG '94
- 1994

An optimal parallel randomized algorithm for the Voronoi diagram of a set of non-intersecting line segments in the plane using efficient randomized search techniques and random sampling at “two stages” of the algorithm.

Selecting distances in the plane

- Computer Science, MathematicsSCG '90
- 1990

A randomized algorithm for computing the smallest distance in a set of n points in the plane, based on the parametric search technique of Megiddo, and improves the previously best known upper bound.

A deterministic algorithm for partitioning arrangements of lines and its application

- Computer Science, MathematicsSCG '89
- 1989

This paper presents a deterministic algorithm which is faster than Matousk's recent algorithm [Ma] for large values of r, and applies it to several problems involving lines or segments in the plane, and obtain deterministic algorithms which are faster than any previously known algorithms.

Tail estimates for the space complexity of randomized incremental algorithms

- Mathematics, Computer ScienceSODA '92
- 1992

We give tail estimates for the space complexity of randomized incremental algorithms for line segment intersection in the plane. For <italic>n</italic> the number of segments, <italic>m</italic> is…

Constructing levels in arrangements and higher order Voronoi diagrams

- Computer Science, MathematicsSCG '94
- 1994

A simple lazy randomized incremental algorithm is given to compute ≤k-levels in arrangements of <italic>x-monotone Jordan curves in the plane, and in arrangement of planes in three-dimensional space.

On geometric optimization with few violated constraints

- Computer Science, MathematicsSCG '94
- 1994

A general algorithm is given for finding the best solution satisfying all but k of the given constraints for an abstract class of optimization problems introduced by Sharir and Welzl—the so-called LP-type problems.

Linear programming and convex hulls made easy

- Computer Science, MathematicsSCG '90
- 1990

Two randomized algorithms that solve linear programs involving constraints in d variables in expected time and construct convex hulls of n points in Rsupscrpt (3) with dependence of the time bound on d.

Vertical decompositions for triangles in 3-space

- Computer Science, MathematicsSCG '94
- 1994

A deterministic output-sensitive algorithm for computing the vertical decomposition of a set of n triangles in three-dimensional space is given that tries to perform as much of the computation in two-dimensional spaces as possible and thus is a good candidate for efficient implementations.

Almost optimal set covers in finite VC-dimension: (preliminary version)

- Computer Science, MathematicsSCG '94
- 1994

A deterministic polynomial time method for finding a set cover in a set system of VC-dimension such that the size of the cover is at most a factor of O(c) from the optimal size, and it is shown that in some cases, such as those that arise in 3-d polytope approximation and 2-d disc covering, the authors can quickly find O-sized covers.

## References

SHOWING 1-10 OF 59 REFERENCES

Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental

- Computer Science, MathematicsSCG '88
- 1988

An algorithm of this kind is given for computing the intersection of a set of halfspaces in three dimensions, resulting in a Las Vegas algorithm for the diameter requiring n expected time.

A deterministic algorithm for partitioning arrangements of lines and its application

- Computer Science, MathematicsSCG '89
- 1989

This paper presents a deterministic algorithm which is faster than Matousk's recent algorithm [Ma] for large values of r, and applies it to several problems involving lines or segments in the plane, and obtain deterministic algorithms which are faster than any previously known algorithms.

Halfspace range search: an algorithmic application of K-sets

- Computer Science, MathematicsSCG '85
- 1985

It is shown that the maximum number of&kgr;-sets realized by a set of n points in E3 is 3, which constitutes the only nontrivial upper bound, as a function of n and kgr, known to date.

Applications of random sampling in computational geometry, II

- Computer ScienceDiscret. Comput. Geom.
- 1989

Asymptotically tight bounds for (≤k)-sets are given, which are certain halfspace partitions of point sets, and a simple proof of Lee's bounds for high-order Voronoi diagrams is given.

Epsilon-nets and simplex range queries

- Computer Science, MathematicsSCG '86
- 1986

A new technique for half-space and simplex range query using random sampling to build a partition-tree structure and introduces the concept of anε-net for an abstract set of ranges to describe the desired result of this random sampling.

On k-hulls and related problems

- Mathematics, Computer ScienceSTOC '84
- 1984

Efficient computation of the 'cut' guaranteed by the classical 'Ham Sandwich theorem', faster preprocessing time for polygon retrieval, and theoretical improvements to a problem of intersecting lines and points posed by Hopcroft.

Polling: a new randomized sampling technique for computational geometry

- Mathematics, Computer ScienceSTOC '89
- 1989

A new randomized sampling technique, called Polling, is introduced which has applications to deriving efficient parallel algorithms for fundamental problems like the convex hull in three dimensions, Voronoi diagram of point sites on a plane and Euclidean minimal spanning tree.

A probabilistic algorithm for the post office problem

- Mathematics, Computer ScienceSTOC '85
- 1985

The algorithm employs random sampling, so the expected time holds for any set of points, and approaches the preprocessing time required for any algorithm constructing the Voronoi diagram of the input points.

New applications of random sampling in computational geometry

- Mathematics, Computer ScienceDiscret. Comput. Geom.
- 1987

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…

Partition trees for triangle counting and other range searching problems

- Computer Science, MathematicsSCG '88
- 1988

Bounds for space and query time are optimal up to polylog — factors and the preprocessing time for the data structures is polynomial according to recent results by Chazelle.