Interleaved computation for persistent homology

Details Interleaved computation for persistent homology Interleaved computation for persistent homology

2011-05-31

arxiv.org/abs/1105.6305v1

Computer Science

Computational Geometry

5 pages, draft version

Scientific paper

We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the resulting changes into the simplex stream feeding the persistence algorithm. We further discuss the memory consumption and resulting speed and complexity behaviours of the resulting algorithm.

Affiliated with

Also associated with

No associations

Rating

Interleaved computation for persistent homology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interleaved computation for persistent homology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interleaved computation for persistent homology will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338683