Weiler-Atherton Algorithm - Two Dimensional Viewing and Clipping - Computer Graphics

TL;DR

The Violent Atherton Polygon Clipping Algorithm is an improvement over the Sutherland-Hodgman Algorithm and is used to accurately clip concave polygons by considering window boundaries.

Transcript

i welcome all the students today we have going to learn the point under unit number four and we have reached to the last point of the unit okay that is related to the polygon clipping algorithm in the last session we have learned the sudharlan hogman polygon clipping algorithm today we are going to learn the another algorithm which is used for the ... Read More

Key Insights

• 📋 The Violent Atherton Polygon Clipping Algorithm is an improvement over the Sutherland-Hodgman Algorithm for accurately clipping concave polygons.
• 🪟 The algorithm modifies the vertex processing procedures for window boundaries to ensure correct clipping.
• 🍵 It can also be extended to handle curved clipping and text clipping.
• 💠 The algorithm follows two rules for vertex processing, depending on whether the vertex pair is outside-inside or inside-outside.
• 🫥 The algorithm provides a solution to the drawback of the Sutherland-Hodgman Algorithm in displaying extra lines in concave polygons.
• 🫥 The Violent Atherton Algorithm can be applied to any polygon clipping region and is useful for visible surface identification in graphics packages.
• 📋 The algorithm can be further improved by applying constructive solid geometry ideas for clipping against arbitrary polygon clipping regions.

Summary & Key Takeaways

• The Violent Atherton Polygon Clipping Algorithm is an improvement over the Sutherland-Hodgman Algorithm for clipping concave polygons.

• The Sutherland-Hodgman Algorithm was not suitable for concave polygons as it displayed extra lines, whereas the Violent Atherton Algorithm provides accurate results.

• The algorithm modifies the vertex processing procedures for window boundaries to correctly display concave polygons.