IlluminationCut
Abstract
We present a novel algorithm, IlluminationCut, for rendering images using the many-lights framework. It handles any light source that can be approximated with virtual point lights (VPLs) as well as highly glossy materials. The algorithm extends the Multidimensional Lightcuts technique by effectively creating an illumination-aware clustering of the product-space of the set of points to be shaded and the set of VPLs. Additionally, the number of visibility queries for each product-space cluster is reduced by using an adaptive sampling technique. Our framework is flexible and achieves around 3 – 6 times speedup over previous state-of-the-art methods.
Supporting Information
Filename | Description |
---|---|
cgf12584-sup-0001-S1.zip128.2 MB | Supporting Information |
Please note: The publisher is not responsible for the content or functionality of any supporting information supplied by the authors. Any queries (other than missing content) should be directed to the corresponding author for the article.
References
- Bodt T., Dutré P.: Coherent lightcuts. PhD thesis, Katholieke Universiteit Leuven (2008). 3
- Billen N., Engelen B., Lagae A., Dutré P.: Probabilistic visibility evaluation for direct illumination. Computer Graphics Forum 32(4) (Proceedings of Eurographics Symposium on Rendering 2013) 32, 4 (2013), 39–47. 3
- Christensen P.H.: Point-Based Approximate Color Bleeding. Tech. rep., Pixar, 2008. 1
- Davidovič T., Křivánek J., Hašan M., Slusallek P., Bala K.: Combining global and local virtual lights for detailed glossy illumination. ACM Trans. Graph. 29 (December 2010), 143:1–143:8. 3
- Dachsbacher C., Křivánek J., Hašan M., Arbree A., Walter B., Novák J.: Scalable Realistic Rendering with Many-Light Methods. In Eurographics 2013 - State of the Art Reports (Girona, Spain, 2013), Eurographics Association, pp. 23–38. 1, 3
- Dammertz H., Keller A., Lensch H.: Progressive point-light-based global illumination. Computer Graphics Forum 29, 8 (2010), 2504–2515. 3
- Gargantini I.: An effective way to represent quadtrees. Communications of the ACM 25, 12 (Dec. 1982), 905–910. 4
- Georgiev I., Křivánek J., Popov S., Slusallek P.: Importance caching for complex illumination. Computer Graphics Forum 31, 2 (2012). EUROGRAPHICS 2012. 3
- Georgiev I., Slusallek P.: Simple and Robust Iterative Importance Sampling of Virtual Point Lights. Proceedings of Eurographics (short papers) (2010). 3
- Hašan M., Křivánek J., Walter B., Bala K.: Virtual spherical lights for many-light rendering of glossy scenes. ACM Trans. Graph. 28, 5 (2009), 143:1–143:6. 3
- Hašan M., Pellacini F., Bala K.: Matrix row-column sampling for the many-light problem. ACM Trans. Graph. 26, 3 (2007). 3
- Holländer M., Ritschel T., Eisemann E., Boubekeur T.: Manylods: Parallel many-view level-of-detail selection for real-time global illumination. In Proceedings of the Twenty-second Eurographics Conference on Rendering (Aire-la-Ville, Switzerland, Switzerland, 2011), Eurographics Association, pp. 1233–1240. 3
- Jensen H.W.: Realistic image synthesis using photon mapping. A. K. Peters, Ltd., Natick, MA, USA, 2001. 1
10.1201/b10685 Google Scholar
- Keller A.: Instant radiosity. In Proceedings of the 24th annual conference on Computer graphics and interactive techniques (1997), pp. 49–56. 1, 2
- Křivánek J., Ferwerda J.A., Bala K.: Effects of global illumination approximations on material appearance. ACM Trans. Graph. 29, 4 (2010), 112:1–112:10. SIGGRAPH ‘10. 3
- Křivánek J., Hašan M., Arbree A., Keller C. D. A., Walter B.: Optimizing realistic rendering with many-light methods. In SIGGRAPH 2012 Course (2012). 3
- Kollig T., Keller A.: Illumination in the presence of weak singularities. In Monte Carlo and Quasi-Monte Carlo Methods 2004 H. Niederreiter, D. Talay (Eds.). Springer Berlin Heidelberg, 2006, pp. 245–257. 3
10.1007/3-540-31186-6_15 Google Scholar
- Khungurn P., Saranurak T., Watcharopas C.: Pixelcuts: Scalable approximate illumination from many point lights. Chiang Mai Journal of Science (Special Issue) 38, 1 (2011), 8–16. 3
- Laine S., Saransaari H., Kontkanen J., Lehtinen J., AILA T.: Incremental instant radiosity for real-time indirect illumination. In Proceedings of Eurographics Symposium on Rendering (2007), Eurographics Association, pp. 277–286. 3
- Miksik M.: Implementing lightcuts. In CESCG (2010). 6
- Novák J., Nowrouzezahrai D., Dachsbacher C., Jarosz W.: Virtual ray lights for rendering scenes with participating media. ACM Transactions on Graphics (Proceedings of SIGGRAPH) 31, 4 (July 2012). 3
- Novák J., Nowrouzezahrai D., Dachsbacher C., Jarosz W.: Progressive Virtual Beam Lights. Computer Graphics Forum 31, 4 (2012), 1407–1413. 3
- Ou J., Pellacini F.: Lightslice: matrix slice sampling for the many-lights problem. ACM Trans. Graph. 30, 6 (2011), 179. 1, 3, 6, 9
10.1145/2070781.2024213 Google Scholar
- Popov S., Georgiev I., Slusallek P., Dachsbacher C.: Adaptive quantization visibility caching. Computer Graphics Forum 32, 2 (2013). EUROGRAPHICS 2013. 3
- Radax I.: Instant Radiosity for Real-Time Global Illumination. Tech. rep., Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2008. 3
- Ritschel T., Grosch T., Kim M.H., Seidel H.-P., Dachsbacher C., Kautz J.: Imperfect Shadow Maps for Efficient Computation of Indirect Illumination. ACM Trans. Graph. (Proc. of SIGGRAPH ASIA 2008) 27, 5 (2008). 3
- Segovia B., Iehl J.C., Mitanchey R., Péroche B.: Bidirectional instant radiosity. In EGSR (2006), pp. 389–398. 3
- Veach E., Guibas L.: Bidirectional estimators for light transport. In Photorealistic Rendering Techniques, G. Sakas, S. Müller, P. Shirley, (Eds.), Focus on Computer Graphics. Springer Berlin Heidelberg, 1995, pp. 145–167.
- Veach E., Guibas L.J.: Metropolis light transport. In SIGGRAPH ‘97: Proceedings of the 24th annual conference on Computer graphics and interactive techniques (1997), pp. 65–76. 1
- Walter B., Arbree A., Bala K., Greenberg D.P.: Multidimensional lightcuts. In ACM SIGGRAPH 2006 Papers (2006), SIGGRAPH ‘06, pp. 1081–1088. 2, 3, 5
- Wu Y.-T., Chuang Y.-Y.: Visibilitycluster: Average directional visibility for many-light rendering. Visualization and Computer Graphics, IEEE Transactions on 19, 9 (Sept 2013), 1566–1578. 3
- Walter B., Fernandez S., Arbree A., Bala K., Donikian M., Greenberg D.P.: Lightcuts: a scalable approach to illumination. ACM Trans. Graph. 24, 3 (July 2005), 1098–1107. 1, 3, 4, 6, 9
- Woop S., Feng L., Wald I., Benthin C.: Embree ray tracing kernels for cpus and the xeon phi architecture. In ACM SIGGRAPH 2013 Talks (2013), SIGGRAPH ‘13, pp. 44:1–44:1. 6
- Walter B., Khungurn P., Bala K.: Bidirectional lightcuts. ACM Trans. Graph. 31, 4 (July 2012), 59:1–59:11. 3
- Wald I., Purcell T.J., Schmittler J., Benthin C., Slusallek P.: Realtime Ray Tracing and its use for Interactive Global Illumination. In Eurographics State of the Art Reports (2003). 6
- Wald I., Woop S., Benthin C., Johnson G.S., Ernst M.: Embree: A kernel framework for efficient cpu ray tracing. ACM Trans. Graph. 33, 4 (July 2014), 143:1–143:8. 6, 10
- Wang G., Xie G., Wang W.: Efficient search of lightcuts by spatial clustering. In SIGGRAPH Asia 2011 Sketches (New York, NY, USA, 2011), SA ‘11, ACM, pp. 26:1–26:2. 3