determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying the rules

Related MCQs

• 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.
• Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). Whether a point at (5,50) is visible or not?
• Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). Whether a point at (75,90) is visible or not?
• A rectangular clipping window whose lower left corner is at (-3,1) and upper right corner is at (2,6). If line segment has end coordinates (-4,2) and (-1,7). What will the end coordinates of clipped line (use Cohen – Sutherland Outcode Algorithm)
• What will be the output set after clipping left and clipping right?
• In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the ? 
• If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be inside the clipping rectangle
• 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.
• What will be the input set for clipping left and clipping right respectively?