Reeb Graph of Sample Thickenings
By: Håvard Bakke Bjerkevik, Nello Blaser, Lars M. Salbu
Potential Business Impact:
Maps shapes from messy data.
We consider the Reeb graph of a thickening of points sampled from an unknown space. Our main contribution is a framework to transfer reconstruction results similar to the well-known work of Niyogi, Smale, and Weinberger to the setting of Reeb graphs. To this end, we first generalize and study the interleaving distances for Reeb graphs. We find that many of the results previously established for constructible spaces also hold for general topological spaces. We use this to show that under certain conditions for topological spaces with real-valued Lipschitz maps, the Reeb graph of a sample thickening approximates the Reeb graph of the underlying space. Finally, we provide an algorithm for computing the Reeb graph of a sample thickening.
Similar Papers
GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs
Graphics
Draws better pictures of data's shape.
Drawing Reeb Graphs
Computational Geometry
Makes complex data pictures easier to understand.
Gromov-Wasserstein Bound between Reeb and Mapper Graphs
Statistics Theory
Compares data maps using probability for better understanding.