Course Instructor | Dr. C.-K. Shene |
Office | 305 Rekhi CS Hall |
Class Meeting | Monday and Wednesday, 16:05 - 17:20, Rekhi 217 |
Office Hour | Monday and Wednesday, 15:05 - 15:55, 305 Rekhi CS and by appointment |
Phone | (906) 487-3392 |
shene@mtu.edu |
Textbook is not required because all class notes and supporting software are available in /classes/cs5611/common/.
|
Monday | Tuesday | Wednesday | Thursday | Friday |
13:05 - 13:55 | |
Dept. Meeting | |
|
|
14:05-14:55 |
CS3331 Fisher 328 |
|
CS3331 Fisher 328 |
|
CS3331 Fisher 328 |
15:05-15:55 |
Office Hour Rekhi 305 |
|
Office Hour Rekhi 305 |
|
Department Seminar |
16:05-17:20 |
CS5611 Rekhi 217 |
|
CS5611 Rekhi 217 |
|
|
Topics | Reading |
Rendering Polygonal Objects | Backface Culling, Clipping Algorithms, Rasterization, Hidden Surface Removal, Z-buffer, and Shading Algorithms (e.g., Gourd Shading and Phong Shading) |
Local Illumination Models | Ambient Light, Diffuse Reflection, Atmospheric Attenuation, Specular Reflection, Single and Multiple Light Sources |
Ray Tracing | Recursive Ray Tracing Illumination Model, Intersection Computation, Shadows, Bounding Volumes, Backward vs. Forward Ray Tracing |
Radiosity | The Radiosity Matrix, Progressive Refinement, Form Factors, the Hemicube and Hemisphere methods, Other Radiosity Topics |
Photon-Mapping | Photons, Photon Tracing, Photon Scattering, Storing Photons, Rendering, Radiance Estimate |
Anti-Aliasing Techniques | Supersampling algorithms, filtering, the A-buffer, Stochastic Sampling |
Texture Mapping | Mapping During Modeling, Two-Stage Mapping, Reverse Projection, Mapping Polygons, Mapping Parametric Patches, Bump Mapping, View-Dependent Mapping, Procedural Texture Mapping |
Meshes | Mesh Definition and Generation, Mesh Simplification, Mesh Compression, Multiresolution Modeling |
Subdivision and Refinement | Corner cutting, Chaikin's Algorithm, Refinement Process, Mesh and Refinement Operators, Doo-Sabin Algorithm, Catmull-Clark Algorithm, Peters-Reif Algorithm, Loop Algorithm |
Parametric Curves and Surfaces | Bézier, B-spline and NURBS curves and surfaces |
Other Topics | To Be Determined Later |
Grading
The following are weights assigned to homework, exams and term project.
The term project will be evaluated based on (1) your presentation,
(2) your term paper, and (3) your implementation.
Homework/Programming | Exams | Term Project |
20% | 30% | 50% |
No late programming assignments will be graded, except that you have a valid excuse.
No assignment-specific assistance should be given nor received on any programming assignment. Any outside help concerning the use of the computer facilities is acceptable. You may discuss the meaning or intent of an assignment, but not ways to program it. All work turned in must be completely your own. You must not share code or even outlines! Any and all use of programs from other texts or references must be explicitly stated as part of program documentation. In general, any acts of plagiarism will result in a failing grade for the course along with the submission of a report to the Dean of Students. See the hand-out on Computer Science Policy on Cheating and Academic Integrity Policy for more details.
``MTU complies with all federal and state laws and regulations regarding discrimination, including the Americans with Disability Act of 1990 (ADA). If you have a disability and need a reasonable accommodation for equal access to education or services at MTU, please call Dr. Gloria Melton, Associate Dean of Students, (2212). For other concerns about discrimination, you may contact your advisor, department head, or the Affirmative Action Office (3310).''
Week 1 | Week 2 | Week 3 | Week 4 | Week 5 | Week 6 | Week 7 |
Week 8 | Week 9 | Week 10 | Week 11 | Week 12 | Week 13 | Week 14 |