Abstract
Corner stitching (1) is a versatile data structure for many reasons. Many fundamental algorithms for layout manipulations can be executed in linear time using this data structure. The only factor which goes against this data structure is the increased memory requirements.Strip removal is one of the compaction algorithms in use. Strip removal using corner stitched data structure was attempted and the response time was found to be instantaneous. The algorithm is presented in this paper.
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.
