An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition (Q5458902)
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: An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition |
scientific article; zbMATH DE number 5267370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition |
scientific article; zbMATH DE number 5267370 |
Statements
An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition (English)
0 references
24 April 2008
0 references
Digital naive plane recognition
0 references
convex optimization
0 references
feasibility problem
0 references
quasi linear time complexity
0 references
Chord's algorithm
0 references
0.9280030727386476
0 references
0.8768295645713806
0 references
0.8753760457038879
0 references
0.8003525733947754
0 references
0.7940641045570374
0 references
