Accelerating Path Tracing in Volumetric Clouds using Graph Structures
T.S. van den Hurk (TU Delft - Electrical Engineering, Mathematics and Computer Science)
R. Guerra Marroquim – Graduation committee member (TU Delft - Computer Graphics and Visualisation)
J. Urbano Merino – Graduation committee member (TU Delft - Multimedia Computing)
G. Lu – Mentor (TU Delft - Computer Graphics and Visualisation)
C.P. Peters – Mentor
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Rendering volumes using path tracing can produce stunning images, but the process is notoriously expensive. For some volumes such as clouds, there are cases where the volume has no interaction with other objects in the scene. For these cases, combined with an isotropic phase function, unidirectional path tracing from the camera computes many similar paths regardless of camera position. Computing these light paths beforehand to determine the full radiance transport through the volume speeds up the rendering stage drastically, with the result still being physically accurate.
In this thesis, we present a two-stage method designed for the aforementioned cases. The first stage is a precomputation stage, in which light paths are traced through the volume and stored in a space-efficient manner using a graph structure. Through this graph, radiance transport is then computed. In the rendering stage, the graph structure with radiance values can then be used to render the volume. The results show that our method can produce renders with negligible bias. They also show that the method is heavily constrained by space requirements as volume size increases, which results in an increase in bias for larger volumes. The main advantage of the method is its efficiency in rendering multiple images of the same object.