Olivier Devillers
15
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
- 4
- 1
- 5
- 1
- 1
- 2
- 15
- 12
- 8
- 7
- 6
- 6
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
|
On the Complexity of Umbra and PenumbraComputational Geometry, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩
Article dans une revue
inria-00431418v1
|
|
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex PolyhedraSIAM Journal on Computing, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
Article dans une revue
inria-00103916v1
|
|
Maintaining Visibility Information of Planar Point Sets with a Moving ViewpointInternational Journal of Computational Geometry and Applications, 2007, 17 (4), pp.297-304. ⟨10.1142/S0218195907002343⟩
Article dans une revue
inria-00192927v1
|
|
Drawing Kn in Three Dimensions with One Bend per EdgeJournal of Graph Algorithms and Applications, 2006, 10 (2), pp.287-295
Article dans une revue
inria-00103923v1
|
|
The expected number of 3D visibility events is linearSIAM Journal on Computing, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩
Article dans une revue
inria-00099810v1
|
|
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
|
|
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada
Communication dans un congrès
inria-00000569v1
|
|
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
|
|
On the Complexity of Umbra and Penumbra[Research Report] RR-6347, INRIA. 2007, pp.28
Rapport
inria-00186262v2
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge[Research Report] RR-5708, INRIA. 2005
Rapport
inria-00071219v1
|
|
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint[Research Report] RR-5742, INRIA. 2005, pp.11
Rapport
inria-00077116v1
|
|
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra[Research Report] RR-5671, INRIA. 2005
Rapport
inria-00071226v1
|
|
The expected number of 3D visibility events is linear[Research Report] RR-4671, INRIA. 2002
Rapport
inria-00071914v1
|