Libstick is a C++ library to compute persistent homology for abstract simplicial complexes over mathbbZ2. It basically implements the boundary matrix reduction algorithm as given in Edelsbrunner and Harer1. Its main features are:


See the installation instructions.

Getting started

The getting started page gives a very brief introduction into the notion of persistent homology and how these concepts are mapped to libstick. If you are familiar with persistent homology then probably the picture below tells most of the story already:

Basic objects


The demonstration page page contains two simple toy applications of persistent homology in image processing.

1-dimensional persistence diagram and a few cycles with significant persistence.

  1. H. Edelsbrunner and J. Harer, Computational Topology. An Introduction, 2010, ISBN 0-8218-4925-5.