Digital disks and a digital compactness measure

An O(n2) time algorithm is presented that determines whether or not a given convex digital region is a digital disk. A new compactness measure for digital regions is introduced, and an algorithm to evaluate the compactness measure of convex digital regions is also presented.

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

[2]  Azriel Rosenfeld,et al.  Digital Straightness and Convexity , 1980 .

[3]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

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

[5]  Azriel Rosenfeld,et al.  Digital straightness and convexity (Extended Abstract) , 1981, STOC '81.

[6]  Robert M. Haralick,et al.  A Measure for Circularity of Digital Figures , 1974, IEEE Trans. Syst. Man Cybern..

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

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

[9]  L. Hodes.  Discrete Approximation of Continuous Convex Blobs , 1970 .

[10]  Chul E. Kim,et al.  How a Digital Computer Can Tell Whether a Line is Straight , 1982 .