Revision as of 17:54, 30 August 2021 edit BBasuchan (talk \| contribs) 4 edits No edit summary ← Previous edit		Revision as of 22:52, 11 September 2021 edit undo Mhdadk (talk \| contribs) 22 edits No edit summary Next edit →
Line 42: ''ComputeIntersection'' is a function, omitted here for clarity, which returns the intersection of a line segment and an infinite edge. Note that it is only called if such an intersection is known to exist, and hence can simply treat both lines as being infinitely long. ==Implementations== A Python implementation of the Sutherland-Hodgman can be found [https://github.com/mdabdk/sutherland-hodgman here]. ==See also==

Sutherland–Hodgman algorithm: Difference between revisions