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.
CITATION STYLE
Kim, I.-S. (2006). AN ALGORITHM FOR FINDING THE DISTANCE BETWEEN TWO ELLIPSES. Communications of the Korean Mathematical Society, 21(3), 559–567. https://doi.org/10.4134/ckms.2006.21.3.559
Mendeley helps you to discover research relevant for your work.