Copertina

Edit Distance between Merge Trees

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Sridharamurthy, Raghavendra, Masood, Talha Bin, Kamakshidasan, Adhitya, Natarajan, Vijay
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Computational Geometry
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

Time-varying Extremum Graphs
di: Das, Somenath, et al.
Pubblicazione: (2024)

Towards Computing Average Merge Tree Based on the Interleaving Distance
di: Touli, Elena Farahbakhsh, et al.
Pubblicazione: (2026)

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

Time‐varying Extremum Graphs
di: Somenath Das, et al.
Pubblicazione: (2024)

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

Measure Theoretic Reeb Graphs and Reeb Spaces
di: Wang, Qingsong, et al.
Pubblicazione: (2024)

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

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

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

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

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

A Finitely Stable Edit Distance for Merge Trees
di: Pegoraro, Matteo
Pubblicazione: (2021)

Fréchet Edit Distance
di: Fox, Emily, et al.
Pubblicazione: (2024)

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

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

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

Edit Distance and Persistence Diagrams Over Lattices
di: McCleary, Alexander, et al.
Pubblicazione: (2020)

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

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

Topological Feature Search in Time-Varying Multifield Data
di: Agarwal, Tripti, et al.
Pubblicazione: (2019)

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

Fast Algorithms for Minimum Homology Basis
di: Dhar, Amritendu, et al.
Pubblicazione: (2021)

Analyzing Time-Varying Scalar Fields using Piecewise-Linear Morse-Cerf Theory
di: Dhar, Amritendu, et al.
Pubblicazione: (2025)

Jacobi Set Simplification for Tracking Topological Features in Time-Varying Scalar Fields
di: Meduri, Dhruv, et al.
Pubblicazione: (2024)

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

Geometric Localization of Homology Cycles
di: Dhar, Amritendu, et al.
Pubblicazione: (2024)

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

Continuous Edit Distance, Geodesics and Barycenters of Time-varying Persistence Diagrams
di: Tchitchek, Sebastien, et al.
Pubblicazione: (2025)

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

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

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

Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
di: Dey, Tamal K., et al.
Pubblicazione: (2021)

Internalized Self-Correction for Large Language Models
di: Upadhyaya, Nishanth, et al.
Pubblicazione: (2024)

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

Distinct Distances on Pfaffian Curves
di: Natarajan, Abhiram, et al.
Pubblicazione: (2025)

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

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
di: Barequet, Gill, et al.
Pubblicazione: (2025)