A Collision Detection Method Based on Distance Priority and Spatiotemporal Correlation

Abstract

The invention discloses a collision detecting method based on distance precedence and space-time relevancy. Firstly, corresponding direction bounding boxes are constructed for an object to be detected, and corresponding layering bounding box trees are constructed; the layering bounding box trees are traversed, and in the bounding box traversing process, first-time traversal is carried out with root nodes corresponding to the bounding boxes as initial nodes , nodes not intersecting in the bounding boxes are recorded in a trace table, and in the second-time traversal process, the traversal is directly carried out on the non-intersecting nodes recorded in the trace table, and the updating strategy based on the distance precedence and space-time relevancy is carried out on the trace table in the second-time traversal process. According to the collision detecting method, the bounding boxes in the short distance are traversed, the optimal path is found, the number of traversed bounding boxes is reduced, and the collision detecting efficiency is improved; the trace table is stored in a stack mode, and the collision detecting process is accelerated.

Description

technical field [0001] The invention belongs to the field of collision detection, in particular to a collision detection method based on a direction bounding box, and introduces the idea of ​​distance priority and a time-space correlation method. Background technique [0002] Collision detection methods have good application prospects in computational geometry, computer animation, simulated robots and virtual reality and other fields. [0003] In recent decades, researchers at home and abroad have conducted extensive and in-depth research on collision detection. The mature and widely used methods include spatial decomposition method and hierarchical bounding box method. The space decomposition method is to divide the entire virtual space into units of equal volume and small size, and only conduct intersection tests on geometric objects occupying the same unit and adjacent cells. Typical examples include uniform grids, k-d trees, octrees, BSP tree. The spatial decomposition...

AI Technical Summary

Problems solved by technology

However, the OBB bounding box also has certain defects. In the process of traversing the OBB bounding box tree, the bounding box intersection test and the triangle intersection test are required. If the OBBs overlap, 15 tests are required. Then, when traversing the OBB bounding box tree In the process, a large number of bounding box-based intersection tests are required, which affects computational efficiency

Images