Corpus ID: 4689339

Higher-Order Radiosity Approximations with a Stochastic Jacobi Iterative Method

  title={Higher-Order Radiosity Approximations with a Stochastic Jacobi Iterative Method},
  author={P. Bekaert and M. Sbert and Y. Willems},
The computation of higher-order polynomial radiosity approximations on a fixed element mesh, results in more smooth images than with a traditional piecewise constant radiosity approximation. Unfortunately, the number of form factors to be stored in a deterministic approach is considerably higher than with a constant approximation and the computation itself of the form factors is more difficult. In this paper, we present a new stochastic approach for computing higher-order radiosity… Expand

Figures from this paper

This paper discusses the first full version of IDEA-l, a new natural-lighting design tool for the early stages of the architectural design process. This computer program, which is part of the largerExpand


The Stochastic Ray Method for Radiosity
The new algorithm can easily be extended to treat various phenomena which are normally rather costly to incorporate in radiosity environments, perfect specular reflection and specular transmittance, non-diffuse self-emission and point light sources. Expand
Hierarchical and stochastic algorithms for radiosity
The resulting Monte Carlo radiosity algorithms do not only appear to be more reliable, but also often lead more rapidly to usable images than their deterministic counterparts and they require significantly less computer storage, and they are more user friendly. Expand
Radiosity algorithms using higher order finite element methods
Two algorithms, derived from the finite element method, are described and analyzed and can incorporate an interpolation function directly into the authors' form factor computation. Expand
Radiosity with Well Distributed Ray Sets
This paper proposes an algorithm that constructs an optimal WDRS for a given accuracy and mesh, based on discrete importance sampling as in previously proposed stochastic radiosity algorithms, and on quasi Monte Carlo sampling. Expand
Finite Element Methods for Global Illumination
The interreflection of light between surfaces is governed by an integral equation. Existing radiosity algorithms approximate the solution of this integral equation by transforming it into a system ofExpand
An importance-driven radiosity algorithm
The algorithm uses an adaptive subdivision scheme that is guided by the interplay between two closely related transport processes: one propagating power from the light sources, and the other propagating imporrarwc from the visible surfaces. Expand
Galerkin radiosity: a higher order solution method for global illumination
This paper presents an alternative radiosity formulation using piecewise smooth radiance functions that incorporates curved surfaces directly using the Galerkin integral equation technique as a mathematical foundation, and eliminates the need for a posteriori rendering interpolation, and allows the direct use of non-planar parametric surfaces. Expand
Importance-Driven Stochastic Ray Radiosity
This paper presents an extension of the stochastic ray radiosity method which will provide a significant reduction of computational cost in cases where accurate knowledge of the illumination is needed in only a small part of the scene. Expand
An empirical comparison of Monte Carlo radiosity algorithms
A comparative study of four main aspects in which proposed Monte Carlo radiosity algorithms differ: whether the discrete or continuous equation is being solved, the random walk state transition simulation technique, sampler order and the sample number generator. Expand
Importance-Driven Hierarchical Stochastic Ray Radiosity
A hierarchical Monte-Carlo radiosi ty algorithm driven by the view importance is presented, making to possible to concentrate the computation l effort on solution in the immediate environment of the observer, trading the low solution quality in invulnerable areas for better quality in areas that are visible for the observer. Expand