Enhancing GJK: Computing minimum and penetration distances between convex polyhedra

被引：0
|
作者：
Cameron, S
机构：
来源：
1997 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION - PROCEEDINGS, VOLS 1-4 | 1997年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of tracking the distance between two convex polyhedra is finding applications in many areas of robotics, including intersection detection, collision detection, and path planning. We present new results that confirm an almost-constant time complexity for an enhanced version of Gilbert, Johnson and Keerthi's algorithm, and also describe modifications to the algorithm to compute measures of penetration distance.
引用
收藏
页码：3112 / 3117
页数：6
相关论文
共 50 条
  • [1] Computing the minimum directed distances between convex polyhedra
    Shih, CL
    Liu, JY
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1999, 15 (03) : 353 - 373
  • [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] 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
  • [4] 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
  • [5] COMPUTING THE EXTREME DISTANCES BETWEEN 2 CONVEX POLYGONS
    EDELSBRUNNER, H
    JOURNAL OF ALGORITHMS, 1985, 6 (02) : 213 - 224
  • [6] Approximation for minimum triangulation of convex polyhedra
    Chin, FYL
    Fung, SPY
    Wang, CA
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 128 - 137
  • [7] Convex polyhedra with minimum and maximum names
    Voytekhovsky, Yury L.
    ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES, 2017, 73 : 271 - 273
  • [8] Minimum distance between the faces of two convex polyhedra: A sufficient condition
    Llanas, B
    De Sevilla, MF
    Feliu, V
    JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (04) : 361 - 385
  • [9] Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
    B. Llanas
    M. Fernandez De Sevilla
    V. Feliu
    Journal of Global Optimization, 2003, 26 : 361 - 385
  • [10] Pseudo minimum translational distance between convex polyhedra(Ⅰ)——Definition and properties
    朱向阳
    丁汉
    熊有伦
    Science in China(Series E:Technological Sciences), 2001, (02) : 216 - 224
12345