Revisiting Digital Straight Segment Recognition
From MaRDI portal
Recommendations
- Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
- An arithmetical characterization of the convex hull of digital straight segments
- scientific article; zbMATH DE number 4016245
- Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
Cited in
(14)- Digital straight segment filter for geometric description
- Remainder approach for the computation of digital straight line subsegment characteristics
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
- Faithful polygonal representation of the convex and concave parts of a digital curve
- Analytical description of digital intersections: minimal parameters and multiscale representation
- scientific article; zbMATH DE number 4016245 (Why is no real title available?)
- An arithmetical characterization of the convex hull of digital straight segments
- Multiscale discrete geometry
- scientific article; zbMATH DE number 4057076 (Why is no real title available?)
- Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
- The \(n\)-dimensional Stern-Brocot tree
- Continued Fractions and Digital Lines with Irrational Slopes
- Recognition of pieces of arithmetic hyperplanes using the Stern-Brocot tree
- Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
This page was built for publication: Revisiting Digital Straight Segment Recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386036)
