This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Region Extraction from Complex Shapes
May 1982 (vol. 4 no. 5)
pp. 500-511
Arthur J. Nevins, Department of Information Systems, Georgia State University, Atlanta, GA 30303.
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 and Machine Intelligence, vol. 4, no. 5, pp. 500-511, May 1982, doi:10.1109/TPAMI.1982.4767294
Usage of this product signifies your acceptance of the Terms of Use.