Error and complexity of random walk Monte Carlo radiosity
dc.contributor.author
dc.date.accessioned
2010-10-08T07:46:47Z
dc.date.available
2010-08-10T09:05:54Z
2010-10-08T07:46:47Z
dc.date.issued
1997
dc.identifier.citation
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
dc.identifier.issn
1077-2626
dc.identifier.uri
dc.description.abstract
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
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
IEEE
dc.relation.isformatof
Reproducció digital del document publicat a: http://dx.doi.org/10.1109/2945.582339
dc.relation.ispartof
© IEEE Transactions on Visualization and Computer Graphics, 1997, vol. 3, núm. 1, p. 23-38
dc.relation.ispartofseries
Articles publicats (D-IMA)
dc.rights
Tots els drets reservats
dc.subject
dc.title
Error and complexity of random walk Monte Carlo radiosity
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.identifier.doi
dc.identifier.idgrec
008508