-
On the number of simple arrangements of five double pseudolines
International audience -
K-set Polygons and Centroid Triangulations
This thesis is a contribution to a classical problem in computational and combinatorial geometry: the study of the k-sets of a set V of n points in the plane. First we... -
A tau-conjecture for Newton polygons
One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a...
