CS 426 Lecture 5 Scan Conversion


Page 1, Lecture Overview

Page 2, The process of scan converting

Page 3, Pixel coordinates

Page 4, Scan converting a line

Page 5, Bresenham's algorithm

Page 6, The final algorithm

Page 7, Sample lines

Page 8, Drawing in parallel

Page 9, Drawing anti-aliased lines

Page 10, Drawing filled areas

Page 11, Scan line algorithms for triangles

Page 12, Putting a texture into a triangle

Page 13, Scan line algorithms for trapezoids

Page 14, Drawing filled areas - assembling the pieces

Page 15, Drawing filled areas - an example

Page 16, Drawing filled areas - nasty examples

Page 17, Drawing filled areas - nasty examples

Page 18, Boundary fill algorithms