A fast collision detection algorithm based on the hybrid bounding box

2018 ◽  
pp. 509-513
Keyword(s):  
Collision Detection ◽  
Detection Algorithm ◽  
Bounding Box ◽  
Fast Collision

Haptic Rendering: Practical Modeling and Collision Detection

1999 ◽  
Author(s):  
ZhuLiang Cai ◽  
John Dill ◽  
Shahram Payandeh
Keyword(s):  
Surgical Training ◽  
Collision Detection ◽  
Object Representation ◽  
Virtual Assembly ◽  
Detection Algorithm ◽  
Haptic Rendering ◽  
3D Object ◽  
Modeling Techniques ◽  
Simulation Results ◽  
Fast Collision

Abstract 3D collision detection and modeling techniques can be used in the development of haptic rendering schemes which can be used, for example, in surgical training, virtual assembly, or games. Based on a fast collision detection algorithm (RAPID) and 3D object representation, a practical haptic rendering system has been developed. A sub-system determines detailed collision information. Simulation results are presented to demonstrate the practicality of our results.

Fast collision detection algorithm based on image space

2013 ◽  
Vol 33 (2) ◽  
pp. 530-533
Author(s):  
Haijun YU ◽  
Chunyong MA ◽  
Tao ZHANG ◽  
Ge CHEN
Keyword(s):  
Collision Detection ◽  
Detection Algorithm ◽  
Image Space ◽  
Fast Collision

Collision detection algorithm based on mixed bounding box

2011 ◽  
Vol 30 (12) ◽  
pp. 3304-3306 ◽  
Author(s):  
Hong-bo LI ◽  
Dong-yu ZHOU ◽  
Yu WU
Keyword(s):  
Collision Detection ◽  
Detection Algorithm ◽  
Bounding Box

Research on Bounding Box-Tree Algorithm for Collision Detection

2011 ◽  
Vol 186 ◽  
pp. 645-649
Author(s):  
Yu Mei Xiong ◽  
Yi Min Chen ◽  
Yi Hao Chen
Keyword(s):  
Virtual Environment ◽  
Collision Detection ◽  
Detection Algorithm ◽  
Test Results ◽  
Tree Algorithm ◽  
Bounding Box ◽  
Bottom To Top

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.

Fast Collision Detection Algorithm Based on Parallel Doubling Technology

2014 ◽  
Vol 519-520 ◽  
pp. 824-827
Author(s):  
Hui Yan Qu ◽  
Wei Zhao
Keyword(s):  
Parallel Computing ◽  
Real Time ◽  
Collision Detection ◽  
Detection Algorithm ◽  
Fast Collision

This paper presents a doubling technology of fast traverse of the list .When parallel call recursively, distance of the division between data gradually doubled after completion of the operation, it was completed the operation of all the data the distance of 2M after calculation of M times. The experiment results show that the proposed method has higher efficiency compared with the normal stand-alone computing and parallel computing so it achieved real-time of CD.

Sign in / Sign up

Export Citation Format

Share Document