C2A: Controlled conservative advancement for continuous collision detection of polygonal models
Authors:
- 1 May 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 849-854
Abstract
We present a simple and fast algorithm to perform continuous collision detection between polygonal models undergoing rigid motion for interactive applications. Our approach can handle all triangulated models and makes no assumption about the underlying geometry and topology. The algorithm uses the notion of conservative advancement (CA), originally developed for convex polytopes. We extend this formulation to general models using swept sphere volume hierarchy and present a compact formulation to compute the motion bounds along with a novel controlling scheme. We have implemented the algorithm and highlight its performance on various benchmarks. In practice, our algorithm can perform continuous collision queries in few milli-seconds on models composed of tens of thousands of triangles.Keywords
This publication has 17 references indexed in Scilit:
- Fast collision detection for deformable models using representative-triangles2008
- Continuous collision detection for articulated models using Taylor models and temporal cullingACM Transactions on Graphics, 2007
- Interactive continuous collision detection for non-convex polyhedraThe Visual Computer, 2006
- SWEPT VOLUMES: FUNDATION, PERSPECTIVES, AND APPLICATIONSInternational Journal of Shape Modeling, 2006
- Interactive collision detection between deformable models using chromatic decompositionACM Transactions on Graphics, 2005
- Interactive and continuous collision detection for avatars in virtual environments2004
- Kinetic collision detection for simple polygons2000
- An algebraic solution to the problem of collision detection for rigid polyhedral objects2000
- Fast collision detection among multiple moving spheres1997
- OBBTree1996