Digital straightness -- a review

DOI10.1016/j.dam.2002.12.001zbMath1093.68656OpenAlexW2037158524WikidataQ60574835 ScholiaQ60574835MaRDI QIDQ1827822

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2002.12.001

zbMATH Keywords

Sturmian words Digital geometry Digital straight lines

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items

From prima quadraginta octant to lattice sphere through primitive integer operations ⋮ An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Mapping multiple regions to the grid with bounded Hausdorff distance ⋮ A Study on the Properties of 3D Digital Straight Line Segments ⋮ Generation and recognition of digital planes using multi-dimensional continued fractions ⋮ Lyndon + Christoffel = digitally convex ⋮ Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map ⋮ Gift-wrapping based preimage computation algorithm ⋮ Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words ⋮ Functional stepped surfaces, flips, and generalized substitutions ⋮ A Characterization of Consistent Digital Line Segments in ℤ2 ⋮ Structural properties of Euclidean rhythms ⋮ Canonical representations of discrete curves ⋮ On the characterization of absentee-voxels in a spherical surface and volume of revolution in ${\mathbb Z}^3$ ⋮ Two plane-probing algorithms for the computation of the normal vector to a digital plane ⋮ Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays ⋮ Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ Dilated Floor Functions That Commute ⋮ On Sturmian graphs ⋮ Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ⋮ The number of Khalimsky-continuous functions on intervals ⋮ On covering a digital disc with concentric circles in $\mathbb Z^2$ ⋮ Combinatorial generation of planar sets ⋮ Approximation of digital surfaces by a hierarchical set of planar patches ⋮ Introduction to discrete soft transforms ⋮ Sturmian graphs and integer representations over numeration systems ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ Consistent digital line segments ⋮ Sturmian and Episturmian Words ⋮ A coloring problem for infinite words ⋮ Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays ⋮ Consistent digital rays ⋮ Number-theoretic interpretation and construction of a digital circle ⋮ Homotopic properties of an \textit{MA}-digitization of 2D Euclidean spaces ⋮ Discrete sets with minimal moment of inertia ⋮ Homotopic properties of $KA$-digitizations of $n$-dimensional Euclidean spaces ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Remainder approach for the computation of digital straight line subsegment characteristics ⋮ Discrete segments of $\mathbb{Z}^3$ constructed by synchronization of words ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Infinite labeled trees: from rational to Sturmian trees ⋮ The number of continuous curves in digital geometry ⋮ Plane digitization and related combinatorial problems ⋮ Standard factors of Sturmian words ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ On Christoffel and standard words and their derivatives ⋮ A generalized preimage for the digital analytical hyperplane recognition ⋮ Minimum decomposition of a digital surface into digital plane segments is NP-hard ⋮ On Lazy Representations and Sturmian Graphs ⋮ Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions ⋮ Combinatorial View of Digital Convexity ⋮ Continued Fractions and Digital Lines with Irrational Slopes ⋮ On Minimal Moment of Inertia Polyominoes ⋮ Consistent digital curved rays and pseudoline arrangements ⋮ Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences ⋮ Weak colored local rules for planar tilings ⋮ A multidimensional critical factorization theorem

Cites Work