UE Computational geometry

Degrees incorporating this pedagocial element :


This course presents tools for solving efficiently geometric and topological problems. First, we describe general techniques for the design and analysis of geometric algorithms such as complexity analysis, robustness issues and randomization. We first introduce spatial search data structures, triangulations, Delaunay triangulations and Voronoi diagrams. Using this toolbox, we show how to recover shapes efficiently and accurately from various datasets (e.g. clouds of points, density functions) and how to extract relevant topological and geometric informations from these datasets.