In the 2009 exam they asked to give a explanation on the Cohen-Sutherland line clipping algorithm which is on page 331(2006) in our prescribed book. I found the

Wikipedia article on Cohen-Sutherland line clipping algorithm very interesting because it gave a c/c++ implementation. Also note the memorandum does not have the not equal(=/=) sign in its description, just nice little blanks so use the prescribed book.

In 2010 they asked to describe the Liang-Barsky algorithm, so I'm also getting suspicious and I do believe we will have to describe at least one of the algorithms in Chapter 7. a quick scanned through Chapter 7 return the following three:

Cohen-Sutherland (page 331)

Liang-Barsky (page 333)

Bresenham (page 346)

Any other algorithm you guys think that would be good to know and understand?