Digital straightness and convexity (Extended Abstract)

We define straightness and convexity of regions in a digital picture. Then it is shown that a few important properties satisfied by convex (Euclidean) regions are also satisfied by convex digital regions. We extend the definition of digital convexity of regions to digital solids. Efficient algorithms are presented that determine whether or not a digital region is convex, a digital arc is a digital straight line segment and a digital solid is convex.

[1]  Azriel Rosenfeld,et al.  Picture Processing and Psychopictorics , 1970 .

[2]  Chul E. Kim,et al.  Digital and cellular convexity , 1982, Pattern Recognit..

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

[4]  Azriel Rosenfeld,et al.  Three-Dimensional Digital Topology , 1981, Inf. Control..

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

[6]  Azriel Rosenfeld,et al.  Convex Digital Solids , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[8]  Azriel Rosenfeld,et al.  Digital picture analysis , 1976 .

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

[10]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

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

[12]  Ugo Montanari.  On Limit Properties in Digitization Schemes , 1970, JACM.

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

[14]  Chul E Kim.  A Linear Time Convex Hull Algorithm for Simple Polygons. , 1980 .