An Efficient Collision Detection Algorithm for Polytopes in Virtual Environment
Efficient Collision Detection for Animation and Robotics
Ming C Lin
I-Collide: An Interactive and Exact Collision Detection System for Large-Scale Environments
Ming C Lin
Efficient Collision Detection of Complex Deformable Models using AABB Trees
1997 - Gino van den Bergen
This article shows that intersection testing for AABB is only sligthtly slower than for OBB, but the building of the trees used for exact intersection testing is many times faster for AABB than for OBB. Thus for exact collision testing with deformable objects AABB is better than OBB. For undeformable objects OBB is faster but uses more memory.
A Fast and Robust GJK Implementation for Collision Detection of Convex Objects
1999 - Gino van den Bergen
This article presents an algorithm for determining the distance or a separating axis between two convex objects. Tests have shown that the algorithm is 5 times faster than the closest-feature algoritm used in I-COLLIDE. The algorithm is described as the iterative GJK algorithm.
Proximity Queries and Penetration Depth Computation on 3D Game Objects
2001 - Gino van den Bergen
This article describes an algorithm for determining the penetration depth for two convex objects that intersect.