Corner stitching 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.
|Original language||English (US)|
|Number of pages||3|
|Journal||Students' Journal of the Institution of Telecommunication Engineers|
|State||Published - Jan 1 1988|
ASJC Scopus subject areas