Code for creating, manipulating, visualizing and comparing Merge Trees and Decorated Merge Trees (DMTs). Merge trees are a classical tool in the field of topological data analysis (and more broady in data science and computational geometry). DMTs were recently introduced in our paper
Decorated Merge Trees for Persistent Topology by Justin Curry, Haibin Hang, Washington Mio, Tom Needham and Osman Berat Okutan https://arxiv.org/abs/2103.15804 The paper has been published in Journal of Applied and Computational Topology (https://link.springer.com/article/10.1007/s41468-022-00089-3).
Curry, J., Hang, H., Mio, W. et al. Decorated merge trees for persistent topology. J Appl. and Comput. Topology 6, 371–428 (2022). https://doi.org/10.1007/s41468-022-00089-3
This repository will be regularly updated. Currently, the code is not optimized and was mainly developed to create examples for the paper. We will be fixing bugs and adding improvements to the code.
We plan to add notebooks which recreate all of the figures in the paper. Please contact us with questions or to report any issues.