Research of hybrid hierarchical bounding volume tree based on Vega Prime

The collision detection algorithms of Vega Prime (VP) use several line segments to make intersection tests between two objects, which lead the distortion of collision detection easily in computer simulation. In order to overcome this shortcoming, a hybrid hierarchical bounding volume tree (HHBVT) algorithm based on VP is proposed. The HHBVT is divided into three layers in a top-down manner. The first layer uses bounding sphere, and both the second one and the third one use Axis-Aligned Bounding Boxes (AABB). But in the third layer, the twelve line segments of AABB are attached to a user-defined VP collision detector to check whether one object intersects with another or not. The experimental results demonstrate that not only the HHBVT algorithm based on VP makes up the shortcomings of collision detection algorithms in VP and optimizes the traditional collision detection algorithms, but also the accuracy and the real time of system are not affected.