MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur
Leonhard Gruenschloß, Martin Stich, Sehera Nawaz, Alexander Keller
High-Performance Graphics, 2011, pp. 65--70.
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.
Article URL: http://dx.doi.org/10.1145/2018323.2018334
BibTeX format:
@inproceedings{Gruenschloss:2011:MAE,
  author = {Leonhard Gruenschloß and Martin Stich and Sehera Nawaz and Alexander Keller},
  title = {MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur},
  booktitle = {High-Performance Graphics},
  pages = {65--70},
  year = {2011},
}
Search for more articles by Leonhard Gruenschloß.
Search for more articles by Martin Stich.
Search for more articles by Sehera Nawaz.
Search for more articles by Alexander Keller.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."