direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Computer Graphics 2 (SS 2012)

0433 L 357
Instructor:
Prof. Dr. Marc Alexa, Prof. Dr. Bernd Bickel
Contact
Ronald Richter [1]
Course structure:
Integrated event (IV) - 4 SWS
Room:
MA 041
Date:
Thursday   2pm  -  4pm  
Start : 12 Apr 2012
Topics:
Modeling
  • Parametric curves and surfaces
  • Implicit curves and surfaces
Triangular meshes
  • Compression
  • Simplification
  • Multiresolution models
Comments:
Modul CG2 - Modeling in Computer Graphics

Prerequisites

  • Programming skills in an oo-language
  • Algorithms and data structures
  • OpenGL
  • Linear Algebra
  • Analysis
ISIS (Forum)
Fakultät IV /
Institut für Technische Informatik und Mikroelektronik /
Computer Graphics 2 (SoSe 2012) [2]

News

  • 05.07.12: Exam schedule available (pdf [3])
  • 09.05.12: Group list and presentation schedule available (download [4])

Exercise 4: Simplification and Subdivison of Triangle Meshes

Lupe [5]

Additional material:

  • Surface Simplification Using Quadric Error Metrics [6], Michael Garland and Paul S. Heckbert
  • Sqrt(3) Subdivision [7], Leif Kobbelt
  • Smooth Subdivision Surfaces Based On Triangles [8], Charles Loop

Links:

  • OpenMesh (www.openmesh.org [9])

Exercise:

  • Exercise sheet [10]

Exercise 3: Approximation and polygonization of implicit surfaces

Lupe [11]

Caveat: normals of the horse, hound, rhino and snail dataset need to be flipped.

  • Exercise sheet [12]
  • Exercise notes [13]
  • Point data [14]

Exercise 2: Approximation of heightfields

Lupe [15]

The technical report [16] 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 [17] library or the Eigen [18] library for solving the linear systems occuring in this exercise.

  • Exercise sheet [19]
  • Exercise slides (pdf) [20]
  • Additional notes [21]
  • Point data (zip, 16 MB) [22]
  • Newmat [23] and Eigen [24] examples

Exercise 1: Hierarchical Spatial Datastructures

Lupe [25]

Your implementation should be able to easily handle the files in pointdata_small.zip. Please also experiment with the data in pointdata_large.zip, 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 [26] or the AIM@SHAPE Shape Repository [27]

  • Exercise sheet [28]
  • Exercise notes [29]
  • Example C++ framework [30]
  • Small point data (zip, 2.9 MB)
    [31]
  • Large point data (zip, 57.8 MB) [32]



Slides

Slides
12.04.2012
Introduction (pdf [33])
Parametric Curves I (pdf [34])
19.04.2012
Parametric Curves II (pdf [35])
26.04.2012
Parametric Surfaces (pdf [36])
03.05.2012
keine Vorlesung / no lecture
10.05.2012
Implicit Curves and Surfaces (pdf [37])
24.05.2012
Polygonal Meshes (pdf [38])
31.05.2012
Smoothing (pdf [39])
07.06.2012
Decimation (pdf [40])
14.06.2012
keine Vorlesung / no lecture
21.06.2012
Parameterization (pdf [41])
Remeshing (pdf [42])
28.06.2012
Deformation (pdf [43])
05.07.2012
Outro (pdf [44])

Links

  • Spectral Mesh Processing SIGGRAPH Asia 2009 Course 32 [45]
  • Polygon Mesh Processing Book Homepage [46]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

Copyright TU Berlin 2008