Quasi-universality of Reeb graph distances

12/01/2021
by   Ulrich Bauer, et al.
0

We establish bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional contortion distance. The definition of the latter distance is a novel contribution, and for the special case of contour trees we also prove strict universality of this distance. Furthermore, we prove that for the special case of merge trees the functional contortion distance coincides with the interleaving distance, yielding universality of all four distances in this case.

READ FULL TEXT

page 1

page 7

research
04/22/2020

Frechet-Like Distances between Two Merge Trees

The purpose of this paper is to extend the definition of Frechet distanc...
research
11/25/2021

Quasi-Isometric Graph-Simplifications

We propose a general framework based on quasi-isometries to study graph ...
research
06/01/2023

Labeled Interleaving Distance for Reeb Graphs

Merge trees, contour trees, and Reeb graphs are graph-based topological ...
research
10/29/2020

Isometric embeddings in trees and their use in the diameter problem

We prove that given a discrete space with n points which is either embed...
research
12/21/2018

Distance Measures for Embedded Graphs

We introduce new distance measures for comparing embedded graphs based o...
research
10/06/2021

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor

We consider the numerical taxonomy problem of fitting a positive distanc...
research
01/05/2018

The Reeb Graph Edit Distance is Universal

We consider the setting of Reeb graphs of piecewise linear functions and...

Please sign up or login with your details

Forgot password? Click here to reset