Personnel Instructor: Tom Dietterich, Dearborn 306, 737-5559, tgd@cs.orst.edu Office Hours: MW 2:00-3:00pm, Th 3:30-4:30pm, others by appointment. TA: Pornsiri Muenchaisri, muenchp@flop.engr.orst.edu Office Hours: M 3:00-5:00pm, W 2:00-4:00pm in Dearborn 115 Meeting Times Lecture: Tuesday, Thursday 2:00-3:20 Help Session: Mondays 11:00 (location to be determined) Texts Computer Graphics: An Object-Oriented Approach to the Art and Science by Cornell Pokorny Course Notes are available at the OSU bookstore. Goals When you have completed this course, you will have a solid understanding of the basic algorithms, mathematics, physics, and psychology of computer graphics. In addition, you will have practice modeling and rendering 3-D graphical images and animations. Prerequisites Knowledge of simple analytic geometry Ability to program in C++ Familiarity with the X window system at the user level Grading Written Homework 20% Programs 20% MidTerm 20% Project 20% Final 20% Students enrolled in CS550 will have additional homework problems (of a more mathematical nature). They will also be expected to learn more about curved surface representations. Written Homework and Programs are due at the beginning of class. Each student is responsible for his/her own work. The standard departmental rules for academic dishonesty apply to all assignments in this course. Collaboration on homeworks and programs should be limited only to answering questions that can be asked and answered without using any written medium (e.g., no pencils, pens, or email). Turning In Programming Assignments You will turn in your solutions to programming problems via email. Please email your solutions to muenchp@flop.engr.orst.edu. The subject of your email must be the words PROGRAMn where ``n'' is the number of the assignment. This permits an automated mail filter to save your solutions in a separate mail folder. By return email you will receive a message confirming that your message was received. COURSE SCHEDULE Jan 9 Introduction. Raster displays. Drawing lines. 11 Polygons. Polygon filling. 16 Circles. 2D line clipping. 18 2D polygon clipping. 23 2D transformations, 3D transformations, projections perspective depth transformation, view transformation 25 tmesh class; start 3D clipping 30 Finish 3D clipping, backface removal, tmesh code Feb 1 Color: color cones, CIE diagram, CIE->RGB conversion RBG, HSF, HLS, Illumination and reflection 6 Walk through tmesh rendering code. Review for Midterm 8 MIDTERM EXAM 13 IBM Visualization Data Explorer 15 IBM VDE continued; Depth Sorting 20 Depth Sorting; Painter's algorithm; Warnock (Screen subdivision) algorithm 22 Binary Space Partition (BSP) Trees. PROJECT PROPOSALS DUE 27 Z-buffer algorithm; Gouraud shading; Phong shading 29 Ray Tracing Mar 5 Finish ray tracing. Constructive Solid Geometry 7 Ray Tracing Transformations; Antialiasing 12 Project Presentations 14 Project Presentations Mar 18 11:00am FINAL EXAM