This paper presents a unified computational framework for estimation of distances, geodesics and barycenters of merge trees . We extend recent work on the edit distance [106] and introduce a new metric, called the Wassersteindistance between merge trees, which is purposely designed to enable efficientcomputations . We introduce a task-based algorithm which can be generically applied to distance, Geodesic, barycenter or cluster computation . We provide a lightweight C++ implementation that can be used to reproduce our results . We show the utility of our contributions withdedicated visualization applications: feature tracking, temporal reduction andensemble clustering. We provide the lightweight C ++ implementation that . can be . reproduced to reproduce the results of our results. We also provide the C++ Implementation to reproduce their results. For more information, please visit our website:

Author(s) : Mathieu Pont, Jules Vidal, Julie Delon, Julien Tierny

Links : PDF - Abstract

Code :

Keywords : results - merge - trees - provide - reproduce -

Leave a Reply

Your email address will not be published. Required fields are marked *