
Marc Glisse
75
Documents
Publications
37
21
17
15
9
6
6
6
5
5
4
4
4
3
3
3
3
3
3
3
3
3
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
3
4
3
5
3
1
3
5
4
5
7
6
2
1
4
4
7
2
1
2
1
2
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
Communication dans un congrès
hal-03560450
v1
|
|
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⟩
Communication dans un congrès
hal-03791448
v1
|
|
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⟩
Communication dans un congrès
hal-03213188
v1
|
|
Optimizing persistent homology based functionsICML 2021 - 38th International Conference on Machine Learning, Jul 2021, Virtual conference, United States. pp.1294-1303
Communication dans un congrès
hal-02969305
v2
|
|
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⟩
Communication dans un congrès
hal-02185566
v1
|
|
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⟩
Communication dans un congrès
hal-02093445
v1
|
|
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⟩
Communication dans un congrès
hal-01366148
v1
|
|
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⟩
Communication dans un congrès
hal-01144473
v2
|
|
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⟩
Communication dans un congrès
hal-01015747
v1
|
|
The Gudhi Library: Simplicial Complexes and Persistent HomologyThe 4th International Congress on Mathematical Software (ICMS), Aug 2014, Hanyang University, Seoul, Korea, France
Communication dans un congrès
hal-01108461
v1
|
Convergence rates for persistence diagram estimation in Topological Data Analysis.31st International Conference on Machine Learning, Jun 2014, Beijing, China. pp.163-171
Communication dans un congrès
hal-01073072
v1
|
|
|
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⟩
Communication dans un congrès
hal-00833791
v1
|
|
Complexity Analysis of Random Geometric Structures Made Simpler29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩
Communication dans un congrès
hal-00833774
v1
|
|
Point-Set Embeddability of 2-Colored TreesGraph Drawing, 2012, Redmond, United States. pp.12, ⟨10.1007/978-3-642-36763-2_26⟩
Communication dans un congrès
hal-01095415
v1
|
|
Metric graph reconstruction from noisy data27th Annual Symposium on Computational Geometry, 2011, Paris, France. pp.37-46, ⟨10.1145/1998196.1998203⟩
Communication dans un congrès
inria-00630774
v1
|
|
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⟩
Communication dans un congrès
inria-00442751
v2
|
|
Proximity of persistence modules and their diagramsSoCG 2009 - 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.10, ⟨10.1145/1542362.1542407⟩
Communication dans un congrès
hal-02292996
v1
|
|
Persistence-sensitive simplication of functions on surfaces in linear timeTopoInVis'09, 2009, Salt Lake City, United States
Communication dans un congrès
hal-02293165
v1
|
|
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⟩
Communication dans un congrès
inria-00336256
v1
|
|
Helly-type theorems for approximate coveringSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
Communication dans un congrès
inria-00331435
v1
|
|
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⟩
Communication dans un congrès
inria-00187253
v1
|
|
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⟩
Communication dans un congrès
inria-00189038
v1
|
|
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⟩
Communication dans un congrès
inria-00095282
v1
|
|
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⟩
Communication dans un congrès
hal-02293063
v1
|
|
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⟩
Communication dans un congrès
inria-00103995
v1
|
|
On the worst-case complexity of the silhouette of a polytope15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p
Communication dans un congrès
inria-00099478
v1
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Communication dans un congrès
inria-00099449
v1
|
|
Cost-Optimal Quadtrees for Ray Shooting14th Canadian Conference on Computational Geometry - CCCG 2002, Aug 2002, Lethbridge, Canada
Communication dans un congrès
hal-02293045
v1
|
|
A chaotic random convex hullAofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
Poster de conférence
hal-01015598
v1
|
|
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⟩
Ouvrages
hal-01330678
v1
|
|
Fast persistent homology computation for functions on ℝ2023
Pré-publication, Document de travail
hal-04148137
v1
|
|
Two Lower Bounds for Random Point Sets via Negative Association2023
Pré-publication, Document de travail
hal-04320184
v1
|
|
Swap, Shift and Trim to Edge Collapse a Filtration2022
Pré-publication, Document de travail
hal-03791455
v1
|
|
Lower bound on the Voronoi diagram of lines in ℝᵈ2021
Pré-publication, Document de travail
hal-03491732
v1
|
|
On Order Types of Random Point Sets2020
Pré-publication, Document de travail
hal-01962093
v2
|
|
Delaunay triangulation of a random sample of a good sample has linear size2017
Pré-publication, Document de travail
hal-01673170
v1
|
|
Optimal rates of convergence for persistence diagrams in Topological Data Analysis2013
Pré-publication, Document de travail
hal-00827162
v1
|
|
The structure and stability of persistence modules2012
Pré-publication, Document de travail
hal-01107617
v1
|
|
Covering families of triangles[Research Report] RR-9378, INRIA. 2020, pp.31
Rapport
(rapport de recherche)
hal-03031995
v1
|
|
Randomized incremental construction of Delaunay triangulations of nice point sets[Research Report] INRIA. 2019
Rapport
(rapport de recherche)
hal-01950119
v2
|
|
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
Rapport
(rapport de recherche)
hal-01568030
v1
|
|
Smoothed complexity of convex hulls by witnesses and collectors[Research Report] 8787, INRIA. 2015, pp.41
Rapport
(rapport de recherche)
hal-01214021
v2
|
|
The Gudhi Library: Simplicial Complexes and Persistent Homology[Research Report] RR-8548, INRIA. 2014
Rapport
(rapport de recherche)
hal-01005601
v2
|
|
Silhouette of a random polytope[Research Report] RR-8327, INRIA. 2013, pp.13
Rapport
(rapport de recherche)
hal-00841374
v2
|
|
A convex body with chaotic random convex hull[Research Report] RR-8437, INRIA. 2013
Rapport
(rapport de recherche)
hal-00922515
v1
|
|
The monotonicity of f-vectors of random polytopes[Research Report] RR-8154, INRIA. 2012, pp.10
Rapport
(rapport de recherche)
hal-00758686
v1
|
|
Homological reconstruction and simplification in R3[Research Report] RR-8169, INRIA. 2012
Rapport
(rapport de recherche)
hal-00761208
v1
|
|
Complexity analysis of random geometric structures made simpler[Research Report] RR-8168, INRIA. 2012
Rapport
(rapport de recherche)
hal-00761171
v1
|
|
Proximity of Persistence Modules and their Diagrams[Research Report] RR-6568, INRIA. 2008, pp.29
Rapport
(rapport de recherche)
inria-00292566
v4
|
|
Helly-type theorems for approximate covering[Research Report] RR-6342, INRIA. 2007, pp.12
Rapport
(rapport de recherche)
inria-00179277
v3
|
|
On the Complexity of Umbra and Penumbra[Research Report] RR-6347, INRIA. 2007, pp.28
Rapport
(rapport de recherche)
inria-00186262
v2
|
|
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
Rapport
(rapport de recherche)
inria-00130035
v2
|
|
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra[Research Report] RR-5671, INRIA. 2005
Rapport
(rapport de recherche)
inria-00071226
v1
|
|
Combinatoire des droites et segments pour la visibilité 3DModélisation et simulation. Université Nancy II, 2007. Français. ⟨NNT : ⟩
Thèse
tel-00192337
v1
|
Chargement...
Chargement...