CS795 Spring 2011: Geometric Processing

• Jyh-Ming Lien
• jmlien@cs.gmu.edu
• Office: ENGR 4442
• Office hours: Tuesdays 3-5pm

Course Scope

Quote from Polygon Mesh Processing: "Geometry processing, or mesh processing, is a fast-growing area of research that uses concepts from applied mathematics, computer science, and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation, and transmission of complex 3D models. Applications of geometry processing algorithms already cover a wide range of areas from multimedia, entertainment, and classical computer-aided design, to biomedical computing, reverse engineering, and scientific computing."

Prerequisites

• Working knowledge of C/C++
• In addition, you should already know:
  • OpenGL for graphical display
  • basic data structures and algorithms

Required Textbook

There is no required textbook.

Recommanded books/readings:

• Polygon Mesh Processing by Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, Bruno Levy, 2010, ISBN # 978-1-568-81426-1
• Geometric and Solid Modeling by Christoph M. Hoffmann. It appears that you can download the entire book from the author's website.
• An Integrated Introduction to Computer Graphics and Geometric Modeling by Ronald Goldman, ISBN: # 978-1-439-80334-9
• Computational Geometry: Algorithms and Applications by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Cheong, third revised edition, Springer-Verlag, 2008. ISBN # 978-3-540-77973-5. You should be able to view the entire textbook from a GMU IP address.
• Computational Geometry in C by Joseph O'Rourke (Cambridge University Press; 2008 edition, ISBN # 978-3-540-77973-5).

More reading materials will be posted on the blackboard.

Grading

1. Assignments 25%:
2. Presentations 25%
3. Course project 50%

List of Topics (tentative)

• Mesh Smoothing
• Mesh Simplification
• Mesh Reconstruction
• Mesh Repair
• Mesh Registration
• Mesh Decomposition/Meshing
• Mesh Deformation
• Remeshing
• Mesh boolean opeartions
• Continous collision detection
• penetration depth estimation
• Swept volume, offset, Minkowski sum
• Distance field

Policies

All required assignments should be completed by the stated due date and time. The total score of your assignment score will be 10 points less every extra day after the due date (i.e., the 100 total points will become zero after 10 days pass the due date). 0 point for missing your own presentation.

Please note that all coursework is to be done independently. Plagiarizing the homework will be penalized by maximum negative credit and cheating on the exam will earn you an F in the course. See the GMU Honor Code System and Policies at this page and this page. You are encouraged to discuss the material BEFORE you do the assignment. As a part of the interaction you can discuss a meaning of the question or possible ways of approaching the solution. The homework should be written strictly by yourself. In case your solution is based on the important idea of someone else please acknowledge that in your solution, to avoid any accusations.