A linear-time algorithm for computing the voronoi diagram of a convex polygon
- 1 December 1989
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (6), 591-604
- https://doi.org/10.1007/bf02187749
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An optimal algorithm for constructing the Delaunay triangulation of a set of line segmentsPublished by Association for Computing Machinery (ACM) ,1987
- Constrained Delaunay triangulationsPublished by Association for Computing Machinery (ACM) ,1987
- Generalized delaunay triangulation for planar graphsDiscrete & Computational Geometry, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- The medial axis of a simple polygonLecture Notes in Computer Science, 1977