title: A graph-theoretic method for decomposing two-dimensional polygonal shapes into meaningful parts.
abstract: This note gives a new graph-theoretic shape decomposition procedure, extending the idea in the paper ``Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering'' by Shapiro and Haralick [1]. A binary matrix is used in order to express the LI relation. A solution for the problems connected with artificial separation of two CS cliques and the presence of a regular concavity is proposed. Our algorithm produces nonoverlapping shape parts in much reduced execution time.
authors.affiliation: Dipartimento di Matematica, Università della Calabria Arcavacata, Italy; Istituto di Automatica, Università di Roma, Roma, Italy.
authors.forename: C
authors.initials: C
authors.lastname: Guerra
authors.forename: G G
authors.initials: GG
authors.lastname: Pieroni