Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Voronoi Diagrams of Set-Theoretic solid Models
IEEE Computer Graphics and Applications
On Dynamic Generalized Voronoi Diagrams in the Euclidean Metric
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Crystal Voronoi Diagram and Its Applications to Collision-Free Paths
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Approximations of 2D and 3D generalized Voronoi diagrams
International Journal of Computer Mathematics
| Hi-index | 0.00 |
An approach for computing a hierarchical approximation of planar Voronoi diagrams for different site shapes (points, line-segments, curve-arc segments, ...) and different distance functions (Euclidean metrics, convex distance functions, ...) was presented in [3]. The approach is based on the Voronoi-Quadtree, a quadtree data structure from which a polygonal approximation, represented by a DCEL structure, of the associated Voronoi region boundaries can be computed at different levels of detail. In this paper we describe efficient algorithms for dynamically maintaining, under the insertion or deletion of sites, the Voronoi-Quadtree and the corresponding DCEL structure representing an approximation of a Generalized Voronoi diagram.