DeepAI AI Chat
Log In Sign Up

Ripser: efficient computation of Vietoris-Rips persistence barcodes

by   Ulrich Bauer, et al.

We present an algorithm for the computation of Vietoris-Rips persistence barcodes and describe its implementation in the software Ripser. The method relies on implicit representations of the coboundary operator and the filtration order of the simplices, avoiding the explicit construction and storage of the filtration coboundary matrix. Moreover, it makes use of apparent pairs, a simple but powerful method for constructing a discrete gradient field from a total order on the simplices of a simplicial complex, which is also of independent interest. Our implementation shows substantial improvements over previous software both in time and memory usage.


page 1

page 2

page 3

page 4


Fast Computation of Zigzag Persistence

Zigzag persistence is a powerful extension of the standard persistence w...

GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes

The computation of Vietoris-Rips persistence barcodes is both execution-...

Swap, Shift and Trim to Edge Collapse a Filtration

Boissonnat and Pritam introduced an algorithm to reduce a filtration of ...

Computing Connection Matrices via Persistence-like Reductions

Connection matrices are a generalization of Morse boundary operators fro...

The Topology ToolKit

This system paper presents the Topology ToolKit (TTK), a software platfo...

Improved OpenCL-based Implementation of Social Field Pedestrian Model

Two aspects of improvements are proposed for the OpenCL-based implementa...