A Median Cut Algorithm for Efficient Sampling of Radiosity Functions

Simple item page
dc.contributor.authorFeda, Martinen_US
dc.contributor.authorPurgathofer, Werneren_US
dc.date.accessioned2014-10-21T07:31:23Z
dc.date.available2014-10-21T07:31:23Z
dc.date.issued1994en_US
dc.description.abstractThis paper presents an efficient method for sampling the illumination functions in higher order radiosity algorithms. In such algorithms, the illumination function is not assumed to be constant across each patch, but it is approximated by a function which is at least C1 continuous. Our median cut sampling algorithm is inspired by the observation that many form factors are computed at higher precision than is necessary. While a high sampling rate is necessary in regions of high illumination, dark areas can be sampled at a much lower rate to compute the received radiosity within a given precision. We adaptively subdivide the emitter into regions of approximately equal influence on the result. Form factors are evaluated by the disk approximation and a ray tracing based test for occlusion detection. The implementation of a higher order radiosity system using B-splines as radiosity function is described. The median cut algorithm can also be used for radiosity algorithms based on the constant radiosity assumption.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume13en_US
dc.identifier.doi10.1111/1467-8659.1330433en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages433-442en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1330433en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleA Median Cut Algorithm for Efficient Sampling of Radiosity Functionsen_US
Files
Collections
Issue 3
EG 1994 Conference Proceedings