New package: Frechet Distance

NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h

@@ -63,6 +63,12 @@ struct Cartesian_filter_K : public Base_
     typedef typename Store_kernel<EK_>::reference_type EK_rt;
     EK_rt exact_kernel()const{return sek.kernel();}
 
+
+    // Added to be similar to CGAL::Filtered_kernel
+    typedef EK Exact_kernel;
+    enum { Has_filtered_predicates = true };
+    typedef Boolean_tag<Has_filtered_predicates> Has_filtered_predicates_tag;
+
     // MSVC is too dumb to perform the empty base optimization.
     typedef std::bool_constant<
       internal::Do_not_store_kernel<Kernel_base>::value &&

NewKernel_d/test/NewKernel_d/Epick_d.cpp

@@ -745,6 +745,11 @@ static_assert(std::is_same<CGAL::Dimension_tag<3>,Ker3::Dimension>::value);
 static_assert(std::is_same<CGAL::Dynamic_dimension_tag,Kerd::Dimension>::value);
 static_assert(std::is_same<CGAL::Dimension_tag<2>,CGAL::Ambient_dimension<Ker2::Point_d>::type>::value);
 static_assert(std::is_same<CGAL::Dimension_tag<3>,CGAL::Ambient_dimension<Ker3::Point_d,Ker3>::type>::value);
+
+static_assert(Ker2::Has_filtered_predicates_tag::value);
+static_assert(Ker3::Has_filtered_predicates_tag::value);
+static_assert(Kerd::Has_filtered_predicates_tag::value);
+
 int main(){
   //Broken with Linear_base_d (output iterator)
   //test2<CGAL::Kernel_d_interface<KK> >();

Polyline_distance/include/CGAL/Frechet_distance.h

@@ -44,6 +44,7 @@ namespace CGAL
  * second curve defined by the sequence of consecutive points along the polyline
  * \param distance the decision distance
  * \param traits
+ * \tparam Traits a model of `PolylineDistanceTraits`
  * \tparam PointRange  a model of the concept `RandomAccessContainer`
  * with `Traits::Point` as value type.
  */
@@ -70,6 +71,7 @@ bool continuous_Frechet_distance_less_than(const PointRange& curve1,
  * sequence of consecutive points along the polyline
  * \param precision
  *  \param traits
+ * \tparam Traits a model of `PolylineDistanceTraits`
  * \tparam PointRange  a model of the concept `RandomAccessContainer`
  * with `Traits::Point` as value type.
  */

Polyline_distance/include/CGAL/Polyline_distance/internal/curve.h

@@ -90,7 +90,9 @@ class Curve
                                      typename iKernel::Point_2 ,
                                      typename iKernel::Point_3>;
 
-    using Bbox = typename T::Bbox;
+    using Bbox = std::conditional_t<(dimension == 2),
+                                     Bbox_2,
+                                     Bbox_3>;
 
     using PointID = ID<Point>;
     using Points = std::vector<Point>;

Polyline_distance/include/CGAL/Polyline_distance_traits_2.h

@@ -47,11 +47,9 @@ class Polyline_distance_traits_2
     using Kernel = GT;
     using FT = typename Kernel::FT;
     using Point = typename Kernel::Point_2;
-    using Bbox = Bbox_2;
 
     static const int dimension = 2;
 
-
     // TODO: remove?
     using Polyline = std::vector<Point>;
     using Polylines = std::vector<Polyline>;

Polyline_distance/include/CGAL/Polyline_distance_traits_3.h

@@ -51,7 +51,6 @@ class Polyline_distance_traits_3
     using Kernel = GT;
     using FT = typename Kernel::FT;
     using Point = typename Kernel::Point_3;
-    using Bbox = Bbox_3;
 
     static const int dimension = 3;
 

Polyline_distance/include/CGAL/Polyline_distance_traits_d.h

@@ -51,7 +51,6 @@ class Polyline_distance_traits_d
     using Kernel = GT;
     using FT = typename Kernel::FT;
     using Point = typename Kernel::Point_d;
-    using Bbox = Bbox<dimension,double>;
 
     // TODO: remove?
     using Polyline = std::vector<Point>;