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 条
  • [21] Maximum overlap and minimum convex hull of two convex polyhedra under translations
    Ahn, Hee-Kap
    Brass, Peter
    Shin, Chan-Su
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 40 (02): : 171 - 177
  • [22] Computation of penetration measures for convex polygons and polyhedra for graphics applications
    Sridharan, K
    FIFTH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1998, : 81 - 87
  • [23] Pseudo minimum translational distance between convex polyhedra (Ⅱ)——Robot collision-free path planning
    朱向阳
    丁汉
    熊有伦
    Science in China(Series E:Technological Sciences), 2001, (04) : 337 - 344
  • [24] ON THE SHORTEST PATHS BETWEEN 2 CONVEX POLYHEDRA
    BALTSAN, A
    SHARIR, M
    JOURNAL OF THE ACM, 1988, 35 (02) : 267 - 287
  • [25] Pseudo minimum translational distance between convex polyhedra (II) - Robot collision-free path planning
    Zhu, XY
    Ding, H
    Xiong, YL
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 2001, 44 (04): : 337 - 344
  • [26] Improving the GJK Algorithm for Faster and More Reliable Distance Queries Between Convex Objects
    Montanari, Mattia
    Petrinic, Nik
    Barbieri, Ettore
    ACM TRANSACTIONS ON GRAPHICS, 2017, 36 (03):
  • [27] Pseudo minimum translational distance between convex polyhedra (II)Robot collision-free path planning
    Xiangyang Zhu
    Han Ding
    Youlun Xiong
    Science in China Series E: Technological Sciences, 2001, 44 : 337 - 344
  • [28] Convex Quadratic Programming for Computing Geodesic Distances on Triangle Meshes
    Chen, Shuangmin
    Hei, Nailei
    Hu, Shun
    Yue, Zijia
    He, Ying
    MATHEMATICS, 2024, 12 (07)
  • [29] A Strictly Convex Hull for Computing Proximity Distances With Continuous Gradients
    Escande, Adrien
    Miossec, Sylvain
    Benallegue, Mehdi
    Kheddar, Abderrahmane
    IEEE TRANSACTIONS ON ROBOTICS, 2014, 30 (03) : 666 - 678
  • [30] AN OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN 2 CROSSING CONVEX POLYGONS
    TOUSSAINT, GT
    COMPUTING, 1984, 32 (04) : 357 - 364
12345