Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed since it appeared in M.I Shamos' thesis in 1978. Randomization allows to avoid the use of complicated data structures, and has been proved to be very efficient, from both points of view of theoretical complexity and pratical results. We take particular interest in designing dynamic algorithms : in practice, the data of a problem are often acquired progressively. It is obviously not reasonable to compute the whole result again each time a new data is inserted, (semi-) dynamic schemes are thus necessary. We introduce a very general data structure, the influence graph, that allow...
Transforming a geometric algorithm into an effective computer pro-gram is a difficult task. This tra...
Cette thèse porte sur deux sujets d’algorithmique des graphes. Le premier sujet est l’inférence de r...
A summary of the results achieved in the paper "Optimal Randomized Parallel Algorithms for Comp...
AbstractThis paper is not a complete survey on randomized algorithms in computational geometry, but ...
International audienceThis paper is not a complete survey on randomized algorithms in computational ...
La géométrie algorithmique est une discipline en pleine expansion dont l'objet est la conception d'a...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1992 ...
Ce mémoire d'habilitation présente 14 articles différents, structurés en trois parties : algorithmes...
The ability to manipulate objects in computer graphics and robotics depends critically on fast and f...
The theme of this paper is a rather simple method that has proved very potent in the analysis of the...
Abstract Voronoi diagrams were introduced by R. Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis...
AbstractAbstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Vorono...
Computational geometry is an active branch of computer science whose goal is the design of efficient...
Transforming a geometric algorithm into an effective computer program is a difficult task. This tran...
Computational Geometry is a subfield of Algorithm Design and Analysis with a focus on the design and...
Transforming a geometric algorithm into an effective computer pro-gram is a difficult task. This tra...
Cette thèse porte sur deux sujets d’algorithmique des graphes. Le premier sujet est l’inférence de r...
A summary of the results achieved in the paper "Optimal Randomized Parallel Algorithms for Comp...
AbstractThis paper is not a complete survey on randomized algorithms in computational geometry, but ...
International audienceThis paper is not a complete survey on randomized algorithms in computational ...
La géométrie algorithmique est une discipline en pleine expansion dont l'objet est la conception d'a...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1992 ...
Ce mémoire d'habilitation présente 14 articles différents, structurés en trois parties : algorithmes...
The ability to manipulate objects in computer graphics and robotics depends critically on fast and f...
The theme of this paper is a rather simple method that has proved very potent in the analysis of the...
Abstract Voronoi diagrams were introduced by R. Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis...
AbstractAbstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Vorono...
Computational geometry is an active branch of computer science whose goal is the design of efficient...
Transforming a geometric algorithm into an effective computer program is a difficult task. This tran...
Computational Geometry is a subfield of Algorithm Design and Analysis with a focus on the design and...
Transforming a geometric algorithm into an effective computer pro-gram is a difficult task. This tra...
Cette thèse porte sur deux sujets d’algorithmique des graphes. Le premier sujet est l’inférence de r...
A summary of the results achieved in the paper "Optimal Randomized Parallel Algorithms for Comp...