MBVH Child Node Sorting for Fast Occlusion Test

dc.contributor.authorOgaki, Shinjien_US
dc.contributor.authorDerouet-Jourdan, Alexandreen_US
dc.contributor.editorJaakko Lehtinen and Derek Nowrouzezahraien_US
dc.date.accessioned2015-06-23T05:04:20Z
dc.date.available2015-06-23T05:04:20Z
dc.date.issued2015en_US
dc.description.abstractOptimal BVH layout differs among ray types. To accelerate shadow rays, the use of a specialized traversal order, optionally with an additional data structure has been proposed. In this paper we show how sorting child nodes of MBVH (Multi Bounding Volume Hierarchy) improves the performance of occlusion test without changing the topology of the data structure.We introduce a cost metric suitable for MBVH which takes into account the distribution of representative rays, and prove that the cost can be minimized by sorting child nodes based on a very simple criterion. Our method is very easy to implement and requires only small amounts of storage and preprocessing time for sorting. We also demonstrate how rendering performance can be improved by up to 10% in conjunction with various algorithms.en_US
dc.description.sectionheadersRay Tracingen_US
dc.description.seriesinformationEurographics Symposium on Rendering - Experimental Ideas & Implementationsen_US
dc.identifier.doi10.2312/sre.20151167en_US
dc.identifier.pages57-64en_US
dc.identifier.urihttps://doi.org/10.2312/sre.20151167en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.7 [Computer Graphics]en_US
dc.subjectThree Dimensional Graphics and Realismen_US
dc.subjectRaytracingen_US
dc.titleMBVH Child Node Sorting for Fast Occlusion Testen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
057-064.pdf
Size:
19.24 MB
Format:
Adobe Portable Document Format