Contact : Marc Glisse .
Marc Glisse, DataShape, INRIA Saclay - .
Clément Maria, DataShape, INRIA Sophia Antipolis - . (until 2023-2024)
This course is an introduction to the field of Computational Geometry and Topology (the later has become popular under the name Topological Data Analysis). Fundamental questions to be addressed are : how can we represent complex shapes (in high-dimensional spaces)? how can we infer properties of shapes from samples? how can we handle noisy data? how can we walk around the curse of dimensionality?
The course will be given in English, except if all participants speak French fluently. All material is in English.
2024-2025: The course consists of 8 lectures of 3h each, on Tuesdays at 8:45. Lectures will take place in room 1002 of the Sophie Germain building.
2023-2024: The course consists of 8 lectures of 3h each, on Thursdays at 12:45. Lectures taught by [SO] will take place in room 1002 of the Sophie Germain building. Lectures taught by [CM] are remote, through BBB or a similar visio system (details will be sent by e-mail).
2022-2023: The course consists of 8 lectures of 3h each, on Mondays at 16:15. The first 4 lectures will take place in room 1004. The last 4 will be remote, through BBB or a similar visio system.
2021-2022: The course consists of 8 lectures of 3h each, on Fridays at 12:45 in room 1004.
2020-2021: The course consists of 8 lectures of 3h each, on Wednesdays at 8:45 in room 1013.
2019-2020: The course consists of 8 lectures of 3h each, on Thursdays at 12:45 in room 1013.
2018-2019: Class starts in December. The course consists of 8 lectures of 3h each, on Tuesdays at 12:45.
2017:
Introduction .
A related course and additional slides (in french) can be found at http://www.college-de-france.fr/site/jean-daniel-boissonnat/course-2016-2017.htm
All fundamental notions will be introduced.
Text books
- J-D. Boissonnat, F. Chazal and M. Yvinec, Geometric and Topological Inference, Cambridge University Press .
- J-D. Boissonnat and M. Yvinec, Algorithmic Geometry. Cambridge University Press, 1998.
- E. Edelsbrunner and J. Harer, Computational Topology, an introduction. AMS 2010.
- S. Har-Peled, Geometric Approximation Algorithms, American Mathematical Society, USA 2011
- Motwani and Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
Research papers
- J-D. Boissonnat, A. Ghosh. Manifold reconstruction using tangential Delaunay complexes. Discrete Comput. Geom., 51: 221-267, 2014.
- F. Chazal, D. Cohen-Steiner, A. Lieutier. A Sampling Theory for Compacts in Euclidean Space, Discrete Comput. Geom., 41:461-479, 2009.
- F. Chazal, D. Cohen-Steiner, Q. Mérigot. Geometric Inference for Probability Measures. J. Foundations of Comp. Math., 2011, Vol. 11, No 6.
- F. Chazal, L. J. Guibas, S. Y. Oudot, P. Skraba. Persistence-Based Clustering in Riemannian Manifolds. J. of the ACM, Vol 60, No 6, article 41.