diff options
Diffstat (limited to 'src/Contraction')
| -rw-r--r-- | src/Contraction/doc/sphere_contraction_representation.png | bin | 0 -> 44839 bytes | |||
| -rw-r--r-- | src/Contraction/include/gudhi/Edge_contraction.h | 3 |
2 files changed, 1 insertions, 2 deletions
diff --git a/src/Contraction/doc/sphere_contraction_representation.png b/src/Contraction/doc/sphere_contraction_representation.png Binary files differnew file mode 100644 index 00000000..edf37bf3 --- /dev/null +++ b/src/Contraction/doc/sphere_contraction_representation.png diff --git a/src/Contraction/include/gudhi/Edge_contraction.h b/src/Contraction/include/gudhi/Edge_contraction.h index a4c786be..1b2cdee9 100644 --- a/src/Contraction/include/gudhi/Edge_contraction.h +++ b/src/Contraction/include/gudhi/Edge_contraction.h @@ -46,7 +46,7 @@ namespace contraction { The purpose of this package is to offer a user-friendly interface for edge contraction simplification of huge simplicial complexes. It uses the \ref skbl data-structure whose size remains small during simplification of most used geometrical complexes of topological data analysis such as the Rips or the Delaunay complexes. In practice, the -size of this data-structure is even uch lower than the total number of simplices. +size of this data-structure is even much lower than the total number of simplices. The edge contraction operation consists in identifying two vertices of a simplicial complex. A lot of algorithms have been developed in computer graphics that allows to reduce efficiently the size of 2-dimensional simplicial complexes @@ -226,7 +226,6 @@ Time to simplify and enumerate simplices: \copyright GNU General Public License v3. -\verbatim Contact: gudhi-users@lists.gforge.inria.fr \endverbatim */ /** @} */ // end defgroup } // namespace contraction |
