summaryrefslogtreecommitdiff
path: root/src/cython/doc/index.rst
diff options
context:
space:
mode:
authorvrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2017-02-02 22:11:34 +0000
committervrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2017-02-02 22:11:34 +0000
commite8971ecf2fb1f5f7d0e97a4c6226290476917d02 (patch)
tree10a2b5eb629c8661448117539a0446be0e402c78 /src/cython/doc/index.rst
parent0921d31dec497b21a3b2805790ef295e90566e3d (diff)
Doc update
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/ST_cythonize@2051 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 718698efa6fdb133b51923c449d97cd2365f75ae
Diffstat (limited to 'src/cython/doc/index.rst')
-rw-r--r--src/cython/doc/index.rst15
1 files changed, 6 insertions, 9 deletions
diff --git a/src/cython/doc/index.rst b/src/cython/doc/index.rst
index 236ef3a4..26580880 100644
--- a/src/cython/doc/index.rst
+++ b/src/cython/doc/index.rst
@@ -1,10 +1,5 @@
-.. 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.
-
-GUDHI's documentation
-#####################
+GUDHI documentation
+###################
.. image:: img/Gudhi_banner.png
:align: center
@@ -13,8 +8,10 @@ Introduction
************
The Gudhi library (Geometry Understanding in Higher Dimensions) is a generic
-open source C++ library for Computational Topology and Topological Data
-Analysis (`TDA <https://en.wikipedia.org/wiki/Topological_data_analysis>`_).
+open source `C++ library <http://gudhi.gforge.inria.fr/doc/latest/>`_, with a
+`cython interface <http://gudhi.gforge.inria.fr/cython/latest/>`_, for
+Computational Topology and Topological Data Analysis
+(`TDA <https://en.wikipedia.org/wiki/Topological_data_analysis>`_).
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