KFUPM ePrints

An Algorithm For Computing The Distance Between Two Circular Disks

Almohamad, H.A. and Selim, S.Z. An Algorithm For Computing The Distance Between Two Circular Disks. Applied Mathematical Modelling, 27. pp. 115-124.

[img]
Preview
PDF
26Kb

Abstract

This paper presents an algorithm for computing the distance between two circular disks in three-dimensional space. A Kurush-Kuhn-Tucker (KKT) approach is used to solve the problem. We show that when the optimal points are not both at the borders of disks, the solutions of the KKT equations can be obtained in closed-form. For the case where the points are at the circumferences, the problem has no analytical solutions [IBM J. Res. Develop. 34 (5) (1990)]. Instead, we propose for the latter case an iterative algorithm based on computing the distance between a fixed point and a circle. We also show that the point-circle distance problem is solvable in closed-form, and the convergence of the numerical algorithm is linear.



Item Type:Article
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Systems Engineering Dept
Creators:Almohamad, H.A. and Selim, S.Z.
Email:UNSPECIFIED, selim@kfupm.edu.sa
ID Code:2550
Deposited By:SHAIKH ARIFUSALAM
Deposited On:14 Jun 2008 13:37
Last Modified:12 Apr 2011 13:13

Repository Staff Only: item control page