-
The monotonicity of f-vectors of random polytopes
Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional... -
Towards dynamic randomized algorithms in computational geometry
Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed... -
On the Expected Size of the 2D Visibility Complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the expected asymptotic number of free bitangents... -
Common Tangents to Spheres in R^3
We prove that four spheres in $\R^3$ have infinitely many real common tangents if and only if they have aligned centers and at least one real common tangent. -
Triangulations and quadrics
Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangulate the convex hull of the projection of F on the xy-plane. This... -
Construction of minimization sequences for shape optimization
International audience -
Revisiting the Voronoi Description of Protein-Protein Interfaces: Algorithms
International audience -
The Stability of Delaunay Triangulations
Submitted to IJCGA (Special issue for SoCG 2012) -
Output-sensitive Computational Geometry
This thesis deals with the design of algorithms in computational geometry whose complexity depends on the output-size, the so-called output-sensitive algorithms. We... -
Triangulation de Delaunay et arbres multidimensionnels
This thesis deals mainly with Delaunay triangulations. It is shown that the average complexity of k-dimensional merge processes - according to unRnished sites - is... -
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 Generic Lazy Evaluation Scheme for Exact Geometric Computations
We present a generic C++ design to perform efficient and exact geometric computations using lazy evaluations. Exact geometric computations are critical for the... -
Multiple-View Structure and Motion From Line Correspondences
International audience -
Structure and Motion From Two Uncalibrated Views Using Points on Planes
International audience -
Dual discrete geometric methods in terms of scalar potential on unstructured ...
International audience -
Extension of algorithmic geometry to fractal structures
Defining shapes by iteration allows us to generate new structures with specific properties (roughness,lacunarity), which cannot be achieved with classic modelling.For... -
Ensembles simpliciaux hiérarchisés et intersections de surfaces
Article dans revue scientifique avec comité de lecture. -
Motion planning of legged robots
Article dans revue scientifique avec comité de lecture.
