학술논문

Two different views on collision detection
Document Type
Periodical
Source
IEEE Potentials Potentials, IEEE. 26(1):26-30 Jan, 2007
Subject
General Topics for Engineers
Engineering Profession
Signal processing algorithms
Data structures
Object detection
Shape
Tree data structures
System testing
Performance evaluation
Language
ISSN
0278-6648
1558-1772
Abstract
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