On the complexity of curve fitting algorithms
From MaRDI portal
Recommendations
- Statistical efficiency of curve fitting algorithms
- scientific article; zbMATH DE number 4009564
- On the complexity of parametrizing curves
- On the performance of the approximate parametrization algorithm for curves
- scientific article; zbMATH DE number 953020
- The theoretical analysis and algorithm on a class of optimal curve fitting problems
- scientific article; zbMATH DE number 1763809
- Complexity of curves
- The Curve Fitting Problem: A Solution
Cites work
- scientific article; zbMATH DE number 3133601 (Why is no real title available?)
- scientific article; zbMATH DE number 4020222 (Why is no real title available?)
- scientific article; zbMATH DE number 918862 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- Heteroscedastic regression in computer vision: Problems with bilinear constraint
- Least-squares fitting of circles and ellipses
- Rationalising the renormalisation method of Kanatani
- Statistical efficiency of curve fitting algorithms
Cited in
(3)
This page was built for publication: On the complexity of curve fitting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876816)