HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Intrinsic Interleaving Distance for Merge Trees

Abstract : Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this paper, we consider the problem of comparing two merge trees via the notion of interleaving distance in the metric space setting. We investigate various theoretical properties of such a metric. In particular, we show that the interleaving distance is intrinsic on the space of labeled merge trees and provide an algorithm to construct metric 1-centers for collections of labeled merge trees. We further prove that the intrinsic property of the interleaving distance also holds for the space of unlabeled merge trees. Our results are a first step toward performing statistics on graph-based topological summaries.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Contributor : Steve Oudot Connect in order to contact the contributor
Submitted on : Monday, December 30, 2019 - 7:23:39 PM
Last modification on : Friday, February 4, 2022 - 3:24:54 AM

Links full text


  • HAL Id : hal-02425600, version 1
  • ARXIV : 1908.00063


Ellen Gasparovic, Elizabeth Munch, Steve Oudot, Katharine Turner, Bei Wang, et al.. Intrinsic Interleaving Distance for Merge Trees. 2019. ⟨hal-02425600⟩



Record views