The Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.

How is polygon clipping done using Sutherland Hodgman algorithm?

It is performed by processing the boundary of polygon against each window corner or edge. First of all entire polygon is clipped against one edge, then resulting polygon is considered, then the polygon is considered against the second edge, so on for all four edges.

Which polygon are correctly clipped by Sutherland Hodgman clipping algorithm?

Once all vertices have been processed for one clip window boundary, the output list of vertices is clipped against the next window boundary. Convex polygons are correctly clipped by the Sutherland-Hodgeman algorithm, but concave polygons may be displayed with extraneous lines, as demonstrated in Fig.