Fast and reliable collision culling using graphics hardware
University of North Carolina at Chapel Hill
IEEE transactions on visualization and computer graphics, Vol. 12, No. 2. (r 2006), pp. 143-154
@article{govindaraju2006fast,
title={Fast and reliable collision culling using graphics hardware},
author={Govindaraju, N.K. and Lin, M.C. and Manocha, D.},
journal={IEEE Transactions on Visualization and Computer Graphics},
pages={143–154},
issn={1077-2626},
year={2006},
publisher={Published by the IEEE Computer Society}
}
We present a reliable culling algorithm that enables fast and accurate collision detection between triangulated models in a complex environment. Our algorithm performs fast visibility queries on the GPUs for eliminating a subset of primitives that are not in close proximity. In order to overcome the accuracy problems caused by the limited viewport resolution, we compute the Minkowski sum of each primitive with a sphere and perform reliable 2.5D overlap tests between the primitives. We are able to achieve more effective collision culling as compared to prior object-space culling algorithms. We integrate our culling algorithm with CULLIDE [1] and use it to perform reliable GPU-based collision queries at interactive rates on all types of models, including nonmanifold geometry, deformable models, and breaking objects.
December 4, 2010 by hgpu
