Efficient Collision Detection Using a Dual K-DOP-Sphere Bounding Volume Hierarchy

Collision detection is of paramount importance for many applications in computer graphics and visualization. In this research, we present an efficient algorithm for collision detection using a dual bounding hierarchy which consists of an discrete orientation polytopes (k-DOPs) tree enhanced with bounding sphere. The algorithm combines the compactness of the k-DOP and the efficient overlap test for spheres. The more efficient sphere test is applied firstly to eliminate distant objects. The remaining objects are in close proximity are tested using separation axis, where some separation axis are more effective and should be chosen first. We apply the efficient approach to the virtual acupuncture medical treatment systems, and the experimental results show that the new algorithm effectively reduces the query time and enhances the reality character with respect to the existing collection detection algorithms.

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

[2]  Gershon Elber,et al.  Continuous Collision Detection for Ellipsoids , 2009, IEEE Transactions on Visualization and Computer Graphics.

[3]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Hiroshi Noborio,et al.  Fast interference check method using octree representation , 1988, Adv. Robotics.

[5]  John Amanatides,et al.  Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.

[6]  Ned Greene,et al.  Detecting Intersection of a Rectangular Solid and a Convex Polyhedron , 1994, Graphics gems.

[7]  George Vanĕček,et al.  Collision Detection and Analysis in a Physically Based Simulation , 1991 .

[8]  Stephen Cameron,et al.  Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..

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

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

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

[12]  Martin Held,et al.  Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs , 1995 .

[13]  Xinyu Zhang,et al.  Interactive Collision Detection for Deformable Models Using Streaming AABBs , 2007, IEEE Transactions on Visualization and Computer Graphics.

[14]  George Vancek BRep-Index: a multidimensional space partitioning tree , 1991, Symposium on Solid Modeling and Applications.

[15]  Doug L. James,et al.  BD-tree: output-sensitive collision detection for reduced deformable models , 2004, SIGGRAPH 2004.

[16]  Bernard Chazelle,et al.  Self-customized BSP trees for collision detection , 2000, Comput. Geom..

[17]  George Vaněček BRep-Index: a multidimensional space partitioning tree , 1990 .

[18]  Tomas Akenine-Möller,et al.  Real-time rendering , 1997 .

[19]  Dinesh Manocha,et al.  Fast continuous collision detection for articulated models , 2004, SM '04.

[20]  Alejandro M. García-Alonso,et al.  Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.

[21]  M. Levas OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[22]  Jane Wilhelms,et al.  Collision Detection and Response for Computer Animation , 1988, SIGGRAPH.

[23]  Tomas Akenine-Möller,et al.  Efficient collision detection for models deformed by morphing , 2003, The Visual Computer.

[24]  Dana H. Ballard,et al.  Strip trees: a hierarchical representation for curves , 1981, CACM.

[25]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

[26]  Abderrahmane Kheddar,et al.  Fast Continuous Collision Detection between Rigid Bodies , 2002, Comput. Graph. Forum.

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