.png){kind=icon}
Return
Rapid pairwise intersection tests using programmable GPUs
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-006-0368-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Detecting self-intersections within a triangular mesh model is fundamentally a quadratic problem in terms of its computational complexity, since in principle all triangles must be compared with all others. We reflect the 2D nature of this process by storing the triangles as multiple 1D textures in texture memory, and then exploit the massive parallelism of graphics processing units (GPUs) to perform pairwise comparisons, using a pixel shader. This approach avoids the creation and maintenance of auxiliary geometric structures, such as a bounding volume hierarchy (BVH); but nevertheless we can plug in auxiliary culling schemes, and use stencils to indicate triangle pairs that do not need to be compared. To overcome the readback bottleneck between GPU and CPU, we use a hierarchical encoding scheme. We have applied our technique to detecting self-intersections in extensively deformed models, and we achieve an order of magnitude increase in performance over CPU-based techniques such as [17].
Keywords:
collision detection
geometric modeling
programmable shaders
deformable body simulation
computer animation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
4.6K
Citations:
6.5K
Organization
No organization information available
Cited Papers
ShareSaveA hybrid elastic model for real-time cutting, deformations, and force feedback for surgery training and simulation.png)
VISUAL COMPUTER
VISUAL COMPUTERIF2.9
PREAI
ShareSaveStructural insights into the extracellular assembly of the hematopoietic Flt3 signaling complexBlood
OAAI
BloodIF0
OAAIShareSaveShareSave
View more