On the Straightness of Digital Arcs

The straightness of a digital arc can simply be determined by the absence of unevenness in its chain code. The absence of unevenness is a necessary and sufficient condition for a digital arc to have the chord property, and it offers a much simpler alternative for examining whether a digital arc has the chord property or not. This condition is also the most comprehensive and precise expression of the third criterion about digital straight lines given by Freeman. The relations among the chord property, Freeman's three criteria, and the hierarchical structure that a digital straight line supposedly have become much more clear. A procedure to detect the uneven segments and algorithms for determining the straightness of digital arcs is also included.

[1]  Theodosios Pavlidis,et al.  Waveform Segmentation Through Functional Approximation , 1973, IEEE Transactions on Computers.

[2]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[3]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[4]  Seymour Shlien,et al.  Segmentation of digital curves using linguistic techniques , 1983, Comput. Vis. Graph. Image Process..

[5]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[6]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[7]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

[8]  Brian Gluss A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information , 1962, Inf. Control..

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

[10]  C. Arcelli,et al.  Regular Arcs in Digital Contours , 1975 .

[11]  Li-De Wu,et al.  On the Chain Code of a Line , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  P. Sankar,et al.  A parallel procedure for the detection of dominant points on a digital curve , 1978 .

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

[14]  R. Brons,et al.  Linguistic Methods for the Description of a Straight Line on a Grid , 1974, Comput. Graph. Image Process..

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

[16]  Carlo Arcelli,et al.  On the parallel generation of straight digital lines , 1978 .

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

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

[19]  King-Sun Fu,et al.  Using the FFT to determine digital straight line chain codes , 1982, Comput. Graph. Image Process..

[20]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[21]  Tony Kasvand,et al.  Critical points on a perfectly 8- or 6-connected thin binary line , 1983, Pattern Recognit..

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