Measuring the Distance Between Merge Trees
From MaRDI portal
Publication:3454953
DOI10.1007/978-3-319-04099-8_10zbMath1326.68300OpenAlexW1575022706WikidataQ59359192 ScholiaQ59359192MaRDI QIDQ3454953
Kenes Beketayev, Gunther H. Weber, Bernd Hamann, Damir Yeliussizov, Dmitriy Morozov
Publication date: 3 December 2015
Published in: Mathematics and Visualization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04099-8_10
Related Items (7)
Metrics for generalized persistence modules ⋮ Quantitative simplification of filtered simplicial complexes ⋮ Measuring the Error in Approximating the Sub-Level Set Topology of Sampled Scalar Data ⋮ Hierarchies and Ranks for Persistence Pairs ⋮ Probabilistic convergence and stability of random mapper graphs ⋮ FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees ⋮ Topological Feature Search in Time-Varying Multifield Data
Cites Work
This page was built for publication: Measuring the Distance Between Merge Trees