dc.contributor.author | Sbert, Mateu | en_US |
dc.contributor.author | Brusi, Alex | en_US |
dc.contributor.author | Bekaert, Philippe | en_US |
dc.contributor.editor | Dani Lischinski and Greg Ward Larson | en_US |
dc.date.accessioned | 2014-01-27T13:43:49Z | |
dc.date.available | 2014-01-27T13:43:49Z | |
dc.date.issued | 1999 | en_US |
dc.identifier.isbn | 3-211-83382-X | en_US |
dc.identifier.issn | 1727-3463 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/EGWR/EGWR99/089-094 | en_US |
dc.description.abstract | We present a simple technique that improves the efficiency of random walk algorithms for radiosity. Each generated random walk is used to simultaneously sample two distinct radiosity estimators. The first estimator is the commonly used shooting estimator, in which the radiosity due to self-emitted light at the origin of the random walk is recorded at each subsequently visited patch. With the second estimator, the radiosity due to self-emitted light at subsequent destinations is recorded at each visited patch. Closed formulae for the variance of the involved estimators allow to derive a cheap heuristic for combining the resulting radiosity estimates. Empirical results agree well with the heuristic prediction. A fair error reduction is obtained at a negligible additional cost. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Gathering for Free in RandomWalk Radiosity | en_US |
dc.description.seriesinformation | Eurographics Workshop on Rendering | en_US |