Sutherland-Hodgman Algorithm
Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the polygon under consideration along with any rectangular window, then we observe the coordinates of the polygon
vertices satisfies one of the four cases scheduled in the table shown below, and additionally it is to be noticed that this procedure of clipping can be simplified through clipping the polygon edgewise and not the polygon as an entire. This decomposes the bigger problem in a set of sub-problems that can be handled independently as per the cases listed in the table below. In fact this table explains the cases of the Sutherland-Hodgman Polygon Clipping algorithm.