Unformatted text preview: is referred to as the set of demand points and
the set V ; D is referred to as Steiner points.
0 Used in the global routing of multi-terminal nets.
5 4 D 7 C
6 6 J B 7 E 8 12
6 H5 5 I 6 3 F
5 G Demand Point (a) (b) Algorithms for VLSI Physical Design Automation 3.13 cjSherwani 92 Data Structures and Basic Algorithms Underlying Grid Graph ~ The underlying grid graph is de ned by the intersections of the
horizontal and vertical lines drawn through the demand points. Hanan's Thm (69'):
There exists an optimal
RST with all Steiner
points (set S) chosen
from the intersection
points of horizontal
and vertical lines
drawn from points of D. Algorithms for VLSI Physical Design Automation 3.14 cjSherwani 92 Data Structures and Basic Algorithms Di...
View Full Document