An evaluation of a collision handling system using sphere-trees for plausible rigid body animation

Collision handling plays a fundamental role for achieving realism and interactivity in 3D graphical systems. Nevertheless, it is still one of the bottlenecks of such systems. In this work, we use the Sweep & Prune algorithm and Sphere-Tree approximations of the objects to perform the collision detection. Besides, we show how to compute the contact data for the narrow phase out of the overlapping leaf spheres from the Sphere-Trees. For collision response, we have implemented a simple, yet efficient and accurate, impulse-based method. A number of experiments in virtual scenarios with objects falling in a static plane were conducted. The results show that when Sphere-Trees with 2 levels are used for scenarios with a great number of objects (up to 200 falling objects) and simultaneous contacts among them (up to 16381.50 contacts at each frame on average), our system is capable of generating real time plausible rigid body animation, with always more than 30 frames per second (FPS) on average.

[1]  Richard E. Parent,et al.  Computer animation - algorithms and techniques , 2012 .

[2]  Oliver Staadt,et al.  Kinetic Sweep and Prune for Collision Detection , 2005 .

[3]  Gabriel Zachmann,et al.  Optimizing the Collision Detection Pipeline , 2001 .

[4]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[5]  Carol O'Sullivan,et al.  Adaptive medial-axis approximation for sphere-tree construction , 2004, TOGS.

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

[7]  John Canny,et al.  Impulse-Based Dynamic Simulation , 1995 .

[8]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[9]  Christer Ericson,et al.  Real-Time Collision Detection , 2004 .

[10]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[11]  Carla Maria Dal Sasso Freitas,et al.  Broad-phase collision detection using semi-adjusting BSP-trees , 2005, I3D '05.

[12]  Dinesh Manocha,et al.  Generalized penetration depth computation , 2006, SPM '06.

[13]  Abderrahmane Kheddar,et al.  CONTACT: arbitrary in-between motions for collision detection , 2001, Proceedings 10th IEEE International Workshop on Robot and Human Interactive Communication. ROMAN 2001 (Cat. No.01TH8591).

[14]  Carol O'Sullivan,et al.  Complementarity based multiple point collision resolution , 2003 .

[15]  Christer Ericson,et al.  Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology) (The Morgan Kaufmann Series in Interactive 3D Technology) , 2004 .

[16]  Rafael de Sousa Rocha,et al.  Performance Evaluation of a Hybrid Algorithm for Collision Detection in Crowded Interactive Environments , 2006, 2006 19th Brazilian Symposium on Computer Graphics and Image Processing.

[17]  Dinesh Manocha,et al.  Cache‐Efficient Layouts of Bounding Volume Hierarchies , 2006, Comput. Graph. Forum.

[18]  Young J. Kim Continuous Collision Detection for Rigid and Articulated Models , 2010 .

[19]  David Baraff,et al.  Fast contact force computation for nonpenetrating rigid bodies , 1994, SIGGRAPH.

[20]  John Dingliana,et al.  Graceful Degradation of Collision Handling in Physically Based Animation , 2000, Comput. Graph. Forum.