Loading...

Kinetic Euclidean minimum spanning tree in the plane

Rahmati, Z ; Sharif University of Technololgy | 2011

520 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-25011-8_21
  3. Publisher: 2011
  4. Abstract:
  5. 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
  6. Keywords:
  7. Computational geometry ; Euclidean minimum spanning tree ; kinetic data structures ; Euclidean minimum spanning trees ; Kinetic data structure ; kinetic data structures ; Performance parameters ; Preprocessing time ; Algorithms ; Data structures ; Kinetics ; Parallel architectures ; Trees (mathematics)
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 7056 LNCS , 2011 , Pages 261-274 ; 03029743 (ISSN) ; 9783642250101 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-25011-8_21