AN ALGORITHM FOR FINDING THE DISTANCE BETWEEN TWO ELLIPSES

  • Kim I
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free