Automatic Bounding of Programmable Shaders for Efficient Global Illumination

  • Edgar Velázquez-Armendáriz
  • , Shuang Zhao
  • , Miloš Hašan
  • , Bruce Walter
  • , Kavita Bala

Research output: Contribution to journalArticlepeer-review

Abstract

This paper describes a technique to automatically adapt programmable shaders for use in physically-based rendering algorithms. Programmable shading provides great flexibility and power for creating rich local material detail, but only allows the material to be queried in one limited way: point sampling. Physically-based rendering algorithms simulate the complex global flow of light through an environment but rely on higher level information about the material properties, such as importance sampling and bounding, to intelligently solve high dimensional rendering integrals. We propose using a compiler to automatically generate interval versions of programmable shaders that can be used to provide the higher level query functions needed by physically-based rendering without the need for user intervention or expertise. We demonstrate the use of programmable shaders in two such algorithms, multidimensional lightcuts and photon mapping, for a wide range of scenes including complex geometry, materials and lighting.

Original languageEnglish (US)
Pages (from-to)1-9
Number of pages9
JournalACM Transactions on Graphics
Volume28
Issue number5
Early online dateDec 2009
DOIs
StatePublished - Dec 1 2009
Externally publishedYes

Keywords

  • global illumination
  • interval arithmetic
  • many-lights

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Automatic Bounding of Programmable Shaders for Efficient Global Illumination'. Together they form a unique fingerprint.

Cite this