期刊
COMPUTER GRAPHICS FORUM
卷 27, 期 8, 页码 2040-2052出版社
WILEY
DOI: 10.1111/j.1467-8659.2008.01183.x
关键词
proximity queries; collision detection; distance fields; GPU
资金
- European Community [MRTN-CT-2004-512400]
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modelling, augmented and virtual reality. We present efficient algorithms for proximity queries between a closed rigid object and an arbitrary, possibly deformable, polygonal mesh. Using graphics hardware to densely sample the distance field of the rigid object over the arbitrary mesh, we compute minimal proximity and collision response information on the graphics processing unit (GPU) using blending and depth buffering, as well as parallel reduction techniques, thus minimizing the readback bottleneck. Although limited to image-space resolution, our algorithm provides high and steady performance when compared with other similar algorithms. Proximity queries between arbitrary meshes with hundreds of thousands of triangles and detailed distance fields of rigid objects are computed in a few milliseconds at high-sampling resolution, even in situations with large overlap.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据