• DOI:10.1016/j.jda.2012.04.009
Corpus ID: 12225368

Kinetic Euclidean minimum spanning tree in the plane

@article{Rahmati2012KineticEM,
  title={Kinetic Euclidean minimum spanning tree in the plane},
  author={Zahed Rahmati and Alireza Zarei},
  journal={J. Discrete Algorithms},
  year={2012},
  volume={16},
  pages={2-11}
}

Zahed Rahmati, Alireza Zarei

Published 2012

Mathematics, Computer Science

J. Discrete Algorithms

This paper presents a kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set of moving points in 2-dimensional space. For a set of n points moving in the plane we build a KDS of size O(n) in O(nlogn) preprocessing time by which the EMST is maintained efficiently during the motion. This is done by applying the required changes to the combinatorial structure of the EMST which is changed in discrete timestamps. We assume that the motion of the points, i… CONTINUE READING

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed