Skip to Main content Skip to Navigation


...
hal-00784900v1  Journal articles
Nina AmentaDominique AttaliOlivier Devillers. A tight bound for the Delaunay triangulation of points on a polyhedron
Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.19-38. ⟨10.1007/s00454-012-9415-7⟩
...
hal-01384396v2  Journal articles
Dominique AttaliOlivier DevillersMarc GlisseSylvain Lazard. Recognizing Shrinkable Complexes Is NP-Complete
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩
...
hal-00961390v1  Journal articles
Mikhail BogdanovOlivier DevillersMonique Teillaud. Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2014, 5 (1), pp.56-85. ⟨10.20382/jocg.v5i1a4⟩
...
hal-01529154v2  Journal articles
David BremnerOlivier DevillersMarc GlisseSylvain LazardGiuseppe Liotta et al.  Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩
...
hal-00940743v3  Journal articles
Nicolas BroutinOlivier DevillersRoss Hemsley. Efficiently navigating a random Delaunay triangulation
Random Structures and Algorithms, Wiley, 2016, 49 (1), pp.95--136. ⟨10.1002/rsa.20630⟩
...
inria-00560400v1  Journal articles
Luca Castelli AleardiOlivier DevillersAbdelkrim Mebarki. Catalog Based Representation of 2D triangulations
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2011, 21 (4), pp.393-402. ⟨10.1142/S021819591100372X⟩
...
inria-00404171v1  Journal articles
Julien DemouthOlivier DevillersMarc GlisseXavier Goaoc. Helly-type theorems for approximate covering
Discrete and Computational Geometry, Springer Verlag, 2009, 42 (3), pp.379--398. ⟨10.1007/s00454-009-9167-1⟩
...
hal-01285120v1  Journal articles
Olivier DevillersMarc GlisseXavier GoaocRémy Thomasse. Smoothed complexity of convex hulls by witnesses and collectors
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩
...
inria-00595823v1  Journal articles
Olivier Devillers. Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2011, 2 (1), pp.30-45. ⟨10.20382/jocg.v2i1a3⟩
...
hal-01348831v1  Journal articles
Olivier DevillersRoss Hemsley. The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.332-359. ⟨10.20382/jocg.v7i1a16⟩
...
hal-00805690v1  Journal articles
Olivier DevillersMarc GlisseXavier GoaocGuillaume MorozMatthias Reitzner. The monotonicity of $f$-vectors of random polytopes
Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2013, 18 (23), pp.1-8. ⟨10.1214/ECP.v18-2469⟩
...
hal-02568677v2  Journal articles
Samuel HornusTim KuipersOlivier DevillersMonique TeillaudJonàs Martínez et al.  Variable-width contouring for additive manufacturing
ACM Transactions on Graphics, Association for Computing Machinery, In press, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩
...
inria-00523812v2  Journal articles
Jane TournoisPierre AlliezOlivier Devillers. 2D Centroidal Voronoi Tessellations with Constraints
Numerical mathematics : a journal of Chinese universities, Nanjing University Press, 2010, 3 (2), pp.212--222. ⟨10.4208/nmtma.2010.32s.6⟩