Rendering resources, 20167. ,
, , p.2020
Global Illumination Using Well-Separated Pair Decomposition, Computer Graphics Forum, vol.34, pp.88-103, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01188993
, Computer Graphics Forum, vol.34, issue.2, pp.561-573, 2015.
Efficient shadows for sampled environment maps, Journal of Graphics Tools, vol.11, issue.1, pp.13-36, 2006. ,
A singular value thresholding algorithm for matrix completion, SIAM Journal on optimization, vol.20, pp.1956-1982, 2010. ,
Exact matrix completion via convex optimization, Foundations of Computational Mathematics, vol.9, issue.2, p.3, 2009. ,
Accurate direct illumination using iterative adaptive sampling, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.3, pp.353-364, 2006. ,
Matrix rank minimization with applications, 20023. ,
Local Illumination Environments for Direct Lighting Acceleration, Rendering Techniques, 2002. ,
Importance caching for complex illumination, Computer Graphics Forum, vol.31, pp.701-710, 2012. ,
A theory of pseudoskeleton approximations". Linear algebra and its applications 261, vol.1, p.3, 1997. ,
Direct illumination with lazy visibility evaluation, Proceedings of the 26th annual conference on Computer graphics and interactive techniques. SIGGRAPH '99, pp.147-154, 1999. ,
Rank-constrained solutions to linear matrix equations using powerfactorization, IEEE Signal Processing Letters, vol.16, p.3, 2009. ,
Virtual spherical lights for many-light rendering of glossy scenes, ACM Transactions on Graphics (TOG), vol.28, pp.1-6, 2009. ,
Matrix Row-column Sampling for the Many-light Problem, vol.26, 2007. ,
Sparsely precomputing the light transport matrix for real-time rendering, Computer Graphics Forum, vol.29, pp.1335-1345, 2010. ,
Adaptive matrix column sampling and completion for rendering participating media, ACM Transactions on Graphics (TOG), vol.35, 2016. ,
A matrix sampling-and-recovery approach for many-lights rendering, ACM Transactions on Graphics (TOG), vol.34, issue.6, 2015. ,
, , 20107.
Realistic image synthesis using photon mapping, 20014. ,
Instant Radiosity, Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. SIGGRAPH '97, pp.49-56, 1997. ,
On the power of adaptivity in matrix completion and approximation, vol.2, p.3, 2014. ,
, Computer Graphics Archive, 2017.
Visibility based WSPD for Global Illumination, 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, vol.1, pp.81-90, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01698656
Lightslice source code, pp.2020-2023 ,
LightSlice: matrix slice sampling for the many-lights problem, ACM Transactions on graphics (TOG), vol.30, pp.179-180, 2011. ,
Lightcut interpolation, Proceedings of High Performance Graphics, pp.99-108, 2016. ,
Interactive illumination with coherent shadow maps, Proceedings of the 18th Eurographics conference on Rendering Techniques. Eurographics Association, pp.61-72, 2007. ,
Interactive global illumination based on coherent surface shadow maps, Proceedings of Graphics Interface, pp.185-192, 2008. ,
Low rank matrix completion by alternating steepest descent methods, Analysis, vol.40, pp.417-429, 2016. ,
Scalable Virtual Ray Lights Rendering for Participating Media, Computer Graphics Forum, vol.38, pp.57-65, 2019. ,
Bayesian online regression for adaptive direct illumination sampling, ACM Transactions on Graphics (TOG), vol.37, p.3, 2018. ,
, Multidimensional lightcuts". ACM Transactions on graphics (TOG), vol.25, issue.3, pp.1081-1088, 2006.
VisibilityCluster: Average directional visibility for many-light rendering, IEEE Transactions on Visualization and Computer Graphics, vol.19, pp.1566-1578, 2013. ,
Kernel Nyström method for light transport, ACM Transactions on Graphics (TOG), vol.28, 2009. ,
Lightcuts: a scalable approach to illumination, ACM Transactions on graphics (TOG), vol.24, issue.2, pp.1098-1107, 2005. ,
Bidirectional lightcuts, ACM Transactions on Graphics (TOG), vol.31, 2012. ,
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm, pp.333-361 ,