Abstract
We present a technique to importance sample large collections of lights (including mesh lights as collections of small emitters) in the context of Monte-Carlo path tracing. A bounding volume hierarchy over all emitters is traversed at each shading point using a single random number in a way that importance samples their predicted contribution. The tree aggregates energy, spatial and orientation information from the emitters to enable accurate prediction of the effect of a cluster of lights on any given shading point. We further improve the performance of the algorithm by forcing splitting until the importance of a cluster is sufficiently representative of its contents.
- Gill Barequet and Gershon Elber. 2005. Optimal bounding cones of vectors in three dimensions. Inf. Process. Lett. 93, 2 (2005), 83--89. Google Scholar
Digital Library
- Jacco Bikker. 2007. Real-time Ray Tracing Through the Eyes of a Game Developer. In Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing (RT '07). IEEE Computer Society, Washington, DC, USA, 1--10. Google Scholar
Digital Library
- Petrik Clarberg, Wojciech Jarosz, Tomas Akenine-Möller, and Henrik Wann Jensen. 2005. Wavelet Importance Sampling: Efficiently Evaluating Products of Complex Functions. ACM Transactions on Graphics (Proceedings of SIGGRAPH) 24, 3 (2005), 1166--1175. Google Scholar
Digital Library
- Carsten Dachsbacher, Jaroslav Křivánek, Miloš Hašan, Adam Arbree, Bruce Walter, and Jan Novák. 2014. Scalable Realistic Rendering with Many-Light Methods. Computer Graphics Forum 33, 1 (2014), 88--104. Google Scholar
Digital Library
- Michael Donikian, Bruce Walter, Kavita Bala, Sebastian Fernandez, and Donald P. Greenberg. 2006. Accurate Direct Illumination Using Iterative Adaptive Sampling. IEEE Transactions on Visualization and Computer Graphics 12, 3 (May 2006), 353--364. Google Scholar
Digital Library
- Jonathan Dupuy, Eric Heitz, and Laurent Belcour. 2017. A Spherical Cap Preserving Parameterization for Spherical Distributions. ACM Trans. Graph. 36, 4, Article 139 (July 2017), 12 pages. Google Scholar
Digital Library
- Petra Gospodnetić. 2017. GSoC 2017 with AppleseedHQ. (2017). https://medium.com/@petragospodneti/gsoc-2017-with-appleseedhq-cc5f33d04170Google Scholar
- Yan Gu, Yong He, Kayvon Fatahalian, and Guy Blelloch. 2013. Efficient BVH Construction via Approximate Agglomerative Clustering. In Proceedings of the 5th High-Performance Graphics Conference (HPG '13). ACM, New York, NY, USA, 81--88. Google Scholar
Digital Library
- Eric Heitz, Jonathan Dupuy, Stephen Hill, and David Neubelt. 2016. Real-time Polygonal-light Shading with Linearly Transformed Cosines. ACM Trans. Graph. 35, 4, Article 41 (July 2016), 8 pages. Google Scholar
Digital Library
- Alexander Keller, Carsten Wächter, Matthias Raab, Daniel Seibert, Dietger van Antwerpen, Johann Korndörfer, and Lutz Kettner. 2017. The Iray Light Transport Simulation and Rendering System. CoRR abs/1705.01263 (2017). http://arxiv.org/abs/1705.01263Google Scholar
- Christopher Kulla and Marcos Fajardo. 2012. Importance Sampling Techniques for Path Tracing in Participating Media. Comput. Graph. Forum 31, 4 (June 2012), 1519--1528. Google Scholar
Digital Library
- Samuli Laine. 2010. Restart Trail for Stackless BVH Traversal. In Proceedings of the Conference on High Performance Graphics (HPG '10). Eurographics Association, Aire-la-Ville, Switzerland, Switzerland, 107--111. http://dl.acm.org/citation.cfm?id=1921479.1921496 Google Scholar
Digital Library
- Eric Paquette, Pierre Poulin, and George Drettakis. 1998. A Light Hierarchy for Fast Rendering of Scenes with Many Lights. Computer Graphics Forum (1998).Google Scholar
- Matt Pharr, Wenzel Jakob, and Greg Humphreys. 2016. Physically Based Rendering: From Theory to Implementation (3rd ed.) (3rd ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. 1266 pages. Google Scholar
Digital Library
- Peter Shirley, Changyaw Wang, and Kurt Zimmerman. 1996. Monte Carlo Techniques for Direct Lighting Calculations. ACM Trans. Graph. 15, 1 (Jan. 1996), 1--36. Google Scholar
Digital Library
- Yusuke Tokuyoshi and Takahiro Harada. 2016. Stochastic Light Culling. Journal of Computer Graphics Techniques (JCGT) 5, 1 (29 March 2016), 35--60. http://jcgt.org/published/0005/01/02/Google Scholar
- Eric Veach and Leonidas J. Guibas. 1995. Optimally Combining Sampling Techniques for Monte Carlo Rendering. In Proceedings of the 22Nd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '95). ACM, New York, NY, USA, 419--428. Google Scholar
Digital Library
- Nathan Vegdahl. 2014. Efficient sampling of many lights. (2014). http://ompf2.com/viewtopic.php?t=1938Google Scholar
- Petr Vévoda, Ivo Kondapaneni, and Jaroslav Křivánek. 2018. Bayesian online regression for adaptive direct illumination sampling. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2018) 37, 4 (2018). Google Scholar
Digital Library
- Petr Vévoda and Jaroslav Křivánek. 2016. Adaptive Direct Illumination Sampling. In SIGGRAPH ASIA 2016 Posters (SA '16). ACM, New York, NY, USA, Article 43, 2 pages. Google Scholar
Digital Library
- Ingo Wald. 2007. On Fast Construction of SAH-based Bounding Volume Hierarchies. In Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing (RT '07). Google Scholar
Digital Library
- Bruce Walter, Kavita Bala, Milind Kulkarni, and Keshav Pingali. 2008. Fast Agglomerative Clustering for Rendering. (09 2008), 81 - 86.Google Scholar
- Bruce Walter, Sebastian Fernandez, Adam Arbree, Kavita Bala, Michael Donikian, and Donald P. Greenberg. 2005. Lightcuts: A Scalable Approach to Illumination. ACM Trans. Graph. 24, 3 (July 2005), 1098--1107. Google Scholar
Digital Library
- Gregory J. Ward. 1994. Adaptive Shadow Testing for Ray Tracing. Springer Berlin Heidelberg, Berlin, Heidelberg, 11--20.Google Scholar
Index Terms
Importance Sampling of Many Lights with Adaptive Tree Splitting
Recommendations
Importance sampling of many lights with adaptive tree splitting
SIGGRAPH '17: ACM SIGGRAPH 2017 TalksWe present a technique to importance sample large collections of lights. A bounding volume hierarchy over all lights is traversed at each shading point using a single random number in a way that importance samples their predicted contribution. We ...
A matrix sampling-and-recovery approach for many-lights rendering
Instead of computing on a large number of virtual point lights (VPLs), scalable many-lights rendering methods effectively simulate various illumination effects only using hundreds or thousands of representative VPLs. However, gathering illuminations ...
Fast product importance sampling of environment maps
SIGGRAPH '18: ACM SIGGRAPH 2018 TalksEnvironment maps have been used for decades in production path-tracers to recreate ambient lighting conditions captured from real world scenes. Stochastic sampling of the radiance integral can be very challenging however, as both the BSDF and the ...






Comments