Open AccessMathematicsComputer Science

Computing Persistent Homology

A. Zomorodian, G. Carlsson

2004.6.8DISCRETE & COMPUTATIONAL GEOMETRY

DOI: 10.1145/997817.997870

tlooto Summary

The analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields and derives an algorithm for computing individual persistent homological groups over an arbitrary principal ideal domain in any dimension.

Abstract

Abstract is not available.

Citation format

ZOMORODIAN, A.; CARLSSON, G. Computing persistent homology. DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 33: 249–274.