Filters








340 Hits in 3.9 sec

Instant Caching for Interactive Global Illumination

K. Debattista, P. Dubla, F. Banterle, L.P. Santos, A. Chalmers
2009 Computer graphics forum (Print)  
The exploitation of spatial and temporal coherence allows us to achieve superior frame rates for interactive global illumination within dynamic scenes, without any precomputation or quality loss when compared  ...  Additionally, temporal coherence is exploited by identifying which computations have been invalidated due to geometric transformations and updating only those paths.  ...  We would like to thank Kadi Bouatouch for insightful comments on the document. This research was partially funded PT-FCT grant PTDC/EIA/65965/2006 (IGIDE project) and UK-EPSRC grant EP/D069874/2.  ... 
doi:10.1111/j.1467-8659.2009.01435.x fatcat:mukwlcmq75bwrpi5tyfa2jakxy

Implementation and analysis of an image-based global illumination framework for animated environments

J. Nimeroff, J. Dorsey, H. Rushmeier
1996 IEEE Transactions on Visualization and Computer Graphics  
We also present algorithms for computing the global illumination in the base images that exploit spatial and temporal coherence by considering direct and indirect illumination separately.  ...  We present algorithms for determining locations for these base images, and the time steps required to adequately capture the effects of object motion.  ...  In general, this failure to exploit spatial coherence has kept MCPT from becoming a widely used technique. No work has been done to accelerate MCPT for animated sequences.  ... 
doi:10.1109/2945.556498 fatcat:34fb3qiv4jf2xnv4dkexx6rgyq

Space-Time Hierarchical Radiosity [chapter]

Cyrille Damez, François Sillion
1999 Eurographics  
We base our approach on a Space-Time hierarchy, adding a life span to hierarchical surface elements, and present an integrated formulation of Hierarchical Radiosity with this extended hierarchy.  ...  Such solutions could, for instance, be computed to simulate subtle lighting effects (indirect lighting) in animation systems, or to obtain highquality synthetic image sequences to blend with live action  ...  Clearly, smarter techniques such as motion volumes should therefore allow large acceleration, similar to the use of shafts in the spatial dimensions.  ... 
doi:10.1007/978-3-7091-6809-7_21 fatcat:6ulhoiloqrch7mmfulsp6ewg74

Space-Time Hierarchical Radiosity with Clustering and Higher-OrderWavelets [article]

Cyrille Damez, Nicolas Holzschuch, Francois X. Sillion
2001 Eurographics State of the Art Reports  
We demonstrate how space-time hierarchical radiosity, i.e. the application to the time dimension of a hierarchical decomposition algorithm, can be effectively used to obtain smooth animations: first by  ...  proposing the integration of spatial clustering in a space-time hierarchy; second, by changing the wavelet basis used for the temporal dimension.  ...  This results in a 4 dimensional space-time hierarchy that exploits temporal coherence.  ... 
doi:10.2312/egs.20011002 fatcat:isdqmu62zfczxii26dnwbh54a4

The Ray Engine [article]

Nathan A. Carr, Jesse D. Hall, John C. Hart
2002 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware - HWWS '04  
We must now determine when it is more efficient to use the CPU instead of the GPU. It is important to exploit triangle and ray coherence only where it exists, and not to force it where it does not.  ...  An axisaligned BSP-tree provided spatial coherence of the triangle data, but required special implemention to efficiently support parsing by the four ray-parallel processes.  ... 
doi:10.2312/eggh/eggh02/037-046 fatcat:ojlneegjhzahldtosc2htyhopy

Global Illumination for Interactive Applications and High-Quality Animations [article]

Cyrille Damez, Kirill Dmitriev, Karol Myszkowski
2002 Eurographics State of the Art Reports  
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.  ...  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.  ...  Acknowledgements We would like to thank the authors of discussed papers who provided us with images illustrating their work.  ... 
doi:10.2312/egst.20021050 fatcat:gkihynhv2ra47ltdoa3gqk5se4

Parallel hierarchical radiosity on hybrid platforms

Emilio J. Padrón, Margarita Amor, Montserrat Bóo, Gabriel Rodríguez, Ramón Doallo
2011 Journal of Supercomputing  
Our solution allows the exploitation of systems that combine independent nodes with multiple cores per node.  ...  In this paper a new parallel global illumination method for hybrid systems based on the hierarchical radiosity method is presented.  ...  Nevertheless, convex geometric partitions allow the exploitation of spatial locality of the objects in a scene.  ... 
doi:10.1007/s11227-011-0592-6 fatcat:hm3r2et655bzjeutv32uirgrve

Thrifty Final Gather for Radiosity [chapter]

Annette Scheel, Marc Stamminger, Hans-Peter Seidel
2001 Eurographics  
In this paper an algorithm is presented which significantly speeds up the final gather by exploiting spatial and directional coherence information taken from the radiosity solution.  ...  Senders are classified, so that their contribution to a pixel is either interpolated from the radiosity solution or recomputed with an appropriate number of new samples.  ...  We would also like to thank George Drettakis for fruitful discussions and proofreading and the reviewers for their valuable comments. iMAGIS is a joint project of CNRS/INRIA/UJF/INPG.  ... 
doi:10.1007/978-3-7091-6242-2_1 fatcat:tbl4e3phwfgyhb6nxxk3jarydy

Overlapping multi-processing and graphics hardware acceleration: performance evaluation

X. Cavin, L. Alonso, J.-C. Paul
1999 Proceedings 1999 IEEE Parallel Visualization and Graphics Symposium (Cat. No.99EX381)  
The experiment is based on an implementation of a new parallel wavelet radiosity algorithm. The application is executed on the SGI Origin2000 connected to the SGI InfiniteReality2 rendering pipeline.  ...  In a previous paper [4], we presented an efficient parallelization of a wavelet radiosity algorithm and we pointed out this limitation of parallelism for radiosity-based rendering. ¤  ...  Acknowledgments We would like to thank the Centre Charles Hermite for providing the resources necessary to the experimentations implied by our research work, and especially Alain Filbois for the time spent  ... 
doi:10.1109/pvgs.1999.810142 fatcat:jjdn4laqxnabta2ahw76zilkbm

Animating radiosity environments through the Multi‐Frame Lighting Method

Gonzalo Besuievsky, Xavier Pueyo
2001 Journal of Visualization and Computer Animation  
This paper presents the Multi-Frame Lighting Method, an efficient algorithm to compute animations in radiosity environments.  ...  Realistic rendering animation is known to be an expensive processing task when physically based global illumination methods are used in order to improve illumination details.  ...  ACKNOWLEDGEMENTS The authors wish to thank all onu-office members for much help in the development of this work.  ... 
doi:10.1002/vis.248.abs fatcat:6hy7xlzpujcbpgpdmfavoalj6q

Animating radiosity environments through the Multi-Frame Lighting Method

Gonzalo Besuievsky, Xavier Pueyo
2001 Journal of Visualization and Computer Animation  
This paper presents the Multi-Frame Lighting Method, an efficient algorithm to compute animations in radiosity environments.  ...  Realistic rendering animation is known to be an expensive processing task when physically based global illumination methods are used in order to improve illumination details.  ...  ACKNOWLEDGEMENTS The authors wish to thank all onu-office members for much help in the development of this work.  ... 
doi:10.1002/vis.248 fatcat:ylziqo3rybbtzlxb3fm3ofzsje

Overlapping multi-processing and graphics hardware acceleration

Xavier Cavin, Laurent Alonso, Jean-Claude Paul
1999 Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics - PVGS '99  
The experiment is based on an implementation of a new parallel wavelet radiosity algorithm. The application is executed on the SGI Origin2000 connected to the SGI InfiniteReality2 rendering pipeline.  ...  In a previous paper [4], we presented an efficient parallelization of a wavelet radiosity algorithm and we pointed out this limitation of parallelism for radiosity-based rendering. ¤  ...  Acknowledgments We would like to thank the Centre Charles Hermite for providing the resources necessary to the experimentations implied by our research work, and especially Alain Filbois for the time spent  ... 
doi:10.1145/328712.319340 fatcat:vxpt6cbubvdole5auyqkxajf5u

Thrifty Final Gather for Radiosity [article]

Annette Scheel, Marc Stamminger, Und Hans-Peter Seidel
2001 Symposium on Rendering  
In this paper an algorithm is presented which significantly speeds up the final gather by exploiting spatial and directional coherence information taken from the radiosity solution.  ...  Senders are classified, so that their contribution to a pixel is either interpolated from the radiosity solution or recomputed with an appropriate number of new samples.  ...  We would also like to thank George Drettakis for fruitful discussions and proofreading and the reviewers for their valuable comments. iMAGIS is a joint project of CNRS/INRIA/UJF/INPG.  ... 
doi:10.2312/egwr/egwr01/001-012 fatcat:vgdplaedpnectdi3cvj4fpslue

Global visibility algorithms for illumination computations

Seth Teller, Pat Hanrahan
1993 Proceedings of the 20th annual conference on Computer graphics and interactive techniques - SIGGRAPH '93  
This paper describes global visibility algorithms that preprocess polygon databases in order to accelerate visibility determination during illumination calculations.  ...  In this paper we describe the algorithms and their implementation, and show that, in a scene with low average visual complexity, they can dramatically accelerate conventional radiosity programs.  ...  Acknowledgments The authors are grateful to David Laur for his assistance with the geometric model and the color plates, and to Dani Lischinski for his valuable comments.  ... 
doi:10.1145/166117.166148 dblp:conf/siggraph/TellerH93 fatcat:lxz43ek7yfea7monytdg3wicu4

An introduction to parallel rendering

Thomas W. Crockett
1997 Parallel Computing  
To provide the necessary levels of performance, parallel computing techniques must be brought to bear.  ...  In computer graphics, rendering is the process by which an abstract description of a scene is converted to an image.  ...  Acknowledgments The author would like to thank Tony Apodaca, Chuck Hansen, Scott Whitman, Craig Wittenbrink, Sam Uselton, and the staff of NASA Langley's Technical Library for their assistance in researching  ... 
doi:10.1016/s0167-8191(97)00028-8 fatcat:xok6klhg7fbpxbqruxvog4hgka
« Previous Showing results 1 — 15 out of 340 results