Sciweavers

14 search results - page 1 / 3
» Metropolis Iteration for Global Illumination
Sort
View
WSCG
2004
142views more  WSCG 2004»
13 years 8 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
CGF
1999
79views more  CGF 1999»
13 years 7 months ago
Stochastic Iteration for Non-diffuse Global Illumination
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 randomly i...
László Szirmay-Kalos
RT
1998
Springer
13 years 11 months ago
Global Ray-Bundle Tracing with Hardware Acceleration
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
László Szirmay-Kalos, Werner Purgath...
SIGGRAPH
1994
ACM
13 years 11 months ago
A framework for the analysis of error in global illumination algorithms
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
James Arvo, Kenneth E. Torrance, Brian E. Smits
WSC
2004
13 years 8 months ago
Simulation-Based Optimization Using Simulated Annealing With Confidence Interval
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
Talal M. Alkhamis, Mohamed A. Ahmed