In Line Clipping algorithm, the two dimensional space is divided into ___ regions.

Related MCQs

• Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the other line clipping algorithms?
• Generalised clipping algorithm deals with clipping against _____ line.
• Generalised clipping algorithm deals with clipping against _____ line.
• Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?
• In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is used as
• 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.