Region extraction from complex shapes

Area of Science:

• Computer Vision
• Computational Geometry
• Image Analysis

Background:

• Decomposing complex shapes into simpler primitive regions is a fundamental challenge in computer graphics and image analysis.
• Existing methods often struggle with accuracy and efficiency when dealing with intricate shapes.

Purpose of the Study:

• To develop and present a new algorithm for the extraction of primitive regions from complex shapes.
• To demonstrate the algorithm's capability in decomposing both interior and exterior regions of shapes.

Main Methods:

• The algorithm slices complex shapes into convex subregions.
• It then rotates and dissolves boundaries between subregions for decomposition.
• The same technique is applied to the exterior region between the shape and its convex hull.

Main Results:

• The algorithm successfully extracts primitive regions including convex, spiral, and biconcave lens shapes.
• It has been implemented as an Algol-W computer program on the UNIVAC 90/80.
• Results show favorable comparisons with previous shape decomposition programs.

Conclusions:

• The described algorithm provides an effective method for decomposing complex shapes into primitive regions.
• Its implementation demonstrates practical utility and favorable performance in shape analysis.