An Algorithm For Computing The Distance Between Two Circular Disks

An Algorithm For Computing The Distance Between Two Circular Disks. Applied Mathematical Modelling, 27. pp. 115-124.

[img]
Preview
PDF
an_algorithm_for_computing_the_distance__almohamad_isi_000180460700003.pdf

Download (26kB) | Preview

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
Department: College of Computing and Mathematics > lndustrial and Systems Engineering
Depositing User: SHAIKH ARIFUSALAM
Date Deposited: 14 Jun 2008 10:37
Last Modified: 01 Nov 2019 13:44
URI: https://eprints.kfupm.edu.sa/id/eprint/2550