The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1982 vol.4)
pp: 500-511
Arthur J. Nevins , Department of Information Systems, Georgia State University, Atlanta, GA 30303.
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.
CITATION
Arthur J. Nevins, "Region Extraction from Complex Shapes", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.4, no. 5, pp. 500-511, May 1982, doi:10.1109/TPAMI.1982.4767294
50 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool