An algorithm for finding the distance between two ellipses
Commun. Korean Math. Soc. 2006 Vol. 21, No. 3, 559-567
Printed September 1, 2006
Ik-Sung Kim
Korea Maritime University
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
MSC numbers : 65D10
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd