基于AABB递进相交空间的快速碰撞检测算法

Fast Collision Detection Algorithm Based on AABB Progressive Intersection Space

针对包围盒在碰撞检测中相交的特点,提出一种将场景中两个相交AABB包围盒的相交部分作为新的子空间,再将子空间中的几何模型重新构造AABB包围盒并进行相交测试的递归碰撞检测方法.该方法从宏观到微观的递归方式可以快速确定两个几何模型是否相交,并且有效避免过多的前期准备工作,诸如:考虑构造AABB二叉树时的叶节点划分终止问题;对原始包围盒进行剖分并构造AABB包围盒层次树时,在存储空间方面的压缩存储问题.实验表明,该方法有效地提高了碰撞检测的效率.

According to the characteristics of the bounding box intersecting at in collision detection,a progressive collision detection is put forward by taking the intersection of the two intersecting AABB bounding box in the scene as the new sub-scene,then executing the intersection test between the model in the sub-scene.This method can quickly determine whether the two geometric models are intersected from macro to micro progressively,and avoid too much preparatory work,such as the ending problem about dividing the leaf nodes of the AABB binary tree structure,subdivision of original bounding box and constructing AABB bounding box hierarchy tree,compression storage issues in terms of storage space.Experiments show that this method can effectively improve the efficiency of collision detection.