From 1967dc923b9bb24edd52a848b7991539779dbe8b Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Wed, 9 Mar 2016 07:01:55 +0000 Subject: 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 --- src/Simplex_tree/doc/Simplex_tree_representation.png | Bin 0 -> 39217 bytes src/Simplex_tree/include/gudhi/Simplex_tree.h | 1 + 2 files changed, 1 insertion(+) create mode 100644 src/Simplex_tree/doc/Simplex_tree_representation.png (limited to 'src/Simplex_tree') diff --git a/src/Simplex_tree/doc/Simplex_tree_representation.png b/src/Simplex_tree/doc/Simplex_tree_representation.png new file mode 100644 index 00000000..9d401520 Binary files /dev/null and b/src/Simplex_tree/doc/Simplex_tree_representation.png differ diff --git a/src/Simplex_tree/include/gudhi/Simplex_tree.h b/src/Simplex_tree/include/gudhi/Simplex_tree.h index 096270ee..53f6fec7 100644 --- a/src/Simplex_tree/include/gudhi/Simplex_tree.h +++ b/src/Simplex_tree/include/gudhi/Simplex_tree.h @@ -68,6 +68,7 @@ namespace Gudhi { The simplex tree is an efficient and flexible data structure for representing general (filtered) simplicial complexes. The data structure is described in \cite boissonnatmariasimplextreealgorithmica + \image html "Simplex_tree_representation.png" "Simplex tree representation" 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 -- cgit v1.2.3