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 algorithm...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 139; no. 1; pp. 197 - 230
Main Authors Klette, Reinhard, Rosenfeld, Azriel
Format Journal Article Conference Proceeding
LanguageEnglish
Published Lausanne Elsevier B.V 30.04.2004
Amsterdam Elsevier
New York, NY
Subjects
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Digital geometry
Digital straight lines
Exact sciences and technology
Geometry
Mathematics
Number theory
Sciences and techniques of general use
Sturmian words
Theoretical computing
Sturmian words
52C99
Digital geometry
Digital straight lines
68U05
62H35
65D18
Review
Computer theory
Line segment
Straightness
Optimization
Number theory
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2002.12.001