COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
8
|
|
|
6
|
|
|
7
|
|
|
9
|
Detailed explanation-1: -2. The Cohen-Sutherland algorithm divides the region into number of spaces. Explanation: The Cohen-Sutherland algorithm divides a two-dimensional space into 9 regions and then efficiently determines the lines and portions of lines that are visible. The portions are visible in the central region of interest.
Detailed explanation-2: -Explanation: The 4-bit code of the bottom-right region amongst the nine regions divided by the Cohen-Sutherland algorithm is 0110.
Detailed explanation-3: -Region code of (5, 1) and (25, 30) respectively in cohen sutherland line clipping algorithm is: 0000, 1010 None 1001, 1010 0001, 1010.
Detailed explanation-4: -Cohen Sutherland uses region code to clip a portion of the line which is not present in the visible region. It divides a region into 9 columns based on (X MAX, Y MAX) and (X MIN, Y MIN).
Detailed explanation-5: -Cohen-Sutherland Line Clippings: We will use 4-bits to divide the entire region. These 4 bits represent the Top, Bottom, Right, and Left of the region as shown in the following figure. Here, the TOP and LEFT bit is set to 1 because it is the TOP-LEFT corner.