Region Extraction from Complex Shapes
- 1 September 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-4 (5) , 500-511
- https://doi.org/10.1109/TPAMI.1982.4767294
Abstract
An algorithm is described which extracts primitive regions (i.e., convex, spiral shaped, and biconcave lens) from complex shapes. The interior region bounded by the shape is decomposed by first slicing it into a set of convex subregions and then rotating and dissolving the various boundaries between subregions until a satisfactory decomposition is obtained. The same algorithm also is used to decompose the exterior region between the shape and its convex hull. The algorithm has been implemented as an Algol-W computer program for the UNIVAC 90/80 and results of running the program are presented for a wide variety of complex shapes. These results compare favorably with the experience reported by previous programs.Keywords
This publication has 12 references indexed in Scilit:
- Recognition of handprinted characters by an outermost point methodPattern Recognition, 1980
- Decomposition of Two-Dimensional Shapes by Graph-Theoretic ClusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Locating straight-line edge segments on outdoor scenesPattern Recognition, 1978
- Shape description using weighted symmetric axis featuresPattern Recognition, 1978
- Shape DiscriminationPublished by Springer Nature ,1977
- Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1975
- Plane geometry theorem proving using forward chainingArtificial Intelligence, 1975
- Recovery of perceptual shape organizations from simple closed boundariesComputer Graphics and Image Processing, 1974
- Computing dominant points on simple shapesInternational Journal of Man-Machine Studies, 1974
- The analysis of convex blobsComputer Graphics and Image Processing, 1972