MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur

Thumbnail Image
Date
2011
Authors
Gruenschloß, Leonhard
Stich, Martin
Nawaz, Sehera
Keller, Alexander
Journal Title
Journal ISSN
Volume Title
Publisher
ACM
Abstract
When a bounding volume hierarchy is used for accelerating the intersection of rays and scene geometry, one common way to incorporate motion blur is to interpolate node bounding volumes according to the time of the ray. However, such hierarchies typically exhibit large overlap between bounding volumes, which results in an inefficient traversal. This work builds upon the concept of spatially partitioning nodes during tree construction in order to reduce overlap in the presence of moving objects. The resulting hierarchies are often significantly cheaper to traverse than those generated by classic approaches.
Description

        
@inproceedings{
10.1145:2018323.2018334
,
booktitle = {
Eurographics/ ACM SIGGRAPH Symposium on High Performance Graphics
},
editor = {
Carsten Dachsbacher and William Mark and Jacopo Pantaleoni
},
title = {{
MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur
}},
author = {
Gruenschloß, Leonhard
 and 
Stich, Martin
 and 
Nawaz, Sehera
 and 
Keller, Alexander
},
year = {
2011
},
publisher = {
ACM
},
ISSN = {
2079-8687
},
ISBN = {
978-1-4503-0896-0
},
DOI = {
10.1145/2018323.2018334
}
}
Citation
URI
https://doi.org/10.1145/2018323.2018334
Collections
High-Performance Graphics 2011