Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 03:00, 3 May 2015

Revision as of 18:33, 23 July 2015

Line 1:

The '''Weiler–Atherton''' is a polygon [[Clipping (computer graphics)|clipping]] [[algorithm]]'''. It is used in the areas like [[computer graphics]], games development and others where clipping of polygon is needed. It allows clipping of a ''subject or candidate polygon'' by an arbitrarily shaped ''clip polygon''.

It allows clipping of a ''subject polygon'' by an arbitrarily shaped ''clip polygon'' window. It is generally applicable only in [[2D computer graphics|2D]]. However, it can be used in [[3D computer graphics|3D]] through visible surface determination and with improved efficiency through [[Z-order]]ing.<ref>Foley, James, Andries van Dam, Steven Feiner, and John Hughes. "Computer Graphics: Principle and Practice". Addison-Wesley Publishing Company. Reading, Massachusetts: 1987. pages 689-693</ref>

== Description ==