|
|
|
---|---|---|
hal-01095415v1
Conference papers
Point-Set Embeddability of 2-Colored Trees Graph Drawing, 2012, Redmond, United States. pp.12, ⟨10.1007/978-3-642-36763-2_26⟩ ![]() |
||
hal-01214021v2
Reports
Smoothed complexity of convex hulls by witnesses and collectors [Research Report] 8787, INRIA. 2015, pp.41 |
||
hal-00643880v1
Journal articles
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⟩ |
||
inria-00404171v1
Journal articles
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-00336571v1
Journal articles
An Upper Bound on the Average Size of Silhouettes Discrete and Computational Geometry, Springer Verlag, 2008, 40 (2), pp.241-257. ⟨10.1007/s00454-008-9089-3⟩ |
||
hal-01107617v1
Preprints, Working Papers, ...
The structure and stability of persistence modules 2012 ![]() |
||
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-00833791v1
Conference papers
Homological Reconstruction and Simplification in R3 Proceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩ |
||
hal-01366148v1
Conference papers
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ 24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece |
||
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-00431418v1
Journal articles
On the Complexity of Umbra and Penumbra Computational Geometry, Elsevier, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩ |
||
inria-00442816v3
Journal articles
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-00000514v1
Journal articles
Octrees with near optimal cost for ray-shooting Computational Geometry, Elsevier, 2006, 34 (3), pp.182-194 |
||
inria-00130035v2
Reports
An Upper Bound on the Average Size of Silhouettes–––Une borne supérieure sur la taille moyenne des silhouettes [Research Report] RR-6124, INRIA. 2007 |
||
hal-01330678v1
Books
The Structure and Stability of Persistence Modules ⟨Springer Verlag⟩, pp.VII, 116, 2016, SpringerBriefs in Mathematics, 978-3-319-42543-6 |
||
inria-00187253v1
Conference papers
Between umbra and penumbra Proceedings 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⟩ |
||
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-00761208v1
Reports
Homological reconstruction and simplification in R3 [Research Report] RR-8169, INRIA. 2012 |
||
hal-00922515v1
Reports
A convex body with chaotic random convex hull [Research Report] RR-8437, INRIA. 2013 |
||
hal-01005601v2
Reports
The Gudhi Library: Simplicial Complexes and Persistent Homology [Research Report] RR-8548, INRIA. 2014 |
||
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-00758686v1
Reports
The monotonicity of f-vectors of random polytopes [Research Report] RR-8154, INRIA. 2012, pp.10 |
||
hal-00827162v1
Preprints, Working Papers, ...
Optimal rates of convergence for persistence diagrams in Topological Data Analysis 2013 ![]() |
||
inria-00331435v1
Conference papers
Helly-type theorems for approximate covering Proceedings of the 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128 |
||
inria-00099478v1
Conference papers
On the worst-case complexity of the silhouette of a polytope 15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p |
||
inria-00099449v1
Conference papers
On the Number of Lines Tangent to Four Convex Polyhedra 14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada |
||
hal-01673170v1
Preprints, Working Papers, ...
Delaunay triangulation of a random sample of a good sample has linear size 2017 |
||
hal-01529154v2
Journal articles
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-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⟩ |
||
|
|