3D Scanning and Geometry Processing
Lecturer:  Mario Botsch 
Assistant:  Martin Komaritzan 
Lecture:  Tue, 1012, T2208 
Exercise:  Wed, 1214, V2229 
eKVV:  392130 
Credits:  5 points 
Content
Following digital audio, images, and video, 3D models can be considered the next wave of digital multimedia. Virtual geometric models are ubiquitous in computer games, computergenerated movies, CAD systems, numerical simulation, and many other applications. In these fields, triangle meshes are the standard representation for geometric objects. Their conceptual simplicity enables highly efficient processing of geometric data sets.
In this course we discuss the geometry acquisition and processing pipeline: We start with different methods for 3D scanninig, which typically yield a large amount of sample points. This point cloud is subsequently converted into a triangle mesh. The resulting meshes then have to be optimized with respect to different quality criteria: Mesh smoothing removes noise, mesh simplification reduces the number of triangles while preserving the overall shape, remeshing improves the shape of triangles. Mesh parameterization computes a uvlayout for texturing the objects, and mesh deformation allows to change its geometric shape. Finally, mesh compression aims at compact storage of massive 3D models. Besides these methods we will also learn about some fundamental concepts in geometry processing, which are used in most of the approaches (e.g. discrete differential geometry, solving partial differential equations on a mesh).
Most of the techniques you only understand if you really try to use them, i.e., if you implement them. Our exercises therefore consist of a few miniprojects, where students can work on their own or in groups of 24 and implement the methods learned in the lecture. The overall goal of the programming exercises is to scan, reconstruct, and optimize ourselves, based on the fullbody scanner of our research group, to obtain a 3Dprintable virtual clone.
Prerequisites
 Basic knowledge of linear algebra is required.
 The programming exercises will be done in C++.
Literature
 Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, Bruno Levy: Polygon Mesh Processing, AK Peters, 2010.
Tentative Schedule & Slides
Week  Lecture (Tuesday)  Exercise (Wednesday) 

Introduction (HTML)
3DScanning (HTML) 

Surface Reconstruction 1 (HTML)  Scanning Session  
Surface Reconstruction 2 
Surface Reconstruction 

Delaunay Triangulations  
Decimation & Remeshing  
Differential Geometry  Decimation & Remeshing  
Discrete Differential Geometry  
Mesh Smoothing  
Mesh Parameterization  Mesh Smoothing  
Mesh Fairing  
no lecture  
Xmas holidays  
Mesh Deformation  
Template Fitting
Morphable Models 
Eigen Faces  
Mesh Compression  
ConstraintBased Modeling
Conclusion 
Conclusion 