4.1 Article

Morse Theory for Filtrations and Efficient Computation of Persistent Homology

期刊

DISCRETE & COMPUTATIONAL GEOMETRY
卷 50, 期 2, 页码 330-353

出版社

SPRINGER
DOI: 10.1007/s00454-013-9529-6

关键词

Computational topology; Discrete Morse theory; Persistent homology

资金

  1. NSF [DMS-0915019, CBI-0835621]
  2. DARPA
  3. AFOSR
  4. Direct For Mathematical & Physical Scien
  5. Division Of Mathematical Sciences [0915019] Funding Source: National Science Foundation
  6. Division Of Mathematical Sciences
  7. Direct For Mathematical & Physical Scien [1125174, 1248071] Funding Source: National Science Foundation

向作者/读者索取更多资源

We introduce an efficient preprocessing algorithm to reduce the number of cells in a filtered cell complex while preserving its persistent homology groups. The technique is based on an extension of combinatorial Morse theory from complexes to filtrations.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.1
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据