CS 430 Computer Graphics I

If you send questions via e-mail, you should e-mail them to the TA and Professor Breen.

You can also get help with assignments in the Cyber Learning Center (UC 147). Click here to get the TA hours. Click on "CS 430" to see which TAs can provide help with this class.

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

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. Computer Graphics: Principles and Practice (3rd Edition), John F. Hughes, et al., Addison-Wesley, 2014; ISBN 978-0-321-39952-6
  2. 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.
I will regularly communicate to the class via e-mail.


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.


Pre-Requisites

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, Python, 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, without needing special libraries. Arguments passed to the command-line will parameterize assignments; hence you'll need to read command-line arguments (argc, argv) in arbitrary order 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 (80%)
  • Final exam (20%)
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

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 Learn page before 11:59 PM on the due date.



Academic Honesty

You must be the sole original author of all assignments and examination solutions in their entirety, unless the instructor explicitly instructs you otherwise in written directions on an assignment or exam. Collaborative work is a violation of academic honesty in this course. You are not to examine or use code belonging to someone else, nor may you let anyone else examine or copy your code.

Students found in violation of the Academic Honesty policy will receive an 'F' in the class. In the case of plagiarism, all parties involved will be equally penalized.

The description of the department's Academic Integrity Policy can be found here. If a student violates this policy, an Alleged Academic Misconduct Report will be filed with the college.

It is your responsibility to avoid violating the university's policy. If you are unclear as to what the policy means in a particular situation, ask the instructor for clarification before you hand anything in.

See the examples below for clarification of this policy.

Examples

The following are acceptable:
  • Using code provided in lecture: include comments that cite the source.
  • Using code provided in the class textbook: include comments that cite the source.
  • Code developed jointly with instructor or teaching assistants assigned to this course.
  • Discussing algorithms or possible approaches to writing your program, WITHOUT discussing particulars of the code.
  • Discussing how to resolve errors, WITHOUT discussing particulars of the code.
These are NOT acceptable:
  • You borrow a printed or electronic copy of a friend's assignment, and use it for "inspiration".
  • You give a printed or electronic copy of your assignment to somebody else.
  • You "find" a copy of somebody's program in the trash, on a lab machine, on their hard drive, etc., and use it for "inspiration".
  • You pay a "tutor" who writes the assignment for you.
  • You download code from the Web, and turn in some or all of it as your own assignment.
  • You and a friend together write one assignment, then create separate modifications to be handed in.
  • You and a friend write certain portions of the assignment individually, but collaborate on other portions of the assignment.
The College of Computing and Informatics has a "2 Strikes You're Out" policy.
If you have two cheating infractions, you will be expelled from your CCI major.

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.



Examinations

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


Calendar

Week 1 (January 5 - 9)

Week 2 (January 12 - 16)

Week 3 (January 19 - 23)

Week 4 (January 26 - 30)

  • Reading Assignment
    • Foley et al.: 9.2→9.2.3
    • Farin and Hansford: Chapters 3, 4, 5 & 9
  • January 28 - Lectures: Introduction To Curves 6 per page
  • January 28 - Lecture: Bezier 6 per page

Week 5 (February 2 - 6)

Week 6 (February 9 - 13)

Week 7 (February 16 - 20)

Week 8 (February 23 - 27)

  • Reading Assignment
    • Foley et al.: 13→13.4, 9.3, 9.4
    • Farin and Hansford: Chapters 6, 7 & 12; 13.7→13.8
  • February 25 - Lecture: Surfaces 6 per page
  • February 25 - Lecture: Subdivision Surfaces and Solid Modeling

Week 9 (March 2 - 6)

Week 10 (March 9 - 13)



File last modified on January 14, 2015.