Olivier Devillers
12
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
- 1
- 3
- 3
- 12
- 12
- 6
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
Triangulations in CGALComputational Geometry, 2002, 22, pp.5-19. ⟨10.1016/S0925-7721(01)00054-2⟩
Article dans une revue
inria-00167199v1
|
|
Output-sensitive construction of the Delaunay triangulation of points lying in two planesInternational Journal of Computational Geometry and Applications, 1996, 6 (1), pp.1-14. ⟨10.1142/S0218195996000022⟩
Article dans une revue
hal-00795075v1
|
|
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysisAlgorithmica, 1993, 9 (4), pp.329-356. ⟨10.1007/BF01228508⟩
Article dans une revue
inria-00090668v1
|
|
Applications of random sampling to on-line algorithms in computational geometryDiscrete and Computational Geometry, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩
Article dans une revue
inria-00090675v1
|
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
|
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
|
|
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
|
|
Output sensitive construction of the 3D Delaunay triangulation of constrained sets of points[Research Report] RR-1415, INRIA. 1991
Rapport
inria-00075145v1
|
|
Applications of random sampling to on-line algorithms in computational geometry[Research Report] RR-1285, INRIA. 1990
Rapport
inria-00075274v1
|
|
A dynamic construction of higher order Voronoi diagrams and its randomized analysis[Research Report] RR-1207, INRIA. 1990
Rapport
inria-00075351v1
|