Rectilinear Paths among Rectilinear Obstacles

Given a set of obstacles and two distinguished points in the plane the problem of finding a collision-free path subject to a certain optimization function is a fundamental problem that arises in many fields, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinear domain in which the goal path to be computed and the underlying obstacles are all rectilinearly oriented, i.e., the segments are either horizontal or vertical. We consider different routing environments, and various optimization criteria pertaining to VLSI design, and provide a survey of results that have been developed in the past, present current results and give open problems for future research.

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

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

[3]  Takao Asano,et al.  Generalized Manhattan path algorithm with applications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Michael L. Fredman,et al.  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

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

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

[7]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[8]  Mark de Berg,et al.  On Rectilinear Link Distance , 1991, Comput. Geom..

[9]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Willy M. C. Sansen,et al.  A Line-Expansion Algorithm for the General Routing Problem with a Guaranteed Solution , 1980, 17th Design Automation Conference.

[12]  Joseph G. Peters,et al.  Smallest paths in simple rectilinear polygons , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

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

[16]  Dave Hightower.  A solution to line-routing problems on the continuous plane , 1969, DAC '69.

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

[18]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[19]  Joseph S. B. Mitchell,et al.  The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.

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

[21]  Subhash Suri,et al.  On some link distance problems in a simple polygon , 1990, IEEE Trans. Robotics Autom..

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

[23]  Witold Lipski,et al.  An O(n log n) Manhattan Path Algorithm , 1984, Inf. Process. Lett..

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

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

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

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

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

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

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

[31]  David Eppstein,et al.  The expected extremes in a Delaunay triangulation , 1991, Int. J. Comput. Geom. Appl..

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

[33]  Chak-Kuen Wong,et al.  On bends and lengths of rectilinear paths: a graph theoretic approach , 1992, Int. J. Comput. Geom. Appl..

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

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

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

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