Proof.In the bottleneck matching, each edge in the bipartite graph corresponds to a specific pair of simplices, not just their geometric values

Difference overlaps: When ∆ α,σ = ∆β,τ over some region due to shared active vertices 17 B

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.CG · 2025-11-30 · unverdicted · novelty 6.0

Faster algorithms compute the integral bottleneck distance between PHTs in Õ(n^5) time and the max version in Õ(n^3) time for R^2 and Õ(n^5) for R^3.

Showing 1 of 1 citing paper.

Computing the Bottleneck Distance between Persistent Homology Transforms cs.CG · 2025-11-30 · unverdicted · none · ref 22
Faster algorithms compute the integral bottleneck distance between PHTs in Õ(n^5) time and the max version in Õ(n^3) time for R^2 and Õ(n^5) for R^3.