The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - Sept. (2013 vol.19)
pp: 1566-1578
Yu-Ting Wu , Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Yung-Yu Chuang , Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
ABSTRACT
This paper proposes the VisibilityCluster algorithm for efficient visibility approximation and representation in many-light rendering. By carefully clustering lights and shading points, we can construct a visibility matrix that exhibits good local structures due to visibility coherence of nearby lights and shading points. Average visibility can be efficiently estimated by exploiting the sparse structure of the matrix and shooting only few shadow rays between clusters. Moreover, we can use the estimated average visibility as a quality measure for visibility estimation, enabling us to locally refine VisibilityClusters with large visibility variance for improving accuracy. We demonstrate that, with the proposed method, visibility can be incorporated into importance sampling at a reasonable cost for the many-light problem, significantly reducing variance in Monte Carlo rendering. In addition, the proposed method can be used to increase realism of local shading by adding directional occlusion effects. Experiments show that the proposed technique outperforms state-of-the-art importance sampling algorithms, and successfully enhances the preview quality for lighting design.
INDEX TERMS
Monte Carlo methods, Lighting, Rendering (computer graphics), Approximation methods, Approximation algorithms, Coherence, Geometry,the many-light problem, Ray tracing, visibility approximation, importance sampling
CITATION
Yu-Ting Wu, Yung-Yu Chuang, "VisibilityCluster: Average Directional Visibility for Many-Light Rendering", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 9, pp. 1566-1578, Sept. 2013, doi:10.1109/TVCG.2013.21
REFERENCES
[1] S. Boulos, "A Summary of Octree Ray Traversal Algorithms," Ray Tracing News, vol. 23, no. 1, July 2010.
[2] R. Wang and O. Åkerlund, "Bidirectional Importance Sampling for Unstructured Direct Illumination," Computer Graphics Forum, vol. 28, no. 2, pp. 269-278, Apr. 2009.
[3] I. Georgiev, J. Křivánek, S. Popov, and P. Slusallek, "Importance Caching for Complex Illumination," Computer Graphics Forum, vol. 31, no. 2, pp. 701-710, May 2012.
[4] S. Agarwal, R. Ramamoorthi, S. Belongie, and H.W. Jensen, "Structured Importance Sampling of Environment Maps," ACM Trans. Graphics, vol. 22, no. 3, pp. 605-612, July 2003.
[5] T. Kollig and A. Keller, "Efficient Illumination by High Dynamic Range Images," Proc. Eurographics Rendering Workshop, pp. 45-50, 2003.
[6] J. Steinhurst and A. Lastra, "Global Importance Sampling of Glossy Surfaces Using the Photon Map," Proc. IEEE Symp. Interactive Ray Tracing, pp. 133-138, 2006.
[7] J. Lawrence, S. Rusinkiewicz, and R. Ramamoorthi, "Efficient BRDF Importance Sampling Using a Factored Representation," ACM Trans. Graphics, vol. 23, no. 3, pp. 496-505, Aug. 2004.
[8] P. Clarberg, W. Jarosz, T. Akenine-Möller, and H.W. Jensen, "Wavelet Importance Sampling: Efficiently Evaluating Products of Complex Functions," ACM Trans. Graphics, vol. 24, no. 3, pp. 1166-1175, July 2005.
[9] D. Cline, P.K. Egbert, J.F. Talbot, and D.L. Cardon, "Two Stage Importance Sampling for Direct Lighting," Proc. 17th Eurographics Conf. Rendering Techniques (EGSR '06), pp. 103-113, 2006.
[10] P. Clarberg and T. Akenine-Möller, "Practical Product Importance Sampling for Direct Illumination," Computer Graphics Forum, vol. 27, no. 2, pp. 681-690, 2008.
[11] W. Jarosz, N.A. Carr, and H.W. Jensen, "Importance Sampling Spherical Harmonics," Computer Graphics Forum, vol. 28, no. 2, pp. 577-586, Apr. 2009.
[12] D. Burke, A. Ghosh, and W. Heidrich, "Bidirectional Importance Sampling for Direct Illumination," Proc. 16th Eurographics Conf. Rendering Techniques (EGSR '05), pp. 147-156, 2005.
[13] J.F. Talbot, D. Cline, and P. Egbert, "Importance Resampling for Global Illumination," Proc. 16th Eurographics Conf. Rendering Techniques (EGSR '05), pp. 139-146, 2005.
[14] A. Ghosh and W. Heidrich, "Correlated Visibility Sampling for Direct Illumination," Visual Computer, vol. 22, nos. 9-11, pp. 693-701, Sept. 2006.
[15] F. Rousselle, P. Clarberg, L. Leblanc, V. Ostromoukhov, and P. Poulin, "Efficient Product Sampling Using Hierarchical Thresholding," Visual Computer, vol. 24, nos. 7-9, pp. 465-474, July 2008.
[16] P. Clarberg and T. Akenine-Möller, "Exploiting Visibility Correlation in Direct Illumination," Computer Graphics Forum, vol. 27, no. 4, pp. 1125-1136, 2008.
[17] D. Cline, D. Adams, and P. Egbert, "Table-Driven Adaptive Importance Sampling," Computer Graphics Forum, vol. 27, no. 4, pp. 1115-1123, 2008.
[18] A. Keller, "Instant Radiosity," Proc. ACM SIGGRAPH '97, pp. 49-56, 1997.
[19] B. Walter, S. Fernandez, A. Arbree, K. Bala, M. Donikian, and D.P. Greenberg, "Lightcuts: A Scalable Approach to Illumination," ACM Trans. Graphics, vol. 24, no. 3, pp. 1098-1107, July 2005.
[20] B. Walter, A. Arbree, K. Bala, and D.P. Greenberg, "Multidimensional Lightcuts," ACM Trans. Graphics, vol. 25, no. 3, pp. 1081-1088, July 2006.
[21] B. Walter, P. Khungurn, and K. Bala, "Bidirectional Lightcuts," ACM Trans. Graphics, vol. 31, no. 4, pp. 59:1-59:11, July 2012.
[22] M. Hašan, F. Pellacini, and K. Bala, "Matrix Row-Column Sampling for the Many-Light Problem," ACM Trans. Graphics, vol. 26, no. 3,article 26, July 2007.
[23] M. Hašan, J. Křivánek, B. Walter, and K. Bala, "Virtual Spherical Lights for Many-Light Rendering of Glossyc scenes," ACM Trans. Graphics, vol. 28, no. 5, pp. 143:1-143:6, Dec. 2009.
[24] T. Davidovič, J. Křivánek, M. Hašan, P. Slusallek, and K. Bala, "Combining Global and Local Virtual Lights for Detailed Glossy Illumination," ACM Trans. Graphics, vol. 29, no. 6, pp. 143:1-143:8, Dec. 2010.
[25] J. Ou and F. Pellacini, "LightSlice: Matrix Slice Sampling for the Many-Lights Problem," ACM Trans. Graphics, vol. 30, no. 6, pp. 179:1-179:8, Dec. 2011.
[26] C. Dachsbacher and M. Stamminger, "Reflective Shadow Maps," Proc. Symp. Interactive 3D graphics and games, pp. 203-231, 2005.
[27] C. Dachsbacher and M. Stamminger, "Splatting Indirect Illumination," Proc. Symp. Interactive 3D Graphics and Games, pp. 93-100, 2006.
[28] G. Nichols and C. Wyman, "Multiresolution Splatting for Indirect Illumination," Proc. Symp. Interactive 3D Graphics and Games, pp. 83-90, 2009.
[29] T. Ritschel, T. Grosch, M.H. Kim, H.-P. Seidel, C. Dachsbacher, and J. Kautz, "Imperfect Shadow Maps for Efficient Computation of Indirect Illumination," ACM Trans. Graphics, vol. 27, no. 5, pp. 129:1-129:8, Dec. 2008.
[30] Z. Dong, T. Grosch, T. Ritschel, J. Kautz, and H.-P. Seidel, "Real-Time Indirect Illumination with Clustered Visibility," Proc. Vision, Modeling, and Visualization Workshop, 2009.
[31] T. Bashford-Rogers, K. Debattista, C. Harvey, and A. Chalmers, "Approximate Visibility Grids for Interactive Indirect Illumination," Proc. Third Int'l Conf. Games and Virtual Worlds for Serious Applications, pp. 55-62, 2011.
[32] I. Yu, A. Cox, M.H. Kim, T. Ritschel, T. Grosch, C. Dachsbacher, and J. Kautz, "Perceptual Influence of Approximate Visibility in Indirect Illumination," ACM Trans. Applied Perception, vol. 6, no. 4, pp. 24:1-24:14, Oct. 2009.
[33] M. Agrawala, R. Ramamoorthi, A. Heirich, and L. Moll, "Efficient Image-Based Methods for Rendering Soft Shadows," Proc. ACM SIGGRAPH '00, pp. 375-384, 2000.
[34] A. Ben-Artzi, R. Ramamoorthi, and M. Agrawala, "Efficient Shadows for Sampled Environment Maps," J. Graphics Tools, pp. 13-36, 2006.
[35] P. Shirley, C. Wang, and K. Zimmerman, "Monte Carlo Techniques for Direct Lighting Calculations," ACM Trans. Graphics, vol. 15, no. 1, pp. 1-36, Jan. 1996.
[36] D. Hart, P. Dutré, and D.P. Greenberg, "Direct Illumination with Lazy Visibility Evaluation," Proc. ACM SIGGRAPH '99, pp. 147-154, 1999.
[37] A.J. Stewart and T. Karkanis, "Computing the Approximate Visibility Map, with Applications to Form Factors and Discontinuity Meshing," Proc. Ninth Eurographics Workshop Rendering, pp. 57-68, 1998.
[38] P. Dutré, P. Tole, and D.P. Greenberg, "Approximate Visibility for Illumination Computations Using Point Clouds," Technical Report PCG-00-01, Cornell Univ., 2000.
[39] S. Fernandez, K. Bala, and D.P. Greenberg, "Local Illumination Environments for Direct Lighting Acceleration," Proc. 13th Eurographics Workshop Rendering, pp. 7-14, 2002.
[40] M. Donikian, B. Walter, K. Bala, S. Fernandez, and D.P. Greenberg, "Accurate Direct Illumination Using Iterative Adaptive Sampling," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 3, pp. 353-364, May 2006.
[41] R. Ramamoorthi, J. Anderson, M. Meyer, and D. Nowrouzezahrai, "A Theory of Monte Carlo Visibility Sampling," ACM Trans. Graphics, vol. 31, no. 5, pp. 121:1-121:16, Sept. 2012.
[42] T. Ritschel, T. Grosch, and H.-P. Seidel, "Approximating Dynamic Global Illumination in Image Space," Proc. Symp. Interactive 3D Graphics and Games, pp. 75-82, 2009.
[43] K. Egan, F. Durand, and R. Ramamoorthi, "Practical Filtering for Efficient Ray-Traced Directional Occlusion," ACM Trans. Graphics, vol. 30, no. 6, pp. 180:1-180:10, Dec. 2011.
[44] E. Cheslack-Postava, R. Wang, O. Akerlund, and F. Pellacini, "Fast, Realistic Lighting and Material Design Using Nonlinear Cut Approximation," ACM Trans. Graphics, vol. 27, no. 5, pp. 128:1-128:10, Dec. 2008.
[45] M. Pharr and G. Humphreys, Physically Based Rendering: From Theory To Implementation, second ed. Morgan Kaufmann, 2010.
[46] T. Ize and C.D. Hansen, "RTSAH Traversal Order for Occlusion Rays," Computer Graphics Forum, vol. 30, no. 2, pp. 297-305, 2011.
69 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool