Abstract
The problem of dynamic maintenance of the Voronoi diagram for a set of spheres moving independently in d-dimensional space is addressed in this paper. The maintenance of the generalized Voronoi diagram of spheres, moving alone the given trajectories, requires the calculation of topological events, that occur when d + 2 spheres become tangent to a common sphere. The criterion for determination of such a topological event for spheres in the Euclidean metric is presented. This criterion is given in the form of polynomial algebraic equations dependent on the coordinates and trajectories of the moving spheres. These equations are normally solved using numerical methods.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Atallah, M., Some dynamic computational geometry problems, Computers and Mathematics with Applications, 11 (1985) 1171–1181.
Aurenhammer, F. “Voronoi diagrams-A survey of a fundamental geometric data structure” ACM Computing Surveys, 23(3) (1991) 345–405.
Devillers, O., Golin, M., Kedem, K. and Schirra, S. “Revenge of the dog: queries on Voronoi diagrams of moving points” in Proc. of the 6th Canadian Conference on Computational Geometry, (1994) 122–127.
Dey, T. K., Sugihara K. and Bajaj, C. L. DT in three dimensions with finite precision arithmetic, Comp. Aid. Geom. Des 9(1992) 457–470
Dobrindt, K. and Yvinec, M. Remembering conflicts in history yields dynamic algorithms, in Proceedings of the 4th International Symposium on Algorithms and Computation (1993) 21–30.
Edelsbrunner, H. and Shah, N. Incremental topological flipping works for regular triangulations, Algorithmica, 15, (1996) 223–241
Fu, J. and Lee, R. Voronoi diagrams of moving points in the plane, Int. J. Comp. Geom. & Appl., 1(1) (1991) 23–32.
Gavrilova, M. Robust algorithm for finding nearest-neighbors under L-1, L-inf and power metrics in the plane, to appear in the Proceedings of the int. Conf. on Comp. Sciences 2001, San Francisco, USA (2001)
Gavrilova, M. and Rokne, J. An Efficient Algorithm for Construction of the Power Diagram from the Voronoi Diagram in the Plane, Intern. Jour. of Computer Math., Overseas Publishers Association, 61 (1997) 49–61.
Gavrilova, M. and Rokne, J. Swap conditions for dynamic VD for circles and line segments, Comp-Aid. Geom.Design 16 (1999) 89–106.
Gupta, P., Janardan, R. and Smid, M., Fast algorithms for collision and proximity problems involving moving geometric objects, Report MPI-I-94-113, Max-Planck-Insitut fur Informatik, Zaarbrucken (1994).
Hubbard, P. Approximating polyhedra with spheres for time-critical collision detection, ACM Transaction on Graphics, 15(3) (1996) 179–210.
Kim, D.-S., Kim, D. Sugihara, K. and Ryu, J. Most Robust Algorithm for a Circle Set Voronoi Diagram in a Plane, to appear in the Proc. of the Int. Conf. on Comp. Sciences’01, San Francisco, USA (2001)
Okabe, A., Boots, B. and Sugihara, K. Spatial tessellations: concepts and applications of Voronoi diagrams, John Wiley and Sons, Chichester, West Sussex, England, (1992) 205–208.
Roos, T. Voronoi diagrams over dynamic scenes, Discrete Appl. Mathem., Netherlands, 43(3) (1993) 243–259.
Schaudt, B. and Drysdale, R. Higher-dimensional Voronoi diagrams for convex distance functions, in Proceedings of the 4th Canadian Conference on Computational Geometry, (1992) 274–279.
Sugihara, K. Approximation of generalized Voronoi Diagrams by ordinary Voronoi diagrams, CVGIP: Graph. Models Image Process, 55 (1993) 522–531.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavrilova, M.L., Rokne, J. (2001). On Dynamic Generalized Voronoi Diagrams in the Euclidean Metric. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_78
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive