The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—Fast and accurate collision detection between general polygonal models is a fundamental problem in physically based and geometric modeling, robotics, animation, and computer-simulated environments. Most earlier collision detection algorithms are either restricted to a class of models (such as convex polytopes) or are not fast enough for practical applications. We present an incremental algorithm for collision detection between general polygonal models in dynamic environments. The algorithm combines a hierarchical representation with incremental computation to rapidly detect collisions. It makes use of coherence between successive instances to efficiently determine the number of object features interacting. For each pair of objects, it tracks the closest features between them on their respective convex hulls. It detects the objects' penetration using pseudo internal Voronoi cells and constructs the penetration region, thus identifying the regions of contact on the convex hulls. The features associated with these regions are represented in a precomputed hierarchy. The algorithm uses a coherence based approach to quickly traverse the precomputed hierarchy and check for possible collisions between the features. We highlight its performance on different applications.</p>
INDEX TERMS
Collision detection, contacts, interference, dynamic simulation, physically based modeling, convex hulls, hierarchical representation.
CITATION
Madhav K. Ponamgi, Ming C. Lin, Dinesh Manocha, "Incremental Algorithms for Collision Detection Between Polygonal Models", IEEE Transactions on Visualization & Computer Graphics, vol. 3, no. , pp. 51-64, January-March 1997, doi:10.1109/2945.582346
93 ms
(Ver 3.3 (11022016))