Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 19:06, 5 July 2009

Revision as of 03:25, 25 November 2009

Line 1:

'''Weiler-Atherton''' [[Clipping (computer graphics)|clipping]] algorithm used in [[computer graphics]].

It allows clipping of a ''subject polygon'' by an arbitrarily shaped ''clip polygon''. 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| Z-ordering]]. <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 ==

Line 26:

==See also==

*[[Sutherland-Hodgman clipping algorithm]]

== References ==

{{Reflist}}

* [http://www.cs.drexel.edu/~david/Classes/CS430/HWs/p214-weiler.pdf Hidden Surface Removal using Polygon Area Sorting - Kevin Weiler and Peter Atherton]