Fast C1 proximity queries using support mapping of sphere-torus-patches bounding volumes - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

Fast C1 proximity queries using support mapping of sphere-torus-patches bounding volumes

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.
Fichier principal
Vignette du fichier
2009_icra_benallegue-Fast_C1_proximity_queries.pdf (2.29 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00796369 , version 1 (04-03-2013)

Identifiers

Cite

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. pp.483-488, ⟨10.1109/ROBOT.2009.5152722⟩. ⟨lirmm-00796369⟩
273 View
496 Download

Altmetric

Share

Gmail Facebook X LinkedIn More