Local Equivalence and Intrinsic Metrics Between Reeb Graphs

Mathieu Carriere (1) , Steve Y. Oudot (1)

1 DATASHAPE - Understanding the Shape of Data

As graphical summaries for topological spaces and maps, Reeb graphs are common objects in the computer graphics or topological data analysis literature. Defining good metrics between these objects has become an important question for applications, where it matters to quantify the extent by which two given Reeb graphs differ. Recent contributions emphasize this aspect, proposing novel distances such as functional distortion or interleaving that are provably more discriminative than the so-called bottleneck distance, being true metrics whereas the latter is only a pseudo-metric. Their main drawback compared to the bottleneck distance is to be comparatively hard (if at all possible) to evaluate. Here we take the opposite view on the problem and show that the bottleneck distance is in fact good enough locally, in the sense that it is able to discriminate a Reeb graph from any other Reeb graph in a small enough neighborhood, as efficiently as the other metrics do. This suggests considering the intrinsic metrics induced by these distances, which turn out to be all globally equivalent. This novel viewpoint on the study of Reeb graphs has a potential impact on applications, where one may not only be interested in discriminating between data but also in interpolating between them.

Mots clés: Topological Data; Induced Metrics; Analysis; Reeb Graphs

Domaines: Topologie algébrique [math.AT]; Géométrie algorithmique [cs.CG]

Mathieu Carriere, Steve Y. Oudot. Local Equivalence and Intrinsic Metrics Between Reeb Graphs. International Symposium on Computational Geometry, Jul 2017, Brisbane, Australia. ⟨hal-01633109⟩