An improved optimal algorithm for collision detection of hybrid hierarchical bounding box

Author(s):  
Baiqiang Gan ◽  
Qiuping Dong
2012 ◽  
Vol 220-223 ◽  
pp. 2803-2808
Author(s):  
Xiao Ping Wang ◽  
Xiu Cheng Dong

Collision detection in Vega Prime is based on the simple line segment, and collision detection based on bounding box is not realized. By studying the composition of three-dimensional object based on Oriented Bounding Box (OBB), we define a collision detection class, which inherits from vpIsector. After finding out all vertices of geometry in object, we connect these vertices one by one and constitute a tend line. The trend line constitutes our bounding box based on OBB. Now, our collision detection is based on three-dimensional objects, but not the simple line segment. At the same time, we can control the efficiency of collision detection by increasing or decreasing the number of collision lines on the actual demand. Additionally, on this basis, we have made the further application. By adjusting parameter, we can get a bounding box with early warning mechanism or collision tolerance.


2021 ◽  
Vol 336 ◽  
pp. 07008
Author(s):  
Chong Li ◽  
Yanyan Huang

In order to solve the problem of space-time conflict in multi route planning, this paper proposes a space-time conflict detection method based on bounding box. The main research contents include: dividing each route into a limited number of road sections, each road section uses a bounding box to represent the space occupied by the target in the period of time, and then using OBB collision detection method to judge whether there is different bounding box overlap in the same space at the same period of time, so as to judge whether there is a space-time conflict. In addition, calculating the distance among road sections to exclude road sections where conflicts are unlikely to occur before detection. The feasibility of the conflict detection method is verified by experiments on a multi route planning case.


2011 ◽  
Vol 30 (12) ◽  
pp. 3304-3306 ◽  
Author(s):  
Hong-bo LI ◽  
Dong-yu ZHOU ◽  
Yu WU

2011 ◽  
Vol 186 ◽  
pp. 645-649
Author(s):  
Yu Mei Xiong ◽  
Yi Min Chen ◽  
Yi Hao Chen

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.


Sign in / Sign up

Export Citation Format

Share Document