Least-squares fitting of circles and ellipses (Q5906711): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal least squares fitting with linear manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3849378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Eckart-Young-Mirsky matrix approximation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least-squares fitting of circles and ellipses / rank
 
Normal rank

Latest revision as of 11:33, 23 May 2024

scientific article; zbMATH DE number 739438
Language Label Description Also known as
English
Least-squares fitting of circles and ellipses
scientific article; zbMATH DE number 739438

    Statements

    Least-squares fitting of circles and ellipses (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 1995
    0 references
    The problems of fitting circles and ellipses to given points in the plane are discussed. Two fitting principles are considered: (i) The ``geometric fit'' where the sum of the squares of the (orthogonal) distances to the given points is minimized and (ii) the ``algebraic fit'' where the parameters of a circle or an ellipse are determined in the usual least- squares sense. The ``geometric fit'' is also considered for the parametric form of a circle or an ellipse, respectively. Various algorithms for the ``geometric fit'' problems are compared. Further methods for the approximate solution of the ``geometric fit'' problem based on iterative ``algebraic fit'' solutions are discussed. Numerical examples are given. The paper contains outstanding and inspiring work in this area.
    0 references
    least-squares fitting
    0 references
    circles
    0 references
    ellipses
    0 references
    geometric fit
    0 references
    algebraic fit
    0 references
    numerical examples
    0 references

    Identifiers