Extension of the corner stitching data structure for arbitrary layout shapes

A simple extension to the corner stitching data structure for layouts with arbitrary shapes of layout objects, is proposed. The key difference between the classic corner stitching data structure and all its extensions proposed so far, and the extension presented in this work, is that in our approach the nonempty tiles are containers for object shapes, not the object shapes themselves. This concept leads to simple and efficient algorithms for layout design.