Rasterization - University of Southern California

More documents

Recommendations

Info

Digital Differential Analyzer (DDA) • Assume 0 ≤ m ≤ 1 • Exploit symmetry • Distinguish special cases But still requires floating point additions! 6
Bresenham’s Algorithm I • Eliminate floating point addition from DDA • Assume again 0 ≤ m ≤ 1 • Assume pixel centers halfway between integers 7
Page 1 and 2: CSCI 480 Computer Graphics Lecture
Page 3 and 4: Rasterizing a line 3
Page 5: Digital Differential Analyzer • A
Page 9 and 10: Bresenham’s Algorithm III • Com
Page 11 and 12: Bresenham’s Algorithm V • So d
Page 13 and 14: Outline • Scan Conversion for Lin
Page 15 and 16: Filling Convex Polygons • Find to
Page 17 and 18: Edge vs Scan Line Intersections •
Page 19 and 20: Flood Fill • Draw outline of poly
Page 21 and 22: Aliasing • Artifacts created duri
Page 23 and 24: Antialiasing for Line Segments •
Page 25 and 26: Supersampling Example • Other imp
Page 27 and 28: Wagon Wheel Effect Source: YouTube
Page 29: Summary • Scan Conversion for Pol

Rasterization - University of Southern California

Create successful ePaper yourself

Delete template?

Save as template?