diff options
| author | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2017-10-05 17:53:36 +0000 |
|---|---|---|
| committer | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2017-10-05 17:53:36 +0000 |
| commit | e0940ef5613346858ddd4be6018363c4f9ad5afb (patch) | |
| tree | ab160d34e2718122818401bc3a04865516b3258c /src/Simplex_tree/doc | |
| parent | 8d21e4d56cc40e94b395a3a497757c149b4b9f1c (diff) | |
| parent | b9d4c8c0073fbd8c0b0bf999ae6ee7d3de60501d (diff) | |
Merge the branch graph_expansion_with_blocker_oracle for the Simplex_tree
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@2759 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: fa4cf79042f8e9b162617a5a571e06a3feb4c191
Diffstat (limited to 'src/Simplex_tree/doc')
| -rw-r--r-- | src/Simplex_tree/doc/Intro_simplex_tree.h | 9 |
1 files changed, 6 insertions, 3 deletions
diff --git a/src/Simplex_tree/doc/Intro_simplex_tree.h b/src/Simplex_tree/doc/Intro_simplex_tree.h index f5b72ff6..769491d9 100644 --- a/src/Simplex_tree/doc/Intro_simplex_tree.h +++ b/src/Simplex_tree/doc/Intro_simplex_tree.h @@ -67,10 +67,13 @@ Information of the Simplex Tree: Number of vertices = 10 Number of simplices = 98 \endcode * * \li <a href="_simplex_tree_2example_alpha_shapes_3_simplex_tree_from_off_file_8cpp-example.html"> - * Simplex_tree/example_alpha_shapes_3_simplex_tree_from_off_file.cpp</a> - Simplex tree is computed and displayed from a 3D alpha - * complex (Requires CGAL, GMP and GMPXX to be installed) - * + * Simplex_tree/example_alpha_shapes_3_simplex_tree_from_off_file.cpp</a> - Simplex tree is computed and displayed + * from a 3D alpha complex (Requires CGAL, GMP and GMPXX to be installed). * + * \li <a href="_simplex_tree_2graph_expansion_with_blocker_8cpp-example.html"> + * Simplex_tree/graph_expansion_with_blocker.cpp</a> - Simple simplex tree construction from a one-skeleton graph with + * a simple blocker expansion method. + * * \subsection filteredcomplexeshassecomplex Hasse complex * The second one is the Hasse_complex. The Hasse complex is a data structure representing explicitly all co-dimension * 1 incidence relations in a complex. It is consequently faster when accessing the boundary of a simplex, but is less |