Research on Collision Detection Algorithm Based on AABB-OBB Bounding Volume

Collision detection is pretty important in Virtual Reality, and its speed greatly influences the reality and illusion of immersion in virtual environment. We propose a collision detection algorithm of hybrid bounding box based on the merits of AABB and OBB: AABB-OBB. It is applicable to solid objects. We construct simpler bounding volume tree and apply improved data structure to decrease storage space. During the period of traverse AABB-OBBTree, we have applied single traverse method to improve the efficiency of collision detection,and its effect is more obvious especially when the depth of trees is different greatly.

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

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

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

[4]  Lihui Chen,et al.  A novel nonparametric clustering algorithm for discovering arbitrary shaped clusters , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.

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