01/29/03© 2003 University of Wisconsin Last Time Radiosity.

Slides:



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

SI31 Advanced Computer Graphics AGR
Computer Vision Radiometry. Bahadir K. Gunturk2 Radiometry Radiometry is the part of image formation concerned with the relation among the amounts of.
Computer graphics & visualization Global Illumination Effects.
Radiosity Mel Slater Department of Computer Science University College London
Illumination Models Radiosity Chapter 14 Section 14.7 Some of the material in these slides may have been adapted from University of Virginia, MIT, Colby.
Global Illumination: Radiosity
Radiosity A Fascinating Presentation by Alex Danilevky.
16.1 si31_01 SI31 Advanced Computer Graphics AGR Lecture 16 Radiosity - continued.
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.
Foundations of Computer Graphics (Spring 2010) CS 184, Lecture 21: Radiosity
CSCE 641 Computer Graphics: Radiosity Jinxiang Chai.
1 Dr. Scott Schaefer Radiosity. 2/38 Radiosity 3/38 Radiosity Physically based model for light interaction View independent lighting Accounts for indirect.
CSCE 441 Computer Graphics: Radiosity Jinxiang Chai.
02/14/02(c) University of Wisconsin 2002, CS 559 Last Time Filtering Image size reduction –Take the pixel you need in the output –Map it to the input –Place.
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.
Direct Illumination with Lazy Visibility Evaluation David Hart Philip Dutré Donald P. Greenberg Cornell University SIGGRAPH 99.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Radiosity K. H. Ko School of Mechatronics Gwangju Institute.
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
02/25/05© 2005 University of Wisconsin Last Time Meshing Volume Scattering Radiometry (Adsorption and Emission)
Radiosity 김 성 남. Contents Definition/Goal Basic Radiosity Method Progressive Radiosity Method Mesh substructuring Hierarchical Radiosity Ray.
-Global Illumination Techniques
COLLEGE OF ENGINEERING UNIVERSITY OF PORTO COMPUTER GRAPHICS AND INTERFACES / GRAPHICS SYSTEMS JGB / AAS Global illumination algorithms Graphics.
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.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
02/10/03© 2003 University of Wisconsin Last Time Participating Media Assignment 2 –A solution program now exists, so you can preview what your solution.
Volume radiosity Michal Roušal University of West Bohemia, Plzeň Czech republic.
02/05/03© 2003 University of Wisconsin Last Time Importance Better Form Factors Meshing.
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.
111/17/ :21 Graphics II Global Rendering and Radiosity Session 9.
Radisoity Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts Director, Arts Technology Center University of New.
Radiosity Jian Huang, CS594, Fall 2002 This set of slides reference the text book and slides used at Ohio State.
CPSC 641 Computer Graphics: Radiosity Jinxiang Chai.
04/30/02(c) 2002 University of Wisconsin Last Time Subdivision techniques for modeling We are now all done with modeling, the standard hardware pipeline.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 Surface Rendering Methods 고려대학교 컴퓨터 그래픽스 연구실.
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
Radiosity 1. 2 Introduction Ray tracing best with many highly specular surfaces ­Not real scenes Rendering equation describes general shading problem.
Photo-realistic Rendering and Global Illumination in Computer Graphics Spring 2012 Stochastic Path Tracing Algorithms K. H. Ko School of Mechatronics Gwangju.
Slide 1Lastra, 2/14/2016 Monte-Carlo Methods. Slide 2Lastra, 2/14/2016 Topics Kajiya’s paper –Showed that existing rendering methods are approximations.
CS 445 / 645 Introduction to Computer Graphics Lecture 16 Radiosity Radiosity.
Computer Graphics (Fall 2003) COMS 4160, Lecture 20: Radiosity Ravi Ramamoorthi
01/26/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
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 (3) Path Tracing. Overview Light Transport Notation Path Tracing Photon Mapping.
02/9/05© 2005 University of Wisconsin Last Time Lights Next assignment – Implement Kubelka-Munk as a BSDF.
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.
CS552: Computer Graphics Lecture 33: Illumination and Shading.
EECS 274 Computer Vision Sources, Shadows, and Shading.
© 2002 University of Wisconsin
Jim X. Chen George Mason University
Radiosity Part II Form Factors
CSc4820/6820 Computer Graphics Algorithms Ying Zhu Georgia State University Radiosity.
Computer Graphics (Spring 2003)
© 2003 University of Wisconsin
Radiosity Dr. Scott Schaefer.
CSCE 441 Computer Graphics: Radiosity
© 2003 University of Wisconsin
Problems with Gauss-Seidel
CSc4820/6820 Computer Graphics Algorithms Ying Zhu Georgia State University Lecture 25 Radiosity.
Monte Carlo I Previous lecture Analytical illumination formula
OPTICS III, IV: Global Illumination
Presentation transcript:

01/29/03© 2003 University of Wisconsin Last Time Radiosity

01/29/03© 2003 University of Wisconsin Today Form Factor Computations Progressive Radiosity

01/29/03© 2003 University of Wisconsin Form Factors (recall) The proportion of patch i’s power received by patch j Also a point-patch form: the proportion of the power from a differential area about point x received by j

01/29/03© 2003 University of Wisconsin Form Factor Computations Unoccluded patches: –Direct integration –Conversion to contour integration –Form factor algebra Occluded patches: –Monte Carlo integration –Projection methods Hemisphere Hemicube

01/29/03© 2003 University of Wisconsin Direct Integration Only works for simplest cases For example: Point to a Disc –A point to something form factor is that from a small area, dx, to the patch –Integrating over the points on a patch gets you the patch-patch integral –Note that the point is on the line perpendicular to the disc through the center

01/29/03© 2003 University of Wisconsin Direct Integration – Point-Rect Note that you could get any point- rectangle configuration using the additive property

01/29/03© 2003 University of Wisconsin Direct Integration – Rect-Rect Note that we can do this only under the constant radiosity over patch assumption There is a formula for 2 isolated polygons, but it assumes they can see each other fully!

01/29/03© 2003 University of Wisconsin Contour Integral Use Stokes’ theorem to convert the area integrals into contour integrals For point to polygon form factors, the contour integral is not too hard Care must be taken when r  0

01/29/03© 2003 University of Wisconsin Form Factor Algebra Use the properties of form factors and direct integration to compute new form factors –Additivity –Reciprocity –Point to disc form factors –Rectangle to rectangle form factors Difficult to apply automatically –Useful only in tiny scenes Unoccluded case only

01/29/03© 2003 University of Wisconsin Projection Methods For patches that are far apart compared to their areas, the inner integral in the form factor doesn’t vary much –That is, the form factor is similar from most points on a surface i So, compute point to patch form factors and weigh by area

01/29/03© 2003 University of Wisconsin Nusselt’s Analogy Integrate over visible solid angle instead of visible patch area: F x,P is the fraction of the area of the unit disc in the base plane obtained by projecting the surface patch P onto the unit sphere centered at x and then orthogonally down onto the base plane.

01/29/03© 2003 University of Wisconsin Same Projection – Same Form Factor Any patches with the same projection onto the hemisphere have the same form factor –Makes sense: put yourself at the point and look out – if you see equal amounts, they get equal power It doesn’t matter what you project onto: two patches that project the same have the same form factor

01/29/03© 2003 University of Wisconsin Monte-Carlo Form Factors We can use Monte-Carlo methods to estimate the integral over visible solid angle Simplest method: –Uniformly (in area) sample the disc about the point –Project up onto the hemisphere, then cast a ray out from the point in that direction –Form factor for each patch is the weighted sum of the number of rays that hit the patch There are even better Monte-Carlo methods that we will see later

01/29/03© 2003 University of Wisconsin The Hemicube We have algorithms, and even hardware, for projecting onto planar surfaces The hemicube consists of 5 such faces A “pixel” on the cube has a certain projection, and hence a certain form factor Something that projects onto the pixel has the same form factor

01/29/03© 2003 University of Wisconsin Hemicube, cont. Pretend each face of the hemicube is a screen, and project the world onto it Code each polygon with a color, and count the pixels of each color to determine C(j) Quality depends on hemicube resolution and z-buffer depth

01/29/03© 2003 University of Wisconsin Problems with Gauss-Seidel All the form factors are required before any image can be generated –So you wait a long time to see anything Reducing the number of form factors requires reducing the number of patches, which severely impacts quality We desire a progressive solution, that starts with a rough approximation and refines it –This also opens the possibility of computing some pieces (the bits you can see) before others

01/29/03© 2003 University of Wisconsin Radiosity Eqn to Energy Eqn The radiosity equation is in terms of power per unit area Rewrite this equation in terms of energy values per patch (instead of per unit area) Note that the form factor is now from j to i

01/29/03© 2003 University of Wisconsin Relaxation and Residuals Relaxation methods start with an initial guess,  (0), and perform a sequence of relaxation steps, each resulting in a new  (k) The residual is defined as At each step, relaxation methods zero one element of the residual (e.g. Gauss-Seidel zeros each one in turn) Note the residual is zero when the equation is solved

01/29/03© 2003 University of Wisconsin Southwell Relaxation Southwell relaxation zeros the largest residual at each step We can update the radiosity for the patch i in a single step! But we need to update all the other residuals

01/29/03© 2003 University of Wisconsin Updating Residuals Note that only one component of  changed,  i Hence, we only need one element of K for every j, one row in total Using the definition of residuals

01/29/03© 2003 University of Wisconsin Southwell Summary Each patch has two components: energy,  i k, and undistributed energy, r i k Start with some  i 0 and hence r i 0 At each step k+1: –Choose the i with maximum residual –Update  i k+1 and r i k+1 =0 –Update all the r j k+1

01/29/03© 2003 University of Wisconsin Physical Interpretation Assume that all the initial patch energies are 0 Then the initial residuals are the amounts of energy to be emitted by each patch Each step redistributes the residual according to: Recall, the form factor F ij is the amount of power radiated by i that j receives So, each patch gets its own share of the residual that is shot, according to the form factors

01/29/03© 2003 University of Wisconsin Gathering and Shooting Gauss-Seidel “gathers” radiosity from every patch to a specific patch: Southwell “shoots” energy from one patch onto all the other patches The terms gathering and shooting are used commonly in the literature –Eg “do a final gather” means gather radiosity to the image plane

01/29/03© 2003 University of Wisconsin Progressive Refinement After any number of iterations, an estimate of each patch’s final energy can be obtained by: These intermediate results can be displayed as the algorithm proceeds, giving faster feedback

01/29/03© 2003 University of Wisconsin Typical Equations Typically work in terms of radiosity, which result in equations similar to those from the previous slides Define radiosity and “un-shot” radiosity On each step, find the highest residual: Compute all the form factors out of patch i –Eg With a hemi-cube centered on I Continued…

01/29/03© 2003 University of Wisconsin More Equations Display partial solution by displaying B j

01/29/03© 2003 University of Wisconsin Ambient Correction Progressive radiosity images look dark at first, because shooters hold onto their energy until it’s their turn. An ambient correction can be added to the display only: