Marc Glisse
Publications
Publications
|
|
RipsNet: a general architecture for fast and robust estimation of the persistent homology of point cloudsICLR 2022 Workshop on Geometrical and Topological Representation Learning, Apr 2022, Virtual conference, United States |
|
|
Swap, Shift and Trim to Edge Collapse a FiltrationSoCG 2022 - 38th International Symposium on Computational Geometry, Jun 2022, Berlin, Germany. ⟨10.4230/LIPIcs.SoCG.2022.44⟩ |
|
|
Optimizing persistent homology based functionsICML 2021 - 38th International Conference on Machine Learning, Jul 2021, Virtual conference, United States. pp.1294-1303 |
|
|
Topological Uncertainty: Monitoring trained neural networks through persistence of activation graphsIJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Aug 2021, Montréal, Canada. pp.2666-2672, ⟨10.24963/ijcai.2021/367⟩ |
|
|
Randomized incremental construction of Delaunay triangulations of nice point setsESA 2019 - 27th Annual European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.22⟩ |
|
|
DTM-based FiltrationsSoCG 2019 - 35th International Symposium on Computational Geometry, Jun 2019, Portland, United States. pp.58:1--58:15, ⟨10.4230/LIPIcs.SoCG.2019.58⟩ |
|
|
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. ⟨10.1007/978-3-319-50106-2_42⟩ |
|
|
On the smoothed complexity of convex hullsProceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩ |
|
|
Recognizing shrinkable complexes is NP-completeESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ |
|
|
The Gudhi Library: Simplicial Complexes and Persistent HomologyThe 4th International Congress on Mathematical Software (ICMS), Aug 2014, Hanyang University, Seoul, Korea, France |
Convergence rates for persistence diagram estimation in Topological Data Analysis.31st International Conference on Machine Learning, Jun 2014, Beijing, China. pp.163-171 |
|
|
|
Point-Set Embeddability of 2-Colored TreesGraph Drawing, 2012, Redmond, United States. pp.12, ⟨10.1007/978-3-642-36763-2_26⟩ |
|
|
Complexity Analysis of Random Geometric Structures Made Simpler29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩ |
|
|
Homological Reconstruction and Simplification in R3SoCG 2013 - 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩ |
|
|
Metric graph reconstruction from noisy data27th Annual Symposium on Computational Geometry, 2011, Paris, France. pp.37-46, ⟨10.1145/1998196.1998203⟩ |
|
|
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States. ⟨10.1145/1810959.1810969⟩ |
|
|
Proximity of persistence modules and their diagramsSoCG 2009 - 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.10, ⟨10.1145/1542362.1542407⟩ |
|
|
Persistence-sensitive simplication of functions on surfaces in linear timeTopoInVis'09, 2009, Salt Lake City, United States |
|
|
Predicates for line transversals to lines and line segments in three-dimensional spaceSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩ |
|
|
Helly-type theorems for approximate coveringSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128 |
|
|
Between umbra and penumbraProceedings 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⟩ |
|
|
Farthest-Polygon Voronoi Diagrams15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩ |
|
|
An Upper Bound on the Average Size of Silhouettes22nd ACM Symposium on Computational Geometry 2006, Jun 2006, Sedona, Arizona, United States. pp.105-111, ⟨10.1145/1137856.1137874⟩ |
|
|
Cost-Optimal Trees for Ray ShootingTheoretical Informatics, 6th Latin American Symposium (LATIN 2004), Apr 2004, Buenos Aires, Argentina. pp.349-358, ⟨10.1007/978-3-540-24698-5_39⟩ |
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩ |
|
|
On the worst-case complexity of the silhouette of a polytope15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p |
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada |
|
|
Cost-Optimal Quadtrees for Ray Shooting14th Canadian Conference on Computational Geometry - CCCG 2002, Aug 2002, Lethbridge, Canada |
|
|
A chaotic random convex hullAofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France |
|
|
The Structure and Stability of Persistence ModulesSpringer Verlag, pp.VII, 116, 2016, SpringerBriefs in Mathematics, 978-3-319-42543-6. ⟨10.1007/978-3-319-42545-0⟩ |
|
|
Fast persistent homology computation for functions on ℝ2023 |
|
|
Two Lower Bounds for Random Point Sets via Negative Association2023 |
|
|
Swap, Shift and Trim to Edge Collapse a Filtration2022 |
|
|
Lower bound on the Voronoi diagram of lines in ℝᵈ2021 |
|
|
On Order Types of Random Point Sets2020 |
|
|
Delaunay triangulation of a random sample of a good sample has linear size2017 |
|
|
Optimal rates of convergence for persistence diagrams in Topological Data Analysis2013 |
|
|
The structure and stability of persistence modules2012 |
|
|
Covering families of triangles[Research Report] RR-9378, INRIA. 2020, pp.31 |
|
|
Randomized incremental construction of Delaunay triangulations of nice point sets[Research Report] INRIA. 2019 |
|
|
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 |
|
|
Smoothed complexity of convex hulls by witnesses and collectors[Research Report] 8787, INRIA. 2015, pp.41 |
|
|
The Gudhi Library: Simplicial Complexes and Persistent Homology[Research Report] RR-8548, INRIA. 2014 |
|
|
Silhouette of a random polytope[Research Report] RR-8327, INRIA. 2013, pp.13 |
|
|
A convex body with chaotic random convex hull[Research Report] RR-8437, INRIA. 2013 |
|
|
Complexity analysis of random geometric structures made simpler[Research Report] RR-8168, INRIA. 2012 |
|
|
The monotonicity of f-vectors of random polytopes[Research Report] RR-8154, INRIA. 2012, pp.10 |
|
|
Homological reconstruction and simplification in R3[Research Report] RR-8169, INRIA. 2012 |
|
|
Proximity of Persistence Modules and their Diagrams[Research Report] RR-6568, INRIA. 2008, pp.29 |
|
|
Helly-type theorems for approximate covering[Research Report] RR-6342, INRIA. 2007, pp.12 |
|
|
On the Complexity of Umbra and Penumbra[Research Report] RR-6347, INRIA. 2007, pp.28 |
|
|
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 |
|
|
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra[Research Report] RR-5671, INRIA. 2005 |
|
|
Combinatoire des droites et segments pour la visibilité 3DModélisation et simulation. Université Nancy II, 2007. Français. ⟨NNT : ⟩ |