summaryrefslogtreecommitdiff
path: root/src/Toplex_map
diff options
context:
space:
mode:
Diffstat (limited to 'src/Toplex_map')
-rw-r--r--src/Toplex_map/doc/Intro_Toplex_map.h6
1 files changed, 4 insertions, 2 deletions
diff --git a/src/Toplex_map/doc/Intro_Toplex_map.h b/src/Toplex_map/doc/Intro_Toplex_map.h
index 0cfbae03..a925dc2b 100644
--- a/src/Toplex_map/doc/Intro_Toplex_map.h
+++ b/src/Toplex_map/doc/Intro_Toplex_map.h
@@ -45,11 +45,13 @@ namespace Gudhi {
* needed for these operation is linear or quadratic in \f$\Gamma_0\f$ and \f$d\f$.
*
* Toplex map is composed firstly of a raw storage of toplices and secondly of a map which associate any vertex to a
- * set of pointers toward all toplices containing this vertex.
+ * set of pointers toward all toplices containing this vertex. The data structure is described in
+ * \cite boissonnat_et_al:LIPIcs:2015:5098 (aka. Simplex Array List or SAL).
*
* \image html map.png
*
- * The performances are a lot better than the `Simplex_tree` as soon you use maximal simplices and not simplices.
+ * The performances are a lot better than the `Simplex_tree` as soon you use maximal simplices and not simplices
+ * (cf. \cite DBLP:journals/corr/BoissonnatS16 ).
*
*/
/** @} */ // end defgroup toplex_map