Propagate And Pair: A Single-Pass Approach To Critical Point Pairing In Reeb Graphs
Pairing critical points enables forming topological fingerprints, known as persistence diagrams, that provides insights into the structure and noise in data. In this paper, we discuss two algorithmic approaches for pairing critical points in Reeb graphs, first a multipass approach, followed by a new single-pass algorithm, called Propagate and Pair.
Continue reading