Dynamic Euclidean minimum spanning trees and extrema of binary functions

Abstract

We maintain the minimum spanning tree of a point set in the plane subject to point insertions and deletions, in amortized time O(n1/2 log2 n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(ne ) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher dimensions, and to fully dynamic algorithms for maintaining minima of binary functions, including the diameter of a point set and the bichromatic farthest pair. © 1995 Springer-Verlag New York Inc.