Olivier Devillers
48
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 iD icon](https://orcid.org/sites/default/files/images/orcid_16x16.png)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
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 5
- 4
- 2
- 2
- 1
- 5
- 1
- 5
- 5
- 4
- 48
- 12
- 8
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
|
Qualitative Symbolic PerturbationProceedings of the 32nd International Symposium on Computational Geometry, Jun 2016, Boston, United States. pp.33:1-33:15, ⟨10.4230/LIPIcs.SoCG.2016.33⟩
Communication dans un congrès
hal-01276444v1
|
|
Hyperbolic Delaunay Complexes and Voronoi Diagrams Made PracticalProceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.67-76, ⟨10.1145/2462356.2462365⟩
Communication dans un congrès
hal-00833760v1
|
|
Hyperbolic Delaunay triangulations and Voronoi diagrams made practicalXIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
Communication dans un congrès
hal-00850586v1
|
|
Lower and upper bounds on the number of empty cylinders and ellipsoidsEuropean Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142
Communication dans un congrès
inria-00412352v1
|
|
Perturbations and Vertex Removal in a 3D Delaunay TriangulationProceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MA, United States. pp.313--319
Communication dans un congrès
inria-00166710v2
|
|
Walking in a TriangulationProceedings of the 17th Annual Symposium on Computational Geometry, Jun 2001, Boston, United States. pp.106-114, ⟨10.1145/378583.378643⟩
Communication dans un congrès
inria-00344519v1
|
Splitting a Delaunay Triangulation in Linear TimeProceedings of the 8th European Symposium on Algorithms, 2001, Aarhus, Denmark. pp.312-320, ⟨10.1007/3-540-44676-1_26⟩
Communication dans un congrès
hal-01179401v1
|
|
Algebraic methods and arithmetic filtering for exact predicates on circle arcsProceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, ⟨10.1145/336154.336194⟩
Communication dans un congrès
hal-01179417v1
|
|
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 the Maximum Overlap of Two Convex Polygons Under TranslationsInternational Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
Communication dans un congrès
hal-01179450v1
|
|
Symbolic Elimination for parallel manipulatorsCommunication at 4th International Symposium on Effective Methods in Algebraic Geometry (MEGA)., 1996, Eindhoven, Netherlands
Communication dans un congrès
hal-01180168v1
|
|
The space of spheres, a geometric tool to unify duality results on Voronoi diagramsCanadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.263-268
Communication dans un congrès
hal-01180157v1
|
|
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
|
|
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
|
|
Fully dynamic Delaunay triangulation in logarithmic expected time per operationWorkshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53
Communication dans un congrès
hal-01180164v1
|
|
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
|
|
Tiling the hyperbolic planeBending Reality: Where art and science meet, 2013, Dagstuhl, Wadern, Germany
Poster de conférence
hal-01018725v1
|