Abstract
Virtual ray lights (VRL) are a powerful representation for multiple-scattered light transport in volumetric participating media. While efficient Monte Carlo estimators can importance sample the contribution of a VRL along an entire sensor subpath, render time still scales linearly in the number of VRLs. We present a new scalable hierarchial VRL method that preferentially samples VRLs according to their image contribution. Similar to Lightcuts-based approaches, we derive a tight upper bound on the potential contribution of a VRL that is efficient to compute. Our bound takes into account the sampling probability densities used when estimating VRL contribution. Ours is the first such upper bound formulation, leading to an efficient and scalable rendering technique with only a few intuitive user parameters. We benchmark our approach in scenes with many VRLs, demonstrating improved scalability compared to existing state-of-the-art techniques.
| Original language | English |
|---|---|
| Pages (from-to) | 57-65 |
| Number of pages | 9 |
| Journal | Computer Graphics Forum |
| Volume | 38 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Jul 2019 |
| Externally published | Yes |
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
Fingerprint
Dive into the research topics of 'Scalable Virtual Ray Lights Rendering for Participating Media'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver