Cover Image

Towards Computing Average Merge Tree Based on the Interleaving Distance

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Touli, Elena Farahbakhsh, Hotz, Ingrid, Masood, Talha Bin
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
by: Touli, Elena Farahbakhsh, et al.
Published: (2025)

Robust Geometric Predicates for Bivariate Computational Topology
by: Hristov, Petar, et al.
Published: (2025)

Singular Arrange and Traverse Algorithm for Computing Reeb Spaces of Bivariate PL Maps
by: Hristov, Petar, et al.
Published: (2026)

Edit Distance between Merge Trees
by: Sridharamurthy, Raghavendra, et al.
Published: (2022)

Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization
by: Yan, Lin, et al.
Published: (2021)

Multi-scale Cycle Tracking in Dynamic Planar Graphs
by: Rasheed, Farhan, et al.
Published: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
by: P V, Althaf, et al.
Published: (2026)

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
by: Chambers, Erin Wolf, et al.
Published: (2024)

Locally Correct Interleavings between Merge Trees
by: Beurskens, Thijs, et al.
Published: (2025)

Arrange and Traverse Algorithm for Computation of Reeb Spaces of Piecewise Linear Maps
by: Petar Hristov, et al.
Published: (2025)

Keeping it sparse: Computing Persistent Homology revisited
by: Bauer, Ulrich, et al.
Published: (2022)

Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
by: Wetzels, Florian, et al.
Published: (2025)

Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs
by: Chambers, Erin Wolf, et al.
Published: (2025)

Interleaving Distance as a Galois-Edit Distance
by: Kim, Woojin, et al.
Published: (2025)

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
by: Wetzels, Florian, et al.
Published: (2023)

A Deformation-based Edit Distance for Merge Trees
by: Wetzels, Florian, et al.
Published: (2022)

Comparative Analysis of Merge Trees using Local Tree Edit Distance
by: Sridharamurthy, Raghavendra, et al.
Published: (2021)

Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
by: Wetzels, Florian, et al.
Published: (2025)

Continuous Scatterplot and Image Moments for Time-Varying Bivariate Field Analysis of Electronic Structure Evolution
by: Sharma, Mohit, et al.
Published: (2025)

Computing the Bottleneck Distance between Persistent Homology Transforms
by: Kerber, Michael, et al.
Published: (2025)

Segmentation Driven Peeling for Visual Analysis of Electronic Transitions
by: Sharma, Mohit, et al.
Published: (2021)

Topology-Aware Volume Fusion for Spectral Computed Tomography via Histograms and Extremum Graph
by: Sharma, Mohit, et al.
Published: (2025)

Bounding the Interleaving Distance for Mapper Graphs with a Loss Function
by: Chambers, Erin W., et al.
Published: (2023)

ParkView: Visualizing Monotone Interleavings
by: Beurskens, Thijs, et al.
Published: (2025)

On Computing Elastic Shape Distances between Curves in d-dimensional Space
by: Bernal, Javier, et al.
Published: (2024)

Interleaving Distances, Monoidal Actions and 2-Categories
by: McFaddin, Patrick K., et al.
Published: (2023)

Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
by: Lyu, Weiran, et al.
Published: (2024)

A Finitely Stable Edit Distance for Merge Trees
by: Pegoraro, Matteo
Published: (2021)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
by: Angrick, Sebastian, et al.
Published: (2026)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
by: Zhou, Yi, et al.
Published: (2026)

RT-HDIST: Ray-Tracing Core-based Hausdorff Distance Computation
by: Kim, YoungWoo, et al.
Published: (2025)

Rapid and Precise Topological Comparison with Merge Tree Neural Networks
by: Qin, Yu, et al.
Published: (2024)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025)

Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
by: Conradi, Jacobus, et al.
Published: (2025)

Intrinsic Bottleneck Distance for Merge Trees
by: Beers, David, et al.
Published: (2025)

Fréchet Edit Distance
by: Fox, Emily, et al.
Published: (2024)

Hyperplane Distance Depth
by: Mashghdoust, Amirhossein, et al.
Published: (2024)

Distinct Distances Between a Line and Strip
by: Das, Sanjana, et al.
Published: (2025)