5 papers · 1 filter
Fast Approximation of Persistence Diagrams with Guarantees
Jules Vidal, Julien Tierny
This paper presents an algorithm for the efficient approximation of the saddle-extremum persistence diagram of a scalar field. Vidal et al. introduced recently a fast algorithm for…
Wasserstein Distances, Geodesics and Barycenters of Merge Trees
Mathieu Pont, Jules Vidal, Julie Delon +1
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] an…
A Progressive Approach to Scalar Field Topology
Jules Vidal, Pierre Guillou, Julien Tierny
This paper introduces progressive algorithms for the topological analysis of scalar data. Our approach is based on a hierarchical representation of the input data and the fast iden…
Statistical Parameter Selection for Clustering Persistence Diagrams
Max Kontak, Jules Vidal, Julien Tierny
In urgent decision making applications, ensemble simulations are an important way to determine different outcome scenarios based on currently available data. In this paper, we will…
Progressive Wasserstein Barycenters of Persistence Diagrams
Jules Vidal, Joseph Budin, Julien Tierny
This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensembl…