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

An algorithm for finding the distance between two ellipses

0

조회

0

다운로드

1

인용

0

참고문헌

주제분류수학

초록

Abstract

We are interested in the distance problem between two objects inthree dimensional Euclidean space. There are many distanceproblems for various types of objects including line segments,boxes, polygons, circles, disks, etc. In this paper we present aniterative algorithm for finding the distance between two givenellipses. Numerical examples are given.

참고문헌 (9)

  1. "An algorithm for computing the distance between two circular disks", 27, pp.115~ (2003)
  2. "Solving problems in scientific computing using maple and matlab" (1993)
  3. "Least-squares fitting of circles and ellipses" (1994)
  4. "Parametric curve fitting", 14, pp.169~ (1971)
  5. "On the computation of distance between line segments", 21, pp.55~ (1985)
  6. "Distance between boxes applications to collision detection and clipping" (1986)
  7. "Finding the distance between two circles in three dimensional space", 34, pp.770~ (1990)
  8. "Finding the minimum distance between two convex polygons", 13, pp.168~ (1981)
  9. "Orthogonal squared distance fitting with parabolas Proceedings of IMACS-GAMM Inter" (1995)

관련 논문AI추천

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