Object-space interference de-tection on programmable graphics hardware

We present a novel method for checking the intersection of polygonal models on graphics hardware utilizing its SIMD, occlusion query, and floating point texture capabilities. It consists of two stages: traversal of bounding volume hierarchies, thus quickly determining potentially intersecting sets of polygons, and the actual intersection tests, resulting in lists of intersecting polygons. Unlike previous methods, our method does all computations in object space and does not make any requirements on connectivity or topology.

[1]  Gabriel Zachmann,et al.  High-Performance Collision Detection Hardware , 2003 .

[2]  Dinesh K. Pai,et al.  CInDeR: Collision and Interference Detection in Real-time using graphics hardware , 2003, Graphics Interface.

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

[4]  George Baciu,et al.  Hardware-assisted self-collision for deformable surfaces , 2002, VRST '02.

[5]  William J. Dally,et al.  Programmable Stream Processors , 2003, Computer.

[6]  Joachim Gudmundsson,et al.  Box-Trees and R-Trees with Near-Optimal Query Time , 2001, SCG '01.

[7]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[8]  Dinesh Manocha,et al.  CULLIDE: interactive collision detection between complex models in large environments using graphics hardware , 2003, HWWS '03.

[9]  Gabriel Zachmann,et al.  An Architecture for Hierarchical Collision Detection , 2003, WSCG.

[10]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[11]  Martin Held,et al.  ERIT - A Collection of Efficient and Reliable Intersection Tests , 1997, J. Graphics, GPU, & Game Tools.

[12]  George Baciu,et al.  Image-Based Techniques in a Hybrid Collision Detector , 2003, IEEE Trans. Vis. Comput. Graph..

[13]  S B MitchellJoseph,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998 .

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

[15]  Tomas Möller,et al.  A fast triangle-triangle intersection test , 1997 .

[16]  Mikio Shinya,et al.  Interference detection through rasterization , 1991, Comput. Animat. Virtual Worlds.

[17]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[18]  Dinesh Manocha,et al.  Collision queries using oriented bounding boxes , 2000 .

[19]  Jean-Christophe Lombardo,et al.  Real-time collision detection for virtual surgery , 1999, Proceedings Computer Animation 1999.

[20]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[21]  Tomas Akenine-Möller,et al.  Collision Detection for Continuously Deforming Bodies , 2001, Eurographics.

[22]  Richard L. Grimsdale,et al.  Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.

[23]  Gabriel Zachmann,et al.  Minimal hierarchical collision detection , 2002, VRST '02.

[24]  Nabil H. Mustafa,et al.  Streaming Geometric Optimization Using Graphics Hardware , 2003, ESA.