On routing two-terminal nets in the presence of obstacles

Consideration is given to the problem of routing k two-terminal nets in the presence of obstacles in two models: the standard two-layer model and the knock-knee model. Determining routability is known to be NP-complete for arbitrary k. The authors introduce a technique that reduces the general problem into finding edge-disjoint paths in a graph whose size depends only on the size of the obstacles. Two optimization criteria are considered: the total length of the wires and the number of vias used. >

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

[2]  Dana S. Richards,et al.  Optimal two-terminal α-β wire routing , 1986, Integr..

[3]  Kurt Mehlhorn,et al.  Routing through a rectangle , 1986, JACM.

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

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

[6]  Franco P. Preparata,et al.  Optimal Three-Layer Channel Routing , 1984, IEEE Transactions on Computers.

[7]  Ron Y. Pinter,et al.  Optimal Routing in Rectilinear Channels , 1981 .

[8]  Ron Y. Pinter.  On Routing Two-Point Nets Across a Channel , 1982, DAC 1982.

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

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

[11]  Dave Hightower,et al.  The interconnection problem: A tutorial , 1973, Computer.

[12]  Robert J. Smith,et al.  Performance of Interconnection Rip-Up and Reroute Strategies , 1981, 18th Design Automation Conference.

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

[14]  Thomas G. Szymanski.  Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  András Frank,et al.  Disjoint paths in a rectilinear grid , 1982, Comb..

[16]  Yossi Shiloach,et al.  A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.