This project brings together computational and probabilistic geometers to tackle new probabilistic geometry problems arising from the design and analysis of geometric algorithms and data structures. We focus on properties of discrete structures induced by or underlying random continuous geometric objects. This raises questions such as:
- What does a random geometric structure (convex hulls, tessellations, visibility regions…) look like?
- How to analyze and optimize the behavior of classical geometric algorithms on “usual” inputs?
- How can we generate randomly “interesting” discrete geometric structures?
Végas (Nancy) - LIGM (Marne-la-Vallée)
Xavier Goaoc (coordinator)
|LMRS (Rouen) - LMA (Poitiers) - MAPMO
|The project is supported by white program of the French National Research Agency, from December 31, 2011 to December 31, 2015.|