Minimum Spanning Trees of Moving Points in the Plane

Authors:
Jyh-Jong Fu;R. C. T. Lee
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 6
Cited 5

Computational geometry: an introduction

Computational geometry: an introduction
An o(n log n) minimal spanning tree algorithmn for n points in the plane

BIT
Filtering search: a new approach to query answering

SIAM Journal on Computing
A data structure for dynamic trees

Journal of Computer and System Sciences
Plane-sweep algorithms for intersecting geometric figures

Communications of the ACM
Computational geometry.

Computational geometry.

Sending messages to mobile users in disconnected ad-hoc wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Communication in disconnected ad hoc networks using message relay

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Kinetic euclidean minimum spanning tree in the plane

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Kinetic Euclidean minimum spanning tree in the plane

Journal of Discrete Algorithms
Kinetic pie delaunay graph and its applications

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

Quantified Score

Hi-index	14.98

Visualization

Abstract

Consideration is given to the following problem. Preprocess n moving points in a plane, such that the Euclidean minimum spanning tree of these points at a given time t can be reported efficiently. In the result, if the moving points are in k-motion, after an O(kn/sup 4/ log n) time preprocessing step and using O(m) space to store the preprocessing result, the Euclidean minimum spanning tree at t can be reported in O(n) time, where m denotes the number of changes of the Euclidean minimum spanning tree of these points from time t=0 to time t= infinity.