Bridge Sampling for Connections via Multiple Scattering Events

Author:

Schüßler Vincent1ORCID,Hanika Johannes1ORCID,Dachsbacher Carsten1ORCID

Affiliation:

1. Karlsruhe Institute of Technology Germany

Abstract

AbstractExplicit 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.

Publisher

Wiley

Reference21 articles.

1. d'Eon Eugene.A Hitchhiker's Guide to Multiple Scattering.2016. url:http://www.eugenedeon.com/hitchhikers3.

2. Devroye Luc.Non-Uniform Random Variate Generation.1986. doi:10.1007/978-1-4613-8643-812.

3. On the complexity of computing the volume of a polyhedron;Dyer Martin E.;SIAM Journal on Computing,1988

4. Joint Importance Sampling of Low-Order Volumetric Scattering;Georgiev Iliyan;ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia),2013

5. Integral Formulations of Volumetric Transmittance;Georgiev Iliyan;ACM Transactions on Graphics (Proceedings of SIGGRAPH Asia),2019

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3