Quasi-Monte Carlo Methods in Computer Graphics: The Global Illumination Problem
نویسنده
چکیده
The main part of the global illumination problem of computer graphics is given by a Fredholm integral equation of the second kind, describing the light distribution in a closed environment. Calculating photorealistic images from that equation requires its kernel to be very complex and discontinuous. Due to this complexity Monte Carlo methods are an interesting tool for estimating a solution. In this article we investigate the application of deterministic quasi-Monte Carlo methods, as compared to pure Monte Carlo methods, for global illumination calculations in very complex environments and give numerical evidence for the superiority of the quasi-Monte Carlo methods.
منابع مشابه
Quasi - Monte Carlo Methods in Computer Graphics
The problem of global illumination in computer graphics is described by a Fredholm integral equation of the second kind. Due to the complexity of this equation, Monte Carlo methods provide an efficient tool for the estimation of the solution. A new approach, using quasi-Monte Carlo integration, is introduced and compared to Monte Carlo integration. We discuss some theoretical aspects and give n...
متن کاملQuasi-Monte Carlo Methods in Computer Graphics, Part II: The Radiance Equation
The radiance equation, which describes the global illumination problem in computer graphics, is a high dimensional integral equation. Estimates of the solution are usually computed on the basis of Monte Carlo methods. In this paper we propose and investigate quasi-Monte Carlo methods, which means that we replace (pseudo-) random samples by low discrepancy sequences, yielding deterministic algor...
متن کاملA Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting
One of the main problems in computer graphics is to solve the global illumination problem, which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel of the integral equation, modelling all physical effects of light, must be considered. Due to this complexity Monte Carlo methods seem to be an...
متن کاملThe Quasi-Random Walk
We present the method of the quasi-random walk for the approximation of functionals of the solution of second kind Fredholm integral equations. This deterministic approach efficiently uses low discrepancy sequences for the quasi-Monte Carlo integration of the Neumann series. The fast procedure is illustrated in the setting of computer graphics, where it is applied to several aspects of the glob...
متن کاملQuasi-Monte Carlo Radiosity
The problem of global illumination in computer graphics is described by a second kind Fredholm integral equation Due to the com plexity of this equation Monte Carlo methods provide an interesting tool for approximating solutions to this transport equation For the case of the radiosity equation we present the deterministic method of quasi random walks This method very e ciently uses low discrepa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995