Doc tweaks.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/sparserips-python@3936 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 3c75c674876bcb38d0a87de41d406832baf61b55

3 files changed, 5 insertions, 3 deletions

diff --git a/biblio/bibliography.bib b/biblio/bibliography.bib
index e85876d3..a8c040ed 100644
--- a/biblio/bibliography.bib
+++ b/biblio/bibliography.bib
@@ -1084,6 +1084,7 @@ language={English}
   author = {Nicholas J. Cavanna and Mahmoodreza Jahanseir and Donald R. Sheehy},
   booktitle = {Proceedings of the Canadian Conference on Computational Geometry},
   title = {A Geometric Perspective on Sparse Filtrations},
+  url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/01.pdf},
   year = {2015}
 }
 
@@ -1102,5 +1103,6 @@ language={English}
   volume = {49},
   number = {4},
   pages = {778--796},
+  doi = "10.1007/s00454-013-9513-1",
   year = {2013}
 }
diff --git a/src/cython/cython/rips_complex.pyx b/src/cython/cython/rips_complex.pyx
index ecf039b6..cb9aad2e 100644
--- a/src/cython/cython/rips_complex.pyx
+++ b/src/cython/cython/rips_complex.pyx
@@ -66,6 +66,7 @@ cdef class RipsComplex:
         :type points: list of list of double
 
         And in both cases
+
         :param sparse: If this is not None, it switches to building a sparse Rips and represents the approximation parameter epsilon.
         :type sparse: float
         """
diff --git a/src/cython/doc/rips_complex_user.rst b/src/cython/doc/rips_complex_user.rst
index 9fa3a677..95bb40b6 100644
--- a/src/cython/doc/rips_complex_user.rst
+++ b/src/cython/doc/rips_complex_user.rst
@@ -15,12 +15,11 @@ Definition
 | :doc:`rips_complex_user`                  | :doc:`rips_complex_ref`                                              |
 +-------------------------------------------+----------------------------------------------------------------------+
 
-The `Rips complex <https://en.wikipedia.org/wiki/Vietoris%E2%80%93Rips_complex>`_ is a simplicial complex defined as the clique complex of a graph. The graph is defined on a set of points with one vertex for each point and an edge between any 2 points, of weight (aka filtration value) the distance between the 2 points. This graph (and thus the complex) can be restricted to edges shorter than some threshold, to reduce its size.
+The `Rips complex <https://en.wikipedia.org/wiki/Vietoris%E2%80%93Rips_complex>`_ is a simplicial complex that generalizes proximity (ε-ball) graphs to higher dimensions. The vertices correspond to the input points, and a simplex is present if and only if its diameter is smaller than some parameter α.  Considering all parameters α defines a filtered simplicial complex, where the filtration value of a simplex is its diameter.  The filtration can be restricted to values α smaller than some threshold, to reduce its size.
 
 The input discrete metric space can be provided as a point cloud plus a distance function, or as a distance matrix.
 
-When creating a simplicial complex from the graph, `RipsComplex` inserts the graph into the data
-structure, and then expands the simplicial complex (adds the simplices corresponding to cliques) when required. The expansion can be stopped at dimension `max_dimension`, by default 1.
+When creating a simplicial complex from the graph, `RipsComplex` first builds the graph and inserts it into the data structure. It then expands the simplicial complex (adds the simplices corresponding to cliques) when required. The expansion can be stopped at dimension `max_dimension`, by default 1.
 
 A vertex name corresponds to the index of the point in the given range (aka. the point cloud).