6.837 LECTURE 6
1. Scan Converting Triangles 2. Triangles are Minimal
3. Triangles are Always Convex Polygons 4. Triangles Can Approximate Arbitrary Shapes
5. Any Polygon can be Decomposed into Triangles 6. Rasterizing Triangles
7. Edge-Walking Triangle Rasterizer 8. Fractional Offsets
9. Rasterizing Triangles using Edge Equations 10. Notes on using Edge Equations
11. Example Implementation 12. Edge Equation Coefficients
13. Numerical Precision of the C Coefficient 14. EdgeEquation Object
15. Triangle Object 16. The Draw Method
17. Explain Two Speed Hacks 18. Triangle SetUp Method
19. Tricks Explained 20. Why Positive Area Imply a Positive Interior
21. Exercise #2 22. Triangle Rasterizer Demonstration
23. Interpolating Parameters Within a Triangle 24. This equation should appear familiar.
25. Smooth Triangle Object 26. Computing Plane Equations
27. Modified Draw( ) Method 28. More SmoothTri.Draw( )
29. Even More SmoothTri.Draw( ) 30. Smooth Triangle Results
31. A Post-Triangle World 32. Point-Cloud Rendering
33. Next Time
  Lecture 6   Outline   6.837 Fall '00