Branch Decomposition‐Independent Edit Distances for Merge Trees-Reference-Cited by-同舟云学术

Branch Decomposition‐Independent Edit Distances for Merge Trees

Published:2022-06 Issue:3 Volume:41 Page:367-378
ISSN:0167-7055
Container-title:Computer Graphics Forum
language:en
Short-container-title:Computer Graphics Forum

Author:

Wetzels Florian¹^ORCID,Leitte Heike¹^ORCID,Garth Christoph¹^ORCID

Affiliation:

1. Technische Universität Kaiserslautern

Funder

Deutsche Forschungsgemeinschaft

Publisher

Wiley

Subject

Computer Graphics and Computer-Aided Design

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.14547

Reference49 articles.

1. BauerU. Di FabioB. LandiC.: An edit distance for Reeb graphs. InProceedings of the Eurographics 2016 Workshop on 3D Object Retrieval(Goslar Germany Germany 2016) 3DOR '16 Eurographics Association pp.27–34. doi:10.2312/3dor.20161084. 2

2. BauerU. GeX. WangY.: Measuring distance between Reeb graphs.Proceedings of the Annual Symposium on computational Geometry(072013). doi:10.1145/2582112.2582169. 2

3. A survey on tree edit distance and related problems

4. Analyzing and Tracking Burning Structures in Lean Premixed Hydrogen Flames

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-Based Edit Distance;2023 Topological Data Analysis and Visualization (TopoInVis);2023-10-22

2. Probabilistic Gradient-Based Extrema Tracking;2023 Topological Data Analysis and Visualization (TopoInVis);2023-10-22

3. Sketching Merge Trees for Scientific Visualization;2023 Topological Data Analysis and Visualization (TopoInVis);2023-10-22

4. Wasserstein Auto-Encoders of Merge Trees (and Persistence Diagrams);IEEE Transactions on Visualization and Computer Graphics;2023

5. Merge Tree Geodesics and Barycenters with Path Mappings;IEEE Transactions on Visualization and Computer Graphics;2023