diff options
| -rw-r--r-- | src/Simplex_tree/doc/Intro_simplex_tree.h | 2 | ||||
| -rw-r--r-- | src/cython/doc/alpha_complex_sum.rst | 2 | ||||
| -rw-r--r-- | src/cython/doc/index.rst | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/src/Simplex_tree/doc/Intro_simplex_tree.h b/src/Simplex_tree/doc/Intro_simplex_tree.h index 940dd694..f5b72ff6 100644 --- a/src/Simplex_tree/doc/Intro_simplex_tree.h +++ b/src/Simplex_tree/doc/Intro_simplex_tree.h @@ -32,7 +32,7 @@ namespace Gudhi { * \author Clément Maria * * A simplicial complex \f$\mathbf{K}\f$ on a set of vertices \f$V = \{1, \cdots ,|V|\}\f$ is a collection of - * implices \f$\{\sigma\}\f$, \f$\sigma \subseteq V\f$ such that + * simplices \f$\{\sigma\}\f$, \f$\sigma \subseteq V\f$ such that * \f$\tau \subseteq \sigma \in \mathbf{K} \rightarrow \tau \in \mathbf{K}\f$. The dimension \f$n=|\sigma|-1\f$ of * \f$\sigma\f$ is its number of elements minus \f$1\f$. * diff --git a/src/cython/doc/alpha_complex_sum.rst b/src/cython/doc/alpha_complex_sum.rst index 8437e901..a5f6420a 100644 --- a/src/cython/doc/alpha_complex_sum.rst +++ b/src/cython/doc/alpha_complex_sum.rst @@ -16,7 +16,7 @@ | | complex. | | | | | | This package requires having CGAL version 4.7 or higher (4.8.1 is | -| | advised for better perfomances). | +| | advised for better performance). | +----------------------------------------------------------------+------------------------------------------------------------------------+ | :doc:`alpha_complex_user` | :doc:`alpha_complex_ref` | +----------------------------------------------------------------+------------------------------------------------------------------------+ diff --git a/src/cython/doc/index.rst b/src/cython/doc/index.rst index 89bc0bb2..4f5acfd4 100644 --- a/src/cython/doc/index.rst +++ b/src/cython/doc/index.rst @@ -20,7 +20,7 @@ data structures. The current release of the GUDHI library includes: * Data structures to represent, construct and manipulate simplicial complexes. -* Simplication of simplicial complexes by edge contraction. +* Simplification of simplicial complexes by edge contraction. * Algorithms to compute persistent homology and bottleneck distance. We refer to :cite:`gudhilibrary_ICMS14` for a detailed description of the |