On the complexity of curve fitting algorithms
Computational Complexity
2010-08-12 v1 Computer Vision and Pattern Recognition
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.
Cite
@article{arxiv.cs/0308023,
title = {On the complexity of curve fitting algorithms},
author = {N. Chernov and C. Lesort and N. Simanyi},
journal= {arXiv preprint arXiv:cs/0308023},
year = {2010}
}
Comments
8 pages, no figures