Intersection Test for Collision Detection in Particle Systems

1999 ◽  
Vol 4 (1) ◽  
pp. 25-37 ◽  
Author(s):  
Evaggelia-Aggeliki Karabassi ◽  
Georgios Papaioannou ◽  
Theoharis Theoharis ◽  
Alexander Boehm
2012 ◽  
Vol 56 (1) ◽  
pp. 1-10 ◽  
Author(s):  
WenShan Fan ◽  
Bin Wang ◽  
Jean-Claude Paul ◽  
JiaGuang Sun

2013 ◽  
Vol 433-435 ◽  
pp. 932-935
Author(s):  
Wei Zhao ◽  
Li Ming Ye

In order to improve the real-time and accuracy in the collision detection technology, a collision detection algorithm based on spatial partitioning and bounding volume was proposed . This algorithm adopted different spatial division strategies for different locations of the spaces according to the details in the scenes to exclude objects which can not intersect.Thus defined the potential intersection areas. Then we used a dynamic S-AABB hierarchy bounding boxes to test whether the intersection happened between the objects in the same grids. We used the sphere boxes to rule out the disjoint objects quickly. Then constructed the dynamic AABB bounding boxes trees for the rest of objects for further intersection test. At last, we improved the traditional overlapping test between the primitives for accurate collision detection . Compared to the traditional collision detection algorithm based on spatial partitioning and AABB bounding volume. This algorithm effectively improves the real-time of the collision detection without affecting the accuracy of original collision detection.


2012 ◽  
Vol 472-475 ◽  
pp. 2608-2611 ◽  
Author(s):  
Yan Bin Zheng ◽  
Ling Yun Guo ◽  
Jing Jing Liu

The collision detection in virtual scene can effectively improve the fidelity of virtual reality, however, the existing collision detection algorithm are not fully ideal. In this paper, a collision detection optimization algorithm based on hybrid bounding volumes is presented to improve the real-time ability of bounding volumes collision detection. The algorithm combines the simplicity of AABB-AABB overlap test with the tightness of k-dops. Bounding volumes binary trees of the objects are designed as double-layered structure, which employ AABBs at the top layer, and k-dops at other layers. The intersection test uses different methods to detect the contact status among objects. Quest tree method is used to speed up the algorithm. Experiment results show that the algorithm above is efficient in improving the real-time and accuracy of collision detecting.


2006 ◽  
Vol 17 (5) ◽  
pp. 527-535 ◽  
Author(s):  
Oren Tropp ◽  
Ayellet Tal ◽  
Ilan Shimshoni

2019 ◽  
Vol 56 (12) ◽  
pp. 787-796
Author(s):  
O. Furat ◽  
B. Prifling ◽  
D. Westhoff ◽  
M. Weber ◽  
V. Schmidt

Sign in / Sign up

Export Citation Format

Share Document