This book provides a fundamental understanding of global illumination algorithms. It
discusses a broad class of algorithms for realistic image synthesis and introduces a …

A central issue in many engineering design endeavors is the presence of uncertainty in the
problem description. Different application fields employ different characterizations of the …

Many researchers have been arguing that geometry, bump maps, and BRDFs present a
hierarchy of detail that should be exploited for efficient rendering purposes. In practice …

The ultimate objective of image synthesis or rendering is to provide the user with the illusion
of watching real objects on the computer screen (figure 1.1). The image is generated from an …

Abstract Hierarchical radiosity and Monte Carlo radiosity are branches of radiosity research
that focus on complementary problems. The synthesis of both families of radiosity algorithms …

This paper presents a single‐pass, view‐dependent method to solve the rendering
equation, using a stochastic iterational scheme where the transport operator is selected …

Visibility determination, the process of deciding what surfaces can be seen from a certain
point, is one of the fundamental problems in computer graphics. Its importance has long …

Many practical control problems are so complex that traditional analysis and design
methods fail to solve. Consequently, sampling methods that provide approximate solutions …

This paper presents a new method that combines quasi-Monte-Carlo quadrature with
importance sampling and Russian roulette to solve the general rendering equation …

Markov chains can be simulated efficiently by either high-dimensional low discrepancy point
sets or by padding low dimensional point sets. Given an order on the state space, both …