Deformed distance fields for simulation of non-penetrating flexible bodies

We present a novel penetration depth estimation algorithm based on the use of deformed distance fields for simulation of non-penetrating flexible bodies. We assume that the continuum of non-rigid models are discretized using standard techniques, such as finite element methods. As the objects deform, the distance fields are deformed accordingly to estimate penetration depth, allowing enforcement of non-penetration constraints between two colliding elastic bodies. Our approach can automatically handle self-penetration and inter-penetration in a uniform manner. We demonstrate its effectiveness on moderately complex animated scenes.

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

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

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

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

[5]  Rae A. Earnshaw,et al.  Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.

[6]  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.

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

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

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

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

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

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

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

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

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

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

[17]  Alex M. Andrew,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition) , 2000 .

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

[19]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[20]  Ming C. Lin,et al.  Simulation of Non-penetrating Elastic Bodies Using Distance Fields , 2000 .

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

[22]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .