CS 431/636 - Advanced Rendering Techniques

Spring 2012

Description: The creation of realistic images from 3D models is central to the development of computer graphics. The ray tracing algorithm has become one of the most popular and powerful techniques for creating photo-realistic images. Ray tracing's simplicity, elegance and ease of implementation make it one of the most important image generation algorithms in computer graphics. This class will explore in detail the algorithmic components of ray tracing.

These include

Students will implement many of these components in their class programming projects.

Other types of rendering algorithms will be discussed, e.g. radiosity, volume rendering, non-photorealistic rendering and photon mapping.

Location - Korman 105D

Time - Wednesday, 6:00 PM → 8:50 PM

Instructor

Textbooks

Recommended

Supplemental

Grade

I intend to use the standard grading scale of 100→ 90 (A), 89→ 80 (B), 79→ 70 (C), 69→ 60 (D), else (F).
Please also note that incompletes will not be given for this course.

Each graduate student will present a research paper in class on a topic not covered by the regular class lectures.

Choose a paper from this list. It is a much shorter version of this list.
You may present another paper related to rendering, with the instructor's permission.

Online students will simply submit their Powerpoint file by the end of the term.
The Powerpoint presentation should summarize the paper and contain at least 10 slides.

Assignments are due at 11:59PM on the due date
  Post images on the web and code on Bb Vista
  E-mail me the URL

Late Policy

Assignments

Each assignment is worth 10 points.

Programming assignments may be written in any language.

Follow all of the instructions listed in the assignments.
5 points will be subtracted from an assignment if all of the instructions aren't followed.

It is expected that you will do you own work, i.e. write your own software for the assignments.
You cannot "borrow" code from other students or download programs from the Internet.
Specifically, you cannot use the code provided by the Suffern book (or its derivatives) for your assignments.

Any student violating this policy will be given an 'F' for the class.

You may use image and basic math libraries, e.g. for storing and manipulating vectors and matrices.

Final Exam

There will be a final exam on material not covered by the regular assignments. This includes material presented by graduate students

Topics covered on the final exam are

Questions related to these topics will be in a short-answer format.

There will be 2 multiple choice questions covering each paper presented by a student during class. The questions will be based on material from the students' presentation slides.

Student Presentation Schedule


 

Link to Recorded Lectures

Alternative recordings if you have trouble with Silverlight

 


Class Schedule

Week 1 - 4/4/12

Week 2 - 4/11/12

Week 3 - 4/18/12

Week 4 - 4/25/12

Week 5 - 5/2/12

Week 6 - 5/9/12

Week 7 - 5/16/12

Week 8 - 5/23/12

Week 9 - 5/30/12

Week 10 - 6/6/12



Last modified on June 13, 2012.