Rasterization - University of Southern California

More documents

Recommendations

Info

Concave Polygons: Tessellation • Approach 2: divide non-convex, non-flat, or non-simple polygons into triangles • OpenGL specification – Need accept only simple, flat, convex polygons – Tessellate explicitly with tessellator objects – Implicitly if you are lucky • Most modern GPUs scan-convert only triangles 18
Flood Fill • Draw outline <strong>of</strong> polygon • Pick color seed • Color surrounding pixels and recurse • Must be able to test boundary and duplication • More appropriate for drawing than rendering 19
Page 1 and 2: CSCI 480 Computer Graphics Lecture
Page 3 and 4: Rasterizing a line 3
Page 5 and 6: Digital Differential Analyzer • A
Page 7 and 8: Bresenham’s Algorithm I • Elimi
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: Edge vs Scan Line Intersections •
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?