Sutherland-Hodgman Algorithm

Question

Illustrate briefly the Sutherland-Hodgman Algorithm?

Answer 1

Any polygon of any arbitrary shape can be illustrated with the assist of some set of vertices connected with it. When we strive to clip the polygon under consideration by any rectangular window, then, we observe that the coordinates of the polygon vertices satisfies one of the four cases and further it is to be noted that this method of clipping can be simplified by the clipping the polygon edgewise and not the polygon as a entire. This decomposes the bigger problem into a set of sub problems that can be handled individually as per the four cases.