Spring 2001 CS184 Midterm 01
Problem 1 [1 point]
Did you write your name on the front of this exam?
Problem 2 [5 points]
When performing perspective projection, which sets of parallel lines will NOT have a banishing point?
Problem 3 [9 points]
Given a frame buffer system with 10 bit planes, and a 1024 entry look up table (palette), with 30 bits for each
entry (10 for each red, green, blue) answer the following:
(a) [3 points] How many bits should we have for each DAC (red, green and blue)?
(b) [3 points] How many colors will be simultaneously viewable on the screen (assuming 1024 x 1024
resolution)?
(c) [3 points] How many colors can be displayed (not necessarily at once)?
Problem 4 [18 points]
Line clipping.
(a) [6 points] Describe two trivial rejection cases for the Liang-Barsky line-clipping algorithm.
(b) [6 points] Show one example of a line segment that is trivially rejected by Liang-Barsky, that is not
trivially rejected by Cohen-Sutherland. Briefly explain.
(c) [6 points] Show one example of a line segment that is trivially rejected by Cohen-Sutherland that is not
trivially rejected by Liang-Barsky.
Problem 5 [14 points]
CS184, Midterm 1, Spring 2001
1
