This course provides a broad overview of the theory and practice of rendering. Classic rendering algorithms will be covered, however, most of the course will cover current results in physically-based rendering algorithms.


Attendees should have a working knowledge of computer graphics (at the level of CS248 and CS348A). In particular, you should fully understand the basic 3D display pipeline, viewing and modeling transformations, simple geometric modeling using polygons and quadrics, and hidden surface algorithms like the z-buffer algorithm.

Solid knowledge of integral calculus and basic geometric algorithms is an absolute must. Some exposure to signal processing and probability is also assumed. Proficiency is C++ programming.







Apr 4, 6

The Goals of Rendering

Basic Ray Tracing I: Basic Algorithms


Apr 11, 13

Ray Tracing II: Acceleration Techniques



Apr 18, 20

The Light Field

Monte Carlo Integration I


Apr 25, 27

Cameras and Film

Monte Carlo Integration II


May 2, 4

Sampling and Reconstruction (Kayvon)

Reflection Models I: BRDFs and Diffuse


May 9, 11

Reflection Models II: Glossy



May 16, 18

Light Transport and the Rendering Equation

Monte Carlo Path Tracing


May 23, 25

Irradiance Caching and Photon Mapping

Participating Media and Volume Rendering


May 30, Jun 1

Reflection Models III: Anisotropic Reflection

Current Topics in Rendering


Text and readings

There is one required text for the course.

Additional readings will be assigned from research monographs, papers from journals and conference proceedings, and excerpts from conference tutorials. Only papers NOT available online will be handed out in class. Readings for each lecture are available from the Lectures page.

Assignments and grading

The projects for this quarter involve enhancing a working ray tracer. We will use a a ray tracing system called pbrt. This system is a combined C++ codebase and textbook written in a literate programming language.

The first part of the course involves four assignments:

In the last part of the course you will enhance your system so that it is capable of reproducing an image of a real object, for example, a gemstone, a puff of smoke, a candle flame, etc. Check out the results produced by previous students.

Evaluation criteria: The first four structured programming assignments will each count as 10% of your grade, and the final programming project will count as 40%. The remaining 20% of your grade will be based on your comments on the lectures. There will be no exams.

Collaboration: For the first four programming projects, you may discuss the assignment with friends, but you are expected to implement your own solutions. On the last programming project, you are permitted (and encouraged) to form teams of two people and partition your planned extensions among the team members. Teams may discuss their project with other teams, but may not share code.

Late assignments: Since each assignment builds on the previous one, it is important that assignments be completed on time. To allow for unforeseeable circumstances, you will be allowed three weekdays of grace during the quarter. Beyond this, late assignments will be penalized by 10% per weekday that they are late. On the last programming project, neither the demo nor the writeup may be late. Incompletes in this course are given only in exceptional circumstances.

Hardware and software

You are welcome and encouraged to do class assignments on your own machines. Although PBRT builds successfully on most systems, the TAs will be able to provide support for compiling PBRT on Linux (on the public Stanford 'myth' machines, see below) and on Windows (via Visual 2003). Check out the PBRTInfo page for information about working with the PBRT software.

If you do not wish to develop on a personal machine, you will have access to the 'myth' machines located on the second floor of Sweet Hall. These 3.2 Ghz DELL Dual-Xeon Linux boxes, named myth1 - myth29 are available for remote access. CS348b students are given non-exclusive priority access to these machines.

All students with leland accounts automatically have accounts on these machines. Home directories on these machines are shared with other Stanford Computing Clusters using AFS. If you do not have a leland account, consult this ITSS web page. Registered students will get an extra 200MB of disk quota for the quarter.

Rendering competition

In case the delight of learning does not sufficiently motivate you to exert yourselves heroically on the programming assignments, there will also be a rendering competition. During finals week, a judging will be held to select the best rendering made using the ray tracer you have written in the course. While grades for the projects are based solely on "technical merit", the competition will be judged on both "technical merit" and "artistic impression". The jury, to be named later, will consist of computer graphics experts from both industry and academia. There will be several awards and one grand prize - an all-expenses-paid trip to SIGGRAPH 2006 in Boston. Total value: about $1,000.

Syllabus (last edited 2006-05-09 22:55:31 by KayvonFatahalian)