Parallel Rectilinear Shortest Paths with Rectangular Obstacles

Abstract Atallah, M.J. and D.Z. Chen, Parallel rectilinear shortest paths with rectangular obstacles, Computational Geometry: Theory and Applications 1 (1991) 79-113. Given a rectilinear convex polygon P having O(n) vertices and which contains n pairwise disjoint rectangular rectilinear obstacles, we compute, in parallel, a data structure that supports queries about shortest rectilinear obstacle-avoiding paths in P. That is, a query specifies a source and a destination, and the data structure enables efficient processing of the query. We construct the data structure in O(log2n) time, with O(n2/log2n) processors in the CREW- PRAM model if all queries are such that the source and the destination are on the boundary of P, with O(n2/logn) processors if the source is an obstacle vertex and the destination is on the boundary of P, and with O(n2) processors if both the source and destination are arbitrary points in the plane. The data structure we compute enables one processor to obtain the path length for any pair of query vertices (of obstacles or of P) in constant time, or O(⌈k/logn⌉) processors to retrieve the shortest path itself in logarithmic time, where k is the number of segments of that path. If the two query points are arbitrary rather than vertices, then one processor takes O(logn) time (instead of constant time) for finding the path length, while the complexity bounds for reporting an actual shortest path remain unchanged. A number of other related shortest paths problems are solved. The techniques we use involve a fast computation of staircase separators, and a scheme for partitioning the obstacles' boundaries in a way that ensures that the resulting path length matrices have a monotonicity property that is apparently absent before applying our partitioning scheme. Sequentially, the data structure can be built in O(n2) time.

[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]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

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

[4]  Chak-Kuen Wong,et al.  On the X-Y convex hull of a set of X-Y polygons , 1983, BIT Comput. Sci. Sect..

[5]  James A. Storer,et al.  3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles , 1988, MFCS.

[6]  Alok Aggarwal,et al.  Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version) , 1988, FOCS 1988.

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

[8]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[9]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[10]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[11]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[12]  Joseph S. B. Mitchell,et al.  Shortest Rectilinear Paths Among Obstacles , 1987 .

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

[14]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[15]  D. T. Lee,et al.  Shortest rectilinear paths among weighted obstacles , 1990, SCG '90.

[16]  Michael T. Goodrich,et al.  Parallel methods for visibility and shortest path problems in simple polygons (preliminary version) , 1990, SCG '90.

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

[18]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[19]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[20]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[21]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[22]  Uzi Vishkin,et al.  Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[23]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[24]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[25]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[26]  Mikhail J. Atallah,et al.  Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[27]  Joseph O'Rourke,et al.  Shortest Paths on Polyhedral Surfaces , 1985, STACS.

[28]  Chak-Kuen Wong,et al.  On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..