High Performance GPU-based Proximity Queries using Distance Fields
| dc.contributor.author | Morvan, T. | en_US |
| dc.contributor.author | Reimers, M. | en_US |
| dc.contributor.author | Samset, E. | en_US |
| dc.date.accessioned | 2015-02-21T13:21:51Z | |
| dc.date.available | 2015-02-21T13:21:51Z | |
| dc.date.issued | 2008 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.description.number | 8 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 27 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2008.01183.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 2040-2052 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2008.01183.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd | en_US |
| dc.title | High Performance GPU-based Proximity Queries using Distance Fields | en_US |