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
    1,081 Citations
    Selecting distances in the plane
    • 59
    A deterministic algorithm for partitioning arrangements of lines and its application
    • P. Agarwal
    • Mathematics, Computer Science
    • SCG '89
    • 1989
    • 30
    Constructing levels in arrangements and higher order Voronoi diagrams
    • 109
    • PDF
    On geometric optimization with few violated constraints
    • 70
    Linear programming and convex hulls made easy
    • R. Seidel
    • Mathematics, Computer Science
    • SCG '90
    • 1990
    • 206
    Vertical decompositions for triangles in 3-space
    • 48
    • PDF