Abstract
This paper presents the first kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set of n moving points in 2-dimensional space. We build a KDS of size O(n) in O(nlogn) preprocessing time by which their EMST is maintained efficiently during the motion. In terms of the KDS performance parameters, our KDS is responsive, local, and compact.
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
Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning. In: 39th IEEE Sympos Found Comput Sci, pp. 596–605 (1998)
Basch, J.: Kinetic data structures. PhD Thesis, Stanford University (1999)
Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. Journal of Algorithms 31, 1–28 (1999)
Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: 13th Annual Symposium on Computational Geometry, pp. 344–351 (1997)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Santa Clara (2008)
Boissonnat, J.-D., Teillaud, M.: On the randomized construction of the Delaunay. Theoretical Computer Science 112, 339–354 (1993)
Chang, R.C., Lee, R.C.T.: An O(nlogn) minimal spanning tree algorithm for n points in the plane. BIT 26, 7–16 (1986)
Eppstein, D.: Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete and Computational Geometry 13, 111–122 (1995)
Fu, J.-J., Lee, R.C.T.: Minimum Spanning Trees of Moving Points in the Plane. IEEE Transactions on Computers 40, 113–118 (1991)
Guibas, L.J., Mitchell, J.S.B., Roos, T.: Voronoi Diagrams of Moving Points in the Plane. In: Proceedings of the 17th International Workshop, pp. 113–125 (1991)
Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7, 381–413 (1992)
Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 7, 48–50 (1956)
Katoh, N., Tokuyama, T., Iwano, K.: On minimum and maximum spanning trees of linearly moving points. Discrete and Computational Geometry 13, 161–176 (1995)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Tarjan, R.E.: Data structures and network algorithms. Society for Industrial and Applied Mathematics (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rahmati, Z., Zarei, A. (2011). Kinetic Euclidean Minimum Spanning Tree in the Plane. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2011. Lecture Notes in Computer Science, vol 7056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25011-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-25011-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25010-1
Online ISBN: 978-3-642-25011-8
eBook Packages: Computer ScienceComputer Science (R0)