Gudhi

-----------

Release date: April 2016

Below is a list of changes made since Gudhi 1.2.0:

- Alpha complex (new package)
- Alpha_complex is a simplicial complex data structure constructed from the
finite cells of a Delaunay Triangulation.

- Cubical complex (new package)
- The cubical complex is an example of a structured complex useful in
computational mathematics (specially rigorous numerics) and image
analysis.

- Witness complex (new package)
- Witness complex Wit(W,L) is a simplicial complex defined on two sets of
points in Rd. The data structure is described in the paper "Jean-Daniel
Boissonnat and Clément Maria. The Simplex Tree: An Efficient Data
Structure for General Simplicial Complexes. Algorithmica, pages 1–22,
2014."

- Persistent cohomology (new examples)
- alpha_complex_persistence: How to compute persistent homology from an
alpha complex.
- periodic_alpha_complex_3d_persistence.cpp: How to compute persistent
homology on a periodic alpha complex in 3D.
- Bitmap_cubical_complex.cpp: How to compute persistent homology from an
cubical complex.
- Bitmap_cubical_complex_periodic_boundary_conditions.cpp: How to compute
persistent homology from a periodic cubical complex.

- Documentation
- a section on examples.
- a summary of modules on the main page.

- Data sets
- tore3D_300.off: 300 random points on a 3D torus.
- grid_10_10_10_in_0_1.off: Points every 0.1 in each 3 dimensions in
[0, 1].
- in data/bitmaps : examples of Perseus style file for Cubical complex

-----------

Release date: November 2015

Below is a list of changes made since GUDHI 1.1.0:

- GudhUI (new package)
This package provides a User Interface to have a quick overview of GUDHI features.
GudhUI allows to load OFF points or meshes files that can be visualized on a 3D viewer.
A tool suite is available to perform edge contraction, point cloud persistence, and so on.

- Persistent cohomology (new examples)
- persistence_from_simple_simplex_tree: How to compute persistent homology after inserting simplices and their filtration values
- plain_homology: How to compute (non-persistent) homology on simplices
- alpha_shapes_persistence.cpp: How to compute persistent homology after constructing a CGAL 3D alpha shape simplices on a point cloud file

- Simplex tree (new example)
- mini_simplex_tree: How to fill a minimalist (in terms of memory usage) simplex tree

- Skeleton blocker (new examples)
- Skeleton_blocker_from_simplices: How to fill a skeleton blocker with simplices
- Skeleton_blocker_link: How to find a link in a skeleton blocker

- Compilation
- Fix CMake issues.
- Fix Clang compilation.
- Fix Visual Studio 2013 compilation.

- Data sets
- spiral_3d_10k.off: 10000 points on a 3D spiral.
- spiral_4d_10k.off: 10000 points on a 4D spiral.
- tore3D_1307.off: 1307 points on a 3D torus.
- images: pictures taken from a camera rotating around an object (asian mug, little car, lucky cat and money pig) and their off files associated.

-----------

Release date: December 2014

This version contains :

- Skeleton blocker data structure
- Edge contraction
- Persistence from CGAL alpha shapes in 3D

-----------

Release date: June 2014

First publicly available release of the GUDHI library.
This version contains :

- Simplex tree data structure
- Persistence cohomology
- Persistence from Rips