Least squares fitting of circles and lines

01/01/2003
by   N. Chernov, et al.
0

We study theoretical and computational aspects of the least squares fit (LSF) of circles and circular arcs. First we discuss the existence and uniqueness of LSF and various parametrization schemes. Then we evaluate several popular circle fitting algorithms and propose a new one that surpasses the existing methods in reliability. We also discuss and compare direct (algebraic) circle fits.

READ FULL TEXT
research
03/18/2003

Statistical efficiency of curve fitting algorithms

We study the problem of fitting parametrized curves to noisy data. Under...
research
08/15/2003

On the complexity of curve fitting algorithms

We study a popular algorithm for fitting polynomial curves to scattered ...
research
06/10/2022

Extremal Fitting Problems for Conjunctive Queries

The fitting problem for conjunctive queries (CQs) is the problem to cons...
research
04/10/2019

Least Squares Auto-Tuning

Least squares is by far the simplest and most commonly applied computati...
research
01/26/2020

On the Uniqueness Problem for Quadrature Domains

We study questions of existence and uniqueness of quadrature domains usi...
research
01/30/2015

RANSAC based three points algorithm for ellipse fitting of spherical object's projection

As the spherical object can be seen everywhere, we should extract the el...
research
02/16/2021

New Methods for Detecting Concentric Objects With High Accuracy

Fitting concentric geometric objects to digitized data is an important p...

Please sign up or login with your details

Forgot password? Click here to reset