An O(n log n) Path-Based Obstacle-Avoiding Algorithm for Rectilinear Steiner Tree Construction. Chih -Hung Liu, Shih-Yi Yuan , and Sy -Yen Kuo and Yao- Hsin Chou Form DAC2009. Introduction. Problem Formulation. Flow. Local Reﬁnement :. Critical Path Generation.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Chih-Hung Liu, Shih-Yi Yuan , and Sy-Yen Kuo
and Yao-Hsin Chou
Critical Path Generation
Obstacle-Avoiding Steiner Tree Construction
Lin’s OASG Construction Rectilinear Steiner Tree Construction
MTST of Rectilinear Steiner Tree ConstructionLin’s OASG is an OARSMT for any two-pin net or multiple-pin nets where an OARSMT
Multi-source SPTs are equivalent to a terminal forest of Lin’s OASG. Therefore, a terminal forest of Lin’s OASG can be constructed in O(n log n) time without constructing Lin’s OASG
But the bridge edges could be O( n^2 )
Use Heap maintain the edge weight Rectilinear Steiner Tree Construction
 is most effective O(n log n)-time method
 achieves the best solution quality in