Higher-order persistence diagrams are defined recursively via interval containments, and their aggregations can be evaluated in nearly linear time using zeta transforms instead of explicit pair enumeration.
Computational Geometry , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Higher-order Persistence Diagrams
Higher-order persistence diagrams are defined recursively via interval containments, and their aggregations can be evaluated in nearly linear time using zeta transforms instead of explicit pair enumeration.