CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks)

Similar documents
CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination

3D Polygon Rendering. Many applications use rendering of 3D polygons with direct illumination

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

The University of Calgary

CS452/552; EE465/505. Clipping & Scan Conversion

Hidden-Surface Removal.

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

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

(a) rotating 45 0 about the origin and then translating in the direction of vector I by 4 units and (b) translating and then rotation.

CS 184, Fall 1996 Midterm #1 Professor: unknown

CS 112 The Rendering Pipeline. Slide 1

Institutionen för systemteknik

Triangle Rasterization

Today. CS-184: Computer Graphics. Lecture #10: Clipping and Hidden Surfaces. Clipping. Hidden Surface Removal

Image Precision Silhouette Edges

3D Graphics Pipeline II Clipping. Instructor Stephen J. Guy

3D Rendering Pipeline (for direct illumination)

CHAPTER 1 Graphics Systems and Models 3

Computer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL

QUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION

Notes on Assignment. Notes on Assignment. Notes on Assignment. Notes on Assignment

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

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Overview. Pipeline implementation I. Overview. Required Tasks. Preliminaries Clipping. Hidden Surface removal

CS 184, Fall 1996 Midterm #1 Professor: unknown

4.5 VISIBLE SURFACE DETECTION METHODES

SAZ4C COMPUTER GRAPHICS. Unit : 1-5. SAZ4C Computer Graphics

Graphics and Interaction Rendering pipeline & object modelling


CS4620/5620: Lecture 14 Pipeline

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

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

RASTERISED RENDERING

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

Topics. From vertices to fragments

EXAMINATIONS 2017 TRIMESTER 2

Aptitude Test Question

Course Title: Computer Graphics Course no: CSC209

Part 3: 2D Transformation

Clipping. Angel and Shreiner: Interactive Computer Graphics 7E Addison-Wesley 2015

CS2401 COMPUTER GRAPHICS ANNA UNIV QUESTION BANK

Renderer Implementation: Basics and Clipping. Overview. Preliminaries. David Carr Virtual Environments, Fundamentals Spring 2005

Lecture 4. Viewing, Projection and Viewport Transformations

CSE528 Computer Graphics: Theory, Algorithms, and Applications

Computer Graphics. - Clipping - Philipp Slusallek & Stefan Lemme

Hidden surface removal. Computer Graphics

2D Viewing. Viewing Pipeline: Window-Viewport Transf.

CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo)

Two basic types: image-precision and object-precision. Image-precision For each pixel, determine which object is visable Requires np operations

CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK

(Refer Slide Time 03:00)

End-Term Examination

Clipping and Scan Conversion

CSE328 Fundamentals of Computer Graphics

Last class. A vertex (w x, w y, w z, w) - clipping is in the - windowing and viewport normalized view volume if: - scan conversion/ rasterization

Werner Purgathofer

EXAMINATIONS 2016 TRIMESTER 2

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

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

Chapter 8: Implementation- Clipping and Rasterization

Module 6: Pinhole camera model Lecture 32: Coordinate system conversion, Changing the image/world coordinate system

Clipping and Intersection

CS Exam 1 Review Problems Fall 2017

Computer Science Computer Graphics. Fall Midterm Exam

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

9. Visible-Surface Detection Methods

CS451Real-time Rendering Pipeline

FROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU

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

Two-Dimensional Viewing. Chapter 6

Realtime 3D Computer Graphics Virtual Reality

Page 1. Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms

Perspective Mappings. Contents

Sung-Eui Yoon ( 윤성의 )

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

Reading. 18. Projections and Z-buffers. Required: Watt, Section , 6.3, 6.6 (esp. intro and subsections 1, 4, and 8 10), Further reading:

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

Computer Science 474 Spring 2010 Viewing Transformation

Computer Graphics II

Graphics Pipeline 2D Geometric Transformations

CMSC 435/634: Introduction to Graphics

Graphics for VEs. Ruth Aylett

Graphics Hardware and Display Devices

CS 4620 Midterm 1. Tuesday 22 October minutes

KRISTU JYOTI COLLEGE OF MANAGEMENT & TECHNOLOGY QUESTION BANK BCA SEMESTER III Computer graphics Part A (2 marks questions)

CS488. Implementation of projections. Luc RENAMBOT

INFOGR Computer Graphics. J. Bikker - April-July Lecture 11: Visibility. Welcome!

Rasterization. COMP 575/770 Spring 2013

CS602 MCQ,s for midterm paper with reference solved by Shahid

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

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

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

From Vertices To Fragments-1

Visible Surface Detection. (Chapt. 15 in FVD, Chapt. 13 in Hearn & Baker)

Game Architecture. 2/19/16: Rasterization

CSCI 4620/8626. Computer Graphics Clipping Algorithms (Chapter 8-5 )

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

Identifying those parts of a scene that are visible from a chosen viewing position, and only process (scan convert) those parts

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

Fondamenti di Grafica 3D The Rasterization Pipeline.

Transcription:

CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks) Cameras and Perspective Figure 1: A perspective view of a polyhedron on an infinite plane. Rendering in a perspective camera requires rotating and translating from world coordinates to camera coordinates (sometimes called the viewing transformation) and then transforming the frustrum to a canonical form (call this transformation the view mapping transformation). 1. Which camera parameters are required to determine the viewing transformation (3)? 2. Which camera parameters are required to determine the view mapping transformation (i.e. from camera coordinates to the canonical frustrum) (3)? 3. Give one advantage and one disadvantage of clipping in homogenous coordinates (2). file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (1 of 9)1/27/2007 5:24:06 PM

4. Figure 1 shows a perspective view of a world containing a polyhedron on an infinite plane. The polyhedron contains two lines that are visible, parallel and parallel to the plane. Mark them, explaining your reasons. (4) Figure 2: Polygon clipping question: the dashed rectangles are the clip regions, which are traversed in the order shown by numbers next to each edge. The polygons are traversed in the order given by the two marked vertices. Clipping Each of the polygons given in figure 2 is clipped using Sutherland-Hodgeman polygon clipping against the triangle shown: the vertices of the polygon are traversed in the order show, and the polygon is clipped against the edges of the square in the order show. Supply a drawing of the results - there is space in the figure -, with vertices marked to indicate the order in which they are produced (9). Figure 3 shows a square clip boundary with a single vertex. Nicholls-Lee-Nicholls line clipping is efficient, because it does a case by case analysis of the edges against which a line must be clipped. Given that one vertex of the line is the one shown, draw on top of the figure the clipping cases that would occur for the other vertex (5). Give: 1. the maximum number of vertices obtained by clipping an n-vertex convex polygon using Sutherland- Hodgeman against an m-vertex convex polygon in the plane (3) : 2. one reason Sutherland-Hodgeman polygon clipping fails for clipping a general polygon against a file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (2 of 9)1/27/2007 5:24:06 PM

general polygon (1): 3. one reason parametric line clipping is more efficient than Cohen Sutherland line clipping (1): 4. one disadvantage of Nicholls-Lee-Nicholls line clipping (1): Figure 3: Nicholls-Lee-Nicholls line clipping; vertex 1 is the cross. Figure 4: Polygons for the scan conversion question. file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (3 of 9)1/27/2007 5:24:06 PM

Polygon scan conversion 1. For polygons C and D in figure 4, fill in the pixels that lie inside the polygon, using the convention used in class (4). 2. For polygon A in figure 4, show the edge table (4): 3. For each of the four scanlines drawn in the figure on polygon A, show the state of the active edge list immediately before the pixels on that scanline are filled (8) : file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (4 of 9)1/27/2007 5:24:06 PM

Visibility and Z-buffers Figure 5: Polygons for the visibility question Figure 5 shows a 30 pixel frame buffer, which has a 2 bit z-buffer. The z-value used for a pixel is the z-value at the center point which is truncated to be either 0, 1, 2, or 3. (i.e. z73 becomes z = 3.) The center point is also used (as in class) to decide whether a pixel lies inside a polygon. All polygon vertices lie on the center of their pixels. The z-buffer algorithm here is eccentric: if a new pixel has the same z-value as an existing pixel, the two are averaged. In the figure polygon B is black, polygon W is white and polygon R is red. For each figure, mark the pixels that are pink (i.e. where W and R is averaged. (14) the "Painters algorithm" sorts polygons by the depth of their center of gravity, and draws the furthest polygon first. Sketch one example where this algorithm fails. file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (5 of 9)1/27/2007 5:24:06 PM

Name one advantage and one disadvantage (other than difficulties with quantization!) of Z-buffers (2) Figure 6: A model hierarchy; the top figure shows the definitions for a wheel and a body. On the right are renderings for u=0, v=0 and u=180, v=2. Draw the result of rendering for u=90, v=1 in the space provided: u is in degrees file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (6 of 9)1/27/2007 5:24:06 PM

Hierarchies Figure 6 shows a hierarchical model; fill in the details requested in the caption (4) Figure 7 shows a hierarchical model; fill in the details requested in the caption (9) Figure 7: A model hierarchy; the top figure shows the definitions for a wheel and a body. On the right are renderings for u=0, v=0 and u=180, v=2. Draw the result of rendering for u=90, v=1 in the space provided: u is in degrees file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (7 of 9)1/27/2007 5:24:06 PM

Rotations In figure 8, fill in the appearance of the box as rotated by the amount given in the figures (6) In figure 9, fill in the appearance of the box as rotated by the amount given in the figures (6) What is curious about the case shown in figure 8? (2) Show that any rotation matrix in 3D is orthogonal - i.e. that R T R = Identity. (7) Figure 8: The left hand figure shows a box; the numbers are the lengths of the side of the box. On the right hand are two sets of axes, for you to draw different rotations of the box. In this figure, R(x,180) means rotation about the x axis by 180 degrees. Fill in the two cases. You do not need to draw the box to scale, but you do need to fill in the lengths of the edges. file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (8 of 9)1/27/2007 5:24:06 PM

Figure 9: The left hand figure shows a box; the numbers are the lengths of the side of the box. On the right hand are two sets of axes, for you to draw different rotations of the box. In this figure, R(x,90) means rotation about the x axis by 90 degrees. Fill in the two cases. You do not need to draw the box to scale, but you do need to fill in the lengths of the edges. file:///c /Documents%20and%20Settings/Jason%20Rafte...Spring%201997%20-%20Forsythe%20-%20Final%20Exam.htm (9 of 9)1/27/2007 5:24:06 PM