Page 122 - DCAP313_LAB_ON_COMPUTER_GRAPHICS

Lab on Computer Graphics

Notes • Warnock(PL in VP3, VP3)
• Warnock(PL in VP4, VP4)

end

What does “simple” mean?
• No more than one polygon in viewport
• Scan convert polygon clipped to viewport
• Viewport only 1 pixel in size

• Shade pixel based on closest polygon in the pixel

Figure 7.3: Warnock’s Algorithm

• Runtime: O (p*n)
○ p: number of pixels
○ n: number of polygons
The Warnock algorithm for hidden surface determination in computer graphics
was invented by John Edward Warnock in 1969 in his doctoral thesis.
Self Assessment Questions

6. The process of hidden surface determination is sometimes called hiding, and such an
algorithm is sometimes called ………….
7. A set of pixels representing the ……………….. of the scene in the fixed given resolution,
without any option to scale the scene.

8. ……………. have an obtuse angle with the projection direction; and the reverse ones have
an acute angle with the projection direction.

9. A conjunction between two near polygons, called …………..
10. A conjunction of two reverse polygons, called ……………

116 LOVELY PROFESSIONAL UNIVERSITY