author Dmitriy Morozov <>
Thu, 30 Jul 2009 10:23:31 -0700
changeset 146 4e27f1f7c169
parent 134 c270826fd4a8
child 181 1ee6edc17cb6
permissions -rw-r--r--
Added Python bindings for CohomologyPersistence (+ example + documentation)

.. _alpha-shape-example:

Alpha shape example

The example given in :sfile:`examples/alphashapes/` takes a
filename containing points in 2D or 3D on the command line. It generates the
alpha shape filtration of those points, and computes its persistence. It then
outputs the persistence diagram in the format of a point (dimension, birth,
death) per line.

.. literalinclude:: ../../examples/alphashapes/
   :language: python

After the points are read into the list ``points``, the functions
:ref:`fill_alpha*_complex <alphashapes>` fill the list simplices with the
simplices of the Delaunay triangulation. Each one has its :attr:``
attribute set to its alpha shape value (the minimum value of the squared
distance function on its dual Voronoi cell).

The simplices are put into lexicographic order (required for
:class:`Filtration`), and then a filtration is created that sorts simplices with
respect to their data and dimension (via :func:`data_dim_cmp`)::

    f = Filtration(simplices, data_dim_cmp)

We initialize :class:`StaticPersistence`, and pair the simplices::

    p = StaticPersistence(f)
Iterating over the :class:`StaticPersistence`, we output the points of the
persistence diagram (dimension, birth, death) in the last for loop. The ``i ==
i.pair`` condition indicates that the positive simplex is unpaired (i.e. the
class it creates survives till infinity).