Pages that link to "Item:Q2255825"
From MaRDI portal
The following pages link to Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity (Q2255825):
Displaying 6 items.
- Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line (Q387866) (← links)
- On the recognition of digital circles in linear time (Q1803274) (← links)
- Remainder approach for the computation of digital straight line subsegment characteristics (Q2255822) (← links)
- Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time (Q3000714) (← links)
- Algorithms for Fast Digital Straight Segments Union (Q3190094) (← links)
- (Q3792298) (← links)