Skip to Main content Skip to Navigation


hal-02975012v1  Journal articles
Gilles BartheSandrine BlazyBenjamin GrégoireRémi HutinVincent Laporte et al.  Formal verification of a constant-time preserving C compiler
Proceedings of the ACM on Programming Languages, ACM, 2020, 4 (POPL), pp.1-30. ⟨10.1145/3371075⟩
...
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⟩
...
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-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-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-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-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-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-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-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-00329731v1  Journal articles
Frédéric CazalsMarc Pouget. Jet fitting 3: A Generic C++ Package for Estimating the Differential Properties on Sampled Surfaces via Polynomial Fitting
ACM Transactions on Mathematical Software, Association for Computing Machinery, 2008, 35 (3)
...
hal-01176699v1  Journal articles
Manuel Grand-BrochierAntoine VacavantGuillaume CeruttiCamille KurtzJonathan Weber et al.  Tree leaves extraction in natural images: Comparative study of pre-processing tools and segmentation methods
IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2015, 24 (5), pp.1549-1560. ⟨10.1109/TIP.2015.2400214⟩
...
hal-01153734v1  Journal articles
Viviana BonoMichele BugliesiMariangiola Dezani-CiancagliniLuigi Liquori. A Subtyping for Extensible, Incomplete Objects
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 1999, 38 (4), pp.325--364
...
hal-01062522v1  Journal articles
Ares LagaeSylvain LefebvrePhilip Dutre. Improving Gabor Noise
IEEE Transactions on Visualization and Computer Graphics, Institute of Electrical and Electronics Engineers, 2011, 17 (8), pp.1096-1107. ⟨10.1109/TVCG.2010.238.⟩
hal-01059755v1  Journal articles
David BommesBruno LévyNico PietroniEnrico PuppoClaudio Silva et al.  Quad-Mesh Generation and Processing: A Survey
Computer Graphics Forum, Wiley, 2013, 32 (6), pp.51--76. ⟨10.1111/cgf.12014⟩
...
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-00920177v1  Journal articles
Ares LagaeSylvain LefebvreRob CookTony DeroseGeorge Drettakis et al.  A Survey of Procedural Noise Functions
Computer Graphics Forum, Wiley, 2010, 29 (8), pp.2579-2600. ⟨10.1111/j.1467-8659.2010.01827.x⟩
...
hal-00695670v1  Journal articles
Bruno GalerneAres LagaeSylvain LefebvreGeorge Drettakis. Gabor Noise by Example
ACM Transactions on Graphics, Association for Computing Machinery, 2012, 31 (4), pp.Article No. 73. ⟨10.1145/2185520.2185569⟩
...
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⟩