Saved in:
| Main Authors: | Wetzels, Florian, Garth, Christoph |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.02352 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Deformation-based Edit Distance for Merge Trees
by: Wetzels, Florian, et al.
Published: (2022)
by: Wetzels, Florian, et al.
Published: (2022)
Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
by: Wetzels, Florian, et al.
Published: (2025)
by: Wetzels, Florian, 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)
by: Wetzels, Florian, et al.
Published: (2023)
Edit Distance between Merge Trees
by: Sridharamurthy, Raghavendra, et al.
Published: (2022)
by: Sridharamurthy, Raghavendra, et al.
Published: (2022)
Comparative Analysis of Merge Trees using Local Tree Edit Distance
by: Sridharamurthy, Raghavendra, et al.
Published: (2021)
by: Sridharamurthy, Raghavendra, et al.
Published: (2021)
Merge Tree Geodesics and Barycenters with Path Mappings
by: Wetzels, Florian, et al.
Published: (2023)
by: Wetzels, Florian, et al.
Published: (2023)
A Finitely Stable Edit Distance for Merge Trees
by: Pegoraro, Matteo
Published: (2021)
by: Pegoraro, Matteo
Published: (2021)
Fréchet Edit Distance
by: Fox, Emily, et al.
Published: (2024)
by: Fox, Emily, et al.
Published: (2024)
Interleaving Distance as a Galois-Edit Distance
by: Kim, Woojin, et al.
Published: (2025)
by: Kim, Woojin, et al.
Published: (2025)
Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
by: Touli, Elena Farahbakhsh, et al.
Published: (2025)
by: Touli, Elena Farahbakhsh, et al.
Published: (2025)
Towards Computing Average Merge Tree Based on the Interleaving Distance
by: Touli, Elena Farahbakhsh, et al.
Published: (2026)
by: Touli, Elena Farahbakhsh, et al.
Published: (2026)
Edit Distance and Persistence Diagrams Over Lattices
by: McCleary, Alexander, et al.
Published: (2020)
by: McCleary, Alexander, et al.
Published: (2020)
Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)
by: Beurskens, Thijs, et al.
Published: (2023)
A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
by: Chambers, Erin Wolf, et al.
Published: (2024)
by: Chambers, Erin Wolf, et al.
Published: (2024)
Vertex-Minimal Paper Tori
by: Schwartz, Richard Evan
Published: (2025)
by: Schwartz, Richard Evan
Published: (2025)
Region-Aware Wasserstein Distances of Persistence Diagrams and Merge Trees
by: Pont, Mathieu, et al.
Published: (2025)
by: Pont, Mathieu, et al.
Published: (2025)
Continuous Edit Distance, Geodesics and Barycenters of Time-varying Persistence Diagrams
by: Tchitchek, Sebastien, et al.
Published: (2025)
by: Tchitchek, Sebastien, et al.
Published: (2025)
Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes
by: Li, Yue, et al.
Published: (2024)
by: Li, Yue, et al.
Published: (2024)
An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
by: P V, Althaf, et al.
Published: (2026)
by: P V, Althaf, et al.
Published: (2026)
Locally Correct Interleavings between Merge Trees
by: Beurskens, Thijs, et al.
Published: (2025)
by: Beurskens, Thijs, et al.
Published: (2025)
Fully Dynamic Geometric Vertex Cover and Matching
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
Collapsibility and Near Universality for Vertex Minimal Paper Tori
by: Doyle, Peter, et al.
Published: (2025)
by: Doyle, Peter, et al.
Published: (2025)
On the Stability of the Euler Characteristic Transform for a Perturbed Embedding
by: George, Jasmine, et al.
Published: (2025)
by: George, Jasmine, et al.
Published: (2025)
Stability and Approximations for Decorated Reeb Spaces
by: Curry, Justin, et al.
Published: (2023)
by: Curry, Justin, et al.
Published: (2023)
Polyhedral Collision Detection via Vertex Enumeration
by: Cinar, Andrew, et al.
Published: (2025)
by: Cinar, Andrew, et al.
Published: (2025)
Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
by: Lyu, Weiran, et al.
Published: (2024)
by: Lyu, Weiran, et al.
Published: (2024)
A Simple Partially Embedded Planarity Test Based on Vertex-Addition
by: Fink, Simon D., et al.
Published: (2024)
by: Fink, Simon D., et al.
Published: (2024)
MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
by: Zhou, Yi, et al.
Published: (2026)
by: Zhou, Yi, et al.
Published: (2026)
SimpleSets: Capturing Categorical Point Patterns with Simple Shapes
by: Broek, Steven van den, et al.
Published: (2024)
by: Broek, Steven van den, et al.
Published: (2024)
Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)
by: Har-Peled, Sariel
Published: (2023)
Intrinsic Bottleneck Distance for Merge Trees
by: Beers, David, et al.
Published: (2025)
by: Beers, David, et al.
Published: (2025)
Rapid and Precise Topological Comparison with Merge Tree Neural Networks
by: Qin, Yu, et al.
Published: (2024)
by: Qin, Yu, et al.
Published: (2024)
Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)
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)
by: Kupperschmitt, Maël, et al.
Published: (2025)
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)
by: Fekete, Sándor P., et al.
Published: (2024)
Distinct Distances Between a Line and Strip
by: Das, Sanjana, et al.
Published: (2025)
by: Das, Sanjana, et al.
Published: (2025)
HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees
by: García-Castellanos, Alejandro, et al.
Published: (2024)
by: García-Castellanos, Alejandro, et al.
Published: (2024)
On Computing Vertex Connectivity of 1-Plane Graphs
by: Biedl, Therese, et al.
Published: (2022)
by: Biedl, Therese, et al.
Published: (2022)
Hyperplane Distance Depth
by: Mashghdoust, Amirhossein, et al.
Published: (2024)
by: Mashghdoust, Amirhossein, et al.
Published: (2024)
On Computing Elastic Shape Distances between Curves in d-dimensional Space
by: Bernal, Javier, et al.
Published: (2024)
by: Bernal, Javier, et al.
Published: (2024)
Similar Items
-
A Deformation-based Edit Distance for Merge Trees
by: Wetzels, Florian, et al.
Published: (2022) -
Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
by: Wetzels, Florian, 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) -
Edit Distance between Merge Trees
by: Sridharamurthy, Raghavendra, et al.
Published: (2022) -
Comparative Analysis of Merge Trees using Local Tree Edit Distance
by: Sridharamurthy, Raghavendra, et al.
Published: (2021)