Hierarchical Radiosity for Dynamic Environments

dc.contributor.authorShaw, Erinen_US
dc.date.accessioned2015-02-15T16:46:52Z
dc.date.available2015-02-15T16:46:52Z
dc.date.issued1997en_US
dc.description.abstractThis paper extends the hierarchical radiosity method to environments in which geometry and surface attributes can be changed dynamically. New algorithms are presented for maintaining an appropriately-sized mesh and speeding the construction of the corresponding linear system. Mesh folding, the unrefinement of a mesh, is used to optimize mesh size while maintaining a specified error tolerance. Two new interactions are introduced: shadow links guide local shadow clean up after a change in geometry and ghost links guide global mesh folding after a change in surface attributes. The algorithms stabilize the memory requirements of dynamic scenes. Different types of interactions are analyzed to determine how they are affected by changes in geometry. A dynamic scene-partitioning scheme called a motion volume, used in conjunction with a three-dimensional clipping algorithm, provides a fast way to cull interactions that do not need to be updated. The algorithms are demonstrated on several sample scenes.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume16en_US
dc.identifier.doi10.1111/1467-8659.00127en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages107-118en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00127en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleHierarchical Radiosity for Dynamic Environmentsen_US
Files
Collections