continuous-collision-detection
Goto Github
PK
Name: Continuous Collision Detection
Type: Organization
Bio: Code for continuous collision detection methods bechmarked in "A Large Scale Benchmark and an Inclusion-Based Algorithm for Continuous Collision Detection"
Blog: https://continuous-collision-detection.github.io
Continuous Collision Detection's Projects
Read CCD queries in rational CSV data format
A library for various continuous collision detection algorithms.
Our organization website
Exact floating-point implementation of root parity CCD [Wang et al. 2022]
Fast Root Approximate in Cubic CCD from "Penetration-free Projective Dynamics on the GPU" [Lan et al. 2022]
CCD using the floating-point root finder method of [Provot 1997; Vouga et al. 2010]
Minimum separation CCD using the floating point root finder method of [Harmon et al. 2011].
Rational Root Parity CCD, it is a reimplementation of [Brochu et al.2012] using rational numbers.
Fork of code from "Efficient Geometrically Exact Continuous Collision Detection" and "Fast and Exact Continuous Collision Detection with Bernstein Sign Classification"
Sample of CCD queries
Sample ground truth data for Scalable CCD
Sweep and Tiniest Queue & Tight-Inclusion GPU CCD
Symbolic CCD using Mathematica
A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]
Fork of code from "TightCCD: Efficient and Robust Continuous Collision Detection using Tight Error Bounds" [Wang et al. 2015]