Adaptive Collapsing on Bounding Volume Hierarchies for Ray-Tracing
Loading...
Date
2010
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
Ray tracing is a computationally intensive process, several tree data structures and heuristics have been developed to optimize it. This paper presents a new heuristic in the area, based on collapsing some nodes in order to achieve a smaller expected number of node-tests. Two ways of using this heuristic in Bounding Volume Hierarchies are presented as well as the cost-model used to drive the heuristic development and measure it s efficiency. Some procedures on integrating this heuristic with other optimizations are also discussedRay tracing is a computationally intensive process, several tree data structures and heuristics have been developed to optimize it. This paper presents a new heuristic in the area, based on collapsing some nodes in order to achieve a smaller expected number of node-tests. Two ways of using this heuristic in Bounding Volume Hierarchies are presented as well as the cost-model used to drive the heuristic development and measure it s efficiency. Some procedures on integrating this heuristic with other optimizations are also discussed
Description
@inproceedings{10.2312:egsh.20101051,
booktitle = {Eurographics 2010 - Short Papers},
editor = {H. P. A. Lensch and S. Seipel},
title = {{Adaptive Collapsing on Bounding Volume Hierarchies for Ray-Tracing}},
author = {Pinto, André Susano},
year = {2010},
publisher = {The Eurographics Association},
ISBN = {},
DOI = {10.2312/egsh.20101051}
}