



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
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
The cs184 midterm 1 exam from the university of california, berkeley, in the fall of 1997. The exam covers topics in hardware and scan conversion, transformations, hierarchies and change of bases, and projection. Students are required to answer various questions related to these topics, including deriving expressions, finding transformations, and projecting points onto a plane.
Typology: Exams
1 / 6
This page cannot be seen from the preview
Don't miss anything!
Fall 1997 Foundations of Computer Graphics Professor Brian A. Barsky and Adrian Sfarti October 9, 1997 CS184 T.A.'s: Lilian Chu, Dan Garcia and Aaron Isaksen
Relax. You have 80 minutes. Remember to pace yourself. Feel free to use the back of each page for additional answer space. Note that not all questions have equal value. Do not panic.
(write any comments about the exam here)
How well do you believe you did? (Circle the appropriate picture which represents your perceived midterm rank)
Question Possible Your Score
Total 100
Question 1: Hardware and Scan Conversion (15 points)
The diagram shown above shows a colormap system with a N bit deep W wide and H high framebuffer, digital-to-analog converters (DAC) for red, green and blue which are A, B and C bits wide respectively, and a screen with S triads wide and T triads high. Using the variables above (and assuming nothing about N, W, H, A, B, C, S or T - the diagram above is not to scale), derive an expression for:
1.1) ...the # of pixels on the screen. [1 pt] 1.2) ...the # of colors that could ever land on pixel p over time. [2 pts] 1.3) ...the # of possible colors on the screen at once. [2 pts]
1.4) Up to now, you have always been given a sample point (and two tie-breaking directions) and asked to render polygon primitives. Here we give you the polygon primitives and rendered pixels and ask you to figure out the sample point and two tie-breaking directions. The sample point lies on the edge of the polygon. Hint: The tie-breaking driections do not necessarily have to be horizontal or vertical. [10 pts]
Question 1: Hardware and Scan Conversion (15 points) 2
This diagram show how the upper triangle can be instanced five times to form the middle group G1 (G1left, G1top and G1right) and part of the bottom group G2 (G2top and G2right). G1 can be instanced once to help form the bottom group G2 (component G2left). Coordinates refer to the verices of the subtending triangle.
3.1) Find the 6 transformations labeled M 1 thorugh M 6 in the diagram above. You do NOT need to create the matices for the transformations, you can just write them as products of row vector transformations Scale(sx, sy), Translate(tx, ty), Rotate(theta), Shearx(a) or Sheary(b) with appropriate arguments. [6 pts] 3.2) Draw the hierarchy tree, labeling the branches with the appropriate concatenated row-vector transformations M 1 through M 6. Show the state of the stack entering each node. [15 pts] Captain Matrix takes your ordinary X, Y, and Z axes, rotates them about the origin in some unknown way until he obtains three new axes, a, b, and c , such that a used to be X, b used to be Y , and c used to be Z. He then politely gives you the change of basis matrix such that the expression to the right holds: 3.3) What are the numerical values of e, f, g, and h? [4 pts]
Answer 3: Hierarchies and Changes of Bases
M 1 =M (delta->G1left)= M 2 =M delta->G1top)= M 3 =M (delta->G1right)= M 4 =M (G1->G2left)=
Question 3: Hierarchies and Change of Bases (25 points) 4
M 5 =M (delta->G2top)= M 6 =M (delta->G2right)= 3.2) 3.3) e= f= g= h=
Question 4: Projection (35 points)
Your hovercraft floats above your lake as in assignment 4. Here you decide to place the center of projection (designated by the eye in the diagram below) on the hovercraft (not shown) itself. There is NO clipping. Your projection and geometry parameters:
4.1) Project A, B and D onto the projection plane diagram z=5 shown on the bottom left on the previous page. We've already projected C for you. Then copy your answer to the right diagram (you'll use one diagram for the answer to 4.6 and one for the answer to 4.7 below). [3 pts] 4.2) Write down the row-vector notation tranformation matrix (you may express it as a single 4x4 matrix or as a composition of 4x4 matrices) that, after homogeneous division, has the effect of projecting ABCD onto the projection plane z=5. HINT: You may wish to verify it with point C whose coordinates are given before and after projection. 4.3) Assuming ABCD was the bottom face of a cube, what classification of projection is this? List the entire hierarchy (E.G., planar-parallel-orthographic-axonometric-trimetric) [3 pts] 4.4) How many vanishing points are there with this projection? [2 pts] 4.5) Where are the vanishing points? [4 pts]
Answer 3: Hierarchies and Changes of Bases 5