Fast and detailed approximate global illumination by irradiance decomposition

Okan Arikan, David Alexander Forsyth, James F. O'Brien

Research output: Contribution to journalConference article

Abstract

In this paper we present an approximate method for accelerated computation of the final gathering step in a global illumination algorithm. Our method operates by decomposing the radiance field close to surfaces into separate far- and near-field components that can be approximated individually. By computing surface shading using these approximations, instead of directly querying the global illumination solution, we have been able to obtain rendering time speed ups on the order of 10times; compared to previous acceleration methods. Our approximation schemes rely mainly on the assumptions that radiance due to distant objects will exhibit low spatial and angular variation, and that the visibility between a surface and nearby surfaces can be reasonably predicted by simple location-and orientation-based heuristics. Motivated by these assumptions, our far-field scheme uses scattered-data interpolation with spherical harmonics to represent spatial and angular variation, and our near-field scheme employs an aggressively simple visibility heuristic. For our test scenes, the errors introduced when our assumptions fail do not result in visually objectionable artifacts or easily noticeable deviation from a ground-truth solution. We also discuss how our near-field approximation can be used with standard local illumination algorithms to produce significantly improved images at only negligible additional cost.

Original languageEnglish (US)
Pages (from-to)1108-1114
Number of pages7
JournalACM Transactions on Graphics
Volume24
Issue number3
DOIs
StatePublished - Jul 1 2005
EventACM SIGGRAPH 2005 - Los Angeles, CA, United States
Duration: Jul 31 2005Aug 4 2005

Fingerprint

Lighting
Decomposition
Visibility
Interpolation
Costs

Keywords

  • Approximate global illumination
  • Final gather
  • Spherical harmonics

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Fast and detailed approximate global illumination by irradiance decomposition. / Arikan, Okan; Forsyth, David Alexander; O'Brien, James F.

In: ACM Transactions on Graphics, Vol. 24, No. 3, 01.07.2005, p. 1108-1114.

Research output: Contribution to journalConference article

@article{e56eefca0ab44550939c0bebe8995860,
title = "Fast and detailed approximate global illumination by irradiance decomposition",
abstract = "In this paper we present an approximate method for accelerated computation of the final gathering step in a global illumination algorithm. Our method operates by decomposing the radiance field close to surfaces into separate far- and near-field components that can be approximated individually. By computing surface shading using these approximations, instead of directly querying the global illumination solution, we have been able to obtain rendering time speed ups on the order of 10times; compared to previous acceleration methods. Our approximation schemes rely mainly on the assumptions that radiance due to distant objects will exhibit low spatial and angular variation, and that the visibility between a surface and nearby surfaces can be reasonably predicted by simple location-and orientation-based heuristics. Motivated by these assumptions, our far-field scheme uses scattered-data interpolation with spherical harmonics to represent spatial and angular variation, and our near-field scheme employs an aggressively simple visibility heuristic. For our test scenes, the errors introduced when our assumptions fail do not result in visually objectionable artifacts or easily noticeable deviation from a ground-truth solution. We also discuss how our near-field approximation can be used with standard local illumination algorithms to produce significantly improved images at only negligible additional cost.",
keywords = "Approximate global illumination, Final gather, Spherical harmonics",
author = "Okan Arikan and Forsyth, {David Alexander} and O'Brien, {James F.}",
year = "2005",
month = "7",
day = "1",
doi = "10.1145/1073204.1073319",
language = "English (US)",
volume = "24",
pages = "1108--1114",
journal = "ACM Transactions on Computer Systems",
issn = "0730-0301",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - Fast and detailed approximate global illumination by irradiance decomposition

AU - Arikan, Okan

AU - Forsyth, David Alexander

AU - O'Brien, James F.

PY - 2005/7/1

Y1 - 2005/7/1

N2 - In this paper we present an approximate method for accelerated computation of the final gathering step in a global illumination algorithm. Our method operates by decomposing the radiance field close to surfaces into separate far- and near-field components that can be approximated individually. By computing surface shading using these approximations, instead of directly querying the global illumination solution, we have been able to obtain rendering time speed ups on the order of 10times; compared to previous acceleration methods. Our approximation schemes rely mainly on the assumptions that radiance due to distant objects will exhibit low spatial and angular variation, and that the visibility between a surface and nearby surfaces can be reasonably predicted by simple location-and orientation-based heuristics. Motivated by these assumptions, our far-field scheme uses scattered-data interpolation with spherical harmonics to represent spatial and angular variation, and our near-field scheme employs an aggressively simple visibility heuristic. For our test scenes, the errors introduced when our assumptions fail do not result in visually objectionable artifacts or easily noticeable deviation from a ground-truth solution. We also discuss how our near-field approximation can be used with standard local illumination algorithms to produce significantly improved images at only negligible additional cost.

AB - In this paper we present an approximate method for accelerated computation of the final gathering step in a global illumination algorithm. Our method operates by decomposing the radiance field close to surfaces into separate far- and near-field components that can be approximated individually. By computing surface shading using these approximations, instead of directly querying the global illumination solution, we have been able to obtain rendering time speed ups on the order of 10times; compared to previous acceleration methods. Our approximation schemes rely mainly on the assumptions that radiance due to distant objects will exhibit low spatial and angular variation, and that the visibility between a surface and nearby surfaces can be reasonably predicted by simple location-and orientation-based heuristics. Motivated by these assumptions, our far-field scheme uses scattered-data interpolation with spherical harmonics to represent spatial and angular variation, and our near-field scheme employs an aggressively simple visibility heuristic. For our test scenes, the errors introduced when our assumptions fail do not result in visually objectionable artifacts or easily noticeable deviation from a ground-truth solution. We also discuss how our near-field approximation can be used with standard local illumination algorithms to produce significantly improved images at only negligible additional cost.

KW - Approximate global illumination

KW - Final gather

KW - Spherical harmonics

UR - http://www.scopus.com/inward/record.url?scp=33646034357&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646034357&partnerID=8YFLogxK

U2 - 10.1145/1073204.1073319

DO - 10.1145/1073204.1073319

M3 - Conference article

AN - SCOPUS:33646034357

VL - 24

SP - 1108

EP - 1114

JO - ACM Transactions on Computer Systems

JF - ACM Transactions on Computer Systems

SN - 0730-0301

IS - 3

ER -