POLYGON CLIPPING PROGRAM IN C | SUTHERLAND HODGEMAN ALGORITHM FOR POLYGON CLIPPING
POLYGON CLIPPING PROGRAM IN C | SUTHERLAND - HODGEMAN ALGORITHM FOR POLYGON CLIPPING In computer graphics, we have to study the Sutherland - Hodgeman polygon clipping algorithm. The algorithm according to the book by A. P. Godse is as follows: Algorithm:- Step 1- Read coordinates of all the vertices of polygon Step 2- Read coordinates of the clipping window Step 3- Consider the left edge of window Step 4- Compare the vertices of each edge of the polygon , individually with clipping plane. Step 5-Save the resulting intersections and vertices in the new list of vertices according to four possible ...