

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Exam; Professor: Varshney; Class: Computer Graphics; Subject: Computer Science; University: University of Maryland; Term: Unknown 1989;
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Time Limit: 75 minutes, Maximum Marks: 60 Open book, open notes
Note: This exam has three pages. Please make sure you have all of them. If the meaning of a question is doubtful, state a meaningful, non-trivial assumption and proceed. Advice: To maximize partial credit, divide your time as per the minutes shown. Point value of each question equals its recommended time value in minutes.
Important: This is just a sample midterm. The real midterm will have more questions to ensure a better coverage of topics that we have covered in the class. This paper has questions worth 45 minutes instead of the target 60 minutes. The general level of difficulty will be approximately what you see here.
Q.1 [ 6 × 5 = 30 minutes] (i) List two components of the graphics pipeline that are typically carried out in fixed-point arithmetic and two that are typically computed in floating-point arithmetic.
(ii) Interactivity in 3D graphics has been defined as 20 - 30 frames per second. Where does this number come from? (a) CRT and LCD refresh rate frequencies, (b) Rate at which graphics cards can display 1 million triangles per frame, (c) Both of the above, (d) None of the above.
(iii) Consider a line segment that starts from (0, 1) and ends at (2, 4). Its equation is given by 3x − 2 y + 2 = 0. I decide to verify the Bresenham’s line drawing algorithm on this line. Using the slides in Lecture 3, I set F (x, y) = ax + by + c = 3x − 2 y + 2 and initialize D = 2F (0, 1) + 2a + b = 4. Since D > 0, I select the East pixel and set D = D + 6 = 10.
Since D > 0, I again select the East pixel and the new value of D becomes D = D + 6 = 16. By now I am beginning to realize that if I continue this D will be always positive and I will be always selecting the East pixel. Clearly I am making a mistake somewhere; the line joining (0, 1) and (2, 4) shouldn’t be a horizontal line. What is the mistake?
(iv) Give two reasons why it is a good idea to avoid scan-converting common edges of adjacent polygons twice (once while scan-converting each polygon).
(v) State the transformations, their values (say rotation by x axis by 45o), and their or- der that the following aggregate matrix in homogeneous coordinates represents? (multiple correct answers are possible, give any one answer).
(vi) Immediate-mode libraries such as OpenGL do not store the graphics datasets in their internal data-structures (with the exception of display lists that we shall ignore for the mo- ment) and therefore cannot perform optimizations that retained-mode libraries can perform. List any two such optimizations that can benefit faster rendering for retained-mode libraries. Assume that the dataset and lights are fixed, only the viewer position is changing from frame to frame.