## Path Space MCMC Methods in Computer Graphics

### Abstract

The objective of a rendering algorithm is to compute a photograph of a simulated reality, which entails finding all the paths along which light can flow from a set of light sources to the camera. The purpose of this article is to present a high-level overview of the underlying physics and analyze how this leads to a high-dimensional integration problem that is typically handled using Monte Carlo methods. Following this, we survey recent work on path space Markov Chain Monte Carlo (MCMC) methods that compute the resulting integrals using proposal distributions defined on sets of light paths.

###### Text citation

Wenzel Jakob and Steve Marschner. 2016. Path Space MCMC Methods in Computer Graphics. In *Monte Carlo and Quasi-Monte Carlo Methods (Springer Proceedings in Mathematics & Statistics)*.

###### BibTeX

@incollection{Jakob2016Path, author = {Wenzel Jakob and Steve Marschner}, title = {Path Space MCMC Methods in Computer Graphics}, booktitle = {Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014 (Springer Proceedings in Mathematics & Statistics)}, editor = {Ronald Cools and Dirk Nuyens}, publisher = {Springer International Publishing}, year = {2016}, month = jul, doi = {10.1007/978-3-319-33507-0} }