Research on Bounding Box-Tree Algorithm for Collision Detection

Abstract:

Article Preview

In order to improve the efficiency of the collision detection for polyhedron, the paper proposed a collision detection algorithm based on bounding box-tree. The hierarchical bounding box –tree was built by dividing the polyhedron into tetrahedron. The collision detection can be completed by the method searching the bounding box-tree from top to bottom or from bottom to top. The algorithm quickly eliminated the possibility of collision between objects far apart. And it well adapted to the needs of the dynamic collision detection. Test results showed that the algorithm greatly improved the collision detection’s speed in virtual environment.

Info:

Periodical:

Edited by:

Wenya Tian and Linli Xu

Pages:

645-649

DOI:

10.4028/www.scientific.net/AMR.186.645

Citation:

Y. M. Xiong et al., "Research on Bounding Box-Tree Algorithm for Collision Detection", Advanced Materials Research, Vol. 186, pp. 645-649, 2011

Online since:

January 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.