- Instructor:
*Dr. David Breen* - E-mail: david_AT_cs.drexel.edu
- Office: University Crosings 114
- Office Hours: Wed 2:00-3:30
- Class Hours: Tuesday, Thursday 9:30-10:50
- Class Location: University Crossings 153
- Phone: (215) 895-1626
- Teaching Assistant & Grader:
*Manolya Eyiyurekli* - E-mail: me52_AT_cs.drexel.edu
- Office: University Crossings 147
- Office Hours: Monday, 2:00 → 4:00, or by appointment
- Teaching Assistant:
*Jasper Zhang* - E-mail: jzz22_AT_cs.drexel.edu
- Office: University Crossings 147
- Office Hours: Tuesday, 4:00 → 6:00; Friday, 1:00 → 5:00

- Introduction to Computer Graphics, by James D. Foley, Andries van Dam, et al. Addison-Wesley Pub Co, 1994; ISBN: 0201609215

- Fundamentals of Computer Graphics, 2nd ed., by Peter Shirley et al., AK Peters, 2005, ISBN: 1-56881-269-8
- The Essentials of CAGD, by Gerald Farin and Dianne Hansford. AK Peters, 2000; ISBN: 978-1568811239

It is University policy that you read your official
Drexel email; it is the course policy that you read it at least once per
day.

Computer Graphics represents a vast technical field,
ranging from mathematics and geometry topics to computer hardware and
software engineering topics to rendering, animation and virtual
reality, far more than can be comprehensively covered in a 10 week
term. Computer Graphics I is designed to provide students with an
introduction to the fundamental algorithms of computer graphics
through detailed coverage of the mathematics and implementation of
2D and 3D line, curve and surface drawing. The
course culminates with a focus on 3D viewing
and visible surface algorithms.

Students are required to have taken CS260
(Data Structures), CS 350 (Software Design)
and Math 201 (Linear
Algebra). You will find this course extremely difficult if you do
not have strong (B or better) linear algebra skills. Minimal review of
linear algebra will be given in this class. Students are assumed to
have excellent knowledge of programming. Students can use whatever
programming language they wish (C, C++, Java, etc.) for the
assignments in this class with the following caveat: you will need to
turn in both source code and an executable file for testing and
evaluation. Code must run, without dynamic linking, as a single
command-line process on the CS Department's Linux (tux) computers, or
possibly on a MacOS X computer.
Arguments passed to the
command-line will parameterize assignments; hence you'll need to
read command-line arguments (argc, argv) and parse input files. This
course is mathematically intense and implementationally challenging.
You will be required to implement complex data structures and
mathematical calculations as
a regular part of your assignments.

**Course Grading Scheme**

*I intend to use the standard grading scale of 100→ 90 (A), 89→ 80 (B),
79→ 70 (C), 69→ 60 (D), else (F).*

Also note that incompletes will not be given for this course.

**Assignments**

**
****
****
**

- Assignments (85%)
- Final exam (15%)

Also note that incompletes will not be given for this course.

Students __must__ work on the assignments __
individually__. No geometry or graphics libraries may be used in the
homework assignments.

**Examinations**

**There will be a final exam on the material from
class that is ***not* covered by the regular assignments.

**
****
**

1 point per day (max of 5 points) will be deducted
from late assignments.

You will be given a grade of **0** if an assignment is not
turned in by the last day of classes.

The programming assignments should be submitted on the class WebCT page before 11:59 PM on the due date.

*Note:* If the TA or instructor finds strong evidence of cheating
on assignments and/or the final examination, the student(s) involved
will receive an "F" in the course, and a memo describing the cheating
will be added to their student record. Be very careful, it is not
worth the risk.

*Note: *Your source code for all programming assignments will be
run through a plagiarism detection system. This program uses compiler
techniques, which are invariant of syntax and style. If you are
sharing/borrowing code with other classmates (from this or previous
years), you will get caught.

- Assignment 1 (Draw clipped lines) - Due April 16

- Assignment 2 (Sutherland-Hodgman polygon clipping) - Due April 30

- Assignment 3 (Draw clipped, filled polygons) - Due May 14

- Assignment 4 (Draw 3D lines) - Due May 28

- Assignment 5 (Z-buffer rendering) - Due June 7

- Extra Credit Assignment (Bezier curve drawing) - Due June 7

Week 1 (April 2 - 5)

- Reading Assignment
- Foley et al.: Chapter 1, 3.1, 3.2, 3.9
- Shirley et al.: Chapter 1, 3.5, 12.1→12.3
- Farin and Hansford: Chapter 1

- April 3 - Lecture :
Introduction 6 per page

- April 5 -
Lecture:
Lines 6 per page

- XPM Manual

- Reading Assignment
- Foley et al.: Chapter 5
- Shirley et al.: 2.1→2.4, Chapters 5 and 6

- April 10 -
Lecture:
2D-Transformations 6 per page

- April 12 -
Lecture:
3D-Transformations 6 per page

- April 16 - Assignment 1 Due
- Reading Assignment
- Foley et al.: 3.3→3.6, 3.10, 3.11, 9.1
- Shirley et al.: 2.11, 3.6
- Farin and Hansford: Chapter 2

- April 17 - Lecture: Polygons 6 per page
- April 19 - Lecture: Circles 6 per page

- Reading Assignment
- Foley et al.: 9.2→9.2.3
- Shirley et al.: 2.5, 2.6, 2.8, 2.10, Chapter 15
- Farin and Hansford: Chapters 3, 4, 5 & 9

- April 24 - Lectures:
Introduction To Curves 6 per page

- April 26 - Lecture: Bezier 6 per page

- April 30 - Assignment 2 Due
- Reading Assignment
- Foley et al.: 9.2.4→9.2.8
- Farin and Hansford: Chapters 10 & 11; 13.1→13.6

- May 1 - Lecture: Bsplines and NURBS 6 per page
- May 3 - Lecture: Drawing NURBS 6 per page

- Reading Assignment
- Foley et al.: 3.7, 3.14, 6.1→6.4
- Shirley et al.: 3.7, Chapters 4 and 7

- May 8 - Lecture: Thick Primitives 6 per page
- May 10 - Lecture: Introduction to 3D Viewing 6 per page

- May 14 - Assignment 3 Due
- Reading Assignment
- Foley et al.: 6.5→6.7, Chapter 11
- Shirley et al.: 3.1→3.4, Chapters 19 and 20

- May 15 - Lecture: Math of 3D Viewing 6 per page
- May 17 - Lecture: Color 6 per page

- Reading Assignment
- Foley et al.: 13→13.4, 9.3, 9.4
- Shirley et al.: Chapters 8 and 10, 2.7, 2.9, 12.5, 13.1→13.3
- Farin and Hansford: Chapters 6, 7 & 12; 13.7→13.8

- May 22 - Lecture: Culling, Z-Buffering and Ray Tracing 6 per page
- May 24 - Lecture: Surfaces 6 per page

- May 28 - Assignment 4 Due
- Reading Assignment
- Foley et al.: Chapter 10

- May 29 - Lecture: Subdivision Surfaces and Solid Modeling
- May 31 - Lecture: Solid Models 6 per page

- June 5 - Final Exam
- June 7 - Lecture: Level Set Models 6 per page
- June 7 - Assignment 5 Due

File last modified on May 20, 2007.