Computer Graphics 2

0433 L 357
Instructors: Prof. Dr. Marc Alexa
Contact Olivier Rouiller
Course structure: Integrierte Veranstaltung (IV) – 4 SWS
Room: MA 041
Date: Thursdays 14:00 – 16:00 every week
Start : 11 April 2013
Description: The course introduces the basics of Geometry Processing. Mathematical models, data structures and algorithm to represent geometry on modern computer applications are presented and manipulated through practical exercises. The techniques seen in the course are fundamental for application like 3D modeling, geometry reconstruction from scanned objects, physical simulation, …
  • Spatial Data structures
  • Parametric curves and surfaces
  • Implicit curves and surfaces
  • Mesh reconstruction and simplification
  • Mesh parametrization
  • Re-meshing and smoothing
  • Subdivision surfaces
  • Mesh deformation
  • Programming skills in an oo-language
  • Algorithms and data structures
  • Experience with 3D visualization (ex:OpenGL)
  • Linear Algebra
  • Analysis
Registration: Please send an email with your name, student id. and the name of the course to Gaëlle Fer-Arslan
Forum: Isis page of the course



Exercise 4 : Mesh optimization

Exercise 3 : Approximation and tessellation of implicit surfaces

Caveat: normals of some dataset need to be flipped.

Exercise 2 : Heightfield approximation

The technical report about least squares, weighted least squares and moving least squares by A. Nealen might be helpful for solving the exercise.
We suggest using the Newmat library or the Eigen library for solving the linear systems occuring in this exercise.

Exercise 1: Hierarchical Spatial Datastructures

Your implementation should be able to easily handle the files in Please also experiment with the data in, your implementation should be able to handle this file in a reasonable amount of time.

Additional large models can be downloaded from e.g. the

Stanford 3D Scanning Repository or the AIM@SHAPE Shape Repository