Time Complexity of Monte Carlo Radiosity
dc.contributor.author | Shirley, Peter | en_US |
dc.date.accessioned | 2015-10-05T07:56:49Z | |
dc.date.available | 2015-10-05T07:56:49Z | |
dc.date.issued | 1991 | en_US |
dc.identifier.issn | 1017-4656 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/egtp.19911034 | en_US |
dc.description.abstract | The time complexity of Monte Carlo radiosity is discussed, and a proof is given that the expected number of rays required to produce a satisfactory radiosity solution for N zones is O(N). A satisfactory solution is defined to be one in which the variance of radiance estimates for each zone is below a predefined threshold. The proof assumes that the radiance is bounded, and the area ratio of the largest to smallest zone is bounded. | en_US |
dc.publisher | Eurographics Association | en_US |
dc.title | Time Complexity of Monte Carlo Radiosity | en_US |
dc.description.seriesinformation | EG 1991-Technical Papers | en_US |
dc.identifier.doi | 10.2312/egtp.19911034 | en_US |
Files in this item
This item appears in the following Collection(s)
-
EG1991 Proceedings (Technical Papers)
EG Conference Proceedings -
EG1991 Proceedings (Technical Papers)