Visualization & HCI

Office	36-227
Email	wetzels@cs.uni-kl.de

Publications

2026

F. Wetzels. Scalar Field Comparison through Merge Tree Edit Distances. PhD thesis, Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau, 2026. 10.26204/KLUEDO/9456

@phdthesis{https://doi.org/10.26204/kluedo/9456,
  doi = {10.26204/KLUEDO/9456},
  url = {https://kluedo.ub.rptu.de/9456},
  author = {Wetzels, Florian},
  keywords = {004 Informatik},
  language = {en},
  title = {Scalar Field Comparison through Merge Tree Edit Distances},
  publisher = {Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau},
  year = {2026},
  copyright = {Creative Commons 4.0 - Namensnennung (CC BY 4.0)}
}

2025

F. Wetzels, H. Leitte, and C. Garth. Accelerating Computation of Stable Merge Tree Edit Distances Using Parameterized Heuristics. IEEE Transactions on Visualization and Computer Graphics, vol. 31, no. 6, pp. 3706–3718, 2025. 10.1109/TVCG.2025.3567120

@article{10988931,
  author = {Wetzels, Florian and Leitte, Heike and Garth, Christoph},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  title = {Accelerating Computation of Stable Merge Tree Edit Distances Using Parameterized Heuristics},
  year = {2025},
  volume = {31},
  number = {6},
  pages = {3706-3718},
  keywords = {Runtime;Heuristic algorithms;Costs;Surveys;Polynomials;Visualization;Transforms;Stability criteria;Perturbation methods;Image edge detection;Scalar data;topological data analysis;merge trees;edit distance},
  doi = {10.1109/TVCG.2025.3567120}
}

F. Wetzels and C. Garth. Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation. arXiv, 2025. 10.48550/ARXIV.2508.02352

@misc{https://doi.org/10.48550/arxiv.2508.02352,
  doi = {10.48550/ARXIV.2508.02352},
  url = {https://arxiv.org/abs/2508.02352},
  author = {Wetzels, Florian and Garth, Christoph},
  keywords = {Computational Geometry (cs.CG), FOS: Computer and information sciences, FOS: Computer and information sciences},
  title = {Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation},
  publisher = {arXiv},
  year = {2025},
  copyright = {Creative Commons Attribution 4.0 International}
}

2024

F. Wetzels, M. Pont, J. Tierny, and C. Garth. Merge Tree Geodesics and Barycenters with Path Mappings. IEEE Transactions on Visualization and Computer Graphics, vol. 30, no. 1, pp. 1095–1105, 2024. 10.1109/TVCG.2023.3326601

@article{10296528,
  author = {Wetzels, Florian and Pont, Mathieu and Tierny, Julien and Garth, Christoph},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  title = {Merge Tree Geodesics and Barycenters with Path Mappings},
  year = {2024},
  volume = {30},
  number = {1},
  pages = {1095-1105},
  keywords = {Time series analysis;Data visualization;Level measurement;Task analysis;Layout;Surveys;Interpolation;Topological data analysis;merge trees;scalar data;ensemble data},
  doi = {10.1109/TVCG.2023.3326601}
}

J. Lukasczyk, M. Will, F. Wetzels, G. H. Weber, and C. Garth. ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs. IEEE Transactions on Visualization and Computer Graphics, vol. 30, no. 1, pp. 1085–1094, 2024. 10.1109/TVCG.2023.3326526

@article{10290925,
  author = {Lukasczyk, Jonas and Will, Michael and Wetzels, Florian and Weber, Gunther H. and Garth, Christoph},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  title = {ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs},
  year = {2024},
  volume = {30},
  number = {1},
  pages = {1085-1094},
  keywords = {Topology;Manifolds;Task analysis;Memory management;Data visualization;Classification algorithms;Data analysis;Scalar field topology;merge trees;persistence pairs;high performance computing},
  doi = {10.1109/TVCG.2023.3326526}
}

F. Wetzels, T. B. Masood, N. H. List, I. Hotz, and C. Garth. Exploring Electron Density Evolution using Merge Tree Mappings. In EuroVis 2024 - Short Papers, 2024. 10.2312/evs.20241069

@inproceedings{10.2312:evs.20241069,
  booktitle = {EuroVis 2024 - Short Papers},
  editor = {Tominski, Christian and Waldner, Manuela and Wang, Bei},
  title = {{Exploring Electron Density Evolution using Merge Tree Mappings}},
  author = {Wetzels, Florian and Masood, Talha Bin and List, Nanna Holmgaard and Hotz, Ingrid and Garth, Christoph},
  year = {2024},
  publisher = {The Eurographics Association},
  isbn = {978-3-03868-251-6},
  doi = {10.2312/evs.20241069}
}

2023

F. Wetzels, M. Anders, and C. Garth. Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-Based Edit Distance. In 2023 Topological Data Analysis and Visualization (TopoInVis), 2023, pp. 82–92. 10.1109/TopoInVis60193.2023.00015

@inproceedings{10363141,
  author = {Wetzels, Florian and Anders, Markus and Garth, Christoph},
  booktitle = {2023 Topological Data Analysis and Visualization (TopoInVis)},
  title = {Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-Based Edit Distance},
  year = {2023},
  volume = {},
  number = {},
  pages = {82-92},
  keywords = {Data analysis;Shape;Perturbation methods;Data visualization;Stability analysis;Computational complexity;Scalar data;Topological data analysis;Merge trees;Edit distance},
  doi = {10.1109/TopoInVis60193.2023.00015}
}

H. L. Weil et al. PLANTdataHUB: a collaborative platform for continuous FAIR data sharing in plant research. The Plant Journal, vol. 116, no. 4, pp. 974–988, Oct. 2023. 10.1111/tpj.16474

@article{Weil_2023,
  title = {PLANTdataHUB: a collaborative platform for continuous FAIR data sharing in plant research},
  volume = {116},
  issn = {1365-313X},
  url = {http://dx.doi.org/10.1111/tpj.16474},
  doi = {10.1111/tpj.16474},
  number = {4},
  journal = {The Plant Journal},
  publisher = {Wiley},
  author = {Weil, Heinrich Lukas and Schneider, Kevin and Tschöpe, Marcel and Bauer, Jonathan and Maus, Oliver and Frey, Kevin and Brilhaus, Dominik and Martins Rodrigues, Cristina and Doniparthi, Gajendra and Wetzels, Florian and Lukasczyk, Jonas and Kranz, Angela and Grüning, Björn and Zimmer, David and Deßloch, Stefan and von Suchodoletz, Dirk and Usadel, Björn and Garth, Christoph and Mühlhaus, Timo},
  year = {2023},
  month = oct,
  pages = {974–988}
}

2022

F. Wetzels, H. Leitte, and C. Garth. Branch Decomposition‐Independent Edit Distances for Merge Trees. Computer Graphics Forum, vol. 41, no. 3, pp. 367–378, Jun. 2022. 10.1111/cgf.14547

@article{Wetzels_2022,
  title = {Branch Decomposition‐Independent Edit Distances for Merge Trees},
  volume = {41},
  issn = {1467-8659},
  url = {http://dx.doi.org/10.1111/cgf.14547},
  doi = {10.1111/cgf.14547},
  number = {3},
  journal = {Computer Graphics Forum},
  publisher = {Wiley},
  author = {Wetzels, Florian and Leitte, Heike and Garth, Christoph},
  year = {2022},
  month = jun,
  pages = {367–378}
}

F. Wetzels and C. Garth. A Deformation-based Edit Distance for Merge Trees. In 2022 Topological Data Analysis and Visualization (TopoInVis), 2022, pp. 29–38. 10.1109/TopoInVis57755.2022.00010

@inproceedings{9975820,
  author = {Wetzels, Florian and Garth, Christoph},
  booktitle = {2022 Topological Data Analysis and Visualization (TopoInVis)},
  title = {A Deformation-based Edit Distance for Merge Trees},
  year = {2022},
  volume = {},
  number = {},
  pages = {29-38},
  doi = {10.1109/TopoInVis57755.2022.00010}
}

2021

M. Anders, P. Schweitzer, and F. Wetzels. Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), 2021, vol. 198, pp. 15:1–15:15. 10.4230/LIPIcs.ICALP.2021.15

@inproceedings{asw+21,
  author = {Anders, Markus and Schweitzer, Pascal and Wetzels, Florian},
  editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
  title = {Comparative Design-Choice Analysis of Color Refinement Algorithms
                 Beyond the Worst Case},
  booktitle = {48th International Colloquium on Automata, Languages, and Programming,
                 {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  series = {LIPIcs},
  volume = {198},
  pages = {15:1--15:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2021},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.15},
  doi = {10.4230/LIPIcs.ICALP.2021.15},
  timestamp = {Tue, 06 Jul 2021 10:05:01 +0200},
  biburl = {https://dblp.org/rec/conf/icalp/AndersSW21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

A. Lohfink, F. Gartzky, F. Wetzels, L. Vollmer, and C. Garth. Time-Varying Fuzzy Contour Trees. 2021 IEEE Visualization Conference (VIS), pp. 86–90, Oct. 2021. 10.1109/VIS49827.2021.9623286

@article{lgw+21,
  author = {Lohfink, A. and Gartzky, F. and Wetzels, F. and Vollmer, L. and Garth, C.},
  booktitle = {2021 IEEE Visualization Conference (VIS)},
  title = {Time-Varying Fuzzy Contour Trees},
  year = {2021},
  volume = {},
  issn = {},
  pages = {86-90},
  keywords = {navigation;design methodology;conferences;time series analysis;data visualization;spatial databases;topology},
  doi = {10.1109/VIS49827.2021.9623286},
  url = {https://doi.ieeecomputersociety.org/10.1109/VIS49827.2021.9623286},
  publisher = {IEEE Computer Society},
  address = {Los Alamitos, CA, USA},
  month = oct
}

2020

A. P. Lohfink, F. Wetzels, J. Lukasczyk, G. H. Weber, and C. Garth. Fuzzy Contour Trees: Alignment and Joint Layout of Multiple Contour Trees. Comput. Graph. Forum, vol. 39, no. 3, pp. 343–355, 2020. 10.1111/cgf.13985

@article{lwlw+20,
  author = {Lohfink, Anna Pia and Wetzels, Florian and Lukasczyk, Jonas and Weber, Gunther H. and Garth, Christoph},
  doi = {10.1111/cgf.13985},
  journal = {Comput. Graph. Forum},
  number = {3},
  pages = {343--355},
  timestamp = {Wed, 26 Aug 2020 11:04:47 +0200},
  title = {Fuzzy Contour Trees: Alignment and Joint Layout of
  		  Multiple Contour Trees},
  url = {https://doi.org/10.1111/cgf.13985},
  volume = {39},
  year = {2020}
}

Department of Computer Science