The Weiler-Atherton algorithm is a polygon-clipping algorithm used in computer graphics and game development wherever a subject or candidate polygon needs to be clipped against an arbitrarily shaped clipping polygon, area or region. It is generally applied in two dimensions, though it can be extended to three dimensions through visible surface determination and improved efficiency by Z-ordering.
Connections
In Field
Source Weiler-Atherton clipping algorithm (Wikipedia)
Sources
Weiler-Atherton clipping algorithm (Wikipedia)
In Group: Line Drawing and Clipping Algorithms, Lead
The Weiler-Atherton is a polygon-clipping algorithm.
In Field: Computer Graphics, Lead
It is used in areas like computer graphics and games development where clipping of polygons is needed.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.