Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 11:28, 20 March 2019

Revision as of 11:29, 20 March 2019

Line 23:

Point current_point = inputList[i];

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

Point Intersecting_point = ComputeIntersection(prev_point,current_point,clipEdge)

if (current_point inside clipEdge) then

if (prev_point not inside clipEdge) then

outputList.add(ComputeIntersection(prev_point,current_point,clipEdge)Intersecting_point);

end if

outputList.add(current_point);

else if (prev_point inside clipEdge) then

outputList.add(ComputeIntersection(prev_point,current_point,clipEdge)Intersecting_point);

end if