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
    9 Citations
    Kinetic and Stationary Point-Set Embeddability for Plane Graphs
    • 5
    • PDF
    A simple, faster method for kinetic proximity problems
    • 9
    • PDF
    Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d
    • 4
    • PDF
    Kinetic data structures for all nearest neighbors and closest pair in the plane
    • 7
    Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$
    • 3
    A Framework for Algorithm Stability
    • 3
    • PDF
    Stability of geometric algorithms
    • PDF
    Simple, Faster Kinetic Data Structures
    • 6

    References

    SHOWING 1-10 OF 21 REFERENCES
    Minimum Spanning Trees of Moving Points in the Plane
    • 12
    Voronoi Diagrams of Moving Points in the Plane
    • 45
    On minimum and maximum spanning trees of linearly moving points
    • 7
    • PDF
    Kinetic and dynamic data structures for convex hulls and upper envelopes
    • 22
    • PDF
    Dynamic Euclidean minimum spanning trees and extrema of binary functions
    • D. Eppstein
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 1995
    • 88
    • PDF
    On the Randomized Construction of the Delaunay Tree
    • 100
    • PDF
    Parametric and kinetic minimum spanning trees
    • 61
    • PDF
    Proximity problems on moving points
    • 96
    AnO(N logN) minimal spanning tree algorithm forN points in the plane
    • 12