Results 1 -
9 of
9
Interactive Global Illumination in Dynamic Scenes
- ACM Trans. Graphics
, 2002
"... In this paper, we present a system for interactive computation of global illumination in dynamic scenes. Our system uses a novel scheme for caching the results of a high quality pixel-based renderer such as a bidirectional path tracer. The Shading Cache is an objectspace hierarchical subdivision mes ..."
Abstract
-
Cited by 63 (8 self)
- Add to MetaCart
In this paper, we present a system for interactive computation of global illumination in dynamic scenes. Our system uses a novel scheme for caching the results of a high quality pixel-based renderer such as a bidirectional path tracer. The Shading Cache is an objectspace hierarchical subdivision mesh with lazily computed shading values at its vertices. A high frame rate display is generated from the Shading Cache using hardware-based interpolation and texture mapping. An image space sampling scheme refines the Shading Cache in regions that have the most interpolation error or those that are most likely to be affected by object or camera motion. Our system handles dynamic scenes and moving light sources efficiently, providing useful feedback within a few seconds and high quality images within a few tens of seconds, without the need for any pre-computation. Our approach allows us to significantly outperform other interactive systems based on caching ray-tracing samples, especially in dynamic scenes. Based on our results, we believe that the Shading Cache will be an invaluable tool in lighting design and modelling while rendering.
State of the art in global illumination for interactive applications and high-quality animations
- Computer Graphics Forum
, 2003
"... Global illumination algorithms are regarded as computationally intensive. This cost is a practical problem when producing animations or when interactions with complex models are required. Several algorithms have been proposed to address this issue. Roughly, two families of methods can be distinguish ..."
Abstract
-
Cited by 15 (6 self)
- Add to MetaCart
Global illumination algorithms are regarded as computationally intensive. This cost is a practical problem when producing animations or when interactions with complex models are required. Several algorithms have been proposed to address this issue. Roughly, two families of methods can be distinguished. The first one aims at providing interactive feedback for lighting design applications. The second one gives higher priority to the quality of results, and therefore relies on offline computations. Recently, impressive advances have been made in both categories. In this report, we present a survey and classification of the most up-to-date of these methods. ACM CSS: I.3.7 Computer Graphics—Three-Dimensional Graphics and Realism 1.
Global Illumination for Interactive Application and High-Quality Animation
, 2002
"... One of the main obstacles to the use of global illumination in image synthesis industry is the considerable amount of time needed to compute the lighting for a single image. Until now, this computational cost has prevented its widespread use in interactive design applications as well as in compute ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
One of the main obstacles to the use of global illumination in image synthesis industry is the considerable amount of time needed to compute the lighting for a single image. Until now, this computational cost has prevented its widespread use in interactive design applications as well as in computer animations. Several algorithms have been proposed to address these issues. In this report, we present a much needed survey and classification of the most up-to-date of these methods. Roughly, two families of algorithms can be distinguished. The first one aims at providing interactive feedback for lighting design applications. The second one gives higher priority to the quality of results, and therefore relies on offline computations. Recently, impressive advances have been made in both categories. Indeed, with the steady progress of computing resources and graphics hardware, and the current trend of new algorithms for animated scenes, common use of global illumination seems closer than ever.
Interactive caustics using local precomputed irradiance
- In Proc. of Pacific Graphics
, 2004
"... Bright patterns of light focused via reflective or refractive objects onto matte surfaces are called “caustics”. We present a method for rendering dynamic scenes with moving caustics at interactive rates. This technique requires some simplifying assumptions about caustic behavior allowing us to cons ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Bright patterns of light focused via reflective or refractive objects onto matte surfaces are called “caustics”. We present a method for rendering dynamic scenes with moving caustics at interactive rates. This technique requires some simplifying assumptions about caustic behavior allowing us to consider it a local spatial property which we sample in a pre-processing stage. Storing the caustic locally limits caustic rendering to a simple lookup. We examine a number of ways to represent this data, allowing us to trade between accuracy, storage, run time, and precomputation time. 1.
A Final Reconstruction Approach for a Unified Global Illumination Algorithm
, 2004
"... this article, we present a final reconstruction step for a novel unified approach to global illumination, that automatically detects di#erent types of light transfer and uses the appropriate method in a closely-integrated manner. With our approach, we can deal with di#cult lighting configurations su ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
this article, we present a final reconstruction step for a novel unified approach to global illumination, that automatically detects di#erent types of light transfer and uses the appropriate method in a closely-integrated manner. With our approach, we can deal with di#cult lighting configurations such as indirect nondi#use illumination. The first step of this algorithm consists in a view-independent solution based on hierarchical radiosity with clustering, integrated with particle tracing. This first pass results in solutions containing directional effects such as caustics, which can be interactively rendered. The second step consists of a view-dependent final reconstruction that uses all existing information to compute higher quality, ray-traced images
Reflected and Transmitted Irradiance from Area Sources using Vertex Tracing
- Rendering Techniques 2001 (Proceedings of the Twelveth Eurographics Workshop on Rendering
, 2001
"... ..."
Interactive Raytraced Caustics
, 2003
"... In computer graphics, bright patterns of light focused onto matte surfaces are called "caustics". We present a method for rendering dynamic scenes with moving caustics at interactive rates. This technique requires some simplifying assumptions about caustic behavior allowing us to consider it a lo ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
In computer graphics, bright patterns of light focused onto matte surfaces are called "caustics". We present a method for rendering dynamic scenes with moving caustics at interactive rates. This technique requires some simplifying assumptions about caustic behavior allowing us to consider it a local spatial property which we sample in a pre-processing stage. Storing the caustic locally limits caustic rendering to a simple lookup. We examine a number of ways to represent this data, allowing us to trade between accuracy, storage, run time, and precomputation time.
Realtime Ray Tracing and its use for . . .
, 2003
"... Research on realtime ray tracing has recently made tremendous advances. Algorithmic improvements together with optimized software implementations already allow for interactive frame rates even on a single desktop PC. Furthermore, recent research has demonstrated several options for realizing realtim ..."
Abstract
- Add to MetaCart
Research on realtime ray tracing has recently made tremendous advances. Algorithmic improvements together with optimized software implementations already allow for interactive frame rates even on a single desktop PC. Furthermore, recent research has demonstrated several options for realizing realtime ray tracing on different hardware platforms, e.g. via streaming computation on modern graphics processors (GPUs) or via the use of dedicated ray tracing chips. Together, these developments indicate that realtime ray tracing might indeed become a reality and widely available in the near future. As most of todays global illumination algorithms heavily rely on ray tracing, this availability of fast ray tracing technology creates the potential to finally compute even global illumination – the physically correct simulation of light transport – at interactive rates. In this STAR, we will first cover the different research activities for realizing realtime ray tracing on different hardware architectures – ranging from shared memory systems, over PC clusters, programmable GPUs, to custom ray tracing hardware. Based on this overview, we discuss some of the advanced issues, such as support for dynamic scenes and designs for a suitable ray tracing API. The third part of this STAR then builds on top of these techniques by presenting algorithms for interactive global illumination in complex and dynamic scenes that may contain large numbers of light sources. We believe that the improved quality and the increased realism that global illumination adds to interactive environments makes it a potential “killer application” for future 3D graphics.

