Issue No. 01 - January-March (1997 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.582339
<p><b>Abstract</b>—In this paper, we study the error and complexity of the discrete random walk Monte Carlo technique for Radiosity, both the shooting and gathering methods. We show 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 <it>O</it>(<it>n</it> log <it>n</it>) complexity. We give and compare three unbiased estimators for each method, and obtain closed forms and bounds for their variances. We also bound the expected value of the Mean Square Error (MSE). Some of the results obtained are also shown to be valid for the nondiscrete gathering case. We also give bounds for the variances and MSE for the infinite path length estimators; these bounds might be useful in the study of the biased estimators resulting of cutting off the infinite path.</p>
Rendering, radiosity, Monte Carlo, random walk.
Mateu Sbert, "Error and Complexity of Random Walk Monte Carlo Radiosity", IEEE Transactions on Visualization & Computer Graphics, vol. 3, no. , pp. 23-38, January-March 1997, doi:10.1109/2945.582339