21 citations · 89 across the 12 of their papers we have counts for
13 papers
Fast Persistent Homology Computation for Functions on
Marc Glisse
0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of edges in non-decreasing order of filtration value, one…
Swap, Shift and Trim to Edge Collapse a Filtration
Marc Glisse, Siddharth Pritam
Boissonnat and Pritam introduced an algorithm to reduce a filtration of flag (or clique) complexes, which can in particular speed up the computation of its persistent homology. The…
RipsNet: a general architecture for fast and robust estimation of the persistent homology of point clouds
Thibault de Surrel, Felix Hensel, Mathieu Carrière +5
The use of topological descriptors in modern machine learning applications, such as Persistence Diagrams (PDs) arising from Topological Data Analysis (TDA), has shown great potenti…
Lower bound on the Voronoi diagram of lines in
Marc Glisse
This note gives a lower bound of on the maximal complexity of the Euclidean Voronoi diagram of non-intersecting lines in for .
Optimizing persistent homology based functions
Mathieu Carrière, Frédéric Chazal, Marc Glisse +2
Solving optimization tasks based on functions and losses with a topological flavor is a very active, growing field of research in data science and Topological Data Analysis, with a…
On Order Types of Random Point Sets
Olivier Devillers, Philippe Duchon, Marc Glisse +1
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way…