An algorithm for computing the distance between two circular disks

被引：18

作者：

Almohamad, HA

Selim, SZ

机构：

[1] Amer Univ Sharjah, Dept Comp Sci, Sharjah, U Arab Emirates

[2] King Fahd Univ Petr & Minerals, Dept Syst Engn, Dhahran 31261, Saudi Arabia

来源：

APPLIED MATHEMATICAL MODELLING | 2003年 / 27卷 / 02期

关键词：

circular disks; distance computation; closed-form solutions; iterative solutions;

D O I：

10.1016/S0307-904X(02)00080-X

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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. (C) 2002 Elsevier Science Inc. All rights reserved.

引用

页码：115 / 124

页数：10

共 8 条

[1] ALMOHAMAD HA, 2002, 20021 AM U SHARJ COM
[2] Bazaraa M.S., 2013, Nonlinear Programming-Theory and Algorithms, V3rd
[3] CHIN F, 1983, IEEE T COMPUT, V32, P1203, DOI 10.1109/TC.1983.1676186
[4] ON FAST COMPUTATION OF DISTANCE BETWEEN LINE SEGMENTS
LUMELSKY, VJ
[J]. INFORMATION PROCESSING LETTERS, 1985, 21 (02) : 55 - 61
[5] NEFF CA, 1990, IBM J RES DEV, V34
[6] ORLOWSKI M, 1985, SIAM C GEOM MODL ROB
[7] FINDING THE MINIMUM DISTANCE BETWEEN 2 CONVEX POLYGONS
SCHWARTZ, JT
[J]. INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 168 - 170
[8] [No title captured]

← 1 →