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

Recommended Textbook:
Supplemental Textbook:
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.


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 material than can be comprehensively covered in a 10 week term. CS 536 Computer Graphics is designed to provide graduate students with an introduction to the geometric modeling aspects of computer graphics, as well as the related topic of transformations. Course material will cover the various representations for 3D curves, surfaces and solids, and will also discuss the creation of complex, hierarchical models. Material on general topics in computer graphics, e.g. drawing/clipping algorithms, color, viewing and rendering, will also be interspersed throughout the class in order to expand its coverage.


Pre-Requisites

Like the other introductory CS graduate classes, this one requires that you have a basic background in computer science. You can demonstrate this by either having a computing related undergraduate degree, or by taking our pre-core classes, CS 520, 570 and 571. You will find this course extremely difficult if you do not have strong (B or better) linear algebra and multi-dimensional calculus skills. Minimal review of the relevant mathematics background 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 or script 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 arbitary 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

Graduate Students

  • Assignments (70%)
  • Presentation (10%)
  • 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.
You may use math libraries to represent and manipulate vectors and matrices, command line option processing libraries, and libraries to write Open Inventor.
But they must be installed on tux!

1 point per day (max of 5 points, out of 10) will be deducted from late assignments.
The deadline for turning in all assignments is December 4.
You will be given a grade of 0 if an assignment is not turned in by this date.

The programming assignments should be submitted on the class Bb Learn page before 11:59 PM on the due date to be considered on-time.

All assignments will be run in the Unix Command Line Interface (CLI) on tux and will generate geometry files in the ASCII Open Inventor format. Examples of Open Inventor files can be found here. Inventor (*.iv) files can be viewed with an open-source CAD system called FreeCAD. Go here to download a version of this sofware for your computer.

All assignments should include source code files, a README file and possibly a makefile (if you're writing in a compiled language).



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.



Presentations

Each graduate student will read a technical conference paper related to geometric modeling or geometry processing and submit a Powerpoint presentation that describes/summarizes the paper.
Suggested conferences are the SIGGRAPH Conference, SIGGRAPH Asia Conference, Shape Modeling International Conference, Solid and Physical Modeling Conference and the Symposium on Geometry Processing. The paper must be from the main SIGGRAPH or SIGGRAPH Asia Conference, not just from any ACM SIGGRAPH-sponsored conference, symposium or workshop.
The presentation should include:

  • at least 10 slides
  • images
  • the citation information for the paper

If you are not on a drexel.edu computer you will have to access the papers through the Drexel Library, or by connecting to the Drexel network via VPN.
Please no "Games Papers".

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



Examinations

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

The in-class exam will be given on Wed. 12/7 at 6PM in UC 153.
It will be a 2 hour exam.

Final Exam Topics



Lectures Are Recorded

Recorded lectures can be accessed through the Class Capture link on the class Bb Learn page.


Calendar
Week 1 (September 19 - 23)
  • Reading Assignment
    • Mortenson: Chapter 1.1→1.5, 2.1→2.3, 4.1→4.2
    • Foley et al.: Chapter 1, 5.1, 9.2→9.2.1, 9.2.3
  • September 21 - Lecture (6 per page) : Introduction
  • September 21 - Lecture (6 per page) : Math Review; Introduction to Curves
Week 2 (September 26 - September 30)
Week 3 (October 3 - 7)
Week 4 (October 10 - 14)
  • Reading Assignment
    • Foley et al.: Chapter 3.4→3.5, 3.8→3.9, 3.11, 9.1
  • October 12 - Lecture (6 per page) : B-splines and NURBS
  • October 12 - Lecture (6 per page) : Drawing B-Splines Curves
Week 5 (October 17 - 21)
Week 6 (October 24 - 28)
Week 7 (October 31 - November 4)
Week 8 (November 7 - 11)
  • Reading Assignment
    • Foley et al.: 12→12.2, 12.3.3, 12.4, 13, 14→14.2, 14.5.2, 14.7
  • November 9 - Lecture (6 per page) : Introduction to 3D Viewing
  • November 9 - Lecture : Scanline Rendering
  • November 9 - Lecture (6 per page) : Culling and Z-Buffering
Week 9 (November 14 - 18)
Week 10 (November 21 - 25)
  • No Class
Week 11 (November 28 - December 2)


File last modified on November 30, 2016.