Voronoi diagrams of set-theoretic solid models
- 1 September 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 12 (5) , 69-77
- https://doi.org/10.1109/38.156016
Abstract
The definition of a Voronoi diagram is extended to arbitrary set-theoretic solid models. A method for approximating such diagrams using recursive subdivision is described. The method relies on octrees, which have been used for computing the distances between whole solid models. Two- and three-dimensional images generated using the algorithm are presented.Keywords
This publication has 10 references indexed in Scilit:
- Concrete and Abstract Voronoi DiagramsPublished by Springer Nature ,1989
- Voronoi diagram for multiply-connected polygonal domains I: AlgorithmIBM Journal of Research and Development, 1987
- A sweepline algorithm for Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1986
- Better and faster pictures from solid modelsComputer-Aided Engineering Journal, 1986
- Medial Axis Transformation of a Planar ShapePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Continuous Skeletons from Digitized ImagesJournal of the ACM, 1969