No abstract

No abstract

No abstract

No abstract

ftp://ftp.inrialpes.fr/pub/sharp/publications/joukhadar:etal:iros:99.pdf.gz (not accepted here, non vectorial font)/http://www.ieee.orgThis 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