Show simple item record

dc.contributor.authorBus, N.en_US
dc.contributor.authorMustafa, N. H.en_US
dc.contributor.authorBiri, V.en_US
dc.contributor.editorDeussen, Oliver and Zhang, Hao (Richard)en_US
dc.date.accessioned2016-01-25T14:31:25Z
dc.date.available2016-01-25T14:31:25Z
dc.date.issued2015en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12610en_US
dc.description.abstractInstant 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.publisherCopyright © 2015 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectGlobal Illuminationen_US
dc.subjectIllumination Renderingen_US
dc.subjectRay Tracingen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three Dimensional Graphics and Realism–Color shading shadowing and textureen_US
dc.titleGlobal Illumination Using Well‐Separated Pair Decompositionen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.sectionheadersArticlesen_US
dc.description.volume34en_US
dc.description.number8en_US
dc.identifier.doi10.1111/cgf.12610en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record