Fast penetration depth estimation for elastic bodies using deformed distance fields

We present a fast penetration depth estimation algorithm between deformable polyhedral objects. We assume the continuum of non-rigid models are discretized using standard techniques, such as finite element or finite difference methods. As the objects deform, the pre-computed distance fields are deformed accordingly to estimate the penetration depth, allowing an enforcement of non-penetration constraints between two colliding elastic bodies. This approach can automatically handle self-penetration and inter-penetration in a uniform manner. We demonstrate its effectiveness on moderately complex simulation scenes.

[1]  Leonidas J. Guibas,et al.  The Design and Analysis of Geometric Algorithms , 1994, IFIP Congress.

[2]  Brian Mirtich,et al.  A Survey of Deformable Modeling in Computer Graphics , 1997 .

[3]  S. A. Cameron,et al.  Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[4]  Dinesh Manocha,et al.  Fast and simple 2D geometric proximity queries using graphics hardware , 2001, I3D '01.

[5]  Larry J. Leifer,et al.  A Proximity Metric for Continuum Path Planning , 1985, IJCAI.

[6]  K. Sridharan,et al.  Distance Measures on Intersecting Objects and Their Applications , 1994, Inf. Process. Lett..

[7]  Dinesh Manocha,et al.  Efficient and Accurate Interference Detection for Polynomial Deformation and Soft Object Animation , 1996 .

[8]  Alfred M. Bruckstein,et al.  Finding Shortest Paths on Surfaces Using Level Sets Propagation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Leonidas J. Guibas,et al.  Penetration Depth of Two Convex Polytopes in 3D , 2000, Nord. J. Comput..

[10]  Stephen Cameron,et al.  Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.

[11]  Dinesh Manocha,et al.  Efficient and accurate interference detection for polynomial deformation , 1996, Proceedings Computer Animation '96.

[12]  Joel W. Burdick,et al.  Computation and analysis of compliance in grasping and fixturing , 1997, Proceedings of International Conference on Robotics and Automation.

[13]  N. Weatherill,et al.  Unstructured grid generation using iterative point insertion and local reconnection , 1995 .

[14]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[15]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[16]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[17]  P. Tallec.  Numerical methods for nonlinear three-dimensional elasticity , 1994 .

[18]  Dinesh Manocha,et al.  Partitioning and Handling Massive Models for Interactive Collision Detection , 1999, Comput. Graph. Forum.

[19]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[20]  Elmer G. Gilbert,et al.  New distances for the separation and penetration of objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[21]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[22]  Leonidas J. Guibas,et al.  Ruler, Compass and Computer , 1988 .

[23]  S. Lanka..  Technical report 1989. , 1990 .

[24]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .