A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Parallel Computation of Persistent Homology using the Blowup Complex
2015
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15
We describe a parallel algorithm that computes persistent homology, an algebraic descriptor of a filtered topological space. Our algorithm is distinguished by operating on a spatial decomposition of the domain, as opposed to a decomposition with respect to the filtration. We rely on a classical construction, called the Mayer-Vietoris blowup complex, to glue global topological information about a space from its disjoint subsets. We introduce an efficient algorithm to perform this gluing
doi:10.1145/2755573.2755587
dblp:conf/spaa/LewisM15
fatcat:3cm3m2q4e5fqzbb7zj6yt6j7am