Two different views on collision detection
Torsten Ullrich, Christoph Fünfzig, Dieter W. Fellner · IEEE Potentials · 2007
In this article, we present two algorithms for precise collision detection between two potentially colliding objects. The first one uses axis-aligned bounding boxes (AABB) and is a typical representative of a computational geometry algorithm. The second one uses spherical distance fields originating in image processing. Both approaches addresses the following challenges of collision detection algorithms: just in time, little resources, inclusive etc. Thus both approaches are scalable in the information they give in collision determination and the analysis up to a fixed refinement level, the collision time depends on the granularity of the bounding volumes and it is also possible to estimate the time bounds for the collision test tightly