This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts
April 1982 (vol. 4 no. 4)
pp. 405-408
C. Guerra, Dipartimento di Matematica, Università della Calabria Arcavacata, Italy; Istituto di Automatica, Università di Roma, Roma, Italy.
G. G. Pieroni, Dipartimento di Matematica, Università della Calabria, Arcavacata, Italy.
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.
Citation:
C. Guerra, G. G. Pieroni, "A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 4, no. 4, pp. 405-408, April 1982, doi:10.1109/TPAMI.1982.4767272
Usage of this product signifies your acceptance of the Terms of Use.