Combinatorial Bidirectional Path-Tracing for Efficient Hybrid CPU/GPU Rendering

Simple item page
dc.contributor.authorPajot, Anthonyen_US
dc.contributor.authorBarthe, Loïcen_US
dc.contributor.authorPaulin, Mathiasen_US
dc.contributor.authorPoulin, Pierreen_US
dc.contributor.editorM. Chen and O. Deussenen_US
dc.date.accessioned2015-02-27T10:21:03Z
dc.date.available2015-02-27T10:21:03Z
dc.date.issued2011en_US
dc.description.abstractThis paper presents a reformulation of bidirectional path-tracing that adequately divides the algorithm into processes efficiently executed in parallel on both the CPU and the GPU. We thus benefit from high-level optimization techniques such as double buffering, batch processing, and asyncronous execution, as well as from the exploitation of most of the CPU, GPU, and memory bus capabilities. Our approach, while avoiding pure GPU implementation limitations (such as limited complexity of shaders, light or camera models, and processed scene data sets), is more than ten times faster than standard bidirectional path-tracing implementations, leading to performance suitable for production-oriented rendering engines.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/j.1467-8659.2011.01863.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2011.01863.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleCombinatorial Bidirectional Path-Tracing for Efficient Hybrid CPU/GPU Renderingen_US
Files
Collections
30-Issue 2
Full Papers 2011 - CGF 30-Issue 2