• Chapter 01. Overview

• Chapter 02. Mesh definitions and terminologies
• Chapter 03. Mesh representation and data structure
• Chapter 04. Discrete differential geometry operators
• Chapter 05. OpenGL programming: a brief guide
• Chapter 06. Data acquisition
• Chapter 07. Surface reconstruction
• Chapter 08. Mesh smoothing
• Chapter 09. Mesh simplification
• Chapter 10. Level of details
• Chapter 11. Geometry compression
• Chapter 12. Mesh parameterization
• Chapter 13. Warping and morphing of graphical objects

• Chapter 14. Mesh Morphing

• Chapter 15. Mesh editing
• Chapter 16. 2D texture synthesis
• Chapter 17. Texture synthesis on 3D surfaces
• Chapter 18. Remeshing
• Chapter 19. Surface completion
• Chapter 20. Mesh segmentation
• Chapter 21. Shape matching and retrieval
• Chapter 22. Subdivision surfaces
• Chapter 23. Point based surface representation and processing
• Chapter 24. Other topics

• Assignment #1 -- Due Sunday, October 21, 2007
• Assignment #2 -- Due Sunday, November 26, 2007

Note: Please zip your submission stuffs of the assignment into one single file either using WinZip or WinRAR. Name the file name as "ID_Name_Assignment_#1.zip" or "ID_Name_Project _#1.zip" where ID is your unique ID number in the class. For Example, my submission file name might be "66_刘利刚_Assignment_01.zip".

Requirements on Assignments
　

Requirements

• All students are expected to study the relevant portions of the course to see if some open problems can be solved after each class.
• All programming for this course will be done in C++ according to the coding styles. We will compile and test programs on MS Visual C++ Version 6.0+ under Windows XP. It is the responsibility of the student to submit a program that will successfully compile and execute on the specified platform.
• A document about your programming assignment is also required according to the Computer Program Documentation Standards.
• The final literature survey should be written professionally by summarizing a series of related papers about some topic you like, not only several papers.

Assignment Submission

• All students are expected to complete their homework assignments by their due dates.
• Submission stuffs
  Your ID number, your name, the assignment number or name, source codes, related documents
• Grading of programming assignments will be based on the following criteria:
  1. Correctness of program.
  2. Output from program that adequately demonstrates correctness.
  3. Documentation, internal and external, included as appropriate according to the Computer Program Documentation Standards.
  4. Efficient use of algorithms and appropriate data structures.
  5. Stress - program must function correctly under all and/or extreme and unusual combinations of input.
  6. Creativity - credit for innovation in interface, implementation, style, etc.
• Submission approach
  Please submit your assignment stuffs via my FTP not via email.
• Late Work
  No late work will be accepted. If you know you will miss a test due to an excused absence, you must contact me ahead of time to schedule a make-up session.
• Late programming assignments follow the following rules:
  25% deduction for 1-day late
  50% deduction for 2-day late
  Not accepted after being 2-day late
  Regarding your marks, contact the grading TA within two weeks after the assignment is handed back. After this two-week period, your assignment stays as it is graded.

What constitutes Creativity ?

Creativity is any substantial improvement beyond the basic solution - it can be applied to any part of the project. For example, the following are relevant in most cases :

• User Interaction
      ̶  It would be nice to present the user with options to either test the program using internal tests or an interactive interface
      ̶  Work around limitations in the program. For example, if the program asks for lines of input and quits when it sees "X", invent a special syntax (called an escape sequence) to allow the user to type in "X" without the program exiting. Hypothetically, if the user enters $X the program interprets it as X, if the user enters $$ the program interprets it as $ and if the user enters X the program exits.
• Visualization
      ̶  A representation of how data is actually being stored in the data structure, by specific position and value (this would even help greatly with debugging) - this could be accomplished with specialized data access routines for output formatting
• Testing
      ̶  Simulating real-world conditions for input by making some assumptions about the distribution of operations performed and the rate of operations, then simulating using random number generators
      ̶  Intensively testing creation, usage and destruction of the data structure to prove there are no memory leaks
      ̶  Exhaustive automatic testing - go through many (or every) possible scenarios for the data structure (up to some time limit). For example, assign "add" and "remove" to a binary variable - then generate all possible strings of operations - test the structure for each case, and test the results automatically in your main program to make sure they are what was expected.
      ̶  Develop a syntax for file-based testing and use this as an option - eg. "enter X" and "retrieve"
• Efficiency
       ̶  Minimize the number of allocations of memory blocks by reusing deleted blocks
  Ask yourself these questions ...
      ̶  How can I make the interface more natural ?
      ̶  How can I make the program run faster ?
      ̶  How can I use less memory/disk space ?
      ̶  Have I thoroughly tested my program ? Will my program survive real-world tests ? Will my program survive worst-case scenario tests ?

Professional Conduct

As a student in our class, you are expected to conduct yourself in a professional manner.

Limited Collaboration Policy. Unless otherwise indicated, any homework assignment given in this class will be an individual assignment. The work you submit is to reflect the knowledge, understanding, and skill that you have attained as an individual. However, the instructor does want to encourage the development of a community of scholars who are actively engaged in discussion of the ideas related to this course. With this in mind, you are allowed to discuss solutions of the homework and programming problems with other students if done so according to the following guidelines:

• You may discuss ideas for homework and programming assignments with your classmates. However, you cannot collaborate on writing the solution or the program code. That is, you can talk about the problems and ideas for solving them, but you cannot write things down with anyone else. You are, of course, prohibited from copying or seeing another student's written solution, and you are not allowed to show your work to anyone else.
• You should accept help with care. If you work too closely with another student, you might mislead yourself into believing that you understand the concepts and techniques better than you actually do. Don't forget that the instructor has office hours and can probably give you hints or suggestions to get you started.
• You should give help with care. Do not help anyone too much. When you have solved a problem, it is tempting to just tell other students how you solved it. Instead, try to allow them to come to the solution on their own. Maybe give them a hint to help them get "over a hump." Remember that helping someone too much will hurt them in the long term if they can't work through problems on the exams by themselves. So avoid the temptation to do so. If you can't help other students without giving away the whole solution, direct them to see the instructor (who may or may not have a way to "edge" them toward the solution).
• You are not obligated to help anyone. If you feel uncomfortable helping another student for any reason, please direct them to see the instructor.