Computational geometry: an introduction
Computational geometry: an introduction
Introduction to Solid Modeling
Introduction to Solid Modeling
On the computational geometry of pocket machining
On the computational geometry of pocket machining
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams
CVGIP: Graphical Models and Image Processing
Swap conditions for dynamic Voronoi diagrams for circles and line segments
Computer Aided Geometric Design
Voronoi diagram of a circle set from Voronoi diagram of a point set: topology
Computer Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Experimental study on acceleration of an exact-arithmetic geometric algorithm
SMA '97 Proceedings of the 1997 International Conference on Shape Modeling and Applications (SMA '97)
Generalized voronoi diagrams and geometric searching.
Generalized voronoi diagrams and geometric searching.
On Dynamic Generalized Voronoi Diagrams in the Euclidean Metric
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
| Hi-index | 0.01 |
Robust and fast computation of the exact Voronoi diagram of circle set is difficult. Presented in this paper is an edge-flipping algorithm that computes a circle set Voronoi diagram using a point set Voronoi diagram, where the points are the centers of circles. Hence, the algorithm is as robust as its counterpart of point set. Even though the theoretical worst-case time complexity is quadratic, the actual performance shows a strong linear time behavior for various test cases. Furthermore, the computation time is comparable to the algorithm of point set Voronoi diagram itself.