2014 · 105 citations · 29 references
ComputingComputer ScienceComputational GeometryData StructuresTopologyGraph AlgorithmsGraph TheoryGraph-based LearningMetric GeometryGraph Distortion AnalysisMetric Graph TheoryReeb Graphs
We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions.
29
Topology matching for fully automatic similarity estimation of 3D shapes
Masaki Hilaga, Yoshihisa Shinagawa, Taku Kohmura et al. · 2001 · 2.2K citations
Topological Persistence and Simplification
Edelsbrunner, Letscher, Zomorodian · Discrete & Computational Geometry · 2002 · 1.8K citations · Full text
Afra Zomorodian, Gunnar Carlsson · Discrete & Computational Geometry · 2004 · 1.6K citations · Full text
A survey on tree edit distance and related problems
Philip Bille · Theoretical Computer Science · 2005 · 753 citations