Revisiting Digital Straight Segment Recognition

DOI10.1007/11907350_30zbMath1136.68613OpenAlexW3101590360MaRDI QIDQ5386036

François de Vieilleville, Jacques-Olivier Lachaud

Publication date: 17 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11907350_30

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map ⋮ Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ⋮ Remainder approach for the computation of digital straight line subsegment characteristics ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Continued Fractions and Digital Lines with Irrational Slopes ⋮ The n-dimensional Stern–Brocot tree ⋮ Multiscale Discrete Geometry ⋮ Analytical description of digital intersections: minimal parameters and multiscale representation