A method for net representation with polygon decomposition

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.<>