Abstract : STP-BV is a bounding volume made of patches of spheres and toruses. These patches are assembled so that a convex polyhedral hull is bulged, in a tunable way, into a strictly convex form. Strict convexity ensures at least C 1 property of the distance function -and hence, its gradient continuity. STP-BV were introduced in our previous work, but proximity distance queries were limited to pairs of STP-BV covered objects. In this work we present an alternative to achieve fast proximity distance queries between a STP-BV object and any other convex shape. This is simply made by proposing a support mapping for STP-BV to be used with GJK algorithm. Implementation and experiments of the proposed method and its performance are demonstrated with potential applications to robotics and computer graphics.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00796369
Contributeur : François Keith
<>
Soumis le : lundi 4 mars 2013 - 00:04:58
Dernière modification le : mercredi 4 avril 2018 - 08:30:02
Document(s) archivé(s) le : mercredi 5 juin 2013 - 03:55:59
Mehdi Benallègue, Adrien Escande, Sylvain Miossec, Abderrahmane Kheddar. Fast C1 proximity queries using support mapping of sphere-torus-patches bounding volumes. ICRA: International Conference on Robotics and Automation, May 2009, Kobe, Japan. IEEE, pp.483-488, 2009, 〈http://www.icra2009.org/〉. 〈10.1109/ROBOT.2009.5152722〉. 〈lirmm-00796369〉
