Student: meeroh
Assignment: 2
Grader: Damian

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

Bresenham:

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

Cohen-Sutherland:

program runs, buggy (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 Algorithm:
Works correctly and efficiently. I appreciate the hack to make it look 
EXACTLY what the reference solution does.

The only thing: your life would have been made a lot
easier if you had just included a running accumulated error, as the classic algorithm does. There are a couple of equations you use which seem a little hairy, and which would have been made much simpler. Also, you compute both eE and error eNE, where you might have exploited the fact that

eNe + eE = 2*dx;

Also (and this is just for efficiency) declared variable dx and dy outside
your main loop.

Cohen Sutherland:
A good, correct implementation. Good job.



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