Computing a Face in an Arrangement of Line Segments and Related Problems
- 1 December 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (6) , 1286-1302
- https://doi.org/10.1137/0222077
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- A fast planar partition algorithm, IJournal of Symbolic Computation, 1990
- An optimal algorithm for the boundary of a cell in a union of raysAlgorithmica, 1990
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- On the general motion-planning problem with two degrees of freedomDiscrete & Computational Geometry, 1989
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988