Parallel collision detection algorithm based on mixed BVH and OpenMP
Wei Zhao, Ruipu Tan, Wen-hui Li · 2008
Concerning the requirements of real-time and accurate collision detection in interactive system, we propose a shared memory parallel collision detection algorithm. First we incorporate the merits of both AABB bounding box and bounding spheres to construct a hybrid bounding representation of arbitrary non-convex polyhedra (S-AABB) for attaining speed, and then use OpenMP parallel programming model to traversal the built hybrid bounding volume hierarchy, so further accelerate the collision detection algorithm. At last, experiments results have shown that our algorithm is advantageous over other current typical collision detection algorithms such as I-COLLIDE [1] regarding efficiency and accuracy, so can meet the real-time and accurate requirements in complex interactive virtual environment.