Spatial Splits in Bounding Volume Hierarchies

Simple item page
dc.contributor.authorStich, Martinen_US
dc.contributor.authorFriedrich, Heikoen_US
dc.contributor.authorDietrich, Andreasen_US
dc.contributor.editorDavid Luebke and Philipp Slusalleken_US
dc.date.accessioned2013-10-29T15:48:14Z
dc.date.available2013-10-29T15:48:14Z
dc.date.issued2009en_US
dc.description.abstractBounding volume hierarchies (BVH) have become a widely used alternative to kD-trees as the acceleration structure of choice in modern ray tracing systems. However, BVHs adapt poorly to nonuniformly tessellated scenes, which leads to increased ray shooting costs. This paper presents a novel and practical BVH construction algorithm, which addresses the issue by utilizing spatial splitting similar to kD-trees. In contrast to previous preprocessing approaches, our method uses the surface area heuristic to control primitive splitting during tree construction. We show that our algorithm produces significantly more efficient hierarchies than other techniques. In addition, user parameters that directly influence splitting are eliminated, making the algorithm easily controllable.en_US
dc.description.seriesinformationHigh-Performance Graphicsen_US
dc.identifier.isbn978-1-60558-603-8en_US
dc.identifier.issn2079-8687en_US
dc.identifier.urihttps://doi.org/10.1145/1572769.1572771en_US
dc.publisherThe Eurographics Associationen_US
dc.titleSpatial Splits in Bounding Volume Hierarchiesen_US
Files
Collections
High-Performance Graphics 2009