Sciweavers

148 search results - page 15 / 30
» Global visibility algorithms for illumination computations
Sort
View
SI3D
2006
ACM
14 years 1 months ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...
RT
2004
Springer
14 years 1 months ago
Realtime Caustics using Distributed Photon Mapping
With the advancements in realtime ray tracing and new global illumination algorithms we are now able to render the most important illumination effects at interactive rates. One of...
Johannes Günther, Ingo Wald, Philipp Slusalle...
POPL
2006
ACM
14 years 8 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
CGI
2004
IEEE
13 years 11 months ago
Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes
Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering&...
Takehiro Tawara, Karol Myszkowski, Hans-Peter Seid...
SIBGRAPI
2005
IEEE
14 years 1 months ago
Analytic Antialiasing for Selective High Fidelity Rendering
Images rendered using global illumination algorithms are considered amongst the most realistic in 3D computer graphics. However, this high fidelity comes at a significant comput...
Peter Longhurst, Kurt Debattista, Richard Gillibra...