|
||
---|---|---|
hal-01073072v1
Conference papers
Convergence rates for persistence diagram estimation in Topological Data Analysis. 31st International Conference on Machine Learning, Jun 2014, Beijing, China. pp.163-171 |
||
hal-00827162v1
Preprints, Working Papers, ...
Optimal rates of convergence for persistence diagrams in Topological Data Analysis 2013 ![]() |
||
hal-01214021v2
Reports
Smoothed complexity of convex hulls by witnesses and collectors [Research Report] 8787, INRIA. 2015, pp.41 |
||
hal-01285120v1
Journal articles
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-01144473v2
Conference papers
On the smoothed complexity of convex hulls Proceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩ |
||
hal-02292996v1
Conference papers
Proximity of persistence modules and their diagrams SoCG 2009 - 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.10, ⟨10.1145/1542362.1542407⟩ |
||
|
||
hal-02568677v2
Journal articles
Variable-width contouring for additive manufacturing ACM Transactions on Graphics, Association for Computing Machinery, 2020, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩ |
||
hal-02937624v1
Journal articles
Randomized incremental construction of Delaunay triangulations of nice point sets Discrete and Computational Geometry, Springer Verlag, 2020, 64, pp.33. ⟨10.1007/s00454-020-00235-7⟩ |
||
|
||
hal-01673170v1
Preprints, Working Papers, ...
Delaunay triangulation of a random sample of a good sample has linear size 2017 |
||
hal-01950119v2
Reports
Randomized incremental construction of Delaunay triangulations of nice point sets [Research Report] INRIA. 2019 |
||
hal-02185566v1
Conference papers
Randomized incremental construction of Delaunay triangulations of nice point sets ESA 2019 - 27th Annual European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.22⟩ |
||
hal-01568030v1
Reports
Delaunay triangulation of a random sample of a good sample has linear size [Research Report] RR-9082, Inria Saclay Ile de France; Inria Nancy - Grand Est. 2017, pp.6 |
||
hal-01919562v3
Journal articles
DTM-based Filtrations Abel Symposia, Springer, 2020, Topological Data Analysis, 15, pp.33-66. ⟨10.1007/978-3-030-43408-3_2⟩ |
||
hal-02969305v2
Conference papers
Optimizing persistent homology based functions ICML 2021 - 38th International Conference on Machine Learning, Jul 2021, Virtual conference, United States. pp.1294-1303 |
||
|
||
hal-00805690v1
Journal articles
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-00761171v1
Reports
Complexity analysis of random geometric structures made simpler [Research Report] RR-8168, INRIA. 2012 |
||
hal-00833791v1
Conference papers
Homological Reconstruction and Simplification in R3 SoCG 2013 - 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩ |
||
inria-00000514v1
Journal articles
Octrees with near optimal cost for ray-shooting Computational Geometry, Elsevier, 2006, 34 (3), pp.182-194 |
||
inria-00179277v3
Reports
Helly-type theorems for approximate covering [Research Report] RR-6342, INRIA. 2007, pp.12 |
||
tel-00192337v1
Theses
Combinatoire des droites et segments pour la visibilité 3D Modélisation et simulation. Université Nancy II, 2007. Français |
||
hal-01132440v1
Journal articles
Homological Reconstruction and Simplification in R3 Computational Geometry, Elsevier, 2015, 48 (8), pp.606-621. ⟨10.1016/j.comgeo.2014.08.010⟩ |
||
inria-00186262v2
Reports
On the Complexity of Umbra and Penumbra [Research Report] RR-6347, INRIA. 2007, pp.28 |
||
inria-00103916v1
Journal articles
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩ |
||
inria-00331435v1
Conference papers
Helly-type theorems for approximate covering SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128 |
||
hal-00833774v1
Conference papers
Complexity Analysis of Random Geometric Structures Made Simpler 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩ |
||
hal-01108461v1
Conference papers
The Gudhi Library: Simplicial Complexes and Persistent Homology The 4th International Congress on Mathematical Software (ICMS), Aug 2014, Hanyang University, Seoul, Korea, France |
||
hal-01015747v1
Conference papers
Recognizing shrinkable complexes is NP-complete ESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ |
||
|