A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
From MaRDI portal
Publication:1601094
Recommendations
- Median spheres: Theory, algorithms, applications
- Hyperspheres and hyperplanes fitted seamlessly by algebraic constrained total least-squares
- Minsum hyperspheres in normed spaces
- Minisum hyperspheres
- Total least squares fitting of \(k\)-spheres in \(n\)-D Euclidean space using an \((n+2)\)-D isometric representation
Cited in
(16)- Statistical analysis of curve fitting methods in errors-in-variables models
- Does the best-fitting curve always exist?
- Median spheres: Theory, algorithms, applications
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Geometric fit of a point set by generalized circles
- Consistent least squares fitting of ellipsoids
- Locating a general minisum `circle' on the plane
- Fitting circles to scattered data: parameter estimates have no moments
- Fast and numerically stable circle fit
- Is the best fitting curve always unique?
- Fitting circles to data with correlated noise
- Fitting concentric circles to measurements
- Error analysis for circle fitting algorithms
- Minsum hyperspheres in normed spaces
- Data clustering for circle detection
This page was built for publication: A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601094)
