Abstract
The Voronoi diagram (VD) is a fundamental geometric structure in many applications. There are fast and simple algorithms to construct the VD of static point sets. For complex sites (i.e., other than points) the algorithms are more sophisticated, and a few efficient solutions exist. However, updating the VD of dynamic sites is still challenging, and efficient solutions exist only for points. We propose an algorithm for constructing and updating the VD of large dynamic sets of complex sites. Although existing incremental algorithms allow fast insertion of complex sites, this work presents the first efficient implementation of the removal operation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Jüttler, B., Pilgerstorfer, E., Rabl, M.: Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. Theory Appl. 43(8) (2010)
Alt, H., Schwarzkopf, O.: The Voronoi diagram of curved objects. In: SCG ’95: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 89–97 (1995)
Devillers, O.: On deletion in Delaunay triangulations. In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, pp. 181–188 (1999)
Fischer, I., Gotsman, C.: Fast approximation of high order Voronoi diagrams and distance transforms on the gpu. Tech. Rep. TR-07-05, Harvard University (2005)
Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: SCG ’86: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313–322 (1986)
Gold, C., Remmele, P., Roos, T.: Fully dynamic and kinematic Voronoi diagrams in gis. Algorithmica—Special Issue on Cartography and GIS (1998)
Green, P.J., Sibson, R.: Computing dirichlet tessellations in the plane. Comput. J. 21(2), 168–173 (1978)
Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi. ACM Trans. Graph. 4(2), 74–123 (1985)
Guibas, L.J., Mitchell, J.S.B.: Voronoi diagrams of moving points in the plane. In: WG ’91: Proceedings of the 17th International Workshop, pp. 113–125 (1992)
Held, M.: Voronoi: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. Comput. Geom. 18(2), 95–123 (2001)
Held, M., Huber, S.: Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments. Comput. Aided Des. 41(5), 327–338 (2009)
Hoff, K.E. III, Keyser, J., Lin, M., Manocha, D., Culver, T.: Fast computation of generalized Voronoi diagrams using graphics hardware. In: SIGGRAPH (1999)
Imai, T.: A topology oriented algorithm for the Voronoi diagram of polygons. In: Proc. of the 8th Canadian Conference on Computational Geometry, pp. 107–112 (1996)
Karavelas, M., Yvinec, M.: A topology oriented algorithm for the Voronoi diagram of polygons. In: European Symposium on Algorithms (2003)
Mostafavi, M.A., Gold, C., Dakowicz, M.: Dynamic Voronoi/Delaunay Methods and Applications (2003)
Pinto, F.d.M., Freitas, C.M.D.S.: Fast medial axis transform for planar domains with general boundaries. In: SIBGRAPI (2009)
Sud, A., Andersen, E., Curtis, S., Lin, M., Manocha, D.: Real-time path planning for virtual agents in dynamic environments. In: SIGGRAPH ’08: ACM SIGGRAPH 2008 Classes, pp. 1–9 (2008)
Yap, C.K.: An o (n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom. 2, 365–393 (1987)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pinto, F.d.M., Freitas, C.M.D.S. Dynamic Voronoi diagram of complex sites. Vis Comput 27, 463–472 (2011). https://doi.org/10.1007/s00371-011-0581-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-011-0581-z