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

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

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

Topics and things to know about them:

CS 4620 Midterm, March 21, 2017

CHAPTER 1 Graphics Systems and Models 3

EECS 487, Fall 2005 Exam 2

2D Spline Curves. CS 4620 Lecture 18

CS 465 Program 4: Modeller

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

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

6.837 Introduction to Computer Graphics Quiz 2 Thursday November 20, :40-4pm One hand-written sheet of notes allowed

Scene Graphs. CS4620/5620: Lecture 7. Announcements. HW 1 out. PA 1 will be out on Wed

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

Shape modeling Modeling technique Shape representation! 3D Graphics Modeling Techniques

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

MATH 104 First Midterm Exam - Fall (d) A solid has as its base the region in the xy-plane the region between the curve y = 1 x2

Manipal Institute of Technology Manipal University Manipal

CEng 477 Introduction to Computer Graphics Fall 2007

Modeling Objects. Modeling. Symbol-Instance Table. Instance Transformation. Each appearance of the object in the model is an instance

2D Spline Curves. CS 4620 Lecture 13

CS 311 Data Structures and Algorithms, Fall 2009 Midterm Exam Solutions. The Midterm Exam was give in class on Wednesday, October 21, 2009.

R has a ordered clustering index file on its tuples: Read index file to get the location of the tuple with the next smallest value

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

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

Computer Graphics I Lecture 11

In this course we will need a set of techniques to represent curves and surfaces in 2-d and 3-d. Some reasons for this include

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

CS559: Computer Graphics. Lecture 12: Antialiasing & Visibility Li Zhang Spring 2008

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

Spring 2013 CS 122C & CS 222 Midterm Exam (and Comprehensive Exam, Part I) (Max. Points: 100)

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

Speeding up your game

Name: Date: Per: WARM UP

Hidden Surface Elimination Raytracing. Pre-lecture business. Outline for today. Review Quiz. Image-Space vs. Object-Space

CMSC 435/634: Introduction to Graphics

Shadows in the graphics pipeline

Computer Graphics 1, Fall 2005

COS 226 Midterm Exam, Spring 2011

Clipping & Culling. Lecture 11 Spring Trivial Rejection Outcode Clipping Plane-at-a-time Clipping Backface Culling

Advanced Graphics

Rendering Algorithms: Real-time indirect illumination. Spring 2010 Matthias Zwicker

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

Computer Graphics. Instructor: Oren Kapah. Office Hours: T.B.A.

CS 311 Data Structures and Algorithms, Spring 2009 Midterm Exam Solutions. The Midterm Exam was given in class on Wednesday, March 18, 2009.

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

CSCI 102L - Data Structures Midterm Exam #2 Spring 2011

CS 373: Combinatorial Algorithms, Spring 1999

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

Course Title: Computer Graphics Course no: CSC209

Lecture 1. Computer Graphics and Systems. Tuesday, January 15, 13

Sung-Eui Yoon ( 윤성의 )

COMP 524 Spring 2018 Midterm Thursday, March 1

Drawing the Visible Objects

Introduction to Geometry. Computer Graphics CMU /15-662

Computer Graphics Disciplines. Grading. Textbooks. Course Overview. Assignment Policies. Computer Graphics Goals I

CS171 Midterm Exam. October 29, Name:

Information Coding / Computer Graphics, ISY, LiTH. Splines

Reading. Hierarchical Modeling. Symbols and instances. Required: Angel, sections , 9.8. Optional:

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

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

CS16 Midterm Exam 2 E02, 09F, Phill Conrad, UC Santa Barbara Wednesday, 11/18/2009

Lahore University of Management Sciences. CS 452 Computer Graphics

Visible-Surface Detection Methods. Chapter? Intro. to Computer Graphics Spring 2008, Y. G. Shin

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

VISIBILITY & CULLING. Don t draw what you can t see. Thomas Larsson, Afshin Ameri DVA338, Spring 2018, MDH

MODELING AND HIERARCHY

CS 352: Computer Graphics. Hierarchical Graphics, Modeling, And Animation

Properties of Blending Functions

CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK

Goals. Computer Graphics (Fall 2008) Course Outline. Course Outline. Course Outline. Demo: Surreal and Crazy World (HW 3)

Overview of 3D Object Representations

Overview. Computer Graphics CS324. OpenGL. Books. Learning Resources. CS131 Notes. 30 Lectures 3hr Exam

CS 464 Review. Review of Computer Graphics for Final Exam

CS 4620 Midterm 1. Tuesday 22 October minutes

CS GAME PROGRAMMING Question bank

Hierarchical Modeling. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell

CS32 Midterm Exam E01, F15, Phill Conrad, UC Santa Barbara Wednesday, 10/28/2015, 11am 12:15pm

Direct Rendering of Trimmed NURBS Surfaces

Lahore University of Management Sciences. CS 452 Computer Graphics

CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators)

3D Modeling Parametric Curves & Surfaces

Core Graphics and OpenGL ES. Dr. Sarah Abraham

Representing Curves Part II. Foley & Van Dam, Chapter 11

CS 130 Exam I. Fall 2015

Lecture 25 of 41. Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees

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

E02, W16, Phill Conrad, UC Santa Barbara

From curves to surfaces. Parametric surfaces and solid modeling. Extrusions. Surfaces of revolution. So far have discussed spline curves in 2D

COMPUTER GRAPHICS, MULTIMEDIA AND ANIMATION, Second Edition (with CD-ROM) Malay K. Pakhira

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

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.

Splines. Connecting the Dots

CS380: Computer Graphics Introduction. Sung-Eui Yoon ( 윤성의 ) Course URL:

Where We Are: Static Models

Interpolation and Basis Fns

TDA361/DIT220 Computer Graphics, January 15 th 2016

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

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

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

CS559 Computer Graphics Fall 2015

Transcription:

CS 481/681 Advanced Computer Graphics, Spring 2004 Take-Home Midterm Exam Name This exam is to be done individually. It is due, in paper form, STAPLED, at the start of class on Wednesday, March 24, 2003. The exam is worth 100 points. 11 pages, 14 problems. You may fill out the exam either electronically or by hand (or a combination of the two). In either case, PRINT the exam and turn in a paper copy. If you fill out the exam electronically, do not change the page breaks. If you need more space, you may attach additional pages. You may use any reference you like: books, notes, web pages, etc. However, the exam you turn in must be your own work; you may not discuss solutions with other people in the class. 1. [5 pts] Described how a transformation stack (as in OpenGL) makes it convenient to draw hierarchical objects. 2. [4 pts] What is Constructive Solid Geometry, and how is it used in CG? 1

3. [10 pts total] BSP Trees. 3a. [2 pts] List two graphical effects/algorithms that BSP trees are useful for. 3b. [3 pts] Using BSP trees can be problematic with some types of scenes. Explain. 3c. [5 pts] Draw two triangles below, label the edges with the numbers 1 through 6, and draw a diagram of the BSP tree for these edges, assuming all normal vectors point outward. 2

4 [5 pts total] Jittering. 4a. [2 pts] What does jittering mean in CG? 4b. [3 pts] Give two effects that can be produced using jittering, and briefly explain how jittering would be used to produce each effect. 5. [3 pts] List some of the pro s & con s of using Catmull-Rom splines vs. using Bézier curves & surfaces. 3

6 [8 pts total] Affine Transformations. 6a. [2 pts] What exactly is an affine transformation? 6b. [2 pts] Which of the transformations we have studied are affine? (You might find it simpler to say which are not.) 6c. [4 pts] When we deal with curve & surface generation, we usually want our curves & surfaces to behave in certain ways when affine transformations are applied to them. Explain. 4

7. [8 pts total] Representing Rotations. 7a. [6 pts] List three ways of representing rotations. For each give an advantage or disadvantage that it has over the other methods. 7b. [2 pts] OpenGL represents rotations in two ways. What are they? (Hint: What are the two ways you can tell OpenGL to do a rotation?) 5

8. [10 pts total] The Painter s Algorithm. 8a. [2 pts] What is the Painter s Algorithm? 8b. [2 pts] List two effects that the P.A. is useful for producing. 8c. [3 pts] The P.A. needs a preprocessing step. What are two ways this step can be performed? 8d. [3 pts] List some trade-offs of using the P.A. vs. using the Reverse P.A. 6

9. [8 pts total] Scene Graphs. 9a. [2 pts] One way to represent a scene is with a scene graph. What sorts of operations are made convenient by this representation? 9b. [3 pts] Briefly describe the trade-offs of storing a scene graph as a tree structure vs. storing it as a DAG. 9c. [3 pts] Consider a robot with a body and two legs, each of which has a movable foot. Draw a reasonable scene-graph representation for this robot. 7

10. [6 pts total] Shadow Volumes. 10a. [3 pts] Briefly describe the shadow-volumes technique for producing shadows. 10b. [3 pts] List some guidelines for when the S.V. method is a good one to use. 11. [5 pts total] Polynomial Curves. Suppose I want to use a polynomial to describe a curve. I want my curve to satisfy a list of constraints. 11a. [2 pts] How do I typically determine what degree the polynomial should be? 11b. [3 pts] How do I typically determine the coefficients of the polynomial? 8

12. [10 pts total] HSR Methods. 12a. [2 pts] Explain object-space vs. image-space HSR. 12b. [3 pts] Many traditional HSR methods (z-buffering, etc.) are rather inefficient when used with large, complex scenes. What needs to be done to improve efficiency for such scenes? 12c. [5 pts] Briefly describe a method that is efficient for some types of large, complex scenes. 9

13. [8 pts total] VR Programming. 13a. [4 pts] List some of the major services that VR libraries typically provide to application programs. 13b. [4 pts] List some ways in which a program written for a VR environment will differ significantly from a program written for a traditional desktop environment. (Think in terms of program organization and interactions with libraries and hardware. I am not interested so much in user-interface design issues here; save those for the problem 14.) 10

14. [10 pts total] VR User Interface. Many user-interface components/ideas cannot be moved unmodified from a desktop-style program to a VR program. 14a. [2 pts] Name one such user-interface component. 14b. [3 pts] Describe why desktop-style implementations of this can be inappropriate in VR. 14c. [5 pts] Describe a solution to this problem. How would you design/handle/implement this user-interface component in a VR environment? 11