A sweepline algorithm for Voronoi diagrams
- 1 November 1987
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 2 (1-4), 153-174
- https://doi.org/10.1007/bf01840357
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Making data structures persistentPublished by Association for Computing Machinery (ACM) ,1986
- Computational GeometryPublished by Springer Nature ,1985
- Voronoi diagrams based on convex distance functionsPublished by Association for Computing Machinery (ACM) ,1985
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Medial Axis Transformation of a Planar ShapeIEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978