Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 10:54, 20 March 2019

Revision as of 10:59, 20 March 2019

Line 26:

outputList.add(ComputeIntersection(last_point,current_point,clipEdge));

end if

outputList.add(pointcurrent_point);

else if (last_point inside clipEdge) then

outputList.add(ComputeIntersection(last_point,current_point,clipEdge));