Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913974638870528 |
|---|---|
| author | Wetzels, Florian Garth, Christoph |
| author_facet | Wetzels, Florian Garth, Christoph |
| contents | This paper introduces a novel stability measure for edit distances between merge trees of piecewise linear scalar fields. We apply the new measure to various metrics introduced recently in the field of scalar field comparison in scientific visualization. While previous stability measures are unable to capture the fine-grained hierarchy of the considered distances, we obtain a classification of stability that fits the efficiency of current implementations and quality of practical results. Our results induce several open questions regarding the lacking theoretical analysis of such practical distances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_02352 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation Wetzels, Florian Garth, Christoph Computational Geometry This paper introduces a novel stability measure for edit distances between merge trees of piecewise linear scalar fields. We apply the new measure to various metrics introduced recently in the field of scalar field comparison in scientific visualization. While previous stability measures are unable to capture the fine-grained hierarchy of the considered distances, we obtain a classification of stability that fits the efficiency of current implementations and quality of practical results. Our results induce several open questions regarding the lacking theoretical analysis of such practical distances. |
| title | Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2508.02352 |