On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach

We consider the problem of finding a rectilinear path between two designated points in the presence of rectilinear obstacles subject to various optimization functions in terms of the number of bends and the total length of the path. Specifically we are interested in finding a minimum bend shortest path, a shortest minimum bend path or a least-cost path where the cost is defined as a function of both the length and the number of bends of the path. We provide a unified approach by constructing a path-preserving graph guaranteed to preserve all these three kinds of paths and give an O(K+e log e) algorithm to find them, where e is the total number of obstacle edges, and K is the number of intersections between tracks from extreme point and other tracks (defined in the text). K is bounded by O(et), where t is the number of extreme edges. In particular, if the obstacles are rectilinearly convex, then K is O(ne), where n is the number of obstacles. Extensions are made to find a shortest path with a bounded number of bends and a minimum-bend path with a bounded length. When a source point and obstacles are pre-given, queries for the assorted paths from the source to given points can be handled in O(log n+k) time after O(K+e log e) preprocessing, where k is the size of the goal path. The trans-dichotomous algorithm of Fredman and Willard[8] and the running time for these problems are also discussed.

[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]  Joseph G. Peters,et al.  Smallest paths in simple rectilinear polygons , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Takao Asano,et al.  Dynamic Segment Intersection Search with Applications , 1984, FOCS.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[7]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

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

[9]  Micha Sharir,et al.  Computing the link center of a simple polygon , 1987, SCG '87.

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

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

[12]  Bernard Chazelle,et al.  Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[13]  Mark de Berg,et al.  Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric , 1990, SWAT.

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

[15]  Jörg-Rüdiger Sack,et al.  An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon , 1989, STACS.

[16]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[17]  Yan Ke,et al.  An efficient algorithm for link-distance problems , 1989, SCG '89.

[18]  S. Suri.  A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

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

[20]  D. T. Lee,et al.  Rectilinear shortest paths with rectangular barriers , 1985, SCG '85.

[21]  Joseph S. B. Mitchell,et al.  Minimum-link paths among obstacles in the plane , 1990, SCG '90.

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