Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aurenhammer, F.: Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3) (1991) 686–695
Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J. R., Urrutia, J. (eds): Handbook of Computational Geometry, Chapter 5. Elsevier Science Publishers (2000) 201–290
Boada, I., Coll, N., Sellarès, J.A.: Hierarchical Planar Voronoi Diagram Approximations. In: Wismath, S. (ed.): Proceedings of the 14th Canadian Conference on Computational Geometry (2002) 40–45
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Algorithms and applications. Springer-Verlag (2000)
Fu, J., Lee, R.: Voronoi diagrams of moving points in the plane. International Journal on Computational Geometry and Applications, 1(1) (1991) 23–32.
Gavrilova, M., Rokne, J.: On Dynamic Generalized Voronoi Diagrams in the Euclidean Metric. Lecture Notes in Computer Science 2073, Vol. 1. Springer-Verlag (2001) 673–682.
Gold C.: Voronoi Diagrams page on the Web: Applications. http://www.voronoi.com/section_1.htm
Ho., K., Culver, T., Keyser, J., Lin, M., Manocha, D.: Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware. Proceedings of SIGGRAPH’99, ACM Press/Addison-Wesley (1999) 277–286
Kobayashi, K., Sugihara, K.; Crystal Growth Voronoi Diagram and its Applications to Collision-Free Paths. Lecture Notes in Computer Science 2073, Vol. 1. Springer-Verlag (2001) 738–747
Lavender, D., Bowyer, A., Davenport, J., Wallis, A., Woodwark, J.: Voronoi diagrams of set-theoretic solid models. Computer Graphics and Applications, 12(5) (1992) 69–77
Okabe, A., Boots, B., Sugihara, K., Chiu, S. N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons (2000)
Samet, H.: Applications of Spatial Data Structures: computer graphics, image processing, and GIS. Addison-Wesley (1990)
Teichmann, M., Teller, S.: Polygonal approximation of Voronoi diagrams of a set of triangles in three dimensions. Technical Report 766, Laboratory of Computer science, MIT (1997)
Vleugels, J., Overmars, M.: Approximating Generalized Voronoi Diagrams in Any Dimension. International Journal on Computational Geometry and Applications, 8 (1998) 201–221
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boada, I., Coll, N., Sellarès, J.A. (2003). Dynamically Maintaining a Hierarchical Planar Voronoi Diagram Approximation. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_85
Download citation
DOI: https://doi.org/10.1007/3-540-44842-X_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40156-8
Online ISBN: 978-3-540-44842-6
eBook Packages: Springer Book Archive