Computer Graphics207910 marksNumerical: polygon clipping algorithmClipping
Write the algorithm for Cohen-Sutherland Line clipping. Clip the polygon A(100,150), B(200,250) and C(300,200) with the clipping window defined by the coordinates (100,300), (300,300) and (200,100) using Sutherland Hodgeman Polygon Clipping algorithm.
Write the algorithm for Cohen-Sutherland Line clipping. Clip the polygon A(100,150), B(200,250) and C(300,200) with the clipping window defined by the coordinates (100,300), (300,300) and (200,100) using Sutherland Hodgeman Polygon Clipping algorithm.[10]
Polygon vertices: - $A(100, 150)$ - $B(200, 250)$ - $C(300, 200)$ Clipping window (triangular) vertices: - $W1(100, 300)$ - $W2(300, 300)$ - $W3(200, 100)$ Task: State Cohen-Sutherland line clipping algorithm; clip triangle ABC against triangular window using Sutherland-Hodgeman. --- The clipping...