Olivier Devillers
44
Documents
Identifiants chercheurs
olivierdevillers-
0000-0003-4275-5068
- Google Scholar : http://scholar.google.com/citations?user=oD-iXjcAAAAJ
- IdRef : 033684162
Présentation
[my homepage](https://members.loria.fr/Olivier.Devillers/),[ orcid](https://orcid.org/0000-0003-4275-5068)
###
### **PhD student**s
- Charles Duménil. [Expected Size of the 3-Dimensional Delaunay Triangulation of Random Points on a Surface](https://tel.archives-ouvertes.fr/tel-03695908). 2022.
- Rémy Thomasse. [Complexity analysis of random convex hulls](https://tel.archives-ouvertes.fr/tel-01252937). 2015.
- Ross Hemsley. [Probabilistic methods for the analysis of algorithms on random tessellations,](https://tel.archives-ouvertes.fr/tel-01099165) 2014.
- Pedro Machado Manhães de Castro. [Practical Ways to Accelerate Delaunay Triangulations.](http://tel.archives-ouvertes.fr/tel-00531765/fr/) 2010.
- Abdelkrim Mebarki. [Implantation de structures de données compactes pour les triangulations](http://tel.archives-ouvertes.fr/tel-00336178/). 2008.
- Luca Castelli Aleardi. [Représentations compactes de structures de données géométriques.](http://tel.archives-ouvertes.fr/tel-00336188/) 2006.
- Philippe Guigue. [Constructions géométriques à précision fixée](http://tel.archives-ouvertes.fr/tel-00471447/fr/). 2003.
- Pierre-Marie Gandoin. [Compression progressive sans perte de structures géométriques](http://tel.archives-ouvertes.fr/tel-00771344). 2001.
- Pascal Desnoguès. [Triangulations et quadriques](http://tel.archives-ouvertes.fr/tel-00771335). 1996.
Publications
- 1
- 1
- 1
- 1
- 1
- 3
- 2
- 2
- 3
- 4
- 7
- 3
- 6
- 5
- 4
- 44
- 23
- 12
- 10
- 9
- 6
- 6
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 3
- 3
- 1
- 1
- 1
|
|
Incremental construction of the Delaunay graph in medium dimensionProceedings of the 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, ⟨10.1145/1542362.1542403⟩
Communication dans un congrès
inria-00412437v1
|
Triangulations in CGALProceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.11-18, ⟨10.1145/336154.336165⟩
Communication dans un congrès
hal-01179408v1
|
|
|
|
Programming with CGAL: the example of triangulations8th Annual Video Review of Computational Geometry, 15th ACM Symposium on Computational Geometry (SCG), Jun 1999, Miami Beach, Florida, United States
Communication dans un congrès
inria-00348713v1
|
Computing Largest Circles Separating Two Sets of Segments8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada
Communication dans un congrès
hal-01179145v1
|
|
Evaluation of a new method to compute signs of determinantsProceedings of the 11th Annual Symposium on Computational Geometry, 1995, Vancouver, Canada. pp.C16-C17, ⟨10.1145/220279.220329⟩
Communication dans un congrès
hal-01179456v1
|
|
Circular separability of polygonProceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281
Communication dans un congrès
hal-01179468v1
|
|
|
|
From spider robots to half disk robotsIEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958
Communication dans un congrès
inria-00442776v1
|
Convex Tours of Bounded CurvatureProceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩
Communication dans un congrès
hal-01179475v1
|
|
Motion planning of legged robotsWorkshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States
Communication dans un congrès
hal-01179461v1
|
|
Computing the whole set of Connolly SurfacesAnnual Conference of the Molecular Graphics Society, 1993, ~, France
Communication dans un congrès
hal-01179713v1
|
|
Stable placements of spider robotsProceedings of the 8th Annual Symposium on Computational Geometry, 1992, Berlin, Germany. pp.242-250, ⟨10.1145/142675.142725⟩
Communication dans un congrès
hal-01179904v1
|
|
Motion planning for a spider robotIEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326
Communication dans un congrès
hal-01179898v1
|
|
Computing Connolly SurfacesIFIP Conference on Algorithms and efficient computation, 1992, ?, France
Communication dans un congrès
hal-01180152v1
|
|
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension dCanadian Conference on Computational Geometry, 1992, St. John's, Canada
Communication dans un congrès
hal-01179732v1
|
|
On-line geometric algorithms with good expected behaviours3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139
Communication dans un congrès
hal-01180161v1
|
|
Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of pointsCanadian Conference on Computational Geometry, 1991, Burnaby, Canada. pp.110-113
Communication dans un congrès
hal-01180159v1
|
|
Computing the Union of 3-Colored TrianglesSystem Modelling and Optimization, IFIP, 1991, Zurich, Switzerland. pp.85-93
Communication dans un congrès
hal-01180155v1
|
|
An on-line construction of higher-order Voronoi diagrams and its randomized analysisCanadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281
Communication dans un congrès
hal-01180166v1
|
|
|
Delaunay triangulation of a random sample of a good sample has linear size2017
Pré-publication, Document de travail
hal-01673170v1
|