Collision Detection Research Based On OBB

Collision Detection is one of the basic questions in many fields, such as virtual reality, cartoon emulation, CAD, etc. Its basic task is to confirm whether two or a lot of objects are kept in touch or pierced through each other. Though people have already made a series of achievements, these algorithms lay particular emphasis on accuracy measure, and seldom involve real-time character. Following by the development of computer software,hardware and network, mutual real-time character and scene authenticity make it become a hot focus again.Bounding volume hierarchy provides an effective method to resolve the intrinsic time complexity in collision detection. The idea behind it is to approximate the object with a simpler bounding volume that is a little bigger than the object. In building hierarchies on object, one can obtain increasingly more accurate approximations of the objects. So during traversing bounding volume hierarchy, it speeds up collision detection by prune away primitive pairs, which will not intersect clearly though rapid intersection test between bounding volumes and just deal with those whose bounding volume is intersected. The choice of bounding volume is the basic and key problem of this approach.The article carried on overall analysis of all kinds of algorithms at first, and then probe into the thought and procedure of OBB algorithms especially. At last, we improved the efficiency of OBB algorithms. This paper content of several respects under the main research:(1) Based on the full research of inherent characters of OBB hierarchical box, this thesis implements a series of key techniques such as building OBB and OBB tree, and overlap test between OBB boxes, verifies the attribute that OBB has the advantage that it is fit for the collision detection between rigid bodies and optimizes the shortcomings and disadvantages of OBB.(2) Based on Temporal-spatial coherence of the fictitious environment dependence, we optimize the algorithm by utilizing buffer memory and arranging in an order etc.(3) Based on the limitations of OBB, this thesis proposes an optimizing overlap test algorithm of bounding box and primitive. This method eliminates the bounding boxes of leaf nodes and streamlines the OBB hierarchical layer. This method also introduces a separating axis theory in the overlapping test between the primitives in order to accelerate the velocity. By scientifically arranging groups of overlapping methods, this thesis proposes an optimizing hierarchical hybrid algorithm based on OBB to enhance the reliability and actual running efficiency.Scientific results and concrete implementations demonstrate that the collision detection method based on OBB can solve the collision detection problems between rigid bodies in a large-scale complex environment. The research achievements of this thesis have certain theoretical value and practical significance to the collision detection in a large-scale complex environment.