Revision as of 03:01, 28 September 2018 edit 2409:4053:89a:4a53:6b75:87e9:e6dd:ef08 (talk) →Prelude Tags: Mobile edit Mobile web edit ← Previous edit		Revision as of 03:03, 28 September 2018 edit undo BLDM (talk \| contribs) Extended confirmed users 812 edits Undid revision 861528967 by 2409:4053:89A:4A53:6B75:87E9:E6DD:EF08 (talk) ...what? reverting good-faith edit Tag: Undo Next edit →
Line 9: * Candidate polygons need to be oriented clockwise. * Candidate polygons should not be self-intersecting (i.e., re-entrant). * The algorithm can support ~~oles~~holes (as ~~cter~~counter-clockwise polygons wholly inside their parent polygon), but requires additional algorithms to decide which polygons are holes, after which merging of the polygons can be performed using a variant of the algorithm. == The Algorithm ==

Weiler–Atherton clipping algorithm: Difference between revisions