ACM Home Page
Please provide us with feedback. Feedback
A minimum cost path search algorithm through tile obstacles
Full text PdfPdf (202 KB)
Source International Symposium on Physical Design archive
Proceedings of the 2001 international symposium on Physical design table of contents
Sonoma, California, United States
Pages: 192 - 197  
Year of Publication: 2001
ISBN:1-58113-347-2
Authors
Zhaoyun Xing  Sun Microsystems Laboratories, 901 San Antonio Road, Palo Alto, CA
Russell Kao  Sun Microsystems Laboratories, 901 San Antonio Road, Palo Alto, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/369691.369771
What is a DOI?

ABSTRACT

In this paper, based on tile connection graph, we propose an efficient minimum cost path search algorithm through tile obstacles. This search algorithm is faster than previous graph based algorithm and unlike previous tile based algorithms, this algorithm finds the minimum cost path.


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
 
2
L. Chua, C. Desoer, and E Kuh, Linear and Nonlinear Circuits, McGraw-Hill, Inc, 1987.
 
3
Jeremy Dion and Louis M. Monier, "Contour: A Tile-based Gridless Router," Western Research Laboratory Research Report 95/3, Palo Alto, California.
 
4
Margarino, A. Romano, A. De Gloria, F. Curatelli, and P. Antognetti, "A Tile-Expansion Router," IEEE Transactions on Computer-Aided Design CAD-6(4): 507-517, July, 1987.
 
5
 
6
John K. Ousterhout, "Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools." IEEE Transactions on Computer-Aided Design, Vol. CAD-3, NO. 1, pp. 87-100, January 1984.
 
7
 
8
Tsai, S. Chen, and W. Feng, "An H-V Alternating Router," IEEE Transactions on Computer-Aided Design 11(8):976- 991, August, 1992.
 
9
 
10
S. Zheng, J Lim, and S. Iyengar, "Finding Obstacle-Avoiding Shortest Paths Using Implicit Connection Graphs," IEEE Transactions on Computer-Aided Design, Vol. 15, No. 1, January 1996.

Collaborative Colleagues:
Zhaoyun Xing: colleagues
Russell Kao: colleagues