Skip to Main content Skip to Navigation


...
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⟩
...
inria-00442816v3  Journal articles
Otfried CheongHazel EverettMarc GlisseJoachim GudmundssonSamuel Hornus et al.  Farthest-Polygon Voronoi Diagrams
Computational Geometry, Elsevier, 2011, Computational Geometry, Theory and Applications, 44 (4), pp.14. ⟨10.1016/j.comgeo.2010.11.004⟩
...
inria-00547754v1  Journal articles
Sylvain LefebvreSamuel HornusAnass Lasram. By-example Synthesis of Architectural Textures
ACM Transactions on Graphics, Association for Computing Machinery, 2010, Proceedings of ACM SIGGRAPH 2010, 29 (4), pp.84:1-8. ⟨10.1145/1778765.1778821⟩
...
hal-00643880v1  Journal articles
Marc GlisseSylvain Lazard. On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
Discrete and Computational Geometry, Springer Verlag, 2012, 47 (4), pp.756-772. ⟨10.1007/s00454-012-9414-8⟩
...
hal-00997207v1  Journal articles
Patrizio AngeliniDavid EppsteinFabrizio FratiMichael KaufmannSylvain Lazard et al.  Universal Point Sets for Planar Graph Drawing with Circular Arcs
Journal of Graph Algorithms and Applications, Brown University, 2014, 18 (3), pp.313-324. ⟨10.7155/jgaa.00324⟩
...
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⟩
...
hal-01289699v1  Journal articles
Marc GlisseSylvain LazardJulien MichelMarc Pouget. Silhouette of a random polytope
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.14. ⟨10.20382/jocg.v7i1a5⟩
...
hal-01294409v1  Journal articles
Manuel CaroliMonique Teillaud. Delaunay triangulations of closed Euclidean d-orbifolds
Discrete and Computational Geometry, Springer Verlag, 2016, 55 (4), pp.827--853. ⟨10.1007/s00454-016-9782-6⟩
...
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⟩
...
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-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-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-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, 2020, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩