Improving Data Locality for Efficient In‐Core Path Tracing
| dc.contributor.author | Bikker, J. | en_US |
| dc.contributor.editor | Holly Rushmeier and Oliver Deussen | en_US |
| dc.date.accessioned | 2015-02-28T08:11:18Z | |
| dc.date.available | 2015-02-28T08:11:18Z | |
| dc.date.issued | 2012 | en_US |
| dc.description.abstract | In this paper, we investigate the efficiency of ray queries on the CPU in the context of path tracing, where ray distributions are mostly random. We show that existing schemes that exploit data locality to improve ray tracing efficiency fail to do so beyond the first diffuse bounce, and analyze the cause for this. We then present an alternative scheme inspired by the work of Pharr et al. in which we improve data locality by using a data‐centric breadth‐first approach. We show that our scheme improves on state‐of‐the‐art performance for ray distributions in a path tracer.In this paper, we investigate the efficiency of ray queries on the CPU in the context of path tracing, where ray distributions are mostly random. We show that existing schemes that exploit data locality to improve ray tracing efficiency fail to do so beyond the first diffuse bounce, and analyze the cause for this.We then present an alternative scheme inspired by the work of Pharr et al. in which we improve data locality by using a data‐centric breadth‐first approach.We show that our scheme improves on state‐of‐the‐art performance for ray distributions in a path tracer. | en_US |
| dc.description.number | 6 | |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 31 | |
| dc.identifier.doi | 10.1111/j.1467-8659.2012.03073.x | |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2012.03073.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Improving Data Locality for Efficient In‐Core Path Tracing | en_US |