A Dynamic Bounding Volume Hierarchy for Generalized Collision Detection
(2005) 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:
https://lup.lub.lu.se/record/747691
- author
- Larsson, Thomas and Akenine-Möller, Tomas LU
- organization
- publishing date
- 2005
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- 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
- conference location
- Pisa, Italy
- conference dates
- 2005-11-07
- language
- English
- LU publication?
- yes
- id
- d07aaa1d-d8c3-4150-89bf-c1e52e4595c5 (old id 747691)
- date added to LUP
- 2016-04-04 13:35:27
- date last changed
- 2021-05-06 19:25:14
@inproceedings{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}}, booktitle = {{Proceedings of the 2nd Workshop on Virtual Reality Interactions and Physical Simulations}}, language = {{eng}}, pages = {{91--100}}, title = {{A Dynamic Bounding Volume Hierarchy for Generalized Collision Detection}}, url = {{https://lup.lub.lu.se/search/files/6157592/924448.pdf}}, year = {{2005}}, }