Our research area is *computational geometry**.* More precisely, our focus is to design worst-case efficient algorithms for geometric problem. Our work is mostly theoretical.

Geometric optimization refers to optimization problems involving geometric objects such as points, lines or balls. These problems are motivated by applications in operations research, statistics and computer vision.

The goal is to find feasible or optimal paths in geometric environments. This can involve obstacles, direction constraints and anistropic metrics.

The straight skeleton of a polygon is a straight-line graph obtained as the trace of the vertices when the polygon is shrunk, each edge moving at the same speed. This structure has many applications, such as the efficient computation of offset polygons and can give the edges of a roof from a building groundplan.