Time Complexity of Monte Carlo Radiosity

Simple item page
dc.contributor.authorShirley, Peteren_US
dc.date.accessioned2015-10-05T07:56:49Z
dc.date.available2015-10-05T07:56:49Z
dc.date.issued1991en_US
dc.description.abstractThe 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.description.seriesinformationEG 1991-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19911034en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19911034en_US
dc.publisherEurographics Associationen_US
dc.titleTime Complexity of Monte Carlo Radiosityen_US
Files
Collections
EG1991 Proceedings (Technical Papers)
EG1991 Proceedings (Technical Papers)