A straightforward iterative algorithm for the planar Voronoi diagram
- 1 April 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 34 (3) , 155-160
- https://doi.org/10.1016/0020-0190(90)90095-f
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Delaunay triangulation and the convex hull ofn points in expected linear timeBIT Numerical Mathematics, 1984
- The spatial arrangement of random Voronoi polygonsComputers & Geosciences, 1983
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Delaunay Triangulation of a Random Data Set for Isarithmic MappingThe Cartographic Journal, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Simulation of nonhomogeneous poisson processes by thinningNaval Research Logistics Quarterly, 1979
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- The Monte-Carlo generation of random polygonsComputers & Geosciences, 1978
- On the homogeneous planar Poisson point processMathematical Biosciences, 1970