School of Computer and Information Sciences
University of Hyderabad
Computer Graphics and Visualization – Major – Part A
Date: 10 Jul. 2021
Max. Marks: 25
Note: Each question carries five marks.
1. Under what conditions will Warnock’s algorithm be superior to z-buffer algorithm?
2. Given that a line extends from (2, 3) to (10, 6), give the pixels that are chosen by the
midpoint line drawing algorithm. Trace every step of the algorithm clearly.
3. How does the polygon filling algorithm exploit edge, span and scanline coherence? Explain with an example not in the textbook.
4. For clipping a polygon against a clip rectangle, can we use the line clipping algorithms
on each of the edges of the given polygon and use these to form the new vertices of the
clipped polygon? Explain with an example.
5. Given the ray tree shown in Fig. 1, explain what this means, i.e., how many objects
you can infer from the tree, what the characteristics of the objects are and how the rays
are emanating from which object and hitting which object.
Viewpoint
L1
R1
L2
R2
T2
L3
R3
T3
R4
L4
T4
Figure 1: Recursive Ray Tree
******************** ALL THE BEST ********************
1