:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Wetzels, Florian, Garth, Christoph
Formato:	Preprint
Publicado:	2022
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2208.05850
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Edit Distance between Merge Trees
por: Sridharamurthy, Raghavendra, et al.
Publicado: (2022)

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

Merge Tree Geodesics and Barycenters with Path Mappings
por: Wetzels, Florian, et al.
Publicado: (2023)

A Finitely Stable Edit Distance for Merge Trees
por: Pegoraro, Matteo
Publicado: (2021)

Fréchet Edit Distance
por: Fox, Emily, et al.
Publicado: (2024)

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

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

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

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

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

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

Region-Aware Wasserstein Distances of Persistence Diagrams and Merge Trees
por: Pont, Mathieu, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

Hyperplane Distance Depth
por: Mashghdoust, Amirhossein, et al.
Publicado: (2024)

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

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

Escher Tile Deformation via Closed-Form Solution
por: Chen, Crane He, et al.
Publicado: (2025)

Discrete Fréchet Distance Oracles
por: Aronov, Boris, et al.
Publicado: (2024)

Approximating the Directed Hausdorff Distance
por: Chubet, Oliver A., et al.
Publicado: (2025)

Fréchet Distance in the Imbalanced Case
por: Blank, Lotte
Publicado: (2026)

TTK is Getting MPI-Ready
por: Guillou, Eve Le, et al.
Publicado: (2023)

On the Discrete Fréchet Distance in a Graph
por: Driemel, Anne, et al.
Publicado: (2022)

Fréchet Distance in Unweighted Planar Graphs
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Faster Fréchet Distance under Transformations
por: Buchin, Kevin, et al.
Publicado: (2025)

Stable Trajectory Clustering: An Efficient Split and Merge Algorithm
por: Rahmani, Atieh, et al.
Publicado: (2025)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2026)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
por: Har-Peled, Sariel, et al.
Publicado: (2014)

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