ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Chih-Hung Liu National Taiwan University
Shih-Yi Yuan Feng Chia University
Sy-Yen Kuo National Taiwan University
Yao-Hsin Chou National Taiwan University
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 27
· Citation Count: 3

Published in:
· Proceeding
DAC '09 Proceedings of the 46th Annual Design Automation Conference
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-497-3 doi>10.1145/1629911.1629998

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder