Particle-based forecast mechanism for continuous collision detection in deformable environments
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Efficient Image-Based Proximity Queries with Object-Space Precision
Computer Graphics Forum
Short paper: approximating distance fields in image space
EGVE - JVRC'10 Proceedings of the 16th Eurographics conference on Virtual Environments & Second Joint Virtual Reality
An Image-Space Approach for Collision Detection Between Multiple Volumes and a Surface
International Journal of Creative Interfaces and Computer Graphics
k+-buffer: fragment synchronized k-buffer
Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
| Hi-index | 0.00 |
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs the standard triangle intersection test. When the bounding boxes of two objects intersect, the intersection is passed to the GPU. The object surfaces in the intersection are rendered into the A-buffer. Rendering into the A-buffer is up to eight-times faster than the ordinary approaches. Then, PCSs are computed by comparing the depth values of each texel of the A-buffer. A PCS consists of only two triangles. The PCSs are read back to the CPU, and the CPU computes the intersection points between the triangles. The proposed algorithm runs extremely fast, does not require any preprocessing, can handle dynamic objects including deformable and fracturing models, and can compute self-collisions. Such versatility and performance gain of the proposed algorithm prove its usefulness in real-time applications such as 3D games.