Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line (Q387866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line |
scientific article; zbMATH DE number 6238935
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line |
scientific article; zbMATH DE number 6238935 |
Statements
Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line (English)
0 references
17 December 2013
0 references
discrete geometry
0 references
standard lines
0 references
digital straight segment recognition
0 references
Stern-Brocot tree
0 references
0 references
