CPSC 441: Computer Graphics

Spring 2008

 

Location/Time: T/R 2:20pm – 3:35pm, HRBB 113

 

Class Web Page: http://faculty.cs.tamu.edu/jchai/cpsc441_Spring2008

 

Instructor:                                                      TA:

Dr. Jinxiang Chai                                             Jianyuan Min

Office: HRBB 527D                                        Office: HRBB 527A

Phone: 862-4251                                            Phone:  739-2289

email: jchai@cs.tamu.edu                                 email: minjianyuan@gmail.com

Office Hours: T&Th:  1:00pm - 2:00pm           Office Hours: M: 9:30 Am-11:00 Am, F: 10:00 Am-11:30Am

                     (or by appointment)

 

Topics and Goals:

This course deals with the fundamentals of computer graphics.  We will emphasize the most basic algorithms and concepts in computer graphics that form the foundation (both historical and practical) for most modern graphics systems.  The emphasis in this class will be on interactive 3D computer graphics, although we will discuss some 2D algorithms, and introduce some non-interactive rendering methods.

 

Goals:

  • Become familiar with basic 2D rendering concepts and algorithms such as line drawing, line and polygon clipping, polygon filling, and antialiasing.
  • Understand 3D rendering techniques including hierarchical model structures, geometric transformations, projections, and hidden surface removal.
  • Understand basic lighting and shading techniques.
  • Understand the basics of color models as they relate to computer graphics.
  • Understand the basics of image processing.
  • Become familiar with basic aspects of 3D animation

 

Topics:

  • Overview of graphics – applications, history, technologies.
  • 2D primitive drawing, including scan conversion, polygon filling, clipping, and antialiasing.
  • 3D geometric transformations including translation, scaling, rotation.
  • Specification of view frusta and projections (parallel and perspective).
  • Hidden-surface removal and z-buffering.
  • Color models.
  • Basic illumination (including flat, Gouraud, Phong) and shading.
  • Texture mapping.
  • Hierarchical 3D model specification.
  • Ray-tracing basics.
  • Keyframe interpolation& rotation representation
  • Animation with Mocap
  • Image processing

 

If time permits, we may be able to cover certain other topics, to be determined at a later date.

 

Upon finishing this class, you should be able to understand how graphics are produced, write your own basic graphics programs, and explore on your own some of the more advanced graphics techniques and algorithms

 

Prerequisites:

The course description lists CPSC 210 or 211 and junior standing as prerequisites.  There will be a significant amount of programming in this class, and students will be expected to use C/C++ for the assignments. 

 

In addition, students should be familiar with basic linear algebra (vector and matrix representation and arithmetic).  A prior course in linear algebra (e.g. MATH 304) is more than sufficient, and many students may have had enough previous exposure without such a class.  A review of most of the relevant material is given in the textbook (Appendix A.1 through A.5).  To ensure that all students are familiar with this material, an online quiz will be required (described below).

 

Grading:

There will be several (7-8) projects throughout the semester.  Each project will have a “possible score,” and each student will receive a “given score” for that project.  The overall project grade will be the sum of the given scores divided by the sum of the possible scores.  There will probably be 900-1000 total homework points.  In addition, there will be a midterm exam and a final.  The overall grade will be determined as follows:

            Projects:         60%

            Midterm:         15%

            Final:              25%

The expected grading scale will be A ³ 90% > B ³ 80% > C ³ 70% > D ³ 60% > F.  Depending on the final percentage distribution, an absolute or relative curve may be applied, though an attempt will be made to avoid this.  In addition, the instructor reserves the right to raise grades near a “borderline” to the next highest letter grade.  Factors weighing into this decision will be the individual student’s perceived effort and class attendance and participation.

Linear Algebra Review:  An online examination testing the basic linear algebra concepts you should know for this class will be required of all students.  Each student will be required to complete this exam by a certain date.  Students may take the exam as many times as they wish until it is passed.  Failure to complete the exam with an acceptable score by the deadline will result in an automatic F for the class.  The details of this exam, including the passing score required and the deadline will be announced in class.

 

Required Textbooks:

            Hearn, Baker.  Computer Graphics with Open GL.  Third Edition, Pearson Prentice Hall, 2004.

Shreiner, Woo, Neider, Davis.  Open GL Programming Guide, Fifth Edition.  Addison-Wesley, 2006.

 

The Hearn and Baker book will be the primary textbook for all required readings.  It gives a broad overview of graphics fundamentals, as well as a broad description of OpenGL.  Although Hearn and Baker includes OpenGL information, the Programming Guide is far more complete, better organized, etc.  It will be far more useful for graphics programming in OpenGL after this class.  OpenGL-specific readings and some assignments will draw on this book.  Note: for the purposes of this class, an earlier edition of the OpenGL Programming Guide could be used – it is likely that only page numbers will change for the material we will cover.

 

Finally, one other book you might want to consider, if you plan on studying graphics further is the following:

Foley, Van Dam, Feiner, Hughes.  Computer Graphics: Principles and Practice (Second Edition in C).  Addison-Wesley, 1996.

Rick Parent. Computer animation: algorithm & techniques. Morgan Kaumann. second edition.

Foley and van Dam is considered the standard book on computer graphics.  While most of the core material is covered in Hearn and Baker, and Hearn and Baker is more up-to-date, Foley and van Dam is more complete, and goes into more depth in many areas. Rick Parent covers the animation basics discussed in the class.

 

Policies:

Attendance: Attendance will not be checked, however it will be considered in borderline decisions for the final grade.  Students with unexcused absences should not expect additional help outside of class and are still responsible for any material or instructions given in class, for turning in assignments on time, and for taking exams at the scheduled times.  Make-up assignments will not be given unless there is a highly unusual circumstance.  If you know that you will be absent for a class, you should let the instructor know ahead of time.

Late Assignments: Assignments are due at the midnight on the given due date. Assignments turned in after that time but before the next class meeting will be considered late.  Each student will be allowed to turn in one late assignment without penalty.  All other late assignments will receive half credit.  Assignments turned in more than one class meeting after the due date will receive no credit.  Certain assignments may not be allowed to be turned in late.

Communication:  A class web page (listed at the top of this syllabus) will be maintained throughout the semester.  Students are responsible for checking both the web page and email regularly for class updates.

Reading:  Readings from the required textbook will be given out throughout the semester.  We will not be able to discuss all of it in class, but you are still responsible for keeping up with these readings.

Code Documentation:  When assignments are graded, source code may be examined to verify the way a solution was achieved or to award partial credit.  It is your responsibility to make sure that your source code is presented in a clear, readable, way.  Even if your code “works,” if the grader can’t understand it, you may lose points.

 

Academic Honesty:

The Aggie Honor Code is: “An Aggie does not lie, cheat, or steal or tolerate those who do.”  Upon accepting admission to Texas A&M University, a student immediately assumes a commitment to uphold the Honor Code, to accept responsibility for learning, and to follow the philosophy and rules of the Honor System. Students will be required to state their commitment on examinations, research papers, and other academic work. Ignorance of the rules does not exclude any member of the TAMU community from the requirements or the processes of the Honor System. For additional information please visit: www.tamu.edu/aggiehonor/

 

For this class, the interpretation of the code will be as follows: Unless specifically stated otherwise, all assignments are to be done on your own, unless specified otherwise.  You may discuss general concepts, and get help in tracking down a persistent bug, but should not copy work, download code from the web or other sources, or work together with other students on problems or programs unless specifically stated otherwise.  By turning in an assignment or exam, you are implicitly assumed to be committing to the honor code.  If you are unsure of whether a type of cooperation is appropriate, check with the instructor or TA first.  That is, you should err on the side of assuming cooperation is not allowed.

 

ADA Statement:

The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact the Department of Student Life, Services for Students with Disabilities, in Cain Hall or call 845-1637.