Data-Parallel Hierarchical Link Creation for Radiosity

Simple item page
dc.contributor.authorMeyer, Quirinen_US
dc.contributor.authorEisenacher, Christianen_US
dc.contributor.authorStamminger, Marcen_US
dc.contributor.authorDachsbacher, Carstenen_US
dc.contributor.editorKurt Debattista and Daniel Weiskopf and Joao Combaen_US
dc.date.accessioned2014-01-26T16:47:49Z
dc.date.available2014-01-26T16:47:49Z
dc.date.issued2009en_US
dc.description.abstractThe 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.en_US
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US
dc.identifier.isbn978-3-905674-15-6en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttps://doi.org/10.2312/EGPGV/EGPGV09/065-070en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): Computer Graphics [I.3.1]: Parallel processing- Computer Graphics [I.3.6]: Graphics data structures and data types-Computer Graphics [I.3.7]: Radiosityen_US
dc.titleData-Parallel Hierarchical Link Creation for Radiosityen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
065-070.pdf
Size:
2.44 MB
Format:
Adobe Portable Document Format
Download
Collections
EGPGV09: Eurographics Symposium on Parallel Graphics and Visualization