본문 바로가기
KERD
논문KCI 등재

An Algorithm for Fitting of Spheres

0

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

Abstract

We are interested in the problem of ¯tting a sphere to a set of data points in the three dimensional Euclidean space. In SpÄath [6] a descent algorithm already have been given to ¯nd the sphere of best ¯t in least squares sense of minimizing the orthogonal distances to the given data points. In this paper we present another new algorithm which computes a parametric represented sphere in order to minimize the sum of the squares of the distances to the given points. For any choice of initial approximations our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

참고문헌 (5)

  1. "tting by linear and nonlinear least squares" (1993)
  2. "tting of circles and ellipses" (1994)
  3. "Solving problems in scienti?" (1993), Springer-Verlag
  4. "Orthogonal squared distance ?tting with parabolas." (1996)
  5. "Least-square ?tting with spheres", 96(1), pp.191~199 (1998)

관련 논문AI추천

이 간행물의 다른 논문 (9건)