Radiosity. Johns Hopkins Department of Computer Science Course : Rendering Techniques, Professor: Jonathan Cohen

Similar documents
CS770/870 Spring 2017 Radiosity

The Rendering Equation & Monte Carlo Ray Tracing

CS770/870 Spring 2017 Radiosity

Lightscape A Tool for Design, Analysis and Presentation. Architecture Integrated Building Systems

CS 428: Fall Introduction to. Radiosity. Andrew Nealen, Rutgers, /7/2009 1

Introduction to Radiosity

Local vs. Global Illumination & Radiosity

Fast Texture Based Form Factor Calculations for Radiosity using Graphics Hardware

Anti-aliasing. Images and Aliasing

Radiosity. Early Radiosity. Page 1

Global Illumination and Radiosity

Today. Anti-aliasing Surface Parametrization Soft Shadows Global Illumination. Exercise 2. Path Tracing Radiosity

in order to apply the depth buffer operations.

Computer Graphics. Lecture 14 Bump-mapping, Global Illumination (1)

A Survey of Radiosity and Ray-tracing. Methods in Global Illumination

Interactive Rendering of Globally Illuminated Glossy Scenes

Global Illumination CS334. Daniel G. Aliaga Department of Computer Science Purdue University

Core ideas: Neumann series

Schedule. MIT Monte-Carlo Ray Tracing. Radiosity. Review of last week? Limitations of radiosity. Radiosity

COMP3421. Global Lighting Part 2: Radiosity

S U N G - E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T

MIT Monte-Carlo Ray Tracing. MIT EECS 6.837, Cutler and Durand 1

Advanced Computer Graphics CS 563: Screen Space GI Techniques: Real Time

Computer Graphics I Lecture 11

Computer Graphics Global Illumination

Reflection and Shading

CS354R: Computer Game Technology

Mathematical Tools in Computer Graphics with C# Implementations Table of Contents

Shape modeling Modeling technique Shape representation! 3D Graphics Modeling Techniques

Illumination models: Radiosity analysis

Global Illumination with Glossy Surfaces

Computer Graphics. Lecture 10. Global Illumination 1: Ray Tracing and Radiosity. Taku Komura 12/03/15

A Brief Overview of. Global Illumination. Thomas Larsson, Afshin Ameri Mälardalen University

Raytracing & Epsilon. Today. Last Time? Forward Ray Tracing. Does Ray Tracing Simulate Physics? Local Illumination

Efficient Rendering of Radiosity using Textures and Bicubic Reconstruction

Dynamic Ambient Occlusion and Indirect Lighting. Michael Bunnell NVIDIA Corporation

Introduction to Radiosity

Illumination and Geometry Techniques. Karljohan Lundin Palmerius

Soft Shadows: Heckbert & Herf. Soft shadows. Heckbert & Herf Soft Shadows. Cornell University CS 569: Interactive Computer Graphics.

CS-184: Computer Graphics. Today. Lecture #16: Global Illumination. Sunday, November 8, 2009

Computer Graphics Shadow Algorithms

The Design and Implementation of a Radiosity Renderer. Alexandru Telea

REYES REYES REYES. Goals of REYES. REYES Design Principles

CPSC GLOBAL ILLUMINATION

CHAPTER 1 Graphics Systems and Models 3

COM337 COMPUTER GRAPHICS Other Topics

Mesh Repairing and Simplification. Gianpaolo Palma

GLOBAL ILLUMINATION. Christopher Peters INTRODUCTION TO COMPUTER GRAPHICS AND INTERACTION

Global Illumination. Why Global Illumination. Pros/Cons and Applications. What s Global Illumination

Visualisatie BMT. Rendering. Arjan Kok

CMSC427 Advanced shading getting global illumination by local methods. Credit: slides Prof. Zwicker

Advanced Computer Graphics

Introduction to Computer Graphics

Advanced Graphics. Global Illumination. Alex Benton, University of Cambridge Supported in part by Google UK, Ltd

Computer Graphics. Lecture 13. Global Illumination 1: Ray Tracing and Radiosity. Taku Komura

A Framework for Global Illumination in Animated Environments

Stencil Shadow Volumes

Parallel Visibility Computations for Parallel Radiosity W. Sturzlinger and C. Wild Institute for Computer Science, Johannes Kepler University of Linz,

3/1/2010. Acceleration Techniques V1.2. Goals. Overview. Based on slides from Celine Loscos (v1.0)

Consider a partially transparent object that is illuminated with two lights, one visible from each side of the object. Start with a ray from the eye

Global Illumination The Game of Light Transport. Jian Huang

Improved Radiance Gradient Computation

Recollection. Models Pixels. Model transformation Viewport transformation Clipping Rasterization Texturing + Lights & shadows

3D Modeling techniques

Rendering and Radiosity. Introduction to Design Media Lecture 4 John Lee

6. Illumination, Lighting

Photorealism vs. Non-Photorealism in Computer Graphics

Global Illumination and the Rendering Equation

Some Thoughts on Visibility

Computer Graphics Global Illumination

Segmentation and Tracking of Partial Planar Templates

Global Illumination. CMPT 361 Introduction to Computer Graphics Torsten Möller. Machiraju/Zhang/Möller

Re-rendering from a Dense/Sparse Set of Images

Illumination Algorithms

Lecture 15: Many Lights. CS 6620, Spring 2009 Kavita Bala Computer Science Cornell University. Many Lights

Advanced Computer Graphics CS 563: Making Imperfect Shadow Maps View Adaptive. Frederik Clinck lie

Global Illumination. COMP 575/770 Spring 2013

A NEW APPROACH OF DENSITY ESTIMATION FOR GLOBAL ILLUMINATION

Point based global illumination is now a standard tool for film quality renderers. Since it started out as a real time technique it is only natural

Introduction to Computer Graphics

Lightcuts: A Scalable Approach to Illumination

Wednesday, 26 January 2005, 14:OO - 17:OO h.

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662

Principles of Computer Graphics. Lecture 3 1

6.837 Introduction to Computer Graphics Quiz 2 Thursday November 20, :40-4pm One hand-written sheet of notes allowed

Photorealism. Ray Tracing Texture Mapping Radiosity

Accelerated Ambient Occlusion Using Spatial Subdivision Structures

Rendering Light Reflection Models

Shading Languages. Seminar Computer Graphics. Markus Kummerer

Level of Details in Computer Rendering

Real-Time Shadows. Last Time? Textures can Alias. Schedule. Questions? Quiz 1: Tuesday October 26 th, in class (1 week from today!

Subdivision Surfaces. Course Syllabus. Course Syllabus. Modeling. Equivalence of Representations. 3D Object Representations

3D Modeling: Surfaces

Global Rendering. Ingela Nyström 1. Effects needed for realism. The Rendering Equation. Local vs global rendering. Light-material interaction

Curves & Surfaces. Last Time? Progressive Meshes. Selective Refinement. Adjacency Data Structures. Mesh Simplification. Mesh Simplification

Interactive Radiosity Using Mipmapped Texture Hardware

Implicit Surfaces & Solid Representations COS 426

Know it. Control points. B Spline surfaces. Implicit surfaces

Near-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces

Volume Rendering - Introduction. Markus Hadwiger Visual Computing Center King Abdullah University of Science and Technology

Transcription:

Radiosity

Radiosity Concept Global computation of diffuse interreflections among scene objects Diffuse lighting changes fairly slowly across a surface Break surfaces up into some number of patches Assume diffuse illumination constant across each patch Diffuse reflection independent of viewing direction Interactive rendering possible

Cornell Box from Sillion and Puech, Radiosity & Global Illumi- nation, 1994.

Steel Mill (55,000 elements) from Watt and Watt, Advanced Animation and Rendering Tech- niques,, 1992.

Radiosity - fundamentals Radiosity: energy per unit area leaving a surface patch per unit time Radiosity x area = emitted energy + reflected energy B i da = E i da i + R i j B j F ji da j Radiosity will be color of rendered surface total energy generated by rendering some number of pixels

Form Factor Describes geometric relationship between two surface patches F ij = energy leaving A i that strikes A j directly energy leaving A i over entire hemisphere Σ i F ij = 1 for all j F ii = 0 for planar patches Reciprocity relationship: F ij da i = F ji da j

Form Factor Diagram from Watt, 3D Computer Graphics, 1993. F ij = 1/A i A i Aj cosφ i cosφ j /(πr2 ) da j da i

Differential-Finite Area Form Factor F = dai A j A cosφ j i cosφ j /(πr 2 ) da j Form factor between da i and A j Position da i at center of A i and assume result is valid for entire patch reasonable when r is large with respect to areas Now reasonable to consider projection of patch rather than patch itself...

Patch Projections All three representations have the same form factor A: patch itself B: patch on hemicube C: patch on hemisphere from Watt, 3D Computer Graphics, 1993.

Hemicube Illustration from Watt, 3D Computer Graphics, 1993.

Hemicube Form Factor Method For each patch, i For each patch, j Render patches into item buffer for each hemicube face (with Z-buffering) For each hemicube pixel Look up pixel form factor Accumulate into form factor for appropriate patch pair (i,j)

Radiosity Computation Compute form factors Solve NxN matrix equation B i = E i + R i Σ j B j F ij 1 - R 1 F 11 -R 1 F 12 -R 1 F 1n B 1 E 1 -R 2 F 21 1-R 2 F 22 -R 2 F 2n B 2 E 2 = -R n F n1 -R n F n2 1-R n F nn B n E n

Gathering Method of Radiosity Computation Compute form factors Solve matrix equation using Gauss-Seidel iteration Solve for one patch radiosity at a time Plug solution into matrix for solutions to future radiosities Iterate until it converges

Shooting Method of Radiosity Computation At each iteration, emit from one patch to all other patches Useful for progressive radiosity Possibly add ambient when viewing preliminary results Order the patch emissions by magnitude of energy to be emitted

Shooting Example from Sillion and Puech, Radiosity & Global Illumi- nation, 1994.

Shooting + Ambient Example from Sillion and Puech, Radiosity & Global Illumi- nation, 1994.

Creating Patches from Polygons Uniform subdivision (pre-process) Regular subdivision (on-line) Irregular subdivision (on-line)

Uniform Subdivision Subdivide polygons with regular grid before any radiosity computation Set some threshold to determine level of subdivision number of patches per polygon maximum patch size Doesn t provide much control in error of form factor or radiosity computation

Regular Subdivision Begin with coarse (or no) uniform subdivision of polygons After computing radiosities,, measure gradient between adjacent patches (using differences) Subdivide patches with high gradient Incrementally update radiosity solution

Reducing Subpatch Computations Initialize subpatch radiosities from patch radiosity Compute only subpatch-patch form factors not patch-subpatch form factors not subpatch-subpatch form factors Subdivision effectively increases matrix from NxN to MxN (but not MxM)

Hierarchical Radiosity Apply regular subdivision to patches that require refinement For each patch-patch interaction, use an appropriate level of subdivision Can be implemented using matrix block operations portions of matrix are computed as block bounds on computational error used to determine which computations may be grouped

Irregular Subdivision (Discontinuity Meshing) Subdivide patches along discontinuities, rather than regular subdivision Discontinuities 0 order: contacts between surfaces 1st, 2nd order: changes in visibility Requires less refinement along discontinuities than regular subdivision Typically try to subdivide so most patch elements completely visible or invisible

Discontinuity Mesh Examples From Lischinski et al., Combining Hierarchical Radiosity and Discontinuity Meshing, Proceedings of SIGGRAPH 93.

Discontinuity vs. Regular Subdivision From Lischinski et al., Combining Hierarchical Radiosity and Discontinuity Meshing, Proceedings of SIGGRAPH 93.

Other Topics of Interest Combining effects of initial polygons Using non-constant patch radiosities Rendering polygons with higher-order color interpolation Radiosity as textures

Combining Polygon Contributions For polygonal curved surfaces, simplification allows hierarchical representation Possibly combine light contributions through volumes of space

Non-constant Patch Radiosities Require fewer patches by allowing radiance to vary across a patch from Zatz,, Galerkin Radiosity, Proceedings of SIGGRAPH 93.

Higher-order Color Interpolation Using higher-order color interpolation decreases number of polygons rendered Higher-order color interpolated polygons take longer to render Determine optimum mode for rendering each patch based on number of polygons and rendering cost Explored on Pixel-Planes 5 hardware ~1995

Radiosity as Textures Accurate radiosity dramatically increases polygon count Extra geometry is redundant All new information is about colors Create textures for new color information and use original geometry Like higher-order interpolation, texture- mapping is more expensive than color interpolation, so optimize cost/benefit

Radiosity as Textures Resampling from Bastos et al., Efficient Radiosity Rendering using Textures and Bicubic Reconstruction, Proceedings of the 1997 Symposium on Interactive 3D Graphics.

Video Bastos, Rui.. Michael Goslin,, and Hansong Zhang. Efficient Radiosity Rendering using Textures and Bicubic Reconstruction. Proceedings of the 1997 Symposium on Interactive 3D Graphics.