Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity (Q2255825)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity |
scientific article |
Statements
Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity (English)
0 references
18 February 2015
0 references
digital geometry
0 references
digital straight segment recognition
0 references
subsegment
0 references
local convex hull
0 references
Farey fan
0 references
0 references
0 references
0 references
0 references
