A parallel collision detection algorithm based on hybrid bounding volume hierarchy

One of the key problems with current interactive virtual environments is real-time collision detection. In this paper, a parallel algorithm for real-time, exact collision detection is presented. The approach adopts a hierarchical adaptive space subdivision scheme to construct a hybrid bounding representation of arbitrary non-convex polyhedra for attaining its speed, and speeds up collision detection further by traversing the built hybrid bounding volume hierarchy in parallel. The algorithm falls into MIMD synchronous parallel algorithms and is implemented with multi-threads, which enable it to run on both single processor computers and multi-processor computers. It is suitable for dynamic and complex scenes.