Olivier Devillers
37
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
- 2
- 4
- 2
- 1
- 2
- 3
- 3
- 2
- 4
- 3
- 2
- 2
- 4
- 1
- 1
- 1
- 37
- 16
- 13
- 7
- 6
- 5
- 5
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
|
Randomized incremental construction of Delaunay triangulations of nice point setsESA 2019 - 27th Annual European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.22⟩
Communication dans un congrès
hal-02185566v1
|
|
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. ⟨10.1007/978-3-319-50106-2_42⟩
Communication dans un congrès
hal-01366148v1
|
|
On the smoothed complexity of convex hullsProceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩
Communication dans un congrès
hal-01144473v2
|
|
Recognizing shrinkable complexes is NP-completeESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩
Communication dans un congrès
hal-01015747v1
|
|
Complexity Analysis of Random Geometric Structures Made Simpler29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩
Communication dans un congrès
hal-00833774v1
|
|
Homological Reconstruction and Simplification in R3SoCG 2013 - 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩
Communication dans un congrès
hal-00833791v1
|
|
Predicates for line transversals to lines and line segments in three-dimensional spaceSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩
Communication dans un congrès
inria-00336256v1
|
|
Helly-type theorems for approximate coveringSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
Communication dans un congrès
inria-00331435v1
|
|
Between umbra and penumbraProceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩
Communication dans un congrès
inria-00187253v1
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Communication dans un congrès
inria-00103995v1
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Communication dans un congrès
inria-00099449v1
|
|
A chaotic random convex hullAofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
Poster de conférence
hal-01015598v1
|
|
Two Lower Bounds for Random Point Sets via Negative Association2023
Pré-publication, Document de travail
hal-04320184v1
|
|
On Order Types of Random Point Sets2020
Pré-publication, Document de travail
hal-01962093v2
|
|
Delaunay triangulation of a random sample of a good sample has linear size2017
Pré-publication, Document de travail
hal-01673170v1
|