Linear Decomposition of Planar Shapes

The issue of decomposing digital shapes into sets of digital primitives has been widely studied over the years. Practically all existing approaches require perfect or cleaned shapes. Those are obtained using various pre-processing techniques such as thinning or skeletonization. The aim of this paper is to bypass the use of such pre-processings, in order to obtain decompositions of shapes directly from connected components. This method has the advantage of taking into account the intrinsic thickness of digital shapes, and provides a decomposition which is also robust to noise.