A graph-theoretic method for decomposing two-dimensional polygonal shapes into meaningful parts
Related Experiment Video
Updated: May 29, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
1Dipartimento di Matematica, Università della Calabria Arcavacata, Italy; Istituto di Automatica, Università di Roma, Roma, Italy.
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.
Related Concept Videos
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphical Representation of Inequalities
Ogive Graph
Theorems of Pappus and Guldinus: Problem Solving
Hückel's Rule Diagram of π MOs: Frost Circle
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
Piecewise-Defined Functions

