Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
SCG '87 Proceedings of the third annual symposium on Computational geometry
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Rectilinear paths among rectilinear obstacles
Discrete Applied Mathematics
Gridless pin access in detailed routing
Proceedings of the 48th Design Automation Conference
A near linear time approximation scheme for steiner tree among obstacles in the plane
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.04 |
Given a set of n open rectangles that represent obstacles in the Euclidean plane, we consider the problem of finding a shortest rectilinear path between two given points such that each segment of the path has a certain minimum length. A rectilinear path consists of horizontal and vertical segments only and may not intersect with an obstacle. We show how to solve the resulting shortest path problem with minimum segment lengths in polynomial time by constructing an extended Hanan grid of the instance first, and then run an adapted shortest path algorithm to find a respective solution. While the extended Hanan grid as basic underlying structure can be stored in O(n^2) space, the approach yields an O(n^4logn) time and O(n^4) space algorithm. The problem at hand typically arises in the area of VLSI design, where rectilinear paths are utilized to create wiring interconnects. There, the lithographic production process dictates certain minimum run lengths for the wires in order to avoid infeasible patterns. Another application arises in robot motion planning when acceleration and breaking distances need to be obeyed.