CS 536 Computer Graphics I
Course Page : http://www.cs.drexel.edu/~david/Classes/CS536

Recommended Textbooks:
  1. Introduction to Computer Graphics, by James D. Foley, Andries van Dam, et al. Addison-Wesley Pub Co, 1994; ISBN: 0201609215
Suggested Supplemental Texts:
  1. Fundamentals of Computer Graphics, 3rd ed., by Peter Shirley et al., AK Peters, 2009, ISBN: 978-1-56881-469-8
  2. 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.

Course Objective

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), or equivalent classes. 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 a makefile for testing and evaluation. Code must run as a single command-line process on the CS Department's Linux (tux) computers, or possibly on a MacOS X computer, without needing special libraries. 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
  • Assignments (75%)
  • Presentation (10%)
  • Final exam (15%)
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.


Students must work on the assignments individually. No geometry or graphics libraries may be used in the homework 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 Bb Vista 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.


Each student will read a technical paper selected from the SIGGRAPH Proceedings and submit a Powerpoint presentation that describes the paper.
There should be at least 10 slides in the presentation.

If you are not on a drexel.edu computer you will have to access the papers through the Drexel Library by clicking on "ACM Digital Library" -> "Proceedings" -> "Computer Graphics and Interactive Techniques Conference" -> "SIGGRAPH * `year' [Pp]apers".
Please no "Game Papers".

The deadline for submitting the Powerpoint presentation is February 27. The same policy as programming assignments applies for late presentations.


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

Final Exam Topics

Link to Recorded Lectures


Week 1 (January 9 - 13)
Week 2 (January 16 - 20)
  • Reading Assignment
    • Foley et al.: Chapter 5
    • Shirley et al.: Chapter 6
  • January 19 - Lecture: Line Clipping and 2D-Transformations 6 per page
  • January 19 - Lecture: 3D-Transformations 6 per page
Week 3 (January 23 - 27)
Week 4 (January 30 - February 3)
Week 5 (February 6 - 10)
Week 6 (February 13 - 17)
  • Reading Assignment
    • Foley et al.: 3.7, 3.14, 6.1→6.4
    • Shirley et al.: 8.3, Chapters 7 and 9
  • February 16 - Lecture: Thick Primitives 6 per page
  • February 16 - Lecture: Introduction to 3D Viewing 6 per page
Week 7 (February 20 - 24)
Week 8 (February 27 - March 2)
  • Reading Assignment
    • Foley et al.: 13→13.4, 9.3, 9.4
    • Farin and Hansford: Chapters 6, 7 & 12; 13.7→13.8
  • February 27 - Research Paper Presentation Due
  • March 1 - Lecture: Surfaces 6 per page
  • March 1 - Lecture: Subdivision Surfaces and Solid Modeling
Week 9 (March 5 - 9)
  • Reading Assignment
    • Foley et al.: Chapter 10
    • Shirley et al.: Chapters 4, 10, 13, 16, 24 & 25; 8.2, 8.4
  • March 5 - Assignment 4 Due
  • March 8 - Lecture: Solid Models 6 per page
  • March 8 - Lecture: Culling, Z-Buffering and Ray Tracing 6 per page
Week 10 (March 12 - 16)

File last modified on March 1, 2012.