Olivier Devillers
30
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
- 2
- 3
- 2
- 1
- 1
- 1
- 4
- 1
- 4
- 2
- 1
- 2
- 1
- 1
- 2
- 30
- 13
- 12
- 6
- 6
- 5
- 5
- 5
- 4
- 3
- 3
- 3
- 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
- 3
- 2
- 1
- 1
- 1
- 1
- 1
|
3D Snap RoundingProceedings of the 34th International Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.30:1 - 30:14, ⟨10.4230/LIPIcs.SoCG.2018.30⟩
Communication dans un congrès
hal-01727375v1
|
|
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
|
|
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
|
|
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
|
|
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
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland
Communication dans un congrès
inria-00000374v1
|
|
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 line tangents to four triangles in three-dimensional space16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p
Communication dans un congrès
inria-00099873v1
|
|
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
|
|
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
|
Motion planning of legged robotsWorkshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States
Communication dans un congrès
hal-01179461v1
|
|
One-Bend Drawing of $K_n$ in 3D, revisitedMichael A. Bekos; Markus Chimani. The 31st International Symposium on Graph Drawing and Network Visualization, Sep 2023, Palermo, Italy. Springer, 2023
Poster de conférence
hal-04195317v1
|
|
3D Snap Rounding[Research Report] RR-9149, Inria Nancy - Grand Est. 2018, pp.1-22
Rapport
hal-01698928v1
|
|
On the Complexity of Umbra and Penumbra[Research Report] RR-6347, INRIA. 2007, pp.28
Rapport
inria-00186262v2
|
|
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra[Research Report] RR-5671, INRIA. 2005
Rapport
inria-00071226v1
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge[Research Report] RR-5708, INRIA. 2005
Rapport
inria-00071219v1
|
|
Lines tangent to four triangles in three-dimensional space[Research Report] RR-5693, INRIA. 2005
Rapport
inria-00071223v1
|
|
The expected number of 3D visibility events is linear[Research Report] RR-4671, INRIA. 2002
Rapport
inria-00071914v1
|
|
Motion Planning of Legged RobotsRR-3214, INRIA. 1997
Rapport
inria-00073475v1
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge, revisited2023
Pré-publication, Document de travail
hal-04182069v1
|