| dc.contributor.author | Pinto, André Susano | en_US |
| dc.contributor.editor | H. P. A. Lensch and S. Seipel | en_US |
| dc.date.accessioned | 2015-07-09T10:00:46Z | |
| dc.date.available | 2015-07-09T10:00:46Z | |
| dc.date.issued | 2010 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/egsh.20101051 | en_US |
| dc.description.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 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Adaptive Collapsing on Bounding Volume Hierarchies for Ray-Tracing | en_US |
| dc.description.seriesinformation | Eurographics 2010 - Short Papers | en_US |
| dc.description.sectionheaders | Rendering | en_US |
| dc.identifier.doi | 10.2312/egsh.20101051 | en_US |
| dc.identifier.pages | 73-76 | en_US |
