Title :
A method for net representation with polygon decomposition
Author_Institution :
Siemens Transmission Syst. Inc., Phoenix, AZ, USA
Abstract :
A method of decomposing polygons into convex subpolygons is presented. The result gives accurate polygon areas and maintains the tree-structure relationships of net branches represented by the polygon. Contacts which connect polygons on different layers are used. The whole net can be represented in a backward linklist. An implementation for treating signal delay in an RC tree network is discussed.<>
Keywords :
VLSI; circuit CAD; computational geometry; delays; trees (mathematics); RC tree network; VLSI; backward linklist; convex subpolygons; interlayer contacts; net branches; net representation; network synthesis; polygon areas; polygon decomposition; signal delay; tree-structure relationships; Capacitance; Circuit simulation; Data mining; Integrated circuit interconnections; Integrated circuit layout; Logic circuits; Propagation delay; Shape; Spatial databases; Tree data structures;
Conference_Titel :
Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-0869-2
DOI :
10.1109/ICCAD.1988.122498
