Fast collision detection using the A-buffer

Hanyoung Jang, Junghyun Han

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)659-667
Number of pages9
JournalVisual Computer
Volume24
Issue number7-9
DOIs
Publication statusPublished - 2008 Jul 1

Fingerprint

Program processors
performance
Values
time
Graphics processing unit

Keywords

  • A-buffer
  • Deformable object
  • Real-time collision detection

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Fast collision detection using the A-buffer. / Jang, Hanyoung; Han, Junghyun.

In: Visual Computer, Vol. 24, No. 7-9, 01.07.2008, p. 659-667.

Research output: Contribution to journalArticle

Jang, Hanyoung ; Han, Junghyun. / Fast collision detection using the A-buffer. In: Visual Computer. 2008 ; Vol. 24, No. 7-9. pp. 659-667.
@article{14d9863203ad4e47bc9509831ab01915,
title = "Fast collision detection using the A-buffer",
abstract = "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.",
keywords = "A-buffer, Deformable object, Real-time collision detection",
author = "Hanyoung Jang and Junghyun Han",
year = "2008",
month = "7",
day = "1",
doi = "10.1007/s00371-008-0246-8",
language = "English",
volume = "24",
pages = "659--667",
journal = "The Visual Computer",
issn = "0178-2789",
publisher = "Springer Verlag",
number = "7-9",

}

TY - JOUR

T1 - Fast collision detection using the A-buffer

AU - Jang, Hanyoung

AU - Han, Junghyun

PY - 2008/7/1

Y1 - 2008/7/1

N2 - 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.

AB - 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.

KW - A-buffer

KW - Deformable object

KW - Real-time collision detection

UR - http://www.scopus.com/inward/record.url?scp=46749089973&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46749089973&partnerID=8YFLogxK

U2 - 10.1007/s00371-008-0246-8

DO - 10.1007/s00371-008-0246-8

M3 - Article

AN - SCOPUS:46749089973

VL - 24

SP - 659

EP - 667

JO - The Visual Computer

JF - The Visual Computer

SN - 0178-2789

IS - 7-9

ER -