Sciweavers

148 search results - page 13 / 30
» Global visibility algorithms for illumination computations
Sort
View
RT
1998
Springer
13 years 12 months ago
Three Point Clustering for Radiance Computations
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
Marc Stamminger, Philipp Slusallek, Hans-Peter Sei...
PG
2007
IEEE
14 years 1 months ago
The Soft Shadow Occlusion Camera
A fundamental challenge for existing shadow map based algorithms is dealing with partially illuminated surfaces. A conventional shadow map built with a pinhole camera only determi...
Qi Mo, Voicu Popescu, Chris Wyman
SIGGRAPH
1992
ACM
13 years 11 months ago
An importance-driven radiosity algorithm
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 ...
Brian E. Smits, James Arvo, David Salesin
CGF
2008
114views more  CGF 2008»
13 years 7 months ago
Real-time Shading with Filtered Importance Sampling
We propose an analysis of numerical integration based on sampling theory, whereby the integration error caused by aliasing is suppressed by pre-filtering. We derive a pre-filter f...
Jaroslav Krivánek, Mark Colbert
WSCG
2003
158views more  WSCG 2003»
13 years 9 months ago
Comparison of Accelerating Techniques for Discontinuity Meshing
Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategie...
Karel Nechvíle, Petr Tobola, Jiri Sochor