一种改进的AABB包围盒树更新算法  

An Improved Algorithm of Updating AABB Bounding Volume Tree

作　　者：刘渊[1] 贾渊[1] 姚博[2] 刘薇[1] 

机构地区：[1]西南科技大学计算机科学与技术学院,四川绵阳621010 [2]西南科技大学信息工程学院,四川绵阳621010

出　　处：《兵工自动化》2008年第12期92-93,共2页Ordnance Industry Automation

摘　　要：包围盒树的更新效率是基于AABB包围盒树碰撞检测算法的瓶颈之一。利用时间相关性原理,在底层包围盒更新之后进行预处理,判断是否继续更新,从而减少更新的包围盒的数目,节省包围盒树更新所消耗的时间。实验证明在基元数目为4万个时,采用改进方法更新包围盒树比常用的SOLID算法库节省了20%的时间,提高了算法效率。The efficiency of updating AABB bounding volume tree is one of the bottlenecks of collision detection algorithms using AABB trees. Thanks to temporal coherence, dispose the data after the renewal of the boxes in the bottom, so that determine whether to continue or not. Therefore, reduce the boxes which are updated and save the time of the process. The experiments demonstrate that, when the number of primitive equals 40, 000 hours, the given updating method can improve the efficiency of SOLID by saving 20% of the time consumed for updating AABB trees.

关 键 词：AABB包围盒树 时空相关性 碰撞检测 效率 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]