Copied Clément's example for 2 functions

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

Former-commit-id: 42f29038057980965bfead2c73cbc013448493fb

3 files changed, 106 insertions, 2 deletions

diff --git a/src/Subsampling/example/CMakeLists.txt b/src/Subsampling/example/CMakeLists.txt
index e7a8a9f7..e1e7cc71 100644
--- a/src/Subsampling/example/CMakeLists.txt
+++ b/src/Subsampling/example/CMakeLists.txt
@@ -11,9 +11,9 @@ if(CGAL_FOUND)
       include( ${EIGEN3_USE_FILE} )
       include_directories (BEFORE "../../include")
 
-      #add_executable( Subsampling_example_pick_random_points example_pick_random_points.cpp )
+      add_executable( Subsampling_example_pick_random_points example_pick_random_points.cpp )
 
-      #add_executable( Subsampling_example_choose_farthest_point example_choose_farthest_point.cpp )
+      add_executable( Subsampling_example_choose_by_farthest_point example_choose_by_farthest_point.cpp )
       #target_link_libraries(Subsampling_example_choose_farthest_point ${Boost_SYSTEM_LIBRARY} ${Boost_UNIT_TEST_FRAMEWORK_LIBRARY})
       
       add_executable(Subsampling_example_sparsify_point_set example_sparsify_point_set.cpp)
diff --git a/src/Subsampling/example/example_choose_by_farthest_point.cpp b/src/Subsampling/example/example_choose_by_farthest_point.cpp
new file mode 100644
index 00000000..5b81bc9d
--- /dev/null
+++ b/src/Subsampling/example/example_choose_by_farthest_point.cpp
@@ -0,0 +1,52 @@
+/*    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) 2016 INRIA
+ *
+ *    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 <gudhi/choose_by_farthest_point.h>
+
+#include <CGAL/Epick_d.h>
+#include <CGAL/Random.h>
+
+#include <array>
+#include <vector>
+#include <iterator>
+
+int main (void)
+{
+  typedef CGAL::Epick_d<CGAL::Dimension_tag<4> >   K;
+  typedef typename K::FT                           FT;
+  typedef typename K::Point_d                      Point_d;
+  
+  CGAL::Random rd;
+
+  std::vector<Point_d> points;
+  for (int i = 0 ; i < 500 ; ++i)
+    points.push_back(Point_d(std::array<FT,4>({rd.get_double(-1.,1),rd.get_double(-1.,1),rd.get_double(-1.,1),rd.get_double(-1.,1)})));
+
+  K k;
+  std::vector<Point_d> results;
+  Gudhi::subsampling::choose_by_farthest_point(k, points, 100, std::back_inserter(results));
+  std::cout << "Before sparsification: " << points.size() << " points.\n";
+  std::cout << "After  sparsification: " << results.size() << " points.\n";
+
+  return 0;
+}
diff --git a/src/Subsampling/example/example_pick_random_points.cpp b/src/Subsampling/example/example_pick_random_points.cpp
new file mode 100644
index 00000000..49a027a4
--- /dev/null
+++ b/src/Subsampling/example/example_pick_random_points.cpp
@@ -0,0 +1,52 @@
+/*    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) 2016 INRIA
+ *
+ *    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 <gudhi/pick_random_points.h>
+
+#include <CGAL/Epick_d.h>
+#include <CGAL/Random.h>
+
+#include <array>
+#include <vector>
+#include <iterator>
+
+int main (void)
+{
+  typedef CGAL::Epick_d<CGAL::Dimension_tag<4> >   K;
+  typedef typename K::FT                           FT;
+  typedef typename K::Point_d                      Point_d;
+  
+  CGAL::Random rd;
+
+  std::vector<Point_d> points;
+  for (int i = 0 ; i < 500 ; ++i)
+    points.push_back(Point_d(std::array<FT,4>({rd.get_double(-1.,1),rd.get_double(-1.,1),rd.get_double(-1.,1),rd.get_double(-1.,1)})));
+
+  K k;
+  std::vector<Point_d> results;
+  Gudhi::subsampling::pick_random_points(points, 100, std::back_inserter(results));
+  std::cout << "Before sparsification: " << points.size() << " points.\n";
+  std::cout << "After  sparsification: " << results.size() << " points.\n";
+
+  return 0;
+}