AN ALGORITHM FOR FINDING THE DISTANCE BETWEEN TWO ELLIPSES

Ik-Sung Kim · Communications of the Korean Mathematical Society · 2006

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.

Read the paper · More papers on PaperTik