A voxel-based parallel collision detection algorithm

Two physical objects cannot occupy the same space at the same time.Simulated physical objects do not naturally obey this constraint.Instead, we must detect when two objects have collided---we mustperform collision detection. This work presents a simplevoxel-based collision detection algorithm, an efficient parallelimplementation of the algorithm, and performance results.

[1]  Laxmikant V. Kale,et al.  NAMD2: Greater Scalability for Parallel Molecular Dynamics , 1999 .

[2]  Daniel Thalmann,et al.  An adaptive spatial sub-division of the object space for fast collision of ani-mated rigid bodies , 1995 .

[3]  R.K. Brunner,et al.  Adapting to load on workstation clusters , 1999, Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation.

[4]  Greg Turk,et al.  Interactive Collision Detection for Molecular Graphics , 1990 .

[5]  Rida T. Farouki,et al.  Automatic parsing of degenerate quadric-surface intersections , 1989, TOGS.

[6]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..

[7]  Subhash Suri,et al.  Analyzing bounding boxes for object intersection , 1999, TOGS.

[8]  Daniel Thalmann,et al.  An Adaptive Spatial Subdivision of the Object Space for Fast Collision Detection of Animated Rigid Bodies , 1995, Comput. Graph. Forum.

[9]  Subhash Suri,et al.  Analysis of a bounding box heuristic for object intersection , 1999, SODA '99.

[10]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

[11]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

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

[13]  Hiromasa Suzuki,et al.  Distance computation between non-convex polyhedra at short range based on discrete Voronoi regions , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[14]  Stephen Cameron,et al.  Approximation hierarchies and S-bounds , 1991, SMA '91.

[15]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[16]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[17]  Laxmikant V. Kalé,et al.  Supporting dynamic parallel object arrays , 2003, Concurr. Comput. Pract. Exp..

[18]  Michael Zyda,et al.  NPSNET: Real-time collision detection and response , 1993, Comput. Animat. Virtual Worlds.

[19]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[20]  Dinesh Manocha,et al.  Spherical shell: a higher order bounding volume for fast proximity queries , 1998 .

[21]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[22]  Bruce Hendrickson,et al.  Parallel strategies for crash and impact simulations , 1998 .