Measuring the Distance Between Merge Trees

Kenes Beketayev, Damir Yeliussizov, Dmitriy Morozov, Gunther H. Weber, Bernd HamannTopological Methods in Data Analysis and Visualization 2014 · OpenReview

Abstract

Merge trees represent the topology of scalar functions. To assess the topological similarity of functions, one can compare their merge trees. To do so, one needs a notion of a distance between merge trees, which we define. We provide examples of using our merge tree distance and compare this new measure to other ways used to characterize topological similarity (bottleneck distance for persistence diagrams) and numerical difference (L ∞ -norm of the difference between functions).
BibTeX
@inproceedings{beketayev2014measuring,
  author = {Kenes Beketayev and Damir Yeliussizov and Dmitriy Morozov and Gunther H. Weber and Bernd Hamann},
  title = {{Measuring the Distance Between Merge Trees}},
  booktitle = {Topological Methods in Data Analysis and Visualization},
  year = {2014},
  url = {https://openreview.net/forum?id=RxQfbMK75oI},
}

Loading related content...

Figure