Browse > Article
http://dx.doi.org/10.4134/CKMS.2006.21.3.559

AN ALGORITHM FOR FINDING THE DISTANCE BETWEEN TWO ELLIPSES  

Kim, Ik-Sung (Department of Applied Mathematics Korea Maritime University)
Publication Information
Communications of the Korean Mathematical Society / v.21, no.3, 2006 , pp. 559-567 More about this Journal
Abstract
We are interested in the distance problem between two objects in three dimensional Euclidean space. There are many distance problems for various types of objects including line segments, boxes, polygons, circles, disks, etc. In this paper we present an iterative algorithm for finding the distance between two given ellipses. Numerical examples are given.
Keywords
distance between two ellipses;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. A. Almohamad and S. Z. Selim, An algorithm for computing the distance between two circular disks, Appl. Math. Modelling. 27 (2003), 115-124   DOI   ScienceOn
2 W. Gander and J. Hrebicek, Solving problems in scientific computing using maple and matlab, Springer-Verlag, New York, 1993
3 W. Gander, G. H. Golub and R. Strebel, Least-squares fitting of circles and ellipses, BIT. 34 (1994), 558-578   DOI
4 M. Grossmann, Parametric curve fitting, Comp. J. 14 (1971), 169-172   DOI
5 J. T. Schwartz, Finding the minimum distance between two convex polygons, Inform. Process. Lett. 13 (1981), 168-170   DOI   ScienceOn
6 H. Spath, Orthogonal squared distance fitting with parabolas, Proceedings of IMACS-GAMM Inter. Symposium on Numerical Methods and Error Bounds, Oldenburg (1995), 261-269
7 W. Meyer, Distance between boxes:applications to collision detection and clipping, IEEE Int. Conf. Robot. Automat. (1986), 597-602
8 C. A. Neff, Finding the distance between two circles in three dimensional space, IBM J. Res. Develop. 34 (1990), 770-775   DOI
9 V. Lumelsky, On the computation of distance between line segments, Inform. Process. Lett. 21 (1985), 55-61   DOI   ScienceOn