Digital straightness - a review

A digital arc is called 'straight' if it is the digitization of a straight line segment. Since the concept of digital straightness was introduced in the mid-1970s, dozens of papers on the subject have appeared; many characterizations of digital straight lines have been formulated, and many algorithms for determining whether a digital arc is straight have been defined. This paper reviews the literature on digital straightness and discusses its relationship to other concepts of geometry, the theory of words, and number theory.

[1]  K. Voss.  Discrete Images, Objects, and Functions in Zn , 1993 .

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

[3]  H. Klaasman.  Some aspects of the accuracy of the approximated position of a straight line on a square grid , 1975 .

[4]  Eric Andres,et al.  Discrete Analytical Hyperplanes , 1997, CVGIP Graph. Model. Image Process..

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

[6]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[7]  Reinhard Klette,et al.  Cell complexes through time , 2000, SPIE Optics + Photonics.

[8]  Ethan M. Coven,et al.  Sequences with minimal block growth , 2005, Mathematical systems theory.

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

[10]  Fabrizio Luccio,et al.  The Discrete Equation of the Straight Line , 1975, IEEE Transactions on Computers.

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

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

[13]  Christian Ronse.  A simple proof of Rosenfeld's characterization of digital straight line segments , 1985, Pattern Recognit. Lett..

[14]  E. Creutzburg,et al.  Geometric methods for on-line recognition of digital straight-line segments , 1988 .

[15]  Arnold W. M. Smeulders,et al.  Discrete Representation of Straight Lines , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Reinhard Klette,et al.  A comparative evaluation of length estimators , 2002, Object recognition supported by user interaction for service robots.

[17]  Azriel Rosenfeld,et al.  How a Digital Computer can Tell whether a Line is Straight , 1982 .

[18]  Michael Lindenbaum,et al.  A New Parameterization of Digital Straight Lines , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Reinhard Klette,et al.  Length estimation of digital curves , 1999, Optics & Photonics.

[20]  Ugo Montanari,et al.  A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance , 1968, J. ACM.

[21]  Kazuo Kishimoto.  Characterizing Digital Convexity and Straightness in Terms of "Length" and "Total Absolute Curvature" , 1996, Comput. Vis. Image Underst..

[22]  G. A. Hedlund,et al.  Symbolic Dynamics II. Sturmian Trajectories , 1940 .

[23]  Reinhard Klette,et al.  Determination of the Convex Hull of a Finite Set of Planar Points Within Linear Time , 1981, J. Inf. Process. Cybern..

[24]  Michael Lindenbaum,et al.  Compression of chain codes using digital straight line sequences , 1988, Pattern Recognit. Lett..

[25]  Dominique Gouyou-Beauchamps,et al.  Sur les Facteurs des Suites de Sturm , 1990, Theor. Comput. Sci..

[26]  M. C. Irwin.  Geometry of continued fractions , 1989 .

[27]  Filippo Mignosi,et al.  On the Number of Factors of Sturmian Words , 1991, Theor. Comput. Sci..

[28]  Alfred M. Bruckstein,et al.  On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Yazid M. Sharaiha,et al.  A compact chord property for digital arcs , 1993, Pattern Recognit..

[30]  David Thomas,et al.  The Art in Computer Programming , 2001 .

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

[32]  M. D. McIlroy.  A note on discrete representation of lines , 1985, AT&T Technical Journal.

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

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

[35]  Rachad M. Shoucri,et al.  Note on the determination of a digital straight line from chain codes , 1985, Comput. Vis. Graph. Image Process..

[36]  Reinhard Klette,et al.  The Length of Digital Curves , 1999 .

[37]  Robert P. W. Duin,et al.  Spirograph Theory: A Framework for Calculations on Digitized Straight Lines , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[39]  Mohamed Tajine,et al.  Recognizing arithmetic straight lines and planes , 1996, DGCI.

[40]  Jerome Rothstein,et al.  Parallel and sequential specification of a context sensitive language for straight lines on grids , 1976 .

[41]  Ethan M. Coven,et al.  Sequences with minimal block growth II , 1973, Mathematical systems theory.

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

[43]  M. Lothaire,et al.  Algebraic Combinatorics on Words: Index of Notation , 2002 .

[44]  Jovisa D. Zunic,et al.  On the Number of Linear Partitions of the (m, n)-Grid , 1991, Inf. Process. Lett..

[45]  Stéphane Marchand-Maillet,et al.  Discrete Convexity, Straightness, and the 16-Neighborhood , 1997, Comput. Vis. Image Underst..

[46]  V. A. Kovalevsky.  New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

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

[48]  Isabelle Debled-Rennesson,et al.  A Linear Algorithm for Segmentation of Digital Curves , 1995, Int. J. Pattern Recognit. Artif. Intell..

[49]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[50]  Hans-Ullrich Döhler,et al.  Compact contour codes for convex binary patterns , 1985 .

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

[52]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

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

[54]  Arnold W. M. Smeulders,et al.  Decomposition of discrete curves into piecewise straight segments in linear time , 1991 .

[55]  Ching Y. Suen,et al.  An optimal O(n) algorithm for identifying line segments from a sequence of chain codes , 1995, Pattern Recognit..

[56]  Christian Ronse.  Criteria for approximation of linear and affine functions , 1986 .

[57]  Samiran Chattopadhyay,et al.  A new method of analysis for discrete straight lines , 1991, Pattern Recognit. Lett..

[58]  Alfred M. Bruckstein,et al.  The number of digital straight lines on an N×N grid , 1990, IEEE Trans. Inf. Theory.

[59]  Klaus Voss.  Coding of digital straight lines by continued fractions , 1991 .

[60]  Gilbert Labelle,et al.  A Note on a Result of Daurat and Nivat , 2005, Developments in Language Theory.

[61]  Chul E. Kim,et al.  Representation of digital line segments and their preimages , 1985, Comput. Vis. Graph. Image Process..

[62]  Giovanni B Reggiori,et al.  Digital Computer Transformations for Irregular Line-Drawings , 1972 .

[63]  Jerome Feder,et al.  Languages of Encoded Line Patterns , 1968, Inf. Control..

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

[65]  C. A. Berenstein,et al.  On the Number of Digital Straight Line Segments , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[66]  R. Baer,et al.  The Significance of the System of Subgroups for the Structure of the Group , 1939 .

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

[68]  Murray H. Loew,et al.  Analysis and modeling of digitized straight-line segments , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[69]  W.G Kropatsch,et al.  Detecting the straightness of digital curves in O(N) steps , 1989, Comput. Vis. Graph. Image Process..

[70]  S. Dulucq,et al.  On the factors of the Sturmian sequences , 1990 .

[71]  Magdy Gaafar.  Convexity Verification, Block-Chords, and Digital Straight Lines , 1977 .

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