COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
6, 8
|
|
2, 4
|
|
4, 6
|
|
1, 3
|
Detailed explanation-1: -The outcode will have 4 bits for two-dimensional clipping, or 6 bits in the three-dimensional case. The first bit is set to 1 if the point is above the viewport.
Detailed explanation-2: -Each code is of 4 bits. If both endpoints of the line have end bits zero, then the line is considered to be visible.
Detailed explanation-3: -6. How many edges of the clipping are/is present in 2D? Explanation: If the algorithm is done in 2D, we have 4 edges of the clipping area.
Detailed explanation-4: -Correct choice is option B, Explanation-For a 2d transformation viewing, there are 2 ways a clipping algorithm can be applied.
Detailed explanation-5: -Answer: (c) 0110 Explanation: The 4-bit code of the bottom-right region amongst the nine regions divided by the Cohen-Sutherland algorithm is 0110.