Advanced

A Dynamic Bounding Volume Hierarchy for Generalized Collision Detection

Larsson, Thomas and Akenine-Möller, Tomas LU (2005) Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations In Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations p.91-100
Abstract
We propose a new dynamic and efficient bounding volume hierarchy for breakable objects undergoing structured and/or unstructured motion. Our object-space method is based on different ways to incrementally update the hierarchy during simulation by exploiting temporal coherence and lazy evaluation techniques. This leads to significant advantages in terms of execution speed. Furthermore, we also show how our method lends itself naturally for an adaptive low memory cost implementation, which may be of critical importance in some applications. Finally, we propose two different techniques for detecting self-intersections, one using our hierarchical data structure, and the other is an improved sorting-based method.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations
pages
91 - 100
conference name
Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations
language
English
LU publication?
yes
id
d07aaa1d-d8c3-4150-89bf-c1e52e4595c5 (old id 747691)
date added to LUP
2008-01-11 14:33:32
date last changed
2016-04-16 11:24:39
@misc{d07aaa1d-d8c3-4150-89bf-c1e52e4595c5,
  abstract     = {We propose a new dynamic and efficient bounding volume hierarchy for breakable objects undergoing structured and/or unstructured motion. Our object-space method is based on different ways to incrementally update the hierarchy during simulation by exploiting temporal coherence and lazy evaluation techniques. This leads to significant advantages in terms of execution speed. Furthermore, we also show how our method lends itself naturally for an adaptive low memory cost implementation, which may be of critical importance in some applications. Finally, we propose two different techniques for detecting self-intersections, one using our hierarchical data structure, and the other is an improved sorting-based method.},
  author       = {Larsson, Thomas and Akenine-Möller, Tomas},
  language     = {eng},
  pages        = {91--100},
  series       = {Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations},
  title        = {A Dynamic Bounding Volume Hierarchy for Generalized Collision Detection},
  year         = {2005},
}