Volume 28, Issue 7 pp. 1791-1800

HPCCD: Hybrid Parallel Continuous Collision Detection using CPUs and GPUs

Duksu Kim

Duksu Kim

KAIST (Korea Advanced Institute of Science and Technology), Project URL: http://sglab.kaist.ac.kr/HPCCD

Search for more papers by this author
Jae-Pil Heo

Jae-Pil Heo

KAIST (Korea Advanced Institute of Science and Technology), Project URL: http://sglab.kaist.ac.kr/HPCCD

Search for more papers by this author
Jaehyuk Huh

Jaehyuk Huh

KAIST (Korea Advanced Institute of Science and Technology), Project URL: http://sglab.kaist.ac.kr/HPCCD

Search for more papers by this author
John Kim

John Kim

KAIST (Korea Advanced Institute of Science and Technology), Project URL: http://sglab.kaist.ac.kr/HPCCD

Search for more papers by this author
Sung-eui Yoon

Sung-eui Yoon

KAIST (Korea Advanced Institute of Science and Technology), Project URL: http://sglab.kaist.ac.kr/HPCCD

Search for more papers by this author
First published: 02 December 2009
Citations: 48

Abstract

We present a novel, hybrid parallel continuous collision detection (HPCCD) method that exploits the availability of multi-core CPU and GPU architectures. HPCCD is based on a bounding volume hierarchy (BVH) and selectively performs lazy reconstructions. Our method works with a wide variety of deforming models and supports self-collision detection. HPCCD takes advantage of hybrid multi-core architectures – using the general-purpose CPUs to perform the BVH traversal and culling while GPUs are used to perform elementary tests that reduce to solving cubic equations. We propose a novel task decomposition method that leads to a lock-free parallel algorithm in the main loop of our BVH-based collision detection to create a highly scalable algorithm. By exploiting the availability of hybrid, multi-core CPU and GPU architectures, our proposed method achieves more than an order of magnitude improvement in performance using four CPU-cores and two GPUs, compared to using a single CPU-core. This improvement results in an interactive performance, up to 148 fps, for various deforming benchmarks consisting of tens or hundreds of thousand triangles.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.