Pith. sign in

REVIEW 1 cited by

Reeb Graph Metrics from the Ground Up

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.05631 v2 pith:UYCGJ7XM submitted 2021-10-11 cs.CG math.AT

classification cs.CGmath.AT
keywords distancebeenmetricsreebgraphprovenbottleneckdefined
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Reeb graph has been utilized in various applications including the analysis of scalar fields. Recently, research has been focused on using topological signatures such as the Reeb graph to compare multiple scalar fields by defining distance metrics on the topological signatures themselves. Here we survey five existing metrics that have been defined on Reeb graphs: the bottleneck distance, the interleaving distance, functional distortion distance, the Reeb graph edit distance, and the universal edit distance. Our goal is to (1) provide definitions and concrete examples of these distances in order to develop the intuition of the reader, (2) visit previously proven results of stability, universality, and discriminativity, (3) identify and complete any remaining properties which have only been proven (or disproven) for a subset of these metrics, (4) expand the taxonomy of the bottleneck distance to better distinguish between variations which have been commonly miscited, and (5) reconcile the various definitions and requirements on the underlying spaces for these metrics to be defined and properties to be proven.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Stable and Theoretically Grounded Gromov-Wasserstein Distance for Reeb Graph Comparison using Persistence Images

    cs.CG 2025-07 reject novelty 6.0 of 10

    The authors introduce RGWp, a Gromov-Wasserstein distance for Reeb graphs with a symmetric Reeb radius and persistence-image weighting, and present a stability proof that contains unproven structural assumptions.

Pith tools