On lazy randomized incremental construction
- 1 October 1995
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 14 (3) , 261-286
- https://doi.org/10.1007/bf02570705
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Four results on randomized incremental constructionsComputational Geometry, 1993
- On the randomized construction of the Delaunay treeTheoretical Computer Science, 1993
- On the Zone Theorem for Hyperplane ArrangementsSIAM Journal on Computing, 1993
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Small-dimensional linear programming and convex hulls made easyDiscrete & Computational Geometry, 1991
- On the construction of abstract voronoi diagramsDiscrete & Computational Geometry, 1991
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988