Importance Sampling of Many Lights on the GPU

Moreau, Pierre Emmanuel; Clarberg, Petrik

doi:10.1007/978-1-4842-4427-2_18

Cited by 5 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By combining the reservoirs from a neighborhood of pixels using RIS, ReSTIR virtually increases the number of reservoirs for each pixel, which dramatically increases the convergence rate. Given scenes with thousands to millions of dynamic lights, ReSTIR can render one to two orders of magnitude faster for the same error compared to the light BVH method [21].…”

Section: Ray Tracing Algorithmmentioning

confidence: 99%

Temporal vectorized visibility for direct illumination of animated models

Wang,

Ho,

Xiao

et al. 2024

Comp. Visual Media

View full text Add to dashboard Cite

Direct illumination rendering is an important technique in computer graphics. Precomputed radiance transfer algorithms can provide high quality rendering results in real time, but they can only support rigid models. On the other hand, ray tracing algorithms are flexible and can gracefully handle animated models. With NVIDIA RTX and the AI denoiser, we can use ray tracing algorithms to render visually appealing results in real time. Visually appealing though, they can deviate from the actual one considerably. We propose a visibility-boundary edge oriented infinite triangle bounding volume hierarchy (BVH) traversal algorithm to dynamically generate visibility in vector form. Our algorithm utilizes the properties of visibility-boundary edges and infinite triangle BVH traversal to maximize the efficiency of the vector form visibility generation. A novel data structure, temporal vectorized visibility, is proposed, which allows visibility in vector form to be shared across time and further increases the generation efficiency. Our algorithm can efficiently render close-to-reference direct illumination results. With the similar processing time, it provides a visual quality improvement around 10 dB in terms of peak signal-to-noise ratio (PSNR) w.r.t. the ray tracing algorithm reservoir-based spatiotemporal importance resampling (ReSTIR).

show abstract

Section: Ray Tracing Algorithmmentioning

confidence: 99%

Temporal vectorized visibility for direct illumination of animated models

Wang,

Ho,

Xiao

et al. 2024

Comp. Visual Media

View full text Add to dashboard Cite

show abstract

“…Light source sampling The large body of work on sampling of direct illumination in rendering can be roughly divided into techniques which are either concerned with selecting important light sources using a hierarchy [EK18; MPC19; Yuk19], or with sampling points on a chosen light source, e.g. proportional to (projected) solid angle [Arv95; HPM*20; Pet21].…”

Section: Previous Workmentioning

confidence: 99%

Markov Chain Mixture Models for Real‐Time Direct Illumination

Dittebrandt,

Schüßler,

Hanika

et al. 2023

Computer Graphics Forum

View full text Add to dashboard Cite

We present a novel technique to efficiently render complex direct illumination in real‐time. It is based on a spatio‐temporal randomized mixture model of von Mises‐Fisher (vMF) distributions in screen space. For every pixel we determine the vMF distribution to sample from using a Markov chain process which is targeted to capture important features of the integrand. By this we avoid the storage overhead of finite‐component deterministic mixture models, for which, in addition, determining the optimal component count is challenging. We use stochastic multiple importance sampling (SMIS) to be independent of the equilibrium distribution of our Markov chain process, since it cancels out in the estimator. Further, we use the same sample to advance the Markov chain and to construct the SMIS estimator and local Markov chain state permutations avoid the resulting bias due to dependent sampling. As a consequence we require one ray per sample and pixel only. We evaluate our technique using implementations in a research renderer as well as a classic game engine with highly dynamic content. Our results show that it is efficient and quickly readapts to dynamic conditions. We compare to spatio‐temporal resampling (ReSTIR), which can suffer from correlation artifacts due to its non‐adapting candidate distributions that can deviate strongly from the integrand. While we focus on direct illumination, our approach is more widely applicable and we exemplarily show the rendering of caustics.

show abstract

“…Lightcuts algorithms [WFA ∗ 05, WABG06, WBKP08, WKB12] aim to approximate illumination under a certain error bound by forming cuts. On the other hand, hierarchical importance sampling is typically used to obtain unbiased estimates [EK18, MC19, MPC19, Pan19, LXY19]. Estevez and Kulla [EK18] introduced a cost metric called the surface area orientation heuristic to cluster nearby and similarly oriented lights, allowing for efficient many‐light sampling.…”

Section: Other Bvh Applicationsmentioning

confidence: 99%

“…Estevez and Kulla [EK18] introduced a cost metric called the surface area orientation heuristic to cluster nearby and similarly oriented lights, allowing for efficient many-light sampling. Their algorithm can also be implemented on GPUs [MC19], and dynamic lighting can be handled with a two-level BVH [MPC19]. Pantaleoni [Pan19] took into account visibility by introducing fixed-size tree cuts.…”

Section: Illumination and Shadow Computationmentioning

confidence: 99%