Kinetic Euclidean Minimum Spanning Tree in the Plane

  title={Kinetic Euclidean Minimum Spanning Tree in the Plane},
  author={Zahed Rahmati and Alireza Zarei},
  • Zahed Rahmati, Alireza Zarei
  • Published in IWOCA 2011
  • Mathematics, Computer Science
  • 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. 
    1 Citations

    Topics from this paper

    Kinetic Pie Delaunay Graph and Its Applications
    • 6


    Proximity problems on moving points
    • 96
    Minimum Spanning Trees of Moving Points in the Plane
    • 12
    Dynamic Euclidean minimum spanning trees and extrema of binary functions
    • D. Eppstein
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 1995
    • 88
    • PDF
    AnO(N logN) minimal spanning tree algorithm forN points in the plane
    • 12
    Data Structures for Mobile Data
    • 103
    • PDF
    On minimum and maximum spanning trees of linearly moving points
    • 36
    • PDF
    Voronoi Diagrams of Moving Points in the Plane
    • 45
    Parametric and kinetic minimum spanning trees
    • 61
    • PDF
    On the Randomized Construction of the Delaunay Tree
    • 100
    • PDF
    Randomized incremental construction of Delaunay and Voronoi diagrams
    • 363
    • PDF