A visibility graph based Shape Decomposition technique

In this paper, a new shape decomposition method named Visibility Shape Decomposition (VSD) is presented. Inspired from an idealization of the visibility matrix having a block diagonal form, the definition of a neighborhood based visibility graph is proposed and a two step iterative algorithm for its transformation into a block diagonal form, that can be used for a visually meaningful decomposition of the candidate shape, is presented. Although the proposed technique is applied to shapes of the MPEG7 database, it can be extended to 3D objects. The preliminary results we have obtained are promising.