Proximity problems for points on a rectilinear plane with rectangular obstacles

Rectilinear short path queries among rectangular obstacles

Rectilinear Path Problems among Rectilinear Obstacles Revisited

We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...

Efficient Rectilinear Steiner Tree Construction with Rectangular Obstacles

Rectilinear Steiner Minimal Tree (RSMT) is one of the key problems in VLSI/ULSI physical design [1]. Given n points in a plane, a RSMT problem is to connect these points through some extra points called Steiner points to achieve a tree with minimal total wire length [2-4]. With the trend toward IPblock-based SoC design, the macro cells, such as memories, logic blocks, present in the design as o...

Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane

Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...

Rectilinear Paths among Rectilinear Obstacles

Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, 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 rectilinea...