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

Similar documents
Make sure you fill in your name and the above information, and that you sign below. Anonymous tests will not be graded.

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

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.

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.

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

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

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

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.

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

CS 130 Final. Fall 2015

Computer Graphics I Lecture 11

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

U.C. Berkeley, EECS, Computer Science FINAL EXAM. Your Class Computer Account: Row: Seat: Your student ID #:

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

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

Topics and things to know about them:

CHAPTER 1 Graphics Systems and Models 3

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013

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

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

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

Curves D.A. Forsyth, with slides from John Hart

GEOMETRIC TOOLS FOR COMPUTER GRAPHICS

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

3D Modeling Parametric Curves & Surfaces

Until now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple

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

The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a

CS 130 Exam I. Fall 2015

Curves and Surfaces Computer Graphics I Lecture 9

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

Introduction to Computer Graphics

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

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

Curves and Surfaces 1

CPSC GLOBAL ILLUMINATION

Curves and Surfaces Computer Graphics I Lecture 10

Computer Graphics Curves and Surfaces. Matthias Teschner

EECS 487, Fall 2005 Exam 2

Lecture IV Bézier Curves

Curve and Surface Basics

Introduction to Visualization and Computer Graphics

The University of Calgary

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics

Information Coding / Computer Graphics, ISY, LiTH. Splines

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

CS559 Computer Graphics Fall 2015

CS 130 Exam I. Fall 2015

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

CMSC427 Final Practice v2 Fall 2017

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]

Lahore University of Management Sciences. CS 452 Computer Graphics

Computergrafik. Matthias Zwicker. Herbst 2010

Lahore University of Management Sciences. CS 452 Computer Graphics

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

U.C. Berkeley, EECS, Computer Science TAKE HOME EXAM. Your Class Computer Account: Your student ID #:

U.C. Berkeley, EECS, Computer Science TAKE HOME EXAM. Your Class Computer Account: DO NOT OPEN THIS INSIDE SODA HALL -- WAIT UNTIL YOU ARE ALONE!

Central issues in modelling

Parametric Curves. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016

ECE 600, Dr. Farag, Summer 09

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

CS-184: Computer Graphics

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

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

End-Term Examination

CS354 Computer Graphics Surface Representation IV. Qixing Huang March 7th 2018

Introduction to Geometry. Computer Graphics CMU /15-662

Parametric curves. Brian Curless CSE 457 Spring 2016

Curves and Surfaces. Shireen Elhabian and Aly A. Farag University of Louisville

Course Title: Computer Graphics Course no: CSC209

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

Raytracing CS148 AS3. Due :59pm PDT

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

Geometric Modeling of Curves

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

Curves. Computer Graphics CSE 167 Lecture 11

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

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

COMP3421. Global Lighting Part 2: Radiosity

Deferred Rendering Due: Wednesday November 15 at 10pm

Bezier Curves, B-Splines, NURBS

MA 323 Geometric Modelling Course Notes: Day 21 Three Dimensional Bezier Curves, Projections and Rational Bezier Curves

OXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS

Splines. Parameterization of a Curve. Curve Representations. Roller coaster. What Do We Need From Curves in Computer Graphics? Modeling Complex Shapes

Shape Representation Basic problem We make pictures of things How do we describe those things? Many of those things are shapes Other things include

COMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg

CS 465 Program 4: Modeller

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

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

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

Curves, Surfaces and Recursive Subdivision

Computer Graphics & Image Processing: Exercises

CS 4620 Midterm, March 21, 2017

Assignment 6: Ray Tracing

Introduction to Computer Graphics 7. Shading

Problem Set 4 Part 1 CMSC 427 Distributed: Thursday, November 1, 2007 Due: Tuesday, November 20, 2007

CS-184: Computer Graphics. Today

Intro to Curves Week 1, Lecture 2

Geometry. Chapter 5. Types of Curves and Surfaces

Transcription:

Final Exam CS 184: Foundations of Computer Graphics! page 1 of 12! Student Name:! Class Account Username: Instructions: Read them carefully!! The exam begins at 8:10pm and ends at 10:00pm. You must turn your exam in when time is announced or risk not having it accepted.! Make sure you fill in your name and the above information, and that you sign below. Anonymous tests will not be graded.! Write legibly. If the person grading the test cannot read something, he/she will simply assume that you meant the illegible portion as a note to yourself and they will ignore it. If you lose points because part of your answer could not be read, you will not be given the opportunity to explain what it says.! Be clear and concise. The answers to most questions should be short. If you find yourself writing an excessively long response, you may want to think more carefully about the question. Long rambling answers generally get fewer points that short ones do because there are more opportunities to mark something wrong.! You may use two pages of notes while taking the exam. You may not ask questions of other students, look at another student s exam, use a textbook, use a phone or calculator, or seek any other form of assistance. In summary: do not cheat. Persons caught cheating will be subject to disciplinary action.! Do not ask questions during the exam. Most questions are unnecessary and they disturb other students. Figuring out what the exam question is asking is part of the test. If you think you have to make some unusual assumption to answer a problem, note what that assumption is on the test.! I have read these instructions, I understand them, and I will follow them.! Your Signature:!! Date:!!!! Student ID:!!! Total Points: 189 + 10 You Scored:! + Extra!

Final Exam CS 184: Foundations of Computer Graphics! page 2 of 12! 1. Please fill in each of the blanks with an appropriate answer.! 2 points each blank, 38 total! A = USV T, then the psuedo-inverse of the ma- If the singular value decomposition of a matrix is trix is given by A P =. The of the tangent vectors of a parametric surface generally can be used to computed the surface normal vector. When representing in 3D using homogenized coordinates, the fourth coordinate (i.e. w ) will be zero. The _ method assumes that all materials in a scene are diffuse. The _ method computes a view-independent solution.. Field Radiance is measured in units of. _ surfaces are a generalization of uniform, cubic, tensor-product b- spline surfaces. A B-spline curve is always enclosed by the of its control points. In Catmull-Clark subdivision, the number of new extraordinary points introduced on the fourth round of subdivision will be. The of an orthonormal matrix is equal to its inverse. encode 3D rotations as 3D points inside a ball of radius π. The special case of a perspective camera that is infinitely far away from a scene is termed a(n) camera.

Final Exam CS 184: Foundations of Computer Graphics! page 3 of 12! A texture mapping method called is used to change the apparent shape of an object during shading. NURBS are non-uniform B-Splines that use homogeneous coordinates for control points. are the dimensionless units used to measure solid angles. Finding the intersection of a ray with an ellipse requires solving a equation. Finding the intersection of a ray with a three-sided triangle requires solving a of equations. The dynamic range of the human eye is much than the dynamic range of a typical television set. If a spring with length l has stiffness coefficient k, then a pair of springs in serial with length l*4 should have stiffness if they are to replicate the behavior of the original spring. 2. Answer the following questions with True (T) or False (F)! 2 points each, 78 total! Light transport can be modeled reasonably well using a collection of particles attached by photon-links. The Jacobian of a valid kinematic system will never be invertible. Shiny plastic surfaces typically have bright green specularities. In a smoke-filled room the radiance along a straight line would fall off exponentially. The rods in the human eye have a spectral response function that peaks somewhere between the short and long cones responses. Under linear perspective projection, squares always appear as quadrilaterals unless the projection is degenerate.

Final Exam CS 184: Foundations of Computer Graphics! page 4 of 12! Under linear perspective projection, triangles always will appear to have at least one angle equal to 90 degrees. Quaternions represent rotations as points in 3D space on the surface of a hyper-torus. Shining an ultraviolet light on scorpions makes them glow green due to photo multiplication of the electrons. The force exerted by a linear-strength spring with non-zero rest length is given by a function that is non-linear in terms of the endpoint locations. C 2 Cubic Bezier curves will be! across segment boundaries. Light fields are generated by non-normalized permutation maps. In a kinematic skeleton, every child body must not be left behind when applying loop-joint transformations. A rotation matrix always has determinant that is greater than zero. Homeomorphic coordinates facilitate representing perspective and translation using matrices. Ambient occlusion tends to enhance the appearance of surface detail. The sky is blue because water vapor scatters light in the short part of the spectrum. In some women red-green color blindness is caused by a mutation in the coding for the cones. In a rectilinear spring mesh, adding jump springs will help to limit bending movement. Motion graphs used to animation human figures should never contain cycles. Given two recorded human motion sequences that appear natural, motions created by blending them will also appear natural and human-like because human perception is linear. Planar inverse kinematics problems will typically have simple closed-from solutions.

Final Exam CS 184: Foundations of Computer Graphics! page 5 of 12! A ball joint represented with an exponential map has three degrees of freedom. C 1 continuity does not always imply G 1 continuity G 1 continuity does not always imply C 1 continuity The Hermite basis functions are affine invariant. The fully explicit version of Euler s method (a.k.a. forward Euler) is unconditionally stable. Some motion capture systems use magnetic fields to determine the location and orientation of tracker objects. Pixel-based image representations have infinite resolution. Non-zero winding number and parity testing will produce the same result for a polygon with non-self-intersecting boundary. Particle systems simulate objects such as waterfalls by modeling the detailed interactions between individual molecules of water. The result of applying subdivision to a cubic curve is two quadratic curves. Raytracing can be accelerated using BSP-Trees or K-D Trees. The short cones in the human eye only sense blue light. In a bounding-box tree, the bounding-box stored at a root note may not encompass the boxes of its children nodes. The Hermite basis functions have longitudinal support. Displacement-mapping will not change an object s silhouette. Rational polynomial basis functions can be used to build perfect circles. Turning your final assignment in late will result in a zero on the assignment!

Final Exam CS 184: Foundations of Computer Graphics! page 6 of 12! 3. Which of the following scenes would cause problems for the Painter s Algorithm?! 3 points!! 4. Write the common English name for each of the color matching each of the following spectral density curves. For example, the unlabeled gray curve would be red.! 8 points!!! A. B. C. D.!

Final Exam CS 184: Foundations of Computer Graphics! page 7 of 12! C 1 5. The diagram below shows control points for a curve made by joining two cubic Bezier segments. However control point #5 has been removed. Indicate a location where #5 may be placed to achieve continuity and draw the curve that would result. Also draw a line where #5 may be placed to achieve G 1 continuity. Make sure your diagram is clear and geometrically reasonable.! 9 points! 2 3 7 4 1 6 6. Name a phenomenon that can be modeled easily using photon mapping but that cannot be modeled with a basic ray-tracing algorithm. Give an example.! 3 points!

! Final Exam CS 184: Foundations of Computer Graphics! page 8 of 12! 7. Here is a piece of mesh. Draw the result of applying one iteration of Catmull-Clark subdivision. Then circle all vertices (both original and the new ones you added) that are extraordinary. Note: I am only interested in the topology of your answer.! 7 points! 8. Below are two 4x4 homogenized transformation matrices. What does the first one do? How does the effect 2 produced by the second one 3differ 2 from that produced by the first?! 3 4 points 1 0 0 0 1 0 0 0 6 0 1 0 0 7 6 0 2 0 0 7 4 0 0 1 2 5 4 0 0 4 0 5 0 0 0 2 0 0 0 8 The first one will: The second one will:!

Final Exam CS 184: Foundations of Computer Graphics! page 9 of 12! 9. Neatly draw the convex hull for each of the three shapes shown below.! 6 points! 10. Write out an implicit equation for a 2D ellipse where the long axis is the X axis with radius 2 and the short axis is the Y axis with radius 1.! 8 points! 11. Write out a parametric equation for a plane in 3D that is normal to the Z axis and passes through some point P.! 3 points! 12. The diagram below is the control polygon for a Bezier curve segment. Draw the curve and show how de Casteljau s algorithm can be used to subdivide the curve into two equal halves. Make sure your drawing is geometrically reasonable and shows correct curve tangents for the the beginning, middle, and end of each segment.! 5 points!

Final Exam CS 184: Foundations of Computer Graphics! page 10 of 12! 13. In the space below draw a diagram illustrating the formation of a tight refraction caustic. Your diagram should be clear and concise, and clearly show the light source(s), the reflecting surface(s), the surface where the caustic forms, and the paths of representative rays. A 2D diagram is suggested.! 3 points! 14. Given three points, A, B and C, write out a parametric equation in two variables, u and v, for the triangle formed by these three points.! 4 points! 15. When rendering a scene with a photon-mapping method, what part of the solution must be recomputed when the viewer moves?! 4 points

! Final Exam CS 184: Foundations of Computer Graphics! page 11 of 12! 16. On the diagram below, draw the springs that should be added to provide some resistance to in-plane shearing.! 4 points! 17. Would the differences between Phong interpolation (interpolating normals) and Gouraud interpolation (interpolating colors) be more noticeable on diffuse or specular surface?!! 2 points!

Final Exam CS 184: Foundations of Computer Graphics! page 12 of 12! Given a sphere and plane: EXTRA CREDIT! Sphere:! x c r 2 =0 x(u, v) =uv 1 + vv 2 + p 10 points! Plane:! Write out an explicit parametric equation that produces the circle where the sphere and plane intersect. Also indicate when this circle is undefined. You may assume that v1 and v2 are both of unit length and mutually orthogonal. Your answer must be neat and clear. No points will be awarded for imprecise or messy answers. Your answer should be in the form of a simple explicit equation that you have drawn a box around. Do not attempt this question until you have completed the rest of the exam! There will be no partial credit for this question.