- Instructor:
*Dr. David Breen* - E-mail: david_AT_cs.drexel.edu
- Office: University Crosings 114
- Office Hours: Wednesdays 4:00-5:30
- Class Hours: Tuesday, Thursday 2:00-3:50
- Class Location: University Crossings 153
- Phone: (215) 895-1626
- Teaching Assistants
*Linge Bai*- E-mail: lb353_AT_drexel.edu
*Manolya Eyiyurekli*- E-mail: me52_AT_cs.drexel.edu

**Course Page** :
http://www.cs.drexel.edu/~david/Classes/CS430

**Recommended Textbooks:**

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

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

E-mail:

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 (80%)
- Quizzes (10%)
- Final exam (10%)

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.

**Quizzes**

**
Starting from Week 2 each Tuesday class will start with a short quiz
on material presented the previous week.
**

**Examinations**

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

### Final Exam Topics

**
****
**

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 October 7

- Assignment 2 (Sutherland-Hodgman polygon clipping) - Due October 21

- Assignment 3 (Draw clipped, filled polygons) - Due November 4

- Assignment 4 (Draw 3D lines) - Due November 18

- Assignment 5 (Z-buffer rendering) - Due December 4

- Extra Credit Assignment (Bezier curve drawing) - Due December 4

The lowest quiz grade will be dropped.

Week 1 (September 21 - 25)

November 24 - TBA
November 26 - Thanksgiving

- Reading Assignment
- Foley et al.: Chapter 1, 3.1, 3.2, 3.9
- Shirley et al.: Chapter 1, 2.1→2.4, 2.6, 5.1→5.3, 8.1.1
- Farin and Hansford: Chapter 1

- September 22 - Lecture :
Introduction 6 per page

- September 24 -
Lecture:
Lines 6 per page

- XPM Manual

Week 2 (September 28 - October 2)

- Reading Assignment
- Foley et al.: Chapter 5
- Shirley et al.: Chapter 6

- September 29 -
Lecture:
2D-Transformations 6 per page

- October 1 -
Lecture:
3D-Transformations 6 per page

Week 3 (October 5 - 9)

- Reading Assignment
- Foley et al.: 3.3→3.6, 3.10, 3.11, 9.1
- Shirley et al.: 2.7, 8.1.2, 8.1.3, 12.1
- Farin and Hansford: Chapter 2

- October 6 - Lecture: Polygons 6 per page
- October 7 - Assignment 1 Due
- October 8 - Lecture: Circles 6 per page

Week 4 (October 12 - 16)

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

- October 13 - Lectures:
Introduction To Curves 6 per page

- October 15 - Lecture: Bezier 6 per page

Week 5 (October 19 - 23)

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

- October 20 - Lecture: Bsplines and NURBS 6 per page
- October 21 - Assignment 2 Due
- October 22 - Lecture: Drawing NURBS 6 per page

Week 6 (October 26 - 30)

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

- October 27 - Lecture: Thick Primitives 6 per page
- October 29 - Lecture: Introduction to 3D Viewing 6 per page

Week 7 (November 2 - 6)

- Reading Assignment
- Foley et al.: 6.5→6.7, Chapter 11
- Shirley et al.: Chapters 3, 20, 21, 22 & 23

- November 3 - Lecture: Math of 3D Viewing 6 per page
- November 4 - Assignment 3 Due
- November 5 - Lecture: Color 6 per page

Week 8 (November 9 - 13)

- Reading Assignment
- Foley et al.: 13→13.4, 9.3, 9.4
- Farin and Hansford: Chapters 6, 7 & 12; 13.7→13.8

- November 10 - Lecture: Surfaces 6 per page
- November 12 - Lecture: Subdivision Surfaces and Solid Modeling

Week 9 (November 16 - 20)

- Reading Assignment
- Foley et al.: Chapter 10
- Shirley et al.: Chapters 4, 10, 13, 16, 24 & 25; 8.2, 8.4

- November 17 - Lecture: Solid Models 6 per page
- November 18 - Assignment 4 Due
- November 19 - Lecture: Culling, Z-Buffering and Ray Tracing 6 per page

Week 10 (November 23 - 27)

Week 11 (November 30 - December 4)

- Reading Assignment
- Foley et al.: 9.5

- December 1 - Lecture: Fractals 6 per page
- December 3 - Lecture: Level Set Models 6 per page
- December 4 - Assignment 5 Due

File last modified on September 30, 2009.