Kinetic euclidean minimum spanning tree in the plane

Authors:
Zahed Rahmati;Alireza Zarei
Affiliations:
Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran;Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran
Venue:
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Year:
2011

Citing 10
Cited 1

Data structures and network algorithms

Data structures and network algorithms
An o(n log n) minimal spanning tree algorithmn for n points in the plane

BIT
Minimum Spanning Trees of Moving Points in the Plane

IEEE Transactions on Computers
On the randomized construction of the Delaunay tree

Theoretical Computer Science
Proximity problems on moving points

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Data structures for mobile data

Journal of Algorithms
Voronoi Diagrams of Moving Points in the Plane

WG '91 Proceedings of the 17th International Workshop
Parametric and Kinetic Minimum Spanning Trees

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Kinetic data structures

Kinetic data structures
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications

Kinetic pie delaunay graph and its applications

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.