A Collision Detection Algorithm Based on Spatial Partitioning and Bounding Volume
In order to improve the real-time and accuracy in the collision detection technology, a collision detection algorithm based on spatial partitioning and bounding volume was proposed . This algorithm adopted different spatial division strategies for different locations of the spaces according to the details in the scenes to exclude objects which can not intersect.Thus defined the potential intersection areas. Then we used a dynamic S-AABB hierarchy bounding boxes to test whether the intersection happened between the objects in the same grids. We used the sphere boxes to rule out the disjoint objects quickly. Then constructed the dynamic AABB bounding boxes trees for the rest of objects for further intersection test. At last, we improved the traditional overlapping test between the primitives for accurate collision detection . Compared to the traditional collision detection algorithm based on spatial partitioning and AABB bounding volume. This algorithm effectively improves the real-time of the collision detection without affecting the accuracy of original collision detection.