Explain Sutherland Hodgeman polygon clipping ?

• Clipping polygon which lies inside the clipping window
• Four possible cases

If the first vertex is outside the window boundary and the second vertex inside
If the first vertex is inside the window boundary and the second vertex outside
If both are outside
If both are inside

• Repeat the process of algorithm
• Convex polygon are correctly clipped using this clipping
• Concave and convex polygon are also used