Abstract
This paper extends the corner-stitching data structure proposed by Ousterhout (1984) for manipulating rectangular objects in very large scale integration (VLSI) layouts to L-shaped objects. This provides additional flexibility in the design of very large scale integration (VLSI) circuits. Our technique is fundamentally different from Ousterhout's and other extensions to the corner stitching data structure in that it modifies the underlying topology of the data structure. This gives rise to differences in the implementation of operations on the data structure. Our data structure is guaranteed to require less memory than the original data structure. Experiments show that our data structure required about 15%-17% less memory than the original data structure on VLSI layouts but was slower by a factor of two to eight. Extensions of corner stitching to T- and Z-shaped tiles are also described.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
