Bridge Sampling for Connections via Multiple Scattering Events
| dc.contributor.author | Schüßler, Vincent | en_US |
| dc.contributor.author | Hanika, Johannes | en_US |
| dc.contributor.author | Dachsbacher, Carsten | en_US |
| dc.contributor.editor | Garces, Elena | en_US |
| dc.contributor.editor | Haines, Eric | en_US |
| dc.date.accessioned | 2024-06-25T10:20:23Z | |
| dc.date.available | 2024-06-25T10:20:23Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | Explicit sampling of and connecting to light sources is often essential for reducing variance in Monte Carlo rendering. In dense, forward-scattering participating media, its benefit declines, as significant transport happens over longer multiple-scattering paths around the straight connection to the light. Sampling these paths is challenging, as their contribution is shaped by the product of reciprocal squared distance terms and the phase functions. Previous work demonstrates that sampling several of these terms jointly is crucial. However, these methods are tied to low-order scattering or struggle with highly-peaked phase functions. We present a method for sampling a bridge: a subpath of arbitrary vertex count connecting two vertices. Its probability density is proportional to all phase functions at inner vertices and reciprocal squared distance terms. To achieve this, we importance sample the phase functions first, and subsequently all distances at once. For the latter, we sample an independent, preliminary distance for each edge of the bridge, and afterwards scale the bridge such that it matches the connection distance. The scale factor can be marginalized out analytically to obtain the probability density of the bridge. This approach leads to a simple algorithm and can construct bridges of any vertex count. For the case of one or two inserted vertices, we also show an alternative without scaling or marginalization. For practical path sampling, we present a method to sample the number of bridge vertices whose distribution depends on the connection distance, the phase function, and the collision coefficient. While our importance sampling treats media as homogeneous we demonstrate its effectiveness on heterogeneous media. | en_US |
| dc.description.number | 4 | |
| dc.description.sectionheaders | Light and Reflection | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 43 | |
| dc.identifier.doi | 10.1111/cgf.15160 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 13 pages | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.15160 | |
| dc.identifier.uri | https://diglib.eg.org/handle/10.1111/cgf15160 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.rights | Attribution 4.0 International License | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | CCS Concepts: Computing methodologies → Rendering; Ray tracing | |
| dc.subject | Computing methodologies → Rendering | |
| dc.subject | Ray tracing | |
| dc.title | Bridge Sampling for Connections via Multiple Scattering Events | en_US |
Files
Original bundle
1 - 1 of 1