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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Rahmati, Z., & Zarei, A. (2011). Kinetic Euclidean minimum spanning tree in the plane. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7056 LNCS, pp. 261–274). https://doi.org/10.1007/978-3-642-25011-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
