Sciweavers

148 search results - page 1 / 30
» Global visibility algorithms for illumination computations
Sort
View
SIGGRAPH
1993
ACM
13 years 9 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
SIGGRAPH
1995
ACM
13 years 8 months ago
Feature-based control of visibility error: a multi-resolution clustering algorithm for global illumination
In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method ensures that just enough work is done to meet th...
François X. Sillion, George Drettakis
AFRIGRAPH
2003
ACM
13 years 8 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
GRAPHITE
2007
ACM
13 years 8 months ago
Visibility map for global illumination in point clouds
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
Rhushabh Goradia, Anil Kanakanti, Sharat Chandran,...
TOG
2008
163views more  TOG 2008»
13 years 4 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...