Combining global and local virtual lights for detailed glossy illumination

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10057072" target="_blank" >RIV/00216208:11320/10:10057072 - isvavai.cz</a>

Výsledek na webu

<a href="http://dl.acm.org/citation.cfm?doid=1882262.1866169" target="_blank" >http://dl.acm.org/citation.cfm?doid=1882262.1866169</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Combining global and local virtual lights for detailed glossy illumination

Popis výsledku v původním jazyce

While many fast global illumination solutions have been proposed, all of them work under limiting assumptions on the materials and lighting in the scene. In the presence of many glossy (directionally scattering) materials, fast solutions either fail or degenerate to inefficient, brute-force simulations of the underlying light transport. In particular, many-light algorithms are able to provide fast approximations by clamping elements of the light transport matrix, but they eliminate the part of the transport that contributes to accurate glossy appearance. In this paper we introduce a solution that separately solves for the global (low-rank, dense) and local (highrank, sparse) illumination components. For the low-rank component we introduce visibility clustering and approximation, while for the high-rank component we introduce a local light technique to correct for the missing illumination.

Název v anglickém jazyce

Combining global and local virtual lights for detailed glossy illumination

Popis výsledku anglicky

While many fast global illumination solutions have been proposed, all of them work under limiting assumptions on the materials and lighting in the scene. In the presence of many glossy (directionally scattering) materials, fast solutions either fail or degenerate to inefficient, brute-force simulations of the underlying light transport. In particular, many-light algorithms are able to provide fast approximations by clamping elements of the light transport matrix, but they eliminate the part of the transport that contributes to accurate glossy appearance. In this paper we introduce a solution that separately solves for the global (low-rank, dense) and local (highrank, sparse) illumination components. For the low-rank component we introduce visibility clustering and approximation, while for the high-rank component we introduce a local light technique to correct for the missing illumination.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

—

Návaznosti

R - Projekt Ramcoveho programu EK

Rok uplatnění

2010

Kód důvěrnosti údajů

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

Název periodika

ACM Transactions on Graphics

ISSN

0730-0301

e-ISSN

—

Svazek periodika

29

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

10

Strana od-do

1-10

Kód UT WoS článku

000284943000007

EID výsledku v databázi Scopus

—