A Large Scale Benchmark and an Inclusion-Based Algorithm for Continuous Collision Detection

09/28/2020
by   Bolun Wang, et al.
0

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 either: (1) correct but impractically slow, (2) efficient but incorrect, introducing false negatives which will lead to interpenetration, or (3) correct but over conservative, reporting a large number of false positives which 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 trade off between runtime efficiency and number of false positives reported.

READ FULL TEXT

page 1

page 5

page 6

page 9

page 10

page 12

page 13

page 14

research
12/12/2021

Scalable and Conservative Continuous Collision Detection for GPU

We introduce an algorithm for continuous collision detection (CCD) for l...
research
11/18/2020

Barycode-based GJK Algorithm

In this paper, we present a more efficient GJK algorithm to solve the co...
research
08/26/2019

Tech Report: Efficient and Exact Collision Detection for Circular Agents

A common problem in multi-robot algorithms is collision detection. Many ...
research
04/30/2019

Detecting Reflections by Combining Semantic and Instance Segmentation

Reflections in natural images commonly cause false positives in automate...
research
12/24/2018

The Online Event-Detection Problem

Given a stream S = (s_1, s_2, ..., s_N), a ϕ-heavy hitter is an item s_i...
research
01/29/2019

Efficient n-to-n Collision Detection for Space Debris using 4D AABB Trees (Extended Report)

Collision detection algorithms are used in aerospace, swarm robotics, au...
research
08/17/2020

CheckDP: An Automated and Integrated Approach for Proving Differential Privacy or Finding Precise Counterexamples

We propose CheckDP, the first automated and integrated approach for prov...

Please sign up or login with your details

Forgot password? Click here to reset