A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We study the octilinear Steiner tree to evaluate the rectilinear Steiner tree based router. First, we give the worst and average case wirelength for rectilinear routing and octilinear routing for two terminals net. Next, we show the octilinear Steiner trees have smaller wirelength reduction for multiterminal net than that of rectilinear Steiner tree. Then, we propose an O(|V | + |E|) algorithm to construct an isomorphic octilinear Steiner tree from a rectilinear Steiner tree G = (V, E) anddoi:10.1145/764808.764836 dblp:conf/glvlsi/ChiangSC03 fatcat:2wrnrw5dh5a57a3srjpzbpbvca