summaryrefslogtreecommitdiff
path: root/src/Contraction
diff options
context:
space:
mode:
authorvrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2016-03-09 07:01:55 +0000
committervrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2016-03-09 07:01:55 +0000
commit1967dc923b9bb24edd52a848b7991539779dbe8b (patch)
tree78afc9cc4c5e0d9b565c9ca22b3bb63f2c381422 /src/Contraction
parent9a6c0725419f82a978b27cc3708b5a2f375853a2 (diff)
Add header and footer to generated documentation in order to fit with the web site.
Add a package overview on top page. Remove text that was redundant with the web site. git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/Doxygen_for_GUDHI_1.3.0@1035 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 95d6c0e2f0ed8389620c27c03e37d441f93787ee
Diffstat (limited to 'src/Contraction')
-rw-r--r--src/Contraction/doc/sphere_contraction_representation.pngbin0 -> 44839 bytes
-rw-r--r--src/Contraction/include/gudhi/Edge_contraction.h2
2 files changed, 1 insertions, 1 deletions
diff --git a/src/Contraction/doc/sphere_contraction_representation.png b/src/Contraction/doc/sphere_contraction_representation.png
new file mode 100644
index 00000000..edf37bf3
--- /dev/null
+++ b/src/Contraction/doc/sphere_contraction_representation.png
Binary files differ
diff --git a/src/Contraction/include/gudhi/Edge_contraction.h b/src/Contraction/include/gudhi/Edge_contraction.h
index ee3e3de1..73236db9 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