Question

Explain Weiler and Atherton polygon clipping algorithm? This algorithm is better or not than Sutherland Hodgeman polygon clipping algorithm give your answer?

Answer 1

Weiler-Atherton clipping algorithm:

• The Weiler–Atherton is generally a polygon-clipping algorithm. It is applied in areas such as computer graphics and game expansion where clipping of polygons is required.  
• It lets clipping of a subject or applicant polygon by a randomly shaped clipping polygon/area/region.
• Different from Sutherland – Hodgman polygon clipping algorithm, the Weiler-Atherton clipping algorithm can clip concave polygons without leaving any remainder behind.

Hope it helped...