:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wetzels, Florian, Garth, Christoph
Format:	Preprint
Publié:	2022
Sujets:	Computational Geometry
Accès en ligne:	https://arxiv.org/abs/2208.05850
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
par: Wetzels, Florian, et autres
Publié: (2023)

Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
par: Wetzels, Florian, et autres
Publié: (2025)

Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
par: Wetzels, Florian, et autres
Publié: (2025)

Edit Distance between Merge Trees
par: Sridharamurthy, Raghavendra, et autres
Publié: (2022)

Comparative Analysis of Merge Trees using Local Tree Edit Distance
par: Sridharamurthy, Raghavendra, et autres
Publié: (2021)

Merge Tree Geodesics and Barycenters with Path Mappings
par: Wetzels, Florian, et autres
Publié: (2023)

A Finitely Stable Edit Distance for Merge Trees
par: Pegoraro, Matteo
Publié: (2021)

Fréchet Edit Distance
par: Fox, Emily, et autres
Publié: (2024)

Interleaving Distance as a Galois-Edit Distance
par: Kim, Woojin, et autres
Publié: (2025)

Towards Computing Average Merge Tree Based on the Interleaving Distance
par: Touli, Elena Farahbakhsh, et autres
Publié: (2026)

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
par: Touli, Elena Farahbakhsh, et autres
Publié: (2025)

Edit Distance and Persistence Diagrams Over Lattices
par: McCleary, Alexander, et autres
Publié: (2020)

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
par: Chambers, Erin Wolf, et autres
Publié: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

Region-Aware Wasserstein Distances of Persistence Diagrams and Merge Trees
par: Pont, Mathieu, et autres
Publié: (2025)

Continuous Edit Distance, Geodesics and Barycenters of Time-varying Persistence Diagrams
par: Tchitchek, Sebastien, et autres
Publié: (2025)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
par: P V, Althaf, et autres
Publié: (2026)

Locally Correct Interleavings between Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2025)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
par: Zhou, Yi, et autres
Publié: (2026)

Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
par: Lyu, Weiran, et autres
Publié: (2024)

Intrinsic Bottleneck Distance for Merge Trees
par: Beers, David, et autres
Publié: (2025)

Rapid and Precise Topological Comparison with Merge Tree Neural Networks
par: Qin, Yu, et autres
Publié: (2024)

Approximating Gromov-Hausdorff Distance in Euclidean Space
par: Majhi, Sushovan, et autres
Publié: (2019)

On Saxe's theorems about the complexity of the Distance Geometry Problem
par: Kupperschmitt, Maël, et autres
Publié: (2025)

Distinct Distances Between a Line and Strip
par: Das, Sanjana, et autres
Publié: (2025)

Hyperplane Distance Depth
par: Mashghdoust, Amirhossein, et autres
Publié: (2024)

RT-HDIST: Ray-Tracing Core-based Hausdorff Distance Computation
par: Kim, YoungWoo, et autres
Publié: (2025)

On Computing Elastic Shape Distances between Curves in d-dimensional Space
par: Bernal, Javier, et autres
Publié: (2024)

Escher Tile Deformation via Closed-Form Solution
par: Chen, Crane He, et autres
Publié: (2025)

Discrete Fréchet Distance Oracles
par: Aronov, Boris, et autres
Publié: (2024)

Approximating the Directed Hausdorff Distance
par: Chubet, Oliver A., et autres
Publié: (2025)

Fréchet Distance in the Imbalanced Case
par: Blank, Lotte
Publié: (2026)

TTK is Getting MPI-Ready
par: Guillou, Eve Le, et autres
Publié: (2023)

On the Discrete Fréchet Distance in a Graph
par: Driemel, Anne, et autres
Publié: (2022)

Fréchet Distance in Unweighted Planar Graphs
par: van der Hoog, Ivor, et autres
Publié: (2025)

Faster Fréchet Distance under Transformations
par: Buchin, Kevin, et autres
Publié: (2025)

Stable Trajectory Clustering: An Efficient Split and Merge Algorithm
par: Rahmani, Atieh, et autres
Publié: (2025)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2026)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
par: Har-Peled, Sariel, et autres
Publié: (2014)

Computing the Bottleneck Distance between Persistent Homology Transforms
par: Kerber, Michael, et autres
Publié: (2025)