Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 12:25, 9 February 2011

Revision as of 15:23, 1 April 2011

Line 17:

for (Edge clipEdge in clipPolygon) do

List inputList = outputList;

Point S = outputList.clear()last;

for (Point SE in =outputList) inputList.last;do

for (Point E in inputList) do

if (E inside clipEdge) then

if (S not inside clipEdge) then

outputListintputList.add(ComputeIntersection(S,E,clipEdge));

end if

outputListinputList.add(E);

else if (S inside clipEdge) then

outputList.add(ComputeIntersection(S,E,clipEdge));