Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 01:48, 28 March 2019

Revision as of 12:12, 3 April 2019

Line 22:

for(int i = 0 ; i < inputList.count ; i += 1) do

Point current_point = inputList[i];

Point prev_point = inputList[((i % inputList.count) + inputList.count1) % inputList.count];

Point Intersecting_point = ComputeIntersection(prev_point,current_point,clipEdge)