## Weiler-Atherton Polygon Clipping Algorithm

Weiler-Atherton Polygon Clipping Algorithm The problem encountered in clipping concave polygons in Sutherland-Hodgeman algorithm solved by Weiler-Atherton Polygon Clipping Algorithm. The basic idea in this algorithm is that instead of always proceeding around the polygon edges; as vertices processed, we may sometimes follow the window boundary. Whether to follow polygon boundary (edges) or clipping window… Read More »