Bounded Radiosity - Illumination on General Surfaces and Clusters

Simple item page
dc.contributor.authorStamminger, Marcen_US
dc.contributor.authorSlusallek, Philippen_US
dc.contributor.authorSeidel, Hans-Peteren_US
dc.date.accessioned2015-02-15T18:05:28Z
dc.date.available2015-02-15T18:05:28Z
dc.date.issued1997en_US
dc.description.abstractTraditionally, Radiosity algorithms have been restricted to scenes made from planar patches. Most algorithms for computing form factors and the subdivision criterion for hierarchical methods implicitly assume planar patches. In this paper, we present a new radiosity algorithm that is solely based on simple geometric information about surface elements, namely their bounding boxes and cone of normals. Using this information allows to compute efficient error bounds that can be used for the subdivision oracle and for computing the energy transfer. Due to the simple interface to geometric objects, our algorithm not only allows for computing illumination on general curved surfaces, but it can also be directly applied to a hieararchy of clusters. Several examples demonstrate the advantages of the new approach.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume16en_US
dc.identifier.doi10.1111/1467-8659.00168en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pagesC309-C317en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00168en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleBounded Radiosity - Illumination on General Surfaces and Clustersen_US
Files
Collections
Issue 3