Slide 1Line AlgorithmsCS 445/645Introduction to Computer GraphicsDavid Luebke, Spring 2003Drawing LinesDavid Luebke 2 01/14/19Line Algorithms●Drawing 2-D lines: a case study in optimization●“One good thief is worth ten good scholars”■Sometimes somebody does something so well there is no point in doing it over■We will use Professor Leonard McMillan’s web-based lecture notes (then at MIT, now at UNC)○http://graphics.lcs.mit.edu/classes/6.837/F98/Lecture5■His examples are in Java, but the correspondences are obvious.○Raster: his implementation of a framebuffer
View Full Document