Journal article
Morse theory for filtrations and efficient computation of persistent homology
- Abstract:
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 422.0KB, Terms of use)
-
- Publisher copy:
- 10.1007/s00454-013-9529-6
Authors
- Publisher:
- Springer
- Journal:
- Discrete & Computational Geometry More from this journal
- Volume:
- 50
- Issue:
- 2
- Pages:
- 330-353
- Publication date:
- 2013-09-01
- Acceptance date:
- 2013-06-27
- DOI:
- EISSN:
-
1432-0444
- ISSN:
-
0179-5376
- Pubs id:
-
pubs:673275
- UUID:
-
uuid:16bb672e-de64-48ee-8497-1653482e6ebe
- Local pid:
-
pubs:673275
- Source identifiers:
-
673275
- Deposit date:
-
2017-01-27
- ARK identifier:
Terms of use
- Copyright holder:
- Springer
- Copyright date:
- 2013
- Notes:
- © Springer Science+Business Media New York 2013. This is the accepted manuscript version of the article. The final version is available online from Springer at: 10.1007/s00454-013-9529-6
If you are the owner of this record, you can report an update to it here: Report update to this record