diff options
| author | MathieuCarriere <mathieu.carriere3@gmail.com> | 2022-10-05 18:04:29 +0200 |
|---|---|---|
| committer | MathieuCarriere <mathieu.carriere3@gmail.com> | 2022-10-05 18:04:29 +0200 |
| commit | 57d584a9c09762547692bafbf7f2f5220f5e9f98 (patch) | |
| tree | ac5abd4b0771e6262698431823f763c0c418fbb1 /src/Contraction/include/gudhi/Edge_contraction.h | |
| parent | 4f54d360568fe87cc054206ca601e36ebe1c7f4d (diff) | |
| parent | 524718d63a8f633dbcc4fe7db3fe920ebd7e972c (diff) | |
Merge branch 'master' of https://github.com/GUDHI/gudhi-devel into perslay
Diffstat (limited to 'src/Contraction/include/gudhi/Edge_contraction.h')
| -rw-r--r-- | src/Contraction/include/gudhi/Edge_contraction.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Contraction/include/gudhi/Edge_contraction.h b/src/Contraction/include/gudhi/Edge_contraction.h index 0b43c3b3..dff6dc14 100644 --- a/src/Contraction/include/gudhi/Edge_contraction.h +++ b/src/Contraction/include/gudhi/Edge_contraction.h @@ -48,7 +48,7 @@ Therefore, the simplification can be done without enumerating the set of simplic A typical application of this package is homology group computation. It is illustrated in the next figure where a Rips complex is built upon a set of high-dimensional points and simplified with edge contractions. -It has initially a big number of simplices (around 20 millions) but simplifying it to a much reduced form with only 15 vertices (and 714 simplices) takes only few seconds on a desktop machine (see the example bellow). +It has initially a big number of simplices (around 20 millions) but simplifying it to a much reduced form with only 15 vertices (and 714 simplices) takes only few seconds on a desktop machine (see the example below). One can then compute homology group with a simplicial complex having very few simplices instead of running the homology algorithm on the much bigger initial set of simplices which would take much more time and memory. |