Bounded Radiosity - Illumination on General Surfaces and Clusters
No Thumbnail Available
Date
1997
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishers Ltd and the Eurographics Association
Abstract
Traditionally, 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.
Description
@article{10.1111:1467-8659.00168,
journal = {Computer Graphics Forum},
title = {{Bounded Radiosity - Illumination on General Surfaces and Clusters}},
author = {Stamminger, Marc and Slusallek, Philipp and Seidel, Hans-Peter},
year = {1997},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00168}
}