Department of Mathematics

Title: Department of Mathematics

Research Question: How can the complexity of curve fitting algorithms be reduced while maintaining accuracy?

Methodology: The study focuses on a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. The authors propose precise conditions under which this algorithm can be significantly simplified.

Results: The research reveals that this reduction in complexity is possible when fitting circles but not ellipses or hyperbolas. The authors introduce the concept of a gradient weight function, which is crucial for maintaining accuracy. They also provide insights into how to evaluate the distance from a point to the curve, making the algorithm more efficient.

Implications: The findings have significant implications for the field of curve fitting. The proposed method allows for a substantial reduction in computational complexity without compromising accuracy. This can lead to faster and more efficient algorithms, particularly useful for large datasets. Moreover, the research provides a clear understanding of the conditions under which such reductions are possible, which can guide future research in this area.

Link to Article: https://arxiv.org/abs/0308023v1 Authors: arXiv ID: 0308023v1