Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time

DOI10.1007/978-3-642-19867-0_27MaRDI QIDQ3000714zbMATH OpenOpenAlexFDO

Authors Mouhammad Said, Jacques-Olivier Lachaud

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19867-0_27

zbMATH Keywords

Stern-Brocot treedigital straight segment recognitionstandard lines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55)

Recommendations

• Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
• Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
• Remainder approach for the computation of digital straight line subsegment characteristics
• scientific article; zbMATH DE number 4016245
• Line segmentation of digital curves in parallel
• scientific article; zbMATH DE number 4211509
• The linear time recognition of digital arcs
• On the number of digital straight line segments

Cited in

(6)

• Walking in the Farey fan to compute the characteristics of a discrete straight line subsegment
• Remainder approach for the computation of digital straight line subsegment characteristics
• Algorithms for Fast Digital Straight Segments Union
• Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
• Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
• Revisiting Digital Straight Segment Recognition

This page was built for publication: Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000714)