Measuring distance between Reeb graphs (extended abstract)

DOI10.1145/2582112.2582169zbMATH Open1395.68288OpenAlexW2962902468MaRDI QIDQ4635572FDOQ4635572

Authors: Ulrich Bauer, Xiaoyin Ge, Yusu Wang 

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582169

Recommendations

• Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
• Local equivalence and intrinsic metrics between Reeb graphs
• Stable shape comparison of surfaces via Reeb graphs
• The Reeb graph edit distance is universal
• Reeb graphs of curves are stable under function perturbations

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Relations of low-dimensional topology with graph theory (57M15)

Cited In (29)

• Statistical analysis and parameter selection for Mapper
• Barcode embeddings for metric graphs
• The edit distance for Reeb graphs of surfaces
• Structure and stability of the one-dimensional Mapper
• Algebraic stability of zigzag persistence modules
• Local equivalence and intrinsic metrics between Reeb graphs
• Metric spaces with expensive distances
• Stable shape comparison of surfaces via Reeb graphs
• Reeb graphs of piecewise linear functions
• Regularity via links and Stein factorization
• Realizable piecewise linear paths of persistence diagrams with Reeb graphs
• Categorified Reeb graphs
• Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
• Topological classification of simple Morse Bott functions on surfaces
• Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
• Stability of the tree of shapes to additive noise
• FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
• The Reeb graph edit distance is universal
• Persistence barcodes and Laplace eigenfunctions on surfaces
• Reeb graphs of curves are stable under function perturbations
• A new matching algorithm between trees of shapes and its application to brain tumor segmentation
• Measuring the error in approximating the sub-level set topology of sampled scalar data
• Hierarchies and Ranks for Persistence Pairs
• Measuring the distance between merge trees
• Topological Feature Search in Time-Varying Multifield Data
• Generalized persistence diagrams for persistence modules over posets
• Labeled interleaving distance for Reeb graphs
• Statistical analysis of Mapper for stochastic and multivariate filters
• Probabilistic convergence and stability of random mapper graphs

This page was built for publication: Measuring distance between Reeb graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635572)