Corpus ID: 235794986

Realizable piecewise linear paths of persistence diagrams with Reeb graphs

  title={Realizable piecewise linear paths of persistence diagrams with Reeb graphs},
  author={Rehab Alharbi and Erin W. Chambers and E. Munch},
Reeb graphs are widely used in a range of fields for the purposes of analyzing and comparing complex spaces via a simpler combinatorial object. Further, they are closely related to extended persistence diagrams, which largely but not completely encode the information of the Reeb graph. In this paper, we investigate the effect on the persistence diagram of a particular continuous operation on Reeb graphs; namely the (truncated) smoothing operation. This construction arises in the context of the… Expand


Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs
This paper shows that the two metrics are strongly equivalent on the space of Reeb graphs, and gives an immediate proof of bottleneck stability for persistence diagrams in terms of the Reeb graph interleaving distance. Expand
Categorified Reeb Graphs
A natural construction for smoothing a Reeb graph to reduce its topological complexity is obtained and an ‘interleaving’ distance is defined which is stable under the perturbation of a function. Expand
A family of metrics from the truncated smoothing of Reeb graphs
An extension of smoothing on Reeb graphs is introduced, which is called truncated smoothing, which in turn allows us to define a new family of metrics which generalize the interleaving distance for Reeb graph. Expand
Vines and vineyards by updating persistence in linear time
The main result of this paper is an algorithm that maintains the pairing in worst-case linear time per transposition in the ordering and uses the algorithm to compute 1-parameter families of diagrams which are applied to the study of protein folding trajectories. Expand
Efficient algorithms for computing Reeb graphs
An algorithm that constructs the Reeb graph of a Morse function defined on a 3- manifold in O(nlogn+nlogg(loglogg)^3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. Expand
Task-based Augmented Reeb Graphs with Dynamic ST-Trees
This paper presents the first parallel algorithm for the computation of the augmented Reeb graph of piecewise linear scalar data, taking advantage of Fibonacci heaps to exploit the ST-Tree data structure through independent local propagations, while maintaining the optimal, linearithmic time complexity of the sequential reference algorithm. Expand
Loops in reeb graphs of 2-manifolds
An algorithm is given that constructs the Reeb graph in time O(nlogn), where n is the number of edges in the triangulation used to represent the 2-manifold and the Morse function. Expand
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
This paper presents the first sub-quadratic algorithm to compute the Reeb graph for a function on an arbitrary simplicial complex K, and is faster than current algorithms for any other special cases (e.g, 3-manifolds). Expand
The Reeb Graph Edit Distance is Universal
An edit distance for Reeb graphs is defined and it is proved that it is stable and universal, meaning that it provides an upper bound to any other stable distance. Expand
Extending Persistence Using Poincaré and Lefschetz Duality
An algebraic formulation is given that extends persistence to essential homology for any filtered space, an algorithm is presented to calculate it, and how it aids the ability to recognize shape features for codimension 1 submanifolds of Euclidean space is described. Expand