CS 559 Computer Graphics Midterm Exam March 22, :30-3:45 pm

Similar documents
You will have the entire period (until 9:00pm) to complete the exam, although the exam is designed to take less time.

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

Topics and things to know about them:

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

CHAPTER 1 Graphics Systems and Models 3

CMSC427: Computer Graphics Lecture Notes Last update: November 21, 2014

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.

CS 481/681 Advanced Computer Graphics, Spring 2004 Take-Home Midterm Exam

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

Institutionen för systemteknik

CS 4620 Midterm 1. Tuesday 22 October minutes

Computer Graphics I Lecture 11

CS559 Computer Graphics Fall 2015

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

CSC 471 midterm 2 Winter Name:

Computer Graphics I. Midterm Examination. October 23, This is a closed-book exam; only one double-sided sheet of notes is permitted.

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

Math 52 - Fall Final Exam PART 1

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

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

Transforms 1 Christian Miller CS Fall 2011

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

Computer Graphics - Treasure Hunter

CS 130 Final. Fall 2015

2D Spline Curves. CS 4620 Lecture 18

CS559 Computer Graphics Fall 2015

Tentti/Exam Midterm 2/Välikoe 2, December

CS Simple Raytracer for students new to Rendering

SUMMARY. CS380: Introduction to Computer Graphics Projection Chapter 10. Min H. Kim KAIST School of Computing 18/04/12. Smooth Interpolation

Notes on Computer Graphics and OpenGL. Thomas Strathmann

Math 2 Final Exam Study Guide. Translate down 2 units (x, y-2)

CS 464 Review. Review of Computer Graphics for Final Exam

CS559 Computer Graphics Fall 2015

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

CS 130 Exam I. Fall 2015

Homework #1. Displays, Image Processing, Affine Transformations, Hierarchical modeling, Projections

9. [20 points] A degree three Bezier curve q(u) has the four control points p 0 = 0,0, p 1 = 2,0, p 2 = 0,2, and p 3 = 4,4.

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

Computer Graphics Coursework 1

Today. Parity. General Polygons? Non-Zero Winding Rule. Winding Numbers. CS559 Lecture 11 Polygons, Transformations

Guided Problem Solving

Interpolation and Basis Fns

Objectives. Shading II. Distance Terms. The Phong Reflection Model

CSE 690: GPGPU. Lecture 2: Understanding the Fabric - Intro to Graphics. Klaus Mueller Stony Brook University Computer Science Department

CS123 INTRODUCTION TO COMPUTER GRAPHICS. Describing Shapes. Constructing Objects in Computer Graphics 1/15

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

CS4202: Test. 1. Write the letter corresponding to the library name next to the statement or statements that describe library.

light light light B E

Curves and Surfaces. CS475 / 675, Fall Siddhartha Chaudhuri

CS475/675: Computer Graphics End-Semester Examination (Solutions), Fall 2016

GRK. dr Wojciech Palubicki

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

Blue colour text questions Black colour text sample answers Red colour text further explanation or references for the sample answers

CMSC 435/634: Introduction to Graphics

Pipeline Operations. CS 4620 Lecture 10

CS 4620 Program 3: Pipeline

Course Title: Computer Graphics Course no: CSC209

CS 4620 Midterm, March 21, 2017

Shading II. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico

Fall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li.

A simple OpenGL animation Due: Wednesday, January 27 at 4pm

Lahore University of Management Sciences. CS 452 Computer Graphics

Shape & Space Part C: Transformations

CS 465 Program 4: Modeller

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.

Z- Buffer Store the depth for each pixel on the screen and compare stored value with depth of new pixel being drawn.

Computer Graphics. Coordinate Systems and Change of Frames. Based on slides by Dianna Xu, Bryn Mawr College

CS223b Midterm Exam, Computer Vision. Monday February 25th, Winter 2008, Prof. Jana Kosecka

CS337 INTRODUCTION TO COMPUTER GRAPHICS. Describing Shapes. Constructing Objects in Computer Graphics. Bin Sheng Representing Shape 9/20/16 1/15

Advanced Lighting Techniques Due: Monday November 2 at 10pm

TDA361/DIT220 Computer Graphics, January 15 th 2016

The University of Calgary

Chapter 18. Geometric Operations

Surface Graphics. 200 polys 1,000 polys 15,000 polys. an empty foot. - a mesh of spline patches:

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

CS3621 Midterm Solution (Fall 2005) 150 points

09 - Designing Surfaces. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo

EXAM SOLUTIONS. Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006,

Scalar Field Visualization I

CMSC427 Final Practice v2 Fall 2017

CS5620 Intro to Computer Graphics

Lahore University of Management Sciences. CS 452 Computer Graphics

G r a d e 1 0 I n t r o d u c t i o n t o A p p l i e d a n d P r e - C a l c u l u s M a t h e m a t i c s ( 2 0 S )

Computer Graphics (CS 4731) Lecture 16: Lighting, Shading and Materials (Part 1)

This week. CENG 732 Computer Animation. Warping an Object. Warping an Object. 2D Grid Deformation. Warping an Object.

Queen s University CISC 454 Final Exam. April 19, :00pm Duration: 3 hours. One two sided aid sheet allowed. Initial of Family Name:

Interpolation and Basis Fns

On Your Own. ). Another way is to multiply the. ), and the image. Applications. Unit 3 _ _

Comp 410/510 Computer Graphics. Spring Shading

Viewing with Computers (OpenGL)

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

Pipeline Operations. CS 4620 Lecture 14

Assignment 6: Ray Tracing

Computer Science 426 Midterm 3/11/04, 1:30PM-2:50PM

2D Spline Curves. CS 4620 Lecture 13

6th Grade ~ Conceptual Foundations for Unit of Study 8 Geometry DRAFT 6/30/11 Geometry (Spatial Sense & Reasoning) 1. Shapes, Solids and Properties

CMSC 435/634: Introduction to Graphics

Homework 3: Programmable Shaders

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

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

Transcription:

CS 559 Computer Graphics Midterm Exam March 22, 2010 2:30-3:45 pm This exam is closed book and closed notes. Please write your name and CS login on every page! (we may unstaple the exams for grading) Please do this first (and check to make sure you have all of the pages) You will have the entire period (until 3:45pm) to complete the exam, however it was designed to take less time. Write numerical answers in fractional form or use radicals (square root symbols) we would prefer to see 3/ 2 than.866. You should not need a calculator for this exam. If you need extra space, use the back of a page, but clearly mark what everything is. We may look at your work to determine partial credit. Question # Ave Score Max Score 1 18.00 20 2 18.57 20 3 15.40 20 4 14.70 20 5 15.47 20 Total 82.10 100 *At least one student got the max score on each question Page 1 of 7

1. Filtering and Convolution (20 pts) Consider the following discrete signal f(t) = [0 8 4 2 2 8 4] defined from t=0 to t=6 a. [Discrete Continuous Convolution] Use the filter kernel given below for this part. The Kernel is defined over the range -2 2. The Grid units are ¼. Assume that the sample outside the 0-6 range is 0 for this part. What is the value of the convolved signal at t= 1.5 -.5*0 +.5*8 +.5*4 + -.5*2 = 5 t= 2 4 (interpolating) t= 3.5 -.5*4 +.5*2 +.5*2 + -.5*8 = -4 t= 4 2 (interpolating) b. [Discrete Discrete Convolution] Use the filter kernel [-1 1 1] defined over the range -1 1. Assume that the sample outside the 0-6 range is 0 for this part. What is the value of the convolved signal at You need to flip the Kernel t= 1 1*0 + 1*8 + -1*4 = 4 t= 3 1*4+ 1*2 + -1*2 = 4 t= 5 1*2 + 1*8 + -1*4 = 6 if kernel wasn t flipped (-1 point each) 12, 0, 10 c. [Discrete Discrete Convolution at boundries] Use the filter g(t) =[¼ ½ ¼] defined over the range -1 1. Use kernel re-normalization at the boundaries. What is the value of the convolved signal at t= 0 ⅔*0 + ⅓*8 = 8/3 t= 6 ⅓*8 + ⅔*4 = 16/3 Page 2 of 7

2. Transformations (20 pts) a. Consider a simple graphics toolkit that works like OpenGL (that is, it has a matrix stack, and the transformation commands post-multiply themselves onto it): The toolkit has the following commands translate(x,y) post-multiplies a translation matrix onto the top of the matrix stack rotate(a) rotates (counter clockwise around the origin) by a degrees scale(x,y) scales by x and y. BOTH X and Y MUST BE POSITIVE push() pushes a copy of the top element on the matrix stack pop() removes the top element from the matrix stack draw(triangle) draws a triangle with unit base and unit height draw(square) draws a unit square Sample translate(1,1) draw(square) translate(1,0) draw(triangle) Write down the sequence of commands to make the following drawing in a minimum number of steps 1. translate(2,0) 2. scale(3,2) 3. draw(square) 4. scale(⅓,½) 5. translate(5,0) 6. draw(triangle) 7. translate(0,1) 8. draw(triangle) 9. translate(0,1) 10. draw(triangle) 11. translate(-6,0) 12. scale(5,1) 13. draw(triangle) -1 points for each step after 14 steps Page 3 of 7

b. Consider the robotic arm given in the diagram. It has two parts, both 10 units in length. The bottom part can rotate by β o around the y axis (counter clockwise) and the top part can move α o away from the y axis. We are interested in the final position of the arm, marked by The robotic arm takes the following commands reset () - brings the arm initial position where α = 0, β=0 and p = (0,20,0) move(α, β) - moves the arm down from y-axis α o, and rotates around y-axis β o p Give the position of p after the given set of commands Example: move(90, 0) p = (10, 10, 0) i move(90, 90) p = (0,10,-10) ii move(90,45) p = (5 2, 0, -5 2) iii move(60,30) move(-15,60) p = (0, 10+5 2, -5 2) Page 4 of 7

3. Projection (20 pts) a. A vertex (point) is drawn at the origin. It is viewed through a camera that is positioned with the viewing matrix: 2 1 0 2 5 5 1 2 0 2 Step 2 * 3 = 9 0 0 1 3 2 5 0 0 0 1 1 1 The object that the vertex is drawn with transformation matrix: 0 1 0 5 0 5 Step 1 1 0 0 3 0 * = 3 0 0 1 2 0 2 0 0 0 1 1 1 This simple projective transform matrix is used: 1 0 0 0 5 5 0 1 0 0 Step 3 * 9 = 9 0 0 0 1 5 1 0 0 1 0 1 5 Where does the point appear in screen coordinates? (give the x,y position) (-1, -9/5) b. For each of the properties, mark P if it is true of a perspective projection, O if it is true of an orthographic projection, B if it is true of both orthographic and projective, and N if it is true of neither. (use P or O only if the property is only true of one type of transformation). _B_ Straight lines are mapped to straight lines _N_ Distances are preserved _N_ Angles are preserved _O_ Far away objects appear the same size as closer ones Page 5 of 7

4. Curves (20 Pts) a. Consider a Cubic Bezier Curve defined by the following 4 control points (0,0), (0,4), (4,4), (4,0). Compute the location of the curve at parameter u = 0.5 using the Decastijau s algorithm (0,0) (0,4) (4,4) (4,0) (0,2) (2,4) (4,2) (1,3) (3,3) (2,3) b. Consider a Catmull-Rom spline defined by the following 4 control points (1,2), (4,8), (5,8), (6,1). Convert this spline in to a Hermite Cubic segment, List the controls of the Hermite segment. You only need to list the controls, it is not necessary to give cubic eqation Catmull-Rom control points P 0 : (1,2) P 1 : (4,8) P 2 : (5,8) P 3 : (6,1) Hermite Cubic segment controls f(0) = P 1 = (4,8) f (0) = ½ (P 2 - P 0 )= (2,3) f(1) = P 2 =(5,8) f (1) = ½ (P 3 - P 1 )= (1,-3½) Page 6 of 7

5. Shading (20 pts) For this question observe the 4 rows displayed on the screen. In each row, there is one parameter in the phong lighting model changing. determine which parameter is the most likely one that is changing. The Phong lighting model equations is I = max{l.n, 0} L d. K d + max {s.n, 0} shininess L s. K s where: K d is the diffuse reflection coefficient L d is the intensity of the light source (remains fixed for the 4 rows) n is the normal to the surface (unit vector) L is the direction to the light source (unit vector) K s is the specular reflection coefficient L s is the intensity of the point light source (remains fixed for the 4 rows) row 1: Shininess parameter is changing row 2: K d parameter is changing row 3: K s parameter is changing row 4: L parameter is changing Page 7 of 7