AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
- 1 December 1987
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 2 (4) , 365-393
- https://doi.org/10.1007/bf02187890
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagramAlgorithmica, 1987
- Generalized voronoi diagrams for moving a ladder. I: Topological analysisCommunications on Pure and Applied Mathematics, 1986
- Intersection and Closest-Pair Problems for a Set of Planar DiscsSIAM Journal on Computing, 1985
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- Voronoi Diagram in the Laguerre Geometry and Its ApplicationsSIAM Journal on Computing, 1985
- A fast algorithm for polygon containment by translationPublished by Springer Nature ,1985
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage ApplicationsSIAM Journal on Computing, 1980