LEC0101 Wednesdays 12:00–14:00 in GB 220
Prof. Karan Singh
Office hours Wednesdays 14:00–16:00 in BA 5258
LEC0201 Tuesdays 15:00–17:00 in GB 220
Prof. Alec Jacobson
Office hours Tuesdays 17:00–19:00 in BA 5266
Tutorial for both sections will be held together on Mondays 12:00–13:00 in GB 220.
|11/9/2017||Welcome to CSC418|
This course introduces the basic concepts and algorithms of computer graphics. It covers the basic methods needed to model and render 3D objects, including much of the following: graphics displays, basic optics, line drawing, affine and perspective transformations, windows and viewports, clipping, visibility, illumination and reflectance models, radiometry, energy transfer models, parametric representations, curves and surfaces, texture mapping, graphics hardware, ray tracing, graphics toolkits, animation systems.
Prerequisites: CSC336H1/CSC350H1/CSC351H1/CSC363H1/364H1/CSC365H1/CSC373H1/CSC375H1/378HI, MAT137Y1, CSC209H1/proficiency in C or C++ ; CGPA 3.0/enrolment in a CSC subject POSt.
The student is expected to read background material on the hardware and local software, and should be comfortable with elementary linear algebra, geometry, and vector calculus. It is also assumed that the student is comfortable programming in basic C++.
Recommended preparation: MAT237Y1, MAT244H1.
Links to lecture slides are required readings. These links are available before each lecture (but may be minimally altered for the lecture).
Online notes present the slides in greater detail and are strongly suggested reading. Sections under the Textbook column refer to strongly suggested readings from Shirley’s textbook. External links point to online resources (e.g., Wikipedia and MathWorld) that you may find helpful. They are not required readings.
|Part I: Basic Graphics Primitives|
|Tutorial 1||Hello, I’m your TA. There’s no tutorial this week.|
|Lecture 1||Introduction & raster operations Line drawing, 2D polygons, parametric 2D curves (circle, ellipse)
Wikipedia List of curves
|lecture1.pdf, lecture1_6up.pdf||3.1–3.5; 2.5–2.6|
|Tutorial 2||C++, OpenGL and Hierarchical Models|
|Lecture 2||Interpolation & 2D Transformations Rigid, conformal, affine transformations. Homogeneous coordinates. Coordinate-free geometry.
|lecture2+3.pdf, lecture2+3_6up.pdf||6.1; 2.4; 6.3|
|Tutorial 3||C++, OpenGL and Hierarchical Models|
|Lecture 3||3D Surfaces Planes, tangents, normals, bilinear patches, quadrics/superquadrics. 3D transformations.
|2.9–2.11; 13.1; 6.2|
|Part II: Viewing in 3D|
|Part III: Appearance Modeling and Rendering|
|Part IV: Interpolation and Animation|
Academic Honesty (Please Read!!!)
Links to assignments will be available on the hand-out dates
Tentative dates based on 2016. Proper 2017 dates coming soon…
|Date handed out||Due date||Assignment||Helper code|
|Sept. 20||Oct 11|
|Oct 11||Nov 1|
|Sept. 13||Wooden Monkey: Dec. 3
Currently, there is no textbook that reflects all the material covered in this class. Only the Slides in the Lecture Schedule are required reading.
In-class lectures will be supplemented by online notes (lecture slides and course notes) as well as portions of the following recommended textbook:
Textbook sections and online notes listed next to each lecture are strongly suggested reading.
We will not be using the following books directly, but they offer different perspectives on the topics that will be covered in class.
There will be three assignments in total, composing 10%, 15% and 25% of the total grade, respectively. Assignments will be roughly tri-weekly. The assignments will have a written portion and a programming portion.
Assignments are due by 11:59pm on the due date. Assignments (including the written part) should be submitted to the TA in electronic form. Exact submission instructions will be provided with the first assignment. The written portions if hand-written should be legibly scanned and submitted electronically as well.
For each day late, including weekends, 15% of the total possible points will be deducted (a day ends at the due time).
No work will be accepted if it is more than five days late.
Academic honesty is a very serious matter and can result in very serious consequences. Note that academic offences may be discovered and handled retroactively, even after the semester in which the course was taken for credit. This is a challenging class aimed at teaching you the fundamentals of computer graphics. You wont learn much if you cheat but you might get a good grade if you get away with it. If all you want is a good grade take an easier class where you wont have to cheat!
For purposes of this class, academic dishonesty is defined as: