On the complexity of curve fitting algorithms
classification
💻 cs.CC
cs.CV
keywords
algorithmcomplexityfittingpossibleadmitsalgorithmscirclesconditions
read the original abstract
We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find precise conditions under which this is possible. It turns out that this is, indeed, possible when one fits circles but not ellipses or hyperbolas.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.