15 datasets found

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...

Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed...

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...

This thesis addresses satellite layout problems. The goal is to develop efficient algorithms that lead to Simple tools that help the design office engineer in his...

This thesis deals mainly with Delaunay triangulations. It is shown that the average complexity of k-dimensional merge processes - according to unRnished sites - is...

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...

Rapport interne.

Defining shapes by iteration allows us to generate new structures with specific properties (roughness,lacunarity), which cannot be achieved with classic modelling.For...

Article dans revue scientifique avec comité de lecture.

Article dans revue scientifique avec comité de lecture.

Article dans revue scientifique avec comité de lecture.

Colloque avec actes et comité de lecture. internationale.

Article dans revue scientifique avec comité de lecture.

Article dans revue scientifique avec comité de lecture.

International audience