一种面向虚拟维修的快速碰撞检测方法

摘要

This article proposed an algorithm based on space decomposition and hierarchical bounding volume methods taking the characteristics of collision detection in virtual maintenance into account. The algorithm firstly used space decomposition, to remove those objects that have no possible of collision, then used bounding volume to find collision accurately. It shows the methods of building hierarchical bounding tree and space division. The data structure of hash table and synchronous depth traversal methods were used to accelerate the detection speed. Finally, the algorithm was applied in CATIA/CAA, the results show that the algorithm meets the real-time requirements.%针对虚拟维修中碰撞检测的自身特点,提出一种基于空间均匀网格的层次包围盒算法,该算法首先使用空间划分剔除不必要检测的物体,再通过层次包围盒法准确地找出相交的物体.文中给出了层次包围树的构建方法、空间划分方法,并且采用哈希数据结构和同步深度遍历方法加速了检测的速度.最后在CATIA/CAA平台上实现了该算法,验证了算法的实时性能.