Ítem


Error and complexity of random walk Monte Carlo radiosity

The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown

IEEE

Autor: Sbert, Mateu
Resum: The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown
Accés al document: http://hdl.handle.net/2072/94973
Llenguatge: eng
Editor: IEEE
Drets: Tots els drets reservats
Matèria: Anàlisi d’error (Matemàtica)
Complexitat computacional
Infografia
Montecarlo, Mètode de
Rutes aleatòries (Matemàtica)
Error analysis (Mathematics)
Computer graphics
Computational complexity
Monte Carlo method
Random walks
Títol: Error and complexity of random walk Monte Carlo radiosity
Tipus: info:eu-repo/semantics/article
Repositori: Recercat

Matèries

Autors