From ead71ec7ab6f5b1d23a0102289530d5f99572fe0 Mon Sep 17 00:00:00 2001
From: skachano <skachano@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Thu, 2 Jun 2016 14:59:04 +0000
Subject: Deleted Landmark choices from witness complex, modified the test

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

Former-commit-id: f3072037b5e931a4e8fcfeadaae3499074377f01
---
 src/Witness_complex/test/witness_complex_points.cpp | 15 +++++----------
 1 file changed, 5 insertions(+), 10 deletions(-)

(limited to 'src/Witness_complex/test')

diff --git a/src/Witness_complex/test/witness_complex_points.cpp b/src/Witness_complex/test/witness_complex_points.cpp
index bd3df604..c0006142 100644
--- a/src/Witness_complex/test/witness_complex_points.cpp
+++ b/src/Witness_complex/test/witness_complex_points.cpp
@@ -27,8 +27,9 @@
 
 #include <gudhi/Simplex_tree.h>
 #include <gudhi/Witness_complex.h>
+#include <gudhi/Construct_closest_landmark_table.h>
 #include <gudhi/Landmark_choice_by_random_point.h>
-#include <gudhi/Landmark_choice_by_furthest_point.h>
+#include <gudhi/Landmark_choice_by_farthest_point.h>
 
 #include <iostream>
 #include <vector>
@@ -40,7 +41,7 @@ typedef Gudhi::witness_complex::Witness_complex<Simplex_tree> WitnessComplex;
 
 BOOST_AUTO_TEST_CASE(witness_complex_points) {
   std::vector< typeVectorVertex > knn;
-  std::vector< Point > points;
+  std::vector< Point > points, landmarks;
   // Add grid points as witnesses
   for (double i = 0; i < 10; i += 1.0)
     for (double j = 0; j < 10; j += 1.0)
@@ -50,15 +51,9 @@ BOOST_AUTO_TEST_CASE(witness_complex_points) {
   bool b_print_output = false;
   // First test: random choice
   Simplex_tree complex1;
-  Gudhi::witness_complex::landmark_choice_by_random_point(points, 100, knn);
+  Gudhi::landmark_choice_by_random_point(points, 100, std::back_inserter(landmarks));
+  Gudhi::witness_complex::construct_closest_landmark_table(points, landmarks, knn);
   assert(!knn.empty());
   WitnessComplex witnessComplex1(knn, 100, 3, complex1);
   BOOST_CHECK(witnessComplex1.is_witness_complex(knn, b_print_output));
-
-  // Second test: furthest choice
-  knn.clear();
-  Simplex_tree complex2;
-  Gudhi::witness_complex::landmark_choice_by_furthest_point(points, 100, knn);
-  WitnessComplex witnessComplex2(knn, 100, 3, complex2);
-  BOOST_CHECK(witnessComplex2.is_witness_complex(knn, b_print_output));
 }
-- 
cgit v1.2.3