Data-Parallel Hierarchical Link Creation for Radiosity
Abstract
The efficient simulation of mutual light exchange for radiosity-like methods has been demonstrated on GPUs. However, those approaches require a suitable set of links and hierarchical data structures, prepared in an expensive preprocessing step. We present a fast, data-parallel method to create links and a compact tree of patches. We demonstrate our approach for Antiradiance and Implicit Visibility. Our algorithm is able to create up to 50 M links per second on an Nvidia GTX 260, allowing fully dynamic scenes at interactive frame rates.
BibTeX
@inproceedings {10.2312:EGPGV:EGPGV09:065-070,
booktitle = {Eurographics Symposium on Parallel Graphics and Visualization},
editor = {Kurt Debattista and Daniel Weiskopf and Joao Comba},
title = {{Data-Parallel Hierarchical Link Creation for Radiosity}},
author = {Meyer, Quirin and Eisenacher, Christian and Stamminger, Marc and Dachsbacher, Carsten},
year = {2009},
publisher = {The Eurographics Association},
ISSN = {1727-348X},
ISBN = {978-3-905674-15-6},
DOI = {10.2312/EGPGV/EGPGV09/065-070}
}
booktitle = {Eurographics Symposium on Parallel Graphics and Visualization},
editor = {Kurt Debattista and Daniel Weiskopf and Joao Comba},
title = {{Data-Parallel Hierarchical Link Creation for Radiosity}},
author = {Meyer, Quirin and Eisenacher, Christian and Stamminger, Marc and Dachsbacher, Carsten},
year = {2009},
publisher = {The Eurographics Association},
ISSN = {1727-348X},
ISBN = {978-3-905674-15-6},
DOI = {10.2312/EGPGV/EGPGV09/065-070}
}