blob: 2b17464ac8baa478867366062bc59835afe690d2 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
.. GUDHI documentation master file, created by
sphinx-quickstart on Thu Jun 30 09:55:51 2016.
You can adapt this file completely to your liking, but it should at least
contain the root `toctree` directive.
.. toctree::
:maxdepth: 2
GUDHI's documentation
#####################
.. image:: img/Gudhi_banner.png
:align: center
Introduction
************
The Gudhi library (Geometry Understanding in Higher Dimensions) is a generic
open source C++ library for Computational Topology and Topological Data
Analysis (TDA). The GUDHI library intends to help the development of new
algorithmic solutions in TDA and their transfer to applications. It provides
robust, efficient, flexible and easy to use implementations of
state-of-the-art algorithms and data structures.
The current release of the GUDHI library includes:
* Data structures to represent, construct and manipulate simplicial complexes.
* Algorithms to compute persistent homology and multi-field persistent homology.
* Simplication of simplicial complexes by edge contraction.
All data-structures are generic and several of their aspects can be
parameterized via template classes. We refer to [14] for a detailed
description of the design of the library.
Data structures
***************
Alpha complex
=============
.. include:: alpha_complex_sum.rst
Cubical complex
===============
.. include:: cubical_complex_sum.rst
Simplex tree
============
.. include:: simplex_tree_sum.rst
Witness complex
===============
.. include:: witness_complex_sum.rst
Toolbox
*******
Persistence cohomology
======================
===================================== ===================================== =====================================
:Author: Clément Maria :Introduced in: GUDHI PYTHON 1.4.0 :Copyright: GPL v3
===================================== ===================================== =====================================
|
