Algorithmic Geometry is a young discipline that study from a combinatory and algorithmic perspective the properties of geometric objects like scatter plots, arrangments, geometric graphs or triangulations.
This course takes you on a tour of this discipline, illustrating its wealth of theoretical and practical aspects. In this context, we will introduct a range of problems from the field, from the more classical ones like the calculation of convex envelopes or Delaunay triangulations, to the more recent ones like reconstruction starting of scatter plots, approximation of NP-hard geometric problems, or efficient localisation of plots in large dimensions.
The aim for this course are twofold : on the one hand, highlight the elegance and theoretical validity of the proposed solutions; on the other, show their potential throught applications from fields like graphic informatics, robotics, learning or image processing.
Evaluation modalities: Written exam + written and on machine end-of-term exam
Language: French
- Profesor: Castelli Aleardi Luca