Improved the test of interpolation functions to test other types of functors

Interpolation/test/Interpolation/include/CGAL/_test_interpolation_functions_2.cpp

@@ -31,6 +31,7 @@
 #include <CGAL/algorithm.h>
 #include <CGAL/double.h>
 #include <CGAL/function_objects.h>
+#include <CGAL/function.h>
 #include <CGAL/Origin.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/Random.h>
@@ -69,6 +70,42 @@ private:
   Traits traits;
 };
 
+template <typename V, typename T>
+struct Value_function
+{
+  typedef V                                                 argument_type;
+  typedef std::pair<T, bool>                                result_type;
+
+  Value_function(std::size_t i) : index(i) { }
+
+  result_type operator()(const argument_type& a) const {
+    return result_type(a->info()[index].value, true);
+  }
+
+private:
+  std::size_t index;
+};
+
+template <typename V, typename G>
+struct Gradient_function
+  : public CGAL::iterator<std::output_iterator_tag, void, void, void, void>
+{
+
+  typedef V                                                 argument_type;
+  typedef std::pair<G, bool>                                result_type;
+
+  Gradient_function(std::size_t i) : index(i) { }
+
+  result_type operator()(const argument_type& a) const {
+    return std::make_pair(a->info()[index].gradient,
+                          a->info()[index].gradient != CGAL::NULL_VECTOR);
+  }
+
+private:
+  std::size_t index;
+};
+
+
 template < class ForwardIterator >
 bool test_norm(ForwardIterator first, ForwardIterator beyond,
                typename std::iterator_traits<ForwardIterator>::value_type::second_type norm)
@@ -88,10 +125,10 @@ bool test_norm(ForwardIterator first, ForwardIterator beyond,
   }
 }
 
-template < class Tr, class ForwardIterator >
+template < class Tr, class ForwardIterator, class Point >
 bool test_barycenter(ForwardIterator first, ForwardIterator beyond,
                      typename std::iterator_traits<ForwardIterator>::value_type::second_type norm,
-                     const typename std::iterator_traits<ForwardIterator>::value_type::first_type& p,
+                     const Point& p,
                      const typename std::iterator_traits<ForwardIterator>::value_type::second_type& tolerance)
 {
   typedef typename Tr::Geom_traits                                               Gt;
@@ -138,9 +175,13 @@ bool _test_sibson_c1_interpolation_sqrt(ForwardIterator first, ForwardIterator b
                                         const typename std::iterator_traits<ForwardIterator>::value_type::second_type& exact_value,
                                         CGAL::Field_with_sqrt_tag)
 {
-  typename ValueFunctor::result_type res = CGAL::sibson_c1_interpolation(first, beyond,
+  typedef typename std::iterator_traits<ForwardIterator>::value_type::first_type  arg_type;
+  typedef typename boost::result_of<ValueFunctor(arg_type)>::type                 value_functor_result_type;
+
+  value_functor_result_type res = CGAL::sibson_c1_interpolation(first, beyond,
                                                                 norm, p, f,
                                                                 grad_f, geom_traits);
+
   return res.second && (CGAL_NTS abs(res.first-exact_value) <= tolerance);
 }
 
@@ -148,14 +189,18 @@ template < class ForwardIterator, class ValueFunctor, class GradFunctor, class G
 bool test_interpolation_with_value(ForwardIterator first, ForwardIterator beyond,
                                    const typename std::iterator_traits<ForwardIterator>::value_type::second_type& norm,
                                    const Point& p,
-                                   const typename ValueFunctor::result_type::first_type exact_value,
+                                   const typename boost::result_of<
+                                                    ValueFunctor(typename std::iterator_traits<ForwardIterator>::value_type::first_type)>
+                                                    ::type::first_type exact_value,
                                    ValueFunctor f,
                                    GradFunctor grad_f,
                                    const Gt& geom_traits,
                                    const int& i,
                                    const typename std::iterator_traits<ForwardIterator>::value_type::second_type& tolerance)
 {
-  typedef typename ValueFunctor::result_type::first_type       Value_type;
+  typedef typename std::iterator_traits<ForwardIterator>::value_type::first_type  arg_type;
+  typedef typename boost::result_of<ValueFunctor(arg_type)>::type                 value_functor_result_type;
+  typedef typename value_functor_result_type::first_type                          Value_type;
 
   if(i == 0)
   {
@@ -163,7 +208,7 @@ bool test_interpolation_with_value(ForwardIterator first, ForwardIterator beyond
     assert(CGAL_NTS abs(val - exact_value) <= tolerance);
   }
 
-  typename ValueFunctor::result_type res = CGAL::quadratic_interpolation(first, beyond, norm, p, f,
+  value_functor_result_type res = CGAL::quadratic_interpolation(first, beyond, norm, p, f,
                                                                 grad_f, geom_traits);
   assert(res.second && (CGAL_NTS abs(res.first - exact_value) <= tolerance));
 
@@ -190,20 +235,17 @@ bool test_interpolation_with_value(ForwardIterator first, ForwardIterator beyond
   return true;
 }
 
-template < class ForwardIterator, class ValueFunctor, class GradFunctor, class Gt, class Point>
+template < class ForwardIterator, class ValueFunctor, class GradFunctor, class Gt, class Point, class Value_type>
 bool test_interpolation(ForwardIterator first, ForwardIterator beyond,
                         const typename std::iterator_traits<ForwardIterator>::value_type::second_type& norm,
                         const Point& p,
+                        const Value_type exact_value,
                         ValueFunctor f,
                         GradFunctor grad_f,
                         const Gt& geom_traits,
                         const int& i,
                         const typename std::iterator_traits<ForwardIterator>::value_type::second_type& tolerance)
 {
-  typedef typename ValueFunctor::result_type::first_type       Value_type;
-  assert(f(p).second);
-  Value_type exact_value = f(p).first;
-
   return test_interpolation_with_value(first, beyond, norm, p, exact_value, f, grad_f, geom_traits, i, tolerance);
 }
 
@@ -313,7 +355,8 @@ void _test_interpolation_functions_2_Delaunay_without_OutputFunctor(const Dt&, c
 
     for(int i=0; i<3; ++i)
     {
-      assert(test_interpolation(coords.begin(), coords.end(), norm, points[j],
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[j], values[i][points[j]],
                                 CGAL::Data_access< Point_value_map >(values[i]),
                                 CGAL::Data_access< Point_vector_map >(gradients[i]),
                                 Traits(), i, tolerance));
@@ -373,7 +416,8 @@ void _test_interpolation_functions_2_Delaunay_without_OutputFunctor(const Dt&, c
 
   for(int j=0; j<3; ++j)
   {
-    assert(test_interpolation(coords.begin(), coords.end(), norm, points[n/2],
+    assert(test_interpolation(coords.begin(), coords.end(), norm,
+                              points[n/2], values[j][points[n/2]],
                               CGAL::Data_access<Point_value_map>(values[j]),
                               CGAL::Data_access<Point_vector_map>(gradients[j]),
                               Traits(), j, tolerance));
@@ -396,16 +440,18 @@ void _test_interpolation_functions_2_Delaunay_with_OutputFunctor(const Dt&, cons
   typedef typename Dt::Geom_traits                               Gt;
   typedef CGAL::Interpolation_traits_2<Gt>                       Traits;
 
+  typedef typename Dt::Vertex_handle                             Vertex_handle;
+
   typedef typename Gt::FT                                        Coord_type;
   typedef typename Dt::Point                                     Point;
   typedef typename Gt::Vector_2                                  Vector;
 
-  typedef std::map<Point, Coord_type, typename Gt::Less_xy_2>    Point_value_map ;
+  typedef std::vector<std::pair<Vertex_handle, Coord_type> >     Coordinate_vector;
-  typedef std::map<Point, Vector, typename Gt::Less_xy_2>        Point_vector_map;
+  typedef typename Coordinate_vector::const_iterator             CV_cit;
+  typedef CGAL::Identity<std::pair<Vertex_handle, Coord_type> >  Output_functor;
 
-  typedef std::vector<std::pair<Point, Coord_type> >                            Point_coordinate_vector;
+  typedef std::map<Point, Coord_type>                            Point_value_map;
-  typedef typename Point_coordinate_vector::const_iterator                      PCV_cit;
+  typedef std::map<Point, Vector>                                Point_vector_map;
-  typedef CGAL::Interpolation::internal::Extract_point_in_pair<Dt, Coord_type>  Point_output_functor;
 
   std::cout << "NN2: Testing random points." << std::endl;
 
@@ -425,9 +471,6 @@ void _test_interpolation_functions_2_Delaunay_with_OutputFunctor(const Dt&, cons
 
   CGAL::Random random;
 
-  Point_value_map values[3];
-  Point_vector_map gradients[3];
-
   Coord_type alpha = Coord_type(random.get_double(-max_value, max_value)),
              beta1 = Coord_type(random.get_double(-max_value, max_value)),
              beta2 = Coord_type(random.get_double(-max_value, max_value)),
@@ -436,67 +479,110 @@ void _test_interpolation_functions_2_Delaunay_with_OutputFunctor(const Dt&, cons
              gamma3 = Coord_type(random.get_double(-max_value, max_value));
 
   //INSERTION + DET. of GRADIENT for n DATA POINTS :
-  for(int j=0; j<n; ++j)
-  {
-    T.insert(points[j]);
-
-    gradients[0].insert(std::make_pair(points[j], Vector(beta1, beta2)));
-
-    gradients[1].insert(std::make_pair(points[j],
-                                       Vector(beta1 + Coord_type(2)*gamma1*points[j].x(),
-                                              beta2 + Coord_type(2)*gamma1*points[j].y())));
-    gradients[2].insert(std::make_pair(points[j],
-                                       Vector(beta1 + Coord_type(2)*gamma1*points[j].x() + gamma3*points[j].y(),
-                                              beta2 + Coord_type(2)*gamma2*points[j].y() + gamma3*points[j].x())));
-  }
-
   //DETERMINE VALUES FOR n DATA POINTS AND m RANDOM TEST POINTS:
-  for(int j=0; j<n+m; j++)
+  Point_value_map exact_values[3];
+
+  std::map<Point, Vertex_handle> p_to_vh;
+
+  for(int j=0; j<n+m; ++j)
   {
-    // linear function
+    Vector gradient0(beta1, beta2);
-    values[0].insert(std::make_pair(points[j], alpha + beta1*points[j].x() + beta2*points[j].y()));
+    Vector gradient1(beta1 + Coord_type(2)*gamma1*points[j].x(),
+                     beta2 + Coord_type(2)*gamma1*points[j].y());
+    Vector gradient2(beta1 + Coord_type(2)*gamma1*points[j].x() + gamma3*points[j].y(),
+                     beta2 + Coord_type(2)*gamma2*points[j].y() + gamma3*points[j].x());
 
-    // spherical function:
+    Coord_type value0 = alpha + beta1*points[j].x() + beta2*points[j].y();
-    values[1].insert(std::make_pair(points[j], alpha + beta1*points[j].x() +
+    Coord_type value1 = alpha + beta1*points[j].x()
-                                                       beta2*points[j].y() +
+                              + beta2*points[j].y()
-                                                       gamma1*points[j].x()*points[j].x()+
+                              + gamma1*points[j].x()*points[j].x()
-                                                       gamma1*points[j].y()*points[j].y()));
+                              + gamma1*points[j].y()*points[j].y();
+    Coord_type value2 = alpha + beta1*points[j].x()
+                              + beta2*points[j].y()
+                              + gamma1*points[j].x()*points[j].x()
+                              + gamma2*points[j].y()*points[j].y()
+                              + gamma3*points[j].x()*points[j].y();
 
-    // quadratic function
+    if(j<n) // only insert n points
-    values[2].insert(std::make_pair(points[j], alpha + beta1*points[j].x() +
+    {
-                                                       beta2*points[j].y() +
+      Vertex_handle vh = T.insert(points[j]);
-                                                       gamma1*points[j].x()*points[j].x() +
+      p_to_vh[points[j]] = vh;
-                                                       gamma2*points[j].y()*points[j].y() +
+
-                                                       gamma3*points[j].x()*points[j].y()));
+      vh->info()[0].gradient = gradient0;
+      vh->info()[1].gradient = gradient1;
+      vh->info()[2].gradient = gradient2;
+
+
+      vh->info()[0].value = value0;
+      vh->info()[1].value = value1;
+      vh->info()[2].value = value2;
+    }
+    else
+    {
+      exact_values[0][points[j]] = value0;
+      exact_values[1][points[j]] = value1;
+      exact_values[2][points[j]] = value2;
+    }
   }
 
   //INTERPOLATION OF RANDOM POINTS:
   Coord_type norm;
 
-  Point_coordinate_vector pt_coords;
+  Coordinate_vector coords;
-  Point_output_functor pt_fct;
+  Output_functor out_fct;
 
   for(int j=n; j<n+m; ++j)
   {
-    CGAL::Triple<std::back_insert_iterator<Point_coordinate_vector>, Coord_type, bool> coordinate_result =
+    CGAL::Triple<std::back_insert_iterator<Coordinate_vector>, Coord_type, bool> coordinate_result =
-        CGAL::natural_neighbor_coordinates_2(T, points[j], std::back_inserter(pt_coords), pt_fct);
+        CGAL::natural_neighbor_coordinates_2(T, points[j], std::back_inserter(coords), out_fct);
     assert(coordinate_result.third);
     norm = coordinate_result.second;
 
-    bool is_equal = test_norm(pt_coords.begin(), pt_coords.end(), norm);
+    bool is_equal = test_norm(coords.begin(), coords.end(), norm);
     assert(norm > 0);
     assert(is_equal);
-    is_equal = test_barycenter<Dt>(pt_coords.begin(), pt_coords.end(), norm, points[j], tolerance);
+    is_equal = test_barycenter<Dt>(coords.begin(), coords.end(), norm, points[j], tolerance);
     assert(is_equal);
 
+#ifndef CGAL_CFG_NO_CPP0X_LAMBDAS
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[j], exact_values[0][points[j]],
+                                [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[0].value, true); },
+                                [](const Vertex_handle vh) -> std::pair<Vector, bool> { return std::make_pair(vh->info()[0].gradient, true); },
+                                Traits(), 0, tolerance));
+
+
+      // wrapping the lambda in a std function
+      CGAL::cpp11::function<std::pair<Coord_type, bool>(const Vertex_handle)> value_function_1 =
+        [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[1].value, true); };
+
+      std::function<std::pair<Vector, bool>(const Vertex_handle)> gradient_function_1 =
+        [](const Vertex_handle vh) -> std::pair<Vector, bool> { return std::make_pair(vh->info()[1].gradient, true); };
+
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[j], exact_values[1][points[j]],
+                                value_function_1, gradient_function_1,
+                                Traits(), 1, tolerance));
+
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[j], exact_values[2][points[j]],
+                                [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[2].value, true); },
+                                [](const Vertex_handle vh) -> std::pair<Vector, bool> { return std::make_pair(vh->info()[2].gradient, true); },
+                                Traits(), 2, tolerance));
+#else
     for(int i=0; i<3; ++i)
     {
-      assert(test_interpolation(pt_coords.begin(), pt_coords.end(), norm, points[j],
+      Value_function<Vertex_handle, Coord_type> value_function(i);
-                                CGAL::Data_access< Point_value_map >(values[i]),
+      Gradient_function<Vertex_handle, Vector> gradient_function(i);
-                                CGAL::Data_access< Point_vector_map >(gradients[i]),
+
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[j], exact_values[i][points[j]],
+                                value_function, gradient_function,
                                 Traits(), i, tolerance));
     }
-    pt_coords.clear();
+#endif
+
+    coords.clear();
   }
 
   //TESTING THE GRADIENT APPRXIMATION METHOD:
@@ -504,18 +590,44 @@ void _test_interpolation_functions_2_Delaunay_with_OutputFunctor(const Dt&, cons
   std::cout << "Testing gradient estimation method on random points." << std::endl;
 
   typedef CGAL::Interpolation_gradient_fitting_traits_2<Gt> GradTraits;
+
   Point_vector_map approx_gradients[2];
+
+#ifndef CGAL_CFG_NO_CPP0X_LAMBDAS
+  {
     CGAL::sibson_gradient_fitting_nn_2(T,
                                        std::inserter(approx_gradients[0], approx_gradients[0].begin()), // OutputIterator
                                        CGAL::Interpolation::internal::Extract_point_in_pair<Dt, Vector>(), // OutputFunctor
-                                     CGAL::Data_access<Point_value_map>(values[0]), // ValueFunctor
+                                       [](const Vertex_handle vh)
+                                          -> std::pair<Coord_type, bool>
+                                         { return std::make_pair(vh->info()[0].value, true); },
+                                       GradTraits());
+
+    std::function<std::pair<Coord_type, bool>(const Vertex_handle)> value_function_1 =
+      [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[1].value, true); };
+
+    CGAL::sibson_gradient_fitting_nn_2(T,
+                                       std::inserter(approx_gradients[1], approx_gradients[1].begin()),
+                                       CGAL::Interpolation::internal::Extract_point_in_pair<Dt, Vector>(),
+                                       value_function_1,
+                                       GradTraits());
+  }
+#else
+  Value_function<Vertex_handle, Coord_type> value_function_0(0);
+  Value_function<Vertex_handle, Coord_type> value_function_1(1);
+
+  CGAL::sibson_gradient_fitting_nn_2(T,
+                                     std::inserter(approx_gradients[0], approx_gradients[0].begin()), // OutputIterator
+                                     CGAL::Interpolation::internal::Extract_point_in_pair<Dt, Vector>(), // OutputFunctor
+                                     value_function_0,
                                      GradTraits());
 
   CGAL::sibson_gradient_fitting_nn_2(T,
                                      std::inserter(approx_gradients[1], approx_gradients[1].begin()),
                                      CGAL::Interpolation::internal::Extract_point_in_pair<Dt, Vector>(),
-                                     CGAL::Data_access<Point_value_map>(values[1]),
+                                     value_function_1,
                                      GradTraits());
+#endif
 
   for(int j=0; j<n; ++j)
   {
@@ -523,16 +635,19 @@ void _test_interpolation_functions_2_Delaunay_with_OutputFunctor(const Dt&, cons
 
     if(res.second)
     {
+      Gradient_function<Vertex_handle, Vector> gradient_function_0(0);
+      Gradient_function<Vertex_handle, Vector> gradient_function_1(1);
+
       // if it is the exact computation kernel: test the equality:
       assert(tolerance > Coord_type(0) ||
-             res.first == CGAL::Data_access<Point_vector_map>(gradients[0])(points[j]).first);
+             res.first == (gradient_function_0(p_to_vh[points[j]])).first);
       res = CGAL::Data_access<Point_vector_map>(approx_gradients[1])(points[j]);
 
       // if one exists->the other must also exist
       assert(res.second);
 
       assert(tolerance > Coord_type(0) ||
-             res.first == CGAL::Data_access<Point_vector_map>(gradients[1])(points[j]).first);
+             res.first == gradient_function_1(p_to_vh[points[j]]).first);
     }
     else
     {
@@ -541,26 +656,59 @@ void _test_interpolation_functions_2_Delaunay_with_OutputFunctor(const Dt&, cons
   }
 
   //TESTING A POINT == A DATA POINT:
-  CGAL::Triple<std::back_insert_iterator<Point_coordinate_vector>, Coord_type, bool> coordinate_result =
+  CGAL::Triple<std::back_insert_iterator<Coordinate_vector>, Coord_type, bool> coordinate_result =
-      CGAL::natural_neighbor_coordinates_2(T, points[n/2], std::back_inserter(pt_coords), pt_fct);
+      CGAL::natural_neighbor_coordinates_2(T, points[n/2], std::back_inserter(coords), out_fct);
   assert(coordinate_result.third);
   norm = coordinate_result.second;
   assert(norm == Coord_type(1));
 
-  PCV_cit ci = pt_coords.begin();
+  CV_cit ci = coords.begin();
-  assert(ci->first == points[n/2]);
+  assert(ci->first == p_to_vh[points[n/2]]);
   assert(ci->second == Coord_type(1));
   ci++;
-  assert(ci == pt_coords.end());
+  assert(ci == coords.end());
 
+#ifndef CGAL_CFG_NO_CPP0X_LAMBDAS
+  Value_function<Vertex_handle, Coord_type> value_function_0(0);
+  Value_function<Vertex_handle, Coord_type> value_function_2(2);
+
+  assert(test_interpolation(coords.begin(), coords.end(), norm,
+                            points[n/2], value_function_0(p_to_vh[points[n/2]]).first,
+                            [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[0].value, true); },
+                            [](const Vertex_handle vh) -> std::pair<Vector, bool> { return std::make_pair(vh->info()[0].gradient, true); },
+                            Traits(), 0, tolerance));
+
+  // wrapping the lambda in a std function
+  CGAL::cpp11::function<std::pair<Coord_type, bool>(const Vertex_handle)> value_function_1 =
+      [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[1].value, true); };
+
+  std::function<std::pair<Vector, bool>(const Vertex_handle)> gradient_function_1 =
+      [](const Vertex_handle vh) -> std::pair<Vector, bool> { return std::make_pair(vh->info()[1].gradient, true); };
+
+  assert(test_interpolation(coords.begin(), coords.end(), norm,
+                            points[n/2], value_function_1(p_to_vh[points[n/2]]).first,
+                            value_function_1, gradient_function_1,
+                            Traits(), 1, tolerance));
+
+  assert(test_interpolation(coords.begin(), coords.end(), norm,
+                            points[n/2], value_function_2(p_to_vh[points[n/2]]).first,
+                            [](const Vertex_handle vh) -> std::pair<Coord_type, bool> { return std::make_pair(vh->info()[2].value, true); },
+                            [](const Vertex_handle vh) -> std::pair<Vector, bool> { return std::make_pair(vh->info()[2].gradient, true); },
+                            Traits(), 2, tolerance));
+#else
   for(int j=0; j<3; ++j)
   {
-    assert(test_interpolation(pt_coords.begin(), pt_coords.end(), norm, points[n/2],
+    Value_function<Vertex_handle, Coord_type> value_function(j);
-                              CGAL::Data_access<Point_value_map>(values[j]),
+    Gradient_function<Vertex_handle, Vector> gradient_function(j);
-                              CGAL::Data_access<Point_vector_map>(gradients[j]),
+
+    assert(test_interpolation(coords.begin(), coords.end(), norm,
+                              points[n/2], value_function(p_to_vh[points[n/2]]).first,
+                              value_function, gradient_function,
                               Traits(), j, tolerance));
   }
-  pt_coords.clear();
+#endif
+
+  coords.clear();
 }
 
 template <class Rt>
@@ -681,7 +829,8 @@ void _test_interpolation_functions_2_regular_without_OutputFunctor(const Rt&, co
 
     for(int i=0; i<3; ++i)
     {
-      assert(test_interpolation(coords.begin(), coords.end(), norm, points[j],
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[j], values[i][points[j]],
                                 CGAL::Data_access< Point_value_map >(values[i]),
                                 CGAL::Data_access< Point_vector_map >(gradients[i]),
                                 Traits(), i, tolerance));
@@ -742,7 +891,8 @@ void _test_interpolation_functions_2_regular_without_OutputFunctor(const Rt&, co
 
     for(int j=0; j<3; ++j)
     {
-      assert(test_interpolation(coords.begin(), coords.end(), norm, points[n/2],
+      assert(test_interpolation(coords.begin(), coords.end(), norm,
+                                points[n/2], values[j][points[n/2]],
                                 CGAL::Data_access<Point_value_map>(values[j]),
                                 CGAL::Data_access<Point_vector_map>(gradients[j]),
                                 Traits(), j, tolerance));
@@ -986,8 +1136,8 @@ void _test_interpolation_functions_2_regular_with_OutputFunctor(const Rt&, const
       std::pair<FT, bool> ev = CGAL::Data_access<Vertex_value_map>(values[j])(vh);
       assert(ev.second);
 
-      assert(test_interpolation_with_value(vh_coords.begin(), vh_coords.end(), norm, vh->point(),
+      assert(test_interpolation_with_value(vh_coords.begin(), vh_coords.end(), norm,
-                                           ev.first /*exact value*/,
+                                           vh->point(), ev.first /*exact value*/,
                                            CGAL::Data_access<Vertex_value_map>(values[j]),
                                            CGAL::Data_access<Vertex_vector_map>(gradients[j]),
                                            Traits(), j, tolerance));

Interpolation/test/Interpolation/test_interpolation_functions_2.cpp

@@ -21,44 +21,59 @@
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
+#include <CGAL/array.h>
+#include <CGAL/Triangulation_vertex_base_with_info_2.h>
 #include <CGAL/Delaunay_triangulation_2.h>
 #include <CGAL/Regular_triangulation_2.h>
+#include <CGAL/Origin.h>
 
 #include <iostream>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel K;
+typedef CGAL::Exact_predicates_exact_constructions_kernel      EPECK;
-typedef CGAL::Delaunay_triangulation_2<K>                 Dt;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel    EPICK;
-typedef CGAL::Regular_triangulation_2<K>                  Rt;
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel K2;
+template <typename V, typename G>
-typedef CGAL::Delaunay_triangulation_2<K2>                  Dt2;
+struct Value_and_gradient
-typedef CGAL::Regular_triangulation_2<K2>                   Rt2;
+{
+  Value_and_gradient() : value(), gradient(CGAL::NULL_VECTOR) {}
+
+  V value;
+  G gradient;
+};
+
+template<typename Kernel>
+void test_interpolation_functions()
+{
+  // For the Delaunay triangulation, values and gradients (three different data sets)
+  // are stored directly in the vertices
+  typedef typename Kernel::FT                                      Coord_type;
+  typedef typename Kernel::Vector_2                                Vector;
+
+  typedef CGAL::Triangulation_vertex_base_with_info_2<
+                  CGAL::cpp11::array<
+                    Value_and_gradient<Coord_type, Vector>, 3>,
+                  Kernel>                                          Vb;
+  typedef CGAL::Triangulation_data_structure_2<Vb>                 Tds;
+  typedef CGAL::Delaunay_triangulation_2<Kernel, Tds>              Delaunay_triangulation;
+
+  typedef CGAL::Regular_triangulation_2<Kernel>                    Regular_triangulation;
+
+  std::cout << "Testing interpolation functions with 2D NN neighbors " << std::endl;
+  _test_interpolation_functions_2_Delaunay(Delaunay_triangulation(), Coord_type(1e-10));
+
+  std::cout << "Testing interpolation functions with 2D RN neighbors " << std::endl;
+  _test_interpolation_functions_2_regular(Regular_triangulation(), Coord_type(1e-10));
+}
 
 int main()
 {
-  std::cout << "Testing interpolation functions with 2D NN neighbors "
+  std::cout << "--------------------------------------------" << std::endl;
-            << std::endl;
+  std::cout << "Testing with EPECK" << std::endl;
-  std::cout << " using Exact_predicates_exact_constructions_kernel: "
+  test_interpolation_functions<EPECK>();
-            << std::endl ;
-  _test_interpolation_functions_2_Delaunay(Dt(), K::FT(1e-10));
 
-  std::cout << "Testing interpolation functions with 2D NN neighbors "
+  std::cout << "--------------------------------------------" << std::endl;
-            << std::endl;
+  std::cout << "Testing with EPICK" << std::endl;
-  std::cout << " using Exact_predicates_inexact_constructions_kernel: "
+  test_interpolation_functions<EPICK>();
-            << std::endl ;
-  _test_interpolation_functions_2_Delaunay(Dt2(), K2::FT(1e-10));
-
-  std::cout << "Testing interpolation functions with 2D RN neighbors "
-            << std::endl;
-  std::cout << " using Exact_predicates_exact_constructions_kernel: "
-            << std::endl ;
-  _test_interpolation_functions_2_regular(Rt(), K::FT(1e-10));
-
-  std::cout << "Testing interpolation functions with 2D RN neighbors "
-            << std::endl;
-  std::cout << " using Exact_predicates_inexact_constructions_kernel: "
-            << std::endl ;
-  _test_interpolation_functions_2_regular(Rt2(), K2::FT(1e-10));
 
   std::cout << "test_interpolation_functions_2 is finished" << std::endl;