Abstract

We consider the following four problems for a set S of k points on a plane, equipped with the rectilinear metric and containing a set R of n disjoint rectangular obstacles (so that distance is measured by a shortest rectilinear path avoiding obstacles in R): (a) nd a closest pair of points in S, (b) nd a nearest neighbor for each point inS, (c) compute the rectilinear Voronoi diagram of S, and (d) compute a rectilinear minimal spanning tree of S. Wedescribe O((n + k) log(n + k)) time sequential algorithms for (a) and (b) based on plane-sweep, and the consideration of geometrically special types of shortest paths, so-called z- rst paths. For (c) we present an O((n + k) log(n + k)logn) time sequential algorithm that implements a sophisticated divide-and-conquer scheme with an added extension phase. In the extension phase of this scheme we introduce novel geometric structures, in particular so-called z-diagrams, and techniques associated with the Voronoi diagram. Problem (d) can be reduced to (c) and solved in O((n + k) log(n + k)logn) time as well. All our algorithms are near-optimal, as well as easy to implement.

Citations