Global Illumination Using Well‐Separated Pair Decomposition
| dc.contributor.author | Bus, N. | en_US |
| dc.contributor.author | Mustafa, N. H. | en_US |
| dc.contributor.author | Biri, V. | en_US |
| dc.contributor.editor | Deussen, Oliver and Zhang, Hao (Richard) | en_US |
| dc.date.accessioned | 2016-01-25T14:31:25Z | |
| dc.date.available | 2016-01-25T14:31:25Z | |
| dc.date.issued | 2015 | en_US |
| dc.description.abstract | Instant radiosity methods rely on using a large number of virtual point lights (VPLs) to approximate global illumination. Efficiency considerations require grouping the VPLs into a small number of clusters that are treated as individual lights with respect to each point to be shaded. Two examples of clustering algorithms are Lightcuts [WFA*05] and LightSlice [OP11]. In this work, we use the notion of geometric separatedness of point sets as a basis for a data structure for pre‐computing and compactly storing a set of candidate VPL clusterings. Our data structure is created prior to rendering, is view‐independent and relies only on geometric and radiometric information. For any point to be shaded, we show that a suitable clustering of the VPLs can be efficiently extracted from this data structure. We develop the above framework into an accurate and efficient clustering algorithm based on well‐separated pair decompositions which outperforms earlier work in speed and/or quality for diffuse scenes.Instant radiosity methods rely on using a large number of virtual point lights (VPLs) to approximate global illumination. Efficiency considerations require grouping the VPLs into a small number of clusters that are treated as individual lights with respect to each point to be shaded. In this work, we use the notion of geometric separatedness of point sets as a basis for a data structure for pre‐computing and compactly storing a set of candidate VPL clusterings. Our data structure is created prior to rendering, is view‐independent and relies only on geometric and radiometric information. For any point to be shaded, we show that a suitable clustering of the VPLs can be efficiently extracted from this data structure. | en_US |
| dc.description.number | 8 | en_US |
| dc.description.sectionheaders | Articles | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 34 | en_US |
| dc.identifier.doi | 10.1111/cgf.12610 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12610 | en_US |
| dc.publisher | Copyright © 2015 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | Global Illumination | en_US |
| dc.subject | Illumination Rendering | en_US |
| dc.subject | Ray Tracing | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three Dimensional Graphics and Realism–Color shading shadowing and texture | en_US |
| dc.title | Global Illumination Using Well‐Separated Pair Decomposition | en_US |