Conference abstracts

Session A4 - Computational Geometry and Topology

July 10, 18:30 ~ 18:55

The Reeb graph edit distance is universal

Ulrich Bauer

Technical University of Munich (TUM), Germany   -

We consider Reeb graphs in a general topological setting, and the construction of distances between Reeb graphs that are stable, meaning that similar functions in the supremum norm have similar Reeb graphs. We define a graph edit distance and show that it is universal, providing an upper bound to any other stable distance.

Joint work with Claudia Landi (University of Modena and Reggio Emilia).

View abstract PDF

FoCM 2017, based on a nodethirtythree design.