Modified existing tests and examples

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

Former-commit-id: cd187fe5bc9174403aa5dc96c74871c697b3a5e6

1 files changed, 86 insertions, 0 deletions

diff --git a/src/Witness_complex/example/example_witness_complex_off.cpp b/src/Witness_complex/example/example_witness_complex_off.cpp
new file mode 100644
index 00000000..6b0060d9
--- /dev/null
+++ b/src/Witness_complex/example/example_witness_complex_off.cpp
@@ -0,0 +1,86 @@
+/*    This file is part of the Gudhi Library. The Gudhi library
+ *    (Geometric Understanding in Higher Dimensions) is a generic C++
+ *    library for computational topology.
+ *
+ *    Author(s):       Siargey Kachanovich
+ *
+ *    Copyright (C) 2015  INRIA Sophia Antipolis-Méditerranée (France)
+ *
+ *    This program is free software: you can redistribute it and/or modify
+ *    it under the terms of the GNU General Public License as published by
+ *    the Free Software Foundation, either version 3 of the License, or
+ *    (at your option) any later version.
+ *
+ *    This program is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *    GNU General Public License for more details.
+ *
+ *    You should have received a copy of the GNU General Public License
+ *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <sys/types.h>
+#include <sys/stat.h>
+
+#include <gudhi/Simplex_tree.h>
+#include <gudhi/Witness_complex.h>
+#include <gudhi/pick_n_random_points.h>
+#include <gudhi/Points_off_io.h>
+
+#include <CGAL/Epick_d.h>
+
+#include <iostream>
+#include <fstream>
+#include <ctime>
+#include <string>
+#include <vector>
+
+typedef CGAL::Epick_d<CGAL::Dynamic_dimension_tag> K;
+typedef typename K::Point_d Point_d;
+typedef typename Gudhi::witness_complex::Witness_complex<K> Witness_complex;
+typedef std::vector< Vertex_handle > typeVectorVertex;
+typedef std::vector< Point_d > Point_vector;
+
+int main(int argc, char * const argv[]) {
+  if (argc != 4) {
+    std::cerr << "Usage: " << argv[0]
+        << " path_to_point_file nbL alpha^2\n";
+    return 0;
+  }
+
+  std::string file_name = argv[1];
+  int nbL = atoi(argv[2]);
+  double alpha2 = atof(argv[3]);
+  clock_t start, end;
+
+  // Construct the Simplex Tree
+  Gudhi::Simplex_tree<> simplex_tree;
+
+  // Read the point file
+  Point_vector point_vector, landmarks;
+  Gudhi::Points_off_reader<Point_d> off_reader(file_name);
+  if (!off_reader.is_valid()) {
+      std::cerr << "Witness complex - Unable to read file " << file_name << "\n";
+      exit(-1);  // ----- >>
+    }
+  point_vector = Point_vector(off_reader.get_point_cloud());
+  
+  std::cout << "Successfully read " << point_vector.size() << " points.\n";
+  std::cout << "Ambient dimension is " << point_vector[0].dimension() << ".\n";
+
+  // Choose landmarks
+  Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+
+  // Compute witness complex
+  start = clock();
+  Witness_complex witness_complex(landmarks.begin(),
+                                  landmarks.end(),
+                                  point_vector.begin(),
+                                  point_vector.end());
+  witness_complex.create_complex(simplex_tree, alpha2);
+  end = clock();
+  std::cout << "Witness complex took "
+      << static_cast<double>(end - start) / CLOCKS_PER_SEC << " s. \n";
+  std::cout << "Number of simplices is: " << simplex_tree.num_simplices() << "\n";
+}