Temporal coherence in bounding volume hierarchies for collision detection

Oren Tropp, T. A.L. Ayellet, Ilan Shimshoni, David P. Dobkin

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

Collision detection is a fundamental problem in computer graphics. In this paper, temporal coherence is studied and an algorithm exploiting it for bounding volume hierarchies, is presented. We show that maintaining some of the intersection tests computed in the previous frame, along with certain information, is able to speedup the intersection tests considerably. The algorithm is able to accelerate the collision detection for small motions and works as fast as the regular algorithm for large motions, where temporal coherence does not exist. The algorithm framework can be implemented for any type of bounding volume hierarchy. To demonstrate this, it was implemented for the OBB and the AABB data structures and tested on several benchmark scenarios.

Original languageEnglish (US)
Pages (from-to)159-178
Number of pages20
JournalInternational Journal of Shape Modeling
Volume12
Issue number2
DOIs
StatePublished - Dec 1 2006

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Computer Vision and Pattern Recognition
  • Computer Science Applications
  • Geometry and Topology
  • Applied Mathematics

Keywords

  • AABB
  • Bounding volume hierarchies
  • Collision detection
  • OBB

Fingerprint Dive into the research topics of 'Temporal coherence in bounding volume hierarchies for collision detection'. Together they form a unique fingerprint.

Cite this