Convex Digital Solids

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.

[1]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[2]  Azriel Rosenfeld,et al.  Digital Straight Lines and Convexity of Digital Regions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Jack Sklansky,et al.  Minimum-Perimeter Polygons of Digitized Silhouettes , 1972, IEEE Transactions on Computers.

[4]  Hsun K. Liu,et al.  Two and three dimensional boundary detection , 1977 .

[5]  Chul E. Kim,et al.  Digital Convexity, Straightness, and Convex Polygons , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Jack Sklansky,et al.  Recognition of convex blobs , 1970, Pattern Recognit..

[7]  Chul E. Kim.  On cellular straight line segments , 1982, Comput. Graph. Image Process..

[8]  N. S. Sutherland,et al.  The representation of three-dimensional objects , 1979, Nature.

[9]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[10]  Chul E. Kim.  On the Cellular Convexity of Complexes , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Jack Sklansky,et al.  Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[12]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[13]  Gabor T. Herman,et al.  Dynamic boundary surface detection , 1978 .