Abstract
Corner Stitching was first presented by Ousterhout as a data-structure for VLSI CAD. This paper describes the data-structure in detail. It presents, in greater depth than previously, algorithms for the basic operations described in Ousterhout's original paper. The algorithms for enumerating and updating arbitrary rectangular areas are new. Their constant space complexity bounds are an improvement over previous algorithms for those operations that were recursive. From a practical standpoint, the elimination of the recursion has also made them much faster.
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 callDisclaimer: 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.
