The Weiler–Atherton is a polygon-clipping algorithm. It is used in areas like computer graphics and games development where clipping of polygons is needed...
4 KB (489 words) - 05:51, 4 July 2023
polygon clipping algorithms: Weiler–Atherton clipping algorithm Vatti clipping algorithm On the subject of clipping: Clipping (computer graphics) Clipping (in...
5 KB (609 words) - 10:26, 5 June 2024
polygons. Unlike the Sutherland–Hodgman and Weiler–Atherton polygon clipping algorithms, the Vatti algorithm does not restrict the types of polygons that...
3 KB (308 words) - 07:49, 2 March 2024
vertices to remove them. Vatti clipping algorithm Sutherland–Hodgman clipping algorithm Weiler–Atherton clipping algorithm Boolean operations on polygons...
4 KB (484 words) - 05:34, 13 August 2023
algorithms: Greiner–Hormann Sutherland–Hodgman Weiler–Atherton Vatti Rendering methodologies Painter's algorithm Boolean operations on polygons Bounding volume...
9 KB (949 words) - 19:38, 17 December 2023
Boolean operations on polygons (category Geometric algorithms)
Greiner–Hormann clipping algorithm Vatti clipping algorithm Sutherland–Hodgman algorithm (special case algorithm) Weiler–Atherton clipping algorithm (special...
7 KB (650 words) - 03:13, 31 July 2024
non-sequentially Clipping Line clipping Cohen–Sutherland Cyrus–Beck Fast-clipping Liang–Barsky Nicholl–Lee–Nicholl Polygon clipping Sutherland–Hodgman Vatti Weiler–Atherton...
71 KB (7,829 words) - 19:14, 31 October 2024