Minimum distance between the faces of two convex polyhedra: A sufficient condition

被引：3
|
作者：
Llanas, B
De Sevilla, MF
Feliu, V
机构：
[1] ETSI Caminos, Dpto Matemat & Informat, Madrid 28040, Spain
[2] ETSI Ind, Dpto Ingn Elect, Ciudad Real 13071, Spain
来源：
JOURNAL OF GLOBAL OPTIMIZATION | 2003年 / 26卷 / 04期
关键词：
distance between convex polyhedra; local descent; projection algorithms; sufficient condition of global minimum;
D O I：
10.1023/A:1024755315702
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.
引用
收藏
页码：361 / 385
页数：25
相关论文
共 50 条
  • [1] Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
    B. Llanas
    M. Fernandez De Sevilla
    V. Feliu
    [J]. Journal of Global Optimization, 2003, 26 : 361 - 385
  • [2] An algorithm on collision detection by computing the minimum distance between two convex polyhedra
    Jin, Hanjun
    Wang, Yanlin
    Wang, Xiaorong
    Fu, Jia
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 304 - 304
  • [3] An algorithm for computing the minimum distance between two convex polyhedra in three-dimensional space
    Liu Hui
    Jin Hanjun
    [J]. KAM: 2008 INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING, PROCEEDINGS, 2008, : 313 - 317
  • [4] Pseudo minimum translational distance between convex polyhedra(Ⅰ)——Definition and properties
    朱向阳
    丁汉
    熊有伦
    [J]. Science China Technological Sciences, 2001, (02) : 216 - 224
  • [5] Estimate of minimum distance between convex polyhedra based on enclosed ellipsoids
    Shiang, SP
    Liu, JS
    Chien, YR
    [J]. 2000 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2000), VOLS 1-3, PROCEEDINGS, 2000, : 739 - 744
  • [6] Pseudo minimum translational distance between convex polyhedra (I)Definition and properties
    Zhu Xiangyang
    Ding Han
    Xiong Youlun
    [J]. Science in China Series E: Technolgical Science, 2001, 44 (2): : 216 - 224
  • [7] Pseudo minimum translational distance between convex polyhedra(I) - Definition and properties
    Zhu, XY
    Ding, H
    Xiong, YL
    [J]. SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 2001, 44 (02): : 216 - U2
  • [8] A comparison of two fast algorithms for computing the distance between convex polyhedra
    Cameron, S
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1997, 13 (06): : 915 - 920
  • [9] Convex polyhedra with parquet faces
    Timofeenko, A. V.
    [J]. DOKLADY MATHEMATICS, 2009, 80 (02) : 720 - 723
  • [10] Convex polyhedra with parquet faces
    A. V. Timofeenko
    [J]. Doklady Mathematics, 2009, 80 : 720 - 723
12345