All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Importance Caching for Complex Illumination

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127580" target="_blank" >RIV/00216208:11320/12:10127580 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1111/j.1467-8659.2012.03049.x" target="_blank" >http://dx.doi.org/10.1111/j.1467-8659.2012.03049.x</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1111/j.1467-8659.2012.03049.x" target="_blank" >10.1111/j.1467-8659.2012.03049.x</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Importance Caching for Complex Illumination

  • Original language description

    Realistic rendering requires computing the global illumination in the scene, and Monte Carlo integration is the best-known method for doing that. The key to good performance is to carefully select the costly integration samples, which is usually achievedvia importance sampling. Unfortunately, visibility is difficult to factor into the importance distribution, which can greatly increase variance in highly occluded scenes with complex illumination. In this paper, we present importance caching - a novel approach that selects those samples with a distribution that includes visibility, while maintaining efficiency by exploiting illumination smoothness. At a sparse set of locations in the scene, we construct and cache several types of probability distributions with respect to a set of virtual point lights (VPLs), which notably include visibility. Each distribution type is optimized for a specific lighting condition. For every shading point, we then borrow the distributions from nearby cache

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computer Graphics Forum

  • ISSN

    0167-7055

  • e-ISSN

  • Volume of the periodical

    31

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    10

  • Pages from-to

    701-710

  • UT code for WoS article

    000306181700019

  • EID of the result in the Scopus database