Quantifying the Error of Light Transport Algorithms
暂无分享,去创建一个
[1] Matthias Zwicker,et al. Adaptive rendering with non-local means filtering , 2012, ACM Trans. Graph..
[2] Werner Purgathofer,et al. On The Start-Up Bias Problem Of Metropolis Sampling , 1999 .
[3] Carsten Dachsbacher,et al. Visualization of Coherent Structures of Light Transport , 2015, Comput. Graph. Forum.
[4] Jaakko Lehtinen,et al. Gradient-domain path tracing , 2015, ACM Trans. Graph..
[5] Peter Shirley,et al. A variance analysis of the Metropolis Light Transport algorithm , 2001, Comput. Graph..
[6] Jaakko Lehtinen,et al. Gradient-domain metropolis light transport , 2013, ACM Trans. Graph..
[7] James Arvo,et al. A framework for the analysis of error in global illumination algorithms , 1994, SIGGRAPH.
[8] Ares Lagae,et al. A Comparison of Methods for Generating Poisson Disk Distributions , 2008, Comput. Graph. Forum.
[9] Leonidas J. Guibas,et al. Metropolis light transport , 1997, SIGGRAPH.
[10] F. Durand. A Frequency Analysis of Light Transport , 2011 .
[11] Jan Kautz,et al. Fourier analysis of stochastic sampling strategies for assessing bias and variance in integration , 2013, ACM Trans. Graph..
[12] Csaba Kelemen,et al. Simple and Robust Mutation Strategy for Metropolis Light Transport Algorithm , 2001 .
[13] Gurprit Singh,et al. Variance analysis for Monte Carlo integration , 2015, ACM Trans. Graph..
[14] Justin Talbot,et al. Energy redistribution path tracing , 2005, ACM Trans. Graph..
[15] Rafal Mantiuk,et al. Analysis of reported error in Monte Carlo rendered images , 2017, The Visual Computer.