UPDATED TIMETABLE Digital Geometry Processing: Algorithms for Representing, Analyzing and Comparing 3D shapes

Speaker:  Maks Ovsjanikov - Ecole Polytechnique, Paris
  Thursday, May 24, 2018 at 8:30 AM first lecture room M
**PLEASE, NOTICE THE UPDATES IN THE TIMETABLE**

MINI-COURSE TITLE
:  DIGITAL GEOMETRY PROCESSING. ALGORITHMS FOR REPRESENTING, ANALYSING AND COMPARING 3D SHAPES

SPEAKER: PROF. MAKS OVSJANIKOV  (ECOLE POLYTECHNIQUE, PARIS)

DATE, PLACE:   22/5-1/6/18,   
COURSE DURATION: about 12h course, including laboratory sessions
UPDATED TIMETABLE

Thursday, May 24  8.30-11.30 room M
Friday, May 25  8.30-11.30 room I
Monday, May 28  14.30-17.30 room M
Friday, June 1st 8.  30-11.30 Lab Ciberfisico
 

Course description: This course will introduce the fundamental concepts for creating and analyzing 3D shapes on the computer. Throughout the course, we will put special emphasis on techniques that are based on discrete Laplace operators, which have, remarkably, permeated all areas of discrete shape processing. We will start with the basics of surface reconstruction from point clouds, and point cloud registration (alignment). We will then move to various approaches to shape analysis and processing, including the definitions and applications of various discrete differential geometry operators. More specifically, topics will include:
 
- Surface reconstruction from point samples
Shape Registration (alignment)
Discrete differential geometry on triangle meshes
Shape parameterisation
Shape deformation and remeshing
Shape retrieval
Non-rigid shape matching

Prerequisites: The students should have a good understanding of the basics of numerical linear algebra (solving linear systems, computing eigen-value and singular-value decompositions of matrices, etc) and experience with programing in Matlab (or potentially Python). Some background in differential geometry would be useful but is not necessary.

Programme Director
Giandomenico Orlandi

External reference
Publication date
March 18, 2018

Studying

Share