Fast contact detection between moving deformable polyhedra - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Fast contact detection between moving deformable polyhedra


This paper presents an approach to detect and localize contact between deformable polyhedra, which can be convex or concave depending on the time step. Usual contact detection algorithms, defined for convex polyhedra, cannot be used efficiently as they would imply to compute the convex decomposition of the considered polyhedra at each time step, as it can change due to the deformability of these polyhedra. The computation of this convex decomposition being very expensive (in complexity and computation time), we propose an algorithm to detect and localize the contact in linear time wrt the number of vertices. This algorithm returns the direction of this contact and the value of the maximum intersection distance between the convex hulls of the two considered polyhedra. Experimental results, taken from a dynamic simulation application, are presented with their computation time to complete the complexity analysis.
No file

Dates and versions

inria-00000012 , version 1 (12-05-2005)



Ammar Joukhadar, Alexis Scheuer, Christian Laugier. Fast contact detection between moving deformable polyhedra. IEEE-RSJ Int. Conf. on Intelligent Robots and Systems, Korea Advanced Institute of Science and Technology, Oct 1999, Kyongju (KR), South Korea. pp.1810-1815, ⟨10.1109/IROS.1999.811741⟩. ⟨inria-00000012⟩
149 View
0 Download



Gmail Facebook Twitter LinkedIn More