An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition (Q5458902): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_31 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1760000096 / rank | |||
Normal rank | |||
Latest revision as of 03:31, 20 March 2024
scientific article; zbMATH DE number 5267370
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
