I am currently a researcher at INRIA Saclay - ╬le-de-France in the DataShape team.
I was a postdoctoral researcher in Grenoble at gipsa-lab and then in California at UC Davis.
I prepared my PhD in the VEGAS project.
Here are some of my research topics.
The size of the silhouette of a polyhedron is often much smaller than the size of the whole polyhedron.
Octrees can be used to help speed up ray-shooting. Here we compute almost optimal octrees for a cost-measure introduced by Aronov, Br÷nnimann, Chang and Chiang. Published at CCCG'02, LATIN'04 and CGTA.
The number of lines tangent to 4 among k polytopes of total complexity n is at most n2k2.
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra published at CCCG'02, SoCG'04, SIAM Journal on Computing.
The results on lines tangent to polytopes allow us to study the complexity of umbras.
Between Umbra and Penumbra published at SoCG'07 and CGTA.
I found some sets of 4 disjoint unit balls that have interesting common tangents, see here.
On the complexity of the sets of free lines and free line segments among balls in three dimensions, published at SoCG'10 and DCG.
Predicates for line transversals to lines and line segments in three-dimensional space published at SoCG'08.
Helly-type theorems for approximate covering published at SoCG'08 and DCG.
Farthest-Polygon Voronoi Diagrams published at ESA'07 and CGTA.
A generalisation of the result of Cohen-Steiner, Edelsbrunner and Harer.
Proximity of Persistence Modules and their Diagrams and a short version published at SoCG'09.
The structure and stability of persistence modules (2012).
Using persistent homology to simplify functions defined on 2-manifolds.
Persistence-sensitive simplication of functions on surfaces in linear time.
Metric graph reconstruction from noisy data published at SoCG'11 and IJCGA.
Professional phone: +33 1 74 85 42 79