Revision as of 03:15, 24 December 2014 edit 191.190.149.224 (talk) No edit summary ← Previous edit		Revision as of 23:13, 22 January 2015 edit undo 87.153.252.245 (talk) →Description Next edit →
Line 8: [[image:Sutherland-Hodgman clipping sample.svg\|center\|frame\|All steps of clipping concave polygon 'W' by 5-sided convex polygon]] The [[Weiler–Atherton]] algorithm overcomes this by returning a set of divided polygons, but is more complex and computationally more expensive, so Sutherland–Hodgman is used for many rendering applications. Sutherland–Hodgman can also be extended into 3D space by clipping the polygon paths based on the boundaries of planes defined by the viewing space. ==Pseudo code==

Sutherland–Hodgman algorithm: Difference between revisions