Revision as of 20:59, 30 March 2010 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits m moved Sutherland-Hodgman clipping algorithm to Sutherland–Hodgman algorithm ← Previous edit		Revision as of 20:59, 30 March 2010 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits →Pseudo Code: fixed this incorrect capital per WP:MOS Next edit →
Line 10: 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~~code== Given a list of edges in a clip polygon, and a list of vertices in a subject polygon, the following procedure clips the subject polygon against the clip polygon.

Sutherland–Hodgman algorithm: Difference between revisions