Illumination simulation involving participating media is computationally intensive. The overall aspect of the material depends on simulating a large number of scattering events inside the material. Combined, the contributions of these scattering events are a smooth illumination. Computing them using ray-tracing or photon-mapping algorithms is expensive: convergence time is high, and pictures before convergence are low quality (see Figure 1). In this paper, we precompute the result of multiple scattering events, assuming an infinite medium, and store it in two 4D tables. These precomputed tables can be used with many rendering algorithms, such as Virtual Ray Lights (VRL), Unified Point Beams and Paths (UPBP) or Manifold Exploration Metropolis Light Transport (MEMLT), greatly reducing the convergence time. The original algorithm takes care of low order scattering (single and double scattering), while our precomputations are used for multiple scattering (more than two scattering events).
[1]
Derek Nowrouzezahrai,et al.
Progressive Virtual Beam Lights
,
2012,
Comput. Graph. Forum.
[2]
Beibei Wang,et al.
Point-Based Light Transport for Participating Media with Refractive Boundaries
,
2016,
EGSR.
[3]
Derek Nowrouzezahrai,et al.
Virtual ray lights for rendering scenes with participating media
,
2012,
ACM Trans. Graph..
[4]
Steve Marschner,et al.
Eurographics Symposium on Rendering (2007) Jan Kautz and Sumanta Pattanaik (Editors) Abstract Rendering Discrete Random Media Using Precomputed Scattering Solutions
,
2022
.
[5]
Steve Marschner,et al.
Manifold exploration
,
2012,
ACM Trans. Graph..
[6]
Derek Nowrouzezahrai,et al.
Unifying points, beams, and paths in volumetric light transport simulation
,
2014,
ACM Trans. Graph..