57 search results - page 4 / 12 » An importance-driven radiosity algorithm |
RT
1997
Springer
14 years 1 months ago
1997
Springer
Abstract. This paper presents a comparison of basic progressive and wavelet radiosity algorithms. Several variants of each algorithm were run on a set of scenes at several paramete...
SIGGRAPH
1992
ACM
14 years 1 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
CGF
1998
13 years 9 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
CGF
2004
13 years 9 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
WSCG
2003
13 years 11 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...