Corner-Stitched Tiles with Curved Boundaries

Authors:
Sequin, Carlo H.
Technical Report Identifier: CSD-90-576
June 1990
CSD-90-576.pdf

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