Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
Top Cited Papers
- 1 January 2000
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 134 references indexed in Scilit:
- Algorithms for proximity problems in higher dimensionsComputational Geometry, 1996
- A linear-time construction of the relative neighborhood graph from the Delaunay triangulationComputational Geometry, 1994
- Computing a subgraph of the minimum weight triangulationComputational Geometry, 1994
- Four results on randomized incremental constructionsComputational Geometry, 1993
- Randomized incremental construction of abstract Voronoi diagramsComputational Geometry, 1993
- Constructing the Voronoi diagram of a set of line segments in parallelAlgorithmica, 1993
- Minimal roughness property of the Delaunay triangulation: a shorter approachComputer Aided Geometric Design, 1992
- There are planar graphs almost as good as the complete graphJournal of Computer and System Sciences, 1989
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- On the complexity ofd- dimensional Voronoi diagramsArchiv der Mathematik, 1980