From 6f9bbc57d9abb1bd395b7c4d58184ee53656fc72 Mon Sep 17 00:00:00 2001
From: vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Mon, 18 Feb 2019 17:15:41 +0000
Subject: Add biblio and doc references

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/toplex_map@4111 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 42a6e48271d333d604cb5cb0c9c9f1e56b8f1965
---
 biblio/bibliography.bib               | 34 ++++++++++++++++++++++++++++++++++
 src/Toplex_map/doc/Intro_Toplex_map.h |  6 ++++--
 2 files changed, 38 insertions(+), 2 deletions(-)

diff --git a/biblio/bibliography.bib b/biblio/bibliography.bib
index 16f43d6f..47c6b35b 100644
--- a/biblio/bibliography.bib
+++ b/biblio/bibliography.bib
@@ -1103,3 +1103,37 @@ language={English}
   pages = {778--796},
   year = {2013}
 }
+
+@InProceedings{boissonnat_et_al:LIPIcs:2015:5098,
+  author =	{Jean-Daniel Boissonnat and Karthik C. S. and S{\'e}bastien Tavenas},
+  title =	{{Building Efficient and Compact Data Structures for Simplicial Complexes}},
+  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
+  pages =	{642--656},
+  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
+  ISBN =	{978-3-939897-83-5},
+  ISSN =	{1868-8969},
+  year =	{2015},
+  volume =	{34},
+  editor =	{Lars Arge and J{\'a}nos Pach},
+  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
+  address =	{Dagstuhl, Germany},
+  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5098},
+  URN =		{urn:nbn:de:0030-drops-50981},
+  doi =		{10.4230/LIPIcs.SOCG.2015.642},
+  annote =	{Keywords: Simplicial complex, Compact data structures, Automaton, NP-hard}
+}
+
+@article{DBLP:journals/corr/BoissonnatS16,
+  author    = {Jean{-}Daniel Boissonnat and
+               {Karthik {C. S.}}},
+  title     = {An Efficient Representation for Filtrations of Simplicial Complexes},
+  journal   = {CoRR},
+  volume    = {abs/1607.08449},
+  year      = {2016},
+  url       = {http://arxiv.org/abs/1607.08449},
+  archivePrefix = {arXiv},
+  eprint    = {1607.08449},
+  timestamp = {Mon, 13 Aug 2018 16:46:26 +0200},
+  biburl    = {https://dblp.org/rec/bib/journals/corr/BoissonnatS16},
+  bibsource = {dblp computer science bibliography, https://dblp.org}
+}
\ No newline at end of file
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
-- 
cgit v1.2.3