B481 Interactive Graphics
|
Modified: |
|
Date |
Reading |
Lecture Notes |
Exercises |
Homework Due |
Tests |
|
Aug 26 |
Chapter 1 - Introduction and implementing 2D raster graphics |
0, 1, 2, 3 | |||
| 28 | Chapter 2 - OpenGL graphics programming | 4, 5, 6 | 1 | ||
|
Sep 2 |
Chapter 3 - Input and interaction | 7 |
2 Activity |
||
| 4 | 8, 9 | 1 | |||
| 9 | Chapter 4 - Geometric objects and transformations | 10 | |||
| 11 | 11 |
3 Activity |
|||
| 16 | 12 | 2 | |||
| 18 | 13 | ||||
| 23 | Chapter 5 - Viewing | 14 15 | |||
| 25 |
Fly Around an Object discussion Shirokawa - Fly Around Cube Visual Studio Solution Shelfer - Using C# HOWTO use with OpenGL |
16 | 3 | ||
| 30 | 4 | ||||
|
Oct 2 |
Sexton - Using Python HOWTO use with OpenGL |
Review 17 |
Activity | ||
| 7 | Chapters 1-4 | 4 | 1 | ||
| 9 | Chapter 6 - Shading | 18 | 5 | ||
| 14 | 19 |
Last Chance for HW's 1-3 |
|||
| 16 | 20 | 5 | |||
| 21 | Chapter 8 - Discrete techniques - Texturing | 24/24.5/24.6 | 6 | ||
| 23 | 27.5,25/26 |
Last Chance for HW 4 |
|||
| 28 | 27 | Project | |||
|
Nov 4 |
Chapter 10 - Modeling | 31 | 6 | ||
| 6 | Chapter 5-6, 8 | 2 | |||
| 11 | 32/32.1/33/33.5 | ||||
| 13 | Chapter 7 - From vertices to fragments | 21/22/23 | |||
| 18 | Chapter 11 - Curves and surfaces | 34/35 |
Last Chance HW 5&6 |
||
| 20 | 36/37 | ||||
|
Dec 2 |
38 | ||||
| 4 | Last class | Project | |||
| 9 | 5:45-7:35P Chapter 7, 10, 11 and Projects | Answers | 3 | ||
| 15 | 5:00P | Last chance |
Note: The syllabus represents an estimate of the material that can be covered and is subject to revision. Chapters 1-6 will be covered completely, only selected topics of Chapters 7-8, 10, 11 will be covered.
| Instructor: | Raymond F. Wisman |
| Office: | LF122 TR 1:00-3:00P and by appointment |
| Class: | PS-016 TR 5:30-7:20P |
| Phone: | 941-2465 |
| Email: | |
| Web: | www.ius.edu/rwisman/B481 |
| Text: | Interactive Computer Graphics (5e) by Edward
Angel ISBN: 0-321-53586-3 Recommended: OpenGL A Primer (2e) by Edward Angel ISBN: 0-321-23762-5 Web site: http://www.cs.unm.edu/~angel/BOOK/INTERACTIVE_COMPUTER_GRAPHICS/FIFTH_EDITION/ |
| Supplements: |
OpenGL
Reference Manual (Blue book - older version online)
Addison-Wesley. Full descriptions of each set of OpenGL commands. OpenGL Programming Guide 5e (Red book - older version online) Addison-Wesley ISBN: 0-321-33573-2. Guide to graphics programming in OpenGL. OpenGL Tutorial (NeHe by Jeff Molofee). Includes 48 tutorials on OpenGL. Note that we use GLUT to handle many of the low-level Windows programming details which are covered in the tutorials. |
| Course: | B481 Interactive Computer Graphics (4 cr.) P: C343, Math
M303. Computer graphics techniques. Introduction to graphics hardware and software. Two-dimensional graphics methods, transformations, and interactive methods. Three-dimensional graphics, transformations, viewing geometry, object modeling, and interactive manipulation methods. Basic lighting and shading. Video and animation methods. |
| Software: | C++ (for course discussion) and OpenGL. Other programming languages can be used for assignments. |
| Goals: | See B481 Course Goals |
| Grade Scale: Grade Book |
A+ 97% - 100% A 93% - 96%
A- 90% - 92% B+ 87% - 89% B 83% - 86% B- 80% - 82% C+ 77% - 79% C 73% - 76% C- 70% - 72% D+ 67% - 69% D 63% - 66% D- 60% - 62% F 0% - 59% |
|
Course Evaluation: |
Homeworks 40%
Homework grade reduced 20% each calendar day late. Project 15% Exams 45% |
| Ethics: | All work is subject to the Indiana University Code of Student
Ethics. Learning requires a partnership between the instructor, authors, researchers and students; therefore students are encouraged to use any and all resources available to solve homework problems and complete programming assignments. However, students must:
For example, students may work in groups to solve homework problems provided each student creates their own (not copies) solutions and clearly lists all group members or other sources such as authors of texts or on the Internet. Likewise, software that performs assigned functionality may not be directly used but the source code may be consulted provided it is subsequently cited. Changing the spelling of algorithm identifiers does not constitute creating an original solution. It is absolutely essential to note that failure to cite any contributing source will be considered cheating regardless of the reason for the omission. Likewise, verbatim duplication of any source, whether from another student, a text, etc. will always be considered plagiarism. Violation of any aspect of this policy will result in a failing grade for the course. |