|
||
---|---|---|
hal-02093445v1
Conference papers
DTM-based Filtrations SoCG 2019 - 35th International Symposium on Computational Geometry, Jun 2019, Portland, United States. ⟨10.4230/LIPIcs.SoCG.2019.58⟩ |
||
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⟩ |
||
inria-00095282v1
Conference papers
An Upper Bound on the Average Size of Silhouettes 22nd ACM Symposium on Computational Geometry 2006, Jun 2006, Sedona, Arizona, United States. pp.105-111, ⟨10.1145/1137856.1137874⟩ ![]() |
||
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 |
||
inria-00442751v2
Conference papers
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions 26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States |
||
tel-00192337v1
Theses
Combinatoire des droites et segments pour la visibilité 3D Modélisation et simulation. Université Nancy II, 2007. Français |
||
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⟩ |
||
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 |
||
|
||
inria-00630774v1
Conference papers
Metric graph reconstruction from noisy data 27th Annual Symposium on Computational Geometry, 2011, Paris, France. pp.37-46, ⟨10.1145/1998196.1998203⟩ |
||
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 |
||
inria-00186262v2
Reports
On the Complexity of Umbra and Penumbra [Research Report] RR-6347, INRIA. 2007, pp.28 |
||
inria-00071226v1
Reports
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra [Research Report] RR-5671, INRIA. 2005 |
||
hal-01005601v2
Reports
The Gudhi Library: Simplicial Complexes and Persistent Homology [Research Report] RR-8548, INRIA. 2014 |
||
inria-00179277v3
Reports
Helly-type theorems for approximate covering [Research Report] RR-6342, INRIA. 2007, pp.12 |
||
hal-01366148v1
Conference papers
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ 24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece |
||
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-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⟩ ![]() |
||
inria-00189038v1
Conference papers
Farthest-Polygon Voronoi Diagrams 15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩ |
||
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-01673170v1
Preprints, Working Papers, ...
Delaunay triangulation of a random sample of a good sample has linear size 2017 |
||
hal-02568677v2
Journal articles
Variable-width contouring for additive manufacturing ACM Transactions on Graphics, Association for Computing Machinery, In press, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩ |
||
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-00761208v1
Reports
Homological reconstruction and simplification in R3 [Research Report] RR-8169, INRIA. 2012 |
||
hal-02292996v1
Conference papers
Proximity of persistence modules and their diagrams Twenty-fifth Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.10, ⟨10.1145/1542362.1542407⟩ |
||
hal-02293165v1
Conference papers
Persistence-sensitive simplication of functions on surfaces in linear time TopoInVis'09, 2009, Salt Lake City, United States |
||
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 |
||
hal-02969305v1
Preprints, Working Papers, ...
A note on stochastic subgradient descent for persistence-based functionals: convergence and practical aspects 2020 |
||
inria-00103995v1
Conference papers
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩ |
||
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⟩ |
||
|