Comparing Two Continuous Collision Detection Algorithms on CPU and GPUs

2016 ◽  
Author(s):  
Yao Liu ◽  
Xinyu Zhang
Keyword(s):  
Collision Detection ◽  
Detection Algorithms ◽  
Continuous Collision Detection

Collision Detection between Rigid Bodies Based on Adaptive Test Lines

2013 ◽  
Vol 756-759 ◽  
pp. 3189-3193
Author(s):  
Xiao Dong Shao ◽  
Wei Gao ◽  
Huan Lling Liu
Keyword(s):  
Collision Detection ◽  
Detection Efficiency ◽  
Rigid Bodies ◽  
Collision Point ◽  
Detection Algorithms ◽  
Adaptive Test ◽  
Rigid Objects ◽  
Continuous Collision Detection ◽  
Volume Algorithm ◽  
Swept Volume

A novel algorithm, which can check the collision point of rigid objects continuously and solve the problem of penetration and crossing in collision detection effectively, is presented in this paper. At each simulation moment, the adaptive test lines (ATLs) are first constructed based on the velocity vector of the moving object and then the intersection between the ATLs and the environment is calculated. The collision happens when the intersection is not empty and the collision point is obtained through crossing-frame processing. By checking the interference between body and ATLs instead of bodies, we greatly improve the detection efficiency. It avoids missing collisions for an object with arbitrary shape or in any motion states. Simulation results show that our algorithm runs faster than the general continuous collision detection algorithms and has similar detection effects to the swept volume algorithm.

Collision Detection Using the GJK Algorithm

2012 ◽  
pp. 253-288 ◽  
Author(s):  
William N. Bittle
Keyword(s):  
Collision Detection ◽  
Detection Algorithm ◽  
Ray Casting ◽  
Detection Algorithms ◽  
Continuous Collision Detection

GJK is a fast and elegant collision detection algorithm. Originally designed to determine the distance between two convex shapes, it has been adapted to collision detection, continuous collision detection, and ray casting. Its versatility, speed, and compactness have allowed GJK to be one of the top choices of collision detection algorithms in a number of fields.

scholarly journals A Large-scale Benchmark and an Inclusion-based Algorithm for Continuous Collision Detection

2021 ◽  
Vol 40 (5) ◽  
pp. 1-16
Author(s):  
Bolun Wang ◽  
Zachary Ferguson ◽  
Teseo Schneider ◽  
Xin Jiang ◽  
Marco Attene ◽  
...  
Keyword(s):  
Collision Detection ◽  
Large Scale ◽  
State Of The Art ◽  
False Positives ◽  
False Negatives ◽  
Detection Algorithms ◽  
Root Finding ◽  
Continuous Collision Detection ◽  
Degenerate Cases ◽  
Design Techniques

We introduce a large-scale benchmark for continuous collision detection (CCD) algorithms, composed of queries manually constructed to highlight challenging degenerate cases and automatically generated using existing simulators to cover common cases. We use the benchmark to evaluate the accuracy, correctness, and efficiency of state-of-the-art continuous collision detection algorithms, both with and without minimal separation. We discover that, despite the widespread use of CCD algorithms, existing algorithms are (1) correct but impractically slow; (2) efficient but incorrect, introducing false negatives that will lead to interpenetration; or (3) correct but over conservative, reporting a large number of false positives that might lead to inaccuracies when integrated in a simulator. By combining the seminal interval root finding algorithm introduced by Snyder in 1992 with modern predicate design techniques, we propose a simple and efficient CCD algorithm. This algorithm is competitive with state-of-the-art methods in terms of runtime while conservatively reporting the time of impact and allowing explicit tradeoff between runtime efficiency and number of false positives reported.

scholarly journals Continuous Collision Detection for Two Moving Elliptic Disks

2006 ◽  
Vol 22 (2) ◽  
pp. 213-224 ◽  
Author(s):  
Y.-K. Choi ◽  
W. Wang ◽  
Y. Liu ◽  
M.-S. Kim
Keyword(s):  
Collision Detection ◽  
Continuous Collision Detection

Subspace Culling for Continuous Collision Detection

2012 ◽  
Author(s):  
Yong Shui ◽  
Jinjin Zheng ◽  
Xuegang Ma ◽  
Hongjun Zhou ◽  
Lianguan Shen
Keyword(s):  
Collision Detection ◽  
Continuous Collision Detection

scholarly journals Efficient n-to-n Collision Detection for Space Debris using 4D AABB Trees

10.29007/5pl1 ◽  
2019 ◽  
Author(s):  
Stanley Bak ◽  
Kerianne Hobbs
Keyword(s):  
Collision Detection ◽  
Space Debris ◽  
Dynamics Simulation ◽  
Video Gaming ◽  
Time Dimension ◽  
Detection Algorithms ◽  
Space Objects ◽  
Tree Data ◽  
Tree Data Structure ◽  
Three Space

Collision detection algorithms are used in aerospace, swarm robotics, automotive, video gaming, dynamics simulation and other domains. As many applications of collision detection run online, timing requirements are imposed on the algorithm runtime: algorithms must, at a minimum, keep up with the passage of time. Even offline reachability computation can be slowed down by the process of safety checking when n is large and the specification is n-to-n collision avoidance. In practice, this places a limit on the number of objects, n, that can be concurrently tracked or verified. In this paper, we present an improved method for efficient object tracking and collision detection, based on a modified version of the axis-aligned bounding-box (AABB) tree data structure. We consider 4D AABB Trees, where a time dimension is added to the usual three space dimensions, in order to enable per-object time steps when checking for collisions in space-time. We evaluate the approach on a space debris collision benchmark, demonstrating efficient checking beyond the full catalog of n = 16848 space objects made public by the U.S. Strategic Command on www.space-track.org.

HPCCD: Hybrid Parallel Continuous Collision Detection using CPUs and GPUs

2009 ◽  
Vol 28 (7) ◽  
pp. 1791-1800 ◽  
Author(s):  
Duksu Kim ◽  
Jae-Pil Heo ◽  
Jaehyuk Huh ◽  
John Kim ◽  
Sung-eui Yoon
Keyword(s):  
Collision Detection ◽  
Continuous Collision Detection
Sign in / Sign up

Export Citation Format

Share Document