An algorithm for computing the distance between two circular disks

被引：17
|
作者：
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
相关论文
共 50 条
  • [1] An algorithm for rapidly computing the minimum distance between two objects collision detection
    Gong, Faming
    Gao, Bo
    Niu, Qiuli
    CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 2, PROCEEDINGS, 2008, : 676 - 679
  • [2] An algorithm on collision detection by computing the minimum distance between two convex polyhedra
    Jin, Hanjun
    Wang, Yanlin
    Wang, Xiaorong
    Fu, Jia
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 304 - 304
  • [3] A quadratic time algorithm for computing the quartet distance between two general trees
    Mailund, Thomas
    Nielsen, Jesper
    Pedersen, Christian N. S.
    2009 INTERNATIONAL JOINT CONFERENCE ON BIOINFORMATICS, SYSTEMS BIOLOGY AND INTELLIGENT COMPUTING, PROCEEDINGS, 2009, : 565 - 568
  • [4] Algorithm research for computing the minimum distance between two convex polyhedra in collision detection
    Jin, Hanjun
    Li, Zhaohui
    Wang, Yanlin
    Wang, Qiong
    Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering), 2006, 30 (02): : 300 - 302
  • [5] Computing the minimum distance between two ellipsoids
    Chen, XD
    Yong, JH
    Xiong, XC
    Zheng, GQ
    Sun, JG
    CAD/ GRAPHICS TECHNOLOGY AND ITS APPLICATIONS, PROCEEDINGS, 2003, : 403 - 404
  • [6] An efficient algorithm for computing the distance between close partitions
    Porumbel, Daniel Cosmin
    Hao, Jin Kao
    Kuntz, Pascale
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (01) : 53 - 59
  • [7] A sub-cubic time algorithm for computing the quartet distance between two general trees
    Jesper Nielsen
    Anders K Kristensen
    Thomas Mailund
    Christian NS Pedersen
    Algorithms for Molecular Biology, 6
  • [8] An algorithm for computing the minimum distance between two convex polyhedra in three-dimensional space
    Liu Hui
    Jin Hanjun
    KAM: 2008 INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING, PROCEEDINGS, 2008, : 313 - 317
  • [9] A sub-cubic time algorithm for computing the quartet distance between two general trees
    Nielsen, Jesper
    Kristensen, Anders K.
    Mailund, Thomas
    Pedersen, Christian N. S.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2011, 6
  • [10] Comparison of methods computing the distance between two ellipsoids
    Girault, Ivan
    Chadil, Mohamed-Amine
    Vincent, Stephane
    JOURNAL OF COMPUTATIONAL PHYSICS, 2022, 458
12345