Revision as of 04:32, 20 October 2008 edit 203.36.98.89 (talk) typo ← Previous edit		Revision as of 10:57, 6 May 2009 edit undo 91.187.30.17 (talk) →Pseudo Code: ComputeIntersection must return multiple intersections if there is any. Besides the algorithm above cannot identify the part of the poligon if it intersects the clipping plane twice. Next edit →
Line 36: '''Output''' and '''ComputeIntersection''' are functions that have not been implemented here for ease of readability (and they are not very complex). '''Output''' is generally some function or code that adds ~~a vertex~~vertices to an array. '''ComputeIntersection''' finds the intersection ~~point~~points of a line segment and a clip plane and returns that ~~value~~values (~~a vertex~~vertices) in order from S to P. ==See also==

Sutherland–Hodgman algorithm: Difference between revisions