Revision as of 19:20, 23 July 2015 edit Jmsarazee (talk \| contribs) 328 edits m →The Algorithm Tag: Visual edit ← Previous edit		Revision as of 19:23, 23 July 2015 edit undo Jmsarazee (talk \| contribs) 328 edits →The Algorithm Next edit →
Line 33: Points very close to the edge of the other polygon may be considered as both in and out until their status can be confirmed after all the intersections have been found and verified, however this increases the complexity. == Conclusion == Various strategies can be used to improve the speed of this labeling, and to avoid needing to proceed further. ==See also==

Weiler–Atherton clipping algorithm: Difference between revisions