© 2003 University of Wisconsin

Slides:



Advertisements
Similar presentations
1GR2-00 GR2 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
Advertisements

An Efficient Progressive Refinement Strategy for Hierarchical Radiosity Nicolas Holzschuch, François Sillion and George Drettakis iMAGIS/IMAG, Grenoble.
Computer graphics & visualization Global Illumination Effects.
Presented by Konstantinos Georgiadis. Abstract This method extends the Hierarchical Radiosity approach for environments whose geometry and surface attributes.
Radiosity Mel Slater Department of Computer Science University College London
Radiosity A Fascinating Presentation by Alex Danilevky.
16.1 si31_01 SI31 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
Computer Modelling Of Fallen Snow Paul Fearing University of British Columbia Vancouver, Canada.
1 7M836 Animation & Rendering Global illumination, radiosity Arjan Kok
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
Recent Advances in Radiosity Philippe Bekaert Department of Computer Science K.U.Leuven.
The Radiosity Method Donald Fong February 10, 2004.
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
CSCE 441 Computer Graphics: Radiosity Jinxiang Chai.
CSE 872 Dr. Charles B. Owen Advanced Computer Graphics1 Radiosity What we can do with scan line conversion and ray tracing What we can’t do Radiosity.
Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Radiosity K. H. Ko School of Mechatronics Gwangju Institute.
COMPUTER GRAPHICS CS 482 – FALL 2014 AUGUST 27, 2014 FIXED-FUNCTION 3D GRAPHICS MESH SPECIFICATION LIGHTING SPECIFICATION REFLECTION SHADING HIERARCHICAL.
Today More raytracing stuff –Soft shadows and anti-aliasing More rendering methods –The text book is good on this –I’ll be using images from the CDROM.
Radiosity 김 성 남. Contents Definition/Goal Basic Radiosity Method Progressive Radiosity Method Mesh substructuring Hierarchical Radiosity Ray.
-Global Illumination Techniques
01/29/03© 2003 University of Wisconsin Last Time Radiosity.
David Luebke 1 10/12/2015 CS 551/651: Advanced Computer Graphics Advanced Ray Tracing Radiosity.
02/16/05© 2005 University of Wisconsin Last Time Re-using paths –Irradiance Caching –Photon Mapping.
CS447/ Realistic Rendering -- Radiosity Methods-- Introduction to 2D and 3D Computer Graphics.
02/18/05© 2005 University of Wisconsin Last Time Radiosity –Converting the LTE into the radiosity equation –Solving with Gauss-Seidel relaxation –Form.
Volume radiosity Michal Roušal University of West Bohemia, Plzeň Czech republic.
Global Illumination CMSC 435/634. Global Illumination Local Illumination – light – surface – eye – Throw everything else into ambient Global Illumination.
1 Implicit Visibility and Antiradiance for Interactive Global Illumination Carsten Dachsbacher 1, Marc Stamminger 2, George Drettakis 1, Frédo Durand 3.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Radiosity K. H. Ko School of Mechatronics Gwangju Institute.
Graphics Lecture 13: Slide 1 Interactive Computer Graphics Lecture 13: Radiosity - Principles.
Introduction to Radiosity Geometry Group Discussion Session Jiajian (John) Chen 9/10/2007.
111/17/ :21 Graphics II Global Rendering and Radiosity Session 9.
Radiosity Jian Huang, CS594, Fall 2002 This set of slides reference the text book and slides used at Ohio State.
Global Illumination: Radiosity, Photon Mapping & Path Tracing Rama Hoetzlein, 2009 Lecture Notes Cornell University.
University of Montreal & iMAGIS A Light Hierarchy for Fast Rendering of Scenes with Many Lights E. Paquette, P. Poulin, and G. Drettakis.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 Surface Rendering Methods 고려대학교 컴퓨터 그래픽스 연구실.
Pure Path Tracing: the Good and the Bad Path tracing concentrates on important paths only –Those that hit the eye –Those from bright emitters/reflectors.
Radiosity 1. 2 Introduction Ray tracing best with many highly specular surfaces ­Not real scenes Rendering equation describes general shading problem.
04/18/02(c) 2002 University of Wisconsin Last Time Hermite Curves Bezier Curves.
Domain decomposition in parallel computing Ashok Srinivasan Florida State University.
CS 445 / 645 Introduction to Computer Graphics Lecture 16 Radiosity Radiosity.
Fast Global Illumination Including Specular Effects Xavier Granier 1 George Drettakis 1 Bruce J. Walter 2 1 iMAGIS -GRAVIR/IMAG-INRIA iMAGIS is a joint.
Controlling Memory Consumption of Hierarchical Radiosity with Clustering iMAGIS -GRAVIR/IMAG-INRIA iMAGIS is a joint project of CNRS/INRIA/UJF/INPG Xavier.
Global Illumination (2) Radiosity (3). Classic Radiosity Algorithm Mesh Surfaces into Elements Compute Form Factors Between Elements Solve Linear System.
02/07/03© 2003 University of Wisconsin Last Time Finite element approach Two-pass approaches.
Global Illumination (2) Radiosity (2). The Radiosity Equation The "radiosity equation" describes the amount of energy which can be emitted from a surface,
01/27/03© 2002 University of Wisconsin Last Time Radiometry A lot of confusion about Irradiance and BRDFs –Clarrified (I hope) today Radiance.
Graphics Lecture 14: Slide 1 Interactive Computer Graphics Lecture 14: Radiosity - Computational Issues.
02/23/05© 2005 University of Wisconsin Last Time Radiosity –Progressive Radiosity –Assorted optimizations.
Machine Vision ENT 273 Lecture 4 Hema C.R.
POSTPROCESSING Review analysis results and evaluate the performance
Radisoity Ed Angel Professor Emeritus of Computer Science
Global Illumination: Radiosity, Photon Mapping & Path Tracing
CS475 3D Game Development Level Of Detail Nodes (LOD)
Mean Shift Segmentation
Convolutional Networks
© 2005 University of Wisconsin
(c) 2002 University of Wisconsin
Radiosity Part II Form Factors
CSc4820/6820 Computer Graphics Algorithms Ying Zhu Georgia State University Radiosity.
POSTPROCESSING Review analysis results and evaluate the performance
© 2003 University of Wisconsin
CSCE 441 Computer Graphics: Radiosity
UMBC Graphics for Games
(c) 2002 University of Wisconsin
Problems with Gauss-Seidel
Capabilities of Threshold Neurons
Radiosity Sung-Eui Yoon (윤성의) CS580: Course URL:
Advanced Computer Graphics: Radiosity
Presentation transcript:

© 2003 University of Wisconsin Last Time Form Factors Progressive Radiosity 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Today Sub-structuring Adaptive Meshing Hierarchical Radiosity Importance 01/31/03 © 2003 University of Wisconsin

The Effect of Patch Size There is a trade-off in patch size: large patches give faster solution, small patches give better results Doubling the patch resolution increases computation by 16x 4x in each patch, but N2 computation, so 16x Effect of large patches is most obvious in receiving: patch size indicates largest resolvable illumination feature Particularly important in what case? Large patches are not so bad for emitting What impact will large vs. small patches have? 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Substructuring Best of both worlds (almost): Break each patch into smaller elements for the purposes of receiving energy Use original, large patches for shooting Divide each patch, Pi into mi elements, denoted pq for 1q<mi. Radiosity for element pq is: Element radiosity Element emission Element-patch form factor Patch radiosity 01/31/03 © 2003 University of Wisconsin

Substructuring (more) Patch radiosity is area weighted radiosity of elements: Substituting, and assuming elements of a patch have equal exitance and reflectance: Like solving without elements, but using area averaged form factor 01/31/03 © 2003 University of Wisconsin

Solution Structure (Gathering) Find element to patch form factors (MN) of them Use same old form factor methods Combine to form patch to patch form factors (NN) of them, using area weighted average on previous slide Solve for patch radiosities No worse than regular Gauss-Seidel Compute element radiosities A final gather step to the elements The result is not the same as solving with elements, but close 01/31/03 © 2003 University of Wisconsin

Substructuring and Progressive Refinement Can do progressive refinement with substructuring Shoot energy from patches to elements Maintain radiosities and residuals for each element, average for patches But, form factor computations are poor, because the form factor from a large patch to a small element is needed Bad aliasing with hemi-cube Leads to visible errors in images. What might these look like? 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Automated Meshing The patch and element resolution should be decided based on the complexity of the illumination situation It is unreasonable to expect a user to know what is required – they are, after all, using the software to find a solution Automated meshing strategies are desired 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Adaptive Subdivision Instead of fixing the elements and patches, allow elements to be subdivided based on how the solution proceeds After each Gauss-Seidel step: Estimate the radiosity gradient Break elements that appear to have high gradients Do a new gather to each of the smaller elements Keep breaking until no big gradients Do the next iteration of Gauss-Seidel Multiple ways to estimate gradient Cheap: Compare your radiosity to your neighbors More expensive: Push radiosities to vertices (area weighted average) and use difference across element 01/31/03 © 2003 University of Wisconsin

Adaptive and Progressive Choose to subdivide after each shot Subdivision decision can be based on the gradient with respect to the shooting patch Not all shooting patches require the same subdivision For instance, lights in different places cast different shadows Can re-compute subdivision for each shot Distribute radiosity gathered at one resolution to that gathered at another But we can do better… 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Which Resolution? Should P be bigger or smaller for each receiving patch? What influences the decision? 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Hierarchical Meshing Use different resolution depending on who is emitting and who is receiving Build hierarchy of elements for each patch Record interactions between elements at appropriate levels Essentially replaces blocks in the form factor matrix with average values 01/31/03 © 2003 University of Wisconsin

Building the Hierarchy Start with “top level” patches Estimate the error incurred by each patch-patch transfer. Use: Form factor estimate: Radiosity  Form factor Importance (more later) If error too large, break one element and recurse But only recurse for this transfer – don’t re-compute all transfers Like starting with finest resolution, and averaging blocks in the form factor matrix 01/31/03 © 2003 University of Wisconsin

Hierarchical Solution For each Gauss-Seidel iteration Gather energy to a patch along all the links Update radiosity values for each node in the patch hierarchy Push radiosity down from parents to children – no area weighting Pull radiosity up from children to parents – area weighted Cost proportional to number of links, which is O(N) where N is number of leaves 01/31/03 © 2003 University of Wisconsin

Brightness-weighted refinement Subdivide based on an estimate of energy transferred Need radiosity estimates, which we don’t know beforehand: Start with high error threshold, and get approximate solution Refine hierarchy using radiosity estimates Repeat with successively lower thresholds Also called multi-grid methods 01/31/03 © 2003 University of Wisconsin

Computing Form Factors Only need form factors for each link Hemicube does more work than necessary, because all elements must be projected for all other elements Use patch-patch computations (more later) Also can give occlusion estimates for better form-factor estimates Error control More and more subdivision not necessarily good, because errors accumulate in push-pull, and element boundaries can cause artifacts 01/31/03 © 2003 University of Wisconsin

© 2003 University of Wisconsin Importance For a single image, only the visible surfaces are directly important Don’t care what’s “down the hall” Surfaces illuminating visible surfaces are also important, and other surfaces illuminating those surfaces… Importance propagates backwards from the “primary” sources of importance Visible surfaces are typically prime sources of importance 01/31/03 © 2003 University of Wisconsin

Solving for Importance Ri is the inherent importance of a given element When radiosity is gathered, importance is shot Use BIF as error estimate in determining subdivision Combine with multi-grid method Note: must use different push-pull operations for importance Push down area-weighted, pull up non-weighted 01/31/03 © 2003 University of Wisconsin