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”

Light Transport Simulation with Vertex Connection and Merging

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://dx.doi.org/10.1145/2366145.2366211" target="_blank" >http://dx.doi.org/10.1145/2366145.2366211</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2366145.2366211" target="_blank" >10.1145/2366145.2366211</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Light Transport Simulation with Vertex Connection and Merging

  • Original language description

    Developing robust light transport simulation algorithms that are capable of dealing with arbitrary input scenes remains an elusive challenge. Although efficient global illumination algorithms exist, an acceptable approximation error in a reasonable amount of time is usually only achieved for specific types of input scenes. To address this problem, we present a reformulation of photon mapping as a bidirectional path sampling technique for Monte Carlo light transport simulation. The benefit of our new formulation is twofold. First, it makes it possible, for the first time, to explain in a formal manner the relative efficiency of photon mapping and bidirectional path tracing, which have so far been considered conceptually incompatible solutions to the light transport problem. Second, it allows for a seamless integration of the two methods into a more robust combined rendering algorithm via multiple importance sampling. A progressive version of this algorithm is consistent and efficiently

  • 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

    ACM Transactions on Graphics

  • ISSN

    0730-0301

  • e-ISSN

  • Volume of the periodical

    31

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    10

  • Pages from-to

    1-10

  • UT code for WoS article

    000311298900066

  • EID of the result in the Scopus database