Communications of the Korean Mathematical Society (대한수학회논문집)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

AN ALGORITHM FOR FINDING THE DISTANCE BETWEEN TWO ELLIPSES

  • Kim, Ik-Sung (Department of Applied Mathematics Korea Maritime University)
  • Published : 2006.07.01
Download PDF
⟨ Previous Next ⟩

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

References

  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 https://doi.org/10.1016/S0307-904X(02)00080-X
  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 https://doi.org/10.1007/BF01934268
  4. M. Grossmann, Parametric curve fitting, Comp. J. 14 (1971), 169-172 https://doi.org/10.1093/comjnl/14.2.169
  5. V. Lumelsky, On the computation of distance between line segments, Inform. Process. Lett. 21 (1985), 55-61 https://doi.org/10.1016/0020-0190(85)90032-8
  6. W. Meyer, Distance between boxes:applications to collision detection and clipping, IEEE Int. Conf. Robot. Automat. (1986), 597-602
  7. C. A. Neff, Finding the distance between two circles in three dimensional space, IBM J. Res. Develop. 34 (1990), 770-775 https://doi.org/10.1147/rd.345.0770
  8. J. T. Schwartz, Finding the minimum distance between two convex polygons, Inform. Process. Lett. 13 (1981), 168-170 https://doi.org/10.1016/0020-0190(81)90051-X
  9. H. Spath, Orthogonal squared distance fitting with parabolas, Proceedings of IMACS-GAMM Inter. Symposium on Numerical Methods and Error Bounds, Oldenburg (1995), 261-269

Cited by

  1. The Geometric Iteration Method for Computing the Minimum Distance between Two Spatial Circles vol.05, pp.11, 2015, https://doi.org/10.12677/CSA.2015.511050
  2. COMPUTATION OF THE HAUSDORFF DISTANCE BETWEEN TWO ELLIPSES vol.38, pp.4, 2016, https://doi.org/10.5831/HMJ.2016.38.4.833
  3. 2D Micromechanical Modeling and Simulation of Ta-Particles Reinforced Bulk Metallic Glass Matrix Composite vol.8, pp.11, 2018, https://doi.org/10.3390/app8112192