10 citations · 20 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013★ 1 cited
Distributed computation of persistent homology
Ulrich Bauer, Michael Kerber, Jan Reininghaus
Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation…
math.AT2013★ 3 cited
Clear and Compress: Computing Persistent Homology in Chunks
Ulrich Bauer, Michael Kerber, Jan Reininghaus
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first co…