Collision detection method based on bounding volume tree

Abstract

The invention provides a collision detection method based on a bounding volume tree, which performs detection from the root portion to the branch extreme end and includes that: step a building the bounding volume tree of two objects; step b obtaining current nodes of the bounding volume tree of the two objects for performing detection with two nodes as a group, judging whether the two nodes collide, and turning to step c if collision happens, otherwise, turning to step d; step c judging whether the current nodes are leaf nodes, recording the nodes if the current nodes are leaf nodes, returning and performing accurate detection to determine whether collision really happens, otherwise, taking all sub nodes of the current nodes as the current nodes of the tree and recursively executing the step b; and step d calculating node information including 'nearest distance', 'speed' and 'whether nodes are collided' if the current nodes do not contain undetected brother nodes and returning, otherwise, sequentially taking next brother nodes as the current nodes of the tree and recursively executing the step b. A method for performing detection from the branch extreme end to the root portion is further provided.

Description

technical field [0001] The invention relates to a collision detection method, in particular to a collision detection method based on a bounding box tree. Background technique [0002] Collision problems have received more attention for many years, and collision detection methods have good application prospects in computational geometry, computer animation, CAD / CAM, simulated robots and virtual reality. [0003] In the past two decades, researchers have done a lot of meaningful work in the field of collision detection, and proposed some relatively mature methods, which are generally divided into two categories: geometric decomposition method and hierarchical bounding box Law. The former divides the entire virtual space into small cells of equal volume, and only calculates the intersection of geometric objects occupying the same cell or adjacent cells. Typical examples are: octree, k-d tree, BSP tree, etc. The characteristics of this type of method are: the method is compli...

AI Technical Summary

Problems solved by technology

Although layered bounding box technology can also be used to speed up the collision detection of object scenes, the general bounding box method as a whole method has low detection accuracy and the efficiency improvement is not obvious

Images