Filters








162 Hits in 3.6 sec

Tutorial 1 -Advanced Radiosity:Complex Scenes and Glossy Reflections [article]

Marc Stamminger, Daniel Wexler, Wolfram Kresse, Nicolas Holzschuch, Per H. Christensen
1999 Eurographics State of the Art Reports  
The first part of the tutorial course will be given by a pioneer in commercial computer graphics, who will set the stage for the demands of commercial rendering products and assess why radiosity has not  ...  The scope of this tutorial is to describe recent developments in radiosity research that might narrow the gap with commercial applications.  ...  Hierarchical Radiosity and Clustering In [24] a hierarchical approach for solving the radiosity problem was presented.  ... 
doi:10.2312/egt.19991072 fatcat:kb46pg6pdvfctitqfaylkposea

State of the Art in Perceptually Driven Radiosity [article]

J. Prikryl, W. Purgathofer
1998 Eurographics State of the Art Reports  
won't bring any improvements in the image for the human observer.  ...  We will give an overview of known tone-mapping and perceptually-based image comparison techniques that can be used in the scope of the radiosity method to further speed up the computational process.  ...  His main research topic is perceptual approaches to radiosity solutions.  ... 
doi:10.2312/egst.19981023 fatcat:33uk77o34fdzbfnlubepelflci

Fast and accurate hierarchical radiosity using global visibility

Frédo Durand, George Drettakis, Claude Puech
1999 ACM Transactions on Graphics  
Recent hierarchical global illumination algorithms permit the generation of images with a high degree of realism.  ...  We introduce a hierarchy of triangulations which allows the generation of a hierarchical radiosity solution using accurate visibility and meshing.  ...  all their answers about hierarchical radiosity.  ... 
doi:10.1145/318009.318012 fatcat:mrobcgnrojfbrcpdhgjhmdokzq

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.  ...  We discuss the expected benefits of the technique, review the challenges posed by the approach, and propose first solutions for these issues, most notably for the space-time refinement strategy.  ...  In order to build a hierarchical algorithm for space-time radiosity, we define : An adequate data structure to store the values of the radiosity function over spacetime elements, allowing us to compute  ... 
doi:10.1007/978-3-7091-6809-7_21 fatcat:6ulhoiloqrch7mmfulsp6ewg74

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.  ...  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.  ...  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

Interactive Common Illumination for Computer Augmented Reality [chapter]

George Drettakis, Luc Robert, Sylvain Bougnoux
1997 Eurographics  
Novel advances in computer vision are used for camera calibration and user-friendly modeling of the real scene, a recent interactive radiosity update algorithm is adapted to provide fast illumination update  ...  The advent of computer augmented reality (CAR), in which computer generated objects mix with real video images, has resulted in many interesting new application domains.  ...  Acknowledgements Thanks to Céline Loscos and François Sillion for carefully rereading the paper and for many fruitful discussions.  ... 
doi:10.1007/978-3-7091-6858-5_5 fatcat:663uls6wwjfkxetdoclel4562a

Wavelet Radiosity on Arbitrary Planar Surfaces [chapter]

Nicolas Holzschuch, François Cuny, Laurent Alonso
2000 Eurographics  
hierarchical refinement and wavelet computations.  ...  This paper presents an innovative technique enabling wavelet radiosity computations on planar surfaces of arbitrary shape, including concave contours or contours with holes.  ...  The authors would like to thank him for his kind direction, support and encouragements.  ... 
doi:10.1007/978-3-7091-6303-0_15 fatcat:qbaym4xbvvbetbs7ifgbyhtit4

Bounded Radiosity - Illumination on General Surfaces and Clusters

Marc Stamminger, Philipp Slusallek, Hans-Peter Seidel
2008 Computer graphics forum (Print)  
Most algorithms for computing form factors and the subdivision criterion for hierarchical methods implicitly assume planar patches.  ...  Traditionally, Radiosity algorithms have been restricted to scenes made from planar patches.  ...  In this paper, we propose such a general approach for de- ciding about refinement and for computing bounded formfactors for Hierarchical Radiosity with clusters.  ... 
doi:10.1111/1467-8659.16.3conferenceissue.32 fatcat:4dbxmrhrtvhizhhg657bnltxge

Bounded Radiosity - Illumination on General Surfaces and Clusters

Marc Stamminger, Philipp Slusallek, Hans-Peter Seidel
1997 Computer graphics forum (Print)  
Most algorithms for computing form factors and the subdivision criterion for hierarchical methods implicitly assume planar patches.  ...  Traditionally, Radiosity algorithms have been restricted to scenes made from planar patches.  ...  In this paper, we propose such a general approach for de- ciding about refinement and for computing bounded formfactors for Hierarchical Radiosity with clusters.  ... 
doi:10.1111/1467-8659.00168 fatcat:rqjyp3jsyzcx3kjhrolpkgppby

Textures and radiosity

Reid Gershbein, Peter Schröder, Pat Hanrahan
1994 Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94  
We then describe an algorithm that maintains hierarchical representations of both radiosities and textures.  ...  In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm.  ...  Acknowledgments We would like to thank Seth Teller and Celeste Fowler for their contributions to the radiosity testbed which greatly facilitated the research reported in this paper.  ... 
doi:10.1145/192161.192171 dblp:conf/siggraph/GershbeinSH94 fatcat:nygeuhc2ybbbhjbx47yewjsjae

A rapid hierarchical radiosity algorithm

Pat Hanrahan, David Salzman, Larry Aupperle
1991 Proceedings of the 18th annual conference on Computer graphics and interactive techniques - SIGGRAPH '91  
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches.  ...  conjunction with multigrldding, to even more rapidly progressively refine the image.  ...  Acknowledgements The authors wish to thank Andrew Appel, Dan Baum, David Laur, Toby Orloff, Jeffrey Posdarner, and James Winget for helpful comments. Brian Danella and S.V.  ... 
doi:10.1145/122718.122740 dblp:conf/siggraph/HanrahanSA91 fatcat:ynhrf5n5yffbleodn5q6gjd6ca

A clustering algorithm for radiosity in complex environments

Brian Smits, James Arvo, Donald Greenberg
1994 Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94  
We present an approach for accelerating hierarchical radiosity by clustering objects.  ...  In contrast with the O(s 2 ) time and space complexity of the initial linking in previous hierarchical radiosity algorithms, the new methods have complexities of O(s log s) and O(s) for both time and space  ...  Also thanks go to Greg Spencer for his software for handling high dynamic range images.  ... 
doi:10.1145/192161.192277 dblp:conf/siggraph/SmitsAG94 fatcat:plnsqyqxdrga7oork3ehrtpbhm

A rapid hierarchical radiosity algorithm

Pat Hanrahan, David Salzman, Larry Aupperle
1991 Computer graphics  
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches.  ...  conjunction with multigrldding, to even more rapidly progressively refine the image.  ...  Acknowledgements The authors wish to thank Andrew Appel, Dan Baum, David Laur, Toby Orloff, Jeffrey Posdarner, and James Winget for helpful comments. Brian Danella and S.V.  ... 
doi:10.1145/127719.122740 fatcat:sgzpmojl6zdatc3dxp3p5pgepm

Radiosity for Large Vegetation Scenes [article]

Helmut Mastal, Robert F. Tobler, Werner Purgathofer
1999 Eurographics State of the Art Reports  
With the introduction of sophisticated hierarchical and clustering algorithms radiosity for vegetation scenes becomes a solvable challenge.  ...  Calculating radiosity solutions for large scenes containing multiple plants is all but impossible using the radiosity method in its original form.  ...  Introduction Radiosity belongs to the global illumination methods for generating photorealistic images by computer graphics.  ... 
doi:10.2312/egst.19991070 fatcat:kmpy3xvb7jgilm73hzf7lxllpa

Feature-based control of visibility error

Fraņois Sillion, George Drettakis
1995 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95  
multi-gridding approach is introduced for hierarchical radiosity, allowing continuous refinement of a solution in an interactive session.  ...  In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity.  ...  Pat Hanrahan provided parts of the hierarchical radiosity code; Jean-Daniel Boissonnat suggested the use of erosion/expansion operations.  ... 
doi:10.1145/218380.218434 dblp:conf/siggraph/SillionD95 fatcat:str57oux4nhapd6ryokbixmnj4
« Previous Showing results 1 — 15 out of 162 results