The Community for Technology Leaders
Green Image
Issue No. 06 - June (1982 vol. 4)
ISSN: 0162-8828
pp: 612-618
Chul E. Kim , Department of Computer Science, University of Maryland, College Park, MD 20742; Department of Computer Science, Washington State University, Pullman, WA 99164.
Azriel Rosenfeld , FELLOW, IEEE, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.
A definition of convexity of digital solids is introduced. Then it is proved that a digital solid is convex if and only if it has the chordal triangle property. Other geometric properties which characterize convex digital regions are shown to be only necessary, but not sufficient, conditions for a digital solid to be convex. An efficient algorithm that determines whether or not a digital solid is convex is presented.

A. Rosenfeld and C. E. Kim, "Convex Digital Solids," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 4, no. , pp. 612-618, 1982.
79 ms
(Ver 3.3 (11022016))