A compact piecewise-linear voronoi diagram for convex sites in the plane
- 1 January 1996
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 15 (1) , 73-105
- https://doi.org/10.1007/bf02716580
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Randomized incremental construction of abstract Voronoi diagramsComputational Geometry, 1993
- Fully dynamic delaunay triangulation in logarithmic expected time per operationComputational Geometry, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Construction of the Voronoi diagram for 'one million' generators in single-precision arithmeticProceedings of the IEEE, 1992
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Moving a disc between polygonsAlgorithmica, 1991
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Computing the extreme distances between two convex polygonsJournal of Algorithms, 1985
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985