摘要
对基于包围盒的碰撞检测算法中的轴向包围盒法、方向包围盒法、离散方向多面体法、时空包围盒法的检测原理和检测效率进行了详细地分析比较。分析结果表明:包围盒的简单性和它包裹对象的紧密性是一对矛盾,包围盒越简单其包裹紧密性越差,如何更好地兼顾简单性和紧密性成为包围盒法的关键;离散方向多面体是介于轴向包围盒和凸包之间的包围盒,只要合理地选取平行平面对的个数和方向,就可以在碰撞检测的简单性和包裹物体的紧密性之间灵活取舍。研究结论对于虚拟场景的动态建模具有一定的指导意义。
Different algorithms for collision detections （CD） in virtual scene were surveyed. The principle and effectiveness of axis-aligned bounding boxes （AABB） method, oriented bounding box method （OBB）, discrete orientation polytopes （k-DOP） method and Space-Time Bounding Boxes （STBB） method were discussed in detail. The results of analysis prove that the simpleness of bounding box is in contradiction with the compactness of wrapped object and the k-DOP method is between AABB method and OBB method in the effectiveness of CD. The main results are useful for designing virtual scene.
出处
《系统仿真学报》
EI
CAS
CSCD
北大核心
2006年第4期1058-1061,1064,共5页
Journal of System Simulation
关键词
虚拟现实
碰撞检测
算法
包围盒
virtual reality
collision detection
algorithm
bounding box
