Abstract
In this paper we present a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points in the plane. The novelty in our approach is that we use the dual of the additively weighted Voronoi diagram to represent it. This permits us to perform both insertions and deletions of sites easily. Given a set B of n sites, among which h sites have a non-empty cell, our algorithm constructs the additively weighted Voronoi diagram of B in O(nT(h) + h log h) expected time, where T(k) is the time to locate the nearest neighbor of a query site within a set of k sites. Deletions can be performed for all sites whether or not their cell is empty. The space requirements for the presented algorithm is O(n). Our algorithm is simple to implement and experimental results suggest an O(n log h) behavior.
Work partially supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473(ECG - Effective Computational Geometry for Curves and Surfaces).
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
Drysdale, III, R.L., Lee, D. T.: Generalized Voronoi diagrams in the plane. In: Proc. 16th Allerton Conf. Commun. Control Comput. (1978) 833–842
Lee, D. T., Drysdale, III, R. L.: Generalization of Voronoi diagrams in the plane. SIAM J. Comput. 10 (1981) 73–87
Sharir, M.: Intersection and closest-pair problems for a set of planar discs. SIAM J. Comput. 14 (1985) 448–468
Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: Proc. 2nd Annu. ACM Sympos. Comput. Geom. (1986) 313–322
Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16 (1987) 78–96
Klein, R.: Concrete and Abstract Voronoi Diagrams. Volume 400 of Lecture Notes Comput. Sci. Springer-Verlag (1989)
Mehlhorn, K., Meiser, S., Ó’Dúnlaing, C.: On the construction of abstract Voronoi diagrams. Discrete Comput. Geom. 6 (1991) 211–224
Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory Appl. 3 (1993) 157–184
Kim, D. S., Kim, D., Sugihara, K.: Voronoi diagram of a circle set constructed from Voronoi diagram of a point set. In Lee, D. T., Teng, S.H., eds.: Proc. 11th Inter. Conf. ISAAC 2000. Volume 1969 of LNCS., Springer-Verlag (2000) 432–443
Karavelas, M. I., Emiris, I. Z.: Predicates for the planar additively weighted Voronoi diagram. Technical Report ECG-TR-122201-01, INRIA Sophia-Antipolis (2002)
Karavelas, M. I., Yvinec, M.: Dynamic additively weighted Voronoi diagrams in 2D. Technical Report No. 4466, INRIA Sophia-Antipolis (2002)
Devillers, O.: Improved incremental randomized Delaunay triangulation. In: Proc. 14th Annu. ACM Sympos. Comput. Geom. (1998) 106–115
Karavelas, M.: Proximity Structures for Moving Objects in Constrained and Unconstrained Environments. PhD thesis, Stanford University (2001)
The CGAL Reference Manual. (2001) Release 2.3, http://www.cgal.org.
Pion, S.: Interval arithmetic: An efficient implementation and an application to computational geometry. In: Workshop on Applications of Interval Analysis to systems and Control. (1999) 99–110
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karavelas, M.I., Yvinec, M. (2002). Dynamic Additively Weighted Voronoi Diagrams in 2D. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_52
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive