A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
From MaRDI portal
Publication:1601094
DOI10.1007/s002110100326zbMath0999.65008OpenAlexW2010202760MaRDI QIDQ1601094
Publication date: 17 June 2002
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110100326
Numerical smoothing, curve fitting (65D10) Complexity and performance of numerical algorithms (65Y20) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (15)
Consistent least squares fitting of ellipsoids ⋮ Is the best fitting curve always unique? ⋮ 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 ⋮ Data clustering for circle detection ⋮ Error analysis for circle fitting algorithms ⋮ Does the best-fitting curve always exist? ⋮ Fitting concentric circles to measurements ⋮ Geometric fit of a point set by generalized circles ⋮ Fast and numerically stable circle fit ⋮ Fitting circles to scattered data: parameter estimates have no moments ⋮ Median spheres: Theory, algorithms, applications ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ Fitting circles to data with correlated noise ⋮ Locating a general minisum `circle' on the plane ⋮ Statistical analysis of curve fitting methods in errors-in-variables models
Uses Software
This page was built for publication: A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
