CS559 Computer Graphics Fall 2015

Similar documents
Spring 2012 Final. CS184 - Foundations of Computer Graphics. University of California at Berkeley

Photorealism: Ray Tracing

Topic 12: Texture Mapping. Motivation Sources of texture Texture coordinates Bump mapping, mip-mapping & env mapping

Introduction Ray tracing basics Advanced topics (shading) Advanced topics (geometry) Graphics 2010/2011, 4th quarter. Lecture 11: Ray tracing

Topic 11: Texture Mapping 11/13/2017. Texture sources: Solid textures. Texture sources: Synthesized

Homework #2. Hidden Surfaces, Projections, Shading and Texture, Ray Tracing, and Parametric Curves

CS 428: Fall Introduction to. Raytracing. Andrew Nealen, Rutgers, /18/2009 1

Topic 11: Texture Mapping 10/21/2015. Photographs. Solid textures. Procedural

Ray Tracing. Kjetil Babington

Topics and things to know about them:

Computer Graphics. Si Lu. Fall uter_graphics.htm 11/22/2017

CS354 Computer Graphics Ray Tracing. Qixing Huang Januray 24th 2017

CS559 Computer Graphics Fall 2015

CS 130 Final. Fall 2015

Problem Max. Points Total 80

Ray tracing. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd 3/19/07 1

INFOGR Computer Graphics. J. Bikker - April-July Lecture 10: Ground Truth. Welcome!

The University of Calgary

03 Vector Graphics. Multimedia Systems. 2D and 3D Graphics, Transformations

CS 325 Computer Graphics

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

CSE 167: Introduction to Computer Graphics Lecture #13: Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2017

Sung-Eui Yoon ( 윤성의 )

Intro to Ray-Tracing & Ray-Surface Acceleration

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

Homework #2. Shading, Ray Tracing, and Texture Mapping

CS 4620 Final Exam. (a) Is a circle C 0 continuous?

EECS 487, Fall 2005 Exam 2

Computer Graphics I Lecture 11

Computer Graphics CS 543 Lecture 13a Curves, Tesselation/Geometry Shaders & Level of Detail

Curves. Computer Graphics CSE 167 Lecture 11

CSE 167: Introduction to Computer Graphics Lecture 12: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2013

Announcements. Written Assignment 2 out (due March 8) Computer Graphics

CPSC / Texture Mapping

Lecture 11: Ray tracing (cont.)

CEng 477 Introduction to Computer Graphics Fall 2007

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016

Ray Tracing. Foley & Van Dam, Chapters 15 and 16

Ray Tracing Foley & Van Dam, Chapters 15 and 16

SUMMARY. CS380: Introduction to Computer Graphics Ray tracing Chapter 20. Min H. Kim KAIST School of Computing 18/05/29. Modeling

CS Computer Graphics: Introduction to Ray Tracing

CS Computer Graphics: Introduction to Ray Tracing

Computer Graphics Ray Casting. Matthias Teschner

Rendering: Reality. Eye acts as pinhole camera. Photons from light hit objects

End-Term Examination

CSE 167: Introduction to Computer Graphics Lecture #11: Bezier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2016

Distributed Ray Tracing

Rendering Curves and Surfaces. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico

CS 4620 Midterm, March 21, 2017

Supplement to Lecture 16

Computer Graphics Curves and Surfaces. Matthias Teschner

Ray Tracing. CS334 Fall Daniel G. Aliaga Department of Computer Science Purdue University

So far, we have considered only local models of illumination; they only account for incident light coming directly from the light sources.

For each question, indicate whether the statement is true or false by circling T or F, respectively.

Welcome to COMP 770 (236) Introduction. Prerequisites. Prerequisites

Computergrafik. Matthias Zwicker. Herbst 2010

521493S Computer Graphics. Exercise 3

Photorealism. Photorealism: Ray Tracing. Ray Tracing

EF432. Introduction to spagetti and meatballs

Review. Stephen J. Guy

Rendering. Converting a 3D scene to a 2D image. Camera. Light. Rendering. View Plane

Ray Tracing. CSCI 420 Computer Graphics Lecture 15. Ray Casting Shadow Rays Reflection and Transmission [Ch ]

Homework #2. Shading, Projections, Texture Mapping, Ray Tracing, and Bezier Curves

Central issues in modelling

Computer Graphics. Ray Tracing. Based on slides by Dianna Xu, Bryn Mawr College

COM337 COMPUTER GRAPHICS Other Topics

CS770/870 Spring 2017 Animation Basics

CS770/870 Spring 2017 Animation Basics

TDA362/DIT223 Computer Graphics EXAM (Same exam for both CTH- and GU students)

CS 563 Advanced Topics in Computer Graphics Camera Models. by Kevin Kardian

Lecture IV Bézier Curves

COMP371 COMPUTER GRAPHICS

Ray Tracing. Brian Curless CSEP 557 Fall 2016

COMP3421. Global Lighting Part 2: Radiosity

Computer Graphics. Lecture 9 Environment mapping, Mirroring

Final Exam CS 184: Foundations of Computer Graphics page 1 of 14 Fall 2016 Prof. James O Brien

CS 130 Exam I. Fall 2015

Raytracing CS148 AS3. Due :59pm PDT

Assignment 6: Ray Tracing

CSE528 Computer Graphics: Theory, Algorithms, and Applications

Graphics for VEs. Ruth Aylett

CMSC 435/634: Introduction to Graphics

CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK

Topic 0. Introduction: What Is Computer Graphics? CSC 418/2504: Computer Graphics EF432. Today s Topics. What is Computer Graphics?

CSE 167: Introduction to Computer Graphics Lecture #6: Lights. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2014

Lecture 17: Recursive Ray Tracing. Where is the way where light dwelleth? Job 38:19

Chapter 7 - Light, Materials, Appearance

Introduction to Computer Graphics

The exam begins at 5:10pm and ends at 8:00pm. You must turn your exam in when time is announced or risk not having it accepted.

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

Outline. Properties of Piecewise Linear Interpolations. The de Casteljau Algorithm. Recall: Linear Interpolation

Rendering Part I (Basics & Ray tracing) Lecture 25 December 1, 2015

Lighting. To do. Course Outline. This Lecture. Continue to work on ray programming assignment Start thinking about final project

Final Exam CS 184: Foundations of Computer Graphics! page 1 of 12!

Midterm Exam Fundamentals of Computer Graphics (COMP 557) Thurs. Feb. 19, 2015 Professor Michael Langer

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

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Curves and Curved Surfaces. Adapted by FFL from CSE167: Computer Graphics Instructor: Ronen Barzel UCSD, Winter 2006

Global Illumination. COMP 575/770 Spring 2013

Computer Graphics 1. Chapter 7 (June 17th, 2010, 2-4pm): Shading and rendering. LMU München Medieninformatik Andreas Butz Computergraphik 1 SS2010

Transcription:

CS559 Computer Graphics Fall 2015 Practice Final Exam Time: 2 hrs 1. [XX Y Y % = ZZ%] MULTIPLE CHOICE SECTION. Circle or underline the correct answer (or answers). You do not need to provide a justification for your answer(s). (1) Does a curve that has been arc-length parameterized actually look different than one that has not? (Circle or underline the ONE most correct answer) (a) Yes. An arc-length parameterized curve is clearly smoother than one that has an arbitrary parameterization. (b) Maybe. It could look different, if the curve is not C(1) continuous. (c) No. A curve can be converted from an arbitrary parameterization to arc-length, and vice versa, with no change to the apparent shape of the curve itself. It would take a dynamic behavior (e.g. observing the motion of an object along the curve) to visually appreciate the difference between the 2 parameterizations. (2) Which of the following statements are true about cubic B-splines? (Circle or underline ALL correct answers) (a) Cubic B-splines always interpolate their control points. (b) With cubic B-splines we can obtain C(2) continuity while retaining local control. (c) Cubic B-splines will, by construction, never exhibit tangent discontinuities (e.g. sharp corners). (3) Which of the following statements about mipmaps are correct? (Circle or underline ALL correct answers) (a) Mipmaps help eliminate aliasing, while only requiring a minimal memory overhead to store a hierarchy of texture resolutions. (b) A disadvantage of mipmaps is that discontinuities are very easily visible when a texture transitions between two different resolutions of the mipmap. (c) We can get a very comparable effect to the use of mipmaps by rendering with a standard texture and selectively blurring the resulting image at locations where the texture resolution is significantly finer than the image pixel resolution. 1

2. [XX Y Y % = ZZ%] SHORT ANSWER SECTION. Answer each of the following questions in no more than 1-3 sentences. (a) Write the stencils for the 2D image filters that would perform the following functions: (i) Blur the image (you may assume a 3 3 window), (ii) Detect sharp vertical edges, and (iii) shift the image up by 2 pixels, and to the right by 1 pixel. (b) Although most display devices use primary colors that are not purefrequency colors (i.e. the primary colors span an entire distribution of frequencies), this does not significantly compromise the ability of such devices to reproduce a reasonably extensive color gamut. Why is this so? How can two monitors produce the same color even if they use different primaries? (c) Name two reasons why, in ray tracing, we may find it preferable to send rays away from the camera and into the scene, rather than sending out rays from light sources and towards the camera. 2

(d) Explain why a curve that is G(1) continuous and arc-length parameterized will necessarily be C(1) continuous, too. (e) In local illumination models (e.g. the Phong model we discussed in class) shading of a given point on a visible surface object is computed independently of how any other surface has been shaded. Describe two examples of scenes or phenomena that a local illumination model would not be able to realistically reproduce. x(t) y (t)+z (t) (f) If C(t) = y(t) is a curve in 3D, show that the vector z(t) x (t) y (t) is always perpendicular to it [Hint: How does it relate to the tangent?] 3

3. [XX%]Consider the four points P 0 (0, 0), P 1 (4, 4), P 2 (8, 4), P 3 (8, 0) as shown in the illustration below: P 1 P 2 P 0 P 3 Let C(t) be the cubic Beziér curve with control points P 0, P 1, P 2, P 3. Use De Casteljau s algorithm to compute the intermediate curve locations C(0.25), C(0.5), C(0.75) (on paper), and use them as guides to draw an approximation of the curve on top of the figure above. It is also acceptable to compute the intermediate curve values graphically, instead of computing exact coordinates, if you prefer doing so. If you choose this option, you might want to show your work separately for each intermediate point (in a duplicate of the figure above) to avoid clutter, and then transfer your final results to the illustration above. 4

4. [XX%] Consider a quadratic parametric curve C(u) = a 0 + a 1 u + a 2 u 2 in 3 dimensions, which satisfies the following constraints: C(0) = p 0 C (0) = 4(p 0 2p 1 + p 2 ) C(1) = p 2 where p 0, p 1, p 2 are control points given as input. Compute the basis matrix B that would allow us to express this curve in the form C(u) = ( 1 u u ) p 0 2 B p 1 = ubp }{{} p u 2 }{{} P 5

5. [XX%] Consider a ray, originating from point p 0 = (2, 3, 1) and propagating in the direction of the unit vector d = (0, 1, 0). [Hint: The parametric equation of the ray will be C(t) = p 0 + t d, t > 0] A sphere with equation x 2 + y 2 + z 2 = 9 (centered at the origin, with radius 3) potentially lies in the path of the ray, as illustrated below. Compute the point where the ray intersects the sphere, and also compute the surface normal (relative to the sphere surface) at the point of intersection. If you believe that the ray and the sphere do not intersect, make sure to justify your claim. 6

6. [XX%] In recursive ray tracing, we cast rays from the camera and out into the scene. When a ray intersects an object, it can generate a reflection ray (in the mirror-reflection direction), as well as shadow rays (for each light source, and pointed towards it). For this scene, we assume we cannot have the third type (transmission or refraction rays) since all objects are non-transparent. Assume that our algorithm allows each ray to bounce no more than two times off objects, before reaching a light (rays that cannot reach a light after a maximum of 2 bounces are eliminated). In the 2D scene above, we have a camera (left), a point light (drawn as a star; top right), two sperical objects and a planar surface on the bottom. (i) Show which parts of the object surfaces will be viewed as illuminated, and which ones will be shadowed (draw directly on the figure above). (ii) Draw one sequence of rays with two bounces that reaches the edge of one of the shadows. (For example, the illustration below shows a one-bounce ray path that reaches the edge of a shadow). Indicate any equal angles. Shadow ends here 7