• DOI:10.1007/978-3-642-25011-8_21
Corpus ID: 40944371

Kinetic Euclidean Minimum Spanning Tree in the Plane

@inproceedings{Rahmati2011KineticEM,
  title={Kinetic Euclidean Minimum Spanning Tree in the Plane},
  author={Zahed Rahmati and Alireza Zarei},
  booktitle={IWOCA},
  year={2011}
}

Zahed Rahmati, Alireza Zarei

Published in IWOCA 2011

Mathematics, Computer Science

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed

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.