Revision as of 12:12, 3 April 2019 edit 202.83.103.90 (talk) →Pseudo code: ?????? ← Previous edit		Revision as of 12:12, 3 April 2019 edit undo 202.83.103.90 (talk) →Pseudo code Next edit →
Line 22: for(int i = 0 ; i < inputList.count ; i += 1) do Point current_point = inputList[i]; Point prev_point = inputList[(i + inputList.count - 1) % inputList.count]; Point Intersecting_point = ComputeIntersection(prev_point,current_point,clipEdge)

Sutherland–Hodgman algorithm: Difference between revisions