CMP 160 -- Fall 1997 -- Course Overview
| Main Text: |
Computer Graphics, 2nd edition, c or pascal version by Hearn and Baker |
| Additional Text: |
Computer Graphics: Principles and Practice, 2nd edition by Foley, van Dam, Feiner, and Hughes |
|
OpenGL Reference Manual OpenGL Programming Guide by Neider, Davis, and Woo |
|
| Optional References: |
3D Computer Graphics, 2nd edition by Watt |
|
Graphics Gems I..V by Glassner, Arvo, Kirk, Heckbert, Paeth |
Prerequisites: Math 12 or 17 or 21 or 27 -- matrix manipulation, determinants, dot products, and cross products. CMP 101 -- data structures, c programming. Or equivalent of these two areas.
Grading Policies: 5 programming assignments (30%), homeworks (5%), attendance/participation (5%), 2 exams (20% each), and final project (20%). You need to pass all of the components in order to pass the course. There is no final exam.
Exams are weighted 40-60 in your favor. Programs are due before class starts (i.e. 10am). Programs turned in at least a full day early will earn 1% bonus credit. Late programs will be charged 1% late points. Late programs and reports will not be accepted for the final project. The bonus credits may be accumulated up to a total of 50% toward program and final project credits. Programs are graded 80% for functionality and correctness and 20% for style, readability, documentation/writeup, and efficiency. Additional points may also be earned for extra features.
There will be no make-up exams, homeworks, or programs. There will be NO incompletes given in the class.
Attendance: You should participate enough in the class lectures or outside of class (e.g. office hours) so that the TA, Lab assistant, or myself know who you are. You are required to attend one of the regularly scheduled lab sections. Attendance/participation/effort is crucial in determining borderline cases at the end of the quarter.
General Policies: All course work including homeworks, programs and exams are intended as individual effort and are graded as such. It is okay to discuss general approaches and algorithms with other students, but this should be done without writing, looking, or sharing code. Cheating or plagiarism in any form will not be tolerated. Punishment will match severity of offense and may include an automatic PASS with an explicit discussion in the narrative evaluation records. You are responsible for protecting your homework solutions and programs from being copied by others. Do not discard printouts in public places. And don't forget to logout.
Graphlab Accounts and Keycode: The graphlab in 213AS is managed by CATS. You will need a separate account than your regular CATS account, although you may want to use the same login name. You will also need a keycode to physically enter the lab. I will be collecting names for account setup, and also passing out keycodes when I get them.
Questions/Discussions:
Aside from the classroom and graphlab,
you can clear up any questions you might have during regularly
scheduled office hours, or by appointment.
You can also reach the TA, lab assistants, or myself and get your answers by email.
In addition, we have the newsgroup
Last modified
Monday, 14-Dec-1998 19:29:32 PST.
