Robust Iterative Find-Next-Hit Ray Traversal

Simple item page
dc.contributor.authorWald, Ingoen_US
dc.contributor.authorAmstutz, Jeffersonen_US
dc.contributor.authorBenthin, Carstenen_US
dc.contributor.editorHank Childs and Fernando Cucchiettien_US
dc.date.accessioned2018-06-02T18:02:38Z
dc.date.available2018-06-02T18:02:38Z
dc.date.issued2018
dc.description.abstractWe present two different methods for improving the performance and robustness of ray tracing algorithms that require iterating through multiple successive intersections along the same ray. Our methods do so without ever missing intersections, even in cases of co-planar or numerically close surfaces, and without having to rely on a dedicated all-hit traversal kernel. Furthermore, our evaluation shows that, in many cases, our methods consistently outperform existing all-hit kernels.en_US
dc.description.sectionheadersSession 1
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualization
dc.identifier.doi10.2312/pgv.20181092
dc.identifier.isbn978-3-03868-054-3
dc.identifier.issn1727-348X
dc.identifier.pages25-32
dc.identifier.urihttps://doi.org/10.2312/pgv.20181092
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/pgv20181092
dc.publisherThe Eurographics Associationen_US
dc.titleRobust Iterative Find-Next-Hit Ray Traversalen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
025-032.pdf
Size:
3.52 MB
Format:
Adobe Portable Document Format
Download
Collections
EGPGV18: Eurographics Symposium on Parallel Graphics and Visualization