On the randomized construction of the Delaunay tree
- 10 May 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 112 (2) , 339-354
- https://doi.org/10.1016/0304-3975(93)90024-n
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Higher-dimensional voronoi diagrams in linear expected timeDiscrete & Computational Geometry, 1991
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- On the complexity ofd- dimensional Voronoi diagramsArchiv der Mathematik, 1980
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978