• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 34 (2015)
    • 34-Issue 8
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 34 (2015)
    • 34-Issue 8
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Global Illumination Using Well‐Separated Pair Decomposition

    Thumbnail
    View/Open
    v34i8pp088-103.pdf (1.342Mb)
    Date
    2015
    Author
    Bus, N.
    Mustafa, N. H.
    Biri, V.
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    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.
    BibTeX
    @article {10.1111:cgf.12610,
    journal = {Computer Graphics Forum},
    title = {{Global Illumination Using Well‐Separated Pair Decomposition}},
    author = {Bus, N. and Mustafa, N. H. and Biri, V.},
    year = {2015},
    publisher = {Copyright © 2015 The Eurographics Association and John Wiley & Sons Ltd.},
    DOI = {10.1111/cgf.12610}
    }
    URI
    http://dx.doi.org/10.1111/cgf.12610
    Collections
    • 34-Issue 8

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA