In Delaunay_triangulation_off_io.h, constructing the Triangulation from a vector of Points is a more efficient way (instead of inserting points on the fly).

As consequence, the documentation needs to be rewritten as the points index are changed.



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

Former-commit-id: bdb0196b61418a983cfaf7f6781a3a2906e8b136

1 files changed, 4 insertions, 4 deletions

diff --git a/src/Alpha_complex/doc/Intro_alpha_complex.h b/src/Alpha_complex/doc/Intro_alpha_complex.h
index 0987e0e7..deecf93f 100644
--- a/src/Alpha_complex/doc/Intro_alpha_complex.h
+++ b/src/Alpha_complex/doc/Intro_alpha_complex.h
@@ -112,19 +112,19 @@ namespace alphacomplex {
  * 
  * \subsubsection dimension2 Dimension 2
  * 
- * From the example above, it means the algorithm looks into each triangle ([1,2,3], [2,3,4], [1,3,5], ...),
+ * From the example above, it means the algorithm looks into each triangle ([4,2,1], [2,4,6], [4,5,6], ...),
  * computes the filtration value of the triangle, and then propagates the filtration value as described
  * here :
- * \image html "alpha_complex_doc_135.png" "Filtration value propagation example"
+ * \image html "alpha_complex_doc_421.png" "Filtration value propagation example"
  * 
  * \subsubsection dimension1 Dimension 1
  * 
- * Then, the algorithm looks into each edge ([1,2], [2,3], [1,3], ...),
+ * Then, the algorithm looks into each edge ([1,2], [4,2], [4,1], ...),
  * computes the filtration value of the edge (in this case, propagation will have no effect).
  * 
  * \subsubsection dimension0 Dimension 0
  * 
- * Finally, the algorithm looks into each vertex ([1], [2], [3], [4], [5], [6] and [7]) and
+ * Finally, the algorithm looks into each vertex ([0], [1], [2], [3], [4], [5] and [6]) and
  * sets the filtration value (0 in case of a vertex - propagation will have no effect).
  * 
  * \subsubsection nondecreasing Non decreasing filtration values