NPTEL Computer Graphics Week 6 Assignment Answers 2024
1. In the Cohen-Sutherland algorithm, how many bit codes are used to represent a region?
a. 2-bit
b. 4-bit
c. 8-bit
d. 16-bit
Answer :- For Answers Click Here
2. Match the following.
I. Line A. Sutherland-Hodgeman algorithm
II. Convex fill-area B. Cohen-Sutherland algorithm
III. Convex and concave fill-area C. Weiler-Atherton Algorithm
a. I-A, II-B, III-C
b. I-B, II-A, III-C
c. I-C, II-B, III-A
d. I-A, II-C, III-B
Answer :- For Answers Click Here
3. Cohen-Sutherland line clipping algorithm in 3D divides the view coordinate space into _ coded regions.
a. 4
b. 9
c. 16
d. 27
Answer :- For Answers Click Here
4. ‘Back Face Elimination’ is required for ________.
a. hidden surface removal
b. fill-area clipping
c. both hidden surface removal and fill-area clipping
d. none of the above
Answer :-
5. HSR method broadly of TWO types: ________space method and image space method
a. unhidden
b. plane
c. hidden
d. object
Answer :-
6. The Z-buffer method can be used on transparent surfaces for hidden surface removal.
a. True
b. False
Answer :- For Answers Click Here
7. Coherence properties in hidden surface removal include:
a. Object coherence
b. Depth coherence
c. Texture coherence
d. Frame coherence
Answer :-
8. Depth Sorting (Painter’s) algorithm works at
a. image space
b. object space
c. both image and object spaces
d. neither image space not object space
Answer :-
9. Warnock’s Algorithm is a _____________ method. clipping area subdivision
a. clipping
b. area subdivision
Answer :-
10. In Warnock’s Algorithm, if the current square region does not contain any surface, we assign the background color.
a. True
b. False
Answer :- For Answers Click Here