Revision as of 05:37, 30 March 2017 edit 211.121.168.82 (talk) →Prelude: English corrections ← Previous edit		Revision as of 05:48, 30 March 2017 edit undo 211.121.168.82 (talk) →Conclusion: Grammatical correction Next edit →
Line 31: Some polygon combinations may be difficult to resolve, especially when holes are allowed. 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. Various strategies can be used to improve the speed of this labeling, and to avoid needing to proceed further. Care will be needed where the polygons share an edge.

Weiler–Atherton clipping algorithm: Difference between revisions