The least squares fitting of geometric features to given points minimizes the squares sum of error-of-fit in predefined measures. By the geometric fitting, the error distances are defined with the orthogonal, or shortest, distances from the given points to the geometric feature to be fitted. For the geometric fitting of circle and ellipse, robust algorithms are proposed which are based on the coordinate descriptions of the corresponding point on the circle/ellipse for the given point, where the connecting line of the two points is the shortest path from the given point to the circle/ellipse.
No takes yet. Share an insight, caveat, or question.
Ahn et al. (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: