Digital Straightness
From MaRDI portal
Publication:4917088
DOI10.1016/S1571-0661(04)80976-9zbMath1260.68435OpenAlexW4240972383WikidataQ60574869 ScholiaQ60574869MaRDI QIDQ4917088
Reinhard Klette, Azriel Rosenfeld
Publication date: 26 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80976-9
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Digital planarity -- a review ⋮ Connectivity of discrete planes ⋮ About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Digital lines with irrational slopes ⋮ Multidimensional continued fractions and symbolic codings of toral translations ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Generation of random digital simple curves with artistic emulation ⋮ Discrete-Euclidean operations ⋮ Gift-Wrapping Based Preimage Computation Algorithm ⋮ On the min DSS problem of closed discrete curves ⋮ CHARACTERIZING DIGITAL STRAIGHTNESS AND DIGITAL CONVEXITY BY MEANS OF DIFFERENCE OPERATORS ⋮ On the min DSS problem of closed discrete curves ⋮ On digital plane preimage structure ⋮ An elementary digital plane recognition algorithm ⋮ Digital plane preimage structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete images, objects, and functions in \(Z^ n\)
- On the number of factors of Sturmian words
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- On the number of linear partitions of the \((m,n)\)-grid
- How a Digital Computer Can Tell Whether a Line is Straight
- On cellular straight line segments
- Spirograph Theory: A Framework for Calculations on Digitized Straight Lines
- Geometry of Continued Fractions
- The number of digital straight lines on an N*N grid
- A simple proof of Rosenfeld's characterization of digital straight line segments
- Representation of digital line segments and their preimages
- On the Chain Code of a Line
- Digital Straight Line Segments
- A linear algorithm for incremental digital display of circular arcs
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- A note on minimal length polygonal approximation to a digitized contour
- Sequences with minimal block growth
