采用空间分割技术的八叉树干涉检验算法  

AN OCTREE ALGORITHM FOR COLLISION DETECTION USING SPACE PARTITION

作　　者：吴明华[1] 余勇翔[1] 周济[1] 

机构地区：[1]武汉华中理工大学CAD中心

出　　处：《计算机学报》1997年第9期849-854,共6页Chinese Journal of Computers

摘　　要：本文提出的八叉树干涉检验算法利用了空间分割技术，使在计算机仿真过程中动态干涉检验的速度得到显著提高．实体采用八叉树模型表示．根据实体模型之间的几何联系，这项技术按一个特定的准则划分仿真空间，从而可以直接确定模型中节点之间的位置关系．由于算法排除了试探性计算，所以能有效地改善干涉检验速度．另外，整个过程只需算术运算．This paper presents an octree algorithm for collision detection,employing the space partition technique, which drastically reduces the computation time consumed in dynamic collision detection during computer simulation. The simulated objects are represented in octrees. The space partition technique divides the simulated space based on a criterion derived from the geometric interdependence of the two octrees, so the relations (overlap or separate) among the nodes in the octreescan be directly pinpointed. Since heuristic procedures are excluded, time consumption for collision detection is greatly reduced. Further, simple arithmetic is enough to cover the problem.

关 键 词：干涉检验 八叉树 空间分割 计算机仿真 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]