Efficient Image-Based Proximity Queries with Object-Space Precision
| dc.contributor.author | Morvan, T. | en_US |
| dc.contributor.author | Reimers, M. | en_US |
| dc.contributor.author | Samset, E. | en_US |
| dc.contributor.editor | Holly Rushmeier and Oliver Deussen | en_US |
| dc.date.accessioned | 2015-02-28T08:25:29Z | |
| dc.date.available | 2015-02-28T08:25:29Z | |
| dc.date.issued | 2012 | en_US |
| dc.description.abstract | We present an efficient algorithm for object-space proximity queries between multiple deformable triangular meshes. Our approach uses the rasterization capabilities of the GPU to produce an image-space representation of the vertices. Using this image-space representation, inter-object vertex-triangle distances and closest points lying under a user-defined threshold are computed in parallel by conservative rasterization of bounding primitives and sorted using atomic operations. We additionally introduce a similar technique to detect penetrating vertices. We show how mechanisms of modern GPUs such as mipmapping, Early-Z and Early-Stencil culling can optimize the performance of our method. Our algorithm is able to compute dense proximity information for complex scenes made of more than a hundred thousand triangles in real time, outperforming a CPU implementation based on bounding volume hierarchies by more than an order of magnitude. | en_US |
| dc.description.number | 1 | |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 31 | |
| dc.identifier.doi | 10.1111/j.1467-8659.2011.02084.x | |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2011.02084.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Efficient Image-Based Proximity Queries with Object-Space Precision | en_US |