CS 130 Exam I. Fall 2015

Similar documents
CS 130 Exam I. Fall 2015

CS 130 Final. Fall 2015

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

Pipeline Operations. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2018 Lecture 11

Pipeline Operations. CS 4620 Lecture 14

Institutionen för systemteknik

Rendering approaches. 1.image-oriented. 2.object-oriented. foreach pixel... 3D rendering pipeline. foreach object...

Topics and things to know about them:

Pipeline Operations. CS 4620 Lecture 10

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1

CS230 : Computer Graphics Lecture 4. Tamar Shinar Computer Science & Engineering UC Riverside

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

CS559 Computer Graphics Fall 2015

CHAPTER 1 Graphics Systems and Models 3

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

CSE Intro to Computer Graphics. ANSWER KEY: Midterm Examination. November 18, Instructor: Sam Buss, UC San Diego

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

Interactive Computer Graphics A TOP-DOWN APPROACH WITH SHADER-BASED OPENGL

Deferred Rendering Due: Wednesday November 15 at 10pm

CS 381 Computer Graphics, Fall 2008 Midterm Exam Solutions. The Midterm Exam was given in class on Thursday, October 23, 2008.

Midterm Exam CS 184: Foundations of Computer Graphics page 1 of 11

CSE 167: Lecture #5: Rasterization. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012

6.837 Introduction to Computer Graphics Final Exam Tuesday, December 20, :05-12pm Two hand-written sheet of notes (4 pages) allowed 1 SSD [ /17]

CS 4620 Program 3: Pipeline

Orthogonal Projection Matrices. Angel and Shreiner: Interactive Computer Graphics 7E Addison-Wesley 2015

Interpolation using scanline algorithm

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

Introduction to Visualization and Computer Graphics

- Rasterization. Geometry. Scan Conversion. Rasterization

CS 4620 Midterm, March 21, 2017

ECS 175 COMPUTER GRAPHICS. Ken Joy.! Winter 2014

The Graphics Pipeline. Interactive Computer Graphics. The Graphics Pipeline. The Graphics Pipeline. The Graphics Pipeline: Clipping

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

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

From Vertices to Fragments: Rasterization. Reading Assignment: Chapter 7. Special memory where pixel colors are stored.

Graphics Pipeline 2D Geometric Transformations

CS 464 Review. Review of Computer Graphics for Final Exam

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

CS4620/5620: Lecture 14 Pipeline

Lets assume each object has a defined colour. Hence our illumination model is looks unrealistic.

CS451Real-time Rendering Pipeline

TDA361/DIT220 Computer Graphics, January 15 th 2016

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

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

Chapter 7 - Light, Materials, Appearance

Module Contact: Dr Stephen Laycock, CMP Copyright of the University of East Anglia Version 1

CPSC GLOBAL ILLUMINATION

Illumination and Shading


Computing Visibility. Backface Culling for General Visibility. One More Trick with Planes. BSP Trees Ray Casting Depth Buffering Quiz

Introduction Rasterization Z-buffering Shading. Graphics 2012/2013, 4th quarter. Lecture 09: graphics pipeline (rasterization and shading)

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

GLOBAL EDITION. Interactive Computer Graphics. A Top-Down Approach with WebGL SEVENTH EDITION. Edward Angel Dave Shreiner

The Traditional Graphics Pipeline

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

CSE 167: Introduction to Computer Graphics Lecture #4: Vertex Transformation

TSBK 07! Computer Graphics! Ingemar Ragnemalm, ISY

Mach band effect. The Mach band effect increases the visual unpleasant representation of curved surface using flat shading.

Rasterization. COMP 575/770 Spring 2013

Rasterization Overview

Homework #2 and #3 Due Friday, October 12 th and Friday, October 19 th

CS384G Midterm Examination Spring 2008

Ray Tracing Basics I. Computer Graphics as Virtual Photography. camera (captures light) real scene. photo. Photographic print. Photography: processing

The Rasterization Pipeline

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

Chapter 5. Projections and Rendering

THE AUSTRALIAN NATIONAL UNIVERSITY Final Examinations(Semester 2) COMP4610/COMP6461 (Computer Graphics) Final Exam

The Traditional Graphics Pipeline

Lecture 17: Shading in OpenGL. CITS3003 Graphics & Animation

Graphics Pipeline. CS535 Fall Daniel G. Aliaga Department of Computer Science Purdue University

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

Midterm Exam! CS 184: Foundations of Computer Graphics! page 1 of 14!

Werner Purgathofer

Midterm Exam! CS 184: Foundations of Computer Graphics! page 1 of 13!

CS 381 Computer Graphics, Fall 2012 Midterm Exam Solutions. The Midterm Exam was given in class on Tuesday, October 16, 2012.

Last week. Machiraju/Zhang/Möller

Illumination & Shading: Part 1

TSBK03 Screen-Space Ambient Occlusion

Graphics Hardware and Display Devices

Lecture 8 Ray tracing Part 1: Basic concept Yong-Jin Liu.

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

2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into

Real Time Rendering of Complex Height Maps Walking an infinite realistic landscape By: Jeffrey Riaboy Written 9/7/03

COMP 175 COMPUTER GRAPHICS. Ray Casting. COMP 175: Computer Graphics April 26, Erik Anderson 09 Ray Casting

OpenGl Pipeline. triangles, lines, points, images. Per-vertex ops. Primitive assembly. Texturing. Rasterization. Per-fragment ops.

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

Homework 3: Programmable Shaders

Computer Graphics I Lecture 11

Computer Graphics. Illumination and Shading

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

The Traditional Graphics Pipeline

Outline. Introduction Surface of Revolution Hierarchical Modeling Blinn-Phong Shader Custom Shader(s)

8.1 Geometric Queries for Ray Tracing

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

The University of Calgary

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

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

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

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

Transcription:

S 3 Exam I Fall 25 Name Student ID Signature You may not ask any questions during the test. If you believe that there is something wrong with a question, write down what you think the question is trying to ask and answer that.

Question Points Score True/False 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 2 Multiple hoice 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 2 4 Written 2 5 22 23 5 Total 2

True/False For each question, indicate whether the statement is true or false by circling T or F, respectively.. (T/F) Rasterization occurs before vertex transformation in the graphics pipeline. 2. (T/F) Rasterization may generate multiple fragments per pixel. 3. (T/F) lipping is performed after perspective division in the graphics pipeline. 4. (T/F) The OpenGL pipeline is primarily designed to implement global illumination. 5. (T/F) OpenGL supports z-bu ering. 6. (T/F) Matrix multiplication is associative but not commutative. 7. (T/F) Given any matrices M,M 2, and M 3,(M M 2 )M 3 = M (M 2 M 3 ). 8. (T/F) Given any matrices M,M 2, and M 3, M 3 M 2 M = M M 2 M 3. 9. (T/F) Perspective transformation is a linear transformation.. (T/F) Applying a perspective transformation in the graphics pipeline to a vertex involves dividing by its z coordinate.. (T/F) The viewport transformation maps from normalized device coordinates to screen space. 2. (T/F) lipping geometry against the view volume can be done independently on each vertex, make the graphics pipeline extremely fast. 3. (T/F) The directional light source idealization is appropriate for a light that is very close to the scene. 4. (T/F) When using the Phong Reflectance Model, we calculate the red, green, and blue color channels independently. 5. (T/F) When using the Phong Reflectance Model with smooth shading for a triangulated surface, we will calculate the Phong Reflectance Model once per triangle. 6. (T/F) Modern day GPUs allow the user to supply custom vertex and pixel shaders. 7. (T/F) This matrix is a rigid body transformation cos sin 2 Bsin cos @ A 8. (T/F) We can translate the vector by multiplying it by the matrix B @ B @ 3 2 A A 9. (T/F) Gouraud shading requires more computation than Phong shading. 2. (T/F) The OpenGL graphics pipeline allows for multiple textures to be bound to the same object. 3

2 Multiple hoice For each question, circle exactly one of (a)-(e), unless otherwise stated.. onsider the use of homogeneous coordinates (x, y, z, w) T in the graphics pipeline. I. (x, y, z, w) T can be used to represent either a 3D point or a 3D vector. II. w = for a 3D vector. III. Nonzero values of w are used to e ect translation and perspective transformation. (b) I and II only (c) II and III only (d) I and III only (e) I, II and III 4

2. onsider the OpenGL graphics pipeline. Which statements are true? I. Pipelining increases throughput and decreases latency. II. III. (b) II only (c) III only (d) I and II only OpenGL sorts triangles to determine visibility. In modern OpenGL, the user may supply shaders which will execute on the GPU. (e) I and III only 3. Which of the following are true? I. Backface culling refers to eliminating geometry with backfacing normals. II. III. The Painter s algorithm attempts to sort fragments and draw them back to front. Using z-bu ering, shading calculations will be done for fragments that may never appear on screen. (b) I and II only (c) II and III only (d) I and III only (e) I, II and III 4. oncerning flat, smooth, and Phong shading, I. in flat shading the shading calculation is done once per triangle, while in Phong shading the shading calculation is done once per fragment. II. III. (b) I and II only flat shading does not require any normals. smooth shading requires interpolation of normals to vertices. (c) I and III only (d) II and III only (e) I, II and III 5

5. Match the type of transformation in the left column with the example transformation matrix in the right by drawing lines between the matching boxes. translation perspective nonuniform scale identity B @ B @ A 5 B @ A B @ A 3 2 A 6. Perspective transformations I. are nonlinear transformations. II. preserve the z ordering of vertices between the near and far planes. III. can change the sign of the z coordinate for vertices behind the eye. (b) I and II only (c) I and III only (d) II and III only (e) I, II and III 6

7. onsider the Midpoint algorithm given here: () y = y (2) d = f(x+,y+/2) (3) for x = x to x (4) do (5) draw(x,y) (6) if (d<) (7) then (8) y = y+ (9) d = d+(y-y)+(x-x) () else () d = d+(y-y) (2) end (3) end Which statements are true? I. For a line with slope m>, we should change the outer loop in line (3) to be over y. II. Lines (9) and () update the decision variable d through an incremental evaluation of the line equation f. III. This algorithm fails if d is ever. (b) I and II only (c) I and III only (d) II and III only (e) I, II and III 8. Which of the following statements about barycentric coordinates (,, ) for triangles are true? I. If s = + +,thens< for points inside the triangle, s> for points outside the triangle, and s = for points on the triangle. II. At least one of,, and will be for a point on the triangle. III.,, and can be used to interpolate vertex attributes across the face of the triangle. (b) I and II only (c) I and III only (d) II and III only (e) I, II and III 7

9. onsider the 3D vectors, x, y, illustrated below, and dot product and cross product. Which statements are true? two-vectors.png I. x y >. II. x y =, because x and y lie in the same plane. III. x x = y y. (b) II only (c) I and II only (d) I and III only (e) None 2. onsider the following equation from the Lambertian reflectance model, where R a, R d, L a, and L d are the ambient and di use reflectance of the object, and the ambient and di use components of the light, respectively, l is the light vector, and n is the object normal vector. I = R a L a + R d L d max(, l n) I. Polygons facing away from the light will necessarily have I =. II. III. (b) II only (c) I and II only This formula can capture specular highlights. Generally n will vary over the surface of the object but l will be constant. (d) I and III only (e) None 8

3 Written Response 2. onsider a line in the plane going through the points (, 2) and (2, 4). (a) Write down the explicit equation for the line, with x the independent variable and y = f(x) the dependent variable. (b) Write down an implicit equation for the line. Identify a normal to the line. (c) Write down a parametric equation for the line segment going through the two points, in terms of a single parameter t 2 [, ]. 9

22. ome up with a series of matrices as well as an order of multiplication (you don t need to actually perform the multiplication) to transform the triangle (,), (,), (,3) to (-,), (-3,),(-,-6). Sketch the triangle at every step of the transformation.

23. onsider a ray with endpoint a and a normalized direction u, p(t) =a + tu, t, () and a sphere of radius r, centered at the origin. The implicit equation for the sphere is given as follows: f(p) =p p r 2 = (2) (a) Describe geometrically the ways in which the ray can intersect/not intersect with the sphere. I.e., when is there exactly one intersection, when are there two intersections, and when are there no intersections? (b) Find an expression for t where the intersection occurs by plugging eq. () into eq. (2) and solving for t. How can this expression to be used to distinguish the three cases described in part (a)? Hint (Quadratic formula): Solutions to ax 2 + bx + c =are x = b±p b 2 4ac 2a (c) Write pseudocode for an algorithm for finding the intersection points or identifying that there is is no intersection.