Show simple item record

dc.contributor.authorVaidyanathan, Karthiken_US
dc.contributor.authorAkenine-Möller, Tomasen_US
dc.contributor.authorSalvi, Marcoen_US
dc.contributor.editorUlf Assarsson and Warren Hunten_US
dc.date.accessioned2016-06-17T14:07:14Z
dc.date.available2016-06-17T14:07:14Z
dc.date.issued2016en_US
dc.identifier.isbn978-3-03868-008-6en_US
dc.identifier.issn2079-8679en_US
dc.identifier.urihttp://dx.doi.org/10.2312/hpg.20161190en_US
dc.description.abstractReduced precision bounding volume hierarchies and ray traversal can significantly improve the efficiency of ray tracing through low-cost dedicated hardware. A key approach to enabling reduced precision computations during traversal is to translate the ray origin closer to the bounding volume hierarchy node after each traversal step. However, this approach precludes sharing of intersection computations between a parent node and its two children, which is an important optimization. In this paper, we introduce a novel traversal algorithm that addresses this limitation and achieves a significant reduction in the computational complexity of traversal compared to previous approaches.We also include an analysis that shows how our algorithm guarantees watertight intersections which is a key requirement for robust image quality, especially with reduced precision traversal where numerical errors can be large.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.3 [Computer Graphics]en_US
dc.subjectPicture/Image Generationen_US
dc.subjectLine and curve generationen_US
dc.titleWatertight Ray Traversal with Reduced Precisionen_US
dc.description.seriesinformationEurographics/ ACM SIGGRAPH Symposium on High Performance Graphicsen_US
dc.description.sectionheadersBetter BVHsen_US
dc.identifier.doi10.2312/hpg.20161190en_US
dc.identifier.pages33-40en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record