2490

Fast collision detection using the A-buffer

Han-Young Jang, JungHyun Han
Game Research Center, Korea University, Seoul, Korea
The Visual Computer, Volume 24, Numbers 7-9, 659-667

@article{jang2008fast,

   title={Fast collision detection using the A-buffer},

   author={Jang, H. and Han, J.H.},

   journal={The Visual Computer},

   volume={24},

   number={7},

   pages={659–667},

   issn={0178-2789},

   year={2008},

   publisher={Springer}

}

Download Download (PDF)   View View   Source Source   

814

views

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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: