Student: snoeren
Assignment: 2
Grader: Damian

************************************************

Bresenham:

program runs (55):				55
correct implementation of Bresenham (20):	20
no floats and divides (20):			20
extra credit (5):				5
----------------------------------------------
total (100):					100

Cohen-Sutherland:

program runs (55):				55
inside case correct (10):			10
outside case correct (10):			10
one clip correct (10):				10
two clips correct (10):				10
extra credit (5):				5
----------------------------------------------
total (100):					100


Comments:
----------------------------------------------

Bresenham:
Beautiful! Oh, the joys of concise code! Halelujah!

Cohen-Sutherland:
Nice implementation. The recursive version might be faster in some
cases, since it can detect trivial accept/rejects between boundary
tests (i.e. clip against left boundary, for example, test again and
immediately find that you have a trivial accept, without going through
and testing either point against the rest of the boundaries).


*************************************************