Abstract
We establish bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional contortion distance. The definition of the latter distance is a novel contribution, and for the special case of contour trees we also prove strict universality of this distance. Furthermore, we prove that for the special case of merge trees the functional contortion distance coincides with the interleaving distance, yielding universality of all four distances in this case.
Originalsprache | englisch |
---|---|
Titel | 38th International Symposium on Computational Geometry (SoCG 2022) |
Redakteure/-innen | Xavier Goaoc, Michael Kerber |
Herausgeber (Verlag) | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Seiten | 14:1-14:18 |
ISBN (elektronisch) | 978-3-95977-227-3 |
DOIs | |
Publikationsstatus | Veröffentlicht - 1 Juni 2022 |
Veranstaltung | 38th International Symposium on Computational Geometry: SoCG 2022 - Berlin, Germany, Berlin, Deutschland Dauer: 7 Juni 2022 → 10 Juni 2022 https://www.inf.fu-berlin.de/inst/ag-ti/socg22/socg.html |
Publikationsreihe
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Band | 224 |
ISSN (Print) | 1868-8969 |
Konferenz
Konferenz | 38th International Symposium on Computational Geometry |
---|---|
Kurztitel | SoCG 2022 |
Land/Gebiet | Deutschland |
Ort | Berlin |
Zeitraum | 7/06/22 → 10/06/22 |
Internetadresse |
ASJC Scopus subject areas
- Software
Fields of Expertise
- Information, Communication & Computing