Finding obstacle-avoiding shortest paths using implicit connection graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 15, Issue 1, 1996, Pages 103-110

  Zheng, S Q ^a   Lim, Joon Shink ^a   Sitharma Lyengar, S ^a  

^a Louisiana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; PERFORMANCE; PROBLEM SOLVING; TREES (MATHEMATICS); VLSI CIRCUITS;

CONNECTION GRAPH; SHORTEST PATH; SPANNING TREE PROBLEM;

COMPUTER AIDED DESIGN;

EID: 0029735074     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.486276     Document Type: Article

References (22)

1. S. B. Akers, "A modification of Lee's path connection algorithm," IEEE Trans. Electron. Comput, vol. EC-16, pp. 97-98, 1967.
2. J. Cong, K.-S. Leung, and D. Zhou, "Performance-driven interconnect design based on distributed RC delay model," in Proc. 30th Design Automation ConJ., 1993, pp. 606-611.
3. M. T. De Berg, M. J. Van Kreveld, B. J. Nilsson, and M. H. Overmars, "Finding shortest paths in the presence of orthogonal obstacles using a combined L\ and link metric," in Proc. SecondScand. Wkshp. Algorithm Theory, 19 90, pp. 213-24.
4. A. D. Brown and M. Zwolinski, "Lee router modified for global routing," Computer-Aided Design, vol. 22, no. 5, pp. 296-300, June 1990.
5. K. L. Clarkson, S. Kapoor, and P. M. Vaidya, "Rectilinear shortest patlis through polygonal obstacles in (9(n(log n)') time," in Proc. Tliird Annual Conf. Computational Geometry, 1987, pp. 251-57.
6. H. Edelsbnmner and M. H. Overmars, "Some methods of computational geometry applied to computer graphics," Computer Vision, Graphics, and Image Processing, vol. 28, pp. 92-108, 1984. Circuit Boards," IEEE Trans. Circuit Theory, vi>l. CT-18, pp. 95-100, 1971.
7. F. O. Hadlock, "The shortest: Path algorithm for grid graphs," Networks, vol. 7, pp. 323-34, 1977.
8. [8J P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst., Sei., Cybern., vol. SCC-4, pp. 100-107, 1968.
9. D. W. Hightower, "A solution to line routing problems on the continuous plane," in Proc. IEEE Sixth DesignAutomati.cn Wkshp., 1969, pp. 1-24.
10. Y. Ke, "An efficient algorithm for link-distance problems," in Proc. 5th ACM Symp., Led. Notes in Computer Sei., 447. New York: SpringerVerlag, 1990. pp. 213-224.
11. J.B. Kruskal, "On the Shortest spanning subtree of a graph and the traveling salesman problem." in. Proc. Amer. Mathemat. Soc., vol. 7, pp. 48-50, 1956.
12. C. Y. Lee, "An Algorithm for Path Connections and Its Applications," IKK Trans. Electron. Comput., vol. EC-1U, pp. 346-65, 1961.
13. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Reading, England: Wiley, 1990.
14. E. M. McCreight, "Priority search trees," Tech. Rep. Xerox PARC CSL-81-5, 1981.
15. K. Mikarni and K. Tabuchi, "A computer program for optimal routing of printed circuit connectors," IFIPS Proc., vol. H-47, pp. 1475-78, 1968.
16. J. S. B. Mitchell, "An optimal algorithm for shortest rectilinear paths among obstacles in the plane," in Abstracts First Canadian Conf. Computational Geometry. 1989, p. 22.
17. T. Ohtsuki, "Maze-running and Line-search Algorithms," in T. Ohtsuki, Ed., Advances in CAD for VLSI, vol. 4: Layout Design and Verification. New York: North- Holland, 1986, pp. 99-131.
18. P. J. Rezend, D. T. Lee, and Y.-F. Wu, "Rectilinear shortest paths with rectangular barriers," in Proc. Second Annual Conf. Computat. Geom., pp. 204-13, ACM, 1985. _
19. S. K_ Rao, P. Sadayappan, F.K. Hwang, and P.W. Shot, "The rectilinear steiner arborescence problem," Algorithmica, vol. 7, 1992, pp. 277-288.
20. J. Soukup, "Fast maze router," in Proc. 15th Design Automation Conf., 1978, pp. 100-102.
21. Y.-F. Wu, P. Widmayer, M. D. F. Schlag, and C. K. Wong, "Rectilinear shortest paths and minimum spanning, trees in the presence of rectilinear obstacles," IEEE Trans. CompuL, vol. C-36, pp. 321-31, 1987.
22. C. D. Yang, D. T. Lee, and C. K. Wong, "On bends and lengths of rectilinear paths: A graph-theoretic approach," in Proc. Algorithms and Data Structures, 2nd Wkshp. WADS 191, Lect. Notes in Computer Sei., 519. New York: Springer-Verlag, 1991, pp. 320-330.