no code implementations • 29 May 2024 • Mathieu Carriere, Marc Theveneau, Théo Lacombe
In particular, we show that our approach combines efficiently with subsampling techniques routinely used in TDA, as the diffeomorphism derived from the gradient computed on a subsample can be used to update the coordinates of the full input object, allowing us to perform topological optimization on point clouds at an unprecedented scale.
1 code implementation • 19 Oct 2022 • Marc Theveneau, Nicolas Keriven
We then apply this result to random geometric graphs on manifolds, whose shortest paths converge to geodesics, hence proving the consistency of WBs computed on discretized shapes.
