dc.contributor.author | Källberg, Linus | en_US |
dc.contributor.author | Larsson, Thomas | en_US |
dc.contributor.editor | H. P. A. Lensch and S. Seipel | en_US |
dc.date.accessioned | 2015-07-09T10:00:44Z | |
dc.date.available | 2015-07-09T10:00:44Z | |
dc.date.issued | 2010 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/egsh.20101050 | en_US |
dc.description.abstract | In this paper, bounding volume trees of slab cut balls are evaluated and compared with other types of trees for ray tracing. A novel tree construction algorithm is proposed, which utilizes a relative orientation heuristic between parent and child nodes. Also, a fast intersection test between a ray and a slab cut ball is presented. Experimental comparisons to other commonly used enclosing shapes reveal that the slab cut ball is attractive. In particular, the slab cut ball outperforms the sphere in all tested scenes with speed-up factors between 1 and 4. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Ray Tracing using Hierarchies of Slab Cut Balls | en_US |
dc.description.seriesinformation | Eurographics 2010 - Short Papers | en_US |
dc.description.sectionheaders | Rendering | en_US |
dc.identifier.doi | 10.2312/egsh.20101050 | en_US |
dc.identifier.pages | 69-72 | en_US |