|
ABSTRACT
This paper discusses a new line-routing algorithm. The algorithm has been programmed in FORTRAN II for the IBM 7094 and in FORTRAN IV for the IBM 360/65. It has given good results when applied to many line-routing problems such as mazes, printed circuit boards, substrates, and PERT diagrams. The main advantages of this algorithm, which is based on the continuous plane, over conventional algorithms based on the discrete plane are twofold: 1. Since the algorithm is based on the continuous plane, there is theoretically no limit to the degree of precision used to describe the position of points. In practice, the only factor restricting the precision is the magnitude of the largest (or smallest) number which may be stored in a computer. As a result, the nodes on a printed circuit board, for example, can be input with mil accuracy. If this feat were to be accomplished by existing methods on a 9×9 inch board, a matrix of 81,000,000 cells would have to be stored (and searched) in the computer. 2. The algorithm stores only line segments; therefore to find a path, only the segments that are currently defined need be investigated. Usually with conventional methods, every cell that lies on every possible minimal path must be investigated. The net result is that this algorithm is much faster than the conventional method.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
C. Y. Lee, "An Algorithm for Path Connections and Its Applications," IRE Transactions on Electronic Computers; pp. 346 through 365, September, 1961.
|
CITED BY 85
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Joseph Dao , Nobu Matsumoto , Tsuneo Hamai , Chusei Ogawa , Shojiro Mori, A compaction method for full chip VLSI layouts, Proceedings of the 30th international conference on Design automation, p.407-412, June 14-18, 1993, Dallas, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ikuo Nishioka , Takuji Kurimoto , Hisao Nishida , Seiji Yamamoto , Toru Chiba , Toshiaki Nagakawa , Takatsugu Fujioka , Masashi Uchino, An automatic routing system for high density multilayer printed wiring boards, Proceedings of the 17th conference on Design automation, p.520-527, June 23-25, 1980, Minneapolis, Minnesota, United States
|
|
|
Thorsten Adler , Hiltrud Brocke , Lars Hedrich , Erich Barke, A current driven routing and verification methodology for analog applications, Proceedings of the 37th conference on Design automation, p.385-389, June 05-09, 2000, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
William A. Dees, Jr. , Robert J. Smith, II, Performance of interconnection rip-up and reroute strategies, Proceedings of the 18th conference on Design automation, p.382-390, June 29-July 01, 1981, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
Y. Fujihara , Y. Sekiyama , Y. Ishibashi , M. Yanaka, DYNAJUST: an efficient automatic routing technique optimizing delay conditions, Proceedings of the 26th ACM/IEEE conference on Design automation, p.791-794, June 25-28, 1989, Las Vegas, Nevada, United States
|
|
|
|
|
|
Phiroze N. Parakh , Richard B. Brown , Karem A. Sakallah, Congestion driven quadratic placement, Proceedings of the 35th annual conference on Design automation, p.275-278, June 15-19, 1998, San Francisco, California, United States
|
|
|
|
|
|
Le-Chin Eugene Liu , Hsiao-Ping Tseng , Carl Sechen, Chip-level area routing, Proceedings of the 1998 international symposium on Physical design, p.197-204, April 06-08, 1998, Monterey, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michael J. Lorenzetti , Robert J. Smith, II, An implementation of a saturated zone multi-layer printed circuit board router, Proceedings of the 17th conference on Design automation, p.255-262, June 23-25, 1980, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
W. Heyns , W. Sansen , H. Beke, A line-expansion algorithm for the general routing problem with a guaranteed solution, Proceedings of the 17th conference on Design automation, p.243-249, June 23-25, 1980, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
K. R. Stevens , W. M. vanCleemput , T. C. Bennett , J. A. Hupp, Implementation of an interactive printed circuit design system, Proceedings of the 15th conference on Design automation, p.74-81, June 19-21, 1978, Las Vegas, Nevada, United States
|
|
|
G. Persky , C. Enger , D. M. Selove, The Hughes Automated Layout System - automated LSI/VLSI layout based on channel routing, Proceedings of the 18th conference on Design automation, p.22-28, June 29-July 01, 1981, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
W. L. Schiele , Th. Krüger , K. M. Just , F. H. Kirsch, A gridless router for industrial design rules, Proceedings of the 27th ACM/IEEE conference on Design automation, p.626-631, June 24-27, 1990, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yiyu Shi , Tong Jing , Lei He , Zhe Feng , Xianlong Hong, CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model, Proceedings of the 2006 conference on Asia South Pacific design automation, January 24-27, 2006, Yokohama, Japan
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yu Hu , Tong Jing , Xianlong Hong , Zhe Feng , Xiaodong Hu , Guiying Yan, An-OARSMan: obstacle-avoiding routing tree construction with good length performance, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
|
|
|
|
|
|
Zhe Feng , Yu Hu , Tong Jing , Xianlong Hong , Xiaodong Hu , Guiying Yan, An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane, Proceedings of the 2006 international symposium on Physical design, April 09-12, 2006, San Jose, California, USA
|
|
|
|
|
|
Chung-Wei Lin , Szu-Yu Chen , Chi-Feng Li , Yao-Wen Chang , Chia-Lin Yang, Efficient obstacle-avoiding rectilinear steiner tree construction, Proceedings of the 2007 international symposium on Physical design, March 18-21, 2007, Austin, Texas, USA
|
|
|
|
|
|
|
|
|
|
|
|
T C. Bennett , K. R. Stevens , W. M. vanCleemput, Dynamic design rule checking in an interactive printed circuit editor, Proceedings of the 16th Conference on Design automation, p.330-336, June 25-27, 1979, San Diego, CA, United States
|
|
|
W. A. Dees , K. M. Parmar , A. Goyal , R. Y. Tsui , B. D. Rathi , R. J. Smith, II, A computer-aided VLSI layout system, Proceedings of the May 4-7, 1981, national computer conference, May 04-07, 1981, Chicago, Illinois
|
|
|
|
|
|
Tom Tong Jing , Yu Hu , Zhe Feng , Xian-Long Hong , Xiaodong Hu , Guiying Yan, A full-scale solution to the rectilinear obstacle-avoiding Steiner problem, Integration, the VLSI Journal, v.41 n.3, p.413-425, May, 2008
|
|
|
Daniel M. Tracy , W. Randolph Franklin , Barbara Cutler , Franklin T. Luk , Marcus Andrade, Path planning on a compressed terrain, Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, November 05-07, 2008, Irvine, California
|
|
|
|
|
|
|
|