Replace Delaunay_triangulation_off_io.h and Delaunay_triangulation_off_rw.cpp with

        Points_off_io.h and CGAL_points_off_reader.cpp
Adapt UT and examples for this
Adapt Alpha complex for it
Alpha complex is now inserting points in a faster way (after a spatial_sort).
Remove Alpha complex construction from a pointer on Delaunay triangulation (no more needed).
Adapt documentation to all these modifications
Forbid copy/move constructor/assignment operator on Alpha complex


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

Former-commit-id: 08a673b66451b5cb03fbdf482d696d93b35d220f

1 files changed, 3 insertions, 3 deletions

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