Dhiren Bhatia Carnegie Mellon University



Similar documents
Course Overview. CSCI 480 Computer Graphics Lecture 1. Administrative Issues Modeling Animation Rendering OpenGL Programming [Angel Ch.

Computer Graphics Global Illumination (2): Monte-Carlo Ray Tracing and Photon Mapping. Lecture 15 Taku Komura

Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

CSE168 Computer Graphics II, Rendering. Spring 2006 Matthias Zwicker

We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model

An introduction to Global Illumination. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology

Curves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?

Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

Specular reflection. Dielectrics and Distribution in Ray Tracing. Snell s Law. Ray tracing dielectrics

CSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011

(Refer Slide Time: 1:42)

the points are called control points approximating curve

INTRODUCTION TO RENDERING TECHNIQUES

Computer Applications in Textile Engineering. Computer Applications in Textile Engineering

Essential Mathematics for Computer Graphics fast

path tracing computer graphics path tracing 2009 fabio pellacini 1

PHOTON mapping is a practical approach for computing global illumination within complex

COMP175: Computer Graphics. Lecture 1 Introduction and Display Technologies

Rendering Area Sources D.A. Forsyth

Mathematics for Global Illumination

Photon Mapping Made Easy

COMP-557: Fundamentals of Computer Graphics McGill University, Fall 2010

GUI GRAPHICS AND USER INTERFACES. Welcome to GUI! Mechanics. Mihail Gaianu 26/02/2014 1

Introduction to Computer Graphics

Path tracing everything. D.A. Forsyth

A Short Introduction to Computer Graphics

CS 431/636 Advanced Rendering Techniques"

Monte Carlo Path Tracing

Path Tracing. Michael Doggett Department of Computer Science Lund university Michael Doggett

Advanced Computer Graphics. Rendering Equation. Matthias Teschner. Computer Science Department University of Freiburg

The RADIANCE Lighting Simulation and Rendering System

Finite Element Formulation for Plates - Handout 3 -

Lezione 4: Grafica 3D*(II)

PATH TRACING: A NON-BIASED SOLUTION TO THE RENDERING EQUATION

Monte Carlo Path Tracing

Cork Education and Training Board. Programme Module for. 3 Dimensional Computer Graphics. Leading to. Level 5 FETAC

CPIT-285 Computer Graphics

Teaching Introductory Computer Graphics Via Ray Tracing

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur

Introduction to Computer Graphics Marie-Paule Cani & Estelle Duveau

Interactive Computer Graphics

Introduction Week 1, Lecture 1

CUBE-MAP DATA STRUCTURE FOR INTERACTIVE GLOBAL ILLUMINATION COMPUTATION IN DYNAMIC DIFFUSE ENVIRONMENTS

Content. Chapter 4 Functions Basic concepts on real functions 62. Credits 11

Geometric Modelling & Curves

COURSE SYLLABUS Pre-Calculus A/B Last Modified: April 2015

521493S Computer Graphics. Exercise 2 & course schedule change

Birmingham City Schools

3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials

Computer Animation: Art, Science and Criticism

Binary Space Partitions

CS 4620 Practicum Programming Assignment 6 Animation

1 Review of Least Squares Solutions to Overdetermined Systems

How To Draw A 3D Virtual World In 3D Space (Computer Graphics)

GeoGebra. 10 lessons. Gerrit Stols

A Ray Tracing Solution for Diffuse Interreflection

CSE452 Computer Graphics

SAN DIEGO COMMUNITY COLLEGE DISTRICT CITY COLLEGE ASSOCIATE DEGREE COURSE OUTLINE

Curriculum Overview YR 9 MATHS. SUPPORT CORE HIGHER Topics Topics Topics Powers of 10 Powers of 10 Significant figures

Orthogonal Projections

CSCD18: Computer Graphics

Lecture Notes, CEng 477

Computer Animation: Art, Science and Criticism

Degree Reduction of Interval SB Curves

Introduction to Computer Graphics. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012

GAME ENGINE DESIGN. A Practical Approach to Real-Time Computer Graphics. ahhb. DAVID H. EBERLY Geometrie Tools, Inc.

13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant

Section 1.1. Introduction to R n

POLYNOMIAL AND MULTIPLE REGRESSION. Polynomial regression used to fit nonlinear (e.g. curvilinear) data into a least squares linear regression model.

Computer Graphics. Introduction. Computer graphics. What is computer graphics? Yung-Yu Chuang

LAGUARDIA COMMUNITY COLLEGE CITY UNIVERSITY OF NEW YORK DEPARTMENT OF MATHEMATICS, ENGINEERING, AND COMPUTER SCIENCE

UNIVERSITY OF MACAU DEPARTMENT OF COMPUTER AND INFORMATION SCIENCE SFTW 463 Data Visualization Syllabus 1 st Semester 2011/2012 Part A Course Outline

REAL-TIME IMAGE BASED LIGHTING FOR OUTDOOR AUGMENTED REALITY UNDER DYNAMICALLY CHANGING ILLUMINATION CONDITIONS

The Essentials of CAGD

MATH 132: CALCULUS II SYLLABUS

Instructor. Goals. Image Synthesis Examples. Applications. Computer Graphics. Why Study 3D Computer Graphics?

MATHEMATICAL TOOLS FOR ECONOMICS ECON FALL 2011

Exam 1 Sample Question SOLUTIONS. y = 2x

B2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.

Approval Sheet. Interactive Illumination Using Large Sets of Point Lights

How To Make A Texture Map Work Better On A Computer Graphics Card (Or Mac)

Higher Education Math Placement

Hi everyone, my name is Michał Iwanicki. I m an engine programmer at Naughty Dog and this talk is entitled: Lighting technology of The Last of Us,

Math 131 College Algebra Fall 2015

Figure 2.1: Center of mass of four points.

CS 4204 Computer Graphics

Microsoft Mathematics for Educators:

Lecture 9: Geometric map transformations. Cartographic Transformations

Algebra 1 Course Title

42 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x Brief review of Conic Sections

x = + x 2 + x

GRADES 7, 8, AND 9 BIG IDEAS

How To Use Design Mentor

Monash University Clayton s School of Information Technology CSE3313 Computer Graphics Sample Exam Questions 2007

Treasure Hunt. Lecture 2 How does Light Interact with the Environment? EMR Principles and Properties. EMR and Remote Sensing

First Edition, 2012 ISBN All rights reserved.

Gerrit Stols

ENG4BF3 Medical Image Processing. Image Visualization

Pro/ENGINEER Wildfire 4.0 Basic Design

Transcription:

Dhiren Bhatia Carnegie Mellon University

University Course Evaluations available online Please Fill! December 4 : In-class final exam Held during class time All students expected to give final this date Alternate final date: December 16 th :- 10:00 am-11:30 am Must get Prof. Pollard s permission by Dec 2 nd

Project 4 - Due Dec 6 th No late days! Final grade break-down Midterm 15% Final 25% Homework 20% Projects P1: 7% P2: 10% P3: 15% P4: 8%

Closed book No cheat sheet Everything covered so far in the semester Review HWs and Lecture Reviews

Explicit: y=f(x), y=mx+c Implicit: f(x,y)=0, x 2 +y 2 =r 2 Parametric: (x,y)=(f(u), g(u)) (x,y)=(cos(u),sin(u))

An n-th degree polynomial fits a curve to n+1 points Cons: Change to any control point affects the entire curve

A spline is a piecewise polynomial many low degree polynomials are used to interpolate the control points Most common: Cubic piecewise polynomials

C 0, C 1 continuity: C 0 continuity: Continuous in positions C 1 continuity: Continuous in positions and tangent vectors (first differential)

Each P and C k is a column vector From control information (points or tangents) Goal to determine cubic polynomial form

Hermite: Two points on the curve and two tangents Bezier: Two points on the curve and two points outside of the curve

Linear Transformations T(v 1 +v 2 )=T(v 1 )+T(v 2 ) T(αv)=αT(v) Rotation Scaling Translation

Key Idea: [outgoing]=[emitted]+[reflected]+[transmitted] Don t forget how to connect this with Radiosity equation

ρ(p,ω,ω 0,λ) in the rendering equation is the BRDF, which gives the reflectance of a target as a function of illumination geometry and viewing geometry.

Local rendering models Object illuminations are independent No light scattering between objects No real shadows, reflection, transmission Global rendering models Ray tracing (highlights, reflection, transmission) Radiosity (surface interreflections)

Local Illumination model Sum of three components: Diffuse reflection + Specular reflection + Ambient term

Graphics pipeline: for each object, render (online) Ray tracing: for each pixel, determine color (off-line) Radiosity: for each two surface patches, determine diffuse interreflections (off-line)

Forward ray tracing follows the photon in direction that light travels from the source Con: Only a tiny fraction of rays actually reach the image

Backward ray tracing starts the image and follow the ray until the ray finds (or fails to find) a light source

Eye rays: originate at the eye Shadow rays: from surface point to the light source Reflection rays: from surface point in mirror direction Transmission rays: from surface point in refracted direction

n 1 is the refractive index of the first material n 2 is the refractive index of the second material Key Idea: The ratio of the sinusoids of the angles of incidence and of refraction is a constant depending on the media n 1 sin(θ 1 )=n 2 sin(θ 2 )

Ray-Sphere intersection Ray-Polygon intersection Ray-Quadric intersection

Good data structures greatly speed up ray tracing Up to 10x or even 100x! You need to know: Hierarchical bounding volumes Grids Octrees K-d trees and BSP trees

Wrap complex objects in simple ones Does ray intersect with the bounding box? Yes: Calculate intersection with enclosed objects No: Does not intersect enclosed objects Effectiveness depends on: Probability that ray hits bounding volume, but not enclosed objects Expense to calculate intersections with bounding volume and enclosed objects

Quadtree is the 2-D generalization of binary trees Node is a square Recursively split into four equal sub-squares Octree is 3-D analog of Quadtree

K-Dimensional (K-D tree) Split only one dimension at a time along the coordinate axis Binary Space Partitioning (BSP) tree Permits splits with any line In 2-D space split with lines 3-D space split with places K-D space split with k-1 dimensional hyperplanes

Both are global illumination compared with the Phong model (local illumination) Ray Tracing: Realistic specular reflection/transmission Radiosity: Realistic diffuse reflection Know the differences

Unknown: radiosity B i Known: emission E i, form factor F ij, reflectivity R i Know how to calculate form factor Know the matrix formulation to solve equation

Photon mapping First pass: construction of the photon map Second pass: rendering equation is used to estimate the radiance of every pixel.

Overview not comprehensive! Must study all the material outside these notes Good luck for finals week!