An optimal algorithm for detecting straight lines in chain codes

An optimal algorithm for detecting straight lines in chain codes is described. The algorithm turns the complicated problem of determining the straightness of digital arcs into a simple task by constructing a passing area around the pixels. It is shown that this algorithm is not only simple and intuitive, but also highly efficient.<<ETX>>

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

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

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

[4]  S. H. Y. Hung,et al.  On the Straightness of Digital Arcs , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

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

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