41 citations · 51 across the 6 of their papers we have counts for
8 papers
Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)
Mathieu Pont, Jules Vidal, Julien Tierny
This paper presents a computational framework for the Principal Geodesic Analysis of merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis (PCA) f…
Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data -- An Algorithm and A Benchmark
Pierre Guillou, Jules Vidal, Julien Tierny
This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field defined on a -dimensional simplicial complex $…
Utilising urgent computing to tackle the spread of mosquito-borne diseases
Nick Brown, Rupert Nash, Piero Poletti +12
It is estimated that around 80\% of the world's population live in areas susceptible to at-least one major vector borne disease, and approximately 20% of global communicable diseas…
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…