Lecture 9: 3 October 2002Office hours today:Prof. T.: after class in 4-035Addy: 4-6pm in W20 Linux cluster (note change)Today Part I:Finish polygon scan conversion & fillingToday Part II:Assignment 2 (* scene exhibition)Mysteries of homogeneous coordinates explainedAssignment 4 (Polygon fill with ivscan) postedFriday:Assignment 3 (Polygon wireframe rendering) due 5pmMIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 1Assignment 2 CommentsGreat work!Lots of thought evident in most scene compositionsMany interesting scenes: fun, serious, political, etc.Lots of effort selecting, situating, and lighting objectsGroup spirit of using & acknowledging eachother’s workCommon technical pitfallsSome objects did not respect Ass’t 1 modeling conventionsSlow render times for some scenes:Excessive object/polygon budgetLarge numbers of light sourcesUse of software clipping planesNot exploiting Separators to “bind” lights only to certain objectsErroneously expecting cast shadows (Inventor/OpenGL don’t do this)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 2Daniel Chak (chak)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 3Daniel Chak (chak)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 4Ying Li (cyli)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 5Patrick Menard (dranem05)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 6Juan Reyes (jcarlos)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 7Megan Galbraith (megan)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 8Meena Shah (mshah91)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 9Naveen Goela (ngoela)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 10Philip Lee (philee)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 11Pierre Poignant (poignant)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 12Conan Saunders (saunders)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 13Xian Ke (xke)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 14Yao Li (yaol)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 15Esther Yoo (yoo)MIT 6.837 Computer Graphics Thursday, 3 October 2002 (L9) Page 16Scan-line Hidden Surface AlgorithmsWe’ll work with just one raster of framebuffer memory (color, z)“Sweep” horizontal scanline upward over scene (from raster 0 to h − 1):
View Full Document