M10/30

1. Bresenham - Bresenham line and circle algorithms. This is also a nice example of transforming a program from code that is slow but understandable to a version that is fast but obscure.
   This notes present Bresenham better than slide set 23.

<< Lecture 14 | ComputerGraphicsFall2006 | Lecture 16 >>

Recent pages you've visited: (:tracetrails:)