Maintaining proximity in higher dimensional spaces
Dynamic computational geometry is concerned with the maintenance of geometric data structures over time. In the present work we investigate the behavior of spatial nearestneighbor Voronoi diagrams and planar higher-order Voronoi diagrams under continuous motions of the underlying sites. Nevertheless, the methodology presented is interesting in itself and can be applied to many other geometric data structures in computational geometry, as well.
In this paper, we consider a set of n points moving continuously along given trajectories in d-dimensional Euclidean space, d≥3. At each instant, the points define a Voronoi diagram which changes continuously except of certain critical instants, so-called topological events. At first, we classify the events which appear in the d-dimensional nearest-neighbor Voronoi diagram and outline an O(n d λ s (n)) upper bound on the number of topological events. Thereby λ s (n) denotes the maximum length of a (n, s)-Davenport-Schinzel sequence, and s is a constant depending on the underlying trajectories of the moving sites.
Next, we apply our methodology to planar order-m Voronoi diagrams, m- 1,..., n−1. The basic result in this context is that topological events affect at most three successive orders of Voronoi diagrams. Additionally, we give a tight O(n 4) upper bound on the number of topological events which appear in all order-m Voronoi diagrams.
Both cases allow simple and numerically stable algorithms for maintaining the corresponding Voronoi diagram(s) over time using only O(log n) time per event, which is worstcase optimal. This work generalizes the most recent results by [FuLe 91], [GuMiRo 91] and [ImIm 90] to three and higher dimensions as well as higher orders.
KeywordsTopological Structure Voronoi Diagram Computational Geometry Dual Graph Topological Event
Unable to display preview. Download preview PDF.
- [Al 91]G. Albers, Three-Dimensional Dynamic Voronoi Diagrams (in German), Diploma thesis, University of Würzburg, July 1991Google Scholar
- [AlRo 92]G. Albers, T. Roos, Voronoi Diagrams of Moving Points in Higher Dimensional Spaces, Proceedings of the Third Scandinavian Workshop on Algorithm Theory SWAT'92, Helsinki, July 1992, to appear in LNCSGoogle Scholar
- [AoImTo 90]H. Aonuma, H. Imai, K. Imai and T. Tokuyama, Maximin Locations of Convex Objects and Related Dynamic Voronoi Diagrams, Proc. 6th ACM Symposium on Computational Geometry, Berkeley, 1990, pp 225–234Google Scholar
- [Au 90]F. Aurenhammer, Voronoi Diagrams — A Survey of a Fundamental Data Structure, Report B 90-09, FB Mathematik, Serie B Informatik, Nov. 1990Google Scholar
- [EdO'RoSe 86]
- [FuLe 91]
- [GuSt 85]
- [GuMiRo 91]L. Guibas, J.S.B. Mitchell and T. Roos, Voronoi Diagrams of Moving Points in the Plane, Proc. 17th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 570, pp 113–125Google Scholar
- [ImIm 90]H. Imai and K. Imai, Voronoi Diagrams of Moving Points, Proc. Int. Computer Symp., Taiwan, 1990, pp 600–606Google Scholar
- [Ro 90]T. Roos, Voronoi Diagrams over Dynamic Scenes (Extended Abstract), Proceedings 2nd Canadian Conference on Computational Geometry, Ottawa, 1990, pp 209–213Google Scholar
- [Ro 91]T. Roos, Dynamic Voronoi Diagrams, PhD Thesis, University of Würzburg, Sept. 1991Google Scholar
- [RoNo 91]T. Roos and H. Noltemeier, Dynamic Voronoi Diagrams in Motion Planning: Combining Local and Global Strategies, Proc. 15th IFIP Conference on System Modeling and Optimization, Zurich, 1991Google Scholar
- [Se 90]R. Seidel, Linear Programming and Convex Hulls Made Easy, Proc. 6th ACM Symposium on Computational Geometry, Berkeley, 1990, pp 212–215Google Scholar
- [SuIr 89]K. Sugihara and M. Iri, Construction of the Voronoi Diagram for One Million Generators in Single-Precision Arithmetic, private communications, 1989Google Scholar