• DOI:10.1145/73393.73394
Corpus ID: 15134654

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}
}

K. Clarkson

Published in SCG '88 1988

Mathematics, Computer Science

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

View on ACM

cs.duke.edu

Save to Library

Create Alert

Cite

Launch Research Feed