O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles (Q4924475)
From MaRDI portal
scientific article; zbMATH DE number 6169463
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles |
scientific article; zbMATH DE number 6169463 |
Statements
O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles (English)
0 references
31 May 2013
0 references
shape fitting
0 references
consensus set
0 references
inliers
0 references
outliers
0 references
digital circle
0 references
4-connected digital circle
0 references
0-flake digital circle
0 references
