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.
Geometry helps to compare persistence diagrams.ACM J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing the Bottleneck Distance between Persistent Homology Transforms
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.