A generalization of the classical corner-stitched data structure for integrated circuit layouts is presented permitting the description of circles and of arbitrary curved shapes. In principle this extended data structure can be built with just the additional space required to store the more complicated curved boundaries. The tradeoffs between different encoding schemes that minimize overall data storage size or the complexity of individual tiles are discussed. The topology of the linkage of tiles by the corner-stitching pointers is equivalent to that of simpler patterns with trapezoidal tiles, but the various tests and operations running on this data structure may become considerably more complicated, and the achievable run-times will be highly implementation dependent.
Title
Corner-Stitched Tiles with Curved Boundaries
Published
1990-06-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-90-576
Type
Text
Extent
14 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
