Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line

DOI10.1016/j.dam.2012.08.038zbMath1278.05054OpenAlexW2054516301MaRDI QIDQ387866

Jacques-Olivier Lachaud, Mouhammad Said

Publication date: 17 December 2013

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

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

zbMATH Keywords

discrete geometryStern-Brocot treedigital straight segment recognitionstandard lines

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Related Items (4)

A Characterization of Consistent Digital Line Segments in ℤ2 ⋮ Introduction to discrete soft transforms ⋮ 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

Uses Software

• DGtal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric interpretation of the Euclidean algorithm and recognition of segments
• Digital straightness -- a review
• Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
• Discrete Representation of Straight Lines
• Multiscale Discrete Geometry
• Representation of digital line segments and their preimages
• Digital Intersections: minimal carrier, connectivity, and periodicity properties
• Revisiting Digital Straight Segment Recognition

This page was built for publication: Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line