Name
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. © 2012 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1111/j.1467-8659.2011.02084.x | Comput. Graph. Forum |
Keywords | Field | DocType |
atomic operation,efficient image-based proximity queries,cpu implementation,object-space proximity query,wiley periodicals,image-space representation,early-stencil culling,rasterization capability,object-space precision,efficient algorithm,conservative rasterization,dense proximity information | Computer vision,Mipmap,Bounding volume,Collision detection,Polygon mesh,Virtual reality,Vertex (geometry),Computer science,Theoretical computer science,Real-time computer graphics,Artificial intelligence,Bounding overwatch | Journal |
Volume | Issue | ISSN |
31 | 1 | 0167-7055 |
Citations | PageRank | References |
0 | 0.34 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Morvan | 1 | 0 | 0.68 |
| M. Reimers | 2 | 10 | 0.97 |
| Eigil Samset | 3 | 37 | 4.46 |