[Solved] According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

Q.	According to Cohen-Sutherland algorithm, a line is completely outside the window if ............
A.	the region codes of line endpoints have a \1\ in same bit position.
B.	the endpoints region code are nonzero values
C.	if l bit and r bit are nonzero.
D.	the region codes of line endpoints have a \0\ in same bit position.
Answer» A. the region codes of line endpoints have a \1\ in same bit position.

935

Do you find this helpful?

View all MCQs in

Computer Graphics

Discussion

No comments yet

Related MCQs

In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). A line has end coordinates as (50,5) and (150,50). The given line segment is ___________. Use Cohen – Sutherland Outcode Algorithm.
Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (200,200). A line has end coordinates as (5,50) and (75,90). The given line segment is ___________. Use Cohen – Sutherland Outcode Algorithm.
Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (200,200). A line has end coordinates as (25,50) and (175,190). The given line segment is ___________. Use Cohen – Sutherland Outcode Algorithm.
A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates (40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.
A clipping window has coordinates as A (50, 10), B (80, 10), C (80, 40), D (50, 40). A line segment has end coordinates (70, 20) and (1, 10). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.
Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left corner at (-8, -4) and upper right corner at ( 12,8). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.