Rectilinear Short Path Queries Among Rectangular Obstacles

Abstract Given a set of n disjoint rectangular obstacles in the plane whose edges are either vertical or horizontal, we consider the problem of processing rectilinear approximate shortest path queries between pairs of arbitrary query points. Our goal is to answer each approximate shortest path query quickly by constructing a data structure that captures path information in the obstacle-scattered plane. We present a data structure for rectilinear approximate shortest path queries that requires O(n log2 n) time to construct and O(n log n) space. This data structure enables us to report the length of an approximate shortest path between two arbitrary query points in O(log n) time and the actual path in O(log n + L) time, where L is the number of edges of the output path. If the query points are both obstacle vertices then the length and an actual path can be reported in O(1) and O(L) time respectively. The approximation factor for the approximate shortest paths that we compute is 3. The previously best known solution to this problem requires O(n log3 n) time and O(n log2 n) space to build a data structure, which supports length and actual path queries respectively in O(log2 n) and O(log2 n + L) time (regardless of the types of query points); the approximation factor for paths between arbitrary query points is 7.

[1]  Chak-Kuen Wong,et al.  Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles , 1987, IEEE Transactions on Computers.

[2]  Kenneth L. Clarkson,et al.  Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.

[3]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[4]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  Mikhail J. Atallah,et al.  Parallel Rectilinear Shortest Paths with Rectangular Obstacles , 1991, Comput. Geom..

[6]  Danny Ziyi Chen,et al.  Shortest path queries among weighted obstacles in the rectilinear plane , 1995, SCG '95.

[7]  Binay K. Bhattacharya,et al.  Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles , 1993, WADS.

[8]  Pinaki Mitra,et al.  Orthogonal shortest route queries among axis parallel rectangular obstacles , 1994, Int. J. Comput. Geom. Appl..

[9]  D. T. Lee,et al.  Rectilinear shortest paths in the presence of rectangular barriers , 1989, Discret. Comput. Geom..

[10]  Danny Ziyi Chen,et al.  On the all-pairs Euclidean short path problem , 1995, SODA '95.

[11]  Mikhail J. Atallah,et al.  On Parallel Rectilinear Obstacle- Avoiding Paths , 1993, Comput. Geom..

[12]  Der-Tsai Lee,et al.  Shortest rectilinear paths among weighted rectangles , 1989 .

[13]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[14]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[15]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[16]  Chee Yap,et al.  Rectilinear geodesics in 3-space , 1995 .

[17]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[18]  D. T. Lee,et al.  Shortest rectilinear paths among weighted obstacles , 1991, Int. J. Comput. Geom. Appl..

[19]  Uzi Vishkin,et al.  Finding Level-Ancestors in Trees , 1994, J. Comput. Syst. Sci..

[20]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[21]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.