Score: 1

Reeb Graph of Sample Thickenings

Published: December 9, 2025 | arXiv ID: 2512.08159v1

By: Håvard Bakke Bjerkevik, Nello Blaser, Lars M. Salbu

Potential Business Impact:

Maps shapes from messy data.

Business Areas:
Data Visualization Data and Analytics, Design, Information Technology, Software

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.

Country of Origin
🇺🇸 🇳🇴 United States, Norway

Page Count
18 pages

Category
Computer Science:
Computational Geometry