Ítem
| Sbert, Mateu | |
| 1997 | |
| 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 | |
| application/pdf | |
| Sbert, M. (1997). Error and complexity of random walk Monte Carlo radiosity. IEEE Transactions on Visualization and Computer Graphics, 3 (1), 23-38. Recuperat 8 octubre 2010, a http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582339 | |
| 1077-2626 | |
| http://hdl.handle.net/10256/3070 | |
| eng | |
| IEEE | |
|
Reproducció digital del document publicat a: http://dx.doi.org/10.1109/2945.582339 Articles publicats (D-IMA) |
|
| © IEEE Transactions on Visualization and Computer Graphics, 1997, vol. 3, núm. 1, p. 23-38 | |
| Tots els drets reservats | |
|
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 |
|
| Error and complexity of random walk Monte Carlo radiosity | |
| info:eu-repo/semantics/article | |
| DUGiDocs |
