diff --git a/.gitignore b/.gitignore
index 93b7a9bfc90..752f07930b2 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,3 +1,4 @@
+build
 /*build*
 /*/*/*/build
 /*/*/*/VC*
diff --git a/Algebraic_kernel_for_circles/include/CGAL/Root_for_circles_2_2.h b/Algebraic_kernel_for_circles/include/CGAL/Root_for_circles_2_2.h
index bd26c95af66..8a5eda359e3 100644
--- a/Algebraic_kernel_for_circles/include/CGAL/Root_for_circles_2_2.h
+++ b/Algebraic_kernel_for_circles/include/CGAL/Root_for_circles_2_2.h
@@ -46,7 +46,7 @@ class Root_for_circles_2_2 {
   Root_for_circles_2_2(const Root_of_2& r1, const Root_of_2& r2)
     : x_(r1), y_(r2)
   {
-    // When it is an interval this assertion dont compile
+    // When it is an interval this assertion doesn't compile
     //CGAL_assertion((r1.is_rational() || r2.is_rational()) ||
     //               (r1.gamma() == r2.gamma()));
   }
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py
index 0df5ed5e0f4..264dec30935 100644
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py
@@ -134,13 +134,13 @@ def main(argv):
       avg_diff_str = str(format(abs(avg_diff_to_goal), '.2f'))
       if key == "Mean_Min_Angle_(degree)" or key == "Mean_Max_Angle_(degree)":
         if avg_diff_to_goal < 0 :
-          title += "\nIn average we loose "
+          title += "\nIn average we lose "
         else :
           title += "\nIn average we gain "
         title += avg_diff_str + "° toward 60°"
       elif key == "Mean_Radius_Ratio" or key == "Mean_Edge_Ratio" or key == "Mean_Aspect_Ratio" :
         if avg_diff_to_goal < 0 :
-          title += "\nIn average we loose "
+          title += "\nIn average we lose "
         else :
           title += "\nIn average we gain "
         title += avg_diff_str + " of ratio toward 1"
diff --git a/Apollonius_graph_2/include/CGAL/Apollonius_graph_2/Bounded_side_of_ccw_circle_C2.h b/Apollonius_graph_2/include/CGAL/Apollonius_graph_2/Bounded_side_of_ccw_circle_C2.h
index bbef2be6ac0..a6590cde787 100644
--- a/Apollonius_graph_2/include/CGAL/Apollonius_graph_2/Bounded_side_of_ccw_circle_C2.h
+++ b/Apollonius_graph_2/include/CGAL/Apollonius_graph_2/Bounded_side_of_ccw_circle_C2.h
@@ -77,7 +77,7 @@ private:
 
 public:
   typedef Voronoi_radius_2<K>       Voronoi_radius;
-  typedef typename K::Bounded_side  Bounded_dide;
+  typedef typename K::Bounded_side  Bounded_side;
 
 public:
   template<class Tag>
diff --git a/Arrangement_on_surface_2/TODO b/Arrangement_on_surface_2/TODO
index 63b5d28a8c1..615c13266cf 100644
--- a/Arrangement_on_surface_2/TODO
+++ b/Arrangement_on_surface_2/TODO
@@ -164,7 +164,7 @@
   or at least issues warnings about returning a reference to temporary
   variable. Can you prompt the INRIA people to fix this?
   (I personally think that we should remove this example from our test-suite,
-   but if the INRIA people believe that it's place is there, they should at
+   but if the INRIA people believe that its place is there, they should at
    least properly maintain it ...)
 - There is a problem with the examples that use CORE on Darwin (platform #10).
   Other Darwin platforms seem fine. Do we want to investigate? (perhaps it's
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h
index 33942b6d83a..d983cea19d1 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h
@@ -232,7 +232,7 @@ protected: // methods
   // Assumes that clippingRect is valid.
   std::vector< X_monotone_curve_2 > visibleParts( X_monotone_curve_2 curve );
 
-  // keep only the intersection points ie. throw out overlapping curve segments
+  // keep only the intersection points i.e. throw out overlapping curve segments
   void filterIntersectionPoints( std::vector< CGAL::Object >& res );
 
 protected: // members
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 0287ab3226c..2498396f920 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -1999,7 +1999,7 @@ operates in two-dimensional surfaces (not restricted to the plane),
 (ii) accepts various families of \f$x\f$-monotone curves (not only
 line segments), and (iii) handles overlaps. (Observe that the original
 algorithm did not handle overlaps. Handling overlaps is difficult,
-especially for polyline, as two polylines may overlap in more then one
+especially for polyline, as two polylines may overlap in more than one
 connected component.) The generic implementation serves as the
 foundation of a family of concrete operations described in the rest of
 this section, such as aggregately constructing an arrangement induced
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
index 85ba6ccc235..fefc8a75748 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
@@ -113,7 +113,7 @@ locate(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    *
    * If the type Bgt2 is the same as the type Gt2, use a reference to Gt2
    * to avoid constructing a new one.  Otherwise, instantiate a local variable
-   * of the former and provide the later as a single parameter to the
+   * of the former and provide the latter as a single parameter to the
    * constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
index 0f63b3c41fa..6d810e11f3c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
@@ -2500,7 +2500,7 @@ public:
       double min_dist = -1;
       Integer aux_coeffs[6];
       for (int k = 1; k <= 2; ++k) {
-        // Get the integer coefficients of the k'th auxiliary conic curve.
+        // Get the integer coefficients of the k-th auxiliary conic curve.
         aux_rat_coeffs[0] = (k == 1) ? r_1 : r_2;
         aux_rat_coeffs[1] = (k == 1) ? s_1 : s_2;
         aux_rat_coeffs[2] = (k == 1) ? t_1 : t_2;
@@ -2516,7 +2516,7 @@ public:
                        (CGAL::sign(aux_coeffs[2]) == ZERO)) ? 1 : 2;
 
         // Compute the \f$x\f$- and \f$y\f$-coordinates of intersection points
-        // of the base conic and the k'th auxiliary conic.
+        // of the base conic and the k-th auxiliary conic.
         int n_xs = compute_resultant_roots(*nt_traits,
                                            base_coeffs[0], base_coeffs[1],
                                            base_coeffs[2],
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_cache.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_cache.h
index 9598456cd59..62d71befe8b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_cache.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_cache.h
@@ -590,7 +590,7 @@ bool _Bezier_cache<NtTraits>::_intersection_params
 
   // Construct the bivariate polynomial that corresponds to Equation I.
   // Note that we represent a bivariate polynomial as a vector of univariate
-  // polynomials, whose i'th entry corresponds to the coefficient of t^i,
+  // polynomials, whose i-th entry corresponds to the coefficient of t^i,
   // which is in turn a polynomial it s.
   const int                degX_2 = nt_traits.degree (polyX_2);
   std::vector<Polynomial>  coeffsX_st (degX_2 < 0 ? 1 : (degX_2 + 1));
@@ -657,7 +657,7 @@ void _Bezier_cache<NtTraits>::_self_intersection_params
 
   // Construct the bivariate polynomial that corresponds to Equation I.
   // Note that we represent a bivariate polynomial as a vector of univariate
-  // polynomials, whose i'th entry corresponds to the coefficient of t^i,
+  // polynomials, whose i-th entry corresponds to the coefficient of t^i,
   // which is in turn a polynomial it s.
   const int                degX = nt_traits.degree (polyX);
   CGAL_assertion(degX > 0);
@@ -771,7 +771,7 @@ _Bezier_cache<NtTraits>::_compute_resultant
     if (nt_traits.degree (mat[i][i]) < 0)
     {
       // If the current diagonal value is a zero polynomial, try to replace
-      // the current i'th row with a row with a higher index k, such that
+      // the current i-th row with a row with a higher index k, such that
       // mat[k][i] is not a zero polynomial.
 
       found_row = false;
@@ -786,7 +786,7 @@ _Bezier_cache<NtTraits>::_compute_resultant
 
       if (found_row)
       {
-        // Swap the i'th and the k'th rows (note that we start from the i'th
+        // Swap the i-th and the k-th rows (note that we start from the i-th
         // column, because the first i entries in every row with index i or
         // higher should be zero by now).
         for (j = i; j < dim; j++)
@@ -808,7 +808,7 @@ _Bezier_cache<NtTraits>::_compute_resultant
       }
     }
 
-    // Zero the whole i'th column of the following rows.
+    // Zero the whole i-th column of the following rows.
     for (k = i + 1; k < dim; k++)
     {
       if (nt_traits.degree (mat[k][i]) >= 0)
@@ -821,7 +821,7 @@ _Bezier_cache<NtTraits>::_compute_resultant
           mat[k][j] = mat[k][j] * mat[i][i] - mat[i][j] * value;
         }
 
-        // We multiplied the current row by the i'th diagonal entry, thus
+        // We multiplied the current row by the i-th diagonal entry, thus
         // multiplying the determinant value by it. We therefore increment
         // the exponent of mat[i][i] in the normalization factor.
         exp_fact[i] = exp_fact[i] + 1;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_curve_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_curve_2.h
index e63e7eea930..ba4c3e69342 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_curve_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_curve_2.h
@@ -397,7 +397,7 @@ public:
     return static_cast<unsigned int>((this->_rep()._ctrl_pts.size()));
   }
 
-  /*! obtains the i'th control point.
+  /*! obtains the i-th control point.
    * \pre i must be between 0 and n - 1, where n is the number of control
    *      points.
    */
@@ -681,7 +681,7 @@ void _Bezier_curve_2_rep<RatKer, AlgKer, NtTrt,
     px = pts_begin->x();
     py = pts_begin->y();
 
-    // By simplifying (1 - t)^(n-k) we obtain that the k'th expression of
+    // By simplifying (1 - t)^(n-k) we obtain that the k-th expression of
     // the above sum is given by:
     //
     //     n-k
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_arc_2.h
index b0bd7fd018e..d90692e229b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_arc_2.h
@@ -572,7 +572,7 @@ public:
     int k;
 
     for (k = 1; k <= 2; ++k) {
-      // Get the integer coefficients of the k'th auxiliary conic curve.
+      // Get the integer coefficients of the k-th auxiliary conic curve.
       aux_rat_coeffs[0] = (k == 1) ? r_1 : r_2;
       aux_rat_coeffs[1] = (k == 1) ? s_1 : s_2;
       aux_rat_coeffs[2] = (k == 1) ? t_1 : t_2;
@@ -593,7 +593,7 @@ public:
       }
 
       // Compute the x- and y-coordinates of intersection points of the base
-      // conic and the k'th auxiliary conic.
+      // conic and the k-th auxiliary conic.
       n_xs = compute_resultant_roots(nt_traits,
                                      base_coeffs[0], base_coeffs[1],
                                      base_coeffs[2],
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
index c9e17b4d85f..9ec99d99500 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
@@ -1078,7 +1078,7 @@ private:
   }
 
 public:
-  /*! obtains the i'th order derivative by x of the conic at the point p=(x,y).
+  /*! obtains the i-th order derivative by x of the conic at the point p=(x,y).
    * \param p The point where we derive.
    * \param i The order of the derivatives (either 1, 2 or 3).
    * \param slope_numer The numerator of the slope.
@@ -1187,7 +1187,7 @@ public:
     CGAL_error();
   }
 
-  /*! obtains the i'th order derivative by y of the conic at the point p=(x,y).
+  /*! obtains the i-th order derivative by y of the conic at the point p=(x,y).
    * \param p The point where we derive.
    * \param i The order of the derivatives (either 1, 2 or 3).
    * \param slope_numer The numerator of the slope.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/de_Casteljau_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/de_Casteljau_2.h
index caf0e8eacfc..0db81ef2484 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/de_Casteljau_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/de_Casteljau_2.h
@@ -77,7 +77,7 @@ bisect_control_polygon_2(InputIterator ctrl_pts_begin,
   while (last_index > 0)
   {
     // Construct (m - 1) control points from the m point we currently have,
-    // where the new i'th point is the midpoint between p[i]  and p[i + 1].
+    // where the new i-th point is the midpoint between p[i]  and p[i + 1].
     for (i = 0; i < last_index; ++i)
       vec[i] = midpoint(vec[i], vec[i + 1]);
 
@@ -134,7 +134,7 @@ typename InputIterator::value_type point_on_Bezier_curve_2
   while (last_index > 0)
   {
     // Construct (m - 1) control points from the m point we currently have,
-    // where the new i'th point is given by: (1 - t0)*p[i] + t0*p[i + 1].
+    // where the new i-th point is given by: (1 - t0)*p[i] + t0*p[i + 1].
     for (i = 0; i < last_index; ++i)
     {
       vec[i] = _Point_2(comp_t0*vec[i].x() + t0*vec[i + 1].x(),
@@ -197,7 +197,7 @@ typename InputIterator::value_type de_Casteljau_2
   while (last_index > 0)
   {
     // Construct (m - 1) control points from the m point we currently have,
-    // where the new i'th point is given by: (1 - t0)*p[i] + t0*p[i + 1].
+    // where the new i-th point is given by: (1 - t0)*p[i] + t0*p[i + 1].
     for (i = 0; i < last_index; ++i)
     {
       vec[i] = _Point_2(comp_t0*vec[i].x() + t0*vec[i + 1].x(),
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index dfa6fb89ffc..4d518c96961 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -241,7 +241,7 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
    * If the type Ovl_gt2 is the same as the type
    * GeomTraits, use a reference to GeomTraits to avoid constructing a new one.
    * Otherwise, instantiate a local variable of the former and provide
-   * the later as a single parameter to the constructor.
+   * the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index 82b554cb6a0..3390ef3d585 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -1992,10 +1992,10 @@ public:
     determines according to pre defined conditions whether the
     current Trapezoidal_decomposition_2<Traits> needs update
     Postconditions:
-    The output is true iff the depth of the Trapezoidal Tree is more then
+    The output is true iff the depth of the Trapezoidal Tree is more than
     DepthThreshold times log of the X_curve count or the Trapezoidal Tree's
     size
-    is more then SizeThreshold times the log of the last count.
+    is more than SizeThreshold times the log of the last count.
   */
   bool set_with_guarantees(bool u)
   {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
index 7bf3b5da9cc..94173b2e083 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
@@ -2625,7 +2625,7 @@ protected:
 
     if ((! is_vert(cv[0]) && (cmp_x(get_min_v(cv[i]), q) == EQUAL)) ||
         (is_vert(cv[0]) && equal(get_min_v(cv[i]), q))) {
-      // q is the left endpoint of the i'th subcurve:
+      // q is the left endpoint of the i-th subcurve:
       if (to_right) return i;
       else {
         // to_left
@@ -2642,7 +2642,7 @@ protected:
 
     if ((! is_vert(cv[0]) && (cmp_x(get_max_v(cv[i]), q) == EQUAL)) ||
         (is_vert(cv[0]) && equal(get_max_v(cv[i]), q))) {
-      // q is the right endpoint of the i'th subcurve:
+      // q is the right endpoint of the i-th subcurve:
       if (! to_right) return i;
       else {
         if (direction == SMALLER) {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
index 8c78432ad12..51f47742df8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
@@ -598,15 +598,15 @@ public:
       if (dir == SMALLER){
         // Check whether the split point is xcv[i]'s source or target.
         if (equal(max_vertex(xcv[i]), p)) {
-          // The entire i'th subcurve belongs to xcv1:
+          // The entire i-th subcurve belongs to xcv1:
           xcv1.push_back(xcv[i]);
         }
         else if (equal(min_vertex(xcv[i]), p)) {
-          // The entire i'th subcurves belongs to xcv2:
+          // The entire i-th subcurves belongs to xcv2:
           xcv2.push_back(xcv[i]);
         }
         else {
-          // The i'th subcurve should be split: The left part(seg1)
+          // The i-th subcurve should be split: The left part(seg1)
           // goes to xcv1, and the right part(seg2) goes to xcv2.
           X_monotone_subcurve_2 seg1, seg2;
           m_poly_traits.subcurve_traits_2()->split_2_object()(xcv[i], p,
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
index 8dea4d1afb5..a2beb87aac2 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
@@ -281,7 +281,7 @@ is_in_face(const Face* f, const Point_2& p, const Vertex* v) const
               // -----------
               // cv1 coincide with the identification curve. In this case we
               // consider the identification to be on the right. All (interior)
-              // points are smaller then the right boundary.
+              // points are smaller than the right boundary.
               rc1 = SMALLER;
               rc2 = cmp_x_pt_ce(p, cv2, ARR_MAX_END);
             }
@@ -294,7 +294,7 @@ is_in_face(const Face* f, const Point_2& p, const Vertex* v) const
               //       -----------
               // cv2 coincide with the identification curve. In this case we
               // consider the identification to be on the left. All (interior)
-              // points are larger then the left boundary.
+              // points are larger than the left boundary.
               rc1 = cmp_x_pt_ce(p, cv1, ARR_MAX_END);
               rc2 = LARGER;
             }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
index 099f44192ee..6a53d0d4ee3 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
@@ -117,7 +117,7 @@ decompose(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    *
    * If the type Vgt2 is the same as the type Gt2, use a
    * reference to Gt2 to avoid constructing a new one.  Otherwise,
-   * instantiate a local variable of the former and provide the later as a
+   * instantiate a local variable of the former and provide the latter as a
    * single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index 1436405e4d8..6c826feec2a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -264,7 +264,7 @@ insert_empty(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    * If the type C_visitor::Geometry_traits_2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
@@ -319,7 +319,7 @@ void insert_empty(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>&
    * If the type C_visitor::Geometry_traits_2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
@@ -372,7 +372,7 @@ void insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
    * If the type Igt2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
@@ -972,7 +972,7 @@ non_intersecting_insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
    * If the type Nxi_visitor::Geometry_traits_2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
diff --git a/Arrangement_on_surface_2/include/CGAL/CORE_algebraic_number_traits.h b/Arrangement_on_surface_2/include/CGAL/CORE_algebraic_number_traits.h
index c3e941fdab8..7f6b84ff782 100644
--- a/Arrangement_on_surface_2/include/CGAL/CORE_algebraic_number_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/CORE_algebraic_number_traits.h
@@ -541,7 +541,7 @@ public:
 
     for (i = 1; i <= n_roots; i++)
     {
-      // Get the i'th real-valued root.
+      // Get the i-th real-valued root.
       *oi = rootOf(poly, i);
       ++oi;
     }
@@ -603,7 +603,7 @@ public:
 
     for (i = 0; i < root_intervals.size(); i++)
     {
-      // Get the i'th real-valued root.
+      // Get the i-th real-valued root.
       *oi = rootOf(poly, root_intervals[i]);
       ++oi;
     }
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_construction_event_base.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_construction_event_base.h
index e14d641cecb..a8873c17fce 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_construction_event_base.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_construction_event_base.h
@@ -197,11 +197,11 @@ public:
   void init_subcurve_in_arrangement_flags(size_t n)
   { m_isCurveInArr.resize(n, false); }
 
-  /*! checks if the i'th subcurve is in the arrangement. */
+  /*! checks if the i-th subcurve is in the arrangement. */
   bool is_subcurve_in_arrangement(unsigned int i) const
   { return (m_isCurveInArr[i]); }
 
-  /*! sets the flag indicating whether the i'th subcurve is in the arrangement.
+  /*! sets the flag indicating whether the i-th subcurve is in the arrangement.
    */
   void set_subcurve_in_arrangement(unsigned int i, bool flag)
   { m_isCurveInArr[i] = flag; }
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h
index 35b3c221eb6..b3c5d18a5a3 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h
@@ -563,7 +563,7 @@ template <typename InputStream_>
 bool IO_base_test<Base_geom_traits>::read_segment(InputStream_& is,
                                                   Subcurve_2& seg)
 {
-  //we dont need to check this type as it has already been checked in the
+  //we don't need to check this type as it has already been checked in the
   //IO_test.h
   char type;
   is >> type;
@@ -600,7 +600,7 @@ template <typename InputStream_>
 bool IO_base_test<Base_geom_traits>::read_xsegment(InputStream_& is,
                                                    X_monotone_subcurve_2& xseg)
 {
-  //we dont need to check this type as it has already been checked in the
+  //we don't need to check this type as it has already been checked in the
   //IO_test.h
   char type;
   is >> type;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/construction_test_suite_generator.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/construction_test_suite_generator.cpp
index 8dfb636ebd3..a4a9993955a 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/construction_test_suite_generator.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/construction_test_suite_generator.cpp
@@ -116,7 +116,7 @@ int main(int argc, char* argv[])
 
   std::cout << argv[2]
             << " was generated successfully"
-            << ", dont forget to add it to test_construction.cmd"
+            << ", don't forget to add it to test_construction.cmd"
             << std::endl;
   return 0;
 }
diff --git a/BGL/doc/BGL/BGL.txt b/BGL/doc/BGL/BGL.txt
index c4db7311c6d..1f1a3dd1c97 100644
--- a/BGL/doc/BGL/BGL.txt
+++ b/BGL/doc/BGL/BGL.txt
@@ -586,7 +586,7 @@ so that they <em>virtually</em> become border edges when exploring a seam mesh w
 The input mesh is referred to as <em>underlying</em> mesh of the seam mesh.
 We denote `tm` and `sm` the underlying mesh and the seam mesh respectively.
 
-Figure \cgalFigureRef{fig_Seam_mesh_1} shows an example of mesh on which two
+\cgalFigureRef{fig_Seam_mesh_1} shows an example of mesh on which two
 edges, defined by the halfedge pairs `h2-h3` and `h6-h7`, are marked as seams.
 The introduction of virtual borders modifies the elementary \bgl graph traversal
 operations: when we circulate around the target of `h7` in the underlying mesh,
@@ -600,7 +600,7 @@ A seam mesh with two seam edges `(h2, h3)` and `(h6, h7)`.
 \cgalFigureEnd
 
 A vertex of the underlying mesh may correspond to multiple vertices in the seam mesh.
-For example in Figure \cgalFigureRef{fig_Seam_mesh_1}, the target of `h7` corresponds to two
+For example in \cgalFigureRef{fig_Seam_mesh_1}, the target of `h7` corresponds to two
 vertices in the seam mesh, on either side of the virtual border created by the seam edges.
 For this reason, a vertex `v` of the seam mesh is internally represented as a halfedge `h`
 of the seam mesh. To obtain a canonical definition, the halfedge `h` is defined as the halfedge
@@ -612,7 +612,7 @@ For vertices `v` in the underlying mesh that are not on a seam edge, we choose
 \subsubsection BGLSeamMeshTraversal Seam Mesh Traversal
 
 Using the function `next(halfedge_descriptor, FaceGraph)`, we can walk around a face but also around
-a border of a mesh. For the seam mesh `sm` from Figure \cgalFigureRef{fig_Seam_mesh_1},
+a border of a mesh. For the seam mesh `sm` from \cgalFigureRef{fig_Seam_mesh_1},
 we have `opposite(h2, sm) == h3*`, and it holds that `face(h3*, sm) == null_face()`.
 We can walk along this virtual border: starting at `h3*` and repeatedly calling `next(..,sm)`,
 we will traverse `h6*`, `h7*`, `h2*`, before reaching `h3*` again.
diff --git a/BGL/doc/BGL/Doxyfile.in b/BGL/doc/BGL/Doxyfile.in
index f37650c983f..549cdf37c1b 100644
--- a/BGL/doc/BGL/Doxyfile.in
+++ b/BGL/doc/BGL/Doxyfile.in
@@ -19,7 +19,8 @@ INPUT += ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/IO/polygon_mesh_io.h \
          ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/METIS/partition_graph.h \
          ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/METIS/partition_dual_graph.h \
          ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/alpha_expansion_graphcut.h \
-         ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/graph_traits_inheritance_macros.h
+         ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/graph_traits_inheritance_macros.h \
+         ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/dijkstra_shortest_path.h
 
 
 EXAMPLE_PATH               +=  ${CGAL_Surface_mesh_skeletonization_EXAMPLE_DIR} \
diff --git a/BGL/doc/BGL/PackageDescription.txt b/BGL/doc/BGL/PackageDescription.txt
index 39d72cd330d..93687510006 100644
--- a/BGL/doc/BGL/PackageDescription.txt
+++ b/BGL/doc/BGL/PackageDescription.txt
@@ -467,6 +467,9 @@ the requirement for traversal of all faces in a graph.
 /// \defgroup PkgBGLPartition Partitioning Operations
 /// \ingroup PkgBGLRef
 
+/// \defgroup PkgBGLTraversal Graph Traversal
+/// \ingroup PkgBGLRef
+
 /// \defgroup PkgBGLIOFct I/O Functions
 /// \ingroup PkgBGLRef
 
@@ -586,6 +589,12 @@ Methods to split a mesh into subdomains, using the library
 implementation.
 */
 
+/*!
+\addtogroup PkgBGLTraversal
+
+Methods to traverse a graph, for example to find the shortest path between two vertices.
+*/
+
 /*!
 \addtogroup PkgBGLIOFct
 
@@ -762,6 +771,9 @@ user might encounter.
 \cgalCRPSection{Conversion Functions}
 - `CGAL::split_graph_into_polylines()`
 
+\cgalCRPSection{Graph Traversal}
+- `CGAL::dijkstra_shortest_path()`
+
 \cgalCRPSection{Graph Adaptors}
 - `CGAL::Dual`
 - `CGAL::Face_filtered_graph`
diff --git a/BGL/doc/BGL/examples.txt b/BGL/doc/BGL/examples.txt
index 622a2395b73..19b883ae360 100644
--- a/BGL/doc/BGL/examples.txt
+++ b/BGL/doc/BGL/examples.txt
@@ -22,6 +22,7 @@
 \example BGL_surface_mesh/prim.cpp
 \example BGL_surface_mesh/gwdwg.cpp
 \example BGL_surface_mesh/seam_mesh.cpp
+\example BGL_surface_mesh/shortest_path.cpp
 \example BGL_surface_mesh/write_inp.cpp
 \example BGL_surface_mesh/surface_mesh_dual.cpp
 \example BGL_surface_mesh/connected_components.cpp
diff --git a/BGL/examples/BGL_OpenMesh/CMakeLists.txt b/BGL/examples/BGL_OpenMesh/CMakeLists.txt
index c56f97d03d7..eb05799c966 100644
--- a/BGL/examples/BGL_OpenMesh/CMakeLists.txt
+++ b/BGL/examples/BGL_OpenMesh/CMakeLists.txt
@@ -7,7 +7,7 @@ project(BGL_OpenMesh_Examples)
 # CGAL and its components
 find_package(CGAL REQUIRED)
 
-find_package(OpenMesh)
+find_package(OpenMesh QUIET)
 if(OpenMesh_FOUND)
   include(CGAL_OpenMesh_support)
   create_single_source_cgal_program("TriMesh.cpp")
diff --git a/BGL/examples/BGL_surface_mesh/CMakeLists.txt b/BGL/examples/BGL_surface_mesh/CMakeLists.txt
index 87982059ae9..7346e63d71e 100644
--- a/BGL/examples/BGL_surface_mesh/CMakeLists.txt
+++ b/BGL/examples/BGL_surface_mesh/CMakeLists.txt
@@ -9,6 +9,7 @@ create_single_source_cgal_program("seam_mesh.cpp")
 create_single_source_cgal_program("write_inp.cpp")
 create_single_source_cgal_program("surface_mesh_dual.cpp")
 create_single_source_cgal_program("connected_components.cpp")
+create_single_source_cgal_program("shortest_path.cpp")
 
 find_package(METIS QUIET)
 include(CGAL_METIS_support)
diff --git a/BGL/examples/BGL_surface_mesh/shortest_path.cpp b/BGL/examples/BGL_surface_mesh/shortest_path.cpp
new file mode 100644
index 00000000000..3b6bc4c1613
--- /dev/null
+++ b/BGL/examples/BGL_surface_mesh/shortest_path.cpp
@@ -0,0 +1,83 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/boost/graph/graph_traits_Surface_mesh.h>
+
+#include <CGAL/boost/graph/dijkstra_shortest_path.h>
+#include <CGAL/IO/polygon_mesh_io.h>
+
+
+#include <string>
+#include <vector>
+#include <fstream>
+#include <exception>
+#include <algorithm>
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Point = K::Point_3;
+using Mesh = CGAL::Surface_mesh<Point>;
+
+using vertex_descriptor = boost::graph_traits<Mesh>::vertex_descriptor;
+using edge_descriptor = boost::graph_traits<Mesh>::edge_descriptor;
+using halfedge_descriptor = boost::graph_traits<Mesh>::halfedge_descriptor;
+
+namespace params = CGAL::parameters;
+
+
+// Example main
+int main(int argc, char** argv)
+{
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/elephant.off");
+
+  // Try building a surface_mesh
+  Mesh sm;
+  bool ok = CGAL::IO::read_polygon_mesh(filename, sm);
+  if (!ok || !sm.is_valid() || sm.is_empty())
+  {
+    std::cerr << "Error: Invalid facegraph" << std::endl;
+    std::cerr << "Filename = " << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  const std::size_t i0 = 0;
+  const std::size_t i1 = num_vertices(sm) / 2;
+
+
+  // Get the vertex descriptors of the source and target vertices
+  const vertex_descriptor vs = *vertices(sm).first;
+  vertex_descriptor vt;
+  std::size_t vid = 0;
+  for (const vertex_descriptor v : vertices(sm))
+  {
+    if (vid++ == i1)
+    {
+      vt = v;
+      break;
+    }
+  }
+
+  std::list<halfedge_descriptor> halfedge_sequence;
+  CGAL::dijkstra_shortest_path(vs, vt, sm,
+    std::back_inserter(halfedge_sequence));
+
+  assert(source(halfedge_sequence.front(), sm)==vs);
+  assert(target(halfedge_sequence.back(), sm)==vt);
+
+  // dump
+  std::cout << "Shortest path between vertices " << i0 << " and " << i1
+            << " is made of " << halfedge_sequence.size() << " halfedges." << std::endl;
+
+  // Get the property map of the points of the mesh
+  auto vpmap = get(CGAL::vertex_point, sm);
+
+  std::ofstream out("shortest_path.polylines.txt");
+  out << halfedge_sequence.size()+1 << " " << get(vpmap, source(halfedge_sequence.front(),sm));
+  for (const halfedge_descriptor he : halfedge_sequence)
+  {
+    const vertex_descriptor v = target(he, sm);
+    out << " " << get(vpmap, v);
+  }
+  out << std::endl;
+  out.close();
+
+  return EXIT_SUCCESS;
+}
diff --git a/BGL/include/CGAL/boost/graph/dijkstra_shortest_path.h b/BGL/include/CGAL/boost/graph/dijkstra_shortest_path.h
new file mode 100644
index 00000000000..8bc03f9fb48
--- /dev/null
+++ b/BGL/include/CGAL/boost/graph/dijkstra_shortest_path.h
@@ -0,0 +1,160 @@
+// Copyright (c) 2025  GeometryFactory (France). All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Jane Tournois, Andreas Fabri
+//
+
+#ifndef CGAL_BOOST_GRAPH_DIJKSTRA_SHORTEST_PATH_H
+#define CGAL_BOOST_GRAPH_DIJKSTRA_SHORTEST_PATH_H
+
+#include <boost/graph/dijkstra_shortest_paths.hpp>
+
+#include <CGAL/Named_function_parameters.h>
+#include <CGAL/boost/graph/named_params_helper.h>
+
+#include <boost/property_map/property_map.hpp>
+#include <CGAL/boost/graph/properties.h>
+
+#include <list>
+#include <unordered_map>
+
+namespace CGAL {
+namespace internal {
+
+  /// An exception used while catching a throw that stops Dijkstra's algorithm
+  /// once the shortest path to a target has been found.
+  class Dijkstra_end_exception : public std::exception
+  {
+    const char* what() const throw ()
+    {
+      return "Dijkstra shortest path: reached the target vertex.";
+    }
+  };
+
+  /// Visitor to stop Dijkstra's algorithm once the given target turns 'BLACK',
+  /// that is when the target has been examined through all its incident edges and
+  /// the shortest path is thus known.
+  template<typename Graph, typename VertexEdgeMap>
+  class Stop_at_target_Dijkstra_visitor : public boost::default_dijkstra_visitor
+  {
+    using vertex_descriptor = typename boost::graph_traits<Graph>::vertex_descriptor;
+    using edge_descriptor = typename boost::graph_traits<Graph>::edge_descriptor;
+
+  public:
+    vertex_descriptor destination_vd;
+    VertexEdgeMap& relaxed_edges;
+
+    Stop_at_target_Dijkstra_visitor(vertex_descriptor destination_vd,
+                                    VertexEdgeMap& relaxed_edges)
+      : destination_vd(destination_vd), relaxed_edges(relaxed_edges)
+    {}
+
+
+    void edge_relaxed(const edge_descriptor& e, const Graph& g) const
+    {
+      relaxed_edges[target(e, g)] = e;
+    }
+
+    void finish_vertex(const vertex_descriptor& vd, const Graph& /* g*/) const
+    {
+      if (vd == destination_vd)
+        throw Dijkstra_end_exception();
+    }
+  };
+} // namespace internal
+
+/*!
+* \ingroup PkgBGLTraversal
+* computes the shortest path between two vertices in a graph `g`, where the vertices must belong to the same connected component of `g`.
+*
+* @tparam Graph a model of the concept `HalfedgeListGraph`
+* @tparam OutputIterator an output iterator with value type `boost::graph_traits<Graph>::%halfedge_descriptor`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param vs source vertex
+* @param vt target vertex
+* @param g the graph
+* @param halfedge_sequence_oit the output iterator holding the output sequence
+* of halfedges that form the shortest path from `vs` to `vt` on `g`
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+*  \cgalNamedParamsBegin
+*   \cgalParamNBegin{edge_weight_map}
+*    \cgalParamDescription{a property map associating to each edge in the graph its weight or "length".
+*                          The weights must all be non-negative.}
+*    \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%edge_descriptor`
+*                   as key type and a value type which as specified in the named parameter `distance_map`of the function
+                    <A href="https://www.boost.org/doc/libs/release/libs/graph/doc/dijkstra_shortest_paths.html">`boost::graph::dijkstra_shortest_paths()`</A>,
+                    with any model of `RingNumberType` fulfilling the requirements. }
+*    \cgalParamDefault{`get(boost::edge_weight, mesh)`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_index_map}
+*     \cgalParamDescription{a property map associating to each vertex of `g` a unique index between `0` and `num_vertices(g) - 1`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `std::size_t` as value type}
+*     \cgalParamDefault{an automatically indexed internal map}
+*   \cgalParamNEnd
+*  \cgalNamedParamsEnd
+*/
+template<typename Graph,
+         typename OutputIterator,
+         typename NamedParameters = parameters::Default_named_parameters>
+OutputIterator dijkstra_shortest_path(
+  const typename boost::graph_traits<Graph>::vertex_descriptor vs,//source
+  const typename boost::graph_traits<Graph>::vertex_descriptor vt,//target
+  const Graph& g,
+  OutputIterator halfedge_sequence_oit,
+  const NamedParameters& np = parameters::default_values())
+{
+  using vertex_descriptor = typename boost::graph_traits<Graph>::vertex_descriptor;
+  using halfedge_descriptor = typename boost::graph_traits<Graph>::halfedge_descriptor;
+  using edge_descriptor = typename boost::graph_traits<Graph>::edge_descriptor;
+
+  using Pred_umap = std::unordered_map<vertex_descriptor, vertex_descriptor>;
+  using Pred_pmap = boost::associative_property_map<Pred_umap>;
+
+  using parameters::get_parameter;
+  using parameters::choose_parameter;
+
+  const auto w_map = choose_parameter(get_parameter(np, internal_np::edge_weight),
+                                      get(boost::edge_weight, g));
+  const auto vim = get_initialized_vertex_index_map(g, np);
+
+  Pred_umap predecessor;
+  Pred_pmap pred_pmap(predecessor);
+
+  using VEMap = std::unordered_map<vertex_descriptor, edge_descriptor>;
+  VEMap relaxed_edges_map;
+  internal::Stop_at_target_Dijkstra_visitor<Graph, VEMap> vis(vt, relaxed_edges_map);
+  try
+  {
+    boost::dijkstra_shortest_paths(g, vs,
+      boost::predecessor_map(pred_pmap)
+      .visitor(vis)
+      .weight_map(w_map)
+      .vertex_index_map(vim));
+  }
+  catch (const internal::Dijkstra_end_exception& ){}
+
+  std::list<halfedge_descriptor> path;
+  vertex_descriptor t = vt;
+  do {
+    path.push_front(halfedge(relaxed_edges_map[t],g));
+    t = get(pred_pmap, t);
+  }while (t != vs);
+  for(auto he : path){
+    *halfedge_sequence_oit++ = he;
+  }
+  return halfedge_sequence_oit;
+}
+
+} // namespace CGAL
+
+
+#endif //CGAL_BOOST_GRAPH_DIJKSTRA_SHORTEST_PATH_H
diff --git a/BGL/include/CGAL/boost/graph/named_params_helper.h b/BGL/include/CGAL/boost/graph/named_params_helper.h
index c93ac3cf5e5..c2be9fcab81 100644
--- a/BGL/include/CGAL/boost/graph/named_params_helper.h
+++ b/BGL/include/CGAL/boost/graph/named_params_helper.h
@@ -227,6 +227,32 @@ struct GetGeomTraits
                                           NamedParametersVPM>::type type;
 };
 
+namespace internal {
+// Similar helper for polygon soups
+template <typename PointRange, typename PolygonRange>
+struct Polygon_types
+{
+  typedef typename boost::range_value<PointRange>::type                             Point_3;
+  typedef typename boost::range_value<PolygonRange>::type                           Polygon_3;
+
+  typedef typename boost::range_iterator<Polygon_3>::type                           V_ID_iterator;
+  typedef typename std::iterator_traits<V_ID_iterator>::value_type                  V_ID;
+  typedef typename std::vector<Polygon_3>::size_type                                P_ID;
+};
+}
+
+template <typename PointRange, typename PolygonRange, typename NamedParameters>
+struct GetPolygonGeomTraits
+{
+  typedef typename internal_np::Lookup_named_param_def <
+                     internal_np::geom_traits_t,
+                     NamedParameters,
+                     typename CGAL::Kernel_traits<
+                       typename internal::Polygon_types<
+                         PointRange, PolygonRange>::Point_3 >::type
+                   > ::type                                                         type;
+};
+
 // Define the following structs:
 //
 // GetInitializedVertexIndexMap
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h
index 01f7d07f051..8c3c75f2377 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h
@@ -540,7 +540,7 @@ template <class Traits_, class TopTraits_, class ValidationPolicy>
 }
 
 //insert non-sipmle poloygons with holes (non incident edges may have
-// common vertex,  but they dont intersect at their interior
+// common vertex,  but they don't intersect at their interior
 template <class Traits_, class TopTraits_, class ValidationPolicy>
   void Gps_on_surface_base_2<Traits_, TopTraits_, ValidationPolicy>::
   _insert(const Polygon_with_holes_2 & pgn, Arrangement_on_surface_2 & arr)
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h
index d5bcafcbdfc..a709bddd4b1 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h
@@ -407,7 +407,7 @@ is_crossover_outer_boundary(const typename Traits_2::Polygon_with_holes_2& pgn,
     Vertex_const_handle cver;
     Point_2 second_point;
     if (cmp_endpoints(*next) == SMALLER) {
-      // next curve's minimum is the joint vertex. Look if it's max exists in
+      // next curve's minimum is the joint vertex. Look if its max exists in
       // the arrangement and insert lexicographically
       second_point = max_functor(*next);
       obj = pl.locate(second_point);
@@ -639,8 +639,7 @@ bool are_holes_and_boundary_pairwise_disjoint
   typedef typename Polygon_set_2::Arrangement_on_surface_2
                                                         Arrangement_2;
 
-  /* Should be perfored more efficeintly  than using sweep and than
-   * difference().
+  /* Should be perfored more efficiently than using sweep and then difference().
    *
    * Use sweep to find intersections on the interior of curves (not on vertices)
    * and overlapping edges which are not allowed (note that 0/1 dimension
@@ -758,7 +757,7 @@ bool are_holes_and_boundary_pairwise_disjoint
 /* A valid polygon with holes is :
  * 1 - Has empty or closed boundary and all the holes are closed
  * 2 - The PWH is relatively simple polygon (holes are simple...)
- * 3 - Has it's boundary oriented counterclockwise and the holes oriented
+ * 3 - Has its boundary oriented counterclockwise and the holes oriented
  *     clockwise
  * 4 - All the segments (boundary and holes) do not cross or intersect in their
  *     relative interior
diff --git a/Boolean_set_operations_2/test/Boolean_set_operations_2/bop_test_suite_generator.cpp b/Boolean_set_operations_2/test/Boolean_set_operations_2/bop_test_suite_generator.cpp
index 7b96e38151c..43c203ed190 100644
--- a/Boolean_set_operations_2/test/Boolean_set_operations_2/bop_test_suite_generator.cpp
+++ b/Boolean_set_operations_2/test/Boolean_set_operations_2/bop_test_suite_generator.cpp
@@ -227,7 +227,7 @@ int main(int argc, char *argv[])
     write_complement_to_file(out, p1);
     write_complement_to_file(out, p2);
     std::cout<<argv[3] <<
-      " was generated successfully, dont forget to add it to test_bop.cmd"
+      " was generated successfully, don't forget to add it to test_bop.cmd"
              << std::endl;
 
     return (0);
@@ -239,7 +239,7 @@ int main(int argc, char *argv[])
     write_complement_to_file(out, p1);
     write_complement_to_file(out, pwh2);
     std::cout<<argv[3] <<
-      " was generated successfully, dont forget to add it to test_bop.cmd"
+      " was generated successfully, don't forget to add it to test_bop.cmd"
              << std::endl;
 
     return (0);
@@ -251,7 +251,7 @@ int main(int argc, char *argv[])
     write_complement_to_file(out, pwh1);
     write_complement_to_file(out, p2);
     std::cout<<argv[3] <<
-      " was generated successfully, dont forget to add it to test_bop.cmd"
+      " was generated successfully, don't forget to add it to test_bop.cmd"
              << std::endl;
 
     return (0);
@@ -263,7 +263,7 @@ int main(int argc, char *argv[])
     write_complement_to_file(out, pwh1);
     write_complement_to_file(out, pwh2);
     std::cout<<argv[3] <<
-      " was generated successfully, dont forget to add it to test_bop.cmd"
+      " was generated successfully, don't forget to add it to test_bop.cmd"
              << std::endl;
 
     return (0);
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
index 3590abf82a7..e570031d2ee 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
@@ -30,7 +30,7 @@ specialization of the algorithm for the case when the center
 coordinates and radii of the input spheres are floating-point numbers.
 This specialized algorithm uses floating-point arithmetic only, is
 very fast and especially tuned for stability and robustness. Still,
-it's output may be incorrect in some (rare) cases; termination is
+its output may be incorrect in some (rare) cases; termination is
 guaranteed.
 
 When default constructed, an instance of type
diff --git a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
index e6c85c192a6..adae85bd88e 100644
--- a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
+++ b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
@@ -47,7 +47,7 @@ namespace CGAL {
     //
     //    E* = { y | (y - c)^T M'/alpha (y - c) + mu <= 0 }.
     //
-    // Expanding the later and comparing with the original form we
+    // Expanding the latter and comparing with the original form we
     // obtain
     //
     //    c = - M'^{-1} m
diff --git a/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt b/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
index b3101a05aac..57e2e4d81cb 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
@@ -268,7 +268,7 @@ as follows:
 A note on performance: The algorithm sorts and partitions the input
 sequences. It is clearly costly to copy a large box compared to a
 simple pointer. However, the algorithm benefits from memory locality
-in the later stages when it copies the boxes, while the pointers would
+in the latter stages when it copies the boxes, while the pointers would
 refer to boxes that become wildly scattered in memory. These two
 effects, copying costs and memory locality, counteract each other. For
 small box sizes, i.e., small dimension, memory locality wins and one
diff --git a/CGAL_Core/include/CGAL/CORE/poly/Poly.tcc b/CGAL_Core/include/CGAL/CORE/poly/Poly.tcc
index 8e95f92189c..75884c7d5f9 100644
--- a/CGAL_Core/include/CGAL/CORE/poly/Poly.tcc
+++ b/CGAL_Core/include/CGAL/CORE/poly/Poly.tcc
@@ -382,7 +382,7 @@ int Polynomial<NT>::getTrueDegree() const {
   return -1;        // Zero polynomial
 }
 
-//get i'th Coeff. We check whether i is not greater than the
+//get i-th Coeff. We check whether i is not greater than the
 // true degree and if not then return coeff[i] o/w 0
 template <class NT>
 NT Polynomial<NT>::getCoeffi(int i) const {
diff --git a/CGAL_Core/include/CGAL/CORE/poly/Sturm.h b/CGAL_Core/include/CGAL/CORE/poly/Sturm.h
index 2fe00e3706d..2ab25c00835 100644
--- a/CGAL_Core/include/CGAL/CORE/poly/Sturm.h
+++ b/CGAL_Core/include/CGAL/CORE/poly/Sturm.h
@@ -69,7 +69,7 @@ public:
                 //     the array seq is not used!
                 //     Hence, one must test these special cases
   Polynomial<NT> * seq;      // array of polynomials of length "len+1"
-  Polynomial<NT> g;//GCD of input polynomial P and it's derivative P'
+  Polynomial<NT> g;//GCD of input polynomial P and its derivative P'
   NT cont;//Content of the square-free part of input polynomial P
   //Thus P = g * cont * seq[0]
   static const int N_STOP_ITER = 10000;    // Stop IterE after this many iterations.
diff --git a/CGAL_ImageIO/include/CGAL/IO/read_vtk_image_data.h b/CGAL_ImageIO/include/CGAL/IO/read_vtk_image_data.h
index 0492e2acc6a..e02f4f91eb5 100644
--- a/CGAL_ImageIO/include/CGAL/IO/read_vtk_image_data.h
+++ b/CGAL_ImageIO/include/CGAL/IO/read_vtk_image_data.h
@@ -88,11 +88,10 @@ read_vtk_image_data(vtkImageData* vtk_image, Image_3::Own owning = Image_3::OWN_
   // If there is more than a scalar per point, vtk_image->data is not immediately
   // interpretable in Image_3->data
   CGAL_assertion(owning == Image_3::OWN_THE_DATA || cn == 1);
-
-  CGAL_assertion(vtk_image->GetPointData()->GetScalars()->GetNumberOfTuples() == dims[0]*dims[1]*dims[2]);
+  CGAL_assertion(vtk_image->GetPointData()->GetScalars()->GetNumberOfTuples() == static_cast<vtkIdType>(image->xdim*image->ydim*image->zdim));
 
   if(owning == Image_3::OWN_THE_DATA) {
-    int dims_n = dims[0]*dims[1]*dims[2];
+    std::size_t dims_n = image->xdim*image->ydim*image->zdim;
     image->data = ::ImageIO_alloc(dims_n * image->wdim);
 
     // std::cerr << "GetNumberOfTuples() = " << vtk_image->GetPointData()->GetScalars()->GetNumberOfTuples() << "\n"
@@ -110,7 +109,7 @@ read_vtk_image_data(vtkImageData* vtk_image, Image_3::Own owning = Image_3::OWN_
       char* src = static_cast<char*>(vtk_image->GetPointData()->GetScalars()->GetVoidPointer(0));
       char* dest = static_cast<char*>(image->data);
 
-      for(int i=0; i<dims_n; ++i)
+      for(std::size_t i=0; i<dims_n; ++i)
       {
         // multiply by image->wdim because we casted to char* and not the actual data type
         memcpy(dest + image->wdim*i, src + cn*image->wdim*i, image->wdim);
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Circle_2.h b/Cartesian_kernel/include/CGAL/Cartesian/Circle_2.h
index a1a50a6fb9f..318aa6af4c4 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Circle_2.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Circle_2.h
@@ -25,6 +25,7 @@ namespace CGAL {
 template <class R_ >
 class CircleC2
 {
+  typedef typename R_::Boolean              Boolean;
   typedef typename R_::FT                   FT;
   typedef typename R_::RT                   RT;
   typedef typename R_::Circle_2             Circle_2;
@@ -49,8 +50,8 @@ public:
     base = Rep(center, squared_radius, orient);
   }
 
-  bool           operator==(const CircleC2 &s) const;
-  bool           operator!=(const CircleC2 &s) const;
+  Boolean operator==(const CircleC2& s) const;
+  Boolean operator!=(const CircleC2& s) const;
 
   const Point_2 & center() const
   {
@@ -69,6 +70,25 @@ public:
 
 };
 
+template < class R >
+typename R::Boolean
+CircleC2<R>::operator==(const CircleC2<R> &t) const
+{
+  if (CGAL::identical(base, t.base))
+    return true;
+
+  return center() == t.center() &&
+         squared_radius() == t.squared_radius() &&
+         orientation() == t.orientation();
+}
+
+template < class R >
+typename R::Boolean
+CircleC2<R>::operator!=(const CircleC2<R> &t) const
+{
+  return !(*this == t);
+}
+
 } //namespace CGAL
 
 #endif // CGAL_CARTESIAN_CIRCLE_2_H
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Circle_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Circle_3.h
index de200ba3e4b..8f2a2fadc8c 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Circle_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Circle_3.h
@@ -23,6 +23,8 @@ namespace CGAL {
 
 template <class R_ >
 class CircleC3 {
+  typedef typename R_::Boolean                  Boolean;
+  typedef typename R_::Bounded_side             Bounded_side;
   typedef typename R_::Sphere_3                 Sphere_3;
   typedef typename R_::Plane_3                  Plane_3;
   typedef typename R_::Point_3                  Point_3;
@@ -130,12 +132,12 @@ public:
     return diametral_sphere();
   }
 
-  Point_3 center() const
+  decltype(auto) center() const
   {
     return diametral_sphere().center();
   }
 
-  FT squared_radius() const
+  decltype(auto) squared_radius() const
   {
     return diametral_sphere().squared_radius();
   }
@@ -155,7 +157,7 @@ public:
     return CGAL_PI * CGAL_PI * 4.0 * to_double(squared_radius());
   }
 
-  FT area_divided_by_pi() const
+  decltype(auto) area_divided_by_pi() const
   {
     return squared_radius();
   }
@@ -200,15 +202,15 @@ public:
                         (x+mx).sup(),(y+my).sup(),(z+mz).sup());
   }
 
-  bool operator==(const CircleC3 &) const;
-  bool operator!=(const CircleC3 &) const;
+  Boolean operator==(const CircleC3 &) const;
+  Boolean operator!=(const CircleC3 &) const;
 
-  bool has_on(const Point_3 &p) const;
-  bool has_on_bounded_side(const Point_3 &p) const;
-  bool has_on_unbounded_side(const Point_3 &p) const;
+  Boolean has_on(const Point_3 &p) const;
+  Boolean has_on_bounded_side(const Point_3 &p) const;
+  Boolean has_on_unbounded_side(const Point_3 &p) const;
   Bounded_side bounded_side(const Point_3 &p) const;
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return diametral_sphere().is_degenerate();
   }
@@ -217,7 +219,7 @@ public:
 
 template < class R >
 inline
-bool
+typename R::Boolean
 CircleC3<R>::
 has_on(const typename CircleC3<R>::Point_3 &p) const
 {
@@ -227,7 +229,7 @@ has_on(const typename CircleC3<R>::Point_3 &p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 CircleC3<R>::
 has_on_bounded_side(const typename CircleC3<R>::Point_3 &p) const
 {
@@ -237,7 +239,7 @@ has_on_bounded_side(const typename CircleC3<R>::Point_3 &p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 CircleC3<R>::
 has_on_unbounded_side(const typename CircleC3<R>::Point_3 &p) const
 {
@@ -246,8 +248,7 @@ has_on_unbounded_side(const typename CircleC3<R>::Point_3 &p) const
 }
 
 template < class R >
-CGAL_KERNEL_INLINE
-Bounded_side
+typename R::Bounded_side
 CircleC3<R>::
 bounded_side(const typename CircleC3<R>::Point_3 &p) const
 {
@@ -256,8 +257,7 @@ bounded_side(const typename CircleC3<R>::Point_3 &p) const
 }
 
 template < class R >
-CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleC3<R>::operator==(const CircleC3<R> &t) const
 {
   if (CGAL::identical(base, t.base))
@@ -283,8 +283,7 @@ CircleC3<R>::operator==(const CircleC3<R> &t) const
 }
 
 template < class R >
-CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleC3<R>::operator!=(const CircleC3<R> &t) const
 {
   return !(*this == t);
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Direction_2.h b/Cartesian_kernel/include/CGAL/Cartesian/Direction_2.h
index 302299d0898..b618d8fa459 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Direction_2.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Direction_2.h
@@ -26,6 +26,8 @@ template < class R_ >
 class DirectionC2
 {
   typedef DirectionC2<R_>                   Self;
+
+  typedef typename R_::Boolean              Boolean;
   typedef typename R_::FT                   FT;
   typedef FT                                RT;
   typedef typename R_::Point_2              Point_2;
@@ -49,8 +51,8 @@ public:
   DirectionC2(const FT &x, const FT &y)
     : base{x, y} {}
 
-  bool operator==(const DirectionC2 &d) const;
-  bool operator!=(const DirectionC2 &d) const;
+  Boolean operator==(const DirectionC2 &d) const;
+  Boolean operator!=(const DirectionC2 &d) const;
 
   Vector_2 to_vector() const;
 
@@ -66,7 +68,7 @@ public:
 
 template < class R >
 inline
-bool
+typename R::Boolean
 DirectionC2<R>::operator==(const DirectionC2<R> &d) const
 {
   if (CGAL::identical(base, d.base))
@@ -76,7 +78,7 @@ DirectionC2<R>::operator==(const DirectionC2<R> &d) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 DirectionC2<R>::operator!=(const DirectionC2<R> &d) const
 {
   return !( *this == d );
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Iso_cuboid_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Iso_cuboid_3.h
index 82f319261a0..28b65b121dd 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Iso_cuboid_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Iso_cuboid_3.h
@@ -26,6 +26,8 @@ namespace CGAL {
 template < class R_ >
 class Iso_cuboidC3
 {
+  typedef typename R_::Boolean              Boolean;
+  typedef typename R_::Bounded_side         Bounded_side;
   typedef typename R_::FT                   FT;
   typedef typename R_::Iso_cuboid_3         Iso_cuboid_3;
   typedef typename R_::Point_3              Point_3;
@@ -98,8 +100,8 @@ public:
                                     Construct_point_3()(max_hx/hw, max_hy/hw, max_hz/hw)));
   }
 
-  typename R::Boolean   operator==(const Iso_cuboidC3& s) const;
-  typename R::Boolean   operator!=(const Iso_cuboidC3& s) const;
+  Boolean operator==(const Iso_cuboidC3& s) const;
+  Boolean operator!=(const Iso_cuboidC3& s) const;
 
   const Point_3 & min BOOST_PREVENT_MACRO_SUBSTITUTION () const
   {
@@ -118,11 +120,11 @@ public:
   }
 
   Bounded_side bounded_side(const Point_3& p) const;
-  typename R::Boolean           has_on(const Point_3& p) const;
-  typename R::Boolean           has_on_boundary(const Point_3& p) const;
-  typename R::Boolean           has_on_bounded_side(const Point_3& p) const;
-  typename R::Boolean           has_on_unbounded_side(const Point_3& p) const;
-  typename R::Boolean           is_degenerate() const;
+  Boolean has_on(const Point_3& p) const;
+  Boolean has_on_boundary(const Point_3& p) const;
+  Boolean has_on_bounded_side(const Point_3& p) const;
+  Boolean has_on_unbounded_side(const Point_3& p) const;
+  Boolean is_degenerate() const;
   const FT &   xmin() const;
   const FT &   ymin() const;
   const FT &   zmin() const;
@@ -267,7 +269,7 @@ Iso_cuboidC3<R>::volume() const
 
 template < class R >
 CGAL_KERNEL_MEDIUM_INLINE
-Bounded_side
+typename R::Bounded_side
 Iso_cuboidC3<R>::
 bounded_side(const typename Iso_cuboidC3<R>::Point_3& p) const
 {
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Line_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Line_3.h
index 4a04a70bcbb..a3798844fe0 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Line_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Line_3.h
@@ -24,6 +24,7 @@ namespace CGAL {
 template < class R_ >
 class LineC3
 {
+  typedef typename R_::Boolean              Boolean;
   typedef typename R_::FT                   FT;
   typedef typename R_::Point_3              Point_3;
   typedef typename R_::Vector_3             Vector_3;
@@ -65,8 +66,8 @@ public:
   LineC3(const Point_3 &p, const Direction_3 &d)
   { *this = R().construct_line_3_object()(p, d); }
 
-  bool        operator==(const LineC3 &l) const;
-  bool        operator!=(const LineC3 &l) const;
+  typename R::Boolean operator==(const LineC3 &l) const;
+  typename R::Boolean operator!=(const LineC3 &l) const;
 
   Plane_3     perpendicular_plane(const Point_3 &p) const;
   Line_3      opposite() const;
@@ -88,13 +89,13 @@ public:
 
   Point_3     point(const FT i) const;
 
-  bool        has_on(const Point_3 &p) const;
-  bool        is_degenerate() const;
+  Boolean has_on(const Point_3 &p) const;
+  Boolean is_degenerate() const;
 };
 
 template < class R >
 inline
-bool
+typename R::Boolean
 LineC3<R>::operator==(const LineC3<R> &l) const
 {
   if (CGAL::identical(base, l.base))
@@ -104,7 +105,7 @@ LineC3<R>::operator==(const LineC3<R> &l) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 LineC3<R>::operator!=(const LineC3<R> &l) const
 {
   return !(*this == l);
@@ -135,7 +136,7 @@ LineC3<R>::opposite() const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 LineC3<R>::
 has_on(const typename LineC3<R>::Point_3 &p) const
 {
@@ -144,7 +145,7 @@ has_on(const typename LineC3<R>::Point_3 &p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 LineC3<R>::is_degenerate() const
 {
   return to_vector() == NULL_VECTOR;
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Plane_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Plane_3.h
index 38a119e1320..27509532ac7 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Plane_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Plane_3.h
@@ -169,7 +169,9 @@ inline
 typename PlaneC3<R>::Point_3
 PlaneC3<R>::point() const
 {
-  return point_on_plane(*this);
+  FT x, y, z;
+  point_on_planeC3(a(), b(), c(), d(), x, y, z);
+  return R().construct_point_3_object()(x, y, z);
 }
 
 template < class R >
@@ -178,7 +180,13 @@ typename PlaneC3<R>::Point_3
 PlaneC3<R>::
 projection(const typename PlaneC3<R>::Point_3 &p) const
 {
-  return projection_plane(p, *this);
+  FT x, y, z;
+  projection_planeC3(a(), b(), c(), d(),
+                     R().compute_x_3_object()(p),
+                     R().compute_y_3_object()(p),
+                     R().compute_z_3_object()(p),
+                     x, y, z);
+  return R().construct_point_3_object()(x, y, z);
 }
 
 template < class R >
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Point_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Point_3.h
index e4dcd3357d8..5a107cf969d 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Point_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Point_3.h
@@ -107,6 +107,15 @@ public:
     return base.cartesian_end();
   }
 
+  typename R_::Boolean operator==(const PointC3 &p) const
+  {
+      return base == p.base;
+  }
+  typename R_::Boolean operator!=(const PointC3 &p) const
+  {
+      return !(*this == p);
+  }
+
   int dimension() const
   {
       return base.dimension();
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Segment_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Segment_3.h
index 8ab1d082d6f..9ce93eba11c 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Segment_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Segment_3.h
@@ -25,6 +25,7 @@ namespace CGAL {
 template < class R_ >
 class SegmentC3
 {
+  typedef typename R_::Boolean              Boolean;
   typedef typename R_::Point_3              Point_3;
   typedef typename R_::Direction_3          Direction_3;
   typedef typename R_::Vector_3             Vector_3;
@@ -44,11 +45,11 @@ public:
   SegmentC3(const Point_3 &sp, const Point_3 &ep)
     : base{sp, ep} {}
 
-  bool        has_on(const Point_3 &p) const;
-  bool        collinear_has_on(const Point_3 &p) const;
+  Boolean has_on(const Point_3 &p) const;
+  Boolean collinear_has_on(const Point_3 &p) const;
 
-  bool        operator==(const SegmentC3 &s) const;
-  bool        operator!=(const SegmentC3 &s) const;
+  Boolean operator==(const SegmentC3 &s) const;
+  Boolean operator!=(const SegmentC3 &s) const;
 
   const Point_3 &   source() const
   {
@@ -73,12 +74,12 @@ public:
   Line_3      supporting_line() const;
   Segment_3   opposite() const;
 
-  bool        is_degenerate() const;
+  Boolean is_degenerate() const;
 };
 
 template < class R >
 inline
-bool
+typename R::Boolean
 SegmentC3<R>::operator==(const SegmentC3<R> &s) const
 {
   if (CGAL::identical(base, s.base))
@@ -88,7 +89,7 @@ SegmentC3<R>::operator==(const SegmentC3<R> &s) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 SegmentC3<R>::operator!=(const SegmentC3<R> &s) const
 {
   return !(*this == s);
@@ -184,7 +185,7 @@ SegmentC3<R>::opposite() const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 SegmentC3<R>::is_degenerate() const
 {
   return source() == target();
@@ -192,7 +193,7 @@ SegmentC3<R>::is_degenerate() const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 SegmentC3<R>::
 has_on(const typename SegmentC3<R>::Point_3 &p) const
 {
@@ -201,7 +202,7 @@ has_on(const typename SegmentC3<R>::Point_3 &p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 SegmentC3<R>::
 collinear_has_on(const typename SegmentC3<R>::Point_3 &p) const
 {
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Sphere_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Sphere_3.h
index 3dee104e4c6..d9b733a666d 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Sphere_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Sphere_3.h
@@ -27,6 +27,8 @@ namespace CGAL {
 template <class R_>
 class SphereC3
 {
+  typedef typename R_::Boolean              Boolean;
+  typedef typename R_::Bounded_side         Bounded_side;
   typedef typename R_::FT                   FT;
 // https://doc.cgal.org/latest/Manual/devman_code_format.html#secprogramming_conventions
   typedef typename R_::Point_3              Point_3_;
@@ -124,17 +126,17 @@ public:
   //! precond: ! x.is_degenerate() (when available)
   // Returns R::ON_POSITIVE_SIDE, R::ON_ORIENTED_BOUNDARY or
   // R::ON_NEGATIVE_SIDE
-  typename R::Boolean   has_on(const Circle_3 &p) const;
-  typename R::Boolean   has_on(const Point_3_ &p) const;
-  typename R::Boolean   has_on_boundary(const Point_3_ &p) const;
-  typename R::Boolean   has_on_positive_side(const Point_3_ &p) const;
-  typename R::Boolean   has_on_negative_side(const Point_3_ &p) const;
+  Boolean has_on(const Circle_3 &p) const;
+  Boolean has_on(const Point_3_ &p) const;
+  Boolean has_on_boundary(const Point_3_ &p) const;
+  Boolean has_on_positive_side(const Point_3_ &p) const;
+  Boolean has_on_negative_side(const Point_3_ &p) const;
 
-  typename R_::Bounded_side bounded_side(const Point_3_ &p) const;
+  Bounded_side bounded_side(const Point_3_ &p) const;
   //! precond: ! x.is_degenerate() (when available)
   // Returns R::ON_BOUNDED_SIDE, R::ON_BOUNDARY or R::ON_UNBOUNDED_SIDE
-  typename R::Boolean   has_on_bounded_side(const Point_3_ &p) const;
-  typename R::Boolean   has_on_unbounded_side(const Point_3_ &p) const;
+  Boolean has_on_bounded_side(const Point_3_ &p) const;
+  Boolean has_on_unbounded_side(const Point_3_ &p) const;
 };
 
 template < class R >
@@ -163,6 +165,7 @@ typename R::Oriented_side
 SphereC3<R>::
 oriented_side(const typename SphereC3<R>::Point_3_ &p) const
 {
+  typedef typename R::Oriented_side Oriented_side;
   return enum_cast<Oriented_side>(bounded_side(p)) * orientation();
 }
 
@@ -172,6 +175,7 @@ typename R::Bounded_side
 SphereC3<R>::
 bounded_side(const typename SphereC3<R>::Point_3_ &p) const
 {
+  typedef typename R::Bounded_side Bounded_side;
   return enum_cast<Bounded_side>(compare(squared_radius(),
                                          squared_distance(center(), p)));
 }
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Tetrahedron_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Tetrahedron_3.h
index c20733313af..ef543fcc308 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Tetrahedron_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Tetrahedron_3.h
@@ -143,7 +143,7 @@ oriented_side(const typename TetrahedronC3<R>::Point_3 &p) const
 {
   typename R::Orientation o = orientation();
   if (o != ZERO)
-    return enum_cast<Oriented_side>(bounded_side(p)) * o;
+    return enum_cast<typename R::Oriented_side>(bounded_side(p)) * o;
 
   CGAL_kernel_assertion (!is_degenerate());
   return ON_ORIENTED_BOUNDARY;
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Triangle_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Triangle_3.h
index 7e61db2dee2..40cae8796e0 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Triangle_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Triangle_3.h
@@ -25,6 +25,7 @@ namespace CGAL {
 template <class R_>
 class TriangleC3
 {
+  typedef typename R_::Boolean              Boolean;
   typedef typename R_::FT                   FT;
   typedef typename R_::Point_3              Point_3;
   typedef typename R_::Vector_3             Vector_3;
@@ -44,13 +45,13 @@ public:
   TriangleC3(const Point_3 &p, const Point_3 &q, const Point_3 &r)
     : base{p, q, r} {}
 
-  bool       operator==(const TriangleC3 &t) const;
-  bool       operator!=(const TriangleC3 &t) const;
+  Boolean operator==(const TriangleC3 &t) const;
+  Boolean operator!=(const TriangleC3 &t) const;
 
   Plane_3    supporting_plane() const;
 
-  bool       has_on(const Point_3 &p) const;
-  bool       is_degenerate() const;
+  Boolean has_on(const Point_3 &p) const;
+  Boolean is_degenerate() const;
 
   const Point_3 & vertex(int i) const;
   const Point_3 & operator[](int i) const;
@@ -59,7 +60,7 @@ public:
 };
 
 template < class R >
-bool
+typename R::Boolean
 TriangleC3<R>::operator==(const TriangleC3<R> &t) const
 {
   if (CGAL::identical(base, t.base))
@@ -75,7 +76,7 @@ TriangleC3<R>::operator==(const TriangleC3<R> &t) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 TriangleC3<R>::operator!=(const TriangleC3<R> &t) const
 {
   return !(*this == t);
@@ -118,7 +119,7 @@ TriangleC3<R>::supporting_plane() const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 TriangleC3<R>::
 has_on(const typename TriangleC3<R>::Point_3 &p) const
 {
@@ -127,7 +128,7 @@ has_on(const typename TriangleC3<R>::Point_3 &p) const
 }
 
 template < class R >
-bool
+typename R::Boolean
 TriangleC3<R>::is_degenerate() const
 {
   return collinear(vertex(0),vertex(1),vertex(2));
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Vector_2.h b/Cartesian_kernel/include/CGAL/Cartesian/Vector_2.h
index 1ff9d12ee7b..b762bddb36b 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Vector_2.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Vector_2.h
@@ -107,7 +107,7 @@ public:
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 operator==(const VectorC2<R> &v, const VectorC2<R> &w)
 {
   return w.x() == v.x() && w.y() == v.y();
@@ -115,7 +115,7 @@ operator==(const VectorC2<R> &v, const VectorC2<R> &w)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator!=(const VectorC2<R> &v, const VectorC2<R> &w)
 {
   return !(v == w);
@@ -123,7 +123,7 @@ operator!=(const VectorC2<R> &v, const VectorC2<R> &w)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator==(const VectorC2<R> &v, const Null_vector &)
 {
   return CGAL_NTS is_zero(v.x()) && CGAL_NTS is_zero(v.y());
@@ -131,7 +131,7 @@ operator==(const VectorC2<R> &v, const Null_vector &)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator==(const Null_vector &n, const VectorC2<R> &v)
 {
   return v == n;
@@ -139,7 +139,7 @@ operator==(const Null_vector &n, const VectorC2<R> &v)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator!=(const VectorC2<R> &v, const Null_vector &n)
 {
   return !(v == n);
@@ -147,7 +147,7 @@ operator!=(const VectorC2<R> &v, const Null_vector &n)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator!=(const Null_vector &n, const VectorC2<R> &v)
 {
   return !(v == n);
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/Vector_3.h b/Cartesian_kernel/include/CGAL/Cartesian/Vector_3.h
index 89540fd9b0d..19543f9dcf4 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/Vector_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/Vector_3.h
@@ -142,15 +142,15 @@ public:
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator==(const VectorC3<R> &v, const VectorC3<R> &w)
 {
-  return w.x() == v.x() && w.y() == v.y() && w.z() == v.z();
+  return CGAL_AND_3(w.x() == v.x(), w.y() == v.y(), w.z() == v.z());
 }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator!=(const VectorC3<R> &v, const VectorC3<R> &w)
 {
   return !(v == w);
@@ -158,16 +158,15 @@ operator!=(const VectorC3<R> &v, const VectorC3<R> &w)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator==(const VectorC3<R> &v, const Null_vector &)
 {
-  return CGAL_NTS is_zero(v.x()) && CGAL_NTS is_zero(v.y()) &&
-         CGAL_NTS is_zero(v.z());
+  return CGAL_AND_3(CGAL_NTS is_zero(v.x()), CGAL_NTS is_zero(v.y()), CGAL_NTS is_zero(v.z()));
 }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator==(const Null_vector &n, const VectorC3<R> &v)
 {
   return v == n;
@@ -175,7 +174,7 @@ operator==(const Null_vector &n, const VectorC3<R> &v)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator!=(const VectorC3<R> &v, const Null_vector &n)
 {
   return !(v == n);
@@ -183,7 +182,7 @@ operator!=(const VectorC3<R> &v, const Null_vector &n)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 operator!=(const Null_vector &n, const VectorC3<R> &v)
 {
   return !(v == n);
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/basic_constructions_3.h b/Cartesian_kernel/include/CGAL/Cartesian/basic_constructions_3.h
index 1760074c988..f00c2ca8791 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/basic_constructions_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/basic_constructions_3.h
@@ -17,7 +17,6 @@
 #ifndef CGAL_CARTESIAN_BASIC_CONSTRUCTIONS_3_H
 #define CGAL_CARTESIAN_BASIC_CONSTRUCTIONS_3_H
 
-#include <CGAL/Cartesian/point_constructions_3.h>
 #include <CGAL/Cartesian/plane_constructions_3.h>
 #include <CGAL/Cartesian/ft_constructions_3.h>
 
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/function_objects.h b/Cartesian_kernel/include/CGAL/Cartesian/function_objects.h
index ffb1056f147..937bcbe6e23 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/function_objects.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/function_objects.h
@@ -36,20 +36,20 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Angle_2
   {
+    typedef typename K::Angle    Angle;
     typedef typename K::Point_2  Point_2;
     typedef typename K::Vector_2 Vector_2;
-  public:
-    typedef typename K::Angle   result_type;
 
-    result_type
+  public:
+    Angle
     operator()(const Vector_2& u, const Vector_2& v) const
     { return angleC2(u.x(), u.y(), v.x(), v.y()); }
 
-    result_type
+    Angle
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     { return angleC2(p.x(), p.y(), q.x(), q.y(), r.x(), r.y()); }
 
-    result_type
+    Angle
     operator()(const Point_2& p, const Point_2& q,
                const Point_2& r, const Point_2& s) const
     {
@@ -63,18 +63,19 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Angle_3
   {
+    typedef typename K::Angle    Angle;
     typedef typename K::Point_3  Point_3;
     typedef typename K::Vector_3 Vector_3;
-  public:
-    typedef typename K::Angle    result_type;
 
-    result_type
+  public:
+    Angle
     operator()(const Vector_3& u, const Vector_3& v) const
     {
       return angleC3(u.x(), u.y(), u.z(),
                      v.x(), v.y(), v.z());
     }
-    result_type
+
+    Angle
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       return angleC3(p.x(), p.y(), p.z(),
@@ -82,7 +83,7 @@ namespace CartesianKernelFunctors {
                      r.x(), r.y(), r.z());
     }
 
-    result_type
+    Angle
     operator()(const Point_3& p, const Point_3& q,
                const Point_3& r, const Point_3& s) const
     {
@@ -92,7 +93,7 @@ namespace CartesianKernelFunctors {
                      s.x(), s.y(), s.z());
     }
 
-    result_type
+    Angle
     operator()(const Point_3& p, const Point_3& q,
                const Point_3& r, const Vector_3& n) const
     {
@@ -103,18 +104,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Are_parallel_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Line_2          Line_2;
     typedef typename K::Segment_2       Segment_2;
     typedef typename K::Ray_2           Ray_2;
 
   public:
-    typedef typename K::Boolean         result_type;
-
-    result_type
+    Boolean
     operator()(const Line_2& l1, const Line_2& l2) const
     { return parallelC2(l1.a(), l1.b(), l2.a(), l2.b()); }
 
-    result_type
+    Boolean
     operator()(const Segment_2& s1, const Segment_2& s2) const
     { return parallelC2(s1.source().x(), s1.source().y(),
                         s1.target().x(), s1.target().y(),
@@ -122,7 +122,7 @@ namespace CartesianKernelFunctors {
                         s2.target().x(), s2.target().y());
     }
 
-    result_type
+    Boolean
     operator()(const Ray_2& r1, const Ray_2& r2) const
     { return parallelC2(r1.source().x(), r1.source().y(),
                         r1.second_point().x(), r1.second_point().y(),
@@ -134,28 +134,27 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Are_parallel_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Line_3          Line_3;
     typedef typename K::Segment_3       Segment_3;
     typedef typename K::Ray_3           Ray_3;
     typedef typename K::Plane_3         Plane_3;
 
   public:
-    typedef typename K::Boolean         result_type;
-
-    result_type
+    Boolean
     operator()(const Line_3& l1, const Line_3& l2) const
     { return parallelC3(
                 l1.to_vector().x(), l1.to_vector().y(), l1.to_vector().z(),
                 l2.to_vector().x(), l2.to_vector().y(), l2.to_vector().z());
     }
 
-    result_type
+    Boolean
     operator()(const Plane_3& h1, const Plane_3& h2) const
     { return parallelC3(h1.a(), h1.b(), h1.c(),
                         h2.a(), h2.b(), h2.c());
     }
 
-    result_type
+    Boolean
     operator()(const Segment_3& s1, const Segment_3& s2) const
     { return parallelC3(s1.source().x(), s1.source().y(), s1.source().z(),
                         s1.target().x(), s1.target().y(), s1.target().z(),
@@ -163,7 +162,7 @@ namespace CartesianKernelFunctors {
                         s2.target().x(), s2.target().y(), s2.target().z());
     }
 
-    result_type
+    Boolean
     operator()(const Ray_3& r1, const Ray_3& r2) const
     { return parallelC3(r1.source().x(), r1.source().y(), r1.source().z(),
         r1.second_point().x(), r1.second_point().y(), r1.second_point().z(),
@@ -175,14 +174,14 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Bounded_side_2
   {
+    typedef typename K::Bounded_side    Bounded_side;
     typedef typename K::Point_2         Point_2;
     typedef typename K::Circle_2        Circle_2;
     typedef typename K::Triangle_2      Triangle_2;
     typedef typename K::Iso_rectangle_2 Iso_rectangle_2;
-  public:
-    typedef typename K::Bounded_side    result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Circle_2& c, const Point_2& p) const
     {
       typename K::Compute_squared_distance_2 squared_distance;
@@ -190,7 +189,7 @@ namespace CartesianKernelFunctors {
                                                    squared_distance(c.center(),p)));
     }
 
-    result_type
+    Bounded_side
     operator()( const Triangle_2& t, const Point_2& p) const
     {
       typename K::Collinear_are_ordered_along_line_2
@@ -213,7 +212,7 @@ namespace CartesianKernelFunctors {
         : ON_UNBOUNDED_SIDE;
     }
 
-    result_type
+    Bounded_side
     operator()( const Iso_rectangle_2& r, const Point_2& p) const
     {
       bool x_incr = (r.xmin() < p.x()) && (p.x() < r.xmax()),
@@ -236,24 +235,24 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Bounded_side_3
   {
+    typedef typename K::Bounded_side    Bounded_side;
     typedef typename K::FT              FT;
     typedef typename K::Point_3         Point_3;
     typedef typename K::Sphere_3        Sphere_3;
     typedef typename K::Circle_3        Circle_3;
     typedef typename K::Tetrahedron_3   Tetrahedron_3;
     typedef typename K::Iso_cuboid_3    Iso_cuboid_3;
-  public:
-    typedef typename K::Bounded_side    result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.rep().bounded_side(p); }
 
-    result_type
+    Bounded_side
     operator()( const Circle_3& s, const Point_3& p) const
     { return s.rep().bounded_side(p); }
 
-    result_type
+    Bounded_side
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     {
       FT alpha, beta, gamma, denom;
@@ -273,7 +272,7 @@ namespace CartesianKernelFunctors {
       return ON_BOUNDED_SIDE;
     }
 
-    result_type
+    Bounded_side
     operator()( const Iso_cuboid_3& c, const Point_3& p) const
     {
       return c.rep().bounded_side(p);
@@ -284,11 +283,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_are_ordered_along_line_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_2         Point_2;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       CGAL_kernel_exactness_precondition( collinear(p, q, r) );
@@ -300,11 +299,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_are_ordered_along_line_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       CGAL_kernel_exactness_precondition( collinear(p, q, r) );
@@ -317,11 +316,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_are_strictly_ordered_along_line_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_2         Point_2;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       CGAL_kernel_exactness_precondition( collinear(p, q, r) );
@@ -333,11 +332,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_are_strictly_ordered_along_line_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       CGAL_kernel_exactness_precondition( collinear(p, q, r) );
@@ -350,13 +349,13 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_has_on_2
   {
+    typedef typename K::Boolean               Boolean;
     typedef typename K::Point_2               Point_2;
     typedef typename K::Ray_2                 Ray_2;
     typedef typename K::Segment_2             Segment_2;
-  public:
-    typedef typename K::Boolean               result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Ray_2& r, const Point_2& p) const
     {
       const Point_2 & source = r.source();
@@ -378,7 +377,7 @@ namespace CartesianKernelFunctors {
       } // switch
     }
 
-    result_type
+    Boolean
     operator()( const Segment_2& s, const Point_2& p) const
     {
       return collinear_are_ordered_along_line(s.source(), p, s.target());
@@ -388,16 +387,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Orientation_2  Orientation_2;
-    Orientation_2 o;
-  public:
-    typedef typename K::Boolean        result_type;
 
+    Orientation_2 o;
+
+  public:
     Collinear_2() {}
     Collinear_2(const Orientation_2 o_) : o(o_) {}
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     { return o(p, q, r) == COLLINEAR; }
   };
@@ -405,11 +405,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Collinear_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       return collinearC3(p.x(), p.y(), p.z(),
@@ -421,11 +421,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_angle_with_x_axis_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Direction_2        Direction_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Direction_2& d1, const Direction_2& d2) const
     {
       return compare_angle_with_x_axisC2(d1.dx(), d1.dy(), d2.dx(), d2.dy());
@@ -435,25 +435,25 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_distance_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       return cmp_dist_to_pointC2(p.x(), p.y(), q.x(), q.y(), r.x(), r.y());
     }
 
     template <class T1, class T2, class T3>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const T3& r) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(p, r));
     }
 
     template <class T1, class T2, class T3, class T4>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(r, s));
@@ -560,12 +560,12 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_distance_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
     typedef typename K::Segment_3          Segment_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       return cmp_dist_to_pointC3(p.x(), p.y(), p.z(),
@@ -573,33 +573,33 @@ namespace CartesianKernelFunctors {
                                  r.x(), r.y(), r.z());
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& p1, const Segment_3& s1, const Segment_3& s2) const
     {
       return internal::compare_distance_pssC3(p1,s1,s2, K());
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& p1, const Point_3& p2, const Segment_3& s2) const
     {
       return internal::compare_distance_ppsC3(p1,p2,s2, K());
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& p1, const Segment_3& s2, const Point_3& p2) const
     {
       return opposite(internal::compare_distance_ppsC3(p1,p2,s2, K()));
     }
 
     template <class T1, class T2, class T3>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const T3& r) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(p, r));
     }
 
     template <class T1, class T2, class T3, class T4>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(r, s));
@@ -614,8 +614,7 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_2                  Point_2;
     typedef typename K::Comparison_result        Comparison_result;
 
-    typedef Comparison_result                    result_type;
-
+public:
     Comparison_result operator()(const Point_2& r,
                                  const Weighted_point_2& p,
                                  const Weighted_point_2& q) const
@@ -629,14 +628,13 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_signed_distance_to_line_2
   {
-    typedef typename K::Point_2   Point_2;
-    typedef typename K::Line_2    Line_2;
-    typedef typename K::Equal_2   Equal_2;
+    typedef typename K::Comparison_result     Comparison_result;
+    typedef typename K::Point_2               Point_2;
+    typedef typename K::Line_2                Line_2;
+    typedef typename K::Equal_2               Equal_2;
 
   public:
-    typedef typename K::Comparison_result     result_type;
-
-    result_type
+    Comparison_result
     operator()(const Point_2& a, const Point_2& b,
                const Point_2& c, const Point_2& d) const
     {
@@ -649,7 +647,7 @@ namespace CartesianKernelFunctors {
                                         d.x(), d.y());
     }
 
-    result_type
+    Comparison_result
     operator()(const Line_2& l, const Point_2& p, const Point_2& q) const
     {
       return cmp_signed_dist_to_directionC2(l.a(), l.b(),
@@ -661,12 +659,12 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_squared_radius_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
     typedef typename K::FT                 FT;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Point_3& p, const Point_3& q, const Point_3& r, const Point_3& s, const FT& ft) const
     {
       FT num, den;
@@ -678,7 +676,7 @@ namespace CartesianKernelFunctors {
       return CGAL::compare(num, den * ft);
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& p, const Point_3& q, const Point_3& r, const FT& ft) const
     {
       FT num, den;
@@ -689,7 +687,7 @@ namespace CartesianKernelFunctors {
       return CGAL::compare(num, den * ft);
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& p, const Point_3& q, const FT& ft) const
     {
       FT num, den;
@@ -699,7 +697,7 @@ namespace CartesianKernelFunctors {
       return CGAL::compare(num, den * ft);
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3&, const FT& ft) const
     {
       return - CGAL_NTS sign(ft);
@@ -707,23 +705,22 @@ namespace CartesianKernelFunctors {
   };
 
 
-
   template <typename K>
   class Compare_slope_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Line_2             Line_2;
     typedef typename K::Segment_2          Segment_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Line_2& l1, const Line_2& l2) const
     {
       return compare_slopesC2(l1.a(), l1.b(), l2.a(), l2.b());
     }
 
-    result_type
+    Comparison_result
     operator()(const Segment_2& s1, const Segment_2& s2) const
     {
       return compare_slopesC2(s1.source().x(), s1.source().y(),
@@ -732,7 +729,7 @@ namespace CartesianKernelFunctors {
                               s2.target().x(), s2.target().y());
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_2& s1s, const Point_2& s1t, const Point_2& s2s, const Point_2& s2t) const
     {
       return compare_slopesC2(s1s.x(), s1s.y(),
@@ -745,30 +742,30 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_x_at_y_2
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_2             Point_2;
     typedef typename K::Line_2              Line_2;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h) const
     { return compare_y_at_xC2(p.y(), p.x(), h.b(), h.a(), h.c()); }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h1, const Line_2& h2) const
     {
       return compare_y_at_xC2(p.y(), h1.b(), h1.a(), h1.c(),
                               h2.b(), h2.a(), h2.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2, const Line_2& h) const
     {
       return compare_y_at_xC2(l1.b(), l1.a(), l1.c(), l2.b(), l2.a(), l2.c(),
                               h.b(), h.a(), h.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     {
@@ -780,11 +777,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_xyz_3
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_3             Point_3;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     {
       return compare_lexicographically_xyzC3(p.x(), p.y(), p.z(),
@@ -795,11 +792,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_xy_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     { return compare_lexicographically_xyC2(p.x(), p.y(), q.x(), q.y()); }
   };
@@ -807,11 +804,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_xy_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return compare_lexicographically_xyC2(p.x(), p.y(), q.x(), q.y()); }
   };
@@ -819,27 +816,27 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_x_2
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_2             Point_2;
     typedef typename K::Line_2              Line_2;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     { return CGAL::compare(p.x(), q.x()); }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& l, const Line_2& h) const
     { return compare_xC2(p.x(), l.a(), l.b(), l.c(), h.a(), h.b(), h.c()); }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l, const Line_2& h1, const Line_2& h2) const
     {
       return compare_xC2(l.a(), l.b(), l.c(), h1.a(), h1.b(), h1.c(),
                          h2.a(), h2.b(), h2.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     {
@@ -851,11 +848,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_x_3
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_3             Point_3;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return CGAL::compare(p.x(), q.x()); }
   };
@@ -863,11 +860,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_yx_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     { return compare_lexicographically_xyC2(p.y(), p.x(), q.y(), q.x()); }
   };
@@ -875,31 +872,31 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_y_at_x_2
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_2             Point_2;
     typedef typename K::Line_2              Line_2;
     typedef typename K::Segment_2           Segment_2;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h) const
     { return compare_y_at_xC2(p.x(), p.y(), h.a(), h.b(), h.c()); }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h1, const Line_2& h2) const
     {
       return compare_y_at_xC2(p.x(), h1.a(), h1.b(), h1.c(),
                               h2.a(), h2.b(), h2.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2, const Line_2& h) const
     {
       return compare_y_at_xC2(l1.a(), l1.b(), l1.c(), l2.a(), l2.b(), l2.c(),
                               h.a(), h.b(), h.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     {
@@ -907,7 +904,7 @@ namespace CartesianKernelFunctors {
                               h1.a(), h1.b(), h1.c(), h2.a(), h2.b(), h2.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Segment_2& s) const
     {
       return compare_y_at_xC2(p.x(), p.y(),
@@ -915,7 +912,7 @@ namespace CartesianKernelFunctors {
                               s.target().x(), s.target().y());
     }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p,
                 const Segment_2& s1, const Segment_2& s2) const
     {
@@ -930,16 +927,16 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_y_2
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_2             Point_2;
     typedef typename K::Line_2              Line_2;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     { return CGAL::compare(p.y(), q.y()); }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& l1, const Line_2& l2) const
     {
       return compare_xC2(p.y(),
@@ -947,14 +944,14 @@ namespace CartesianKernelFunctors {
                          l2.b(), l2.a(), l2.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l, const Line_2& h1, const Line_2& h2) const
     {
       return compare_xC2(l.b(), l.a(), l.c(), h1.b(), h1.a(), h1.c(),
                          l.b(), l.a(), l.c(), h2.b(), h2.a(), h2.c());
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     {
@@ -966,11 +963,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_y_3
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_3             Point_3;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return CGAL::compare(p.y(), q.y()); }
   };
@@ -978,11 +975,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compare_z_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return CGAL::compare(p.z(), q.z()); }
   };
@@ -994,10 +991,7 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT                        FT;
 
   public:
-
-    typedef double result_type;
-
-    result_type
+    double
     operator() (const Circle_3 & c) const
     // { return c.rep().approximate_area(); }
     { return CGAL_PI * to_double(c.squared_radius()); }
@@ -1010,10 +1004,7 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT                        FT;
 
   public:
-
-    typedef double result_type;
-
-    result_type
+    double
     operator() (const Circle_3 & c) const
     // { return c.rep().approximate_squared_length(); }
     { return CGAL_PI * CGAL_PI * 4.0 * to_double(c.squared_radius()); }
@@ -1027,10 +1018,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::Iso_rectangle_2   Iso_rectangle_2;
     typedef typename K::Triangle_2        Triangle_2;
     typedef typename K::Point_2           Point_2;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()( const Point_2& p, const Point_2& q, const Point_2& r ) const
     {
       FT v1x = q.x() - p.x();
@@ -1040,11 +1030,11 @@ namespace CartesianKernelFunctors {
       return determinant(v1x, v1y, v2x, v2y)/2;
     }
 
-    result_type
+    FT
     operator()( const Iso_rectangle_2& r ) const
     { return (r.xmax()-r.xmin()) * (r.ymax()-r.ymin()); }
 
-    result_type
+    FT
     operator()( const Triangle_2& t ) const
     { return t.area(); }
   };
@@ -1053,13 +1043,9 @@ namespace CartesianKernelFunctors {
   class Compute_area_divided_by_pi_3
   {
     typedef typename K::Circle_3                  Circle_3;
-    typedef typename K::FT                        FT;
 
   public:
-
-    typedef FT result_type;
-
-    result_type
+    decltype(auto) // FT or const FT&
     operator()(const Circle_3 & c) const
     { return c.rep().area_divided_by_pi(); }
 
@@ -1070,10 +1056,9 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT                FT;
     typedef typename K::Vector_2          Vector_2;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Vector_2& v, const Vector_2& w) const
     {
         return determinant(v.x(), v.y(), w.x(), w.y());
@@ -1085,10 +1070,9 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT                FT;
     typedef typename K::Vector_3          Vector_3;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Vector_3& v, const Vector_3& w, const Vector_3& t) const
     {
         return determinant(v.x(), v.y(), v.z(),
@@ -1102,10 +1086,9 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT                FT;
     typedef typename K::Vector_2          Vector_2;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Vector_2& v, const Vector_2& w) const
     {
         return v.x() * w.x() + v.y() * w.y();
@@ -1117,10 +1100,9 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT                FT;
     typedef typename K::Vector_3          Vector_3;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Vector_3& v, const Vector_3& w) const
     {
         return v.x() * w.x() + v.y() * w.y() + v.z() * w.z();
@@ -1133,16 +1115,15 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT                FT;
     typedef typename K::Point_3           Point_3;
     typedef typename K::Triangle_3        Triangle_3;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()( const Triangle_3& t ) const
     {
         return this->operator()(t.vertex(0), t.vertex(1), t.vertex(2));
     }
 
-    result_type
+    FT
     operator()( const Point_3& p, const Point_3& q, const Point_3& r ) const
     {
         return squared_areaC3(p.x(), p.y(), p.z(),
@@ -1157,10 +1138,9 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT       FT;
     typedef typename K::Point_2  Point_2;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()( const Point_2& p, const Point_2& q) const
     {
       return squared_distanceC2(p.x(), p.y(), q.x(), q.y());
@@ -1170,14 +1150,11 @@ namespace CartesianKernelFunctors {
   template <class K>
   class Compute_squared_length_divided_by_pi_square_3
   {
-    typedef typename K::Circle_3                  Circle_3;
     typedef typename K::FT                        FT;
+    typedef typename K::Circle_3                  Circle_3;
 
   public:
-
-    typedef FT result_type;
-
-    result_type
+    FT
     operator() (const Circle_3 & c) const
     { return c.rep().squared_length_divided_by_pi_square(); }
 
@@ -1189,31 +1166,27 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT          FT;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Circle_2    Circle_2;
-  public:
-    typedef FT                      result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()( const Circle_2& c) const
     { return c.rep().squared_radius(); }
 
-    result_type
+    FT
     operator()( const Point_2& /*p*/) const
     { return FT(0); }
 
-    result_type
+    FT
     operator()( const Point_2& p, const Point_2& q) const
     { return squared_radiusC2(p.x(), p.y(), q.x(), q.y()); }
 
-    result_type
+    FT
     operator()( const Point_2& p, const Point_2& q, const Point_2& r) const
     { return squared_radiusC2(p.x(), p.y(), q.x(), q.y(), r.x(), r.y()); }
   };
 
 } //namespace CartesianKernelFunctors
 
-// For the non specialized template will do the right thing,
-// namely return a copy of an FT
-
 namespace CartesianKernelFunctors {
 
   template <typename K>
@@ -1223,22 +1196,21 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_3     Point_3;
     typedef typename K::Sphere_3    Sphere_3;
     typedef typename K::Circle_3    Circle_3;
-  public:
-    typedef FT               result_type;
 
-    result_type
+public:
+    decltype(auto)
     operator()( const Sphere_3& s) const
     { return s.rep().squared_radius(); }
 
-    result_type
+    decltype(auto)
     operator()( const Circle_3& c) const
     { return c.rep().squared_radius(); }
 
-    result_type
+    FT
     operator()( const Point_3& /*p*/) const
     { return FT(0); }
 
-    result_type
+    FT
     operator()( const Point_3& p, const Point_3& q) const
     {
       FT num, den;
@@ -1248,7 +1220,7 @@ namespace CartesianKernelFunctors {
       return num / den;
     }
 
-    result_type
+    FT
     operator()( const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       FT num, den;
@@ -1259,7 +1231,7 @@ namespace CartesianKernelFunctors {
       return num / den;
     }
 
-    result_type
+    FT
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     {
@@ -1280,10 +1252,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_3        Point_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
     typedef typename K::Iso_cuboid_3   Iso_cuboid_3;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Point_3& p0, const Point_3& p1,
                const Point_3& p2, const Point_3& p3) const
     {
@@ -1292,14 +1263,14 @@ namespace CartesianKernelFunctors {
                              p3.x()-p0.x(), p3.y()-p0.y(), p3.z()-p0.z())/6;
     }
 
-    result_type
+    FT
     operator()( const Tetrahedron_3& t ) const
     {
       return this->operator()(t.vertex(0), t.vertex(1),
                               t.vertex(2), t.vertex(3));
     }
 
-    result_type
+    FT
     operator()( const Iso_cuboid_3& c ) const
     { return c.rep().volume(); }
   };
@@ -1308,20 +1279,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_x_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().x();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().x();
@@ -1331,20 +1299,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_x_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().x();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().x();
@@ -1355,20 +1320,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_y_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().y();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().y();
@@ -1379,20 +1341,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_y_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().y();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().y();
@@ -1402,38 +1361,30 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_z_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().z();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().z();
     }
   };
 
-
-
   template <typename K>
   class Compute_dx_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Direction_2    Direction_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_2& d) const
     {
       return d.rep().dx();
@@ -1443,13 +1394,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_dx_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Direction_3    Direction_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_3& d) const
     {
       return d.rep().dx();
@@ -1459,13 +1407,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_dy_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Direction_2    Direction_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_2& d) const
     {
       return d.rep().dy();
@@ -1475,13 +1420,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_dy_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Direction_3    Direction_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_3& d) const
     {
       return d.rep().dy();
@@ -1491,13 +1433,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_dz_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Direction_3        Direction_3;
 
   public:
-    typedef const FT&               result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_3& d) const
     {
       return d.rep().dz();
@@ -1507,20 +1446,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hx_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().hx();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().hx();
@@ -1530,20 +1466,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hx_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hx();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hx();
@@ -1553,20 +1486,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hy_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().hy();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().hy();
@@ -1576,20 +1506,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hy_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hy();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hy();
@@ -1599,20 +1526,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hz_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hz();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hz();
@@ -1622,20 +1546,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hw_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const FT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().hw();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().hw();
@@ -1645,20 +1566,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_hw_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const FT&                 result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hw();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hw();
@@ -1669,13 +1587,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_xmin_2
   {
-    typedef typename K::FT              FT;
     typedef typename K::Iso_rectangle_2 Iso_rectangle_2;
 
   public:
-    typedef const FT&                   result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Iso_rectangle_2& r) const
     {
       return (r.min)().x();
@@ -1685,13 +1600,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_xmax_2
   {
-    typedef typename K::FT              FT;
     typedef typename K::Iso_rectangle_2 Iso_rectangle_2;
 
   public:
-    typedef const FT&                   result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Iso_rectangle_2& r) const
     {
       return (r.max)().x();
@@ -1701,13 +1613,10 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_ymin_2
   {
-    typedef typename K::FT              FT;
     typedef typename K::Iso_rectangle_2 Iso_rectangle_2;
 
   public:
-    typedef const FT&                   result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Iso_rectangle_2& r) const
     {
       return (r.min)().y();
@@ -1717,29 +1626,24 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Compute_ymax_2
   {
-    typedef typename K::FT              FT;
     typedef typename K::Iso_rectangle_2 Iso_rectangle_2;
 
   public:
-    typedef const FT&                   result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Iso_rectangle_2& r) const
     {
       return (r.max)().y();
     }
   };
 
-
   template <typename K>
   class Construct_barycenter_2
   {
     typedef typename K::FT          FT;
     typedef typename K::Point_2     Point_2;
-  public:
-    typedef Point_2                 result_type;
 
-    result_type
+  public:
+    Point_2
     operator()(const Point_2& p1, const FT&w1, const Point_2& p2) const
     {
       typename K::Construct_point_2 construct_point_2;
@@ -1748,7 +1652,7 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p1, const FT& w1, const Point_2& p2, const FT& w2) const
     {
       typename K::Construct_point_2 construct_point_2;
@@ -1757,7 +1661,7 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p1, const FT& w1, const Point_2& p2, const FT& w2,
                const Point_2& p3) const
     {
@@ -1767,7 +1671,7 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p1, const FT& w1, const Point_2& p2, const FT& w2,
                const Point_2& p3, const FT& w3) const
     {
@@ -1777,7 +1681,7 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p1, const FT& w1, const Point_2& p2, const FT& w2,
                const Point_2& p3, const FT& w3, const Point_2& p4) const
     {
@@ -1787,7 +1691,7 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p1, const FT& w1, const Point_2& p2, const FT& w2,
                const Point_2& p3, const FT& w3, const Point_2& p4, const FT& w4) const
     {
@@ -1804,10 +1708,9 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT          FT;
     typedef typename K::Point_3     Point_3;
-  public:
-    typedef Point_3                 result_type;
 
-    result_type
+  public:
+    Point_3
     operator()(const Point_3& p1, const FT&w1, const Point_3& p2) const
     {
       typename K::Construct_point_3 construct_point_3;
@@ -1816,7 +1719,7 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Point_3& p1, const FT& w1, const Point_3& p2, const FT& w2) const
     {
       typename K::Construct_point_3 construct_point_3;
@@ -1825,7 +1728,7 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Point_3& p1, const FT& w1, const Point_3& p2, const FT& w2,
                const Point_3& p3) const
     {
@@ -1835,7 +1738,7 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Point_3& p1, const FT& w1, const Point_3& p2, const FT& w2,
                const Point_3& p3, const FT& w3) const
     {
@@ -1846,7 +1749,7 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Point_3& p1, const FT& w1, const Point_3& p2, const FT& w2,
                const Point_3& p3, const FT& w3, const Point_3& p4) const
     {
@@ -1857,7 +1760,7 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Point_3& p1, const FT& w1, const Point_3& p2, const FT& w2,
                const Point_3& p3, const FT& w3, const Point_3& p4, const FT& w4) const
     {
@@ -1882,16 +1785,15 @@ namespace CartesianKernelFunctors {
     Construct_orthogonal_vector_3;
     Construct_cross_product_vector_3 cp;
     Construct_orthogonal_vector_3 co;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Construct_base_vector_3() {}
     Construct_base_vector_3(const Construct_cross_product_vector_3& cp_,
                             const Construct_orthogonal_vector_3& co_)
       : cp(cp_), co(co_)
     {}
 
-    result_type
+    Vector_3
     operator()( const Plane_3& h, int index ) const
     {
       if (index == 1) {
@@ -1933,10 +1835,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Triangle_2       Triangle_2;
     typedef typename K::Circle_2         Circle_2;
-  public:
-    typedef Bbox_2                       result_type;
 
-    result_type
+  public:
+    Bbox_2
     operator()(const Point_2& p) const
     {
       std::pair<double,double> xp = CGAL_NTS to_interval(p.x());
@@ -1944,11 +1845,11 @@ namespace CartesianKernelFunctors {
       return Bbox_2(xp.first, yp.first, xp.second, yp.second);
     }
 
-    result_type
+    Bbox_2
     operator()(const Segment_2& s) const
     { return s.source().bbox() + s.target().bbox(); }
 
-    result_type
+    Bbox_2
     operator()(const Triangle_2& t) const
     {
       Bbox_2 bb = this->operator()(t.vertex(0));
@@ -1968,14 +1869,14 @@ namespace CartesianKernelFunctors {
       */
     }
 
-    result_type
+    Bbox_2
     operator()(const Iso_rectangle_2& r) const
     {
       typename K::Construct_bbox_2 construct_bbox_2;
       return construct_bbox_2((r.min)()) + construct_bbox_2((r.max)());
     }
 
-    result_type
+    Bbox_2
     operator()(const Circle_2& c) const
     {
       typename K::Construct_bbox_2 construct_bbox_2;
@@ -2006,9 +1907,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
     typedef typename K::Sphere_3         Sphere_3;
     typedef typename K::Circle_3         Circle_3;
-  public:
-    typedef Bbox_3          result_type;
 
+  public:
     Bbox_3
     operator()(const Point_3& p) const
     {
@@ -2070,7 +1970,7 @@ namespace CartesianKernelFunctors {
                     maxx.sup(), maxy.sup(), maxz.sup());
     }
 
-    Bbox_3
+    decltype(auto)
     operator()(const Circle_3& c) const
     { return c.rep().bbox(); }
 
@@ -2083,10 +1983,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT      FT;
     typedef typename K::Point_2 Point_2;
     typedef typename K::Line_2  Line_2;
-  public:
-    typedef Line_2              result_type;
 
-    result_type
+  public:
+    Line_2
     operator()(const Point_2& p, const Point_2& q) const
     {
       FT a, b, c;
@@ -2094,7 +1993,7 @@ namespace CartesianKernelFunctors {
       return Line_2(a, b, c);
     }
 
-    result_type
+    Line_2
     operator()(const Line_2& p, const Line_2& q) const
     {
       FT a, b, c;
@@ -2111,10 +2010,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT        FT;
     typedef typename K::Point_3   Point_3;
     typedef typename K::Plane_3   Plane_3;
-  public:
-    typedef Plane_3               result_type;
 
-    result_type
+  public:
+    Plane_3
     operator()(const Point_3& p, const Point_3& q) const
     {
       FT a, b, c, d;
@@ -2124,7 +2022,7 @@ namespace CartesianKernelFunctors {
       return Plane_3(a, b, c, d);
     }
 
-    result_type
+    Plane_3
     operator()(const Plane_3& p, const Plane_3& q) const
     {
       FT a, b, c, d;
@@ -2141,10 +2039,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT          FT;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Triangle_2  Triangle_2;
-  public:
-    typedef Point_2                 result_type;
 
-    result_type
+  public:
+    Point_2
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       typename K::Construct_point_2 construct_point_2;
@@ -2153,13 +2050,13 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Triangle_2& t) const
     {
       return this->operator()(t.vertex(0), t.vertex(1), t.vertex(2));
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p, const Point_2& q,
                const Point_2& r, const Point_2& s) const
     {
@@ -2177,10 +2074,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_3        Point_3;
     typedef typename K::Triangle_3     Triangle_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
-  public:
-    typedef Point_3                    result_type;
 
-    result_type
+  public:
+    Point_3
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       typename K::Construct_point_3 construct_point_3;
@@ -2192,7 +2088,7 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Point_3& p, const Point_3& q,
                const Point_3& r, const Point_3& s) const
     {
@@ -2206,13 +2102,13 @@ namespace CartesianKernelFunctors {
       return construct_point_3(x, y, z);
     }
 
-    result_type
+    Point_3
     operator()(const Triangle_3& t) const
     {
       return this->operator()(t.vertex(0), t.vertex(1), t.vertex(2));
     }
 
-    result_type
+    Point_3
     operator()(const Tetrahedron_3& t) const
     {
       return this->operator()(t.vertex(0), t.vertex(1),
@@ -2225,9 +2121,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::Point_2     Point_2;
     typedef typename K::Triangle_2  Triangle_2;
-  public:
-    typedef Point_2                 result_type;
 
+  public:
     Point_2
     operator()(const Point_2& p, const Point_2& q) const
     {
@@ -2235,7 +2130,7 @@ namespace CartesianKernelFunctors {
       return construct_midpoint_2(p, q);
     }
 
-    result_type
+    Point_2
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       typename K::Construct_point_2 construct_point_2;
@@ -2245,7 +2140,7 @@ namespace CartesianKernelFunctors {
       return construct_point_2(x, y);
     }
 
-    result_type
+    Point_2
     operator()(const Triangle_2& t) const
     {
       return this->operator()(t.vertex(0), t.vertex(1), t.vertex(2));
@@ -2259,9 +2154,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
     typedef typename K::Triangle_3     Triangle_3;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef Point_3                    result_type;
 
+  public:
     Point_3
     operator()(const Point_3& p, const Point_3& q) const
     {
@@ -2313,9 +2207,8 @@ namespace CartesianKernelFunctors {
   class Construct_cross_product_vector_3
   {
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Vector_3              result_type;
 
+  public:
     Vector_3
     operator()(const Vector_3& v, const Vector_3& w) const
     {
@@ -2334,15 +2227,14 @@ namespace CartesianKernelFunctors {
     typedef typename K::Construct_base_vector_3    Construct_base_vector_3;
     typedef typename K::Construct_point_on_3       Construct_point_on_3;
     typedef typename K::Construct_scaled_vector_3  Construct_scaled_vector_3;
-    typedef typename K::Construct_translated_point_3
-    Construct_translated_point_3;
+    typedef typename K::Construct_translated_point_3 Construct_translated_point_3;
+
     Construct_base_vector_3 cb;
     Construct_point_on_3 cp;
     Construct_scaled_vector_3 cs;
     Construct_translated_point_3 ct;
-  public:
-    typedef Point_3          result_type;
 
+  public:
     Construct_lifted_point_3() {}
     Construct_lifted_point_3(const Construct_base_vector_3& cb_,
                              const Construct_point_on_3& cp_,
@@ -2371,8 +2263,6 @@ namespace CartesianKernelFunctors {
     typedef typename K::RT              RT;
 
   public:
-    typedef Direction_2                 result_type;
-
     Rep // Direction_2
     operator()(Return_base_tag, const RT& x, const RT& y) const
     { return Rep(x, y); }
@@ -2447,9 +2337,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Segment_3       Segment_3;
     typedef typename K::RT              RT;
     typedef typename Direction_3::Rep   Rep;
-  public:
-    typedef Direction_3       result_type;
 
+  public:
     Rep // Direction_3
     operator()(Return_base_tag, const RT& x, const RT& y, const RT& z) const
     { return Rep(x, y, z); }
@@ -2500,9 +2389,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Vector_3    Vector_3;
     typedef typename K::Line_3      Line_3;
     typedef typename Line_3::Rep    Rep;
-  public:
-    typedef Line_3           result_type;
 
+  public:
     Line_3
     operator()( const Point_3& p, const Point_3& q, const Point_3& s) const
     {
@@ -2552,7 +2440,6 @@ namespace CartesianKernelFunctors {
       FT z = s.z() + num_z*inv;
       return Rep(Point_3(x, y, z), Vector_3(rsx, rsy, rsz));
     }
-
   };
 
   template <typename K>
@@ -2565,8 +2452,6 @@ namespace CartesianKernelFunctors {
     typedef typename Iso_rectangle_2::Rep     Rep;
 
   public:
-    typedef Iso_rectangle_2              result_type;
-
     Rep // Iso_rectangle_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q, int) const
     {
@@ -2670,10 +2555,10 @@ namespace CartesianKernelFunctors {
     typedef typename K::Line_2                    Line_2;
     typedef typename Line_2::Rep                  Rep;
     typedef typename K::Construct_point_on_2      Construct_point_on_2;
-    Construct_point_on_2 c;
-  public:
-    typedef Line_2            result_type;
 
+    Construct_point_on_2 c;
+
+  public:
     Construct_line_2() {}
     Construct_line_2(const Construct_point_on_2& c_) : c(c_) {}
 
@@ -2749,9 +2634,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Line_3                    Line_3;
     typedef typename K::Vector_3                  Vector_3;
     typedef typename Line_3::Rep                  Rep;
-  public:
-    typedef Line_3            result_type;
 
+  public:
     Rep // Line_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q) const
     { return Rep(p, Vector_3(p, q)); }
@@ -2800,9 +2684,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT        FT;
     typedef typename K::Point_2   Point_2;
     typedef typename K::Segment_2 Segment_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()(const Point_2& p, const Point_2& q) const
     {
@@ -2830,9 +2713,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT        FT;
     typedef typename K::Point_3   Point_3;
     typedef typename K::Segment_3 Segment_3;
-  public:
-    typedef Point_3               result_type;
 
+  public:
     Point_3
     operator()(const Point_3& p, const Point_3& q) const
     {
@@ -2858,9 +2740,8 @@ namespace CartesianKernelFunctors {
   class Construct_opposite_vector_2
   {
     typedef typename K::Vector_2    Vector_2;
-  public:
-    typedef Vector_2                result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v) const
     { return Vector_2(-v.x(), -v.y()); }
@@ -2870,9 +2751,8 @@ namespace CartesianKernelFunctors {
   class Construct_difference_of_vectors_2
   {
     typedef typename K::Vector_2    Vector_2;
-  public:
-    typedef Vector_2                result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, const Vector_2& w) const
     { return Vector_2(v.x()-w.x(), v.y()-w.y()); }
@@ -2882,9 +2762,8 @@ namespace CartesianKernelFunctors {
   class Construct_difference_of_vectors_3
   {
     typedef typename K::Vector_3    Vector_3;
-  public:
-    typedef Vector_3                result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& v, const Vector_3& w) const
     { return Vector_3(v.x()-w.x(), v.y()-w.y(), v.z()-w.z()); }
@@ -2898,8 +2777,6 @@ namespace CartesianKernelFunctors {
     typedef typename K::Weighted_point_2                Weighted_point_2;
     typedef typename K::Line_2                          Line_2;
 
-    typedef Line_2           result_type;
-
     Line_2
     operator() ( const Weighted_point_2 & p, const Weighted_point_2 & q) const
     {
@@ -2917,9 +2794,8 @@ namespace CartesianKernelFunctors {
   class Construct_sum_of_vectors_2
   {
     typedef typename K::Vector_2    Vector_2;
-  public:
-    typedef Vector_2                result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, const Vector_2& w) const
     { return Vector_2(v.x()+w.x(), v.y()+w.y()); }
@@ -2929,9 +2805,8 @@ namespace CartesianKernelFunctors {
   class Construct_sum_of_vectors_3
   {
     typedef typename K::Vector_3    Vector_3;
-  public:
-    typedef Vector_3                result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& v, const Vector_3& w) const
     { return Vector_3(v.x()+w.x(), v.y()+w.y(), v.z()+w.z()); }
@@ -2941,9 +2816,8 @@ namespace CartesianKernelFunctors {
   class Construct_opposite_vector_3
   {
     typedef typename K::Vector_3    Vector_3;
-  public:
-    typedef Vector_3                result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& v) const
     { return Vector_3(-v.x(), -v.y(), -v.z()); }
@@ -2956,9 +2830,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_3     Point_3;
     typedef typename K::Vector_3    Vector_3;
     typedef typename K::Plane_3     Plane_3;
-  public:
-    typedef Vector_3                result_type;
 
+  public:
     Vector_3
     operator()( const Plane_3& p ) const
     { return Vector_3(p.a(), p.b(), p.c()); }
@@ -2998,9 +2871,8 @@ namespace CartesianKernelFunctors {
   class Construct_perpendicular_vector_2
   {
     typedef typename K::Vector_2   Vector_2;
-  public:
-    typedef Vector_2               result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, Orientation o) const
     {
@@ -3016,9 +2888,8 @@ namespace CartesianKernelFunctors {
   class Construct_perpendicular_direction_2
   {
     typedef typename K::Direction_2   Direction_2;
-  public:
-    typedef Direction_2               result_type;
 
+  public:
     Direction_2
     operator()( const Direction_2& d, Orientation o) const
     {
@@ -3036,9 +2907,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::Line_2    Line_2;
     typedef typename K::Point_2   Point_2;
-  public:
-    typedef Line_2                result_type;
 
+  public:
     Line_2
     operator()( const Line_2& l, const Point_2& p) const
     {
@@ -3058,24 +2928,9 @@ namespace CartesianKernelFunctors {
     typedef typename K::Weighted_point_2 Weighted_point_2;
     typedef typename K::Line_2     Line_2;
     typedef typename Point_2::Rep  Rep;
+
   public:
-
-    template<typename>
-    struct result {
-      typedef Point_2 type;
-    };
-
-    template<typename F>
-    struct result<F(Weighted_point_2)> {
-      typedef const Point_2& type;
-    };
-
-    template<typename F>
-    struct result<F(Point_2)> {
-      typedef const Point_2& type;
-    };
-
-    template <typename ...Args>
+    template <class ...Args>
     Rep // Point_2
     operator()(Return_base_tag, Args&& ...args) const
     { return Rep(std::forward<Args>(args)...); }
@@ -3102,7 +2957,7 @@ namespace CartesianKernelFunctors {
     operator()(const Point_2 & p) const
     { return p; }
 
-    const Point_2&
+    decltype(auto)
     operator()(const Weighted_point_2 & p) const
     { return p.rep().point(); }
 
@@ -3132,22 +2987,6 @@ namespace CartesianKernelFunctors {
     typedef typename Point_3::Rep        Rep;
 
   public:
-
-    template<typename>
-    struct result {
-      typedef Point_3 type;
-    };
-
-    template<typename F>
-    struct result<F(Weighted_point_3)> {
-      typedef const Point_3& type;
-    };
-
-    template<typename F>
-    struct result<F(Point_3)> {
-      typedef const Point_3& type;
-    };
-
     template <class ...Args>
     Rep // Point_3
     operator()(Return_base_tag, Args&& ...args) const
@@ -3157,7 +2996,7 @@ namespace CartesianKernelFunctors {
     operator()(const Point_3 & p) const
     { return p; }
 
-    const Point_3&
+    decltype(auto)
     operator()(const Weighted_point_3 & p) const
     { return p.rep().point(); }
 
@@ -3186,9 +3025,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_2             Point_2;
     typedef typename K::Weighted_point_2    Weighted_point_2;
     typedef typename Weighted_point_2::Rep  Rep;
-  public:
-    typedef Weighted_point_2                result_type;
 
+  public:
     Rep
     operator()(Return_base_tag, Origin o) const
     { return Rep(o); }
@@ -3229,9 +3067,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_3             Point_3;
     typedef typename K::Weighted_point_3    Weighted_point_3;
     typedef typename Weighted_point_3::Rep  Rep;
-  public:
-    typedef Weighted_point_3                result_type;
 
+  public:
     Rep
     operator()(Return_base_tag, Origin o) const
     { return Rep(o); }
@@ -3273,9 +3110,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Line_2     Line_2;
     typedef typename K::Segment_2  Segment_2;
     typedef typename K::Triangle_2 Triangle_2;
-  public:
-    typedef Point_2                result_type;
 
+  public:
     Point_2
     operator()( const Line_2& l, const Point_2& p ) const
     {
@@ -3307,16 +3143,6 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT         FT;
 
   public:
-    template<typename>
-    struct result {
-      typedef const Point_3 type;
-    };
-
-    template<typename F>
-    struct result<F(Point_3, Point_3)> {
-      typedef const Point_3& type;
-    };
-
     Point_3
     operator()( const Line_3& l, const Point_3& p ) const
     {
@@ -3365,10 +3191,7 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT                 FT;
 
   public:
-
-    typedef Line_2 result_type;
-
-    result_type
+    Line_2
     operator() (const Circle_2 & c1, const Circle_2 & c2) const
     {
       // Concentric Circles don't have radical line
@@ -3391,10 +3214,7 @@ namespace CartesianKernelFunctors {
     typedef typename K::FT                 FT;
 
   public:
-
-    typedef Plane_3 result_type;
-
-    result_type
+    Plane_3
     operator() (const Sphere_3 & s1, const Sphere_3 & s2) const
     {
       // Concentric Spheres don't have radical plane
@@ -3418,9 +3238,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT         FT;
     typedef typename K::Vector_2   Vector_2;
-  public:
-    typedef Vector_2               result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, const FT& c) const
     {
@@ -3433,9 +3252,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT         FT;
     typedef typename K::Vector_2   Vector_2;
-  public:
-    typedef Vector_2               result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, const FT& c) const
     {
@@ -3448,9 +3266,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT         FT;
     typedef typename K::Vector_3   Vector_3;
-  public:
-    typedef Vector_3               result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& v, const FT& c) const
     {
@@ -3463,9 +3280,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::FT         FT;
     typedef typename K::Vector_3   Vector_3;
-  public:
-    typedef Vector_3               result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& w, const FT& c) const
     {
@@ -3478,9 +3294,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::Point_2   Point_2;
     typedef typename K::Vector_2  Vector_2;
-  public:
-    typedef Point_2               result_type;
 
+  public:
     Point_2
     operator()( const Point_2& p, const Vector_2& v) const
     {
@@ -3501,9 +3316,8 @@ namespace CartesianKernelFunctors {
   {
     typedef typename K::Point_3   Point_3;
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Point_3               result_type;
 
+  public:
     Point_3
     operator()( const Point_3& p, const Vector_3& v) const
     {
@@ -3531,9 +3345,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Point_2      Point_2;
     typedef typename K::Direction_2  Direction_2;
     typedef typename Vector_2::Rep   Rep;
-  public:
-    typedef Vector_2                 result_type;
 
+  public:
     Rep // Vector_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q) const
     { return Rep(q.x() - p.x(), q.y() - p.y()); }
@@ -3635,9 +3448,8 @@ namespace CartesianKernelFunctors {
     typedef typename K::Vector_3     Vector_3;
     typedef typename K::Point_3      Point_3;
     typedef typename Vector_3::Rep   Rep;
-  public:
-    typedef Vector_3                 result_type;
 
+  public:
     Rep // Vector_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q) const
     {
@@ -3741,22 +3553,13 @@ namespace CartesianKernelFunctors {
     typedef typename K::Segment_2        Segment_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Triangle_2       Triangle_2;
+
   public:
-    template<class>
-    struct result {
-      typedef const Point_2& type;
-    };
-
-    template<typename F>
-    struct result<F(Iso_rectangle_2, int)> {
-      typedef Point_2 type;
-    };
-
-    const Point_2 &
+    decltype(auto)
     operator()( const Segment_2& s, int i) const
     { return s.vertex(i); }
 
-    const Point_2 &
+    decltype(auto)
     operator()( const Triangle_2& t, int i) const
     { return t.rep().vertex(i); }
 
@@ -3779,6 +3582,7 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Coplanar_orientation_3
   {
+    typedef typename K::Orientation  Orientation;
     typedef typename K::Point_3      Point_3;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Coplanar_3   Coplanar_3;
@@ -3786,9 +3590,8 @@ namespace CartesianKernelFunctors {
     Coplanar_3 cp;
     Collinear_3 cl;
 #endif // CGAL_kernel_exactness_preconditions
-  public:
-    typedef typename K::Orientation  result_type;
 
+  public:
 #ifdef CGAL_kernel_exactness_preconditions
     Coplanar_orientation_3() {}
     Coplanar_orientation_3(const Coplanar_3& cp_, const Collinear_3& cl_)
@@ -3796,7 +3599,7 @@ namespace CartesianKernelFunctors {
     {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Orientation
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       return coplanar_orientationC3(p.x(), p.y(), p.z(),
@@ -3804,7 +3607,7 @@ namespace CartesianKernelFunctors {
                                     r.x(), r.y(), r.z());
     }
 
-    result_type
+    Orientation
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     {
@@ -3827,16 +3630,16 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Coplanar_side_of_bounded_circle_3
   {
-    typedef typename K::Point_3   Point_3;
+    typedef typename K::Bounded_side Bounded_side;
+    typedef typename K::Point_3      Point_3;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Coplanar_3   Coplanar_3;
     typedef typename K::Collinear_3  Collinear_3;
     Coplanar_3 cp;
     Collinear_3 cl;
 #endif // CGAL_kernel_exactness_preconditions
-  public:
-    typedef typename K::Bounded_side     result_type;
 
+  public:
 #ifdef CGAL_kernel_exactness_preconditions
     Coplanar_side_of_bounded_circle_3() {}
     Coplanar_side_of_bounded_circle_3(const Coplanar_3& cp_,
@@ -3845,7 +3648,7 @@ namespace CartesianKernelFunctors {
     {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& t) const
     {
@@ -3865,11 +3668,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Equal_xy_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     {
       return CGAL_AND( p.x() == q.x() , p.y() == q.y() );
@@ -3879,11 +3682,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Equal_x_2
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_2    Point_2;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return p.x() == q.x(); }
   };
@@ -3891,11 +3694,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Equal_x_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.x() == q.x(); }
   };
@@ -3903,11 +3706,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Equal_y_2
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_2    Point_2;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return p.y() == q.y(); }
   };
@@ -3915,11 +3718,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Equal_y_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.y() == q.y(); }
   };
@@ -3927,11 +3730,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Equal_z_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.z() == q.z(); }
   };
@@ -3939,6 +3742,7 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Has_on_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::FT               FT;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Vector_3         Vector_3;
@@ -3949,30 +3753,29 @@ namespace CartesianKernelFunctors {
     typedef typename K::Triangle_3       Triangle_3;
     typedef typename K::Circle_3         Circle_3;
     typedef typename K::Sphere_3         Sphere_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Line_3& l, const Point_3& p) const
     { return l.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Ray_3& r, const Point_3& p) const
     { return r.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Segment_3& s, const Point_3& p) const
     { return s.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl, const Point_3& p) const
     { return pl.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl, const Line_3& l) const
     { return pl.rep().has_on(l); }
 
-    result_type
+    Boolean
     operator()( const Triangle_3& t, const Point_3& p) const
     {
       Point_3  o  = t.vertex(0) + t.supporting_plane().orthogonal_vector();
@@ -3986,19 +3789,19 @@ namespace CartesianKernelFunctors {
           && ((alpha+beta+gamma == denum));
     }
 
-    result_type
+    Boolean
     operator()(const Circle_3 &a, const Point_3 &p) const
     { return a.rep().has_on(p); }
 
-    Needs_FT<result_type>
+    Needs_FT<Boolean>
     operator()(const Sphere_3 &a, const Circle_3 &p) const
     { return a.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()(const Sphere_3 &a, const Point_3 &p) const
     { return a.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()(const Plane_3 &a, const Circle_3 &p) const
     { return a.rep().has_on(p); }
 
@@ -4008,11 +3811,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_distance_to_point_2
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Point_2   Point_2;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       return has_smaller_dist_to_pointC2(p.x(), p.y(),
@@ -4024,11 +3827,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_distance_to_point_3
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Point_3   Point_3;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       return has_smaller_dist_to_pointC3(p.x(), p.y(), p.z(),
@@ -4041,13 +3844,13 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_signed_distance_to_line_2
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Point_2   Point_2;
     typedef typename K::Line_2    Line_2;
     typedef typename K::Equal_2   Equal_2;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_2& a, const Point_2& b,
                const Point_2& c, const Point_2& d) const
     {
@@ -4059,7 +3862,7 @@ namespace CartesianKernelFunctors {
                                         d.x(), d.y()) == SMALLER;
     }
 
-    result_type
+    Boolean
     operator()(const Line_2& l, const Point_2& p, const Point_2& q) const
     {
       return has_smaller_signed_dist_to_directionC2(l.a(), l.b(),
@@ -4071,13 +3874,13 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_signed_distance_to_plane_3
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_3       Point_3;
     typedef typename K::Plane_3       Plane_3;
     typedef typename K::Collinear_3   Collinear_3;
-  public:
-    typedef typename K::Boolean       result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Plane_3& h, const Point_3& p, const Point_3& q) const
     {
       return has_smaller_signed_dist_to_directionC3(h.a(), h.b(), h.c(),
@@ -4085,7 +3888,7 @@ namespace CartesianKernelFunctors {
                                                     q.x(), q.y(), q.z());
     }
 
-    result_type
+    Boolean
     operator()( const Point_3& hp, const Point_3& hq,  const Point_3& hr,
                 const Point_3& p, const Point_3& q) const
     {
@@ -4102,16 +3905,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_xyz_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
     typedef typename K::Compare_xyz_3   Compare_xyz_3;
-    Compare_xyz_3 c;
-  public:
-    typedef typename K::Boolean         result_type;
 
+    Compare_xyz_3 c;
+
+  public:
     Less_xyz_3() {}
     Less_xyz_3(const Compare_xyz_3& c_) : c(c_) {}
 
-    result_type
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return c(p, q) == SMALLER; }
   };
@@ -4119,16 +3923,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_xy_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Compare_xy_2   Compare_xy_2;
-    Compare_xy_2 c;
-  public:
-    typedef typename K::Boolean        result_type;
 
+    Compare_xy_2 c;
+
+  public:
     Less_xy_2() {}
     Less_xy_2(const Compare_xy_2& c_) : c(c_) {}
 
-    result_type
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return c(p, q) == SMALLER; }
   };
@@ -4136,16 +3941,17 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_xy_3
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Compare_xy_3   Compare_xy_3;
-    Compare_xy_3 c;
-  public:
-    typedef typename K::Boolean        result_type;
 
+    Compare_xy_3 c;
+
+  public:
     Less_xy_3() {}
     Less_xy_3(const Compare_xy_3& c_) : c(c_) {}
 
-    result_type
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return c(p, q) == SMALLER; }
   };
@@ -4153,11 +3959,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_x_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Boolean        result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return p.x() < q.x(); }
   };
@@ -4165,11 +3971,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_x_3
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Boolean        result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.x() < q.x(); }
   };
@@ -4177,11 +3983,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_yx_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Boolean        result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     {
       return compare_lexicographically_xyC2(p.y(), p.x(),
@@ -4192,11 +3998,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_y_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Boolean        result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return p.y() < q.y(); }
   };
@@ -4204,11 +4010,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_y_3
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Boolean        result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.y() < q.y(); }
   };
@@ -4216,11 +4022,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Less_z_3
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Boolean        result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.z() < q.z(); }
   };
@@ -4228,24 +4034,25 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Orientation_2
   {
+    typedef typename K::Orientation   Orientation;
     typedef typename K::Point_2       Point_2;
     typedef typename K::Vector_2      Vector_2;
     typedef typename K::Circle_2      Circle_2;
-  public:
-    typedef typename K::Orientation   result_type;
 
-    result_type operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
+  public:
+    Orientation
+    operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       return orientationC2(p.x(), p.y(), q.x(), q.y(), r.x(), r.y());
     }
 
-    result_type
+    Orientation
     operator()(const Vector_2& u, const Vector_2& v) const
     {
       return orientationC2(u.x(), u.y(), v.x(), v.y());
     }
 
-    result_type
+    Orientation
     operator()(const Circle_2& c) const
     {
       return c.rep().orientation();
@@ -4255,14 +4062,14 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Orientation_3
   {
+    typedef typename K::Orientation    Orientation;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
     typedef typename K::Sphere_3       Sphere_3;
-  public:
-    typedef typename K::Orientation    result_type;
 
-    result_type
+  public:
+    Orientation
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     {
@@ -4272,7 +4079,7 @@ namespace CartesianKernelFunctors {
                            s.x(), s.y(), s.z());
     }
 
-    result_type
+    Orientation
     operator()( const Vector_3& u, const Vector_3& v, const Vector_3& w) const
     {
       return orientationC3(u.x(), u.y(), u.z(),
@@ -4280,7 +4087,7 @@ namespace CartesianKernelFunctors {
                            w.x(), w.y(), w.z());
     }
 
-    result_type
+    Orientation
     operator()( Origin, const Point_3& u,
                 const Point_3& v, const Point_3& w) const
     {
@@ -4289,13 +4096,13 @@ namespace CartesianKernelFunctors {
                            w.x(), w.y(), w.z());
     }
 
-    result_type
+    Orientation
     operator()( const Tetrahedron_3& t) const
     {
       return t.rep().orientation();
     }
 
-    result_type
+    Orientation
     operator()(const Sphere_3& s) const
     {
       return s.rep().orientation();
@@ -4306,10 +4113,8 @@ namespace CartesianKernelFunctors {
   class Power_side_of_oriented_power_circle_2
   {
   public:
-    typedef typename K::Weighted_point_2         Weighted_point_2;
     typedef typename K::Oriented_side            Oriented_side;
-
-    typedef Oriented_side                        result_type;
+    typedef typename K::Weighted_point_2         Weighted_point_2;
 
     Oriented_side operator()(const Weighted_point_2& p,
                              const Weighted_point_2& q,
@@ -4358,24 +4163,24 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Oriented_side_2
   {
+    typedef typename K::Oriented_side  Oriented_side;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Circle_2       Circle_2;
     typedef typename K::Line_2         Line_2;
     typedef typename K::Triangle_2     Triangle_2;
     typedef typename K::Segment_2      Segment_2;
     typedef typename K::FT             FT;
-  public:
-    typedef typename K::Oriented_side  result_type;
 
-    result_type
+  public:
+    Oriented_side
     operator()( const Circle_2& c, const Point_2& p) const
     { return enum_cast<Oriented_side>(c.bounded_side(p)) * c.orientation(); }
 
-    result_type
+    Oriented_side
     operator()( const Line_2& l, const Point_2& p) const
     { return side_of_oriented_lineC2(l.a(), l.b(), l.c(), p.x(), p.y()); }
 
-    result_type
+    Oriented_side
     operator()( const Triangle_2& t, const Point_2& p) const
     {
       typename K::Collinear_are_ordered_along_line_2
@@ -4389,7 +4194,8 @@ namespace CartesianKernelFunctors {
                   ot = orientation(t.vertex(0), t.vertex(1), t.vertex(2));
 
       if (o1 == ot && o2 == ot && o3 == ot) // ot cannot be COLLINEAR
-        return ot;
+        return enum_cast<Oriented_side>(ot);
+
       return
         (o1 == COLLINEAR
          && collinear_are_ordered_along_line(t.vertex(0), p, t.vertex(1))) ||
@@ -4397,11 +4203,10 @@ namespace CartesianKernelFunctors {
          && collinear_are_ordered_along_line(t.vertex(1), p, t.vertex(2))) ||
         (o3 == COLLINEAR
          && collinear_are_ordered_along_line(t.vertex(2), p, t.vertex(3)))
-        ? result_type(ON_ORIENTED_BOUNDARY)
-        : opposite(ot);
+        ? Oriented_side(ON_ORIENTED_BOUNDARY) : opposite(ot);
     }
 
-    result_type
+    Oriented_side
     operator()(const Segment_2& s, const Triangle_2& t) const
     {
       typename K::Construct_source_2 source;
@@ -4429,11 +4234,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Side_of_bounded_circle_2
   {
+    typedef typename K::Bounded_side   Bounded_side;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Bounded_side   result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Point_2& p, const Point_2& q, const Point_2& t) const
     {
       return side_of_bounded_circleC2(p.x(), p.y(),
@@ -4441,7 +4246,7 @@ namespace CartesianKernelFunctors {
                                       t.x(), t.y());
     }
 
-    result_type
+    Bounded_side
     operator()( const Point_2& p, const Point_2& q,
                 const Point_2& r, const Point_2& t) const
     {
@@ -4453,11 +4258,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Side_of_bounded_sphere_3
   {
+    typedef typename K::Bounded_side   Bounded_side;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Bounded_side   result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q, const Point_3& test) const
     {
       return side_of_bounded_sphereC3(p.x(), p.y(), p.z(),
@@ -4465,7 +4270,7 @@ namespace CartesianKernelFunctors {
                                       test.x(), test.y(), test.z());
     }
 
-    result_type
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& test) const
     {
@@ -4475,7 +4280,7 @@ namespace CartesianKernelFunctors {
                                       test.x(), test.y(), test.z());
     }
 
-    result_type
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q, const Point_3& r,
                 const Point_3& s, const Point_3& test) const
     {
@@ -4490,11 +4295,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Side_of_oriented_circle_2
   {
+    typedef typename K::Oriented_side  Oriented_side;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Oriented_side  result_type;
 
-    result_type
+  public:
+    Oriented_side
     operator()( const Point_2& p, const Point_2& q,
                 const Point_2& r, const Point_2& t) const
     {
@@ -4508,11 +4313,11 @@ namespace CartesianKernelFunctors {
   template <typename K>
   class Side_of_oriented_sphere_3
   {
+    typedef typename K::Oriented_side  Oriented_side;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Oriented_side  result_type;
 
-    result_type
+  public:
+    Oriented_side
     operator()( const Point_3& p, const Point_3& q, const Point_3& r,
                 const Point_3& s, const Point_3& test) const
     {
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/point_constructions_3.h b/Cartesian_kernel/include/CGAL/Cartesian/point_constructions_3.h
deleted file mode 100644
index 80afbff35e1..00000000000
--- a/Cartesian_kernel/include/CGAL/Cartesian/point_constructions_3.h
+++ /dev/null
@@ -1,50 +0,0 @@
-// Copyright (c) 2000
-// Utrecht University (The Netherlands),
-// ETH Zurich (Switzerland),
-// INRIA Sophia-Antipolis (France),
-// Max-Planck-Institute Saarbruecken (Germany),
-// and Tel-Aviv University (Israel).  All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org)
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s)     : Herve Bronnimann
-
-#ifndef CGAL_CARTESIAN_POINT_CONSTRUCTIONS_3_H
-#define CGAL_CARTESIAN_POINT_CONSTRUCTIONS_3_H
-
-#include <CGAL/Cartesian/Point_3.h>
-#include <CGAL/constructions/kernel_ftC3.h>
-
-namespace CGAL {
-
-template <class K>
-CGAL_KERNEL_LARGE_INLINE
-PointC3<K>
-point_on_plane(const PlaneC3<K> &p)
-{
-  typename K::FT x, y, z;
-  point_on_planeC3(p.a(), p.b(), p.c(), p.d(), x, y, z);
-  return PointC3<K>(x, y, z);
-}
-
-template <class K>
-CGAL_KERNEL_LARGE_INLINE
-PointC3<K>
-projection_plane(const PointC3<K> &p,
-                 const PlaneC3<K> &h)
-{
-  typename K::FT x, y, z;
-  projection_planeC3(h.a(), h.b(), h.c(), h.d(),
-                     p.x(), p.y(), p.z(),
-                     x, y, z);
-  return PointC3<K>(x, y, z);
-}
-
-} //namespace CGAL
-
-#endif // CGAL_CARTESIAN_POINT_CONSTRUCTIONS_3_H
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_2.h b/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_2.h
index 659b17f995f..3941d1b0fdf 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_2.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_2.h
@@ -24,7 +24,7 @@ namespace CGAL {
 
 template < class K >
 inline
-bool
+typename K::Boolean
 equal_xy(const PointC2<K> &p, const PointC2<K> &q)
 {
   return CGAL_AND( p.x() == q.x() , p.y() == q.y() );
@@ -34,7 +34,7 @@ equal_xy(const PointC2<K> &p, const PointC2<K> &q)
 // Unused, undocumented, un-functorized.
 template < class K >
 inline
-Comparison_result
+typename K::Comparison_result
 compare_deltax_deltay(const PointC2<K>& p,
                       const PointC2<K>& q,
                       const PointC2<K>& r,
@@ -46,7 +46,7 @@ compare_deltax_deltay(const PointC2<K>& p,
 
 template < class K >
 inline
-Comparison_result
+typename K::Comparison_result
 compare_lexicographically_yx(const PointC2<K> &p,
                              const PointC2<K> &q)
 {
diff --git a/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_3.h b/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_3.h
index c3a7d37aabf..35c2e3a2c32 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_3.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian/predicates_on_points_3.h
@@ -24,7 +24,7 @@ namespace CGAL {
 
 template < class K >
 inline
-bool
+typename K::Boolean
 equal_xy(const PointC3<K> &p, const PointC3<K> &q)
 {
   return K().equal_xy_3_object()(p, q);
@@ -32,7 +32,7 @@ equal_xy(const PointC3<K> &p, const PointC3<K> &q)
 
 template < class K >
 inline
-bool
+typename K::Boolean
 equal_xyz(const PointC3<K> &p, const PointC3<K> &q)
 {
   return p.x() == q.x() && p.y() == q.y() && p.z() == q.z();
@@ -40,7 +40,7 @@ equal_xyz(const PointC3<K> &p, const PointC3<K> &q)
 
 template < class K >
 inline
-Comparison_result
+typename K::Comparison_result
 compare_xy(const PointC3<K> &p, const PointC3<K> &q)
 {
   return K().compare_xy_3_object()(p, q);
@@ -48,7 +48,7 @@ compare_xy(const PointC3<K> &p, const PointC3<K> &q)
 
 template < class K >
 inline
-Comparison_result
+typename K::Comparison_result
 compare_lexicographically_xy(const PointC3<K> &p, const PointC3<K> &q)
 {
   return K().compare_xy_3_object()(p, q);
@@ -56,7 +56,7 @@ compare_lexicographically_xy(const PointC3<K> &p, const PointC3<K> &q)
 
 template < class K >
 inline
-bool
+typename K::Boolean
 lexicographically_xy_smaller_or_equal(const PointC3<K> &p,
                                       const PointC3<K> &q)
 {
@@ -65,7 +65,7 @@ lexicographically_xy_smaller_or_equal(const PointC3<K> &p,
 
 template < class K >
 inline
-bool
+typename K::Boolean
 lexicographically_xy_smaller(const PointC3<K> &p,
                              const PointC3<K> &q)
 {
@@ -74,7 +74,7 @@ lexicographically_xy_smaller(const PointC3<K> &p,
 
 template < class K >
 inline
-bool
+typename K::Boolean
 strict_dominance(const PointC3<K> &p,
                  const PointC3<K> &q)
 {
@@ -84,7 +84,7 @@ strict_dominance(const PointC3<K> &p,
 
 template < class K >
 inline
-bool
+typename K::Boolean
 dominance(const PointC3<K> &p,
           const PointC3<K> &q)
 {
diff --git a/Cartesian_kernel/include/CGAL/predicates/kernel_ftC2.h b/Cartesian_kernel/include/CGAL/predicates/kernel_ftC2.h
index 56903c2c921..1f1d912e0d2 100644
--- a/Cartesian_kernel/include/CGAL/predicates/kernel_ftC2.h
+++ b/Cartesian_kernel/include/CGAL/predicates/kernel_ftC2.h
@@ -421,6 +421,7 @@ typename Same_uncertainty_nt<Angle, FT>::type
 angleC2(const FT &ux, const FT &uy,
         const FT &vx, const FT &vy)
 {
+  typedef typename Same_uncertainty_nt<Angle, FT>::type Angle;
   return enum_cast<Angle>(CGAL_NTS sign(ux*vx + uy*vy));
 }
 
@@ -431,6 +432,7 @@ angleC2(const FT &px, const FT &py,
         const FT &qx, const FT &qy,
         const FT &rx, const FT &ry)
 {
+  typedef typename Same_uncertainty_nt<Angle, FT>::type Angle;
   return enum_cast<Angle>(CGAL_NTS sign((px-qx)*(rx-qx)+(py-qy)*(ry-qy)));
 }
 
@@ -442,6 +444,7 @@ angleC2(const FT &px, const FT &py,
         const FT &rx, const FT &ry,
         const FT &sx, const FT &sy)
 {
+  typedef typename Same_uncertainty_nt<Angle, FT>::type Angle;
   return enum_cast<Angle>(CGAL_NTS sign((px-qx)*(rx-sx)+(py-qy)*(ry-sy)));
 }
 
@@ -508,6 +511,7 @@ side_of_bounded_circleC2(const FT &px, const FT &py,
                          const FT &rx, const FT &ry,
                          const FT &tx, const FT &ty)
 {
+  typedef typename Same_uncertainty_nt<Bounded_side, FT>::type Bounded_side;
   return enum_cast<Bounded_side>( side_of_oriented_circleC2(px,py,qx,qy,rx,ry,tx,ty)
                                  * orientationC2(px,py,qx,qy,rx,ry) );
 }
@@ -520,8 +524,8 @@ side_of_bounded_circleC2(const FT &px, const FT &py,
                          const FT &tx, const FT &ty)
 {
   // Returns whether T lies inside or outside the circle which diameter is PQ.
-  return enum_cast<Bounded_side>(
-                      CGAL_NTS compare((tx-px)*(qx-tx), (ty-py)*(ty-qy)) );
+  typedef typename Same_uncertainty_nt<Bounded_side, FT>::type Bounded_side;
+  return enum_cast<Bounded_side>(CGAL_NTS compare((tx-px)*(qx-tx), (ty-py)*(ty-qy)) );
 }
 
 template < class FT >
@@ -630,7 +634,7 @@ side_of_oriented_lineC2(const FT &a, const FT &b, const FT &c,
 }
 
 template <class FT>
-Comparison_result
+typename Compare<FT>::result_type
 compare_power_distanceC2(const FT& px, const FT& py, const FT& pwt,
                          const FT& qx, const FT& qy, const FT& qwt,
                          const FT& rx, const FT& ry)
@@ -643,24 +647,25 @@ compare_power_distanceC2(const FT& px, const FT& py, const FT& pwt,
 
 template <class FT>
 CGAL_KERNEL_MEDIUM_INLINE
-Bounded_side
+typename Same_uncertainty_nt<Bounded_side, FT>::type
 power_side_of_bounded_power_circleC2(const FT &px, const FT &py, const FT &pw,
                                      const FT &qx, const FT &qy, const FT &qw,
                                      const FT &tx, const FT &ty, const FT &tw)
 {
+  typedef typename Same_uncertainty_nt<Bounded_side, FT>::type Bounded_side;
+
   FT dpx = px - qx;
   FT dpy = py - qy;
   FT dtx = tx - qx;
   FT dty = ty - qy;
   FT dpz = CGAL_NTS square(dpx) + CGAL_NTS square(dpy);
 
-  return enum_cast<Bounded_side>
-    (CGAL_NTS sign(-(CGAL_NTS square(dtx) + CGAL_NTS square(dty)-tw+qw)*dpz
+  return enum_cast<Bounded_side>(CGAL_NTS sign(-(CGAL_NTS square(dtx) + CGAL_NTS square(dty)-tw+qw)*dpz
                    +(dpz-pw+qw)*(dpx*dtx+dpy*dty)));
 }
 
 template <class FT>
-Oriented_side
+typename Same_uncertainty_nt<Oriented_side, FT>::type
 power_side_of_oriented_power_circleC2(const FT &px, const FT &py, const FT &pwt,
                                       const FT &qx, const FT &qy, const FT &qwt,
                                       const FT &rx, const FT &ry, const FT &rwt,
@@ -685,7 +690,7 @@ power_side_of_oriented_power_circleC2(const FT &px, const FT &py, const FT &pwt,
 }
 
 template <class FT>
-Oriented_side
+typename Same_uncertainty_nt<Oriented_side, FT>::type
 power_side_of_oriented_power_circleC2(const FT &px, const FT &py, const FT &pwt,
                                       const FT &qx, const FT &qy, const FT &qwt,
                                       const FT &tx, const FT &ty, const FT &twt)
@@ -709,7 +714,7 @@ power_side_of_oriented_power_circleC2(const FT &px, const FT &py, const FT &pwt,
 }
 
 template <class FT>
-Oriented_side
+typename Same_uncertainty_nt<Oriented_side, FT>::type
 circumcenter_oriented_side_of_oriented_segmentC2(const FT& ax,  const FT& ay,
                                                  const FT& bx,  const FT& by,
                                                  const FT& p0x, const FT& p0y,
diff --git a/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h b/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
index 86bf5f74bd2..2d6fe0e53be 100644
--- a/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
+++ b/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
@@ -143,6 +143,7 @@ typename Same_uncertainty_nt<Angle, FT>::type
 angleC3(const FT &ux, const FT &uy, const FT &uz,
         const FT &vx, const FT &vy, const FT &vz)
 {
+  typedef typename Same_uncertainty_nt<CGAL::Angle, FT>::type Angle;
   return enum_cast<Angle>(CGAL_NTS sign(ux*vx + uy*vy + uz*vz));
 }
 
@@ -153,6 +154,7 @@ angleC3(const FT &px, const FT &py, const FT &pz,
         const FT &qx, const FT &qy, const FT &qz,
         const FT &rx, const FT &ry, const FT &rz)
 {
+  typedef typename Same_uncertainty_nt<CGAL::Angle, FT>::type Angle;
   return enum_cast<Angle>(CGAL_NTS sign((px-qx)*(rx-qx)+
                                         (py-qy)*(ry-qy)+
                                         (pz-qz)*(rz-qz)));
@@ -166,6 +168,7 @@ angleC3(const FT &px, const FT &py, const FT &pz,
         const FT &rx, const FT &ry, const FT &rz,
         const FT &sx, const FT &sy, const FT &sz)
 {
+  typedef typename Same_uncertainty_nt<CGAL::Angle, FT>::type Angle;
   return enum_cast<Angle>(CGAL_NTS sign((px-qx)*(rx-sx)+
                                         (py-qy)*(ry-sy)+
                                         (pz-qz)*(rz-sz)));
@@ -220,6 +223,8 @@ coplanar_side_of_bounded_circleC3(const FT &px, const FT &py, const FT &pz,
                                   const FT &rx, const FT &ry, const FT &rz,
                                   const FT &tx, const FT &ty, const FT &tz)
 {
+  typedef typename Same_uncertainty_nt<CGAL::Bounded_side, FT>::type Bounded_side;
+
   // The approach is to compute side_of_bounded_sphere(p,q,r,t+v,t),
   // with v = pq ^ pr.
   // Note : since the circle defines the orientation of the plane, it can not
@@ -373,6 +378,7 @@ side_of_bounded_sphereC3(const FT &px, const FT &py, const FT &pz,
                          const FT &sx, const FT &sy, const FT &sz,
                          const FT &tx, const FT &ty, const FT &tz)
 {
+  typedef typename Same_uncertainty_nt<CGAL::Bounded_side, FT>::type Bounded_side;
   return enum_cast<Bounded_side>( side_of_oriented_sphereC3(px, py, pz,
                                                             qx, qy, qz,
                                                             rx, ry, rz,
@@ -392,6 +398,7 @@ side_of_bounded_sphereC3(const FT &px, const FT &py, const FT &pz,
                          const FT &tx, const FT &ty, const FT &tz)
 {
   // Returns whether T lies inside or outside the sphere which diameter is PQ.
+  typedef typename Same_uncertainty_nt<CGAL::Bounded_side, FT>::type Bounded_side;
   return enum_cast<Bounded_side>( CGAL_NTS sign((tx-px)*(qx-tx)
                                               + (ty-py)*(qy-ty)
                                               + (tz-pz)*(qz-tz)) );
@@ -420,9 +427,9 @@ side_of_bounded_sphereC3(const FT &px, const FT &py, const FT &pz,
 {
   // Returns whether T lies inside or outside the sphere which equatorial
   // circle is PQR.
+  typedef typename Same_uncertainty_nt<CGAL::Bounded_side, FT>::type Bounded_side;
 
   // This code is inspired by the one of circumcenterC3(3 points).
-
   FT psx = px-sx;
   FT psy = py-sy;
   FT psz = pz-sz;
@@ -688,7 +695,7 @@ power_side_of_oriented_power_sphereC3(const FT &pwt, const FT &qwt)
 }
 
 template < class FT >
-Comparison_result
+typename Compare<FT>::result_type
 compare_power_distanceC3(const FT &px, const FT &py, const FT &pz,
                          const FT &qx, const FT &qy, const FT &qz, const FT &qw,
                          const FT &rx, const FT &ry, const FT &rz, const FT &rw)
@@ -715,6 +722,8 @@ power_side_of_bounded_power_sphereC3(
     const FT &rx, const FT &ry, const FT &rz, const FT &rw,
     const FT &sx, const FT &sy, const FT &sz, const FT &sw)
 {
+  typedef typename Same_uncertainty_nt<Bounded_side, FT>::type Bounded_side;
+
   // Translate p to origin and compute determinants
   FT qpx = qx-px;
   FT qpy = qy-py;
@@ -765,6 +774,8 @@ power_side_of_bounded_power_sphereC3(
  const FT &qx, const FT &qy, const FT &qz, const FT &qw,
  const FT &rx, const FT &ry, const FT &rz, const FT &rw)
 {
+  typedef typename Same_uncertainty_nt<Bounded_side, FT>::type Bounded_side;
+
   FT FT2(2);
   FT dpx = px - qx;
   FT dpy = py - qy;
diff --git a/Circular_kernel_2/benchmark/README_benchmark_CK2.txt b/Circular_kernel_2/benchmark/README_benchmark_CK2.txt
index e4fd6e11799..c5ae6610dcf 100644
--- a/Circular_kernel_2/benchmark/README_benchmark_CK2.txt
+++ b/Circular_kernel_2/benchmark/README_benchmark_CK2.txt
@@ -64,7 +64,7 @@ In std::cerr :
 Only the time needed to compute it. (it is useful to benchmark a lot of cases and redirect it on a .txt)
 
 ATTENTION:
-1) dont use ./example a b
+1) don't use ./example a b
 with 5 <= a <= 8  and 0 <= b <= 8, we cannot use the Circulartraits to handle the files
 2) The files have to be put on a folder name DXF where the program is located
 
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/functor_has_on_2.cpp b/Circular_kernel_2/examples/Circular_kernel_2/functor_has_on_2.cpp
index eba947c1d37..8efde8736ee 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/functor_has_on_2.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/functor_has_on_2.cpp
@@ -5,6 +5,7 @@ typedef CGAL::Exact_circular_kernel_2             Circular_k;
 
 typedef CGAL::Point_2<Circular_k>                 Point_2;
 typedef CGAL::Circular_arc_2<Circular_k>          Circular_arc_2;
+typedef CGAL::Circular_arc_point_2<Circular_k>    Circular_arc_point_2;
 
 int main()
 {
@@ -13,8 +14,8 @@ int main()
 
   for(int i = 0; i <= 10; i++) {
     for(int j = 0; j <= 10; j++) {
-      Point_2 p = Point_2(i, j);
-      if(Circular_k().has_on_2_object()(c,p)) {
+      Circular_arc_point_2 cap(Point_2(i, j));
+      if(Circular_k().has_on_2_object()(c,cap)) {
         n++;
         std::cout << "(" << i << "," << j << ")" << std::endl;
       }
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Circular_arc_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Circular_arc_2.h
index 41334a5934e..e9641e82d1e 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Circular_arc_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Circular_arc_2.h
@@ -656,7 +656,7 @@ public:
       return CGAL::CircularFunctors::circular_arc_bbox<CK>(*this);
     }
 
-    // Dont use this function, it is only for internal use
+    // Don't use this function, it is only for internal use
     void _setx_info(unsigned short int v_is_x_monotone,
                   unsigned short int v_two_end_points_on_upper_part,
                   unsigned short int v_is_complementary_x_monotone) const {
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_circle_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_circle_2.h
index a1890928e7d..1454b4f9cff 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_circle_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_circle_2.h
@@ -31,25 +31,29 @@ namespace CGAL {
 namespace CircularFunctors {
 
   template < class CK >
-  class Construct_circle_2 : public CK::Linear_kernel::Construct_circle_2
+  class Construct_circle_2
+    // : public CK::Linear_kernel::Construct_circle_2
   {
-    typedef typename CK::Linear_kernel::Construct_circle_2 Base_functor;
-
     typedef typename CK::FT                         FT;
-    typedef typename CK::Linear_kernel::Point_2     Point_2;
+    typedef typename CK::Circle_2                   Circle_2;
+    typedef typename CK::Circular_arc_2             Circular_arc_2;
+
+    typedef typename CK::Linear_kernel::Construct_circle_2 Linear_Construct_circle_2;
+
   public:
-    typedef typename Base_functor::result_type result_type;
+    // using Linear_Construct_circle_2::operator();
 
-    using Base_functor::operator();
+    template <class... Args>
+    decltype(auto)
+    operator()(const Args&... args) const
+    { return Linear_Construct_circle_2()(args...); }
 
-    typedef typename CK::Circular_arc_2 Circular_arc_2;
-
-    result_type
+    Circle_2
     operator() ( const typename CK::Polynomial_for_circles_2_2 &eq ) {
       return construct_circle_2<CK>(eq);
     }
 
-    result_type
+    decltype(auto)
     operator() (const Circular_arc_2 & a) const {
       return (a.rep().supporting_circle());
     }
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_line_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_line_2.h
index fba7f0f1d74..8209e845a92 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_line_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_on_line_2.h
@@ -30,26 +30,32 @@ namespace CGAL {
 namespace LinearFunctors {
 
   template < class CK >
-  class Construct_line_2 : public  CK::Linear_kernel::Construct_line_2
+  class Construct_line_2
+    // : public CK::Linear_kernel::Construct_line_2
   {
-          typedef typename CK::Line_arc_2            Line_arc_2;
+    typedef typename CK::Line_arc_2            Line_arc_2;
     typedef typename CK::Line_2                Line_2;
-    public:
 
-    typedef typename CK::Linear_kernel::Construct_line_2::result_type
-      result_type;
-    using CK::Linear_kernel::Construct_line_2::operator();
+    typedef typename CK::Linear_kernel::Construct_line_2 Linear_Construct_circle_2;
 
-    result_type operator() (const Line_arc_2 & a) const
+  public:
+    // using CK::Linear_kernel::Construct_line_2::operator();
+
+    template <class... Args>
+    decltype(auto)
+    operator()(const Args&... args) const
+    { return Linear_Construct_circle_2()(args...); }
+
+    decltype(auto) operator() (const Line_arc_2 & a) const
     {
       return (a.rep().supporting_line());
     }
 
-    result_type
+    Line_2
     operator() ( const typename CK::Polynomial_1_2 &eq )
-      {
-              return construct_line_2<CK>(eq);
-      }
+    {
+      return construct_line_2<CK>(eq);
+    }
   };
 
 } // namespace LinearFunctors
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
index b68746e4a3d..e1e40b9bccc 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
@@ -30,148 +30,115 @@
 namespace CGAL {
 namespace CircularFunctors {
 
+#define CGAL_CIRCULAR_KERNEL_MACRO_FUNCTOR_COMPARE_(V)\
+template < class CK > \
+  class Compare_ ##V## _2 {\
+    /*: public CK::Linear_kernel::Compare_ ##V## _2{*/\
+    typedef typename CK::Comparison_result Comparison_result;\
+    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;\
+    typedef typename CK::Linear_kernel::Compare_ ##V## _2 Linear_Compare_ ##V## _2;\
+  public:\
+    template <class... Args>\
+    Comparison_result\
+    operator()(const Args&... args) const\
+    { return Linear_Compare_ ##V## _2()(args...); }\
+    /*using CK::Linear_kernel::Compare_ ##V## _2::operator();*/\
+    Comparison_result\
+    operator() (const Circular_arc_point_2 &p0,\
+                const Circular_arc_point_2 &p1) const\
+    { return CircularFunctors::compare_ ##V <CK>(p0, p1); }\
+  };\
 
-  template < class CK >
-  class Compare_x_2
-    : public CK::Linear_kernel::Compare_x_2
-  {
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
-    typedef typename CK::Point_2 Point_2;
+  CGAL_CIRCULAR_KERNEL_MACRO_FUNCTOR_COMPARE_(x)
+  CGAL_CIRCULAR_KERNEL_MACRO_FUNCTOR_COMPARE_(y)
+  CGAL_CIRCULAR_KERNEL_MACRO_FUNCTOR_COMPARE_(xy)
 
-  public:
-
-    typedef typename CK::Linear_kernel::Compare_x_2::result_type result_type;
-    using CK::Linear_kernel::Compare_x_2::operator();
-
-    result_type
-    operator() (const Circular_arc_point_2 &p0,
-                const Circular_arc_point_2 &p1) const
-    { return CircularFunctors::compare_x<CK>(p0, p1);}
-
-  };
-
-
-  template < class CK >
-  class Compare_y_2
-    : public CK::Linear_kernel::Compare_y_2
-  {
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
-    typedef typename CK::Point_2 Point_2;
-
-  public:
-
-    typedef typename CK::Linear_kernel::Compare_y_2::result_type result_type;
-    using CK::Linear_kernel::Compare_y_2::operator();
-
-    result_type
-    operator() (const Circular_arc_point_2 &p0,
-                const Circular_arc_point_2 &p1) const
-    {return CircularFunctors::compare_y<CK>(p0, p1);}
-
-  };
-
-  template < class CK >
-  class Compare_xy_2
-    : public CK::Linear_kernel::Compare_xy_2
-  {
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
-    typedef typename CK::Point_2 Point_2;
-
-  public:
-
-    typedef typename CK::Linear_kernel::Compare_xy_2::result_type result_type;
-    using CK::Linear_kernel::Compare_xy_2::operator();
-
-    result_type
-    operator() (const Circular_arc_point_2 &p0,
-                const Circular_arc_point_2 &p1) const
-    { return CircularFunctors::compare_xy<CK>(p0, p1);}
-
-  };
+#undef CGAL_CIRCULAR_KERNEL_MACRO_FUNCTOR_COMPARE_
 
   template < class CK >
   class In_x_range_2
   {
+    typedef typename CK::Boolean                 Boolean;
     typedef typename CK::Circular_arc_2          Circular_arc_2;
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
+    typedef typename CK::Circular_arc_point_2    Circular_arc_point_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
 
   public:
-    typedef bool         result_type;
-
-    result_type
+    Boolean
     operator()(const Circular_arc_2 &a, const Circular_arc_point_2 &p) const
     { return CircularFunctors::point_in_x_range<CK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Line_arc_2 &a, const Circular_arc_point_2 &p) const
     { return CircularFunctors::point_in_x_range<CK>(a, p); }
-
   };
 
-
   template < class CK >
   class Has_on_2
-    : public CK::Linear_kernel::Has_on_2
+    // : public CK::Linear_kernel::Has_on_2
   {
+    typedef typename CK::Boolean                 Boolean;
     typedef typename CK::Circular_arc_2          Circular_arc_2;
     typedef typename CK::Circular_arc_point_2    Circular_arc_point_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
     typedef typename CK::Circle_2                Circle_2;
     typedef typename CK::Line_2                  Line_2;
 
+    typedef typename CK::Linear_kernel::Has_on_2 Linear_Has_on_2;
+
   public:
-          typedef typename CK::Linear_kernel::Has_on_2::result_type result_type;
+    // using CK::Linear_kernel::Has_on_2::operator();
 
-    using CK::Linear_kernel::Has_on_2::operator();
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Has_on_2()(a, b); }
 
-    result_type
+    Boolean
     operator()(const Circle_2 &a, const Circular_arc_point_2 &p) const
     { return CircularFunctors::has_on<CK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Line_2 &a, const Circular_arc_point_2 &p) const
     { return LinearFunctors::has_on<CK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Circular_arc_2 &a, const Circular_arc_point_2 &p) const
     { return CircularFunctors::has_on<CK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Line_arc_2 &a, const Circular_arc_point_2 &p) const
     { return CircularFunctors::has_on<CK>(a, p); }
-
   };
 
   template < class CK >
   class Compare_y_to_right_2
   {
+    typedef typename CK::Comparison_result        Comparison_result;
     typedef typename CK::Circular_arc_2           Circular_arc_2;
-    typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
+    typedef typename CK::Circular_arc_point_2     Circular_arc_point_2;
     typedef typename CK::Line_arc_2               Line_arc_2;
 
   public:
-    typedef CGAL::Comparison_result result_type;
-
-    result_type
+    Comparison_result
     operator()(const Circular_arc_2 &a1,
                const Circular_arc_2 &a2,
                const Circular_arc_point_2 &p) const
     { return CircularFunctors::compare_y_to_right<CK>(a1, a2, p); }
 
-    result_type
+    Comparison_result
     operator()(const Line_arc_2 &a1,
                const Line_arc_2 &a2,
                const Circular_arc_point_2 &p) const
     { return CircularFunctors::compare_y_to_right<CK>(a1, a2, p); }
 
-    result_type
+    Comparison_result
     operator()(const Line_arc_2 &a1,
                const Circular_arc_2 &a2,
                const Circular_arc_point_2 &p) const
     { return CircularFunctors::compare_y_to_right<CK>(a1, a2, p); }
 
-    result_type
+    Comparison_result
     operator()(const Circular_arc_2 &a1,
                const Line_arc_2 &a2,
                const Circular_arc_point_2 &p) const
@@ -179,21 +146,16 @@ namespace CircularFunctors {
         return CGAL::SMALLER;
       return CGAL::LARGER;
     }
-
   };
 
   template < class CK >
   class Equal_2
-  : public CK::Linear_kernel::Equal_2
+    // : public CK::Linear_kernel::Equal_2
   {
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
+    typedef typename CK::Boolean                 Boolean;
+    typedef typename CK::Circular_arc_point_2    Circular_arc_point_2;
     typedef typename CK::Circular_arc_2          Circular_arc_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
-
-  public:
-    typedef typename  CK::Linear_kernel LK;
-    typedef typename LK::Equal_2 LK_Equal_2;
-
     typedef typename CK::Point_2 Point_2;
     typedef typename CK::Vector_2 Vector_2;
     typedef typename CK::Direction_2 Direction_2;
@@ -204,69 +166,78 @@ namespace CircularFunctors {
     typedef typename CK::Iso_rectangle_2 Iso_rectangle_2;
     typedef typename CK::Circle_2 Circle_2;
 
+    typedef typename  CK::Linear_kernel::Equal_2 Linear_Equal_2;
 
-    typedef typename CK::Linear_kernel::Equal_2::result_type result_type;
-    using CK::Linear_kernel::Equal_2::operator();
+  public:
+    // using CK::Linear_kernel::Equal_2::operator();
 
-    result_type
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const {
+      return Linear_Equal_2()(a, b);
+    }
+
+    Boolean
     operator() (const Circular_arc_point_2 &p0,
                 const Circular_arc_point_2 &p1) const
     { return CircularFunctors::equal<CK>(p0, p1); }
 
-    result_type
+    Boolean
     operator() (const Circular_arc_2 &a0, const Circular_arc_2 &a1) const
     { return CircularFunctors::equal<CK>(a0, a1); }
 
-    result_type
+    Boolean
     operator() (const Line_arc_2 &a0, const Line_arc_2 &a1) const
     { return CircularFunctors::equal<CK>(a0, a1); }
-
    };
 
   template < class CK >
-  class Compare_y_at_x_2 : public CK::Linear_kernel::Compare_y_at_x_2
+  class Compare_y_at_x_2
+    // : public CK::Linear_kernel::Compare_y_at_x_2
   {
+    typedef typename CK::Comparison_result       Comparison_result;
     typedef typename CK::Circular_arc_2          Circular_arc_2;
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
+    typedef typename CK::Circular_arc_point_2    Circular_arc_point_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
 
+    typedef typename CK::Linear_kernel::Compare_y_at_x_2 Linear_Compare_y_at_x_2;
+
   public:
-    typedef typename CK::Linear_kernel::Compare_y_at_x_2::result_type   result_type;
+    // using CK::Linear_kernel::Compare_y_at_x_2::operator();
 
-    using CK::Linear_kernel::Compare_y_at_x_2::operator();
+    template <class... Args>
+    Comparison_result
+    operator()(const Args&... args) const
+    { return Linear_Compare_y_at_x_2()(args...); }
 
-    result_type
+    Comparison_result
     operator() (const Circular_arc_point_2 &p,
                 const Circular_arc_2 &A1) const
     { return CircularFunctors::compare_y_at_x<CK>(p, A1); }
 
-    result_type
+    Comparison_result
     operator() (const Circular_arc_point_2 &p,
                 const Line_arc_2 &A1) const
     { return CircularFunctors::compare_y_at_x<CK>(p, A1); }
-
   };
 
   template < class CK >
   class Do_overlap_2
   {
+    typedef typename CK::Boolean        Boolean;
     typedef typename CK::Circular_arc_2 Circular_arc_2;
     typedef typename CK::Line_arc_2     Line_arc_2;
 
   public:
-    typedef bool         result_type;
-
-    result_type
+    Boolean
     operator() (const Circular_arc_2 &A1, const Circular_arc_2 &A2) const
     { return CircularFunctors::do_overlap<CK>(A1, A2); }
 
-    result_type
+    Boolean
     operator() (const Line_arc_2 &A1, const Line_arc_2 &A2) const
     { return CircularFunctors::do_overlap<CK>(A1, A2); }
-
   };
 
-
   template < class CK >
   class Make_x_monotone_2
   {
@@ -274,9 +245,6 @@ namespace CircularFunctors {
     typedef typename CK::Line_arc_2 Line_arc_2;
 
   public:
-
-     typedef void         result_type;   //!!!
-
     template < class OutputIterator >
     OutputIterator
     operator()(const Circular_arc_2 &A, OutputIterator res) const
@@ -290,7 +258,6 @@ namespace CircularFunctors {
     {
       return CircularFunctors::make_x_monotone<CK>(A,res);
     }
-
   };
 
  template < class CK >
@@ -300,9 +267,6 @@ namespace CircularFunctors {
     typedef typename CK::Line_arc_2 Line_arc_2;
 
   public:
-
-     typedef void         result_type;   //!!!
-
     template < class OutputIterator >
     OutputIterator
     operator()(const Circular_arc_2 &A, OutputIterator res) const
@@ -326,19 +290,21 @@ namespace CircularFunctors {
     { *res++ = make_object(A);
       return res;
     }
-
   };
 
   template < class CK >
   class Do_intersect_2
-    : public CK::Linear_kernel::Do_intersect_2
+    // : public CK::Linear_kernel::Do_intersect_2
   {
+    typedef typename CK::Boolean                 Boolean;
+
+    typedef typename CK::Linear_kernel::Do_intersect_2 Linear_Do_intersect_2;
+
   public:
-    typedef typename CK::Linear_kernel::Do_intersect_2::result_type   result_type;
-    template <class T1, class T2>
-    result_type
-    operator()(const T1& t1, const T2& t2) const
-    { return Intersections::internal::do_intersect(t1, t2, CK()); }
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Intersections::internal::do_intersect(a, b, CK()); }
   };
 
   template < class CK >
@@ -347,14 +313,12 @@ namespace CircularFunctors {
   //using the Lazy_kernel as linear kernel.
     //: public CK::Linear_kernel::Intersect_2
   {
-
     typedef typename CK::Circle_2                 Circle;
     typedef typename CK::Circular_arc_2           Circular_arc;
     typedef typename CK::Line_arc_2               Line_arc;
     typedef typename CK::Line_2                   Line;
 
     public:
-
     //using CK::Linear_kernel::Intersect_2::operator();
 
     template<class A, class B>
@@ -460,7 +424,6 @@ namespace CircularFunctors {
       *res++=typename CK::Linear_kernel::Intersect_2()(l1, l2);
       return res;
     }
-
   };
 
   template < class CK >
@@ -470,61 +433,61 @@ namespace CircularFunctors {
 
     typename CK::Polynomial_1_2
     operator() ( const typename CK::Line_2 & l )
-      {
-              return LinearFunctors::get_equation<CK>(l);
-      }
+    {
+      return LinearFunctors::get_equation<CK>(l);
+    }
 
     typename CK::Polynomial_for_circles_2_2
     operator() ( const typename CK::Circle_2 & c )
-      {
-        return CircularFunctors::get_equation<CK>(c);
-                  }
+    {
+      return CircularFunctors::get_equation<CK>(c);
+    }
   };
 
   template < class CK >
   class Split_2
   {
     typedef typename CK::Circular_arc_2          Circular_arc_2;
-    typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
+    typedef typename CK::Circular_arc_point_2    Circular_arc_point_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
 
   public:
-
-    typedef void         result_type;
-
-    result_type
+    void
     operator()(const Circular_arc_2 &A,
                const Circular_arc_point_2 &p,
                Circular_arc_2 &ca1, Circular_arc_2 &ca2) const
     { return CircularFunctors::split<CK>(A, p, ca1, ca2); }
 
-
-    result_type
+    void
     operator()(const Line_arc_2 &A,
                const Circular_arc_point_2 &p,
                Line_arc_2 &ca1, Line_arc_2 &ca2) const
     { return CircularFunctors::split<CK>(A, p, ca1, ca2); }
-
   };
 
   template < class CK >
   class Is_vertical_2
-    : public CK::Linear_kernel::Is_vertical_2
+    // : public CK::Linear_kernel::Is_vertical_2
   {
+    typedef typename CK::Boolean                 Boolean;
     typedef typename CK::Circular_arc_2          Circular_arc_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
 
+    typedef typename CK::Linear_kernel::Is_vertical_2 Linear_Is_vertical_2;
+
   public:
+    // using CK::Linear_kernel::Is_vertical_2::operator();
 
-          typedef typename CK::Linear_kernel::Is_vertical_2::result_type result_type;
+    template <typename A>
+    Boolean
+    operator()(const A& a) const
+    { return Linear_Is_vertical_2()(a); }
 
-    using CK::Linear_kernel::Is_vertical_2::operator();
-
-    result_type
+    Boolean
     operator()(const Circular_arc_2 &A) const
     { return CircularFunctors::is_vertical<CK>(A); }
 
-    result_type
+    Boolean
     operator()(const Line_arc_2 &A) const
     { return CircularFunctors::is_vertical<CK>(A); }
 
@@ -533,56 +496,51 @@ namespace CircularFunctors {
   template < class CK >
   class Construct_circular_arc_2
   {
-
     typedef typename CK::FT                           FT;
-    typedef typename CK::RT                           RT;
     typedef typename CK::Point_2                      Point_2;
     typedef typename CK::Line_2                       Line_2;
     typedef typename CK::Circle_2                     Circle_2;
     typedef typename CK::Circular_arc_2               Circular_arc_2;
-    typedef typename CK::Kernel_base::Circular_arc_2  RCircular_arc_2;
     typedef typename Circular_arc_2::Rep              Rep;
     typedef typename CK::Circular_arc_point_2         Circular_arc_point_2;
 
   public:
-    typedef  Circular_arc_2 result_type;
-
-    result_type
+    Circular_arc_2
     operator()(void)
     { return Rep(); }
 
-    result_type
+    Circular_arc_2
     operator()(const Circle_2 &c) const
     { return Rep(c); }
 
-    result_type
+    Circular_arc_2
     operator()(const Circle_2 &support,
                const Circular_arc_point_2 &source,
                const Circular_arc_point_2 &target) const
     { return Rep(support,source,target); }
 
     // Not Documented
-    result_type
+    Circular_arc_2
     operator()(const Circle_2 &support,
                const Line_2 &l1, bool b1,
                const Line_2 &l2, bool b2) const
     { return Rep(support,l1,b1,l2,b2); }
 
     // Not Documented
-    result_type
+    Circular_arc_2
     operator()(const Circle_2 &c,
                const Circle_2 &c1, bool b_1,
                const Circle_2 &c2, bool b_2) const
     { return Rep(c,c1,b_1,c2,b_2); }
 
-    result_type
+    Circular_arc_2
     operator()(const Point_2 &begin,
                const Point_2 &middle,
                const Point_2 &end) const
     { return Rep(begin,middle,end); }
 
     // Not Documented
-    result_type
+    Circular_arc_2
     operator()(const Point_2 &begin,
                const Point_2 &end,
                const FT& bulge) const
@@ -600,47 +558,44 @@ namespace CircularFunctors {
     typedef typename CK::Circular_arc_point_2      Circular_arc_point_2;
     typedef typename CK::Segment_2                 Segment_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
-    typedef typename CK::Kernel_base::Line_arc_2   RLine_arc_2;
     typedef typename Line_arc_2::Rep               Rep;
 
   public:
-    typedef Line_arc_2   result_type;
-
-    result_type
+    Line_arc_2
     operator()(void)
     { return Rep(); }
 
     // Not Documented
-    result_type
+    Line_arc_2
     operator()(const Line_2 &support,
                const Circle_2 &c1,const bool b1,
                const Circle_2 &c2,const bool b2) const
     { return Rep(support,c1,b1,c2,b2); }
 
     // Not Documented
-    result_type
+    Line_arc_2
     operator()(const Line_2 &support,
                const Line_2 &l1,
                const Line_2 &l2) const
     { return Rep(support,l1,l2); }
 
-    result_type
+    Line_arc_2
     operator()(const Line_2 &support,
                const Circular_arc_point_2 &p1,
                const Circular_arc_point_2 &p2) const
     { return Rep(support,p1,p2); }
 
-//     result_type
+//     Line_arc_2
 //     operator()(const Line_2 &support,
 //                const Point_2 &p1,
 //                const Point_2 &p2) const
 //     { return Rep(support,p1,p2); }
 
-    result_type
+    Line_arc_2
     operator()(const Segment_2 &s) const
     { return Rep(s); }
 
-    result_type
+    Line_arc_2
     operator()(const Point_2 &p1,
                const Point_2 &p2) const
     { return Rep(p1,p2); }
@@ -652,40 +607,32 @@ namespace CircularFunctors {
   {
     typedef typename CK::Point_2               Point_2;
     typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
-    typedef typename CK::Kernel_base::Circular_arc_point_2
-                                               RCircular_arc_point_2;
     typedef typename Circular_arc_point_2::Rep Rep;
     typedef typename Circular_arc_point_2::Root_for_circles_2_2
                                                Root_for_circles_2_2;
 
   public:
-    typedef Circular_arc_point_2 result_type;
-
-    result_type
+    Circular_arc_point_2
     operator()(void)
     { return Rep(); }
 
-    result_type
+    Circular_arc_point_2
     operator()(const Root_for_circles_2_2 & np) const
     { return Rep(np); }
 
-    result_type
+    Circular_arc_point_2
     operator()(const Point_2 & p) const
     { return Rep(p); }
 
   };
 
-
   template <class CK>
   class Compute_circular_x_2
   {
     typedef typename CK::Circular_arc_point_2   Circular_arc_point_2;
-    typedef typename CK::Root_of_2                 Root_of_2;
 
   public:
-    typedef const Root_of_2&            result_type;
-
-    result_type operator() (const Circular_arc_point_2 & a) const
+    decltype(auto) operator() (const Circular_arc_point_2 & a) const
     {
       return (a.rep().x());
     }
@@ -696,13 +643,9 @@ namespace CircularFunctors {
   class Compute_circular_y_2
   {
     typedef typename CK::Circular_arc_point_2   Circular_arc_point_2;
-    typedef typename CK::Root_of_2                 Root_of_2;
 
   public:
-
-    typedef const Root_of_2&            result_type;
-
-    result_type operator() (const Circular_arc_point_2 & a) const
+    decltype(auto) operator() (const Circular_arc_point_2 & a) const
     {
       return (a.rep().y());
     }
@@ -714,17 +657,14 @@ namespace CircularFunctors {
   {
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
-    typedef typename CK::Circular_arc_point_2      Circular_arc_point_2;
 
   public:
-    typedef const Circular_arc_point_2 &  result_type;
-
-    result_type operator() (const Circular_arc_2 & a) const
+    decltype(auto) operator() (const Circular_arc_2& a) const
     {
       return (a.rep().left());
     }
 
-    result_type operator() (const Line_arc_2 & a) const
+    decltype(auto) operator() (const Line_arc_2& a) const
     {
       return (a.rep().left());
     }
@@ -736,18 +676,14 @@ namespace CircularFunctors {
   {
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
-    typedef typename CK::Circular_arc_point_2   Circular_arc_point_2;
 
   public:
-
-    typedef const Circular_arc_point_2& result_type;
-
-    result_type operator() (const Circular_arc_2 & a) const
+    decltype(auto) operator() (const Circular_arc_2& a) const
     {
       return (a.rep().right());
     }
 
-    result_type operator() (const Line_arc_2 & a) const
+    decltype(auto) operator() (const Line_arc_2& a) const
     {
       return (a.rep().right());
     }
@@ -759,16 +695,12 @@ namespace CircularFunctors {
   {
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
-    typedef typename CK::Circular_arc_point_2   Circular_arc_point_2;
 
   public:
-
-    typedef const Circular_arc_point_2& result_type;
-
-    result_type operator() (const Circular_arc_2 & a) const
+    decltype(auto) operator() (const Circular_arc_2& a) const
     { return a.rep().source(); }
 
-    result_type operator() (const Line_arc_2 & a) const
+    decltype(auto) operator() (const Line_arc_2& a) const
     { return a.rep().source();}
 
   };
@@ -779,16 +711,12 @@ namespace CircularFunctors {
   {
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
-    typedef typename CK::Circular_arc_point_2   Circular_arc_point_2;
 
   public:
-
-    typedef const Circular_arc_point_2& result_type;
-
-    result_type operator() (const Circular_arc_2 & a) const
+    decltype(auto) operator() (const Circular_arc_2& a) const
     { return a.rep().target();}
 
-    result_type operator() (const Line_arc_2 & a) const
+    decltype(auto) operator() (const Line_arc_2& a) const
     { return a.rep().target();}
 
   };
@@ -796,19 +724,17 @@ namespace CircularFunctors {
   template <class CK>
   class Is_x_monotone_2
   {
+    typedef typename CK::Boolean                   Boolean;
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
 
   public:
-
-    typedef bool         result_type;
-
-    result_type operator() (const Circular_arc_2 & a) const
+    Boolean operator() (const Circular_arc_2 & a) const
     {
       return (a.rep().is_x_monotone());
     }
 
-    result_type operator() (const Line_arc_2 & a) const
+    Boolean operator() (const Line_arc_2 & a) const
     {
       return (a.rep().is_x_monotone());
     }
@@ -818,19 +744,17 @@ namespace CircularFunctors {
   template <class CK>
   class Is_y_monotone_2
   {
+    typedef typename CK::Boolean                   Boolean;
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
 
   public:
-
-    typedef bool         result_type;
-
-    result_type operator() (const Circular_arc_2 & a) const
+    Boolean operator() (const Circular_arc_2& a) const
     {
       return (a.rep().is_y_monotone());
     }
 
-    result_type operator() (const Line_arc_2 & a) const
+    Boolean operator() (const Line_arc_2& a) const
     {
       return (a.rep().is_y_monotone());
     }
@@ -839,48 +763,58 @@ namespace CircularFunctors {
 
   template <class CK>
   class Construct_bbox_2
-    : public CK::Linear_kernel::Construct_bbox_2
+    // : public CK::Linear_kernel::Construct_bbox_2
   {
     typedef typename CK::Circular_arc_2            Circular_arc_2;
     typedef typename CK::Circular_arc_point_2      Circular_arc_point_2;
     typedef typename CK::Line_arc_2                Line_arc_2;
     typedef typename CK::Circle_2                  Circle_2;
 
+    typedef typename CK::Linear_kernel::Construct_bbox_2 Linear_Construct_bbox_2;
+
   public:
+    // using CK::Linear_kernel::Construct_bbox_2::operator();
 
-    typedef typename CK::Linear_kernel::Construct_bbox_2::result_type result_type;
-    using CK::Linear_kernel::Construct_bbox_2::operator();
+    template <typename A>
+    decltype(auto)
+    operator()(const A& a) const
+    { return Linear_Construct_bbox_2()(a); }
 
-    result_type operator() (const Circular_arc_point_2 & a) const
+    decltype(auto) operator() (const Circular_arc_point_2& a) const
     {
       return a.rep().bbox();
     }
 
-    result_type operator() (const Circular_arc_2 & a) const
+    decltype(auto) operator() (const Circular_arc_2& a) const
     {
       return a.rep().bbox();
     }
 
-    result_type operator() (const Line_arc_2 & a) const
+    decltype(auto) operator() (const Line_arc_2& a) const
     {
       return a.rep().bbox();
     }
-
   };
 
   template <class CK>
   class Bounded_side_2
-    : public CK::Linear_kernel::Bounded_side_2
+    // : public CK::Linear_kernel::Bounded_side_2
   {
+    typedef typename CK::Bounded_side          Bounded_side;
     typedef typename CK::Circle_2              Circle_2;
     typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
 
+    typedef typename CK::Linear_kernel::Bounded_side_2 Linear_Bounded_side_2;
+
   public:
-    typedef typename CK::Linear_kernel::Bounded_side_2::result_type result_type;
+    // using CK::Linear_kernel::Bounded_side_2::operator();
 
-    using CK::Linear_kernel::Bounded_side_2::operator();
+    template <typename A, typename B>
+    Bounded_side
+    operator()(const A& a, const B& b) const
+    { return Linear_Bounded_side_2()(a, b); }
 
-    result_type
+    Bounded_side
     operator()(const Circle_2& c, const Circular_arc_point_2& p) const
     { return CircularFunctors::bounded_side<CK>(c,p); }
 
@@ -888,17 +822,23 @@ namespace CircularFunctors {
 
   template <class CK>
   class Has_on_bounded_side_2
-    : public CK::Linear_kernel::Has_on_bounded_side_2
+    // : public CK::Linear_kernel::Has_on_bounded_side_2
   {
+    typedef typename CK::Boolean               Boolean;
     typedef typename CK::Circle_2              Circle_2;
     typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
 
+    typedef typename CK::Linear_kernel::Has_on_bounded_side_2 Linear_Has_on_bounded_side_2;
+
   public:
-    typedef typename CK::Linear_kernel::Has_on_bounded_side_2::result_type result_type;
+    // using CK::Linear_kernel::Has_on_bounded_side_2::operator();
 
-    using CK::Linear_kernel::Has_on_bounded_side_2::operator();
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Has_on_bounded_side_2()(a, b); }
 
-    result_type
+    Boolean
     operator()(const Circle_2& c, const Circular_arc_point_2& p) const
     { return CK().bounded_side_2_object()(c,p) == ON_BOUNDED_SIDE; }
 
@@ -906,20 +846,25 @@ namespace CircularFunctors {
 
   template <class CK>
   class Has_on_unbounded_side_2
-    : public CK::Linear_kernel::Has_on_unbounded_side_2
+    // : public CK::Linear_kernel::Has_on_unbounded_side_2
   {
+    typedef typename CK::Boolean               Boolean;
     typedef typename CK::Circle_2              Circle_2;
     typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
 
+    typedef typename CK::Linear_kernel::Has_on_unbounded_side_2 Linear_Has_on_unbounded_side_2;
+
   public:
-    typedef typename CK::Linear_kernel::Has_on_unbounded_side_2::result_type result_type;
+    // using CK::Linear_kernel::Has_on_unbounded_side_2::operator();
 
-    using CK::Linear_kernel::Has_on_unbounded_side_2::operator();
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Has_on_unbounded_side_2()(a, b); }
 
-    result_type
+    Boolean
     operator()(const Circle_2& c, const Circular_arc_point_2& p) const
     { return CK().bounded_side_2_object()(c,p) == ON_UNBOUNDED_SIDE; }
-
   };
 
 #ifndef CGAL_NO_DEPRECATED_CODE
@@ -927,31 +872,21 @@ namespace CircularFunctors {
   class Construct_supporting_circle_2
   {
     typedef typename CK::Circular_arc_2            Circular_arc_2;
-    typedef typename CK::Circle_2                  Circle_2;
 
   public:
-
-    typedef Circle_2             result_type;
-
-    CGAL_DEPRECATED result_type operator() (const Circular_arc_2 & a) const
+    CGAL_DEPRECATED decltype(auto) operator() (const Circular_arc_2 & a) const
     {
       return a.rep().supporting_circle();
     }
   };
 
-
   template <class CK>
   class Construct_supporting_line_2
   {
     typedef typename CK::Line_arc_2            Line_arc_2;
-    typedef typename CK::Line_2                Line_2;
-    typedef typename CK::Circle_2              Circle_2;
 
   public:
-
-    typedef Line_2               result_type;
-
-    CGAL_DEPRECATED result_type operator() (const Line_arc_2 & a) const
+    CGAL_DEPRECATED decltype(auto) operator() (const Line_arc_2 & a) const
     {
       return a.rep().supporting_line();
     }
@@ -960,24 +895,28 @@ namespace CircularFunctors {
 
   template <typename CK>
   class Construct_center_2
-            : public CK::Linear_kernel::Construct_center_2
+    // : public CK::Linear_kernel::Construct_center_2
   {
     typedef typename CK::Circular_arc_2  Circular_arc_2;
-  public:
-    typedef typename CK::Linear_kernel::Construct_center_2::result_type result_type;
-   using CK::Linear_kernel::Construct_center_2::operator();
 
-    result_type
+    typedef typename CK::Linear_kernel::Construct_center_2 Linear_Construct_center_2;
+
+  public:
+    // using CK::Linear_kernel::Construct_center_2::operator();
+
+    template <typename A>
+    decltype(auto)
+    operator()(const A& a) const
+    { return Linear_Construct_center_2()(a); }
+
+    decltype(auto)
     operator()(const Circular_arc_2& c) const
     { return c.rep().center(); }
-
   };
 
   template <typename CK>
   class Compute_squared_radius_2
   {
-
-  private:
     typedef typename CK::Circular_arc_2  Circular_arc_2;
     typedef typename CK::Linear_kernel LK;
     typedef typename LK::Compute_squared_radius_2 LK_Compute_squared_radius_2;
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_intersections.h b/Circular_kernel_2/include/CGAL/Circular_kernel_intersections.h
index 9a3ca3b1a89..ae9453be1c0 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_intersections.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_intersections.h
@@ -54,7 +54,7 @@ namespace Intersections { \
   } \
 template <class K> \
 inline \
-bool \
+typename K::Boolean \
 do_intersect(const A <K> &c1, const B <K> &c2) \
 { \
   return typename K::Do_intersect_2()(c1, c2); \
diff --git a/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/bbox_filtered_predicates.h b/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/bbox_filtered_predicates.h
index 90fbdc38534..53b554c95b8 100644
--- a/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/bbox_filtered_predicates.h
+++ b/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/bbox_filtered_predicates.h
@@ -33,6 +33,7 @@ namespace Bbox_functors {
 template <class BK>
 class Compare_x_2 : public BK::Circular_kernel:: template Base< BK >::Type::Compare_x_2
 {
+  typedef typename BK::Comparison_result                       Comparison_result;
   typedef typename BK::Circular_arc_point_2                    Circular_arc_point_2;
   typedef typename BK::Point_2                                 Point_2;
   typedef typename BK::Circular_kernel::
@@ -40,12 +41,9 @@ class Compare_x_2 : public BK::Circular_kernel:: template Base< BK >::Type::Comp
   typedef CK_Compare_x_2 Base;
 
 public:
-
-  typedef typename CK_Compare_x_2::result_type result_type;
-
   using Base::operator();
 
-  result_type
+  Comparison_result
   operator()( const Circular_arc_point_2 &a, const Circular_arc_point_2 &b) const
   {
     Bbox_2 bb1=a.bbox(),bb2=b.bbox();
@@ -65,16 +63,15 @@ public:
 template <class BK>
 class Compare_y_2 : public BK::Circular_kernel:: template Base< BK >::Type::Compare_y_2
 {
+  typedef typename BK::Comparison_result                       Comparison_result;
   typedef typename BK::Circular_arc_point_2                    Circular_arc_point_2;
   typedef typename BK::Point_2                                 Point_2;
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::Compare_y_2                     CK_Compare_y_2;
   typedef CK_Compare_y_2 Base;
+
 public:
-
-  typedef typename CK_Compare_y_2::result_type result_type;
-
-  result_type
+  Comparison_result
   operator() (const Point_2 &p0,
               const Point_2 &p1) const
   {
@@ -83,7 +80,7 @@ public:
 
   using Base::operator();
 
-  result_type
+  Comparison_result
   operator()( const Circular_arc_point_2 &a, const Circular_arc_point_2 &b) const
   {
     Bbox_2 bb1=a.bbox(),bb2=b.bbox();
@@ -105,17 +102,15 @@ class Compare_xy_2 : public BK::Circular_kernel:: template Base< BK >::Type::Com
   typedef typename BK::Circular_kernel::
   template Base< BK >::Type::Compare_xy_2                      CK_Compare_xy_2;
   typedef CK_Compare_xy_2 Base;
+
+  typedef typename BK::Comparison_result                       Comparison_result;
   typedef typename BK::Circular_arc_point_2                    Circular_arc_point_2;
   typedef typename BK::Point_2                                 Point_2;
 
 public:
-
-  typedef typename Base::result_type result_type;
-
   using Base::operator();
-public:
 
-  result_type
+  Comparison_result
   operator()( const Circular_arc_point_2 &a, const Circular_arc_point_2 &b) const
   {
     typename BK::Compare_x_2 compx;
@@ -137,20 +132,18 @@ class In_x_range_2 : public BK::Circular_kernel:: template Base< BK >::Type::In_
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::In_x_range_2                    CK_In_x_range_2;
   typedef CK_In_x_range_2 Base;
+
+  typedef typename BK::Boolean                                 Boolean;
   typedef typename BK::Circular_arc_point_2                    Circular_arc_point_2;
   typedef typename BK::Circular_arc_2                          Circular_arc_2;
   typedef typename BK::Line_arc_2                              Line_arc_2;
 
 public:
-
-  typedef typename CK_In_x_range_2::result_type result_type;
-
   using Base::operator();
 
 private:
-
   template <class Arc_2>
-  result_type
+  Boolean
   _in_x_range_2(const Arc_2 &a, const Circular_arc_point_2 &p) const
   {
 
@@ -179,42 +172,36 @@ private:
   }
 
 public:
-
-  result_type
+  Boolean
   operator()( const Circular_arc_2 &a, const Circular_arc_point_2 &p) const
   {
     CGAL_precondition( a.is_x_monotone());
     return _in_x_range_2(a,p);
   }
 
-  result_type
+  Boolean
   operator()( const Line_arc_2 &a, const Circular_arc_point_2 &p) const
   { return _in_x_range_2(a,p);}
-
-
 };
 
-
 template <class BK>
 class Compare_y_at_x_2 : public BK::Circular_kernel:: template Base< BK >::Type::Compare_y_at_x_2
 {
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::Compare_y_at_x_2                         CK_Compare_y_at_x_2;
   typedef CK_Compare_y_at_x_2 Base;
+
+  typedef typename BK::Comparison_result                                Comparison_result;
   typedef typename BK::Circular_arc_2                                   Circular_arc_2;
   typedef typename BK::Circular_arc_point_2                             Circular_arc_point_2;
   typedef typename BK::Line_arc_2                                       Line_arc_2;
 
 public:
-
-  typedef typename CK_Compare_y_at_x_2::result_type result_type;
-
   using Base::operator();
 
 private:
-
   template <class Arc_2>
-  result_type
+  Comparison_result
   _compare_y_at_x_2(const Circular_arc_point_2 &p,const Arc_2 &a) const
   {
     CGAL_precondition_code(bool tmp=In_x_range_2<BK>()(a,p));
@@ -232,41 +219,36 @@ private:
   }
 
 public:
-
-  result_type
+  Comparison_result
   operator()( const Circular_arc_point_2 &p,const Circular_arc_2 &a ) const
   {
     CGAL_precondition( a.is_x_monotone());
     return _compare_y_at_x_2(p,a);
   }
 
-  result_type
+  Comparison_result
   operator()( const Circular_arc_point_2 &p,const Line_arc_2 &a ) const
   {return _compare_y_at_x_2(p,a);}
-
 };
 
-
 template <class BK>
 class Has_on_2 : public BK::Circular_kernel:: template Base< BK >::Type::Has_on_2
 {
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::Has_on_2                                 CK_Has_on_2;
   typedef CK_Has_on_2 Base;
+
+  typedef typename BK::Boolean                                          Boolean;
   typedef typename BK::Circular_arc_2                                   Circular_arc_2;
   typedef typename BK::Circular_arc_point_2                             Circular_arc_point_2;
   typedef typename BK::Line_arc_2                                       Line_arc_2;
 
 public:
-
-  typedef typename CK_Has_on_2::result_type result_type;
-
   using Base::operator();
 
 private:
-
   template <class Arc_2>
-  result_type
+  Boolean
   _has_on_2(const Arc_2 &a, const Circular_arc_point_2 &p) const
   {
     Bbox_2 bb1=a.bbox(),bb2=p.bbox();
@@ -278,27 +260,26 @@ private:
   }
 
 public:
-
-  result_type
+  Boolean
   operator()( const Circular_arc_2 &a,const Circular_arc_point_2 &p ) const
   {
     CGAL_precondition( a.is_x_monotone());
     return _has_on_2(a,p);
   }
 
-  result_type
+  Boolean
   operator()( const Line_arc_2 &a, const Circular_arc_point_2 &p ) const
   {return _has_on_2(a,p);}
-
 };
 
-
 template <class BK>
 class Equal_2
   : public BK::Circular_kernel:: template Base< BK >::Type::Equal_2
 {
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::Equal_2                                  CK_Equal_2;
+
+  typedef typename BK::Boolean                                          Boolean;
   typedef typename BK::Circular_arc_2                                   Circular_arc_2;
   typedef typename BK::Point_2                                          Point_2;
   typedef typename BK::Direction_2                                      Direction_2;
@@ -315,15 +296,11 @@ class Equal_2
   typedef CK_Equal_2 Base;
 
 public:
-
-  typedef typename CK_Equal_2::result_type result_type;
-
   using Base::operator();
 
 private:
-
   template <class Arc_2>
-  result_type
+  Boolean
   _equal_2(const Arc_2 &a,const Arc_2 &b) const
   {
     Bbox_2 bb11=a.source().bbox(),
@@ -346,8 +323,7 @@ private:
   }
 
 public:
-
-  result_type
+  Boolean
   operator()( const Circular_arc_point_2 &a ,
               const Circular_arc_point_2 &b) const
   {
@@ -361,14 +337,15 @@ public:
 
   /* WAS THAT HERE FOR OTHER COMPILERS THAN VC* ???
   // redefine to solve ambiguous call error
-  result_type
+  Boolean
   operator()( const Point_2 &a ,
   const Point_2 &b) const
   {
   return CK_Equal_2()( a, b);
   }
   */
-  result_type
+
+  Boolean
   operator()( const Circular_arc_2 &a , const Circular_arc_2 &b ) const
   {
     CGAL_precondition( a.is_x_monotone());
@@ -377,17 +354,17 @@ public:
     return _equal_2(a,b);
   }
 
-  result_type
+  Boolean
   operator()( const Line_arc_2 &a ,
               const Line_arc_2 &b ) const
   {  return _equal_2(a,b);}
 
-  result_type
+  Boolean
   operator()( const Circular_arc_2 & ,
               const Line_arc_2 & ) const
   {  return false;}
 
-  result_type
+  Boolean
   operator()( const Line_arc_2 & ,
               const Circular_arc_2 & ) const
   {  return false;}
@@ -401,19 +378,17 @@ class Do_overlap_2 : public BK::Circular_kernel:: template Base< BK >::Type::Do_
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::Do_overlap_2                           CK_Do_overlap_2;
   typedef CK_Do_overlap_2 Base;
+
+  typedef typename BK::Boolean                                        Boolean;
   typedef typename BK::Circular_arc_2                                 Circular_arc_2;
   typedef typename BK::Line_arc_2                                     Line_arc_2;
 
 public:
-
-  typedef typename CK_Do_overlap_2::result_type result_type;
-
   using Base::operator();
 
 private:
-
   template <class Arc_2>
-  result_type
+  Boolean
   _do_overlap_2(const Arc_2 &a, const Arc_2 &b) const
   {
     Bbox_2 bb1=a.bbox(),bb2=b.bbox();
@@ -424,10 +399,8 @@ private:
     return false;
   }
 
-
 public:
-
-  result_type
+  Boolean
   operator()( const Circular_arc_2 &a , const Circular_arc_2 &b ) const
   {
     CGAL_precondition( a.is_x_monotone());
@@ -435,28 +408,26 @@ public:
     return _do_overlap_2(a,b);
   }
 
-  result_type
+  Boolean
   operator()( const Line_arc_2 &a ,
               const Line_arc_2 &b ) const
   {  return _do_overlap_2(a,b);}
 
-  result_type
+  Boolean
   operator()( const Circular_arc_2 & ,
               const Line_arc_2 & ) const
   {  return false;}
 
-  result_type
+  Boolean
   operator()( const Line_arc_2 & ,
               const Circular_arc_2 & ) const
   {  return false;}
 
 };
 
-
 template < class BK >
 class Intersect_2 : public BK::Circular_kernel:: template Base< BK >::Type::Intersect_2
 {
-public:
   typedef typename BK::Circular_kernel::
     template Base< BK >::Type::Intersect_2      CK_Intersect_2;
 
@@ -466,6 +437,7 @@ public:
   typedef typename BK::Circle_2                 Circle;
   typedef typename BK::Line_2                   Line_2;
 
+public:
   using CK_Intersect_2::operator();
 
   template < class OutputIterator >
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Circular_kernel_3.txt b/Circular_kernel_3/doc/Circular_kernel_3/Circular_kernel_3.txt
index 937d438332f..5f5ca1dc107 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Circular_kernel_3.txt
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Circular_kernel_3.txt
@@ -24,7 +24,7 @@ for which we refer the user to the \ref chapterkernel23 "2D and 3D Linear Kernel
 \section sectionSKobjects Spherical Kernel Objects
 
 New main geometric objects are introduced by `Spherical_kernel_3`:
-circular arcs ((model of `SphericalKernel::CircularArc_3`), points
+circular arcs (model of `SphericalKernel::CircularArc_3`), points
 of circular arcs (model of `SphericalKernel::CircularArcPoint_3`),
 and line segments (model of `SphericalKernel::LineArc_3`) whose
 endpoints are points of this new type.
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--XCriticalPoints.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--XCriticalPoints.h
index b0dd39cd691..07be44cd4fe 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--XCriticalPoints.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--XCriticalPoints.h
@@ -25,7 +25,7 @@ operator()(const AlgebraicKernelForSpheres::Polynomial_for_spheres_2_3 &p,
 OutputIterator res);
 
 /*!
-Computes the `i`th `x`-critical point of polynomial `p`.
+Computes the `i`-th `x`-critical point of polynomial `p`.
 */
 template < class OutputIterator >
 AlgebraicKernelForSpheres::Root_for_spheres_2_3
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--YCriticalPoints.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--YCriticalPoints.h
index 9fd4f5445df..cd7569ddb0f 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--YCriticalPoints.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--YCriticalPoints.h
@@ -25,7 +25,7 @@ operator()(const AlgebraicKernelForSpheres::Polynomial_for_spheres_2_3 &p,
 OutputIterator res);
 
 /*!
-Computes the `i`th `y`-critical point of polynomial `p`.
+Computes the `i`-th `y`-critical point of polynomial `p`.
 */
 template < class OutputIterator >
 AlgebraicKernelForSpheres::Root_for_spheres_2_3
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--ZCriticalPoints.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--ZCriticalPoints.h
index b589dc78525..99baff709ad 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--ZCriticalPoints.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--ZCriticalPoints.h
@@ -25,7 +25,7 @@ operator()(const AlgebraicKernelForSpheres::Polynomial_for_spheres_2_3 &p,
 OutputIterator res);
 
 /*!
-Computes the `i`th `z`-critical point of polynomial `p`.
+Computes the `i`-th `z`-critical point of polynomial `p`.
 */
 template < class OutputIterator >
 AlgebraicKernelForSpheres::Root_for_spheres_2_3
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/dependencies b/Circular_kernel_3/doc/Circular_kernel_3/dependencies
index bc945e6454c..47c71fadee2 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/dependencies
+++ b/Circular_kernel_3/doc/Circular_kernel_3/dependencies
@@ -1,3 +1,4 @@
+Algebraic_foundations
 Circular_kernel_2
 Kernel_23
 Number_types
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
index 99eb521e1fa..aad283a9b18 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
@@ -211,7 +211,7 @@ public:
 
   const Root_for_spheres_2_3 & coordinates() const { return get_pointee_or_identity(base); }
 
-  const CGAL::Bbox_3 bbox() const {
+  CGAL::Bbox_3 bbox() const {
     return get_pointee_or_identity(base).bbox();
   }
 
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h
index de30249490d..9bd639cce02 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h
@@ -168,7 +168,7 @@ namespace CGAL {
         return begin_less_xyz_than_end() ? target() : source();
       }
 
-      const CGAL::Bbox_3 bbox() const {
+      CGAL::Bbox_3 bbox() const {
         return source().bbox() + target().bbox();
       }
 
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h
index ff7119586a5..c2940aa42d7 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/function_objects_polynomial_sphere.h
@@ -42,21 +42,27 @@ namespace SphericalFunctors {
 
 #define CGAL_SPHERICAL_KERNEL_MACRO_FUNCTOR_COMPARE_(V)\
 template < class SK > \
-  class Compare_ ##V## _3: public SK::Linear_kernel::Compare_ ##V## _3{\
+  class Compare_ ##V## _3 {\
+    /*: public SK::Linear_kernel::Compare_ ##V## _3{*/\
+    typedef typename SK::Comparison_result Comparison_result;\
     typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;\
     typedef typename SK::Point_3 Point_3;\
+    typedef typename SK::Linear_kernel::Compare_ ##V## _3 Linear_Compare_ ##V## _3;\
   public:\
-    typedef  typename SK::Linear_kernel::Compare_ ##V## _3::result_type result_type;\
-    using SK::Linear_kernel::Compare_ ##V## _3::operator();\
-    result_type\
+    template <typename A, typename B> \
+    Comparison_result\
+    operator()(const A& a, const B& b) const\
+    { return Linear_Compare_ ##V## _3()(a, b); }\
+    /*using SK::Linear_kernel::Compare_ ##V## _3::operator();*/\
+    Comparison_result\
     operator() (const Circular_arc_point_3 &p0,\
                 const Circular_arc_point_3 &p1) const\
     { return SphericalFunctors::compare_ ##V <SK>(p0, p1); }\
-    result_type\
+    Comparison_result\
     operator() (const Circular_arc_point_3 &p0,\
                 const Point_3 &p1) const\
     { return SphericalFunctors::compare_ ##V <SK>(p0, p1); }\
-    result_type\
+    Comparison_result\
     operator() (const Point_3 &p0,\
                 const Circular_arc_point_3 &p1) const\
     { return SphericalFunctors::compare_ ##V <SK>(p0, p1); }\
@@ -68,17 +74,16 @@ template < class SK > \
   CGAL_SPHERICAL_KERNEL_MACRO_FUNCTOR_COMPARE_(xy)
   CGAL_SPHERICAL_KERNEL_MACRO_FUNCTOR_COMPARE_(xyz)
 
+#undef CGAL_SPHERICAL_KERNEL_MACRO_FUNCTOR_COMPARE_
+
   template <class SK>
   class Compute_circular_x_3
   {
     typedef typename SK::Circular_arc_point_3   Circular_arc_point_3;
-    typedef typename SK::Root_of_2              Root_of_2;
 
   public:
-
-    typedef const Root_of_2&                    result_type;
-
-    result_type operator() (const Circular_arc_point_3 & a) const
+    // SK::Root_of_2
+    decltype(auto) operator() (const Circular_arc_point_3 & a) const
     { return (a.rep().x()); }
   };
 
@@ -86,13 +91,10 @@ template < class SK > \
   class Compute_circular_y_3
   {
     typedef typename SK::Circular_arc_point_3   Circular_arc_point_3;
-    typedef typename SK::Root_of_2                 Root_of_2;
 
   public:
-
-    typedef  const Root_of_2&  result_type;
-
-    result_type operator() (const Circular_arc_point_3 & a) const
+    // SK::Root_of_2
+    decltype(auto) operator() (const Circular_arc_point_3 & a) const
     { return (a.rep().y()); }
   };
 
@@ -100,23 +102,18 @@ template < class SK > \
   class Compute_circular_z_3
   {
     typedef typename SK::Circular_arc_point_3   Circular_arc_point_3;
-    typedef typename SK::Root_of_2                 Root_of_2;
 
   public:
-
-    typedef const Root_of_2&  result_type;
-
-    result_type operator() (const Circular_arc_point_3 & a) const
+    // SK::Root_of_2
+    decltype(auto) operator() (const Circular_arc_point_3 & a) const
     { return (a.rep().z()); }
   };
 
   template < class SK >
   class Equal_3
-    : public SK::Linear_kernel::Equal_3
+    // : public SK::Linear_kernel::Equal_3
   {
-    typedef typename SK::Linear_kernel LK;
-    typedef typename LK::Equal_3 LK_Equal_3;
-
+    typedef typename SK::Boolean Boolean;
     typedef typename SK::Point_3 Point_3;
     typedef typename SK::Vector_3 Vector_3;
     typedef typename SK::Direction_3 Direction_3;
@@ -134,35 +131,39 @@ template < class SK > \
     typedef typename SK::Line_arc_3               Line_arc_3;
     typedef typename SK::Circular_arc_3           Circular_arc_3;
 
+    typedef typename SK::Linear_kernel::Equal_3 Linear_equal_3;
+
   public:
+    // using SK::Linear_kernel::Equal_3::operator();
 
-    typedef typename SK::Linear_kernel::Equal_3::result_type result_type;
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_equal_3()(a, b); }
 
-    using SK::Linear_kernel::Equal_3::operator();
-
-    result_type
+    Boolean
     operator() (const Circular_arc_point_3 &c0,
                 const Circular_arc_point_3 &c1) const
     { return SphericalFunctors::equal<SK>(c0, c1); }
 
-    result_type
+    Boolean
     operator() (const Circular_arc_point_3 &c0,
                 const Point_3 &c1) const
     { return SphericalFunctors::equal<SK>(c0, Circular_arc_point_3(c1)); }
 
-    result_type
+    Boolean
     operator() (const Point_3 &c0,
                 const Circular_arc_point_3 &c1) const
     { return SphericalFunctors::equal<SK>(Circular_arc_point_3(c0), c1); }
 
-    // Our Line_arc_3 dont have orientation
-    result_type
+    // Our Line_arc_3 doesn't have orientation
+    Boolean
     operator() (const Line_arc_3 &l0,
                 const Line_arc_3 &l1) const
     { return SphericalFunctors::equal<SK>(l0, l1); }
 
-    // Our Circular_arc_3 dont have orientation (as parameter)
-    result_type
+    // Our Circular_arc_3 doesn't have orientation (as parameter)
+    Boolean
     operator() (const Circular_arc_3 &c0,
                 const Circular_arc_3 &c1) const
     { return SphericalFunctors::equal<SK>(c0, c1); }
@@ -184,29 +185,26 @@ template < class SK > \
     typedef typename Circular_arc_point_3::Root_for_spheres_2_3  Root_for_spheres_2_3;
 
   public:
-    typedef  Circular_arc_point_3 result_type;
-
-    result_type
+    Circular_arc_point_3
     operator()(void)
     { return Rep(); }
 
-    result_type
-      operator()(const Root_of_2 & x,
-                 const Root_of_2 & y,
-                 const Root_of_2 & z
-                 ) const
+    Circular_arc_point_3
+    operator()(const Root_of_2 & x,
+               const Root_of_2 & y,
+               const Root_of_2 & z) const
     { return Rep(x,y,z); }
 
-    result_type
+    Circular_arc_point_3
     operator()(const Root_for_spheres_2_3 & np) const
     { return Rep(np); }
 
-    result_type
+    Circular_arc_point_3
     operator()(const Point_3 & p) const
     { return Rep(p); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Sphere_3 & s1,
                const Sphere_3 & s2,
                const Sphere_3 & s3,
@@ -214,7 +212,7 @@ template < class SK > \
     { return Rep(s1,s2,s3,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Plane_3 & p,
                const Sphere_3 & s1,
                const Sphere_3 & s2,
@@ -222,7 +220,7 @@ template < class SK > \
     { return Rep(p,s1,s2,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Sphere_3 & s1,
                const Plane_3 & p,
                const Sphere_3 & s2,
@@ -230,7 +228,7 @@ template < class SK > \
     { return Rep(p,s1,s2,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Sphere_3 & s1,
                const Sphere_3 & s2,
                const Plane_3 & p,
@@ -238,7 +236,7 @@ template < class SK > \
     { return Rep(p,s1,s2,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Plane_3 & p1,
                const Plane_3 & p2,
                const Sphere_3 & s,
@@ -246,7 +244,7 @@ template < class SK > \
     { return Rep(p1,p2,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Plane_3 & p1,
                const Sphere_3 & s,
                const Plane_3 & p2,
@@ -254,7 +252,7 @@ template < class SK > \
     { return Rep(p1,p2,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Sphere_3 & s,
                const Plane_3 & p1,
                const Plane_3 & p2,
@@ -262,42 +260,42 @@ template < class SK > \
     { return Rep(p1,p2,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Line_3 & l,
                const Sphere_3 & s,
                const bool less_xyz = true) const
     { return Rep(l,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Sphere_3 & s,
                const Line_3 & l,
                const bool less_xyz = true) const
     { return Rep(l,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Circle_3 & c,
                const Sphere_3 & s,
                const bool less_xyz = true) const
     { return Rep(c,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Sphere_3 & s,
                const Circle_3 & c,
                const bool less_xyz = true) const
     { return Rep(c,s,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Circle_3 & c,
                const Plane_3 & p,
                const bool less_xyz = true) const
     { return Rep(c,p,less_xyz); }
 
     // Not Documented
-    result_type
+    Circular_arc_point_3
     operator()(const Plane_3 & p,
                const Circle_3 & c,
                const bool less_xyz = true) const
@@ -309,83 +307,78 @@ template < class SK > \
   class Construct_sphere_3
   {
     typedef typename SK::Circular_arc_3 Circular_arc_3;
-    typedef typename SK::Linear_kernel LK;
-    typedef typename LK::Point_3 Point_3;
-    typedef typename LK::Circle_3 Circle_3;
-    typedef typename LK::Sphere_3 Sphere_3;
+    typedef typename SK::Sphere_3       Sphere_3;
+    typedef typename SK::Point_3        Point_3;
+    typedef typename SK::Circle_3       Circle_3;
+    typedef typename SK::FT             FT;
+
+    typedef typename SK::Linear_kernel  LK;
     typedef typename LK::Construct_sphere_3 LK_Construct_sphere_3;
-    typedef typename LK::FT FT;
 
   public:
-
-    typedef typename SK::Linear_kernel::Construct_sphere_3::result_type result_type;
-
-    result_type
+    Sphere_3
     operator()( Return_base_tag tag, const Point_3& center, const FT& squared_radius,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(tag, center, squared_radius, orientation); }
 
-    result_type
+    Sphere_3
     operator()( Return_base_tag tag, const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     { return LK_Construct_sphere_3()(tag, p, q, r, s); }
 
-    result_type
+    Sphere_3
     operator()( Return_base_tag tag, const Point_3& p, const Point_3& q, const Point_3& r,
                 Orientation orientation  = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(tag, p, q, r, orientation); }
 
-    result_type
+    Sphere_3
     operator()( Return_base_tag tag, const Point_3& p, const Point_3& q,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(tag, p, q, orientation); }
 
-    result_type
+    Sphere_3
     operator()( Return_base_tag tag, const Point_3& center,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(tag, center, orientation); }
 
-    result_type
+    decltype(auto)
     operator() (Return_base_tag tag, const Circle_3 & c) const
     { return LK_Construct_sphere_3()(tag, c); }
 
-
-
-
-    result_type
+    Sphere_3
     operator()( const Point_3& center, const FT& squared_radius,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(center, squared_radius, orientation); }
 
-    result_type
+    Sphere_3
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     { return LK_Construct_sphere_3()(p, q, r, s); }
 
-    result_type
+    Sphere_3
     operator()( const Point_3& p, const Point_3& q, const Point_3& r,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(p, q, r, orientation); }
 
-    result_type
+    Sphere_3
     operator()( const Point_3& p, const Point_3& q,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(p, q, orientation); }
 
-    result_type
+    Sphere_3
     operator()( const Point_3& center,
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return LK_Construct_sphere_3()(center, orientation); }
 
-    result_type
+    decltype(auto)
     operator() (const Circle_3 & c) const
     { return LK_Construct_sphere_3()(c); }
 
-    result_type
+    Sphere_3
     operator() ( const typename SK::Polynomial_for_spheres_2_3 &eq )
     { return SphericalFunctors::construct_sphere_3<SK>(eq); }
 
-    result_type operator() (const Circular_arc_3 & c) const
+    decltype(auto) operator() (const Circular_arc_3 & c) const
     { return c.rep().diametral_sphere(); }
 
   };
@@ -394,98 +387,92 @@ template < class SK > \
   class Construct_plane_3
   {
     typedef typename SK::Circular_arc_3 Circular_arc_3;
+    typedef typename SK::RT             RT;
+    typedef typename SK::Point_3        Point_3;
+    typedef typename SK::Vector_3       Vector_3;
+    typedef typename SK::Direction_3    Direction_3;
+    typedef typename SK::Line_3         Line_3;
+    typedef typename SK::Ray_3          Ray_3;
+    typedef typename SK::Segment_3      Segment_3;
+    typedef typename SK::Plane_3        Plane_3;
+    typedef typename SK::Circle_3       Circle_3;
+
     typedef typename SK::Linear_kernel LK;
     typedef typename LK::Construct_plane_3 LK_Construct_plane_3;
-    typedef typename LK::RT           RT;
-    typedef typename LK::Point_3      Point_3;
-    typedef typename LK::Vector_3     Vector_3;
-    typedef typename LK::Direction_3  Direction_3;
-    typedef typename LK::Line_3       Line_3;
-    typedef typename LK::Ray_3        Ray_3;
-    typedef typename LK::Segment_3    Segment_3;
-    typedef typename LK::Plane_3      Plane_3;
-    typedef typename LK::Circle_3     Circle_3;
 
   public:
-
-    typedef typename SK::Linear_kernel::Construct_plane_3::result_type result_type;
-
-  public:
-
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const RT& a, const RT& b, const RT& c, const RT& d) const
     { return LK_Construct_plane_3()(tag, a, b, c, d); }
 
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const Point_3& p, const Point_3& q, const Point_3& r) const
     { return LK_Construct_plane_3()(tag, p, q, r); }
 
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const Point_3& p, const Direction_3& d) const
     { return LK_Construct_plane_3()(tag, p, d); }
 
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const Point_3& p, const Vector_3& v) const
     { return LK_Construct_plane_3()(tag, p, v); }
 
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const Line_3& l, const Point_3& p) const
     { return LK_Construct_plane_3()(tag, l, p); }
 
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const Ray_3& r, const Point_3& p) const
     { return LK_Construct_plane_3()(tag, r, p); }
 
-    result_type
+    Plane_3
     operator()(Return_base_tag tag, const Segment_3& s, const Point_3& p) const
     { return LK_Construct_plane_3()(tag, s, p); }
 
-    result_type
+    decltype(auto)
     operator()(Return_base_tag tag, const Circle_3 & c) const
     { return LK_Construct_plane_3()(tag, c); }
 
-    result_type
+    Plane_3
     operator()(const RT& a, const RT& b, const RT& c, const RT& d) const
     { return this->operator()(Return_base_tag(), a, b, c, d); }
 
-    result_type
+    Plane_3
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     { return this->operator()(Return_base_tag(), p, q, r); }
 
-    result_type
+    Plane_3
     operator()(const Point_3& p, const Direction_3& d) const
     { return this->operator()(Return_base_tag(), p, d); }
 
-    result_type
+    Plane_3
     operator()(const Point_3& p, const Vector_3& v) const
     { return this->operator()(Return_base_tag(), p, v); }
 
-    result_type
+    Plane_3
     operator()(const Line_3& l, const Point_3& p) const
     { return this->operator()(Return_base_tag(), l, p); }
 
-    result_type
+    Plane_3
     operator()(const Ray_3& r, const Point_3& p) const
     { return this->operator()(Return_base_tag(), r, p); }
 
-    result_type
+    Plane_3
     operator()(const Segment_3& s, const Point_3& p) const
     { return this->operator()(Return_base_tag(), s, p); }
 
-    result_type
+    decltype(auto)
     operator()(const Circle_3 & c) const
     { return this->operator()(Return_base_tag(), c); }
 
-    result_type
+    Plane_3
     operator() ( const typename SK::Polynomial_1_3 &eq )
     { return SphericalFunctors::construct_plane_3<SK>(eq); }
 
-    result_type operator() (const Circular_arc_3 & c) const
+    decltype(auto) operator() (const Circular_arc_3 & c) const
     { return c.rep().supporting_plane(); }
   };
 
-
-
   template <class SK>
   class Construct_line_3
   {
@@ -498,54 +485,53 @@ template < class SK > \
     typedef typename SK::Ray_3 Ray_3;
   public:
     typedef typename SK::Linear_kernel::Construct_line_3 LK_Construct_line_3;
-    typedef typename LK_Construct_line_3::result_type result_type;
 
-    result_type
+    Line_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q) const
     { return LK_Construct_line_3()(p, Vector_3(p, q)); }
 
-    result_type
+    Line_3
     operator()(Return_base_tag, const Point_3& p, const Direction_3& d) const
     { return operator()(Return_base_tag(), p, Vector_3(d.dx(), d.dy(), d.dz())); }
 
-    result_type
+    Line_3
     operator()(Return_base_tag, const Point_3& p, const Vector_3& v) const
     { return LK_Construct_line_3()(p, v); }
 
-    result_type
+    Line_3
     operator()(Return_base_tag, const Segment_3& s) const
     { return LK_Construct_line_3()(s.source(), Vector_3(s.source(), s.target())); }
 
-    result_type
+    Line_3
     operator()(Return_base_tag, const Ray_3& r) const
     { return LK_Construct_line_3()(r.source(), Vector_3(r.source(), r.second_point())); }
 
 
-    result_type
+    Line_3
     operator()(const Point_3& p, const Point_3& q) const
     { return this->operator()(Return_base_tag(), p, q); }
 
-    result_type
+    Line_3
     operator()(const Point_3& p, const Direction_3& d) const
     { return this->operator()(Return_base_tag(), p, d); }
 
-    result_type
+    Line_3
     operator()(const Point_3& p, const Vector_3& v) const
     { return this->operator()(Return_base_tag(), p, v); }
 
-    result_type
+    Line_3
     operator()(const Segment_3& s) const
     { return this->operator()(Return_base_tag(), s); }
 
-    result_type
+    Line_3
     operator()(const Ray_3& r) const
     { return this->operator()(Return_base_tag(), r); }
 
-    const result_type&
+    decltype(auto)
     operator() (const Line_arc_3 & a) const
     { return (a.rep().supporting_line()); }
 
-    result_type
+    Line_3
     operator() ( const typename SK::Polynomials_for_line_3 &eq )
     { return SphericalFunctors::construct_line_3<SK>(eq); }
 
@@ -554,8 +540,6 @@ template < class SK > \
   template < class SK >
   class Construct_circle_3
   {
-    typedef typename SK::Linear_kernel::Construct_circle_3 Extended;
-    typedef typename Extended::result_type forwarded_result_type;
     typedef typename SK::FT FT;
     typedef typename SK::Point_3 Point_3;
     typedef typename SK::Plane_3 Plane_3;
@@ -564,57 +548,57 @@ template < class SK > \
     typedef typename SK::Vector_3    Vector_3;
     typedef typename SK::Direction_3 Direction_3;
     typedef typename SK::Circular_arc_3            Circular_arc_3;
-    typedef typename SK::Kernel_base::Circle_3  RCircle_3;
     typedef typename Circle_3::Rep              Rep;
-  public:
 
-    forwarded_result_type
+    typedef typename SK::Linear_kernel::Construct_circle_3 LK_Construct_circle_3;
+
+  public:
+    Circle_3
     operator()(const Point_3& p, const FT& sr,
                const Plane_3& plane) const
-    { return Extended()(p, sr, plane); }
+    { return LK_Construct_circle_3()(p, sr, plane); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Point_3& p, const FT& sr,
                 const Vector_3& v) const
-    { return Extended()(p, sr, v); }
+    { return LK_Construct_circle_3()(p, sr, v); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Point_3& p, const FT& sr,
                 const Direction_3& d) const
-    { return Extended()(p, sr, d); }
+    { return LK_Construct_circle_3()(p, sr, d); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Sphere_3& s1, const Sphere_3& s2) const
-    { return Extended()(s1, s2); }
+    { return LK_Construct_circle_3()(s1, s2); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Plane_3& p, const Sphere_3& s) const
-    { return Extended()(p, s); }
+    { return LK_Construct_circle_3()(p, s); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Sphere_3& s, const Plane_3& p) const
-    { return Extended()(p, s); }
+    { return LK_Construct_circle_3()(p, s); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Plane_3& p, const Sphere_3& s, int a) const
-    { return Extended()(p, s, a); }
+    { return LK_Construct_circle_3()(p, s, a); }
 
-    forwarded_result_type
+    Circle_3
     operator() (const Sphere_3& s, const Plane_3& p, int a) const
-    { return Extended()(p, s, a); }
+    { return LK_Construct_circle_3()(p, s, a); }
 
-    forwarded_result_type
+    Circle_3
     operator()(        const Point_3& p1, const Point_3& p2, const Point_3& p3) const
-    { return Extended()(p1, p2, p3); }
+    { return LK_Construct_circle_3()(p1, p2, p3); }
 
-    forwarded_result_type
+    Circle_3
     operator() ( const typename SK::Polynomials_for_circle_3 &eq )
-    { return Rep(construct_circle_3<SK>(eq)); }
+    { return construct_circle_3<SK>(eq); }
 
-    const forwarded_result_type&
+    decltype(auto)
     operator() (const Circular_arc_3 & a) const
     { return (a.rep().supporting_circle()); }
-
   };
 
   template < class SK >
@@ -632,43 +616,41 @@ template < class SK > \
     typedef typename Line_arc_3::Rep               Rep;
 
   public:
-    typedef Line_arc_3   result_type;
-
-    result_type
+    Line_arc_3
     operator()(void) const
     { return Rep(); }
 
-    result_type
+    Line_arc_3
     operator()(const Line_3 &l,
                const Circular_arc_point_3 &s,
                const Circular_arc_point_3 &t) const
     { return Rep(l,s,t); }
 
-    result_type
+    Line_arc_3
     operator()(const Point_3 &s,
                      const Point_3 &t) const
     { return Rep(s,t); }
 
-    result_type
+    Line_arc_3
     operator()(const Segment_3 &s) const
     { return Rep(s); }
 
     // Not Documented
-    result_type
+    Line_arc_3
     operator()(const Line_3 &l,
                const Sphere_3 &s,
                bool less_xyz_first = true) const
     { return Rep(l,s,less_xyz_first); }
 
     // Not Documented
-    result_type
+    Line_arc_3
     operator()(const Sphere_3 &s,
                const Line_3 &l,
                bool less_xyz_first = true) const
     { return Rep(l,s,less_xyz_first); }
 
     // Not Documented
-    result_type
+    Line_arc_3
     operator()(const Line_3 &l,
                const Sphere_3 &s1, bool less_xyz_s1,
                const Sphere_3 &s2, bool less_xyz_s2) const
@@ -676,7 +658,7 @@ template < class SK > \
                    s2,less_xyz_s2); }
 
     // Not Documented
-    result_type
+    Line_arc_3
     operator()(const Sphere_3 &s1, bool less_xyz_s1,
                const Sphere_3 &s2, bool less_xyz_s2,
                const Line_3 &l) const
@@ -684,14 +666,14 @@ template < class SK > \
                    s2,less_xyz_s2); }
 
     // Not Documented
-    result_type
+    Line_arc_3
     operator()(const Line_3 &l,
                const Plane_3 &p1,
                const Plane_3 &p2) const
     { return Rep(l,p1,p2); }
 
     // Not Documented
-    result_type
+    Line_arc_3
     operator()(const Plane_3 &p1,
                const Plane_3 &p2,
                const Line_3 &l) const
@@ -715,56 +697,55 @@ template < class SK > \
     typedef typename SK::Circular_arc_3                Circular_arc_3;
     typedef typename SK::Kernel_base::Circular_arc_3   RCircular_arc_3;
     typedef typename Circular_arc_3::Rep               Rep;
-  public:
-    typedef Circular_arc_3   result_type;
 
-    result_type
+  public:
+    Circular_arc_3
     operator()(void) const
     { return Rep(); }
 
-    result_type
+    Circular_arc_3
     operator()(const Circle_3 &c) const
     { return Rep(c); }
 
-    result_type
+    Circular_arc_3
     operator()(const Circle_3 &c,const Circular_arc_point_3& pt) const
     { return Rep(c,pt); }
 
-    result_type
+    Circular_arc_3
     operator()(const Circle_3 &l,
                const Circular_arc_point_3 &s,
                const Circular_arc_point_3 &t) const
     { return Rep(l,s,t); }
 
     // Not Documented
-    result_type
+    Circular_arc_3
     operator()(const Circle_3 &c,
                const Sphere_3 &s1, bool less_xyz_s1,
                const Sphere_3 &s2, bool less_xyz_s2) const
     { return Rep(c,s1,less_xyz_s1,s2,less_xyz_s2); }
 
     // Not Documented
-    result_type
+    Circular_arc_3
     operator()(const Sphere_3 &s1, bool less_xyz_s1,
                const Sphere_3 &s2, bool less_xyz_s2,
                const Circle_3 &c) const
     { return Rep(c,s1,less_xyz_s1,s2,less_xyz_s2); }
 
     // Not Documented
-    result_type
+    Circular_arc_3
     operator()(const Circle_3 &c,
                const Plane_3 &p1, bool less_xyz_p1,
                const Plane_3 &p2, bool less_xyz_p2) const
     { return Rep(c,p1,less_xyz_p1,p2,less_xyz_p2); }
 
     // Not Documented
-    result_type
+    Circular_arc_3
     operator()(const Plane_3 &p1, bool less_xyz_p1,
                const Plane_3 &p2, bool less_xyz_p2,
                const Circle_3 &c) const
     { return Rep(c,p1,less_xyz_p1,p2,less_xyz_p2); }
 
-    result_type
+    Circular_arc_3
     operator()(const Point_3 &begin,
                const Point_3 &middle,
                const Point_3 &end) const
@@ -776,13 +757,9 @@ template < class SK > \
   class Construct_circular_min_vertex_3
   {
     typedef typename SK::Line_arc_3                Line_arc_3;
-    typedef typename SK::Circular_arc_point_3      Circular_arc_point_3;
 
   public:
-
-    typedef const Circular_arc_point_3& result_type;
-
-    result_type operator() (const Line_arc_3 & a) const
+    decltype(auto) operator() (const Line_arc_3& a) const
     { return (a.rep().lower_xyz_extremity()); }
 
   };
@@ -791,13 +768,9 @@ template < class SK > \
   class Construct_circular_max_vertex_3
   {
     typedef typename SK::Line_arc_3                Line_arc_3;
-    typedef typename SK::Circular_arc_point_3      Circular_arc_point_3;
 
   public:
-
-    typedef const Circular_arc_point_3& result_type;
-
-    result_type operator() (const Line_arc_3 & a) const
+    decltype(auto) operator() (const Line_arc_3& a) const
     { return (a.rep().higher_xyz_extremity()); }
 
   };
@@ -807,16 +780,12 @@ template < class SK > \
   {
     typedef typename SK::Line_arc_3                Line_arc_3;
     typedef typename SK::Circular_arc_3            Circular_arc_3;
-    typedef typename SK::Circular_arc_point_3      Circular_arc_point_3;
 
   public:
-
-    typedef const Circular_arc_point_3& result_type;
-
-    result_type operator() (const Line_arc_3 & a) const
+    decltype(auto) operator() (const Line_arc_3& a) const
     { return (a.rep().source()); }
 
-    result_type operator() (const Circular_arc_3 & a) const
+    decltype(auto) operator() (const Circular_arc_3& a) const
     { return (a.rep().source()); }
 
   };
@@ -825,30 +794,27 @@ template < class SK > \
   class Construct_circular_target_vertex_3
   {
     typedef typename SK::Line_arc_3                Line_arc_3;
-    typedef typename SK::Circular_arc_point_3      Circular_arc_point_3;
     typedef typename SK::Circular_arc_3            Circular_arc_3;
 
   public:
-
-    typedef const Circular_arc_point_3& result_type;
-
-    result_type operator() (const Line_arc_3 & a) const
+    decltype(auto) operator() (const Line_arc_3 & a) const
     { return (a.rep().target()); }
 
-    result_type operator() (const Circular_arc_3 & a) const
+    decltype(auto) operator() (const Circular_arc_3 & a) const
     { return (a.rep().target()); }
 
   };
 
   template < class SK >
   class Has_on_3
-    : public SK::Linear_kernel::Has_on_3
+    // : public SK::Linear_kernel::Has_on_3
   {
+    typedef typename SK::Boolean                 Boolean;
     typedef typename SK::Point_3                 Point_3;
     typedef typename SK::Sphere_3                Sphere_3;
     typedef typename SK::Plane_3                 Plane_3;
     typedef typename SK::Line_3                  Line_3;
-    typedef typename SK::Segment_3                   Segment_3;
+    typedef typename SK::Segment_3               Segment_3;
     typedef typename SK::Ray_3                   Ray_3;
     typedef typename SK::Triangle_3              Triangle_3;
     typedef typename SK::Line_arc_3              Line_arc_3;
@@ -856,69 +822,73 @@ template < class SK > \
     typedef typename SK::Circular_arc_3          Circular_arc_3;
     typedef typename SK::Circle_3                Circle_3;
 
+    typedef typename SK::Linear_kernel::Has_on_3 Linear_Has_on_3;
 
   public:
-    typedef typename SK::Linear_kernel::Has_on_3::result_type result_type;
+    // using SK::Linear_kernel::Has_on_3::operator();
 
-    using SK::Linear_kernel::Has_on_3::operator();
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Has_on_3()(a, b); }
 
-    result_type
+    Boolean
     operator()(const Sphere_3 &a, const Circular_arc_point_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Plane_3 &a, const Circular_arc_point_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Line_3 &a, const Circular_arc_point_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Circle_3 &a, const Circular_arc_point_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Line_arc_3 &a, const Circular_arc_point_3 &p,
                const bool already_know_point_on_line = false) const
     { return SphericalFunctors::has_on<SK>(a, p, already_know_point_on_line); }
 
-    result_type
+    Boolean
     operator()(const Line_arc_3 &a, const Point_3 &p,
                const bool already_know_point_on_line = false) const
     { return SphericalFunctors::has_on<SK>(a, p, already_know_point_on_line); }
 
-    result_type
+    Boolean
     operator()(const Plane_3 &p, const Line_arc_3 &a) const
     { return SphericalFunctors::has_on<SK>(p, a); }
 
-    result_type
+    Boolean
     operator()(const Line_3 &a, const Line_arc_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Circular_arc_3 &a, const Point_3 &p,
                const bool has_on_supporting_circle = false) const
     { return SphericalFunctors::has_on<SK>(a, p, has_on_supporting_circle); }
 
-    result_type
+    Boolean
     operator()(const Circular_arc_3 &a, const Circular_arc_point_3 &p,
                const bool has_on_supporting_circle = false) const
     { return SphericalFunctors::has_on<SK>(a, p, has_on_supporting_circle); }
 
-    result_type
+    Boolean
     operator()(const Sphere_3 &a, const Circular_arc_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Plane_3 &a, const Circular_arc_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Circle_3 &a, const Circular_arc_3 &p) const
     { return SphericalFunctors::has_on<SK>(a, p); }
 
-    result_type
+    Boolean
     operator()(const Circular_arc_3 &p, const Circle_3 &a) const
     { return SphericalFunctors::has_on<SK>(p, a); }
 
@@ -926,9 +896,9 @@ template < class SK > \
 
   template < class SK >
   class Do_intersect_3
-    : public SK::Linear_kernel::Do_intersect_3
+    // : public SK::Linear_kernel::Do_intersect_3
   {
-
+    typedef typename SK::Boolean                  Boolean;
     typedef typename SK::Sphere_3                 Sphere_3;
     typedef typename SK::Line_3                   Line_3;
     typedef typename SK::Line_arc_3               Line_arc_3;
@@ -937,20 +907,25 @@ template < class SK > \
     typedef typename SK::Circle_3                 Circle_3;
     typedef typename SK::Circle_3                 Circular_arc_point_3;
 
-  public:
-    typedef typename SK::Linear_kernel::Do_intersect_3::result_type result_type;
+    typedef typename SK::Linear_kernel::Do_intersect_3 Linear_Do_intersect_3;
 
-    using SK::Linear_kernel::Do_intersect_3::operator();
+  public:
+    // using SK::Linear_kernel::Do_intersect_3::operator();
+
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Do_intersect_3()(a, b); }
 
 #define CGAL_SPHERICAL_KERNEL_MACRO_DO_INTERSECTION_3_2(A,B)            \
-    result_type                                                         \
+    Boolean                                                             \
     operator()(const A & c1, const B & c2) const                        \
     { std::vector< typename SK3_Intersection_traits<SK, A, B>::type > res; \
       typename SK::Intersect_3()(c1,c2,std::back_inserter(res));        \
       return !res.empty(); }
 
 #define CGAL_SPHERICAL_KERNEL_MACRO_DO_INTERSECTION_3_3(A,B,C)          \
-    result_type                                                         \
+    Boolean                                                             \
     operator()(const A & c1, const B & c2, const C & c3) const          \
     { std::vector< typename SK3_Intersection_traits<SK, A, B, C>::type > res; \
       typename SK::Intersect_3()(c1,c2,c3,std::back_inserter(res));     \
@@ -1008,22 +983,21 @@ template < class SK > \
     typedef typename SK::Circle_3                 Circle_3;
     typedef typename SK::Circular_arc_point_3     Circular_arc_point_3;
 
-  public:
+    typedef typename SK::Linear_kernel::Intersect_3 Linear_Intersect_3;
 
+  public:
     //using SK::Linear_kernel::Intersect_3::operator();
 
-    typedef typename SK::Linear_kernel::Intersect_3 Intersect_linear_3;
-
-    template<class A, class B>
+    template <typename A, typename B>
     decltype(auto)
     operator()(const A& a, const B& b) const{
-      return Intersect_linear_3()(a,b);
+      return Linear_Intersect_3()(a,b);
     }
 
     decltype(auto)
     operator()(const Plane_3& p, const Plane_3& q, const Plane_3& r) const
     {
-      return Intersect_linear_3()(p, q, r);
+      return Linear_Intersect_3()(p, q, r);
     }
 
     template < class OutputIterator >
@@ -1238,18 +1212,17 @@ template < class SK > \
   template < class SK >
   class Do_overlap_3
   {
+    typedef typename SK::Boolean        Boolean;
     typedef typename SK::Line_arc_3     Line_arc_3;
     typedef typename SK::Circular_arc_3 Circular_arc_3;
 
   public:
-    typedef bool         result_type;
-
-    result_type
+    Boolean
     operator() (const Line_arc_3 &l1, const Line_arc_3 &l2,
                 const bool known_equal_supporting_line = false) const
     { return SphericalFunctors::do_overlap<SK>(l1, l2, known_equal_supporting_line); }
 
-    result_type
+    Boolean
     operator() (const Circular_arc_3 &c1, const Circular_arc_3 &c2,
                 const bool known_equal_supporting_circle = false) const
     { return SphericalFunctors::do_overlap<SK>(c1, c2, known_equal_supporting_circle); }
@@ -1264,16 +1237,13 @@ template < class SK > \
     typedef typename SK::Circular_arc_3          Circular_arc_3;
 
   public:
-
-    typedef void         result_type;
-
-    result_type
+    void
     operator()(const Line_arc_3 &l,
                const Circular_arc_point_3 &p,
                Line_arc_3 &ca1, Line_arc_3 &ca2) const
     { return SphericalFunctors::split<SK>(l, p, ca1, ca2); }
 
-    result_type
+    void
     operator()(const Circular_arc_3 &c,
                const Circular_arc_point_3 &p,
                Circular_arc_3 &ca1, Circular_arc_3 &ca2) const
@@ -1283,7 +1253,7 @@ template < class SK > \
 
   template <class SK>
   class Construct_bbox_3
-    : public SK::Linear_kernel::Construct_bbox_3
+    // : public SK::Linear_kernel::Construct_bbox_3
   {
     typedef typename SK::Circular_arc_point_3      Circular_arc_point_3;
     typedef typename SK::Circular_arc_3            Circular_arc_3;
@@ -1296,80 +1266,96 @@ template < class SK > \
     typedef typename SK::Iso_cuboid_3              Iso_cuboid_3;
     typedef typename SK::Line_arc_3                Line_arc_3;
 
+    typedef typename SK::Linear_kernel::Construct_bbox_3 Linear_Construct_bbox_3;
+
   public:
+    // using SK::Linear_kernel::Construct_bbox_3::operator();
 
-    typedef typename SK::Linear_kernel::Construct_bbox_3::result_type result_type;
+    template<class A>
+    decltype(auto)
+    operator()(const A& a) const
+    { return Linear_Construct_bbox_3()(a); }
 
-    using SK::Linear_kernel::Construct_bbox_3::operator();
-
-    result_type operator() (const Circular_arc_point_3 & c) const
+    decltype(auto) operator() (const Circular_arc_point_3 & c) const
     { return c.rep().bbox(); }
 
-    result_type operator() (const Line_arc_3 & l) const
+    decltype(auto) operator() (const Line_arc_3 & l) const
     { return l.rep().bbox(); }
 
-    result_type operator() (const Circular_arc_3 & c) const
+    decltype(auto) operator() (const Circular_arc_3 & c) const
     { return c.rep().bbox(); }
 
   };
 
   template <class SK>
   class Compute_approximate_squared_length_3
-    : public SK::Linear_kernel::Compute_approximate_squared_length_3
+    // : public SK::Linear_kernel::Compute_approximate_squared_length_3
   {
     typedef typename SK::Circle_3                  Circle_3;
     typedef typename SK::Circular_arc_3            Circular_arc_3;
     typedef typename SK::FT                        FT;
 
+    typedef typename SK::Linear_kernel::Compute_approximate_squared_length_3 Linear_Compute_approximate_squared_length_3;
+
   public:
+    // using SK::Linear_kernel::Compute_approximate_squared_length_3::operator();
 
-    typedef double result_type;
-    using SK::Linear_kernel::Compute_approximate_squared_length_3::operator();
+    template<class A>
+    double
+    operator()(const A& a) const
+    { return Linear_Compute_approximate_squared_length_3()(a); }
 
-    result_type operator() (const Circular_arc_3 & c) const
+    double operator() (const Circular_arc_3 & c) const
     { return c.rep().approximate_squared_length(); }
 
   };
 
   template <class SK>
   class Compute_approximate_angle_3
-    : public SK::Linear_kernel::Compute_approximate_angle_3
+    // : public SK::Linear_kernel::Compute_approximate_angle_3
   {
-    typedef typename SK::Point_3                   Point_3;
-    typedef typename SK::Vector_3                  Vector_3;
     typedef typename SK::Circular_arc_3            Circular_arc_3;
-    typedef typename SK::FT                        FT;
+
+    typedef typename SK::Linear_kernel::Compute_approximate_angle_3 Linear_Compute_approximate_angle_3;
 
   public:
+    // using SK::Linear_kernel::Compute_approximate_angle_3::operator();
 
-    typedef double result_type;
+    template <class... Args>
+    decltype(auto) // the linear kernel has "FT" as return type...
+    operator()(const Args&... args) const
+    { return Linear_Compute_approximate_angle_3()(args...); }
 
-    using SK::Linear_kernel::Compute_approximate_angle_3::operator();
-
-    result_type operator() (const Circular_arc_3 & c) const
+    double operator() (const Circular_arc_3 & c) const
     { return c.rep().approximate_angle(); }
 
   };
 
   template <class SK>
   class Bounded_side_3
-    : public SK::Linear_kernel::Bounded_side_3
+    // : public SK::Linear_kernel::Bounded_side_3
   {
+    typedef typename SK::Bounded_side          Bounded_side;
     typedef typename SK::Sphere_3              Sphere_3;
     typedef typename SK::Circle_3              Circle_3;
     typedef typename SK::Circular_arc_point_3  Circular_arc_point_3;
     typedef typename SK::Point_3               Point_3;
 
+    typedef typename SK::Linear_kernel::Bounded_side_3 Linear_Bounded_side_3;
+
   public:
-    typedef typename SK::Linear_kernel::Bounded_side_3::result_type    result_type;
+    // using SK::Linear_kernel::Bounded_side_3::operator();
 
-    using SK::Linear_kernel::Bounded_side_3::operator();
+    template <typename A, typename B>
+    Bounded_side
+    operator()(const A& a, const B& b) const
+    { return Linear_Bounded_side_3()(a, b); }
 
-    result_type
+    Bounded_side
     operator()( const Sphere_3& s, const Circular_arc_point_3& p) const
     { return SphericalFunctors::bounded_side<SK>(s,p); }
 
-    result_type
+    Bounded_side
     operator()( const Circle_3& c, const Circular_arc_point_3& p) const
     { return SphericalFunctors::bounded_side<SK>(c,p); }
 
@@ -1379,23 +1365,29 @@ template < class SK > \
 
   template <class SK>
   class Has_on_bounded_side_3
-    : public SK::Linear_kernel::Has_on_bounded_side_3
+    // : public SK::Linear_kernel::Has_on_bounded_side_3
   {
+    typedef typename SK::Boolean               Boolean;
     typedef typename SK::Sphere_3              Sphere_3;
     typedef typename SK::Circle_3              Circle_3;
     typedef typename SK::Circular_arc_point_3  Circular_arc_point_3;
     typedef typename SK::Point_3               Point_3;
 
+    typedef typename SK::Linear_kernel::Has_on_bounded_side_3 Linear_Has_on_bounded_side_3;
+
   public:
-    typedef typename SK::Linear_kernel::Has_on_bounded_side_3::result_type    result_type;
+    // using SK::Linear_kernel::Has_on_bounded_side_3::operator();
 
-    using SK::Linear_kernel::Has_on_bounded_side_3::operator();
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Has_on_bounded_side_3()(a, b); }
 
-    result_type
+    Boolean
     operator()( const Sphere_3& s, const Circular_arc_point_3& p) const
     { return SK().bounded_side_3_object()(s,p) == ON_BOUNDED_SIDE; }
 
-    result_type
+    Boolean
     operator()( const Circle_3& c, const Circular_arc_point_3& p) const
     { return SK().bounded_side_3_object()(c,p) == ON_BOUNDED_SIDE; }
 
@@ -1405,87 +1397,93 @@ template < class SK > \
 
   template <class SK>
   class Has_on_unbounded_side_3
-    : public SK::Linear_kernel::Has_on_unbounded_side_3
+    // : public SK::Linear_kernel::Has_on_unbounded_side_3
   {
+    typedef typename SK::Boolean               Boolean;
     typedef typename SK::Sphere_3              Sphere_3;
     typedef typename SK::Circle_3              Circle_3;
     typedef typename SK::Circular_arc_point_3  Circular_arc_point_3;
     typedef typename SK::Point_3               Point_3;
 
+    typedef typename SK::Linear_kernel::Has_on_unbounded_side_3 Linear_Has_on_unbounded_side_3;
+
   public:
-    typedef typename SK::Linear_kernel::Has_on_unbounded_side_3::result_type    result_type;
+    // using SK::Linear_kernel::Has_on_unbounded_side_3::operator();
 
-    using SK::Linear_kernel::Has_on_unbounded_side_3::operator();
+    template <typename A, typename B>
+    Boolean
+    operator()(const A& a, const B& b) const
+    { return Linear_Has_on_unbounded_side_3()(a, b); }
 
-    result_type
+    Boolean
     operator()( const Sphere_3& s, const Circular_arc_point_3& p) const
     { return SK().bounded_side_3_object()(s,p) == ON_UNBOUNDED_SIDE; }
 
-    result_type
+    Boolean
     operator()( const Circle_3& c, const Circular_arc_point_3& p) const
     { return SK().bounded_side_3_object()(c,p) == ON_UNBOUNDED_SIDE; }
 
     // We can maybe optimize it doing the operator() for point_3 too
-
   };
 
   template <class SK>
-  class Is_theta_monotone_3{
+  class Is_theta_monotone_3
+  {
     typename SK::Sphere_3 sphere_;
-  public:
-    typedef bool result_type;
 
+  public:
     Is_theta_monotone_3(const typename SK::Sphere_3& sphere):sphere_(sphere){}
 
-    result_type
+    typename SK::Boolean
     operator()(const typename SK::Circular_arc_3& arc) const {
       return SphericalFunctors::is_theta_monotone_3<SK>(arc,sphere_);
     }
   };
 
   template < class SK >
-  class Compare_theta_3{
+  class Compare_theta_3
+  {
+    typedef typename SK::Comparison_result    Comparison_result;
     typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
-    typedef typename SK::Vector_3 Vector_3;
+    typedef typename SK::Vector_3             Vector_3;
 
     typename SK::Sphere_3 sphere_;
 
   public:
-    typedef  CGAL::Comparison_result result_type;
-
     Compare_theta_3(const typename SK::Sphere_3& sphere):sphere_(sphere){}
 
-    result_type
+    Comparison_result
     operator() (const Circular_arc_point_3 &p0,
                 const Circular_arc_point_3 &p1) const
     { return SphericalFunctors::compare_theta_of_pts<SK>(p0, p1,sphere_); }
 
-    result_type
+    Comparison_result
     operator() (const Circular_arc_point_3 &p,
                 const Vector_3 &v) const
     { return SphericalFunctors::compare_theta_pt_vector<SK>(p,v,sphere_); }
 
-    result_type
+    Comparison_result
     operator() (const Vector_3 &m1,
                 const Vector_3 &m2) const
     { return SphericalFunctors::compare_theta_vectors<SK>(m1,m2); }
 
-    result_type
+    Comparison_result
     operator() (const Vector_3 &v,const Circular_arc_point_3 &p0) const
     { return CGAL::opposite( SphericalFunctors::compare_theta_pt_vector<SK>(p0, v,sphere_) ); }
   };
 
   template < class SK >
-  class Compare_theta_z_3{
+  class Compare_theta_z_3
+  {
+    typedef typename SK::Comparison_result Comparison_result;
     typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
+
     typename SK::Sphere_3 sphere_;
 
   public:
-    typedef  CGAL::Comparison_result result_type;
-
     Compare_theta_z_3(const typename SK::Sphere_3& sphere):sphere_(sphere){}
 
-    result_type
+    Comparison_result
     operator() (const Circular_arc_point_3 &p0,
                 const Circular_arc_point_3 &p1,bool decreasing_z=false) const
     { return SphericalFunctors::compare_theta_z<SK>(p0, p1,sphere_,decreasing_z); }
@@ -1493,7 +1491,8 @@ template < class SK > \
   };
 
   template < class SK >
-  class Make_theta_monotone_3{
+  class Make_theta_monotone_3
+  {
     typename SK::Sphere_3 sphere_;
 
   public:
@@ -1512,16 +1511,18 @@ template < class SK > \
   };
 
   template <class SK>
-  class Compare_z_to_right_3{
+  class Compare_z_to_right_3
+  {
+    typedef typename SK::Comparison_result Comparison_result;
     typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
     typedef typename SK::Circular_arc_3 Circular_arc_3;
+
     typename SK::Sphere_3 sphere_;
 
   public:
-    typedef  CGAL::Comparison_result result_type;
     Compare_z_to_right_3(const typename SK::Sphere_3& sphere):sphere_(sphere){}
 
-    result_type
+    Comparison_result
     operator()(const Circular_arc_3& arc1,const Circular_arc_3& arc2,const Circular_arc_point_3& pt,bool do_to_the_left=false){
       CGAL_kernel_precondition(SK().has_on_3_object()(sphere_,arc1));
       CGAL_kernel_precondition(SK().has_on_3_object()(sphere_,arc2));
@@ -1544,14 +1545,16 @@ template < class SK > \
   };
 
   template <class SK>
-  class Compare_z_at_theta_3{
-     typename SK::Sphere_3 sphere_;
+  class Compare_z_at_theta_3
+  {
+    typedef typename SK::Comparison_result Comparison_result;
+
+    typename SK::Sphere_3 sphere_;
 
   public:
-    typedef  CGAL::Comparison_result result_type;
     Compare_z_at_theta_3(const typename SK::Sphere_3& sphere):sphere_(sphere){}
 
-    result_type
+    Comparison_result
     operator()( const typename SK::Circular_arc_3& arc1,
                 const typename SK::Circular_arc_3& arc2,
                 const typename SK::Vector_3& m) const
@@ -1559,7 +1562,7 @@ template < class SK > \
       return SphericalFunctors::compare_z_at_theta_arcs<SK>(arc1,arc2,m,sphere_);
     }
 
-    result_type
+    Comparison_result
     operator()(const typename SK::Circular_arc_point_3& point,
                const typename SK::Circular_arc_3& arc) const
     {
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
index 73b38353b5c..f644d3e6ac1 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
@@ -85,7 +85,7 @@ namespace CGAL {
 
     template < class SK >
     inline
-    typename SK::Linear_kernel::Bounded_side_3::result_type
+    typename SK::Bounded_side
     bounded_side(const typename SK::Sphere_3 &s,
                  const typename SK::Circular_arc_point_3 &p) {
       typedef typename SK::Algebraic_kernel Algebraic_kernel;
@@ -99,7 +99,7 @@ namespace CGAL {
 
     template < class SK >
     inline
-    typename SK::Linear_kernel::Bounded_side
+    typename SK::Bounded_side
     bounded_side(const typename SK::Circle_3 &c,
                  const typename SK::Circular_arc_point_3 &p) {
       typedef typename SK::Algebraic_kernel Algebraic_kernel;
@@ -471,7 +471,7 @@ namespace CGAL {
       return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
-    // At the moment we dont need those functions
+    // At the moment we don't need those functions
     // But in the future maybe (some make_x_monotone? etc..)
     template <class SK>
     typename SK::Circular_arc_point_3
diff --git a/Circular_kernel_3/include/CGAL/Spherical_kernel_intersections.h b/Circular_kernel_3/include/CGAL/Spherical_kernel_intersections.h
index 9360c96d18f..a587d87cea4 100644
--- a/Circular_kernel_3/include/CGAL/Spherical_kernel_intersections.h
+++ b/Circular_kernel_3/include/CGAL/Spherical_kernel_intersections.h
@@ -46,7 +46,7 @@ intersection(const A <K> &c1, const B <K> &c2, OutputIterator res) \
 } \
 template <class K> \
 inline \
-bool \
+typename K::Boolean \
 do_intersect(const A <K> &c1, const B <K> &c2) \
 { \
   return typename K::Do_intersect_3()(c1, c2); \
@@ -61,7 +61,7 @@ intersection(const A <K> &c1, const B <K> &c2, const C <K> &c3, OutputIterator r
 } \
 template <class K> \
 inline \
-bool \
+typename K::Boolean \
 do_intersect(const A <K> &c1, const B <K> &c2, const C <K> &c3) \
 { \
   return typename K::Do_intersect_3()(c1, c2, c3); \
diff --git a/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_predicates.h b/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_predicates.h
index d49c0c7ab2d..559aeceeaf3 100644
--- a/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_predicates.h
+++ b/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_predicates.h
@@ -654,7 +654,7 @@ void _test_bounded_side(SK sk) {
     }
   }
 
-  // we dont need to test bounded_side(Circle, Circular_arc_point) because
+  // we don't need to test bounded_side(Circle, Circular_arc_point) because
   // bounded_side(Circle, Circular_arc_point) = bounded_side(Sphere, Circular_arc_point) +
   //         has_on_3(supporting_plane, circular_arc_point) which has already been tested
   std::cout << "Testing bounded_side(Circle, Circular_arc_point)..." << std::endl;
diff --git a/Classification/doc/Classification/Classification.txt b/Classification/doc/Classification/Classification.txt
index 48c7531b362..2c5a4e3b2d1 100644
--- a/Classification/doc/Classification/Classification.txt
+++ b/Classification/doc/Classification/Classification.txt
@@ -10,7 +10,7 @@ This component implements the algorithm described in \cgalCite{cgal:lm-clscm-12}
 
 \section Classification_Organization Package Organization
 
-%Classification of data sets is achieved as follows (see Figure \cgalFigureRef{Classification_organization_fig}):
+%Classification of data sets is achieved as follows (see \cgalFigureRef{Classification_organization_fig}):
 
 - some analysis is performed on the input data set;
 - features are computed based on this analysis;
@@ -314,7 +314,7 @@ Though it is possible to set them up one by one, \cgal also provides a method [t
 
 - the same mechanism is repeated until all features' ranges have been tested. Weights are only changed one by one, the other ones are kept to the values that gave the latest best score.
 
-This usually converges to a satisfying solution (see Figure \cgalFigureRef{Classification_trainer_fig}). The number of trials is user defined, set to 300 by default. Using at least 10 times the number of features is advised (for example, at least 300 iterations if 30 features are used). If the solution is not satisfying, more inliers can be selected, for example, in a region that the user identifies as misclassified with the current configuration. The training algorithm keeps, as initialization, the best weights found at the previous round and carries on trying new weights by taking new inliers into account.
+This usually converges to a satisfying solution (see \cgalFigureRef{Classification_trainer_fig}). The number of trials is user defined, set to 300 by default. Using at least 10 times the number of features is advised (for example, at least 300 iterations if 30 features are used). If the solution is not satisfying, more inliers can be selected, for example, in a region that the user identifies as misclassified with the current configuration. The training algorithm keeps, as initialization, the best weights found at the previous round and carries on trying new weights by taking new inliers into account.
 
 \cgalFigureBegin{Classification_trainer_fig,classif_training.png}
 Example of evolution of the mean intersection-over-union. The purple curve is the score computed at the current iteration, green curve is the best score found so far.
@@ -322,7 +322,7 @@ Example of evolution of the mean intersection-over-union. The purple curve is th
 
 \subsubsection Classification_sowf_result Result
 
-Figure \cgalFigureRef{Classification_sowf_result_fig} shows an example of output on a defect-laden point set. The accuracy on this example is 0.97 with a mean intersection-over-union of 0.85 (see section \ref Classification_evaluation).
+\cgalFigureRef{Classification_sowf_result_fig} shows an example of output on a defect-laden point set. The accuracy on this example is 0.97 with a mean intersection-over-union of 0.85 (see section \ref Classification_evaluation).
 
 \cgalFigureBegin{Classification_sowf_result_fig,noise_outliers.png}
 Example of classification on a point set with medium noise and outliers (left: input, right: output). _Ground_ is orange, _roofs_ are pink, _vegetation_ is green. Outliers are classified with an additional label _outlier_ in black.
@@ -398,7 +398,7 @@ smoothing by providing a model of `CGAL::Classification::NeighborQuery`.
 
 - `CGAL::Classification::classify_with_graphcut()`: this method
 offers the best quality but requires longer computation time (see
-Figure \cgalFigureRef{Classification_image}, bottom-right). The
+\cgalFigureRef{Classification_image}, bottom-right). The
 total energy that is minimized is the sum of the partial data term
 \f$E_{di}(x_i)\f$ and of a pairwise interaction energy defined by the
 standard Potts model \cgalCite{cgal:l-mrfmi-09} :
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index 5135f5ec327..59f88e34970 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -969,7 +969,7 @@ namespace CGAL {
     { return mnb_used_marks; }
 
     /** Test if a given mark is reserved.
-     *  @return true iff the mark is reserved (ie in used).
+     *  @return true iff the mark is reserved (i.e. in used).
      */
     bool is_reserved(size_type amark) const
     {
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
index c76a210ae6f..6e82809a412 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
@@ -64,7 +64,7 @@
  *   darts have the same info.
  *
  * internal::Test_is_same_attribute_functor<Map1, Map2> to test if two
- *   i-attributes of two darts are isomorphic (ie they have the same info).
+ *   i-attributes of two darts are isomorphic (i.e. they have the same info).
  *
  * internal::Test_is_same_attribute_point_functor<Map1, Map2, i> to test if
  *   the point of two i-attributes are equal.
@@ -208,7 +208,7 @@ template<typename CMap>
 struct Test_is_valid_attribute_functor
 {
   /** Test the validity of a i-cell-attribute.
-   * ie all the darts belonging to a i-cell are linked to the same attribute.
+   * In other words, all the darts belonging to a i-cell are linked to the same attribute.
    * @param adart a dart.
    * @param amark a mark used to mark darts of the i-cell.
    * @return true iff all the darts of the i-cell link to the same attribute.
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
index b7ca3d12b42..7891d9280da 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
@@ -159,7 +159,7 @@ namespace CGAL
     };
 
     //count the number of time a given type have been found
-    //within a tuple, until reaching position the k'th type of the tuple.
+    //within a tuple, until reaching position the k-th type of the tuple.
     //dim is the total size of the tuple
     template <class Type,int k,class T,
               int dim=CGAL::internal::My_length<T>::value-1>
@@ -191,7 +191,7 @@ namespace CGAL
     };
 
     //count the number of time a type different from Type have been found
-    //within a tuple, until reaching position the k'th type of the tuple.
+    //within a tuple, until reaching position the k-th type of the tuple.
     //dim is the total size of the tuple
     template <class Type, int k,class T,
               int dim=CGAL::internal::My_length<T>::value-1>
@@ -339,7 +339,7 @@ namespace CGAL
     };
 
     //Same as Foreach_static excepted that Functor
-    //is called for case k only if the k'th type in the tuple
+    //is called for case k only if the k-th type in the tuple
     //is different from Void. Note that to the converse of Foreach_static
     //Functor are called from n =0 to k
     template <class Functor,class T,int n=0, int startn=0>
@@ -365,7 +365,7 @@ namespace CGAL
     };
 
     //Same as Foreach_static_restricted excepted that Functor
-    //is called for case k only if the k'th type in the tuple
+    //is called for case k only if the k-th type in the tuple
     //is different from Void and k!=j.
     template <class Functor,int j,class T,int n=0>
     struct Foreach_static_restricted_except;
diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationCellBase_3.h b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationCellBase_3.h
index 6dca2430ebf..f3e2858eec3 100644
--- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationCellBase_3.h
+++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationCellBase_3.h
@@ -1,5 +1,5 @@
 /*!
-\ingroup PkgCT_3Concepts
+\ingroup PkgConstrainedTriangulation3Concepts
 \cgalConcept
 
 The concept `ConformingConstrainedDelaunayTriangulationCellBase_3` refines the concept
diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationTraits_3.h b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationTraits_3.h
index ab63f742172..4eb75159b61 100644
--- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationTraits_3.h
+++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationTraits_3.h
@@ -1,5 +1,5 @@
 /*!
-\ingroup PkgCT_3Concepts
+\ingroup PkgConstrainedTriangulation3Concepts
 \cgalConcept
 
 The concept `ConformingConstrainedDelaunayTriangulationTraits_3` specifies the requirements
diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationVertexBase_3.h b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationVertexBase_3.h
index acbba3513c5..3f3cf13fef7 100644
--- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationVertexBase_3.h
+++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationVertexBase_3.h
@@ -1,5 +1,5 @@
 /*!
-\ingroup PkgCT_3Concepts
+\ingroup PkgConstrainedTriangulation3Concepts
 \cgalConcept
 
 The concept `ConformingConstrainedDelaunayTriangulationVertexBase_3` refines the concept
diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/PackageDescription.txt b/Constrained_triangulation_3/doc/Constrained_triangulation_3/PackageDescription.txt
index b635ad9e245..cfb6f3cfb12 100644
--- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/PackageDescription.txt
+++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/PackageDescription.txt
@@ -1,17 +1,17 @@
 /*!
-\defgroup PkgCT_3Ref 3D Constrained Triangulations Reference
+\defgroup PkgConstrainedTriangulation3Ref 3D Constrained Triangulations Reference
 
-\defgroup PkgCT_3Concepts Concepts
-\ingroup PkgCT_3Ref
+\defgroup PkgConstrainedTriangulation3Concepts Concepts
+\ingroup PkgConstrainedTriangulation3Ref
 
-\defgroup PkgCT_3Functions Function Templates
-\ingroup PkgCT_3Ref
+\defgroup PkgConstrainedTriangulation3Functions Function Templates
+\ingroup PkgConstrainedTriangulation3Ref
 
-\defgroup PkgCT_3Classes Classes and Class Templates
-\ingroup PkgCT_3Ref
+\defgroup PkgConstrainedTriangulation3Classes Classes and Class Templates
+\ingroup PkgConstrainedTriangulation3Ref
 
-\addtogroup PkgCT_3Ref
-\cgalPkgDescriptionBegin{3D Constrained Triangulations,PkgCT_3}
+\addtogroup PkgConstrainedTriangulation3Ref
+\cgalPkgDescriptionBegin{3D Constrained Triangulations,PkgConstrainedTriangulation3}
 \cgalPkgPicture{cdt3-small.png}
 
 \cgalPkgSummaryBegin
@@ -22,7 +22,7 @@ The algorithm builds such a triangulation. The constrained triangulation does no
 and it may be necessary
 to add Steiner points to the PLC to make it tetrahedralizable.
 }
-\cgalPkgManuals{Chapter_CT_3,PkgCT_3Ref}
+\cgalPkgManuals{Chapter_CT_3,PkgConstrainedTriangulation3Ref}
 \cgalPkgSummaryEnd
 
 \cgalPkgShortInfoBegin
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
index 0f8df4deb95..f72c43e7e83 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
@@ -59,10 +59,10 @@
 #include <optional>
 #include <unordered_map>
 #include <vector>
-#if __has_include(<ranges>)
+#if CGAL_CXX20 && __has_include(<ranges>)
 #  include <ranges>
 #endif
-#if __has_include(<format>)
+#if CGAL_CXX20 && __has_include(<format>)
 #  include <format>
 #  include <concepts>
 #elif CGAL_DEBUG_CDT_3
@@ -461,7 +461,7 @@ bool does_tetrahedron_intersect_triangle_interior(typename Kernel::Tetrahedron_3
 
 namespace CGAL {
 
-#if __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
+#if CGAL_CXX20 && __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
 template <typename Polygon, typename Kernel>
 concept Polygon_3 = std::ranges::common_range<Polygon>
       && (std::is_convertible_v<std::ranges::range_value_t<Polygon>,
@@ -512,7 +512,7 @@ class Conforming_constrained_Delaunay_triangulation_3_impl;
 #endif // not DOXYGEN_RUNNING
 
 /*!
- * \ingroup PkgCT_3Classes
+ * \ingroup PkgConstrainedTriangulation3Classes
  * \brief This class template represents a 3D conforming constrained Delaunay triangulation.
  *
  * It contains a data member of type `Tr` and provides additional functionality for handling
@@ -3620,13 +3620,15 @@ public:
   {
     this->is_Delaunay = false;
     faces_region_numbers.resize(face_constraint_misses_subfaces.size());
-    for(int i = 0, end = face_constraint_misses_subfaces.size(); i < end; ++i) {
+    for(CDT_3_signed_index i = 0, end = static_cast <CDT_3_signed_index>(face_constraint_misses_subfaces.size()); i < end;
+        ++i)
+    {
       CDT_2& cdt_2 = face_cdt_2[i];
       fill_cdt_2(cdt_2, i);
       search_for_missing_subfaces(i);
     }
     if(this->debug_input_faces()) {
-      for(int i = 0, end = face_constraint_misses_subfaces.size(); i < end; ++i) {
+      for(CDT_3_signed_index i = 0, end = static_cast <CDT_3_signed_index>(face_constraint_misses_subfaces.size()); i < end; ++i) {
         dump_face(i);
       }
     }
@@ -3636,7 +3638,7 @@ public:
     bool the_process_made_progress = false;
     while(i != npos) {
       try {
-        if(restore_face(i)) {
+        if(restore_face(static_cast <CDT_3_signed_index>(i))) {
           face_constraint_misses_subfaces_reset(i);
         } else {
           std::cerr << "restore_face(" << i << ") incomplete, back to conforming...\n";
@@ -3887,20 +3889,20 @@ protected:
     face_constraint_misses_subfaces[pos] = false;
   }
   static inline constexpr std::size_t face_constraint_misses_subfaces_npos = boost::dynamic_bitset<>::npos;
-  std::vector<std::size_t> faces_region_numbers;
+  std::vector<CDT_3_signed_index> faces_region_numbers;
 };
 
 #endif // DOXYGEN_RUNNING
 
 
 /*!
-* \addtogroup PkgCT_3Functions
-* \brief creates a triangulation that can be used for Tetrahedral remeshing
+* \addtogroup PkgConstrainedTriangulation3Functions
+* \brief creates a triangulation that can be used for tetrahedral remeshing
 * \tparam Traits is the geometric traits class of `ccdt`
 * \tparam Tr is the type of triangulation to which `ccdt` is converted
 *
 * \param ccdt the triangulation to be converted
-* \return a triangulation of type `CGAL::Triangulation_3` that can be used for Tetrahedral remeshing
+* \return a triangulation of type `CGAL::Triangulation_3` that can be used for tetrahedral remeshing
 */
 template <typename Traits, typename Tr>
 CGAL::Triangulation_3<Traits,
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_base_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_base_3.h
index d2eb07cd835..a4fee571f9a 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_base_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_base_3.h
@@ -22,7 +22,7 @@
 namespace CGAL {
 
 /**
- * @ingroup PkgCT_3Classes
+ * @ingroup PkgConstrainedTriangulation3Classes
  * @brief Cell base class for the 3D conforming constrained Delaunay triangulation.
  *
  * This class is derived from the `Triangulation_cell_base_3` class and provides additional functionality
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_data_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_data_3.h
index ece53219213..b2ccbca9c52 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_data_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_cell_data_3.h
@@ -29,7 +29,7 @@ enum class CDT_3_cell_marker {
 };
 
 /*!
- * @ingroup PkgCT_3Classes
+ * @ingroup PkgConstrainedTriangulation3Classes
  * @brief Internal per-cell data for \cgal 3D conforming constrained Delaunay triangulations
  *
  * This class is an internal detail of the implementation of \cgal 3D conforming constrained Delaunay triangulations.
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_base_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_base_3.h
index 4e82da82e4c..2d1569564bc 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_base_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_base_3.h
@@ -23,7 +23,7 @@
 namespace CGAL {
 
 /**
- * @ingroup PkgCT_3Classes
+ * @ingroup PkgConstrainedTriangulation3Classes
  * @brief Vertex base class for the 3D conforming constrained Delaunay triangulation.
  *
  * This class is derived from the `Triangulation_vertex_base_3` class and provides additional functionality
@@ -87,7 +87,7 @@ public:
       break;
     case CDT_3_vertex_type::STEINER_ON_EDGE:
       set_dimension(1);
-      set_index(ccdt_3_data().constrained_polyline_id(tr).index());
+      set_index(static_cast<int>(ccdt_3_data().constrained_polyline_id(tr).index()));
       break;
     case CDT_3_vertex_type::STEINER_IN_FACE:
       set_dimension(2);
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_data_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_data_3.h
index 39b37819855..8ab3cf88d33 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_data_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_vertex_data_3.h
@@ -23,7 +23,7 @@ namespace CGAL {
 
 #ifdef DOXYGEN_RUNNING
 /*!
- * @ingroup PkgCT_3Classes
+ * @ingroup PkgConstrainedTriangulation3Classes
  * @brief Internal per-vertex data for \cgal 3D conforming constrained Delaunay triangulations
  *
  * This class is an internal detail of the implementation of \cgal 3D conforming constrained Delaunay triangulations.
@@ -145,7 +145,7 @@ public:
 
 } // namespace CGAL
 
-#if CGAL_CXX20
+#if CGAL_CXX20 && __cpp_concepts >= 201911L
 #  include <concepts>
 
   static_assert(std::regular<CGAL::Conforming_constrained_Delaunay_triangulation_vertex_data_3>);
diff --git a/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3/internal/read_polygon_mesh_for_cdt_3.h b/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3/internal/read_polygon_mesh_for_cdt_3.h
index a70a3177d75..ad3b4b5f22c 100644
--- a/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3/internal/read_polygon_mesh_for_cdt_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3/internal/read_polygon_mesh_for_cdt_3.h
@@ -78,7 +78,7 @@ namespace CGAL {
         std::cerr << "Warning: cannot read polygon soup" << std::endl;
       return return_error();
     }
-    using Traits = typename PMP_internal::GetPolygonGeomTraits<Points, Faces, NamedParameters>::type;
+    using Traits = typename GetPolygonGeomTraits<Points, Faces, NamedParameters>::type;
 
     auto traits = choose_parameter<Traits>(get_parameter(np, internal_np::geom_traits));
 
@@ -101,8 +101,7 @@ namespace CGAL {
       // So, if needed, create a copy of the range of faces, and triangulate it on the fly.
 
       // create a non-deleting pointer to `faces` (with a null deleter)
-      using Deleter_function = void(Faces*);
-      using Deleter = Deleter_function*; // function pointer type
+      using Deleter = std::function<void(Faces*)>; // function pointer type
       using Ptr = std::unique_ptr<Faces, Deleter>;
       auto null_deleter = +[](Faces *) {};
       Ptr triangle_faces_ptr{&faces, null_deleter};
diff --git a/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3_types.h b/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3_types.h
index dd21de1cf24..6047772250f 100644
--- a/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3_types.h
+++ b/Constrained_triangulation_3/include/CGAL/Constrained_triangulation_3_types.h
@@ -19,7 +19,7 @@
 namespace CGAL {
 
 /**
- * @ingroup PkgCT_3Classes
+ * @ingroup PkgConstrainedTriangulation3Classes
  * \brief Signed integral type to store the index of constraints.
  * @see `Conforming_constrained_Delaunay_triangulation_cell_data_3`
  * @see `Conforming_constrained_Delaunay_triangulation_vertex_base_3`
diff --git a/Constrained_triangulation_3/include/CGAL/make_conforming_constrained_Delaunay_triangulation_3.h b/Constrained_triangulation_3/include/CGAL/make_conforming_constrained_Delaunay_triangulation_3.h
index 8231692a6ee..4838c7ed236 100644
--- a/Constrained_triangulation_3/include/CGAL/make_conforming_constrained_Delaunay_triangulation_3.h
+++ b/Constrained_triangulation_3/include/CGAL/make_conforming_constrained_Delaunay_triangulation_3.h
@@ -23,10 +23,10 @@
 namespace CGAL {
 
 /*!
-  \addtogroup PkgCT_3Functions
+  \addtogroup PkgConstrainedTriangulation3Functions
   @{
 
-  Free Functions for Creating Conforming Constrained Delaunay Triangulations  {#PkgCT_3Functions}
+  Free Functions for Creating Conforming Constrained Delaunay Triangulations  {#PkgConstrainedTriangulation3Functions}
   ==========================================================================
 
   Each of the following functions create a 3D conforming constrained Delaunay triangulation
@@ -185,19 +185,9 @@ auto make_conforming_constrained_Delaunay_triangulation_3(const PointRange &poin
   using PointRange_value_type = CGAL::cpp20::remove_cvref_t<decltype(*points.begin())>;
   auto point_map = parameters::choose_parameter(parameters::get_parameter(np, internal_np::point_map),
                                                CGAL::Identity_property_map<PointRange_value_type>{});
-  auto get_geom_traits_type = [&]() {
-    auto geom_traits_np = parameters::get_parameter(np, internal_np::geom_traits);
-    using Geom_traits_np_type = decltype(geom_traits_np);
-    if constexpr (!std::is_same_v<Geom_traits_np_type, internal_np::Param_not_found>) {
-      return static_cast<Geom_traits_np_type*>(nullptr);
-    } else {
-      using Point = CGAL::cpp20::remove_cvref_t<decltype(get(point_map, *points.begin()))>;
-      using Kernel = typename CGAL::Kernel_traits<Point>::Kernel;
-      return static_cast<Kernel*>(nullptr);
-    }
-  };
 
-  using Geom_traits = std::remove_pointer_t<decltype(get_geom_traits_type())>;
+  using Geom_traits = typename GetPolygonGeomTraits<PointRange, PolygonRange, NamedParameters>::type;
+
   using Default_CDT = Conforming_constrained_Delaunay_triangulation_3<Geom_traits>;
   using CDT = typename CGAL::Default::Get<Triangulation, Default_CDT>::type;
   CDT cdt(points, polygons, np);
@@ -206,7 +196,7 @@ auto make_conforming_constrained_Delaunay_triangulation_3(const PointRange &poin
   return remeshing_cdt;
 }
 
-/// @} // end group PkgCT_3Functions
+/// @} // end group PkgConstrainedTriangulation3Functions
 } // end namespace CGAL
 
 #endif // CGAL_MAKE_CONSTRAINED_DELAUNAY_TRIANGULATION_3_H
diff --git a/Convex_hull_3/include/CGAL/convex_hull_3.h b/Convex_hull_3/include/CGAL/convex_hull_3.h
index b2089fdc53c..239d83f9134 100644
--- a/Convex_hull_3/include/CGAL/convex_hull_3.h
+++ b/Convex_hull_3/include/CGAL/convex_hull_3.h
@@ -45,6 +45,7 @@
 
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/graph/graph_traits.hpp>
+#include <boost/range/has_range_iterator.hpp>
 
 #include <type_traits>
 
@@ -69,6 +70,8 @@ template<class VertexPointMap,class Base_traits> class Extreme_points_traits_ada
 namespace Convex_hull_3 {
 namespace internal {
 
+BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(Has_nested_type_Collinear_3, Collinear_3, false)
+
 // wrapper used as a MutableFaceGraph to extract extreme points
 template <class OutputIterator>
 struct Output_iterator_wrapper
@@ -993,7 +996,8 @@ void convex_hull_3(InputIterator first, InputIterator beyond,
 template <class InputIterator, class PolygonMesh, class Traits>
 void convex_hull_3(InputIterator first, InputIterator beyond,
                    PolygonMesh& polyhedron,
-                   const Traits& traits)
+                   const Traits& traits,
+                   std::enable_if_t<Convex_hull_3::internal::Has_nested_type_Collinear_3<Traits>::value>* = 0)
 {
   typedef typename Traits::Point_3                Point_3;
   typedef std::list<Point_3>                      Point_3_list;
diff --git a/Convex_hull_3/test/Convex_hull_3/quickhull_test_3.cpp b/Convex_hull_3/test/Convex_hull_3/quickhull_test_3.cpp
index 428866204fb..b6d2882b141 100644
--- a/Convex_hull_3/test/Convex_hull_3/quickhull_test_3.cpp
+++ b/Convex_hull_3/test/Convex_hull_3/quickhull_test_3.cpp
@@ -20,7 +20,7 @@ typedef K::Segment_3                                      Segment_3;
 typedef CGAL::Creator_uniform_3<NT,Point_3>               Creator;
 typedef CGAL::Random_points_in_sphere_3<Point_3,Creator>  Generator;
 
-const unsigned int num = 40;
+const unsigned int num = 400000;
 
 template <class Facet_handle>
 void compute_plane_equation(Facet_handle f)
@@ -135,9 +135,9 @@ int main()
   std::cerr << "Testing coplanar hull" << std::endl;
   test_coplanar_hull();
 
-  std::cerr << "Testing 500 random points" << std::endl;
+  std::cerr << "Testing " << num << " random points" << std::endl;
   std::vector<Point_3> points;
-  Generator g(500);
+  Generator g(1);
   std::copy_n( g, num, std::back_inserter(points));
 
   assert(points.size() == num);
diff --git a/Convex_hull_d/include/CGAL/Delaunay_d.h b/Convex_hull_d/include/CGAL/Delaunay_d.h
index 6087d65e369..2531ec7f9e7 100644
--- a/Convex_hull_d/include/CGAL/Delaunay_d.h
+++ b/Convex_hull_d/include/CGAL/Delaunay_d.h
@@ -203,7 +203,7 @@ public:
     Simplex_iterator(Delaunay* x,  Base_iterator y,
       Delaunay_voronoi_kind z = NEAREST) : Base_iterator(y), DT(x)
     /* if the facet is not nil we set the current marker to
-       the facet and insert all it's neighbors into the
+       the facet and insert all its neighbors into the
        candidates stack */
     { CGAL_assertion(base() != Base_iterator());
       tf = (z == NEAREST ? lower_hull : upper_hull);
@@ -262,7 +262,7 @@ public:
     Simplex_const_iterator(const Delaunay* x,  Base_iterator y,
       Delaunay_voronoi_kind z = NEAREST) : Base_iterator(y), DT(x)
     /* if the facet is not nil we set the current marker to
-       the facet and insert all it's neighbors into the
+       the facet and insert all its neighbors into the
        candidates stack */
     { CGAL_assertion(base() != Base_iterator());
       tf = (z == NEAREST ? lower_hull : upper_hull);
diff --git a/Data/data/images/torus_gray_image.vti b/Data/data/images/torus_gray_image.vti
new file mode 100644
index 00000000000..7a165899fca
--- /dev/null
+++ b/Data/data/images/torus_gray_image.vti
@@ -0,0 +1,15 @@
+<?xml version="1.0"?>
+<VTKFile type="ImageData" version="0.1" byte_order="LittleEndian" header_type="UInt32" compressor="vtkZLibDataCompressor">
+  <ImageData WholeExtent="0 63 0 63 0 63" Origin="0 0 0" Spacing="1 1 1" Direction="1 0 0 0 1 0 0 0 1">
+    <Piece Extent="0 63 0 63 0 63"                                                    >
+      <PointData Scalars="Scalars_">
+        <DataArray type="Float32" Name="Scalars_" format="appended" RangeMin="-0.71912002563"       RangeMax="3.0815968513"         offset="0"                   />
+      </PointData>
+      <CellData>
+      </CellData>
+    </Piece>
+  </ImageData>
+  <AppendedData encoding="base64">
+   _IAAAAACAAAAAAAAAMhEAABwhAAC8IAAAliAAAIAgAABTIAAAUyAAAFogAABiIAAAPyAAAAggAAAAIAAACCAAAA0gAAD1HwAA8B8AAOAfAADdHwAA1x8AAM4fAADMHwAA2B8AANYfAAD7HwAA8R8AAPwfAAD+HwAAHCAAACggAAA5IAAAXyAAAMQQAAA=eJzt2/+/1+P9B/BQ+kyGVaYsTEQjosmXOq/nVmHkQ1iRSkmUIinfPkJJp06dTp1zmk+JVMzMl80mnCy9X/HBZNZMIytfyhAfa8zcyFbsc+5Xe+9f+Pzwfj1/efW6ruv5fD4e7+u6ns/ndb1OLVoUUkghhRRSSCGFFFJIIYUUUkghhRRSSCGFFFJIIYUUUkghhRRSSCGFFFJIIYUUUkghhRRSSCGFFFJIIYUUUkghhRRSSCGFFFJIIYUUUkghhfz/y6j6zqsPGNdu9cMtW60+fsVH+dT1r+SLRqzK6/v/JO9QX58fe/p1eb+WZ+cfVXXLD9u8R/7IY6+Vvjx6Senne55b6nPK5lWPjVz+5K+/M6Fq6zW7Z5tb9c+6j5me1c9bkm1e0pR99eSL2ejWb2Xrlv4le2XZP7LejbvGVYt3j69P/lq81b1NjHu6TXp6167fOOPp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98yf/9+f1bL1VUvb83Ht1mXb33iiXzry8vyqrNq8/v7j8sbF/fNH5x6QD7h6c9KPz7/8dJvj726dEhTy9L4Y7Y9uW3w5Kqf7Nc+u3fbyGzDD27L/rPTY9mGe3+ftdnzw2xS1iK677lHTKtuGz1WdIwhjx4U3WYeGqVeXePNDUfEp2O7xdsfdUtP79r1G2c8PfrssMdust/shz9++YcDHrjggxNeuOHHAx+88MMT3zJ/v4e2yw54Ob9/S1M+qsuS/I6XZ+Z/eG5k/h93n5iP69w2nzH+jVKn2xaV9j/whNIla2etahyyb5rvzueMyLYcent23KZVab6OW7s9M581n38zNp59cLQdeEQc2r5HXPfjE2Nx24hOV/WN7mtOiYZDT4uBdafHc7v1T0/v2vUbZzw9+uywxy77yU+zP375hwMeuOCDE1644ccDH7zwwxPfMn9rwu+ib0Gfu/LJ7Wfk5z88LD9k1x5537Z75BMWvlDq27O6tP7+1qU5i6qf/N1FK6va/7NPNq5Tfbb3t3+VPVG1Kfv5uhbxwKn7xD/aHZgwf3BQz3isPuK+lafG7U1nRr7whzH0qsFx/dnDYuEpI6J6yMjYb+HFsW+LUenpXbt+44ynR58d9thlnx/++OUfDnjggg9OeBPuZvx44IMXfnjiW+ZvX1gbfh9jfrljSH7B40fnI/q0ysd3KpUGHzyuVL9hzaoL/vir3mcd87Vs75cnZjNX3581DXglzfejTXunNbvvF0fFzGW90jx2rR0Qr7UYnDhdetWlccvCcdH+pStjc9dJ8f6j18RhN10XF9ReH+veuT49vWvXb5zx9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvmb/YYH9YI34nY4f8dLf8vXebSg/tNbi07IQ7Vr0798yqS9Z8Jxt44py09uxHMavq/W+l/XvSQb3TGjZv1QsujPNjdLT62fgYsv3qeOLUG2L5fTfHS7ffEou/nBYd95geXzw7PTp9tzqmnF+dnt616zfOeHr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8xffBQj7BNrxe9FR1xt3GX6qm8OnlW16ezvpf0mHovPYlOfBV3i+XuOT/NydZcfxgkbh0fD7mNjxW8mJuzt7pga9028NZ5aWh1/vWRm3LO2Jl55d1a88ejsqOpbG+P/uzZe+OXOp3ft+o0znh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfOXI8RJscJ+sWb8bnTfm/KjKjln86tLs09qXs2Wd9ktHjqiY4rb9uXGI8+Kfu8MjW3rx6S1O3/75Nhx4rQ0r3UfzoxPd52dOHbdrS4+bD03hr44N7adPy+ObZoXPbfOi998ufPpXbt+44ynR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3zL/OVJuUK8FDPsG2vH78fGjaPuyeLSjZn8vP/sA1JcfnzIyXHbjQNT7LJfzc/R35gWdz9TnebPfA46ri4mNc2NsRvnxV6P1MebpzfEA8sb4uRtDdHr4MaoO6ExpsXOp3ft+o0znh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfNXK8iXcoa4KXbYP9aQ35Gt//qf1inmiMP235JNg+PEiWPS/nzh7ilp/w4fXxOHD6+NDQ/VRa/Ld3Je07iTa49JjdF+QWPcsLgxnp3fGGunN0bD9Y3x8aSdT+/a9RtnPD367LDHLvv88Mcv/3DAAxd8cMILN/x44IMXfnjiW+avXlIzyJtyh/gphthH1pLfk802nY9P+XrttUNTfBa3rck2K2dEr2Gz0zxZw6PerI9+rzfEFZc1xvQ7G2NRbTO3/o2x9OOGWF/bED89siGueas+LvlZfbS7c+fTu3b9xhlPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+asZ1U1qB/lTDhFHxRL7yZryu7ItP//zkCvikSU3pNhU3aYm7dNbr5sb70yqj66lhpgwfuc8XjKqMc5oxv1qp4Z4/Hv1cdCQedH9lrkx+Jm6WH9sXRy3fk78pWlOenrXrt844+nRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT3zJ/dbPaUf2khpBH5RLxVEyxr6wtvy8fpTMnp1xlP66vnhNTT54Xr3duSPvYfG1onq/bVzakecXlok11seW8OfHhhtkxceqsqB9aEyunzIxjPpsRU349Iz29a9dvnPH06LPD3oZ/rSd++OOXfzjggQs+OOGFG3488MELPzzxLfN3dlA/qyHVUWoJ+VROEVfFFvvLGvM78/XRnrPiBx/OSXH7wpkNab/avy/s2pjWcr9+8+L+AXVxV+fa6PB6TQxfOCN6XzM9DqubFk9tnRpH1t0cPdrdFLU/ujE9vWvXb5zx9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvmb/86AyhjlZLqqfUFPKq3CK+ijH2mbXm9+ZTfBav58zeGcNOWtgQrVvVp3m7+NTaNJ/D+lTHgv2nJY4vDb8uskETY3m38dGt7bi49vDLonramPT0rl2/ccbTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ75l/s6QzlHOEuppNaW6Sm0hv8ox4qxYY79Zc353vs+t37nPh5/WkNaq/WwNz1tfHR3fviV+W3tD4rRmwti44rCLY+RTQ+OMm8+L0fPPjT8ffnb8+bwB6eldu37jjKdHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfMv8naOdJcVJZwp1tdpSfaXGkGflGvFWzLHvrD2/Pwzi9oM75kbNp7Vx0jE18cCrt6b5e/ODiWl+R/S8MFZf2FwXn9s/dhnTN6Zs6R1z9jkhZu57XOTtvpue3rXrN854evTZYY9d9vnhj1/+4YAHLvgSzma8cMOPBz544YcnvmX+7hKcp8UI5yq5Q32txlRnqTXkWzlH3BV7evwrb5sHWC77RW2KYfbvTX+/Pob87fI4YuiINK9jtp8SA3acFN/afnT86YIuMW7SAXFe434x9ZN28dWKtunpXbt+44ynR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3zL/O0HdwrO1c6WzlfipzpbraneUnPIu3KP+CsG2YfWovmAyX79/R+uTft575oL0jz2+luv2PLqkYnbnNgnrn24ZfQe9nm2qecH2VuTN2WDat5IT+/a9RtnPD367LDHLvv88Mcv/3DAAxd8cMILN/zpXNLMBy/88MS3zF+N6F7F/nC+dsZM56zms4Z6W82p7lJ7yL9ykDgsFtmP1qR5gW3kxtFpHy/tcEpa24Pe/nbM/2qv6Pun7YnrN3Z5Ort60IPZ5+MWZR98Pi+rGT8nPb1r12+c8fTos8Neig/N9vnhj1/+4YAHLvjghBdu+PHABy/88MS3zN+9mrsl9yvuGOwXZ03nLbFEXFV7qr/UIPKwXCQei0n2pbVpfmCccFa/tIZv/qRjmm/zm49fkdXfMD/btm5UNnfHUdmWX7TKZl29oeq02jVVnt616zfOeHr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDE99/n33lLUr53x6RuctfgvG3/OHc5e6i/1aDqMLWIfCwnictik/1pjZonWO3nz+76KrvlmrXZhg2Ls3MGDEuc+z4zqup3yzeufLbL0FULuz2w6vDRpfT0rl2/ccbTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ77/Xv9LmtJdpXs2+dJ9izsH525nT/vJGUQdLt6qx9Qk8rLcJD6LUfaptWq+YD7q1OfT2javb02dXnXm5V9ftbD79lXrO51eKh00rbTws/mltbsvSk/v2vUbZzw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDVzqzN/PEt8xffeye1dpw3+bOSf5USzh/O4M6h9lf6nExR12mNpGf5ShxWqyyX61Z8wb76r0OzM6Z+9fe5jnOGVg6sOvS0hEfv1ia1PGj0m1rdsnvnNQq9/SuXb9xxtOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Zf2eDPfMn/xUI2oXnbn6N7NmnH/Ip+qr5xFncecSew3tak4rEaRp+Uq8VrMsm+tXfOHw8ejt6wyvy0HPpc43zu2U97/i2PyK3eJfNTkvunpXbt+44ynR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3zL/H1rcN/uzlmcVD+7f3MH5R7GWkr1ffOZ1LnM2UR9bv+p09Qq8rWcJW6LXfavNWwecely17rSkqZ98te/3zP/+16D8qaWV+b77z0lv2jttPT0rl2/ccbTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ75l/s5HagP37u6e1U3uIMVPd1HuY9xJOJdbY85nzijqdLWq/Sg2ydtyl/gthtnH1rL5xMk8N7x+WX7prTV5q9cW5B3eW5a/Nvbe9PSuXb9xxtOjzw577LLPD3/88g8HPHDBBye8cMOPBz544YcnvmX+vjn57uLbg/OzmsE9rLtI93Hqa3HV3YTzuZwj/1p76nU1q7rN/pS/5TBxXCyzn61p84rbE5PmJs4X37oi3z7p2XxR2xfS07t2/cYZT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574lvm7J/HtSX4UI9zDO0u6j1VLuJdTX6m33VGIt86qzmvysbrdmlS/qWHsV7lMPBfT7Gtr2/zieOaXq/OFHf6Y7xj6v/m9z3+cnt616zfOeHr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8zf2dD3NzWi7zC+Raif5U/nKrHE/Zwawz2N2tN53ZlVHHZ2kZ/VsOo4a1U+t3/FdbHN/rbGzTOu1y77PB92YevVN52852pP79r1G2c8PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb5q8ecj7yHc6Z0fnZNwn38u6m1dXOGPKruyr3NWKOOszZ1fnNGUZ8lqvUc2oaed0atp/FOPvcWjffOHd4uMPqMx46OD29a9dvnPH06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+Zv2/Q7kncm/ke55uUuknucD/vjto9rbtK9bY7K/c28q/zu5rEOU5sUs+racVttY38LseJ89a2/W7Nm3fcv9/hxPT0rl2/ccbTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ77F/Bf7v4j/Rf6v9Pqv0uv/Sj//Vfr5v9Lvfyr9/q/S738r/f6/0r//VPr3v0r//lvp3/8r/e8/Kv3vfyr9778q/e//Kv3vPyv9738r/e+/K/3v/yv9/39U+v//qfT//1Xp//+v0v//Z6X//99Klv8D6zDExXic7dv5o9Zj/sfxdtpP5zD2bBnZMhhj635/1Mi+JEPNwpStjC1Z+jKylpQQ1TCVJEpRlLV07ruVFpGlvZOhJBlkRET0PY/rzD3/xK1fPn0+n+t6v5+v+7qu9/t9Xfd9atX65d+gQVsL29utLuzbu1DY1urJQoeTBhTyw7sVJvQ8qlC5dYfCzacV8ifcfkl+0ZzxlZ+ddFLba1oflvt8t8G5h9u/nnv0mC257g+1iBa7/Dqen3VsfD72tGiyoktUXnl5rL++V1xfp0/stNPdcfgP98S1xw+M5asGRa8PH4gTzxkcBx38UGzq9VC6uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6vf/IbfnC3WyJwpH3XxP4bKz/lS45PaDCw2/+iHf/cxx+V4fHpafdfmb0zfstbbtoLXX5epOfim3/It/5/7zt+ZRb+Gv46KD28aFY86Jbqd2ixFHXhcf3XR75Ha+JzZPvi86PTo4/r5kaLx/9aOx4coR0XHpY/HP5x+Pg7aPjt/OeyKebTgmXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530FvX7PDxrc1+/QtX4Cwqdfn1A4c6fPs/n2w/Ln/11/Xy0G33CvFf2zy16aWiuatp7ufmNGsRet+yTxiH//dmx4XeXRLOhN6bx6t9vYBrP25o+Ek8fPzJ+Xzk6zhz5VHy77um4d8QzcerCidHppufirqeej0u7TI69hk5OV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Rf3mhM/Fu6kX7V+o3fCT/BsV9+Wv/2JZ5aH7n9t288Wn5cZVPJO77YbPcuO3l8cDPdvEcU+dEhNeuChufen66NHt7njox/viwZeHxDEjhyfmNvuNi51WPRP3b3ou7rn6hdjtopejx8JX46bXpkWDo6fHrVllvLGmMjqU59PVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv3Vhbvh8tOk9uX/+wP6VlRN2fbDtli4X53LHTsv1K9+WO2bznnFvz+Ni6qPnxTF9r4zW4+5I4zH06iFpznZ4YEz0WTs+jePZnV+McQ+/mjRdfXohflgzM+ZunR3PjJsbbT5/Pc56543o3nle7N93Xrq699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3qFxusD3PE56Tte5+OaLvj/GtyQ9rNzt2xpm6c99P+cf8/2sWomX9Jc896FLNW9PtnWr/L952Q5rBxu/XC1+LyKYXI9ZgdGx58Pf5x9PwYctnCaHTIolj24Ftx3si346jOi+OC1xfH1I01V/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Rf3ioxhhnZgrPi99xNX2cxtE78Nbx8TvT07rTTwWn8WmP184KkatG5fG5ZtWL8cF21+Lu3aeGcN6z03sJ/31zfio7tvxwxHvxCHfvRtr/vp+NOu9JHY5eWnctGRpPH3gsqj7+2Xp6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qF+OECfFCuvFnPG56Xvu0INSzrm0eff43Td3RMUB98fgAx9Ncdu6PHD8C1F197R4pc+MNHfrli2I3725KI3rG7e+F4cNW5I0XjxsebQaviKGXbgyjvxsZVx56qq49rZVUW9wzdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1G/PClXiJdihnVj7vj82Djygh4x8JC7Un6ed8HwFJeHzZgU9d55OcUu69X49HhyUaw+/500fsbzwTeWx6RTV8ZTV62KU3+/OnapWh3rTqqK2wdUxQ0vVsUbC6pi+js1V/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Rf1qBflSzhA3xQ7rxxzyObJ10/UPppgjDlt/DetMjWWnz0jrs+W6hWn9Prr9vej21dKoiBVx408rk4Y6rWq0XVVvTZzdek282GZN/NxqTezwqzWxsOGaOKh+zdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1G/eknNIG/KHeKnGGIdmUs+TzZPfHJcytf7njUtxWdx25w8+cx344Yvl6RxMocfu3Z19Lm6Kp7+oSryh62J9/es1lZVFSvvrIqyvario/zqeL7n6ng8VsdZh9Vc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQW9asZ1U1qB/lTDhFHxRLryZzyubItPx//1KwY0m1+ik2Fx95L67Ryx5WxV/3Vcck5VTFhe1Uax1HfVkW/au7mz6+OTe+uij9+vjKuKF8ZD5+/IsrmLo9reiyP1qfVXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530FvWrm9WO6ic1hDwql4inYop1ZW75fPnYbdr8lKusx7Jdlsdry1bGzi+vTuvYeFX8WBXvnVmVxpWW4detiH02LosDrloaz7ZYEgu+eC++KXsv/tb/3Zja5d10de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1G/voH5WQ6qj1BLyqZwiroot1pc55nPmq/Xj78edty5PcfuRXWvWt/Vbd1hVmst9lq6MtR8tj+UvLY1OV78fjx70btzYYHF0bflWDL/3zejYZWG8P2JBbP/zgnR177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvULz/aQ6ij1ZLqKTWFvCq3iK9ijHVmrvm8+RSfxevX96iJYdcfVBXtHlmVxm3kiqVpPB95f3G8M3FR0jhm1huxsu3cGNJ6dnQcMTO+HTsjtnWaka7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeov67SHto+wl1NNqSnWV2kJ+lWPEWbHGejPnfO58D9q3Zp3/c1XNXLeezeH5Pd6J865fFKM7z0+aWp4+M3qOrYwre02LD995Ja5e/VL8ZtyLMTn3Yrq699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3qt4+2lxQn7SnU1WpL9ZUaQ56Va8RbMce6M/d8/hjE7Y8fWBmz+i2LG2a/F+u6v53Gb8I9c9P4fnboa7F7u+q6ePrkmP76xLi534S4ffen46eRY2O3Pcemq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peon5nCfbTYoR9ldyhvlZjqrPUGvKtnCPuij3WnzloHLCMabcsxTDr9/sHqvc0982Kxdn0NK5fPvhcXDx4fMxr/mQcko2Ka88YHuv/9Ej8MHBYHPfl0HR177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvUbz04U7Cvtre0vxI/1dlqTfWWmkPelXvEXzHIOjQXjQcm63W/W99I63nW+VPTOHZuPCEO6/NE0nbHlCFx48b747SDBsQLj/eLr3veHc1fuitd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbf9qXVOuhiz466f1f/K+uEZ2rWB/21/aYaZ9VvddQb6s51V1qD/lXDhKHxSLr0Zw0Ltiu3F5I63hgy+fS3F5fZ2Tc3WJIvDlwYNL601O9o805V8WmlZfEp49fFMeu/ku6uvfce+20109/dthL8aHaPj/88cs/Djy48OHEixs/HfTQRR+d9Bb1O1dztuR8xRmD9WKvab8lloirak/1lxpEHpaLxGMxybo0N40Pxl7HTUpzeOvAR9N4Gt/zVveKtt26xpG7dYxHn2wf1ww+NtZ3OjLyR/8mXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530/m//d+XlKT86Y1I3OWuw37Z+7LvsPdTfalB1mFpEPpaTxGWxyfo0R40TVuv51ePui5c+6BPdHrosTjv27KRxfNcDovm1O8euvRrGRz/Xjr9u+jnn6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qN/5qjNG52zypfMWZw723fae1pM9iDpcvFWPqUnkZblJfBajrFNz1Xhhvm/eLWluG9eeQw+MmWc1i7p9NuVue21B7tCDJuXOPW9Ebs/2w9LVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv/rYOau54bzNmZP8qZaw/7YHtQ+zvtTjYo66TG0iP8tR4rRYZb2as8YNe6vxEf8a3zKN8+n7zM29uc+DuT4vnpT74qJaubr/eqbtggfub+vq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvrSGq/WW9QvHqoR1cvOHJ27mTPOX+RT9ZW9qP2YPYn1pjYVh9Uo8rRcJV6LWdatuWv8aDjs+W/S+C7YeG7S/MnY8dOnjHq7cv31e+QrOx+Wd3XvefpMqttpr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1O+7BuftzpzFyVTnX7YwnUE5hzGXUn1fvSe1L7M3UZ9bf+o0tYp8LWeJ22KX9WsOG0da7u18TO7N19464ah1X1WWP9M7f/fMSfkzlr6V/8fnK9LVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv/2R2sC5u7NndZMzSPHTWZTzGGcS9uXmmP2ZPYo6Xa1qPYpN8rbcJX6LYdaxuWw8aTLOx17zZH7izE35Rwb8qlA59uDC8c8fka7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeov6fefkexffPdg/qxmcwzqLdB6nvhZXnU3Yn8s58q+5p15Xs6rbrE/5Ww4Tx8Uy69mcNq60bZtZN2nu+GHnwl2zrivka/09Xd177r122uuX+lfbYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeo3zmJ757kRzHCOby9pPNYtYRzOfWVetsZhXhrr2q/Jh+r281J9ZsaxnqVy8RzMc26NreNL40HLOtRuPCeQYXZCx4rXHH0U+nq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeoP30XuX10qhF9D+O7CPWz/GlfJZY4n1NjOKdRe9qv27OKw/Yu8rMaVh1nrsrn1q+4LrZZ3+a4cab1+GbPFm5rPadQ2LIoXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530FvWrh+yPfA9nz2j/7DsJ5/LOptXV9hjyq7Mq5zVijjrM3tX+zR5GfJar1HNqGnndHLaexTjr3Fw33jRvWbC+cOHc79LVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv++gnZM4N/N9nO+k1E1yh/N5Z9TOaZ1VqredWTm3kX/t39Uk9nFik3peTStuq23kdzlOnDe3rXdz3rjTvt855TNc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfT+Mv6/rP9f4v8v+b/U679Sr/9Lff9X6vv/Uj//KfXzv1I//y318/9S//6n1L//K/Xvf0v9+/9S//1Hqf/+p9R//1Xqv/8r9d9/lvrvf0v999+l/vv/Uv/7j1L/+59S//uvUv/7v1L/+89S//vfX/6V9r8RDSYXmlc+VLh47RWFXeKoQqetP+en7fVYfp8htfPn7ndE24dGnpNr1eWl3OJPfswd3nHv2HZ+xPJd/xwHT7oxllf0j6fOfjhufmhkzP9kbGzo8lxs+c/L8fb0ylg3Y3YcvMP8qDd8Uex9xzvRdeb7Mb/rsrjk8hVxRPV+dvfJq+Jf369KV/eee6+d9vrpzw577LLPD3/88p84qnlw4cOJFzd+Ouihiz466S3q9/8Om7sX9u91eGHHtzbnd7z7gXzzkdMr146a2PaVf9yeG3Dg4tyzk5vEqHMOj759z4m1l1wdl9/ZN6444aH4+rORsfeIp2PvzlNi34Nfi9h7dnRrtyAOG7E41v1uabRvWV3b/emDmLP5o1jxn4+j3Z83xICjN8Zu/T6LVmf9O0Y8+O90de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1O/z8GzLTl/lvzuuf37g+4Mr61zxcdt6SwfnRrRcl/t3011jyNYT4pTLL4zFPW6NP9w3KLbP/mcah3PqTIlL950e358zN43X/zVeksbzmiEfxiMz18dv238Wuf2+jPVX/Cdu3vebOLbjlmi/7bu4/uCt8YcPtkbT3X9IV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Rf3mhM/Fu+n/uKvyrr1q5bbVHZG77C9f5XZquU+MurRDvLRzjyjbv2/MrV+d4wujo2mXSdHhX1OjTdc50WXDorjzzqVx+wlrovV+HyfmluM3Rf2u38RtN34fN23+MRp+/HMcOr5WdtTo2tnfL6yTvbK2Trb6iLrZHmfWTVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvUX91oW54fPR5ozuo3Lff7slt+XLVtFyzBmx/elr4+GB98ag7Y/Eb2NcnNnpxWhy6ozY9dCFaTz6bq5Kc/bonT6Pa3p8ncYxW7MtzhhUK2k6/NO62bdH1M9WZQ2ys361Q9Z82g7Z3ofsmE28ZsesUb+aq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peon6xwfowR3xO2v54769jXf7sePbQG2LKDffF8L4j4phzn4kTP3k1zT3rUcxa0HhdWr/znv46zWHj9sp/amfP7lEv2+W7+tnnA3fI5qzZMZv9bcOsz4pG2bqBjbP9WjTJHr6mSfbk2CbZkldrru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056i/rFRzHCOjFXfF76iKvlnw6KiY89FifXmZTWm3gsPotNZ6zbEA9c8VUal4+f+TmebF8nm/ZWvWzOzw0S+/BejbKNcxtn365ukj1QaJpt6NUsu/3nZlndy5tnR01qni1a1jy75eOaq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peon45QpwUK6wXc8bnpu9uHUelnPNk03wceMvCqPfssrhj0kcpbluXu7bZFp/0rZ29f2e9NHd/OL1hNqR14zSuf67dLHuwaY3GCfeXZY3KWmRzrmuRtZjaImuzoUX2mzrl2Q+NytPVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9RvzwpV4iXYoZ1Y+74/NhoOCUft0x5M+XnqVXrUlzu1+G7+Ob87SF2Wa/GZ+JOjbNPvmiSxs94njiuLDu7e4vs9K0tspGXlmf1ppRnf1tfnk3doSJ7Yc+KbPWBFdkFh9Rc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQW9asV5Es5Q9wUO6wfc8jnyFb3rStSzBGHrb+f5tTKLulRL63P/r9tlNbv3PbNsoOmN8/qrC3LXpxVo3nrkvKkrU2HimzvzhVZpz9VZL3Pr8i2nVWRrTmlIru/Q83Vvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv3pJzSBvyh3ipxhiHZlLPk82f3PQVylfD7iidorP4rY5uccVTbMjj68Zb3N43i3l2atby7MzTqzIlv+xIrv43GptR1Rk6+tWZHe8W55tfKI86/j38uzUi8uzx/9Yc3Xvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9SvZlQ3qR3kTzlEHE21a/V6Mqd8rmzLzzsPq5/N3rxjik3LWzRL6/SCU1pk/TuUZxM+K8/eal8zjvNyFdn0au47hpdnXx1Snh0wrUV22JktsllflGW1xpZlh/cuywZ1r7m699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3qVzerHdVPagh5VC4RT8UU68rc8vny0XfvhilXWY93nF2Wnf9ci+zux8rTOjZed1WPV7eNNeNKy+s/lmX3HlOWNb65efb2m82yNcc1y3q92TSbdE/T7A/X1lzde+69dtrrpz877N313/nED3/88o8DDy58OPHixk8HPXTRRye9Rf32DupnNaQ6Si0hn8op4qrYYn2ZYz5nvgY93Cw77s6yFLdPWlye1qv1e0vTijSXX53UItv4Yll26WPNsydubpbN7dw0O+rkJlnrTo2zDv0bZftsapitHdww+75nzdW9595rp71++rPDHrvs88Nf8lvtHwceXPhw4sWNnw566KKPTnqL+uVHewh1tFpSPaWmkFflFvFVjLHOzDWfN5/is3i9umNNDHtheXn2z2bladxOfr55Gs85E5tkXXdrnDQu2H/H7LKPGmTtl9fPRpfVzzYPq5fddFW9dHXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS+7/xr95D2kfZS6in1ZTqKrWF/CrHiLNijfVmzvnc+S6cV7POT5pcM9etZ3P4L981ycZsa5TN/7JG8w6f1ssm71w3a3Nr7azHIbWyi7r9HPsc+lOMnrMtXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530FvXbR9tLipP2FOpqtaX6So0hz8o14q2YY92Zez5/DOL23wa2yFbWr47LrZpln22pGe+zGuyQxvfqlbWzRvN+jqva/RDPnrEl/tZ4c/Qc/VV8ud+maDTmy3R177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvU7yzBflqMsK+SO9TXakx1llpDvpVzxF2xp81/87ZxwLJgXfMUw6zfGwZW10L31s8+vLhOGucPdv4+Ov3q65g67PPY8/UN0fXddbHsww/js7J/xcE3fJCu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnqL+q0HZwr21faW9lfipzpbraneUnPIu3KP+CsGWYfmovHAZL02rL1jWs8rv6iVGcdTHvo6Wtb9d9LW85g1cdm1y+O459+LMQcsjrVbFkWt4xelq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peon41onMV68P+2h7TPsteQ72t5lR3qT3kXzlIHBaLrEdz0rhge659vbS+b3nquzS3l967Pm54pCqmly1JWq/t8nr0nzQjPu01PdYvnRqDNr+aru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056i/qdqzlbcr7ijMF6sde03xJLxFW1p/pLDSIPy0XisZhkXZqbxgfjxTO2pDm8sWxtGk/jO3zz7HjglWkx4OEpUbn8mTjw7bFxyfNjYvHoJ9LVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv7NF+dEZk7rJWYP9tvVj32Xvof5Wg6rD1CLysZwkLotN1qc5apywWs/jZyyJM26cH0+cXRk7j5mcNHb43cj4v9zQqI7K0a3fwJjfbkC6uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6ne+6ozROVvKl4NqpTMH+257T+vJHkQdLt6qx9Qk8rLcJD6LUSluV89V44X5lY1vpLltXFt3fCzemTg4jrisX+yzsXf0Hn1FDHi5a2yaeGG6uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oun9X/1TXR87ZzU3nLc5c5I/1RL23/ag9mHWl3pczFGXqU3kZzlKnBarrFdz1rhhr7NqfHRd9Wga5wZ73hgnj/xTzDz2pBi5/1Exq3vreC3fKl3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRV9a49V6i/rFQzWietmZo3M3c8b5i3yqvrIXtR+zJ7He1KbisBpFnparxGsxy7o1d40fDZVT7knje949pyStL7zRNH7V8+vc4gtX5NZduThd3XvuvXba65f6V9thj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6jfdw3O2505i5Opzv+2YTqDcg5jLqX6vnpPal9mb6I+t/7UaWoV+VrOErfFLuvXHDaOtMz56MR49ebd4tsPNuamtX8m1+e5nrkv+/4m1+WC3dPVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv/2R2sC5u7NndZMzSPHTWZTzGGcS9uXmmP2ZPYo6Xa1qPYpN8rbcJX6LYdaxuWw8aTLOAyfclev8l5Vtr7v6r9NXvl1ZuXD3bytd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfT+r/7puix97+K7B/tnNYNzWGeRzuPU1+Kqswn7czlH/jX31OtqVnWb9Sl/y2HiuFhmPZvTxpW2Pzx3Q1uaPxg/IN/+ynx+6sbF6erec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6jfOYnvnuRHMcI5vL2k81i1hHM59ZV62xmFeGuvar8mH6vbzUn1mxrGepXLxHMxzbo2t40vjfcOfTa/slaDwlP9Wxe+vujodHXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9Rvb+j7NzWi72F8F6F+lj/tq8QS53NqDOc0ak/7dXtWcdjeRX5Ww6rjzFX53PoV18U269scN860Di37fWGPDtcX3u55d7q699x77bTXT3922GOXfX7445d/HHhw4cOJN507bqipA+ihiz466S3qVw/ZH/kezp7R/tl3Es7lnU2rq+0x5FdnVc5rxBx1mL2r/Zs9jPgsV6nn1DTyujlsPYtx1rm5brxpbnDSyMJV8Vy6uvfce+20109/dthjl31++OOXfxx4cOHDmc4Hqrnx00EPXfTRSW9Rv++gnZM4N/N9nO+k1E1yh/N5Z9TOaZ1VqredWTm3kX/t39Uk9nFik3peTStuq23kdzlOnDe3rXdz3rjTfv6uq9PVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSe8v4//L+v8l/v+S/0u9/iv1+r/U93+lvv8v9fOfUj//K/Xz31I//y/1739K/fu/Uv/+t9S//y/533+U+O9/Sv33X6X++79S//1nqf/+t9R//13qv/8v9b//KPW//yn1v/8q9b//K/W//yz1v/8t5X//D9QUUZd4nO3b96NVxdWHcaRIExAEkS69XDq3YODOkiYI0utVsZeIkhgj8hqiAUVFxYoKKnZsqCgWsIHGjohdgw0NYomvYAkaUZD3fvbJef+JI79s9t4zaz3fMzNrrZlzbpUqv/37V7Pxa1+f33htl02PrOlY1HDNkBmzB25+aW553VYflZ9Wo3k67f3B6ag2J6VD/3x+Wtt2cbp92R2p0Z6PpIHjnklnXfJqGvnSe2n/ulvSH4/ami5584d0w8m70hPNq8bzLWvE75+uGe/UrhOf7qwb1W6oF2Vb60eNbxvEKXfuHZ80bhhDDmiYXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH5305vX7/7e7V66Z/Msea0aecNfARcdeVr5497bybhd0SL9sHJMaXXBG2vnGJemMtjelfw24Py0pWpvq/bI+7f3IxnTtcVvSC42/SS+8/lPa8kaVOO2V6jF/eq2YcVHdGDatfmxfv3fU/qpRPLKqcTxVsm+cPqNpLJm6Xxy1e784/thmccv8ZtnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9ev8/Ds0UHrR647N5ryh9duaP8D3OL0uvTp6bRg+ampXMXpVPPuD293H1Vqr/i+fRL9bfTHQP/mY3Dj3N+SueN3iNe21IjG6/LnqmXjedFezaONjfsG1s/2i++39A8XvhTy7h8Q6v4dkvr2P54m6g3Yf/49Z794/11uat7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rx+c8Ln4t3XB+4qX/FzzzRq1uHp6cvPTSsXLE4/Fi1P8+Y/kVYvXZ9O/tv7aVPZl+nhN7anM7pXif89pUbM7V0nrjqrfiw6tFF8saFJxvzp5S3i3a9bxZX/aROXrWobG3u2j93HdYg9p3eMsc07xUU3dYoV2zrFtlqds6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rx+68Lc8Plo8+9OR6SOZeeldt9dm1aNvC/dMfqp1L/666nfmR+nD1ZvTf9e/3N676hq8fGbtbLxuLq0UTZnt73QLOp81zIbxz8XtYvWB3fINFW9vXOs29YlVuzsGm3f6habZxXF918Uxd+KusdHg7pnV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9ef1ig/VhjvictO2w9rq0ZOOKtPOyv6ep295MB/66OW16+bv0+ZG7k7lnPYpZjw5ukq3f1Xu3yuawcbtoRcc4e2Pn+OqhrvHU8KJYfF33uPrBHjHu6p6xaniv+GFDrzi+qHfMPqZ33Hl67urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN69ffBQjrBNzxeelj7j66NFvp4lNP0tb52zP1rl4LD6LTWeuaBrXfdciG5dhjdrHGbs7xiUXdYlrnuiWsc/s1TOenNcr1i3pHUfP6ROP9+obE5/oG/9o1y/2nNEvblrUL0bfkru699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3rlyPESbHCejFnfG76Pr3usyzn3D6kanyxo1ZMbtQgFi1qnMVt6/Ljt9rG44M6xh2pSzZ3N9TsESd+1jMb115r+8QxL/fNNJ41sjg2vVIc1/QsiS2nl8Qey0qi2lMl8eqLuat7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3v/XX5kn5QrxUsywbswdnx8b066uGpdfXTvLz73uaZLF5WuObBOvntg+i13Wq/GZ+0bPeGx572z8jOc+xxZHuw4l0WpVSZzatjT+MbM0ym8tjYufK43z3yuN+7eURtcvc1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvXn9agX5Us4QN8UO68cc8jmydcEBe2cxRxy2/l6f2yHKOnbJ1udh3/XI1u+S3X1i5+x+8c6NxXH+2TnNG67IaatatSz+vU9ZdGxaFqMalcVrdcpiZfWyOKpq7urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN69fvaRmkDflDvFTDLGOzCWfJ5snv9Eiy9eHd+qYxWdx25zc1rFP7Pmfvtk4mcPXlZXGRatKo82u0li+b1mU1K/Utq00Hn26NCZdWhpPHlEa7fuXRos2pXHavrmre8+91057/fRnhz122c/mQ6U/fvnHgQcXPpx4ceOngx666KOT3rx+NaO6Se0gf8oh4qhYYj2ZUz5XtuXnL8d3jasf6J7Fpnte7ZOt027VS+LQqqVx1p2lcfPu0mwcr/+5NC6t5J44tTSe/bIkfppVElVql8TVy4vj7aOLo2pxcRzZIXd177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100pvXr25WO6qf1BDyqFwinoop1pW55fPlY9qH3bNcZT1OqlscXU4uiSmH5tax8ZpcOV7Fd+TGlZZrHy2Ow7f3i00l/eKWBX3jgR/7xEEL+sS8IX2iS/fc1b3n3munvX76s8Pe5P/OJ37445d/HHhw4cOJFzd+Ouihiz466c3rt3dQP6sh1VFqCflUThFXxRbryxzzOfN15Ni+sVcqzuJ204W59W39jn45N5cvmlEST55aHGWH9otZpX1jSePKNVKtd+ys3yuaDe0Z2+/pEY+M7hHre+Su7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+uVHewh1tFpSPaWmkFflFvFVjLHOzDWfN5/is3i9ol4uhp13VWmcsj433s1P6ZeN5+KTekfxuz0zjUs/KYr+N3aLJld1jdM3dIkXJnSJkV1zV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9ef32kPZR9hLqaTWlukptIb/KMeKsWGO9mXM+d76v2Du3zvebmZvr1rM53Pvh3jHrsZ6x9J7umaYPlnWJ+W92ij0O6BgDvmwf52xtF59OaBe3tc5d3XvuvXbaZ59FZX922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3rt4+2lxQn7SnU1WpL9ZUaQ56Va8RbMce6M/d8/hjE7TS8JO59pl/U+GefWPNQr2z89n+2Wza+B17TMabtX1kXf7R/3L25dSwY3Crq1msZI8e0iI31WmRX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ715/c4S7KfFCPsquUN9rcZUZ6k15Fs5R9wVe6r+N28bByw33Nwvi2HW74jhlXuaYV3joTadsnF95sU2sfPFlnF/zeZx9E1N49zbm0Tq0TgOHrZPfPljo+zq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDev33pwpmBfbW9pfyV+qrPVmuotNYe8K/eIv2KQdWguGg9M1utHa4qy9Xzv8g7ZOM6u0SqOSc0ybQunNYrzT28QpzauF7ePrRtD+9eJt96rnV3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Ob1qxGdq1gf9tf2mPZZ9hrqbTWnukvtIf/KQeKwWGQ9mpPGBdu83Z2zddzwsjbZ3E7z9o1LajWKPs/Xy7TWPWnPWLyoWgw/o3IOdq4S/WbuTq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9OevP6nas5W3K+4ozBerHXtN8SS8RVtaf6Sw0iD8tF4rGYZF2am8YH4/yWbbI5POL5xtl4Gt+bS2tEiyVVovdeO9Kx479Prw7fmup0/Sqd0fxf2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb16/s0X50RmTuslZg/229WPfZe+h/laDqsPUIvKxnCQui03WpzlqnLBaz3e2rB9n/qdmdNiyRzzR4qdM4//e/2lqs/qDdNuj76Rau99If3zi9ezq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDev3/mqM0bnbPKl8xZnDvbd9p7Wkz2IOly8VY+pSeRluUl8FqOsU3PVeGFe0admNseN62vrtqTZnTamjZteSWV/eDZtPvjJdPLbq1Prcauyq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH71sXNWc8N5mzMn+VMtYf9tD2ofZn2px8UcdZnaRH6Wo8Rpscp6NWeNG/a7J36bak76JBvn5TWfSS+/+HCqec3daVbdW9IF912f5m+8Nru699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihi75sjVfqzesXD9WI6mVnjs7dzBnnL/Kp+spe1H7MnsR6U5uKw2oUeVquEq/FLOvW3DV+NBxT9Go2vq8PvCfTWmX6peneJvNTSbs5Ke4+I7u699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3r912D83ZnzuJkVuc/2CM7g3IOYy5l9f223D7O3kR9bv2p09Qq8rWcJW6LXdavOWwcaVnw1Z3pnNKr0nHfzUvLGx+XtrYelS5sPCB9uqAku7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzeu3P1IbOHd39qxucgYpfjqLch7jTMK+3ByzP7NHUaerVa1HsUnelrvEbzHMOjaXjSdNxrnRiHFpY+tuacmsuumzB7eVf3nTJ+Wu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+n3n5HsX3z3YP6sZnMM6i3Qep74WV51N2J/LOfKvuadeV7Oq26xP+VsOE8fFMuvZnDautPVLrRPNa8qvKl/544HlL+xokV3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Ob1Oyfx3ZP8KEY4h7eXdB6rlnAup75SbzujEG/tVe3X5GN1uzmpflPDWK9ymXguplnX5rbxpbHTsuPKR3ZuMHDlra88eeWKZmtc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfTm9dsb+v5Njeh7GN9FZPV+Zf60rxJLnM+pMZzTqD3t1+1ZxWF7F/lZDauOM1flc+tXXBfbrG9z3DjT2mLWuDVLb3tpzdIPv8mu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+tVD9ke+h7NntH/2nYRzeWfT6mp7DPnVWZXzGjFHHWbvav9mDyM+y1XqOTWNvG4OW89inHVurhtvmtde1XXtxReOXuvq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDev33fQzkmcm/k+zndS6ia5w/m8M2rntM4q1dvOrJzbyL/272oS+zixST2vphW31Tbyuxwnzpvb1rs5b9xpX3HjouwzcO+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNL72/j/tv5/i/+/5f9Cr/8Kvf4v9P1foe//C/38p9DP/wr9/LfQz/8L/fufQv/+r9C//y307/8L/fcfhf77n0L//Veh//6v0H//Wei//y30338X+u//C/3vPwr9738K/e+/Cv3v/wr97z8L/e9/f/tX2P+OPHvhmuNvaf7k4hVRvrnNhvIjxjdPRTEqxUlnpn1PvTJd8/4dqd6ux9LqT9anFpd9mKo2+jr98c8/p1c2VYuZu2rH29c1iPRk4/j8hGbxw02t4qxT2sZJb1TG7Lc6R9PZ3WL+093jiod6xoMTe8fnt/WJh+7oG82P6BeXre8X33+Tu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzev3/1onDy9/efXb5ed+0SbNXzghDekxL33/wOL0/nv3ps8feDpVxFvprUu3pIPu3p7+8soeUfJwrSht2CB++bJxNBzUPBq2aRNXLmgfbc/tHH0bF0WzQZV7/Pp94rZz+sXqm0viuJll8Yev+0e7tr+Lg+oPiPqrBkTj5gNj7ICB2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb16/z8Ozhc+2TXv1mZLWv3duuqrH9WlYy5VpeWU83bF1Y9rw6Vep83W/pFWX1Ijuj+0Ve0zeJxuHu7e3juLqHeLs67tk45XO7J2N5wFrSuPViQfE0qsGxM3zy2NWl4g0/8C48fpBcdufBscTtYbEvccMiQVzc1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvXn95oTPxbsla+anh79amqrd9VBq9etLqf6PH6YJ136TvvmfKlHnvFpx3I8N4sY3940FbVpFh0/bxbXtu0TPL7rHkOI+MahhZf0+v3/GfMXwFPNvOzAGrRgc5TOHxgWfDYsVLYbHI/uMiF2vj4j+Uw6O6bcfHEufyl3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Ob1Wxfmhs9Hm3fnPpzOWfZy+tsRH6d9Hv0+nTO9aqx/tE6M+HOjWHpls7ir5f6xoGmnuPTComw8hm4tzubs0rMGxmN3RjaObTcPjQ27D8o0PXDYyJh9+6g4/KFD4rULR8cV3cfELTeOiR6bx8TCn3JX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ715/WKD9WGO+Jy0nVf0Sfph2PZ079nV4v0ee8VrJY2j1dIWcesJ7bK5Zz2KWSfsKMvW7/EvRjaHjVv/40dEj8tGxpIZh8Qffh0dw8aPjaEnjYvdo8bH8b+Oj2XzJ8Q+mydEx2YTY0rRxOzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDevX3wUI6wTc8XnpY+4evEXe8W0yj3G7dtbZutNPBafxabOx/8uDr4rZeOy/aVh0XHViBgwaFQMOy2nueXn42JG/wkxe+zEaNB3Uvz+80mxx2mT47z3Jscj+0+JMSOnxC9Tc1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvXn9coQ4KVZYL+aMz03fS69vkuWciT93iKsfKIrq6/rE4JFlWdy2Li+9aGj8/qfhMfmHkdnc/evasdFk6fhsXD86fVI0nDc501i0x9RYeO7UGPrZ1FhUNC3uP3RarJw1Lf56du7q3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDevX56UK8RLMcO6MXd8fmzUPKRjxCHds/y86ej+WVweuu/g+Gvrg7LYZb0an54LxseJR0/Mxs94PtNsarz+/tR45ZRp0XrjtDi/Q0V8Pa0iDphTEcWXV8T06yti4425q3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH61gnwpZ4ibYof1Yw75HNkq+bZvFnPEYevvb2XD47MPRmbrs/Zd47L1e9CqSbG855SYP3lqFJfkNM8ZkdP2wKMVccvLlV42VMSOlyri7L9XxJFPVESDx3JX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ715/eolNYO8KXeIn2KIdWQu+TzZbL4gZfm6zkfDs/gsbpuTN3w4MR6+b3I2TubwiG3T4oCZFbHhoYqYVqlny3OV2pZVxImzK6LqsIqY0aQi3qhss+6dadF2Q+7q3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDevX82oblI7yJ9yiDgqllhP5pTPlW35eXGtQ2LoiWOz2FRx3qRsnW58fGrUfmxaFB1REWNW5cbx4JUVlTm8IvaoXxGn3TQt7uxeuc6fmhpDjp4a5+w3NVZ+NSXqfzAlu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzetXN6sd1U9qCHlULhFPxRTrytzy+fKx56KxWa6yHqs+MyX+0XZa1GiYW8fGq/rDFfHp4RXZuNIy/I9To849U2Lh15NjXEyOI++bFNvTpOj188R4d/PE7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN6/f3kH9rIZUR6kl5FM5RVwVW6wvc8znzFf9PSfHE9unZHH7hcG59Wr97pybm9sHVLKd3HlqfLb3lGi/dVIctH5iPPLYhFj+/Ph48edxcesx4+K46uPiL1vGZlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvXn98qM9hDpaLameUlPIq3KL+CrGWGfmms+bT/FZvJ7+XC6GFY+qiBbn5Mb7pXZTsvEctv/E2LxwfKZx1OIx8cWk0fHcyEOi3fxRcXrtUfHTxyOzq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH57SPsoewn1tJpSXaW2kF/lGHFWrLHezDmfO98Hvphbny+0r8jmqvVsDm+aMTE6nDo+Rh4zNtN04WGjou+FB8f93wyPr248KPosGxZX1h4WE94Zml3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Ob120fbS4qT9hTqarWl+kqNIc/KNeKtmGPdmXs+fwzi9te7psZhZ06JhxdPilNmTMjG79UzR2fj+80hI6LmPyrr4quGxNRrB0XZjojHn02xo3qKC54rz67uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9OevP6nSXYT4sR9lVyh/pajanOUmvIt3KOuCv2WH/moHHAMqrSrxhm/f64a0z03Dkqjnl3RDaufzp7cNxzdsQRawfG3lN+F30P7x9bPy2N//xSEovvK8mu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+q0HZwr21faW9lfipzpbraneUnPIu3KP+CsGWYfmovHAZL1efPqYbD0fdvTwbBw7PRnR8IcBmbbfNSiJkqK+0Xp9r5i4Z8/497bucc7l3bOre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk968fjWicxXrw/7aHtM+y15Dva3mVHepPeRfOUgcFousR3PSuGDrtWpkto6fGjY4m9tflx0QA58qjo/n9M60Ptamawwb2Sl+7N4hTt/ULkbMbJdd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfTm9TtXc7bkfMUZg/Vir2m/JZaIq2pP9ZcaRB6Wi8RjMcm6NDeND8Z+bw3K5vCPc8qy8TS+Y7d2jnVj2seLA9vEUR+3iGsObRb91jeNfw1pml3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Ob1O1uUH50xqZucNdhvWz/2XfYe6m81qDpMLSIfy0nisthkfZqjxgmr9Tzlrd7ReUW3ePO6DrHwudaZxmWXNo505d5RZVG96LuqbpzQuG52de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNKb1+981Rmjczb50nmLMwf7bntP68keRB0u3qrH1CTystwkPotR1qm5arwwT/+yaza3s/Fu0SS+Wlc/mneqHS/PrB43f1AlXhq0K81Z80tyde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNKb168+ds5qbjhvc+Ykf6ol7L/tQe3DrC/1uJijLlObyM9ylDgtVlmv5qxxw37uJ83jwU8aZeN87uPVonPJz+m4at+kN//n87Sl+T/TP4d9nF3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRV+2xiv15vWLh2pE9bIzR+du5ozzF/lUfWUvaj9mT2K9qU3FYTWKPC1XiddilnVr7ho/Go56pXY23j2Wf5tpnf7yW6n2uevS7F+fSbv+/nR2de+599ppr1/Wv9IOe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvXn9vmtw3u7MWZzM6vyTxmVnUM5hzKWsvl+W28fZm6jPrT91mlpFvpazxG2xK1vvlXPYONLy2dSt6ePb3kt/P+LF9ODs1emtncvTLf+5Nb3W5+bs6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KQ3r9/+SG3g3N3Zs7rJGaT46SzKeYwzCftyc8z+zB5Fna5WtR7FJnlb7hK/xTDr2Fw2njQZ5xOuuC+t++t1qWuXi9O+zeelFd3mZFf3nnuvnfb66Z/Fg0p77LLPD3/88o8DDy58OPHixk8HPXTRRye9/1//3NYn+97Fdw/2z2oG57DOIp3Hqa/FVWcT9udyjvxr7qnX1azqNutT/pbDxHGxzHo2p40rbWcsvCrTvGTHpHTCfgNS0Xt9sqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rx+5yS+e5IfxQjn8PaSzmPVEs7l1FfqbWcU4q29qv2afKxuNyfVb2oY61UuE8/FNOva3Da+ND5bbWjqtWGf9NLCzeVFm14qd3Xvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSm9dvb+j7NzWi72F8F6F+lj/tq8QS53NqDOc0ak/7dXtWcdjeRX5Ww6rjzFX53PoV18U269scN860fvGX+8ofaN+8/IhjFw90de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNKb168esj/yPZw9o/2z7yScyzubVlfbY8ivzqqc14g56jB7V/s3exjxWa5Sz6lp5HVz2HoW46xzc91409z69R+evHX6eWtc3XvuvXba66c/O+yxyz4//PHLPw48uPDhzM4HKrnx00EPXfTRSW9ev++gnZM4N/N9nO+k1E1yh/N5Z9TOaZ1VqredWTm3kX/t39Uk9nFik3peTStuq23kdzlOnDe3rXdz3rjTfusxLde6uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oun9bfx/W/+/xf/f8n+h13+FXv8X+v6v0Pf/hX7+U+jnf4V+/lvo5/+F/v1PoX//V+jf/xb69/+F/vuPQv/9T6H//qvQf/9X6L//LPTf/xb6778L/ff/hf73H4X+9z+F/vdfhf73f4X+95+F/ve/hfzv/wAHH+ereJzt2/nDzlX+x3E1SY0iqSSJYTChLGFCrrciLZTsUsgSEeG23vdN2Zd70aIprePbtGlRfb+j0q5lUlO0aWoK06ZtpJpUQ8v3epyrq3/i4pePz+dzzvv9fF3nnPf7fc513VWq7P33RdV5XRq23t3lpXs7ZOr0nZh5etkVmdVVVmf+7/CnMse+ujmzuvNnmYbDfsx8tKpa1Pm+ZpSvqxMnf3ZMDLy8SXx3b4sY2rNNbJjQISbV6RyXnRNRrX63+M+8HvHjgjNiVbNecfCUs6Pe6HOi8359Y1L/ftFlUP+4tcaAOHL2gChdlbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3r9/9PbjwxU/2YKZnN/VdkBtxxT2bg8mczVQ99J/NFpy8zPx6wb3Q4p3r857va0bLq0bHfnMbx5Ojm8dT61rHoug5xw1ed44ZNXePojqfGXSecEY892ytu+ap3zHmybxx3woA4uc+g2FH/3PjuxiFxz6vnxStPnB8rxwyNm18cGm9/nru699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3r93l49vYpV2euK16T2drp+cwdy7dmBs/5JrNtyX6xuFmNmNyoTtw0p0FEplk8OO74KK/aPo3DCbd1jcf/empU63VmGq/nj+2bxvOZiYNj0H7nRZNTh0bz9sPjp7cuiA3tRsYfeo2Klo1Gx6nrRkeH2hfGoW0uTFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvXn95oTPxbu7j9mQeb7nvzJHHPhdZmWr/eOKFofECXPqxqxjG8WK9s3ji9vbRLMFJ8ahr2RizYru0fiNM+Lha8+Olz7sG39fPzAatB+SmOt9Pzxq9B8ZLw4bHc/XHxOHXDM2Tnzpoohnx8WSeePj6f0vjo8HXBxNJ+eu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+q0Lc8Pno81n732XeXHfavHC8Fqx4qB6Ub3G76P/uJbxauN20bRb52j78slRa8NpUafTWWk8Nt40MM3ZpscPi1MGj0jjePdVY2LQ/RclTZ0OmhD7DJwY20ddEud2mhT1tkyK5r0nx0NXTY7DV+eu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+sUG68Mc8Tlpe+bfasXC1+tFh1ZNYvTW42Lw9vZxR68u0aJO9zT3rEcx68vV56b1u3PmiDSHjdvTh4+PB2NCNKp3SXy3ZlJs2mdKvFy3KJb9UBQ710yN49pPi5uumhb3vTAt/vVO7urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN69ffBQjrBNzxeelj7h62Mrj472vO0Sr2zJpvYnH4rPY9MDh58drgy9I4zKneGzcN2Z8PPfVhNjYKKf5tmuK4ptPpsY+VabHde9Pj6+vmRHljWZGzbKZEa/OjH/snhmLDpiVru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij0568/rlCHFSrLBezBmfm75H9vpjyjlb7uoRDUacFZXF/eKl3YNT3LYu63QeE1/fOS623TYhzd2qk6bEn3tNTeM6tsmMuL5NTuPaB2bFEe2KY+OfiqP+u8XRsXpJdG5aEvu3yl3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9P46/7N5Uq4QL8UM68bc8fmxccUPPeKFH85K+XnsoUNSXN74t1Gx/6axKXZZr8bn4ROnxle1cuNsPHu+OCuGlBfHgPolcefSkqi5uSSmH1gaz7QojSe6lsbHPUtjRO/c1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300Unvr/k/WyvIl3KGuCl2WD/mkM+RrSdX9U8xRxy2/g745KKYVDEhrc8Vg4vS+n1lzIxot21mHLx/cTzxUXHSUPW/JUlbp3Gl0aK0NIZeWhoLikujWlFpfHpxaawcl7u699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3rVy+pGeRNuUP8FEOsI3PJ58nmrSdekPL11ZXjUnwWt83JppXTIzMsN97m8Gs3l8TT9Utj0OjSeH9OaUycntU2oDS+bFYaFbtK4pvnSuK8P5dEv8Ulcdec3NW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJ76/5P1szqpvUDvKnHCKOiiXWkznlc2Vbfv7duonxcp0pKTZ90H5GWqcjLy6Oq8aVxNoapfHWmNw4vj6iNP6W5S5/oiT29C6J1luK48TJxfFyreI46IVZ0fmGWXFtee7q3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDevX92sdlQ/qSHkUblEPBVTrCtzy+fLxxXdpqRcZT1WFM2KC14rjuXrS9I6Nl6V2fGaeHBpGldaXm1QHFefl41/N82Mt3fOiE+GzohLd06PdXdNjwtW5K7uPfdeO+31058d9ip/mU/88Mcv/zjw4MKHEy9u/HTQQxd9dNKb12/voH5WQ6qj1BLyqZwiroot1pc55nPma+WDM6L7bbNS3O79n5K0Xq3fRW1K01x++tXi2PWPWTFp/cy496YZ8Uppdo2MnxbtZkyNPncXRcvaRbHjr1PiN3+akq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9OevP65Ud7CHW0WlI9paaQV+UW8VWMsc7MNZ83n+KzeL19Wi6GPb6nJG5tW5LGre/rM9N4bnplWkzoMjVp3Hza5JhcdVKctWdi3NNuYvy0bkLMv2JCurr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzeu3h7SPspdQT6sp1VVqC/lVjhFnxRrrzZzzufP94szc+jznjdxct57N4YvqZcev4dR449ApSVPtgybGYx0vjo6rxsXU3hfFI/3HRr1HxsQ7i8akq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH77aHtJcdKeQl2ttlRfqTHkWblGvBVzrDtzz+ePQdyesaY4Pjx2VnQ5fUbsOmpaGr/BzSel8Z3147i4ckm2Lu5+Ybx3xqh4avWI6Dbtgpi/dngcMn14urr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzet3lmA/LUbYV8kd6ms1pjpLrSHfyjnirtjT6Ze8bRywbK42K8Uw63fumuye5p6J8fni8Wlc9xw/Otq1GhEfXzIsrtv//Hj0oCEx4+rBMe+eQdFw2KB0de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNKb1289OFOwr7a3tL8SP9XZak31lppD3pV7xF8xyDo0F40HJuv18CaT03r+sNa4NI73TRgR1982NGl79smB8cQ7/eLO0j6x5cHeMefPZ0f1k89OV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9ef1qROcq1of9tT2mfZa9hnpbzanuUnvIv3KQOCwWWY/mpHHBtm7MhLSOz/h2VJrbMz4ZEs9NGhjjWvZNWru9cmZs2n1azN1yavy0vHu8Vr97urr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzet3ruZsyfmKMwbrxV7TfkssEVfVnuovNYg8LBeJx2KSdWluGh+Mjy8Ylebw3JbnpvE0vm/ddEb0+7l7nLOja3x2eZdoUD0bb0o7xtRvTkxX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ715/c4W5UdnTOomZw3229aPfZe9h/pbDaoOU4vIx3KSuCw2WZ/mqHHCaj1vW9A3HhjWK87v2SOOmN41aczuxOL5U9pGWbdW8diY4+LLZ1umq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOFefvKnmluG9eGL3WIaSWt49Y3m0e/Y5rGsRWN4pI+DeO0yxukq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrqSvqxOevP61cfOWc0N523OnORPtYT9tz2ofZj1pR4Xc9RlahP5WY4Sp8Uq69WcNW7YD77ypOh8Zbs0zgdf3CTq//2Y6Ny2bnz978Pihy6HRkm/Wunq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDevXzxUI6qXnTk6dzNnnL/Ip+ore1H7MXsS601tKg6rUeRpuUq8FrOsW3PX+NHw6ewWaXxXVT0qaX34T9WjRtH+8Vyr38TSWvumq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH7fNThvd+YsTqY6v25ROoNyDmMupfo+uye1L7M3UZ9bf+o0tYp8LWeJ22KX9WsOG0daZp9/ZBTPrxGfDa8az721O/Px0C8yawdvz7x/1Qfp6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KQ3r9/+SG3g3N3Zs7rJGaT46SzKeYwzCftyc8z+zB5Fna5WtR7FJnlb7hK/xTDr2Fw2njQZ5+Kvv8y8u2VL5qRlGzPHlj6bGf/tU+nq3nPvU7tse/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PeX+uf/v3S9y6+e7B/VjM4h3UW6TxOfS2uOpuwP5dz5F9zT72uZlW3WZ/ytxwmjotl1rM5ncY1q61sxz+S5m1b7s302LEqs/qsG9PVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9ev3MS3z3Jj2KEc3h7Seexagnncuor9bYzCvHWXtV+TT5Wt5uT6jc1jPUql4nnYpp1bW4bXxp3jbwtc/dplZmyA2ZlTmpzcbq699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466c3rtzf0/Zsa0fcwvotQP8uf9lViifM5NYZzGrWn/bo9qzhs7yI/q2HVceaqfG79iutim/VtjhtnWq+/bGimds/jMletqZuu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrz+tVD9ke+h7NntH/2nYRzeWfT6mp7DPnVWZXzGjFHHWbvav9mDyM+y1XqOTWNvG4OW89inHVurhtvmk895JUudzdd2sXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9ev++gnZM4N/N9nO+k1E1yh/N5Z9TOaZ1VqredWTm3kX/t39Uk9nFik3peTStuq23kdzlOnDe3rXdz3rjT/s/f3PuYq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PeveO/d/3vjf9783+h13+FXv8X+v6v0Pf/hX7+U+jnf4V+/lvo5/+F/v1PoX//V+jf/xb69/+F/vuPQv/9T6H//qvQf/9X6L//LPTf/xb6778L/ff/hf73H4X+9z+F/vdfhf73f4X+95+F/ve/e/8V9r+ylt0yf1l/Web+u2/MbP7xoUzF1lczRQM+y2TWVon/XlU9Om44PKaf2yDO7PmHmH1L69g56sS4/eqIRzv2iPMG94qnd/WJ4+oMijfWnxcf7h4eFz8/Kga1HBsjjx8fVV+bEEX1JsXcGlNi1ZqieOOnqXHLPtPjwHXTY07TbF1z5ox0de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNKb1+//mb/clNn0wbrMzavfyDT4YUfmiq/2jbEn1Ih3nz8yRvxfo7hhd4sYfEu7uPK+k2Jcs2zcr9kzmkzoE592GxRVbjw/qpSMiHkfXBg1t2b3h5MmRrUbJ8f746bGlVumx+17ZkbfDcVx/mmlUWv27Gg/bk78eMilse/0SyNzTe7q3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDev3+fh2V+u3ZwZtXFn5o3T9ouHv6oZtT49Krq3bRKfv3p8bH7pj7HvH7rGrZ+cFkcd1ju+vG9AGoeVvUdEo+FjYsK349N4tXyjKI1nsyOL47E1pVG2c04s33ZZPLB+blwzaV702DMvzhgzPzY/MD9e3jo/Ht2Ru7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzes3J3wu3j2ybr84/ZVD4svjj44f324auza3jpXNOsWW10+J77edGX379I2K486NmSXDo3bmwlhy6fg4+pRJ0ebyqdF6wsxYuK0kMXftMzc6XjYvVi6cH0eMXhCdGi6Msx9dGH3/uCi+/dOiWPHWomhaZXGcevDidHXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSm9dvXZgbPh9thtxwdLS6t1kc/9u28f2DnWPyw91jXe2zosPG/lG247y4ZubImFF0Ucz+cGIaj7anz0xztvytS6P/PrnxXXrzghh278Kkqfd5i+OEKkuiyZIlMfzrJfFUt6Xx/OylsfzmpfH46tzVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9ev9hgfZgjPidt75vcNj6dc1Lc8Pap8cLSs+PxKwbGQd8NjSvWj05zz3oUswb0L0nrt3mteWkOG7faFyyKGtMXxzMjl8SalkvjqDeXRt2Ry2Lm68virpZl8cKksph3c1n89pGyaPRM7urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN69ffBQjrBNzxeelj7hafErv6HHToFjRe3hab+Kx+Cw2HfHU7Lhx3tw0Ll/VWhhlSxfF4RsXx/XblyT2RauWxT1nlMUJm8vish7lcfeq8pi1vTw6HVURr3WpiJv7VmTjdO7q3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropDevX44QJ8UK68Wc8bnpO+fbQSnnnDxgbCysfkl83XhatL6tOMVt6/KJogVx97GLotGdi9PcXXvQspi/Z1ka1+1jy6PKF+VJ48FrKqLLzoqo27AyTu5WGZuGVMY5F1XG2gm5q3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH55Uq4QL8UM68bc8fmxsev2sXHcHZek/PzSYyUpLl934vxYe9LCFLusV+Oz/Ktl0WJrWRo/4zn4kYrYdlRlbBlVGYuvq4xHnqyMHW9XxmGfV8aVuyqj6Z7K+OCH3NW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb16/WkG+lDPETbHD+jGHfI5sNe45PcUccdj6++MLC2P8DYvT+pw9b1lav9cvLY+XuldEx7cqotbpOQ1rX81p23Tg8thw6PIYcdjy+KbW8uhQY3k0q748fj4wd3Xvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSm9evXlIzyJtyh/gphlhH5pLPk82FU+amfP1DvUUpPovb5uTf6pVHn/1y420O33Brdiw/rIxh1ZZH46yeT2tmtf1cGS0+rYzvN1VGy4cr41/ZNuevrIwDrs5d3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfTm9asZ1U1qB/lTDhFHxRLryZzyubItPz/TZknUfW9pik2/n5xb3x/8tjJ+WFYZle9Wxs0H5Mbx6P2Xx+FZ7ll/rYzWcyrj71n23gdn1/jWinh4XUW8cktF/HR97urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN69f3ax2VD+pIeRRuUQ8FVOsK3PL58vH7m+XplyV4vnyihiVqYzda3Pr2HgVZ8fr03dy40pLvY8q4of5FfF444po8HJ5NFtYHl/1Ko/Lm5fH+8fkru4991477fXTnx32in+ZT/zwxy//OPDgwocTL278dNBDF3100pvXb++gflZDqqPUEvKpnCKuii3Wlznmc+br0vvLY/MdFSlu/3Njbn1bv7t25ObyYVm249ZXxGftK+LAW8vjqNrZNVJWFr0OKYt37loWG4Yti9WtlsVfG+Su7j33Xjvt9dOfHfbYZZ8f/pLfrH8ceHDhw4kXN3466KGLPjrpzeuXH+0h1NFqSfWUmkJelVvEVzHGOjPXfN58is/i9e01czGs1uuVsfCS3Hi/k6lI43n942XxyX9yGusXL43P/rEk3u67JJbuXBxt/ndxTL0pd3Xvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSm9dvD2kfZS+hnlZTqqvUFvKrHCPOijXWmznnc+e7Tq3cOh/yZG6uW8/m8Pb3y2LZR8vixq05zSe9szgO+TpbCzdZFP+evTAu/3lBdP3fBdFwZe7q3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvroTPvWX/7ZR9tLipP2FOpqtaX6So0hz8o14q2YY92Zez5/DOL2xJaV0WR8Ni4Xl8e9I8vS+A37bEka3539FsWeIxfGiu/mR+Pd86J283nR//K58U2rbEytmbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz460579l3/OEuynxQj7KrlDfa3GVGepNeRbOUfcFXs2/ZK3jQOW+lm/Ypj1W3RPthZqsSTuXLkojev9E7J73H/PjV51L4uf7p8dDR8qyc7n4vhoYO47Hlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UdnOj/45Z/14EzBvtre0v5K/FRnqzXVW2oOeVfuEX/FIOvQXDQemKzXx8cuTeu5ydbceJdVnxc/9740afvD+JnRePG0OLhpUZw8YnK8d8akmPz5Jenq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvroTGcov/xTIzpXsT7sr+0x7bPsNdTbak51l9pD/pWDxGGxyHo0J40LtsuXLk7reNA589Pcfueq7Fw6amZsfLMoab2z5OJod9tF8eGSMTGq44XRYcPodHXvuffaaa+f/uywl+LG0txnkPJEcS4e4MCDCx9OvLjx00EPXfTRSW9ev3M1Z0vOV5wxWC/2mvZbYom4qvZUf6lB5GG5SDwWk6xLc9P4YKxVZ36awx+9WZzG0/h2OX18PLT6wlh77Yg4u9OwWLj2vGjUdEi8dfO56erec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikN6/f2aL86IxJ3eSswX47rZ/svsveQ/2tBlWHqUXkYzlJXBabrE9z1DhhtZ67Hz81jjhwYqzfNSZKG4xIGld8OjBa7ugbX+zoHb+rdXb0n3RWurr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpzet3vuqM0TmbfOm8xZmDfbe9p/VkD6IOF2/VY2oSeVluEp/FKOvUXDVemHt2m5DmdhrvGYPird/3iQPn9YyHN/SI5R26xet7usY9Hbumq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PevH71sXNWc8N5mzMn+VMtYf9tD2ofZn2px8UcdZnaRH6Wo8Rpscp6NWeNG/YpnYfGqs4D0jgXHd4j5k+PWPVuxxh0bfsY8Unb2PZjm3R177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100vvr+Vc2HqoR1cvOHJ27mTPOX+RT9ZW9qP2YPYn1pjYVh9Uo8rRcJV6LWdatuWv8aDi7Wa80vlXv75S01u/aMqYe3Sya/7Nx7Hi0Ubq699x77bTXL/XP2mGPXfb54Y9f/nHgwYUPJ17c+Omghy766KQ3r993Dc7bnTmLk6nOH7ksnUE5hzGXUn3/c25fZm+iPrf+1GlqFflazhK3xa603rNz2DjS8t7+HWNry1bR+7dN4/kjjonBb9eJJ9+sHW9OPTRd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfTm9dsfqQ2cuzt7Vjc5gxQ/nUU5j3EmYV9ujtmf2aOo09Wq1qPYJG/LXeK3GGYdm8vGkybj/D+N60a/62rGb3ZWi/9+vG9c32SfdHXvuffaaa+f/ikeZO2xyz4//PHLPw48uPDhxIsbPx300EUfnfT+Wv/8NDV97+K7B/tnNYNzWGeRzuPU1+Kqswn7czlH/jX31OtqVnWb9Sl/y2HiuFhmPZvTxjVp+5+DkubVbXdmDjnl/czUW7akq3vPvddOe/30Z4c9dtnnJ/nL+uUfBx5c+HDixY2fDnrooo9OevP6nZP47kl+FCOcw9tLOo9VSziXU1+pt51RpP1Ydq9qvyYfq9vNSfWbGsZ6lcvEczHNuja3jS+NTzy0PTPtxo2Zmuc+nhm748F0de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNKb129v6Ps3NaLvYXwXoX6WP+2rxBLnc2oM5zRqT/t1e1Zx2N5FflbDquPMVfnc+hXXxTbr2xw3zrRec9j9mX67r83Ubrk8Xd177r122uunPzvsscs+P/zxyz8OPLjw4cSbzh2H5OoAeuiij0568/rVQ/ZHvoezZ7R/9p2Ec3ln0+pqewz51VmV8xoxRx1m72r/Zg8jPstV6jk1jbxuDlvPYpx1bq4bb5offGB85pPHeqSre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk968ft9BOydxbub7ON9JqZvkDufzzqid0zqrVG87s3JuI//av6tJ7OPEJvW8mlbcVtvI73KcOG9uW+/mvHGnvfWh/+zi6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KR37/jvXf974//e/F/o9V+h1/+Fvv8r9P1/oZ//FPr5X6Gf/xb6+X+hf/9T6N//Ffr3v4X+/X+h//6j0H//U+i//yr03/8V+u8/C/33v4X+++9C//1/of/9R6H//U+h//1Xof/9X6H//Weh//1vIf/7f+cv3xt4nO3b94OVxdUHcGPeWIgFBZEorzUWEBR0UWx7KIpRUEGNCjaiohEBQREbRTosfVmWrfQFlt1FIlEsWEhs2BL0VVTEgsaeEAsaBPS9n7ne/BNXfhnmmVO+32dmzjkzz91ddvn539PvzC/s2fKJwhO+2Vj4+67fFY6ftUdse7lpjOh1WJx6ynFxV//28cDOwijack6s6dojTtjj8viowzWxfVPfqNxxc+xaMTgGPDo0mt5wTxw5b2S8/sCo6P7HMdHz07Fx5Onj481rJkSfXhNjUMtJUbR+Unx5UVEsXlEUV/+jKGZ8l231PTdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544pvj7/+Pf/524YWttxXuu23PuHBhs/j77CNi6YY20aJ/h1hwWefYOLdblHW9JNZffGXUvnBdXLeqX/RtPDhafjI0OnYcFodNvzfe++voOGbt2Fg5aXwcedjE2G/CpPj0yaL4+m+T49wHp8TLt0+NYxtPi0fGT4u5b02LBXtNj/jf6anV99w4OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXolfhie+Of7eh2f7DWoUgycfGE2/ODL+M/uE6Dn1tBjz+llx3NAL4oDBl0XnF6+JD6fcGL0fGhhtL7k9zcMXd90bf/rFmLj0/HFpvk4+Y1Kaz4Krp8SI2qnxj3XT4uO102P9rBnxYKeZccNLM+OmDsWxdUxx/HNlcWx8Itvqe26cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxDfH35rwXox9f9VvY+KQttH21dPjzBFdo/3dPeKNF3rF/955bXQY2y+Ktw6OF9ffGasPGRktB4+O6/cbF8ffNiEeKp8UHSZOjs2dspz7HDkjevWcGasvLY6TT54Vvb+aFQOnlsSte86OZn+cHauWz46ur8yOvu9mW33PjZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH5745vjbF9aG90OmPM6IW3qeEwNX9IwOV1wRK6+8Prat7h9Dbx0Sz8+8Jz7fe1Rc8euxcfVT49N8nDp0clqzfQunx22vzkjzuGzQrBgxsiRxuqVNaVz8Smmc3WtOjHxqTrx3QFl8fEFZrBhUFpvuybb6nhsnR54efXbYY5d9fvjjN623DA544IIPTnjhhh8PfPDCD098c/zFBvvDGvGeyG5pelG0POLK2Di8b+zRZmDsLBga3SuHxycnjk5rz34Us87bMSXt3/M+mJHWsHk76cTZcfw5pfFBwZx4+Yc5cdqysji1oDzm1JTH8z+Ux6edKmLBoIpoNaUiOs/OtvqeGydHnh59dthjl31++Et+M/7hgAcu+OCEF2748cAHL/zwxDfHX3wUI+wTa8X7oiOuPvzRwBjf6Y549esRab+Jx+Kz2HTcidNizcXZ+d7vw1mxvPfsaD+/NB55KMu55tbyePHgirh4aUXMa14ZL9xaGWUPVUbvLyrjq32r4vHfVsXs47KtvufGyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xz/OUIcVKssF+sGe+N7mMVd6Scs3bYmNi8YXz85sNJ8dDiKSlu25fvnDUrXtheEp3vLk1r97V3ymLhS+VpXnc7rTIOfbIycWxzb1VctbYqTv2qKv5wQHVsaV0dg06rjtcKs62+58bJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfHP85Um5QrwUM+wba8f7Y6OiZkysPmpCys/j205NcfnhRsXx2j4lKXbZr+ZnxV/Lo9vKijR/5vPOKVXx4xdVsbN9dSy5uTremlkde9dXR8Fj1fGnZ6uj60vV8cu/ZVt9z42TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Ob4qxXkSzlD3BQ77B9ryHtk6/47ilLMEYftv8sqS6JoQGnan1UXl6f9+0jvyviiWVX0Wl4V7Q7KcnhtUZbblo3V8cmH1THqo+pommkvfa86ztlUHYe8nW31m/40To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOKb469eUjPIm3KH+CmG2EfWkvfJ5uIuM1K+bvGvkhSfxW1r8qN/VsTg1yvTPFnDjw7NzOWD1THizerokuGz5+YMt1eqo9uj1dF8YXV0L6qOXe6ojmH9quOYG7KtvufGyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xz/NWM6ia1g/wph4ijYon9ZE15r2zLzx/8ck6cuqosxaazOmf39y83VcXBV1ZHw4rqePyt7Dye8UZ1tM/gLhtfHT0urI7PMthveTcTA1ZWxRuTq+LfQ6rikAHZVt9z4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+/63/MnWz2lH9pIaQR+US8VRMsa+sLe+Xj4PWlaVcleJ5n6oY07g6DpqY3cfmqzwzX3uuyM4rLqevrooWv6+KTVsrI+ZVRtdLK2O/Qyvjvh0VseuXFanV99w4OfL06LPDXvlP64kf/vjlHw544IIPTnjhhh8PfPDCD098c/ydHdTPakh1lFpCPpVTxFWxxf6yxrxnvuaOroytd1WluP39/Ox+tX8PeDK7lgsy2M6fVRWN9qiKlkMr47R/ZPbIlRXRf3N5bB9WHp+0LY91vyiP//uyLLX6nhsnR54efXbYY5f9pj/Fh+Q34x8OeOCCD0544YYfD3zwwg9PfHP85UdnCHW0WlI9paaQV+UW8VWMsc+sNe+bT/FZvH7m/WwMa1dTHYs7Zud7e+OqNJ+PTK+IPZ7Jcj2zW1k0Wj4ntv12TixbWxo9x5bGrFuyrb7nxsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh+PdN7M8MIPT3xz/J0hnaOcJdTTakp1ldpCfpVjxFmxxn6z5rx3vk/5ILs/756ZXev2szW82wMVUbu6PNaszHK+sqE02j6VqYW/K4m9LiyJ+9bPij5jZ0XHftlW33Pj5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ745/s7RzpLipDOFulptqb5SY8izco14K+bYd9ae9w+DuD31h4zvMzJxuVtlvFRQkeZvxJo5aX73PXp2HPz5rFi1rji6vDgzTtwxI4b8YUY02XVGvPX+9NTqe26cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxDfH312C87QY4Vwld6iv1ZjqLLWGfCvniLtij/1nDZoHWM7M+BXD7N/iEZlaaGdpPNdvdprXvxdmzriPz4hnrp4e81pNi5VtpsbUwVNi1s7Jce3rk1Or77lxcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98cf/vBnYJztbOl85X4qc5Wa6q31Bzyrtwj/opB9qG1aD5gsl83nVqW9vPZK0vSPC7fNCMO/T7LuWDC5Gh3QFEc/Y+JsXbXibHfHRPijXMmpFbfc+PkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvjn+akT3KvaH87UzpnOWs4Z6W82p7lJ7yL9ykDgsFtmP1qR5ge2+3qVpH99xRHFa21Mrp0b7aybHhDMnJa5Dpo+LR347NvZvNibWDxwdp588OrX6nhsnR54efXbYS3Gjd/YdpDzRLRsP4IAHLvjghBdu+PHABy/88MQ3x9+9mrsl9yvuGOwXZ03nLbFEXFV7qr/UIPKwXCQei0n2pbVpfmBs9+nMtIaLH5uS5tP8xrdjY8eS0fF99b0x7Z3h8VSve+La5++K5l3uSq2+58bJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfHP83S3Kj+6Y1E3uGpy30/7JnLucPdTfalB1mFpEPpaTxGWxyf60Rs0TrPZz55smRd2lGT/nj4lNf7g3cXxl6tDoP/PWOL74lvjDAwOipMmA1Op7bpwceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDE97/3n5+OTXeM7tnkS/ct7hycu5097SdnEHW4eKseU5PIy3KT+CxG2afWqvmC+Zmvx6W1neb7oDui+bpBce5RN8d/+t8QL791bew/v098sema1Op7bpwceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAevxC/DE9//7v9Mfeye1dpw3+bOSf5USzh/O4M6h9lf6nExR12mNpGf5ShxWqyyX61Z8wb7n94dFu+9OyTN8/0P942//OaaeO/eXjHn9N/H/CkXxaELe6ZW33Pj5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ745/uKhGlG97M7RvZs14/5FPlVfOYs6jzmT2G9qU3FYjSJPy1XitZhl31q75g+HaS/cnOb37Et6J65XfdgtVj3ZNfqN6BJt+nROrb7nxsmRp5f0M3bYY5d9fvjjl3844IELPjjhhRt+PPDBCz888c3x963Bfbs7Z3Ey1fkF5ekOyj2MtZTq+1ey5zJnE/W5/adOU6vI13KWuC12pf2eWcPmEZfD6y6PQ9ZfENNXnB27P3pmlA0/JX68+6Ro1vzE1Op7bpwceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEN8ff+Uht4N7d3bO6yR2k+Okuyn2MOwnncmvM+cwZRZ2uVrUfxSZ5W+4Sv8Uw+9haNp84mef3n+0Qs848IbrMOiZOnXJEvLXusNTqe26cHHl69FM8yNhjl31++OOXfzjggQs+OOGFG3488MELPzzx/e/9x/pJ6buLbw/Oz2oG97DuIt3Hqa/FVXcTzudyjvxr7anX1azqNvtT/pbDxHGxzH62ps0rbjed3TpxLjnzwPjd043jrtv3Sa2+58bJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfHP83ZP49iQ/ihHu4Z0l3ceqJdzLqa/U2+4o0nksc1Z1XpOP1e3WpPpNDWO/ymXiuZhmX1vb5hfHQ3dpEnd/tVtMW7Cj8OP23xZq9T03To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOKb4+9s6PubGtF3GN8i1M/yp3OVWOJ+To3hnkbt6bzuzCoOO7vIz2pYdZy1Kp/bv+K62GZ/W+PmGddmV20pfLXzhsLiIS+lVt9z4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7zp3rF1tg7ABy/88MQ3x1895HzkO5wzo/OzbxLu5d1Nq6udMeRXd1Xua8QcdZizq/ObM4z4LFep59Q08ro1bD+Lcfa5tW6+cb5iwZ8Lv1myMLX6nhsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888c3x9w3aPYl7M9/jfJNSN8kd7ufdUbundVep3nZn5d5G/nV+V5M4x4lN6nk1rbittpHf5Thx3tq236158477gRU3p1bfc+PkyNOjzw577LLPD3/88g8HPHDBl3C+ncUNPx744IUfnvj+PP8/7/+f4//P+T/f6798r//z/fyX7+f/fL//yff7v3y//833+/98//6T79//8v37b75//8/333/k++9/8v33X/n++798//1nvv/+N99//53vv//P97//yPe//8n3v//K97//y/e//8z3v//9+V9+/9t+0DuFE/ruKDypbK/o2umgWNDumGg64KQo/64wLnnt3ChpdEn8vfKqqJl6Q2z4cGCct2Ro/GLD8Ph14ei4IrMP920xMZ6qL4rmu06NeYdMjw/+Z2b0Wl0cV3coibZFs+PjFaUxYNmcGH5nWZQdVh4/LCiP+3dmzroFFVHdtSK1+p4bJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPHN8ff/75vsHV0KDo5Wc46Nfh3bx+cndYq/3N49Tml0WazZ2ie+PaNfrPrw1vjiy7tjc8GoeGLZ2Oi4YUIc8deiaHPL1GjzzvT41/7F0b5xSTz+xuxod8ucOOT1svh234rYJXO2vfRXVfH2U1Vx8jXV8dxr1VHfcm7cd8Xc6N4/2+p7bpwceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEN8ff+/Cs9T4tY0rLk+OEos7RpOCC6H9cr5g75Lro2nRAtN13aFzVb0SMPGBMnF43Po7aNinNw7bnpscTPYrjuqqSNF9dJpel+ezUUBmT/5Op65rPja2N58W7m+fFUzPmx5AWC2LohAWx66sLYvuPC+LTfRamVt9z4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Of7WhPdi7IAdnWPR/hdGt8G94/IWfaNH81vi65vujBaT741WM8fGhnMnxterJ8dN70yLU56cGYP7lMQZfymNZz7JnEc2VMSWGVnOA26dFzfOnx9P1yyILuMWxh87LYphby+KkZcvjiNXL4612xbHxYfXxG3H16RW33Pj5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ745/vaFteH9kPnzpt5RtKVvTOo+KC7edlf0HT4qGtWNi3MnZur+AzNzfmWmxus9K/o3yc73OU9XpDV729S5MeqI+WkeH3hiYUx+eVHiNHxYTfQ5fElcvGxJTGmyNP55/dLYWr00Hn1iaXz2fLbV99w4OfL06LPDHrvs88Mfv2m9ZXDAAxd8cMILN/x44IMXfnjim+MvNtgf1oj3RLbRqkFx1pN3x/a9R0dx3/Ex5aaiWNViWmwdNTOtPftRzLq8W1Xav5edOD+tYfPWadTiOL20Jr4csyQ2nr80zvluaXQdsywWf7MsNpxfG9/NqI0VT9TGKRtro8eH2Vbfc+PkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvjn+4qMYYZ9YK94XHXG131/Gx/otRfHdc9PSfhOPxWexqcOo6li3cF6al0NPWhSraxdH5y018ezuWc6r1i6Lt/rVRp9va6P+xuXx5trlUbN7Xdx4el38eHVdvHhbXSy8O9vqe26cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxDfHX44QJ8UK+8Wa8d7o9m8xOeWcl18oji1Hl8bRJ5XHM19XprhtX34+a2G8ed7iuHBdTVq7m9ssi/taZOe1yaTl0WbfLMfT/lYXNzeuj3M61cfA6+tjxz31MXxSfXwwNdvqe26cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxDfHX56UK8RLMcO+sXa8PzaWfVMcTw0pTfm5ZGRVisvP9loQH1y1KMUu+9X8rNm/Ni7/sTbNn/kct7Eu9j6jPn49rj7+/Eh9fPxefRy0vT467dUQTzRriItbNMR+h2Rbfc+NkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnvjm+KsV5Es5Q9wUO+wfa8h7ZOuJZ8pTzBGH7b/rP1sUc9bUpP1Zu3BZ2r/P1S6P7/tm1vG2uoibshw2f1WfuO1s1RBbT2qIae0b4vBMe/0JDXFJ64ZofVy21T/8p3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT3xx/9ZKaQd6UO8RPMcQ+spa8TzbvL56X8nWrMxen+CxuW5Nfn7E8Rh6VnW9reN3TmTn+VUNMPrYhemb4HNguw+3whri8UUMc/WV99H4zM6/P1Mekh+uj/QPZVt9z4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Of5qRnWT2iHl90wOEUfFEvvJmvJe2Zaf/33Rkui6aza29Zy5PO3T/VrXR8u6+nhkZ3282DI7j+ce0xBdMrhrXquPq+fWx38y2IcdXx9df6yLj96qi51/rYvWa7KtvufGyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xz/NXNakf1kxpCHpVLxFMxxb6ytrxfPo5tvizlKvtxyX11MeOa+jhmQ33ax+ZraWa+mu3Mzisuv9utPlotrovPz6qL8/+1PC6pWR6HDlwea7otj8Yds62+58bJkadHnx32lv60nvjhj1/+4YAHLvjghBdu+PHAJ9UHGX544pvj7+ygflZDqqPUEvKpnCKuii32lzXmPfNVv3557LquLsXtPf5dn/ar/XvEvg1pLXfKYOu9uS4OvKwuTn56efyuILNH6mrj7na1sceLy+Lbkcvi9R7L4v2O2Vbfc+PkyNOjzw577LJ/+E/xgV/+4YAHLvjghBdu+PHABy/88MQ3x19+dIZQR6sl1VNqCnlVbhFfxRj7zFrzvvkUn8XrV9tmY1jhN/Vx//TsfO/Zpy7N57Pv1EazA2oTx/MqlkbzbUti9yFL4sHGS+KaV2tiweM1qdX33Dg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjkc6bGV744Ylvjr8zpHOUs4R6Wk2prlJbyK9yjDgr1thv1pz3zvfZJ2b358T3smvVfraGm/7P8nhwt9p4/scs55t21ERhk5oY1nVxHDR3UTx22KIY+OrCuODhhanV99w4OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+Ov3O0s6Q46UyhrlZbqq/UGPKsXCPeijn2nbXn/cMgbleeXx8XTc7E5YrMHIzJzveUXy9N89vi9sVx7GmLYm3zhdHj4AXRsdv8GL1yXhzec1580jbb6ntunBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MQ3x99dgvO0GOFcJXeor9WY6iy1hnwr54i7Yo/9Zw2aB1jOy/gVw+zf+S9laqHuS+K1hxened00dUF8v/f8+L+GudFwV3U8NqwqKp+sjPndK2PQUdlW33Pj5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ745/vaDOwXnamdL5yvxU52t1lRvqTnkXblH/BWD7ENr0XzAZL9+NnFp2s8X/Zid79Wt50ebc+cmbp1fr4i4vjwKCsri5Z5z4pBnSuOj0tLU6ntunBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MQ3x1+N6F7F/nC+dsZ0znLWUG+rOdVdag/5Vw4Sh8Ui+9GaNC+wramtSft47OAFaW1XfpbhvaIiSqaUJa6j3imJZ2+bFYf1LY53H5sZ546bmVp9z42TI0+PPjvsscs+PylPVGTjARzwwAUfnPDCDT8e+OCFH5745vi7V3O35H7FHYP94qzpvCWWiKtqT/WXGkQelovEYzHJvrQ2zQ+MhR0WpDU8f6+qNJ/mt/vZJbHntzNjj39Oj98XTost26dEYcGUKP/35NTqe26cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxDfH392i/OiOSd3krsF52/5x7nL2UH+rQdVhahH5WE4Sl8Um+9MaNU+w2s89HiqLh2pmxz5VxfH5yumJ43ezi+KpORPjqOYT4vGW4+ONN8alVt9z4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhh2eqb376537VHaN7NvnSfYs7B+duZ0/7yRlEHS7eqsfUJPKy3CQ+i1H2qbVqvmB+tfPstLbN66C3i6Ji1YS4//2xUTRudAxZc28cXzgydh82IrX6nhsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBK/HL8MQ3x1997J7V2nDf5s5J/lRLOH87gzqH2V/qcTFHXaY2kZ/lKHFarLJfrVnzBvtHj0+NHx6flOb5o+NGx6bVw2P7IXfG/W/eFo+2GhyndRyUWn3PjZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH57pXvqnf+KhGlG97M7RvZs14/5FPlVfOYs6jzmT2G9qU3FYjSJPy1XitZhl31q75g+H1wrGpfnt89Wdieudo/vFy1f3jXEtro3f/dAntfqeGydHnh59dthjl31++OOXfzhSjb1b9swEJ7xww48HPnjhhye+Of6+Nbhvd+csTqY6f8yydAflHsZaSvV95kzqXJbOJgXZfa9OU6vI13KWuC122b/WsHnE5Yxz74hTbxkQy7tfH0f0ujJWHXxpHPSbi6Ldgz1Sq++5cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwzN9X/jpn/OR2sC9u7tndZM7SPHTXZT7GHcSzuXWmPOZM4o6Xa1qP4pN8rbcJX6LYfaxtWw+cTLPO/peFis2nh9Xt+sal7TqFFtvjNTqe26cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxDfH3zcn3118e3B+VjO4h3UX6T5OfS2uuptwPpdz5F9rT72uZlW32Z/ytxwmjotl9rM1bV5xG/vBeYnzfRvbx3XXnRAlTdqkVt9z4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Of7uSXx7kh/FCPfwzpLuY9US7uXUV+ptdxTirbOq85p8rG63JtVvahj7VS4Tz8U0+9raNr84nja3XcyecVRs/leL2Pfh36RW33Pj5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ745/s6Gvr+pEX2H8S1C/Sx/OleJJe7n1BjuadSezuvOrOKws4v8rIZVx1mr8rn9K66Lbfa3NW6ecV3SvVmMjUZx/eW/Sq2+58bJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfHP81UPOR77DOTM6P/sm4V7e3bS62hlDfnVX5b5GzFGHObs6vznDiM9ylXpOTSOvW8P2sxhnn1vr5hvnmZu+LGz1wbuFWn3PjZMjT48+O+yxyz4//PHLPxypBsvggg9OeOGGHw988MIPT3xz/H2Ddk/i3sz3ON+k1E1yh/t5d9Tuad1VqrfdWbm3kX+d39UkznFik3peTStuq23kdzlOnLe27Xdr3rzj3nnPVekd6HtunBx5evTZYY9d9vnhj1/+4YAHLvgSzuOyd+vw44EPXvjhme6Ffp7/n/f/z/E/7/N/vtd/+V7/5/v5L9/P//l+/5Pv93/5fv+b7/f/+f79J9+//+X79998//6f77//yPff/+T777/y/fd/+f77z3z//W++//4733//n+9//5Hvf/+T73//le9//5fvf/+Z73//m8///h/7tlNXeJzt24efldW1/3GsEaNGjIkNjY2AWC6En1352hW7YoklKhhbjO1GY00sICKIoCJSpTMwdAYYZobeZ/RiLLGXWH7Ga4u9JcZ73s/x5J848nr5enyeZ++1Pt+z915r7X3OtGr1w7/rJ26WxpYdskenjjnkhf3zSPNR2XSj0zJw4Pk54arL0m/cdVnd5das2+quXNa1T3b+Rb/cVj8gG2/6QM7abnA2fWdIltw0LD9dNyLD3x2VV/8yOmf0GptzNhyfPc+akDdumZjLr5+Um4+qyUPv1+TrqyZnevPkXNZqSoZtNaW4uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6Pf/H03tmAMfPyA7/9cxuej50/P6Yxdkwea/y97jrs+cAX/OH9/tlTO69s3HR92XV1oNSuP1D+Xg8UOy48Bh6XDwyHSofTT/++qYdHp5XBomTMheB0/K9uNq8vFLk/PPd6fk9Cdr89ygqem857SsGDstNZ9PS2376Tn2gOnF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/Pw7PdJh2Tu5Z1T7tdL0rrx69MzxV/zPF97shOZ92dh56+Nx3Xuz+3vv5A9rvx4ey8amgxDp8NfjSNbcfmwsvHF+OVs2uK8Tzk5trcs3JqPnxrWj56eXpenDEjS86fmWvemZnrus/Kt4/OyhePzcpbL5av7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+s0Jn4t3Px58UYbV/j6Ht74p7c+9M7v9uk8+a9U/25w9MO1+81Ce+tkj+Uev4flt7aj86r4x+f1e47P//ROzbG5NDhs/Je+dX9Z8edcZ6fn7mVl63ax0PW12Lt58Tm6cPCe37F6XnXrVZeGqupz8QV2u/qZ8de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0W9dmBs+H22m3nBTlq64M/mkTyas7Z8e3QZloxsH56gzhubDN0tj3mF0fvvLcbnstQnFeBzxwJRizl59zvTc9uGMYhxn9Z+dPsPnFJpuOm5uzvtgbk6+fl7ueW1e3uk0Px9dMT/z+8/P20PKV/eee6+d9vrpzw577LLPD3/8FvOtxIEHFz6ceHHjp4Meuuijk96KfrHB+jBHfE7a3tHunuy413354oVBGdD54dyz77DMeGdkPj5pTDH3rEcxq/s2U4v1e/q/ZxRz2LgdclJd9us5N++fMi/PbTc/R6wo/XdKfUYvrc9T2y3IJ+cvyJT+C/KrmgU5YVb56t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol98FCOsE3PF56WPuHrJ/Q/n8aZh+WTwqGK9icfis9jU5aRpWXl1eby3/2525txQl0Ob5mb50/MK9hkD6vPX/RbkvOULUtOlIc8MaMiYpxvS80eN+aZjY9akMaOOKV/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0yxHipFhhvZgzPjd9L3tnWJFzmh8Zm3c/mZBdv6vJsiW1Rdy2Lv9+4ew88/O6HP/w3GLuvvr1/NS+U1+M6xZnNqTDSw2Fxn1HNObSlxtzxOZNuaJTU748tik3ndmUV88pX9177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvTLk3KFeClmWDfmjs+PjfFLx2bJYROL/DzwhKlFXF7eblZe3WNOEbusV+NT/2p9uj+2oBg/43lnTWM22aQpG5/WlJl9mvLmtKb8fE1TDnm+KY1vNOXkd5qy2bvlq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein61gnwpZ4ibYof1Yw75HNlqfHByEXPEYevvwvlz8mDfucX6nHB1fbF+V9zQkM87l+bxqsYctG9ZwyuLy9q++qIpH33XlHvXW5i2peuF/2zKKV81pf2X5av7tt+/1057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfvWSmkHelDvETzHEOjKXfJ5sTr9gRpGv27WuK+KzuG1OfrhJQ275uKEYJ3N45QOlsXyyKX0+a8qJJT1bfVvS9kFTuj/blF0WNeXMiaVxfbApve9uSqc7y1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX9akZ1k9pB/pRDxFGxxHoyp3yubMvP7+00L4evm1/EphN/U17fm33VmN1vbMq85qas+bw8jkd92pSuJe4xY5tyzu+a8mmJ/cZvGnP4Y415fVJjvhrYmPZ9y1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX96ma1o/pJDSGPyiXiqZhiXZlbPl8+dntrfpGrrMextzam/55N2XV8eR0br3Gl8WrTXB5XWo58qjHtrm3M21s25rjGhpxyXUO2P6gh9ds05Mebla/uPfdeO+31058d9sZ9P5/44Y9f/nHgwYUPJ17c+Omghy766KS3ot/eQf2shlRHqSXkUzlFXBVbrC9zzOfMV82ohnw7uLGI2xssLK9X63fHl8pz+ZAS25kzGrPVbo3p/EBDjmxVWiM3LsgN39Zng6H1+fiEUi3Qtj6vbFa+uvfce+20109/dthjl/2238cHfvnHgQcXPpx4ceOngx666KOT3op++dEeQh2tllRPqSnkVblFfBVjrDNzzefNp/gsXq/7VzmGHbS0KdPPK4/3hns1FuO5vHZB2rxe1nj0pfPz01Xzsv5h8zL75bk5d/TcjOxXvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN346iv1mSRd9dNJb0W8PaR9lL6GeVlOqq9QW8qscI86KNdabOedz5/uwf5fXZ69p5bluPZvDP/nLgsx5qj6rHitr/u3auTnwtVJtv1Vdfva7OVnw/uxcMXp2ut1dvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrp/U/9W9pH20uKk/YU6mq1pfpKjSHPyjXirZhj3Zl7Pn8M4vaQ7Zpy0tmluHxpQ549ZUExfvc8N68Y320Or8tuG8/Jwrdm5YS/z8zB28zMn26bkbY7zsib/5peXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvQ7S7CfFiPsq4r9d6m+VmOqs9Qa8q2cI+6KPdafOWgcsBxd8iuGWb8jhpVqoW3n5cm764pxff6cWfn8hRl54ubpmXz0tDQcNzVD7qvNiG1rc+XHU4qre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfuvBmYJ9tb2l/ZX4qc5Wa6q31Bzyrtwj/opB1qG5aDwwWa///4z5xXo+6bHyeNd9NSMdfja90HbouCk5qNPk/FermjTvOCnbPTgxr/ecWFzde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0qxGdq1gf9tf2mPZZ9hrqbTWnukvtIf/KQeKwWGQ9mpPGBVv9DXOLdXz7obOKuT1k/tR0vWVKBv66ptB6W+34LM+47NB5bF68d0yOOm1McXXvuffaaa+f/uywxy77/BR54tJyPMCBBxc+nHhx46eDHrroo5Pein7nas6WnK84Y7Be7DXtt8QScVXtqf5Sg8jDcpF4LCZZl+am8cF44Iazijk84vnaYjyN77FtxmfD5WOyQcOjOXXTUXlvzYgc2GpEBi8cXlzde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0O1uUH50xqZucNdhvWz/2XfYe6m81qDpMLSIfy0nisthkfZqjxgmr9XxC75rUXTchrS8fm7dve7TQ+EmPYVly8SPZ+a2H0/D54Dw9YXBxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0e981Rmjczb50nmLMwf7bntP68keRB0u3qrH1CTystwkPotR1qm5arwwr9tiQjG3jeuVk4fl4duHZPr0h3L3aQ/k2r4Ds9WV9+e71vcXV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff1FffzS5GJuOG9z5iR/qiXsv+1B7cOsL/W4mKMuU5vIz3KUOC1WWa/mrHHD/nq/kfm639BinF//clD+t2ZAbn6pX55Z0Dfn9Lgn277fp7i699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3oFw/ViOplZ47O3cwZ5y/yqfrKXtR+zJ7EelObisNqFHlarhKvxSzr1tw1fjT8pdXgYnz3PLp/oXX/zXun56135ta5t6frkD8XV/eee6+d9vrpzw577LLPD3/88o+jqLFLXPhw4sWNnw566KKPTnor+n3X4LzdmbM4qX52/uYMyjmMuVTU9x+U92XF3qRUn1t/6jS1inwtZ4nbYpf1aw4bR1qGXdsvQ3vdnVM/uSPbfnxzptT9IVvOvibtT766uLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprei3P1IbOHd39qxucgYpfjqLch7jTMK+3ByzP7NHUaerVa1HsUnelrvEbzHMOjaXjSdNxvnTb6/PhD9cmTOaL84Jyy/Ie9+dX1zde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0+87J9y6+e7B/VjM4h3UW6TxOfS2uOpuwP5dz5F9zT72uZlW3WZ/ytxwmjotl1rM5bVwLbbdeXmie9IfuOeefJ6bf1OOLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7nJL57kh/FCOfw9pLOY9USzuXUV+ptZxTirb2q/Zp8rG43J9VvahjrVS4Tz8U069rcNr40dtrvlPTvcGSe73NQNjpt/+Lq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei397Q929qRN/D+C5C/Sx/2leJJc7n1BjOadSe9uv2rOKwvYv8rIZVx5mr8rn1K66Lbda3OW6caR35Vpfc8lz7nPvRrsXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSe9/zr9alfd7voezZ7R/9p2Ec3ln0+pqewz51VmV8xoxRx1m72r/Zg8jPstV6jk1jbxuDlvPYpx1bq4bb5qX9Pl5+t+7eXF177n32mmvn/7ssMcu+/zwxy//OIoarMSFDyde3PjpoIcu+uikt6Lfd9DOSZyb+T7Od1LqJrnD+bwzaue0zirV286snNvIv/bvahL7OLFJPa+mFbfVNvK7HCfOm9vWuzlv3Gnf58APu7q699x77bTXT3922GOXfX7445d/HHhw4Ss4vyxz46eDHrroo5PeH8b/h/X/Q/z/If9Xe/1X7fV/te//qn3/X+3nP9V+/lft57/Vfv5f7d//VPv3f9X+/W+1f/9f7b//qPbf/1T777+q/fd/1f77z2r//W+1//672n//X+1//1Htf/9T7X//Ve1//1ftf/9Z7X//+8O/6v539P57pP/5B+SbZcdk8yvPyOXn9cjLQ65Kj11uzv3f3Zl9tr8nj7/RP/PPG5RT7hmc1peX9smtRuYfp49Oeo7LJ50mZvKyUk3w89r06jIta7abkUMfn5kjTpqdrUfPScuKupy2aG56DJiXW/ednzfmz8+Qrepzarf63Hle+erec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Lf/y879NhsesGZ+WRpz/zqd9dkzm9uzapTeuW7YX2zfOCAXNjlwRx6z5C8OGB4Vnd7NOMXjc3u70/Ixs/XpE3v2rT5dFqeaj8z27WbnXEfzMnPes/N+u/Ny4u71+etLgty0PYNWfJCQ7a7vjHT3m3MoK5NefDa8v7H1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/Pw7PP9r84Z3S/Nl/U3ZYP9umd4bX3pssT9+dHox/KbW2HZqvjR+bijmOy09Lxab1FebxfeWVaxl1Sqj9nzy7Gq/2YecV4tivVbtds3phn927K8+0WZsWXC1MzcVHO7rw4545cnLf/vjivbr0k/7PbkuLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei35zwuXj3Srs/Zd9He+fek/ply/EDs9nYwXml27C0GjMqm08am8YLJua5xyfnpE+nZoe/zsiZN8zOL56rS+2387LH+/V5emJDwXzaPQtz/LxFmdK4OO2HL8mJZy3NhR8vzcVXLcuPHl+WiVssz/77Lc/ZR5av7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+q0Lc8Pno83iXv0yZbNBpfzycAa0GZ5uDz6aD5eMy16jJuXZvWrz8nXTc+I1s3JKh/J4d3yxvpizZ49ryiX7LyrGcdgzS3LNm0sLTT0eWJ6j9luR/RatyLUdVubJm1fmhTkrM/qZlVn3Wvnq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeiX2ywPswRn5O2V1xd2jfcMDyv7To6N9wyPtf+uSaPdJ6aF4bMKOae9ShmHXJRQ7F+Dz52UTGHjdvuQ5blF1OX569DV2RJz5XZc7NV6Th0Vfq2Xp2mnqvz4sTVefCZ1dnho9Xp8nX56t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol98FCOsE3PF56WPuHryc+Mzd8PJeemVqcV6E4/FZ7Gp7ZDGTK9fWIzL+sctzYjFy/LLDVdkatuy5iHPrsri21fnqB+vyaDb1mTRs2tyb9u1OeHUtXnzD2szs+/a9BlYvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreiXI8RJscJ6MWd8bvqe2nlykXPm/G1mnj64LpseNz9TNmko4rZ1+cTkJVl44bJ0eXV5MXdXH7EqD3Uuj+uXo9akze5ljTu9tTYnt2su7U+bc/rNzfnboOb0eLQ5q8eVr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/rlSblCvBQzrBtzx+fHxn2tZ2XyvXVFfr5xcEMRl6devTir/3tpEbusV+Mzuv3qHLJ1eZyN5xUfrc3Hpzbnw2HNeeSJ5jz2eXP+/ZOWtNulJeP3bMn+nVvy2a/KV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff1qBflSzhA3xQ7rxxzyObI1/qX5RcwRh62/475bmlufXF6szwH1q4r1O3Xxmrx6y9ocv0VzdvtzWcPqH5W1/S0teeG4lvz38S3ZqHQ99qiWHHB4S7Y8rHx1v9H377XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol+9pGaQN+UO8VMMsY7MJZ8nmw/XLCzy9RanLyvis7htTj532pr0PKg83ubw9Beb0277llxzaEv2Len55uiStv1acsgvWtJ645Z0/bA0rqU2V61rznYt5at7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+NaO6Se0gf8oh4qhYYj2ZUz5XtuXnZy5bkY7blGPbvpPWFOv0s8Oas/nS5jy6VUtmdS2P496HtKR9ifved5tzeF1zXi6xX3Rkczpu3Zzmf6zN68+vzU+eLF/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0q5vVjuonNYQ8KpeIp2KKdWVu+Xz52GzvVUWuKuL5yrW5/vrm/Pj95mIdG69+pfH6pk1LMa607LVD6bNpWJsnzlmbThuszQGNa7J+rzUZc9GafHpG+erec++1014//dlhr9/384kf/vjlHwceXPhw4sWNnw566KKPTnor+u0d1M9qSHWUWkI+lVPEVbHF+jLHfM58DXx7Td5+ZW0Rt9/bsLxerd+Nd28p5nK7ElvXL9fmn1euzfYvrsle3dbk4qWr85tjVuf9v63KC4NXpfGSVVl1Zvnq3nPvtdNeP/3ZYY9d9jf6Pj4Ufkv+ceDBhQ8nXtz46aCHLvropLeiX360h1BHqyXVU2oKeVVuEV/FGOvMXPN58yk+i9f1R5dj2K6tWzJkQnm837++PM5TP12dr/dYXWjcZ+bK/GvzlXm374oMb7ciR76zPL2fXl5c3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9NtD2kfZS6in1ZTqKrWF/CrHiLNijfVmzvnc+e5wbHl9/v7z8ly1ns3hL7ddk+E7rM70rVcVmk5qsyK7dFiei85blm/nLM3YfZfmtHeWpPO6JcXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fv320vaQ4aU+hrlZbqq/UGPKsXCPeijnWnbnn88cgbv+5Z3P2G1OKyzNLYzC0PN7X7ryyGN9W/ZZls1OWZsLeS/L/Oi3O7hctyiWrFmajSxfm8aPLV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3OEuynxQj7KrlDfa3GVGepNeRbOUfcFXusP3PQOGDZp+RXDLN+e71R2tP0WJGGdcuKcV02rrTX3XVR6peX9vn3N2bsAw25/a8L0rvHgpxxUPnq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei33pwpmBfbW9pfyV+qrPVmuotNYe8K/eIv2KQdWguGg9M1uu6USuL9bzf1suKcRxx+KK0uaCp0NbuvfrsdvP8bNttXuZcOjfrv1SX5ql1xdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/GtG5ivVhf22PaZ9lr6HeVnOqu9Qe8q8cJA6LRdajOWlcsI1ZvLxYx5f3WVzM7du/a8gvV9TnprHzCq2XfDo7U/vOyga3zMzyp2Zkr+Eziqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+52rOlpyvOGOwXuw17bfEEnFV7an+UoPIw3KReCwmWZfmpvHBuOtJi4s53HuXhmI8jW+nc2fng01n5v31pueA7lPz9Ja12bXblPxpoynF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb+zRfnRGZO6yVmD/Xaxfkr7LnsP9bcaVB2mFpGP5SRxWWyyPs1R44TVeu7yP/MysnFOPpk1M+tWTSs0vlhbk5ppE7PJ3hMyruv4NH0wrri699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3od77qjNE5m3zpvMWZg323vaf1ZA+iDhdv1WNqEnlZbhKfxSjr1Fw1Xpjrz55TzG3j2v3jmvxp7YQM+WJsrho+Or9+clS+qRuZv58+sri699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihq9BX0klvRb/62DmrueG8zZmT/KmWsP+2B7UPs77U42KOukxtIj/LUeK0WGW9mrPGDXvL07V5/elJxTi3HDY6T300Ij12H5ZF6z2Sw2sfznr7Plxc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9IuHakT1sjNH527mjPMX+VR9ZS9qP2ZPYr2pTcVhNYo8LVeJ12KWdWvuGj8aFnQbV4zv1vcPK7TufNaDOWHlwPxyt/uzyeABxdW9595rp71++rPDHrvs88Mfv/zjKGrsHcp7Jpx4ceOngx666KOT3op+3zU4b3fmLE4Wdf7QVcUZlHMYc6mo70t7UvuyYm/Srbzu1WlqFflazhK3xS7r1xw2jrTc1TA0dzz+UA48eGBuOLx/Fu3aN9ft0if/uubu4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uik9z/nfwPKNY9zd2fP6iZnkOKnsyjnMc4k7MvNMfszexR1ulrVehSb5G25S/wWw6xjc9l40mSc31jTN03r985De9+RtmfcmoUP3Fxc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9PvOyfcuvnuwf1YzOId1Fuk8Tn0trjqbsD+Xc+Rfc0+9rmZVt1mf8rccJo6LZdazOW1caZvU565C840bXZuOA67I+YdeVlzde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0Oyfx3ZP8KEY4h7eXdB6rlnAup75SbzujKPZjpb2q/Zp8rG43J9VvahjrVS4Tz8U069rcNr40rr/2ypzfeGFqtz07z77Rvbi699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3otzf0/Zsa0fcwvotQP8uf9lViifM5NYZzGrWn/bo9qzhs7yI/q2HVceaqfG79iutim/VtjhtnWq/+46k58YqjstddKa7uPfdeO+2LfqX+7LDHLvv88Mcv/zjw4MKHE29x7jioXAfQQxd9dNJb0a8esj/yPZw9o/2z7yScyzubVlfbY8ivzqqc14g56jB7V/s3exjxWa5Sz6lp5HVz2HoW46xzc9140zxo2y45f4eOxdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/76Cdkzg3832c76TUTXKH83ln1M5pnVWqt51ZObeRf+3f1ST2cWKTel5NK26rbeR3OU6cN7etd3PeuNN++YyfFlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvT+M/w/r/4f4/0P+r/b6r9rr/2rf/1X7/r/az3+q/fyv2s9/q/38v9q//6n27/+q/fvfav/+v9p//1Htv/+p9t9/Vfvv/6r995/V/vvfav/9d7X//r/a//6j2v/+p9r//qva//6v2v/+s9r//rea//0fdgChuXic7dv5o9VV9f9xTXMeSnNMKzWHHMr6qIWarz7OllFqqGkfJSXTnKicp5xQS9IQJxQEARllEhBRkHm6TPde7sQMd8CpUtNURPN7Hu/T+f4TR355836/917r+Tp777XW3ufczTb7/N+7M0/OD14/J0N/ekkmf3Btdnvttpzc697cf+5f0m3Ow9ly3aMZOKxPeu73TA786cCsPWJIjp07PHP2HJXdDhmb+R+8kDvun5j6VZPyy42T02/tK9n1kanZc9dpebPb9Dz75xk5+J6Z+f45s3L2pll56bbZuapldg7aeU7O229OcXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9Hv/9csuCQvvtE9z5x5R96+pUfGXPdgnt6tVxovfjxPdnk6R2/sn11/OjhjzxmWvjs/n5vvGZOPx72QVf0m5rUzXsprL72cYf+YkrfffDU3jZ+et86YmZaxszL2zdl5eeOcfGnd3DzWf17e6TQ/d4+dn8u2XJArjlmQrU4rX9177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvT7PDwbMOuO3Pl2j9R9vWdmv98r3bs/kW0f65vV3Z7N2a3P5fWdR6TTO6Py7x7jsnbZhGIcxg96OTcfNjX73jitGK9PfzOrGM9N98/NKcvm5fn35mfMWwvSZ2pN7rhyYb794cIcecmiTBm1KBNXLMqgN8pX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/eaEz8W7Oef3zA7dHsnFuz6ZDZf3S+tlAzN+56Fp+s3ItF05Jr2+OT6jHnkxB0yenHefmpLDjpuWD/rOyJ2zZuWzcXMy/Mqy5oN/WpP9bl2YP925KJ9evDj777Mkx0xakk7/szSrey3NrQ1Ls+MnS3PEtrXF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb91YW74fLR59Iwn86f6fvnPZoNyafPQfP385zO7x9hscemEjPpXacy//0oOOPrVHPTP6cV4bD5gTjFnj7h8QY77tKYYx2ufWpxThi8pNH3/vNrs/UlJ5z11OfWfdRma+oy5qT7XP1Wfwc+Vr+4991477fXTnx322GWfH/74LeZbiQMPLnw48eLGTwc9dNFHJ70V/WKD9WGO+Jy0zVGDsurYYZn4+vM580fjcurJE3P1hy9lzK+mFHPPehSzdjloXrF+v7zjwmIOG7dNFy7Nv7vXZuRFdXnskPpsXl+fzS5alouWLkuvQxoy9sqGXP5UQ96d2JDtppWv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+sVHMcI6MVd8XvqIq9/sNy4P1kzMuEGTi/UmHovPYtO/Lpyfe24vj/fyHZfk9/cuzScLanNXa13BfnXfZXn0lIbsXdeQy05sTO++jbm4tTH77d6UyZ2a0qNzU37VpXx177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRL0eIk2KF9WLO+Nz0PejDiUXOeWDI1AzffEbW7Tg7dy6ZW8Rt6/K5axan94FLs+3g2mLu9t1mWa74cFkxrosvbcxrbzQWGt8f3pQD32rK5vs055A058Vzm/P9bs3pd3n56t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol+elCvESzHDujF3fH5sXLJ0au742YwiP//0gnlFXL7rqEXp94MlReyyXo3PDf9Yll1WNBTjZzzzYlPm7d6cORc355rHmvPsK81paGzOpg3Nufnd5uz4YXMWflS+uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6FcryJdyhrgpdlg/5pDPka2bn51dxBxx2Pr72pwlOeuJ2mJ9Xnr7smL93n1vYyb8qCnfaGjKxpPKGvouLmub9MWWjNmpJad/qSUrd2zJ17ZryU5bt2TDF8tX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/eolNYO8KXeIn2KIdWQu+TzZvOrqmiJft++xtIjP4rY5OWqPxnTarDze5vA9A0pjubY5p2zRku1Lemq3L2nb1JxdOpqzbmFzvjKhNK6lNic92py3Hy5f3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9KsZ1U1qhyK/l3KIOCqWWE/mlM+Vbfl5xBF12Wx1fRGbtr+qvL4XbtWcth7Nua6lOfdtWR7HLb7Qkk9L3BePbc4eNzfnhRL7Mds2Z7MVTRkwsSmTnmnKhsfLV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3qZrWj+kkNIY/KJeKpmGJdmVs+Xz5a/1Vf5CrrsetfmvLjY5uzflx5HRuvX5fGq7a5PK60fGF9U9rvaMpzX2/K1gsas9OdjVl+emNuOKgxNXuXr+4991477fXTnx32fv3f+cQPf/zyjwMPLnw48eLGTwc9RX1Q0kcnvRX99g7qZzWkOkotIZ/KKeKq2GJ9mWM+Z74ue74xUwY1FXF7Rk15fVu/q94oz+VNnUrzeWpT6r7blHf6N+YLO5fWyH0NOWqHhswcsixjL1iWvx22LE9/tXx177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRLz/aQ6ij1ZLqKTWFvCq3iK9ijHVmrvm8+RSfxeu/bl+OYR8tac5VvyuP96xjm4rxvGtyQ2rfLmvc8vr61C+ry/TOden+Vm32Gl2bC/uUr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ+OYr9Z0kUfnfT+//q3tIe0j7KXUE+rKdVVagv5VY4RZ8Ua682c87nz/dkO5XV+4ivluW49m8NL1jSk+/pluXdFWfMBzbX56B+l2n6/pWm4aUlu3LQ4h4xenG0eLV/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb020fbS4qT9hTqarWl+kqNIc/KNeKtmGPdmXs+fwzidpdDmrPDZaW4fH1pDC5qKMbv1A11xfg2/WxpWr+yJLe+tyjbfbAwHx+4MMc/WJOVh9Vk4Pblq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein5nCfbTYoR9ldyhvlZjqrPUGvKtnCPuij2T/pu3jQOWLUt+xTDr94JhpT3NwXV5+NGlxbg+cfmiTHi9Jg89UNrn/2J+bjxvXro8PTcXHDw3h25Wvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprei3Hpwp2FfbW9pfiZ/qbLWmekvNIe/KPeKvGGQdmovGA5P1OvjS+mI977CiPN6/33phXjtgQaHtk7FzsvGE2fnnTrPywOEz0zJgRvr/fkZxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0a9GdK5ifdhf22PaZ9lrqLfVnOoutYf8KweJw2KR9WhOGhdsN9xbW6zjE85cVMztLnNKuh+Yk86/nVVoPW7ytNzV+dWsyNT0eXJKtug6pbi699x77bTXT3922GOXfX6KPHF9OR7gwIMLH068uPHTQQ9d9NFJb0W/czVnS85XnDFYL/aa9ltiibiq9lR/qUHkYblIPBaTrEtz0/hg/GiXRcUcvuC1ucV4Gt+tvjEts2qnZOa8l7PzXpMzvGlSPtppUs5Z+GJxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0e9sUX50xqRuctZgv2392HfZe6i/1aDqMLWIfCwnictik/VpjhonrNbztr1n5Q93Ts/8G6bmuQdfLjSO6z4xt/9hfNb+a1xu2nJcHhk/tri699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3od77qjNE5m3zpvMWZg323vaf1ZA+iDhdv1WNqEnlZbhKfxSjr1Fw1Xpj/uu/0Ym4b10MnTcwvHnohV00Zk5O7jsq3nxiZuptHZOqeI4qre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meugp9JZ30VvSrj52zmhvO25w5yZ9qCftve1D7MOtLPS7mqMvUJvKzHCVOi1XWqzlr3LAP6PNSXuozoRjnAVuNyrAXh+cHbw5J73mDs2f3QWn+eGBxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0S8eqhHVy84cnbuZM85f5FP1lb2o/Zg9ifWmNhWH1SjytFwlXotZ1q25a/xoeGjnscX4vnnO0ELrB18dkP3+0i+fvP501vzy6eLq3nPvtdNeP/3ZYY9d9vnhj1/+cRQ1dokLH068uPHTQQ9d9NFJb0W/7xqctztzFieLOv+iZcUZlHMYc6mo7zeV92XF3qRUn1t/6jS1inwtZ4nbYpf1aw4bR1rO/9OQnPvIs9l58375ydZ90vv1x3Laa71Tf3Tv4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Lf/kht4Nzd2bO6yRmk+OksynmMMwn7cnPM/sweRZ2uVrUexSZ5W+4Sv8Uw69hcNp40GeeX/vp4es3vlSve+2var30wEx76S3F177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvR7zsn37v47sH+Wc3gHNZZpPM49bW46mzC/lzOkX/NPfW6mlXdZn3K33KYOC6WWc/mtHGl7bYz/1ZofmR+j1zZ8+7c2+2u4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6LfOYnvnuRHMcI5vL2k81i1hHM59ZV62xmFeGuvar8mH6vbzUn1mxrGepXLxHMxzbo2t40vjc3D78m2p96acwf/Ifdcc21xde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0W9v6Ps3NaLvYXwXoX6WP+2rxBLnc2oM5zRqT/t1e1Zx2N5FflbDquPMVfnc+hXXxTbr2xw3zrTu/YWr8tH7F6dlxwuLq3vPvddO+6JfqT877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0q4fsj3wPZ89o/+w7CefyzqbV1fYY8quzKuc1Yo46zN7V/s0eRnyWq9Rzahp53Ry2nsU469xcN940Hz+4c7Ydekpxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0e87aOckzs18H+c7KXWT3OF83hm1c1pnleptZ1bObeRf+3c1iX2c2KSeV9OK22ob+V2OE+fNbevdnDfutO927HeKq3vPvddOe/30Z4c9dtnnhz9++ceBBxe+grPEixs/HfTQRR+d9H4+/p+v/8/j/+f5v9rrv2qv/6t9/1ft+/9qP/+p9vO/aj//rfbz/2r//qfav/+r9u9/q/37/2r//Ue1//6n2n//Ve2//6v2339W++9/q/3339X++/9q//uPav/7n2r/+69q//u/av/7z2r/+9/P/1X3v5tPvzjTrr4m3152W/Y7oUc6v/hgtmnolR/3eSKHbNMv8/cfmMveGpKfdxuZNx4ek0Hdx+c/20zKny98Oct/NzU9O03PiTUz89jX52Tf4+fl1/svSHNDTVZ1WZTRQxen26IleWvO0mx6rDa7nVCX26bV5civ1ufNs+rz1W7lq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7//3fn29N/Uo/sekXPjJ/6SP446clcfP4z6TNwUH715LBsPG5Umh8el+sen5iuZ0/OD+dOyavvT8uAdTMzsuecjNxUysNH1mT8EYty/AeLM6bn0vR9rzbXHVGfO45flob9G/LL1oaMv60xp77XmENPa8rhNzel5s/lq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein6fh2ePDu6Zk7/XO49d0if3f79/jho/OIubh+fZoaOz+4Hj8/zZk/Lp917JS/NfzaDdy+N944Z5Of6amqyfvKgYrxnDaovxnFazLNvu3pjuxzTlD99uzv9t1pL/Hd2Sdzstz/uDl+fOd5bnpn1X5LeHryiu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+s0Jn4t3DzzdJ0uH9M8B5z6XESNHZMjwMbnx7Al5athLGTp6Sn7x2+n5feOsvLZpbiauXpC3b1+UyWuX5OSt6jLr/VLNO7qhYH6rtK9tn9qSk2Ytz4yBK7LhopXZuHFlPr1+VZ5tWJXssTp1J6zOuz8pX9177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvRbF+aGz0eb83s+l5N2G5mZJ43NwXtPTNtTpf3P/KmZ+9yMdD96Tm64ZX423LgwbxxZHu/ZrfXFnH13RFM+S0sxjv+zekW2/fvKQtOmPquz5oQ1qZ2zJtt9d22uvHtt/vjK2nRavTaXv16+uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6BcbrA9zxOek7RY3js2A2yeWaoyXs/M9r2a7+2fmu8fOzR/7LyjmnvUoZjVd3lCs38aftRRz2Li9+syqTB6/Otc+uya/vHJt5nxlXWYPWJf9d1mfLleuz3Wj1+fw1esz8aP1Wbx5a3F177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRLz6KEdaJueLz0kdcfX3tq+m846xcv2Fusd7EY/FZbHrxmcacNr25GJe+P1+Zo+etyvQd1uSUA8uaj1y7Luc/sD5rdm3NoT1ac97a1hxwYFs6zm/L7be15YxebfnGk+Wre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfjlCnBQrrBdzxuem75udZhU558w3anL1yUsy+Od1OenLDUXcti6vGLci516+Kos3rC7mbtefrMsRx5bHtdeQ1ow8vKzxpb+35fUj2jPnovb8/a723NKnPZuGtKfryPLVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9FvzwpV4iXYoZ1Y+74/Ng4aJeFOfGRJUV+/nK/hiIun3Lj8nS9dWURu6xX49PpyPVp2qc8zsZzi41tefCX7XlgYHu+29Ke3/ynPU/u2ZFp3+rID4/qSF2njjx0XPnq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeiX60gX8oZ4qbYYf2YQz5Htn7YXlfEHHHY+mvdelV2W7G6WJ8HT19XrN9T5rXmpnva0r57e6beV9bQ9Utlbbec3pE/ntWRHc7pSP+fd2T9mR2pP6MjI04vX9177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvSrl9QM8qbcIX6KIdaRueTzZPM7Y5uLfD3sglVFfBa3zcnfX9CaT04sj7c5fFpbe6bt35FtT+3I0rM78mjnkrYTOtJ0cEcG7dSRlg9K41pqs3Vze8bXl6/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv61YzqJrWD/CmHiKNiifVkTvlc2Zafr+m+JrO/Xo5tS0e3Fuv0oTPaM3R+e37w1Y78+LTyOM47uSMzStwHvNeela+054a72/PxT9oze5/2XPpRW25d35bhy8tX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/epmtaP6SQ0hj8ol4qmYYl2ZWz5fPoYcva7IVUU8X9yWnW5vz3Pvtxfr2Hh9szRej+7dUYwrLXMPKH02M9pyxSVtqdm+LfUzW9P3wdYce0Vr/vp/5at7z73XTnv99GeHvW/+dz7xwx+//OPAgwsfTry48dNBD1300UlvRb+9g/pZDamOUkvIp3KKuCq2WF/mmM+Zr2+93Zo7N7QVcbvHjuX1av0OOLyjmMvTbivN58/a8th1bZnQ2pq5Z7Xm0/nr82Hn9bnvjXX5Y791+cU163LxReWre8+91057/fRnhz122eeHv8JvyT8OPLjw4cSLGz8d9NBFH530VvTLj/YQ6mi1pHpKTSGvyi3iqxhjnZlrPm8+xWfx+qzO5Rg25csdOXJUebzvu708zqd8sj69v7e+0Dh/0to8vvva3NtrTY769pqsfmd1vrZqdXF177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRbw9pH2UvoZ5WU6qr1Bbyqxwjzoo11ps553Pne+bPyutzq/+U56r1bA732q81R31zfU7bd12h6bW91uSVI1fn40tX5YlXVua4E1bmrXdWZGHTiuLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei3z7aXlKctKdQV6st1VdqDHlWrhFvxRzrztzz+WMQt/e8sj21w0pxeVJpDJ4tj/d231pbjO9Tj6zKkPNW5oRjVmTJD5bn1ctb8tni5vS/pjmXdS5f3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9DtLsJ8WI+yr5A71tRpTnaXWkG/lHHFX7Lnlv3nbOGCZ/0RbEcOs333fKu1pfrcm5zSvKsb1wpGlve5hLTlrYWmf/0RjjnuqIXutWZav/W5Z/nli+erec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6LfenCmYF9tb2l/JX6qs9Wa6i01h7wr94i/YpB1aC4aD0zW6+VD1hbruXafVcU4Hv3jloy8rKnQNu29+ky9qy4vnFWbM69dmr5tS3LphCXF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb8a0bmK9WF/bY9pn2Wvod5Wc6q71B7yrxwkDotF1qM5aVywHTtvdbGOv/Dw8mJu77VNY6YvrM8uI2oLrZ9tWpRTei1Mv7tr8quVCzJ34ILi6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot+5mrMl5yvOGKwXe037LbFEXFV7qr/UIPKwXCQei0nWpblpfDBO6bK8mMNfO7ShGE/jW3PJoty/a03u225+6i+cm6v3mpMpZ83OHjvNLq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6nS3Kj86Y1E3OGuy3i/WzeXkvo/5Wg6rD1CLysZwkLotN1qc5apywWs+LG2tzzKzF6Tm5JlcsmVdovG78zPzvxOkZePS0HH/aq+nywdTi6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot/5qjNG52zypfMWZw723fae1pM9iDpcvFWPqUnkZblJfBajrFNz1XhhPqvr4mJuG9d/bJyZPeqm5cjPpmTrQS/nX8tfymNTJuWuCycVV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXQV+ko66a3oVx87ZzU3nLc5c5I/1RL23/ag9mHWl3pczFGXqU3kZzlKnBarrFdz1rhh77ZqTm5dNaMY525nvJyrNr6YTYdPyHnbvZCVL4zN0z8cW1zde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0i4dqRPWyM0fnbuaM8xf5VH1lL2o/Zk9ivalNxWE1ijwtV4nXYpZ1a+4aPxrOPntqMb6jH59QaH35olHpWDQi0w8bnoF9hxVX9557r532+unPDnvsss8Pf/zyj6OosQ8o75lw4sWNnw566KKPTnor+n3X4LzdmbM4WdT5A9YVZ1DOYcylor4v7Unty4q9yVnlda9OU6vI13KWuC12Wb/msHGkZZ+Z47N34+gsO2lEdv7xkJx32KBsf+izefymAcXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fv/2R2sC5u7NndZMzSPHTWZTzGGcS9uXmmP2ZPYo6Xa1qPYpN8rbcJX6LYdaxuWw8aTLOt9UOSpft++eIY57OsBeezE11TxRX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/b5z8r2L7x7sn9UMzmGdRTqPU1+Lq84m7M/lHPnX3FOvq1nVbdan/C2HieNimfVsThtX2n70cL9Cc5fte+c7Sx/O6UMfKq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6nZP47kl+FCOcw9tLOo9VSziXU1+pt51RFPux0l7Vfk0+Vrebk+o3NYz1KpeJ52KadW1uG18an/773zK/4y95+9H78sWP7y2u7j0vfzb9i/b66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX99oa+f1Mj+h7GdxHqZ/nTvkoscT6nxnBOo/a0X7dnFYftXeRnNaw6zlyVz61fcV1ss77Lc7x3obXupHty5y23pGvv64ure8+91077ol+pPzvsscs+P/zxyz8OPLjw4cRbnDv2KdcB9NBFH530VvSrh+yPfA9nz2j/7DsJ5/LOptXV9hjyq7Mq5zVijjrM3tX+zR5GfJar1HNqGnndHLaexTjr3Fw33jTP/tYV6XV41+Lq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei33fQzkmcm/k+zndS6ia5w/m8M2rntM4q1dvOrJzbyL/272oS+zixST2vphW31Tbyuxwnzpvb1rs5b9xp7zvtjOLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropPfz8f98/X8e/z/P/9Ve/1V7/V/t+79q3/9X+/lPtZ//Vfv5b7Wf/1f79z/V/v1ftX//W+3f/1f77z+q/fc/1f77r2r//V+1//6z2n//W+2//6723/9X+99/VPvf/1T7339V+9//Vfvff1b73/9W87//B2UqqoF4nO3bibuVVfn/8S41kzIUCsccc0BTv2Vfh8j6mJWVEpqZSvozM8XMMlPTzJzNMKWc0UApESc0UVFBcARFJgFB5kGGAxwOZ4RzGM7w/e3Xs9v9E1uuy+vxeZ617vv92Wut+77X2vt84hMf/1s86Q+5u+2WfP+QO/JB5935xFUPZuy9j6TjrMeyYNJTuWbFv7PryBezzQFjMuSU8Tn9y29m1HsT0mfPSfnroVPyzS3TsuH2Gfnesll5v312eq74MAPvm5dBvRbkZxctzC53LsrQPy/Osz9ZkkmdS3L4DUuzfOHSDOmxLNO/uKy4uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6Pf/h110R069+p5M7P1QLrhuWA64ekR23m1kTjp/VD571kt5un1sBp7yeg484+306PluGv48Ob8dPS0/+ueMnNP3g5wzbk72apqbC+rnp/6lhTmv7+L0e3FJDqxfmv/pWJbbVnyUzzy6PBcetyKbXliRRduvzNJjV+baH5Sv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+n0enn33gofS2jws39v/8Xxt08jUXP58rh/8ck67aFwmrXoj5/acmOdaJuVXA6fm9LnvF+PQ+/E5aTh8Xu69ZkExXlf8ckkxnpf99aOM+3B59m9bkQMaVqb7m6uy4Tc1Gb6lJiMuWJ2vjFqdQ5eszm7ry1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX95oTPxbs+Zz+emwY8kzm9XsjZl7ySMy8en94938rJv3wn/S+dnO0Pnp4v3j8zD46bnQEPz80/v7EglwxblNZ3luTK0cuyz6VlzUNPWZUHrqvJxptX5/Lz12Tw3mszcuza/Puo2px2X22a5tbm5q7aPPqZdcXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSe9/A0BpXZgbPh9tuvV9IRvnvJIrtn0t8xe8lft/+m6+NnBK/nDh+9m/tTTmfT7Mg8fMz5CmhcV4XPXosmLOPvqrlRn1f6uKcVw1dE1eHbm20PRM/3X5e1dJ55/rMq6pLl84YX0OuHZ91g1dnz2eLF/de+69dtrrpz877LHLPj/88VvMtxIHHlz4cOLFjZ8Oeuiij056K/LFBuvDHPE5aTv66Nfyo2+8nUPr3s1bJ0zNuBNnZMWWD3Lgz+YWc896FLP+0nt5sX5v26mmmMPG7bJza/OrK9Zl35/X5TNfWp+r5pT+O68+s2fVZ/svNeSgSxuyZGhDBoxpyA1vla/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6xUcxwjoxV3xe+oirDw2bmk9Mn5GDHp9drDfxWHwWmy46d0U231Ae7347r83q22rzu2nr0raqrmBf8Uh9un2/IX+f3ZBF32nMDsMaM2dVYx7YrSlHHNeU9lObMuvM8tW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/HCFOihXWiznjc9N3yJYZRc7pfHJe9t5uUc7YeWlaZ35UxG3rcs/frckOvWtz/ePrirnb8zP1WbqlvhjXEwY05pz1jYXGi59pyj/qm3LV3s15+FvN+VL/5jw7oDk9Lylf3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9MuTcoV4KWZYN+aOz4+NebPmZcOPFhX5ecI5y4u43Hb06vT8+toidlmvxqeusT4DFzcU42c8XxrTlON2b06f85uzcnBzdn29OSfNb85ltc1p2NCcm7c05/j28tW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/WkG+lDPETbHD+jGHfI5sNQxfWsQccdj6u3fS2rz70Lpifc6/ob5Yv5tua8wh3y7N47lNufTEsoYeM8vaDtuhJQf0aMnrPVty6s4tuXfHltzSrSVn71C+uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6FcvqRnkTblD/BRDrCNzyefJ5vLfrirydf89aov4LG6bk/vv0Zh/b1Meb3N486OlsVzRnFc/2ZIbS3pO7F7S1tWcv6xpzk/eb87tL5fGdXhzxjzQnAvuKV/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0qxnVTWoH+VMOEUfFEuvJnPK5si0/7/Pl0nxftr6ITTdeWl7fx3drzlkDm1O7sDnt25fH8Q/bteTyEveHLzRn0LXNOfiE5oz8THN+v7gpvUoaDvtXU85+qHx177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRr25WO6qf1BDyqFwinoop1pW55fPl48zW9UWush4/vLMpbxzXnDNGl9ex8ZpbGq/vLiyPKy1Xr2xK/5uassf+TfnT1MbccnNj+p3cmLrejcle5at7z73XTnv99GeHvbn/mU/88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0W/voH5WQ6qj1BLyqZwiroot1pc55nPma9G/G/OVx5uKuH3M9PL6tn5PW1+ey5eV2G5/oykn/m9TLny0MVf3KK2RgQ15qntDjnmqPgf+v1ItcER9euxdvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreiXH+0h1NFqSfWUmkJelVvEVzHGOjPXfN58is/i9TbdyzHs0lnNWf7r8ngf+42mYjzbxjXkuy1ljddcvT7fm1uXo39Ul5r6dfnbqHWZOaR8de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HQU+82SLvropLei3x7SPspeQj2tplRXqS3kVzlGnBVrrDdzzufO95U7ldf5K6+V57r1bA5/e3lDVq+sz5bFZc0PLliX3zSVavsv1uYH167N+s41eXjUmlz3QPnq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei3z7aXlKctKdQV6st1VdqDHlWrhFvxRzrztzz+WMQt6cc2pybflmKy1c35tM/byjGb9zaumJ8Tz6tNmfuujZNratzw+aa/LZ3TZ4ftCqnHrEqu3YvX9177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvQ7S7CfFiPsq4r9d6m+VmOqs9Qa8q2cI+6KPYf9J28bByzXlPyKYdbvjKdLtdAhdfnk4NpiXHe8ZHUOqVuVbe9YmcVnrEh9/+WZ8vBHmXHIRxm2Tfnq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei33pwpmBfbW9pfyV+qrPVmuotNYe8K/eIv2KQdWguGg9M1uvuA9YX6/mmxeXxXtOtJucctLLQ9rsXl+XSby3NL3osSecRi/PD4YvS68pFxdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/GtG5ivVhf22PaZ9lr6HeVnOqu9Qe8q8cJA6LRdajOWlcsNXdtq5Yxy/2W13M7SmTlufyO5ZlwsVLCq2jxi3IplPn55QT5qX7kLn5w/lzi6t7z73XTnv99GeHPXbZ56fIE1eX4wEOPLjw4cSLGz8d9NBFH530VvQ7V3O25HzFGYP1Yq9pvyWWiKtqT/WXGkQelovEYzHJujQ3jQ/G3/RaXczhGbUfFeNpfK/df0GOnT03x0yZk1v3nJ19FszKb3rMynvTZxZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/c4W5UdnTOomZw3229aPfZe9h/pbDaoOU4vIx3KSuCw2WZ/mqHHCaj3fcP+SrLl5Yb5xzbzs8bc5hcaDrpiRDVdOz+mtU1O//dR86uUpxdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/81VnjM7Z5EvnLc4c7LvtPa0nexB1uHirHlOTyMtyk/gsRlmn5qrxwrzNvguLuW1ch42dkcl3Tcvy1ydn7PmT8thD7+TEP03MV/ecWFzde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0F/Vx/dJibjhvc+Ykf6ol7L/tQe3DrC/1uJijLlObyM9ylDgtVlmv5qxxw95r6Ac5fOj7xTj36jYpe42dkGfXv5kdpryeQZe/lr6d44ure8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfvFQjahedubo3M2ccf4in6qv7EXtx+xJrDe1qTisRpGn5SrxWsyybs1d40fDdj2nFOP7szPeKrResvereeDOV3J53Uv58TkvFVf3nnuvnfb66c8Oe+yyzw9//PKPo6ixS1z4cOLFjZ8Oeuiij056K/p91+C83ZmzOFnU+efVF2dQzmHMpaK+7yrvy4q9Sak+t/7UaWoV+VrOErfFLuvXHDaOtEy/6c1Mu29cbt32lbzZ7cV0q3su42ufzfeOfba4uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6Lc/Uhs4d3f2rG5yBil+OotyHuNMwr7cHLM/s0dRp6tVrUexSd6Wu8RvMcw6NpeNJ03G+fC7RmX7qSOztPWJ9L98RA69+7Hi6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot93Tr538d2D/bOawTmss0jnceprcdXZhP25nCP/mnvqdTWrus36lL/lMHFcLLOezWnjSltzv6cLzZ+aOizL/zY0WwYMKa7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6nZP47kl+FCOcw9tLOo9VSziXU1+pt51RiLf2qvZr8rG63ZxUv6lhrFe5TDwX06xrc9v40tj3mYfzxxGD88/T783LY+8uru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/rtDX3/pkb0PYzvItTP8qd9lVjifE6N4ZxG7Wm/bs8qDtu7yM9qWHWcuSqfW7/iuthmfZvjxpnWm7e9K80dt+fnt/+luLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrp/e/5V4/yfs/3cPaM9s++k3Au72xaXW2PIb86q3JeI+aow+xd7d/sYcRnuUo9p6aR181h61mMs87NdeNN872n35QNI68pru4991477fXTnx322GWfH/745R9HUYOVuPDhxIsbPx300EUfnfRW9PsO2jmJczPfx/lOSt0kdzifd0btnNZZpXrbmZVzG/nX/l1NYh8nNqnn1bTittpGfpfjxHlz23o354077f/3zV8UV/eee6+d9vrpzw577LLPD3/88o8DDy58BWeJFzd+Ouihiz466f14/D9e/x/H/4/zf7XXf9Ve/1f7/q/a9//Vfv5T7ed/1X7+W+3n/9X+/U+1f/9X7d//Vvv3/9X++49q//1Ptf/+q9p//1ftv/+s9t//Vvvvv6v99//V/vcf1f73P9X+91/V/vd/1f73n9X+978f/6vuf4P+OTBf/updWXPh4PyuzyN55IXHctbMpzPk/lGlvcfL2W2fcXl5zRv513kT0+fO97Lh19PS75Mzs+DM2TnkorlZctSC3PPuoqzec2l+c+xHeX7vFTl41socdlpNuoavzkvvrcnX316bvvfUZkCfdZk2bl1u3LUuffrV5ZLzylf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX9/n/q8MFpfPGR/OLCEdn21ZGZ8OLzee70V1L7yPg8c99b+cGx7+bgO6dk4j3vZ1S/DzLo7Q/TvXl+mhYvSvvApWnf9FHGH7Yy2x5akztbVuf/Bq7N+sbaTDykLu8fW8pv+9Tn6aX12e6ahjzQ2JA/frsx1/2+tNe9rXx177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvR7/PwbNU/R+S+I55JzbkvZP5Xx+TW517LXnPeTvPwSRmw37R09JuZH/7PnHR7p7Qf6Fke70mlODWolI+PfLmmGK8eI2qL8dxp0vr079mQN49szIRDm/JsR1Puebo5Jxzdku/8qyUz17dk8u4b8krvDcXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fvznhc/FuweAXsu/wMbnitNez9YkJaRvxXib1m551j83K5qc/zIhfLMhbsxbnmM3L8smFK5I/1uTTi9fkvm3W5XPNdXn96fqC+et3NuWoV5tz7xst6TFsQ44+e2NOatuYH17emuaZrfn759qy39fb8q3vl6/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6rQtzw+ejzZMDX8+9PSam5/GTc/Uu7+d/B3+Q+RPnZtdHF+atr5TG/KrlOebKVelzeHm8ey2rK+bst55ozCnHNRfjeMuCDem/dmOh6eQH2nLE1zdlv7c35aeHb8646zdnwiubc/uCzRmzqnx177n32mmvn/7ssMcu+/zwx28x30oceHDhw4kXN3466KGLPjrpregXG6wPc8TnpO2Pr5icpmvez+SDZ+e8G+blp7csyk1HL8uEISuKuWc9ilkHXVhfrN8D+zYXc9i47TSkNd1GteWNhzflqYs2p1ePLfn8w1tyefetGXHR1rzz9Nb8acHWfLJ1a/buKl/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0i49ihHVirvi89BFXj108L8O6Lc47K5YV6008Fp/Fpu2HNGTw+KZiXOr7bsyfJ7Rm526bcv9+Zc03LdqSJ2/dmiN2bs8fb2rPE4vac8V+HTnqJx2Z/oeO/GNQRy67r3x177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRL0eIk2KF9WLO+Nz07XP04iLnDK1ZmdeOX5PWvuty32fri7htXY59dkOeuKA1e61sK+bu89/bkuuOLo/r8kfb0967rHGH2o587dDO9Dq7M8dd35kp93fm5OGdef6J8tW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/PClXiJdihnVj7vj82Liq+6rc87c1RX4+/6H6Ii7ff0VLnr96YxG7rFfj89fDtuag3cvjbDx/3NqRRT/pzIJHOnPznM68vLUzaz/flZ0O6sqgL3dlv6O7suyY8tW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/WkG+lDPETbHD+jGHfI5sDfpoXRFzxGHr78jtWnPh3LZifV49fkuxfh+Y0J73bijN48915rO3lDWM2rGsbep3ujLhh10555SuNPbtypE/6Mr+J3Zl63fKV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3qJTWDvCl3iJ9iiHVkLvk82bzxmaYiX28+o7WIz+K2OfnWGe35YcrjbQ4PXtaZnfbpSv8TurJPSU/NSSVtfbpy0AFd2fjprvTeUBrXUpszZ3dm2xnlq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein41o7pJ7VDk91IOEUfFEuvJnPK5si0/v/7rTfn8F8qxbZ+R7cU6Xfbdzmya2JmBu3blH98uj+Ou3+pKjxL3FY2dOWxMZ94tsZ/0/c58fvfOjN7YkalLOrL1w/LVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fv7pZ7ah+UkPIo3KJeCqmWFfmls+Xj7avbClylfV45eSOnHtNZ1qbOot1bLx+XxqvVbt0FeNKyy77dmbzax0Ze25H9tyhI/u/0Z76v5TW8YXtWdq/fHXvuffaaa+f/uyw9/v/zCd++OOXfxx4cOHDiRc3fjroKeqDkj466a3ot3dQP6sh1VFqCflUThFXxRbryxzzOfP1x7r2zFzRUcTtud3K69X6berdVczlnUpsvTs6UnNZR7Zb1p5d+pXWyDtb8/2Tt2ZuzZZMfGhLHvvVljz30/LVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fv/xoD6GOVkuqp9QU8qrcIr6KMdaZuebz5lN8Fq//dVI5hn22e1dufKo83vOuKY/z/Zu3ZtURWwuNu43enNU9N+fDQZty66Gbcnh9W347v624uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjqK/WZJF3100lvRbw9pH2UvoZ5WU6qr1Bbyqxwjzoo11ps553Pn+3N9y+vzjK3luWo9m8Mr9mrPrftuzYO7byk0HbPLpux4eFtOOq81a1/ZmDv6bMxx9Rvyhdkbiqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op++2h7SXHSnkJdrbZUX6kx5Fm5RrwVc6w7c8/nj0Hcvviizuw7ohSXR5fG4OHyeP/0wM3F+K77W2vafrwxfz9yQ/Y+qiXdL2zOqVOa0virprx8Uvnq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei31mC/bQYYV8ld6iv1ZjqLLWGfCvniLtiz9T/5G3jgGW3kl8xzPq9dM3m/HXApjw2u7UY15FPtOS9g5vz6KTGXHtvQ+58oD4XL1yfSweszzdTvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprei3Hpwp2FfbW9pfiZ/qbLWmekvNIe/KPeKvGGQdmovGA5P1OubRzcV63nf31mIc/3xic9rPbyy07dxUl89evy7b9KvN0EvWZv2yNRntty+lq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein41onMV68P+2h7TPsteQ72t5lR3qT3kXzlIHBaLrEdz0rhg++uEtmIdn3ZHSzG3L96uITu/V5fzH68ttJ6yuSb3D1qVhutX5tl5K7LrsBXF1b3n3munvX76s8Meu+zzU+SJkl/+ceDBhQ8nXtz46aCHLvropLei37masyXnK84YrBd7TfstsURcVXuqv9Qg8rBcJB6LSdaluWl8MO54Wksxhy89qL4YT+O7x89qMm+nlZm7/fJ88axlea3X0uzYb0ku+vSS4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Lf2aL86IxJ3eSswX7b+rHvsvdQf6tB1WFqEflYThKXxSbr0xw1Tlit570/qM1tb6zO4pdWZuyUjwqN7zy3KPc8vyAbvjI/d357Xh5vmVtc3XvuvXba66c/O+yxyz4/RXwp+eUfBx5c+HDixY2fDnrooo9Oeiv6na86Y3TOJl86b3HmYN9t72k92YOow8Vb9ZiaRF6Wm4r4PLu83s1V44X5X+esLua2cf1m26L8cvr83Nj+Yc4aNjsnzJ2VmjEzM+vMmcXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXYW+kk56K/rVx85ZzQ3nbc6c5E+1hP23Pah9mPWlHhdz1GVqE/lZjhKnxSrr1Zw1bthHz1+aafMXFuM8+ruzM751RvoeMj1PbD81hz03OXVfm1xc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9IuHakT1sjNH527mjPMX+VR9ZS9qP2ZPYr2pTcVhNYo8LVeJ12KWdWvuGj8ahvebW4xv1z3TC62fPvvdHDV5Qnr0fjstD75VXN177r122uunPzvsscs+P/zxyz+Oosbet7xnwokXN3466KGLPjrprej3XYPzdmfO4mRR5z+8pTiDcg5jLhX1fWlPal9W7E36lde9Ok2tIl/LWeK22GX9msPGkZZfvz4tl8yalC8ePyE/O/GNPHnw+Jx90KtZfeXY4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Lf/kht4Nzd2bO6yRmk+OksynmMMwn7cnPM/sweRZ2uVrUexSZ5W+4Sv8Uw69hcNp40Gedp08ZnxKfG5LojR2fzv5/Pe9NHFVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX9vnPyvYvvHuyf1QzOYZ1FOo9TX4urzibsz+Uc+dfcU6+rWdVt1qf8LYeJ42KZ9WxOG1fa7rrj5ULz4596JjdMfTIPDn+iuLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreh3TuK7J/lRjHAOby/pPFYt4VxOfaXedkYh3tqr2q/Jx+p2c1L9poaxXuUy8VxMs67NbeNLY93ap7L7iuHJ3cPyk7aHi6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+e0Pfv6kRfQ/juwj1s/xpXyWWOJ9TYzinUXvar9uzisP2LvKzGlYdZ67K59avuC62Wd/muHGmdb/jh+aurz2QT7x7b3F177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100vvf869+5f2e7+HsGe2ffSfhXN7ZtLraHkN+dVblvEbMUYfZu9q/2cOIz3KVek5NI6+bw9azGGedm+vGm+Yj7x6Uh3reXlzde+69dtrrpz877LHLPj/88cs/jqIGK3Hhw4kXN3466KGLPjrprej3HbRzEudmvo/znZS6Se5wPu+M2jmts0r1tjMr5zbyr/27msQ+TmxSz6tpxW21jfwux4nz5rb1bs4bd9q/Meba4urec++1014//dlhj132+eGPX/5x4MGFr+D8TvlsHT8d9NBFH530fjz+H6//j+P/x/m/2uu/aq//q33/V+37/2o//6n2879qP/+t9vP/av/+p9q//6v273+r/fv/av/9R7X//qfaf/9V7b//q/bff1b773+r/fff1f77/2r/+49q//ufav/7r2r/+79q//vPav/732r+9/8BtmHeGHic7duJv53j1Tfwc87eZ9po6dPHVBJzhUoVj0a1WZfUPEQoYigab9CoVlFaszRFJASJIIakqqZEESI8CCJERCSmEBEic8gkORmP5OTd3/u238/7P+zk8/G53fe91m/9fvu6rrXWde19amo2/dvu9Dvj5cX3xV/aPxQbWh6PvS98OubdPDp+fPzLUf/K2Hh42vjo8uA7sc/278X4wz6K6/eYFp+98lmcu9XMGL3T7Oi1bG60u35BXDL1q2hdvig6T1sSo/oti//dbHn0P3NFHPL3lphw1cqYdsyqWNGyKk67bHVs/v7qGN+4JtZutya7uvfce3bs+fGHAw8ufHHEE1d8PPDBCz888cUbfzrooYs+Oumt6Pf/3c98KK7+4/D4pt3IuP3S56PbH8fEL783Li4/dUIc1PXdmLr8/Rh12MdxwrHT45dNX8T2V8+Ke4fPjWvuWhB9u3wdfUcujiPnL43b53wT2z6xIvp3WRlXPL4qTpizOs5YsSZGTlsbB96zLm7frzV2ebw1Gja0RvNPv41H49vs6t5z79mx58cfDjy48MURT1zx8cAHL/zwxBdv/Omghy766KS3ot/n4dnFp4+MnRc+H5ds+0r0XDIutuz1dgy/dXJcc+aHsWL6J3Fz04yYvnBmDL52Tlw/aX42Difdvzi2221ZvHLR8my8hp61KhvP+69fG/PfWRfHLW6N4+d+GweNXh/tem6Iycs2xPunt8WZj7TFyR+2xa9n51f3nnvPjj0//nDgwYUvjnjiio8HPnjhhye+eONPBz100UcnvRX95oTPxbtzT3glnvjtG1Gz+cS4sceU6HP2R3FS06fx17M+j3/0nBU/23FedO2/MMaNXBR3DFoak/ZfHncNbomdXl4V/xy+Jo7umWuecNj6GHvphtjpirYYeurG6FGqSYu616Qlg2tSvFmTBsyvSd1ba9KCmtrs6t5z79mx58cfDjy48MURT1zx8cAHL/zwxBdv/Omghy766KS3ot+6MDd8Pmz+p8vE2OmdKTFs3UdRfO/TeK3bF3HutbPjoTPmx3GLvorf7Lskxu3zTYyfvyIbjwfvWZPN2Xd/923MWLU+G8ctB22Mlm65psU/rk1nXlmbPhlTmy5tqU277VCXHutUl/ofVZd2OT6/uvfce3bs+fGHAw8ufHHEEzebb2Ue+OCFH5744o0/HfTQRR+d9Fb0yw3Whznic2I78ydT4+r9p8fJs76IxZ3mxIJfLojvffN1dDt5aTb3rEc565l267L1+0z9hmwOG7euw2vSOwfUpkdG1Kb7tqxLJ5xbl7qNqEsb59SlIVsWUof9CukfRxXSUd0LaeoZ+dW9596zY8+PPxx4cOGLI14WtxwfD3zwwg9PfPHGnw566KKPTnor+uVHOcI6MVd8Xnzk1TcGz4m9xy2IE+9flK03+Vh+lpsGndQau12ej/evCjXp5lfK2nvUpjuW1Gbcb5pYl7ZvX0if9yykPg8U0r0TC+n6JYXUo7GY9tmumAbtWkxte+RX9557z449P/5w4MGFL4544oqPBz544YcnvnjjTwc9dNFHJ70V/WqEPClXWC/mjM+N7/hlC7Ka02HYsji6dUX0blgdO721Nsvb1uXh52+M7W+rSSd3zef2sOvrUv3aumxcf/5kIR26vJBpPPqEYppzcTGd0K+Y5t5XTCMeLaYLnyymYU/nV/eee8+OPT/+cODBhS+OeOKKjwc+eOGHJ754408HPXTRRye9Ff3qpFohX8oZ1o254/ODUTdhWbQ/siWrz0tPXJfl5Z33aYth2+Y5zHo1Ppu11KXTeuXjZzz/3L2YRt1UTPs/UUyNbxXTztOL6RcLimnysmLaYlUxfbKmmEavza/uPfeeHXt+/OHAgwtfHPHEFR8PfPDCD0988cafDnrooo9Oeiv69QrqpZohb8od1o855HOEtf29q7OcIw9bfzPPqknrjsjXd91Lddn6veOVQhq+Q3ken1dMxw3NNbSbk2v7ycZieqxQn/5SrE+dy9eza+vTJ+Vnvy7/5+q+83fv2bHnxx8OPLjwxRFPXPHxwAcv/PDEF2/86aCHLvropLeiX7+kZ1A31Q75Uw6xjswlnyfMzc9bn9XrLn1rsvwsb5uTP+5bSH9cX8jGyRweOKmYui4uppYNxXRKWc9BdWVtrcX06dJiSrOL6fSPy+NatrlkfDEd+UZ+de+59+zY8+MPBx5c+OKIJ674eOCDF3544os3/nTQQxd9dNJb0a9n1DfpHdRPNUQelUusJ3PK5wpbfd59UG1674I8t53yTL6+R19XTF1eLaZ+C8v5rK2YjeOJZd7Hl3lf/1ExzXihmDrcX0yLri+mbr2KaaeyhieOKaZxR+RX9557z449P/5w4MGFL4544oqPBz544YcnvnjjTwc9dNFHJ70V/fpmvaP+SQ+hjqol8qmcYl2ZWz5fMcZeVpfVqiyfH1JMlw0ppkOm5uvYeNWWeXZamI8rLe9fWEyvH1xMu25eTB99WUjdXy6kMf8spP63FdJzN+dX9557z449P/5w4MGFL4544oqPBz544ZfNz0fyfIA/HfTQRR+d9Fb02zvon/WQ+ii9hHqqpsircku2vq7Mx12sPh8UUseued4eOStf39Zv5+X5XO5a5jb99PIc/u/yHJ9USO/3Ka+RKKQL6gpp5JRyv/N4Xdp2YF1q1y+/uvfce3bs+fGHAw8u/M7f5QdxxccDH7zwwxNfvPGngx666KOT3op+9dEeQh+tl9RP6SnUVbVFfpVjrDNzzectpvwsX29Tl+eySeVcdePIfNyeKedr47nVaYXUaWWu8YMD69JB82vTyIdqU9Ml5R7vN7Wp7cj86t5z79mx58cfDjy48MURT1zx8cAHL/zwxBdv/OnI9ptlXfTRSW9Fvz2kfZS9hH5aT6mv0luor2qMPCvXWG/mnM9d7Pfq8nW+/NN8rlrP5vDzfyikpiV1aWCvXPPs82vTsS3l3v6WmvRip5q0zcqNMeGRjfHYLfnVvefes2PPjz8ceHDhiyOeuO999xnggxd+eOKLN/500EMXfXTSW9FvH20vKU/aU+ir9Zb6Kz2GOqvWyLdyjnVn7m3znXZ5+6rby7F/WkxLRpfnx96FbPwuXZaP78H/Lo9DQ0360eK2GLF0Q9zXbkPM6LM+rt6tnFOL+dW9596zY8+PPxx4cOGLI5644uOBD1744Ykv3vjTQQ9d9NFJb0W/swT7aTnCvkrt0F/rMfVZeg31Vs2Rd+Wen3xXt40DLh+U48ph1u813cq90O216Z7x+Th36lHe485aHx17fxuNx7XGtt3WxepBa+Pb9mvjnbVrsqt7z71nx54ffzjw4MIXRzxxxccDH7zwwxNfvPGngx666KOT3op+68GZgn21vaX9lfypz9Zr6rf0HOqu2iP/ykHWobloPHCyXnfpWJet51N65eP9g5oN0XeHbzNt9z++Job8fHUMaFwVHXZfGVcMaYl0QUt2de+59+zY8+MPBx5c+OKIJ674eOCDF3544os3/nTQQxd9dNJb0a9HdK5ifdhf22Nm+7geeT+v59R36T3UXzVIHpaLrEdz0rjg1r9zbba+Zx7als3tVWPWxQO918Sys1dlWmeMXB67HPFNXNlpWRx0x9J46NSl2dW9596zY8+PPxx4cOGLI5644uOBD1744Ykv3vjTQQ9d9NFJb0W/czVnS85XnDFYL/aa9ltyibyq99R/6UHUYbVIPpaTrEtz0/jgOGSztmwOt85cm42n8X102+XR8+2lcc5ri+OprRbF0VO+iiGNX8XKcQuzq3vPvWfHnh9/OPDgwhdHPHHFxwMfvPDDE1+88c/2jcPzPEAfnfRW9DtbVB+dMembnDXYb1s/9l32HvpvPag+TC+iHqtJ8rLcZH2ao8YJV+t5eP9V8V9XrIjfX7QsDvvH4kzjCb0WRLs/zIvrFs2JbTfMjv2emJ1d3XvuPTv2/PjDgQcXvjjiiSs+HvjghR+e+OKNPx300EUfnfRW9DtfdcbonE29dN7izMG+297TerIH0YfLt/oxPYm6rDbJz3KUdWquGi+cO269IpvbxnXiUwti5Y1zY/PnZsXcU2fGlNs+j4svmRFnbTUju7r33Ht27PnxhwMPLnxxxBNXfDzwwQs/PPHFG3866KGLPjrprejXHztnNTectzlzUj/1Evbf9qD2YdaXflzO0ZfpTdRnNUqelqusV3PWuOF+yMCv49SB87NxPmTjF3HUU5/FtNnT4oDXPo4Xfj81/tryUXZ177n37Njz4w8HHlz44ognrvh44IMXfnjiizf+dNBDF3100lvRLx/qEfXLzhydu5kzzl/UU/2Vvaj9mD2J9aY3lYf1KOq0WiVfy1nWrblr/Gj4adPsbHz7HftppvWuH34QY/8+JR6Y9W5ce+K72dW9596zY8+PPxx4cOGLI5644uOR9dgX5nsmPPHFG3866KGLPjrprej3XYPzdmfO2flauX92/uYMyjmMuZT19635vizbm/TJ170+Ta+iXqtZ8rbcZf2aw8aRlrV/nRZr+n0YT62bHIs3TowDZr0VC2e+GZd2fDO7uvfce3bs+fGHAw8ufHHEE1d8PPDBCz888cUbfzrooYs+Oumt6Lc/0hs4d3f2rG9yBil/OotyHuNMwr7cHLM/s0fRp+tVrUe5Sd1Wu+RvOcw6NpeNJ03G+bQbJ8TPxo6L5sWvxg2/HxMn3/RydnXvuffs2PPjDwceXPjiiCeu+Hjggxd+eOKLN/500EMXfXTSW9HvOyffu/juwf5Zz+Ac1lmk8zj9tbzqbML+XM1Rf809/bqeVd9mfarfapg8LpdZz+a0caVtx8NezzTvN/b52PyGUbH7mc9mV/eee8+OPT/+cODBhS+OeOKKjwc+eOGHJ754408HPXTRRye9Ff3OSXz3pD7KEc7h7SWdx+olnMvpr/TbzijkW3tV+zX1WN9uTurf9DDWq1omn8tp1rW5bXxp/Nu/nouH73sqJh09ImY/9Xh2de+59+zY8+MPBx5c+OKIJ674eOCDF3544os3/nTQQxd9dNJb0W9v6Ps3PaLvYXwXoX9WP+2r5BLnc3oM5zR6T/t1e1Z52N5FfdbD6uPMVfXc+pXX5Tbr2xw3zrQ+ue7R2LHlwbj1umHZ1b3n3rNjn/mV/eHAgwtfHPHEFR8PfPDCD0988cafDnrooo9Oev/f+Vdjvt/zPZw9o/2z7yScyzub1lfbY6ivzqqc18g5+jB7V/s3exj5Wa3Sz+lp1HVz2HqW46xzc9140/zq0UNi90l3Zlf3nnvPjj0//nDgwYUvjnjiio8HPnjhhye+eONPBz100UcnvRX9voN2TuLczPdxvpPSN6kdzuedUTundVap33Zm5dxG/bV/15PYx8lN+nk9rbytt1Hf1Th53ty23s154077iME3Z1f3nnvPjj0//nDgwYUvjnjiio8HPnjhhye+eONPBz100UcnvZvGf9P635T/N9X/au//qr3/r/b9X7Xv/6v9/Kfaz/+q/fy32s//q/37n2r//q/av/+t9u//q/33H9X++59q//1Xtf/+r9p//1ntv/+t9t9/V/vv/6v97z+q/e9/qv3vv6r97/+q/e8/q/3vfzf9q+5/g24fFgfu+mgsPfnJ+Otez8XD/3opzn5tbDx4w1tx3cpJ0f77H8TLn3wcj3b7LNLVM6P1t+W6smp+zDzi69i3+5KYs/s3cc/oFbF4s1Xxlz3XxAvfWxcdx7bG/l3WR/2dG+KlF8p7hmc2RodDatKB5fz21dSaNK5Qm3ZqX97v75lf3XvuPTv2/PjDgQcXvjjiiSs+HvjghR+e+OKNPx300EUfnfRW9Pv/9wc9Gasfei4uOPnlKA1/PSY+NCFGHzo5vhnwYTz7j2nRbc/Po2N5jb3z93kxuvNXceczi+OHs5bFmkkrou6KVVG3cE28vkNrlLZfHwNnb4iGKzZG60U1ad7mtemCO2vTXY116dTz69INo+rKfW5dem27Qnq9XO+3PDi/uvfce3bs+fGHAw8ufHHEE1d8PPDBCz888cUbfzrooYs+Oumt6Pd5eLbo9pfjvnbjYnHXt+OLXadEv2EfxW5vfBprB30RF241JwqxIE5qvyi+/9zSaK3Lx3vyB+U+8PTW6PTI+my8bjm6JhvP/p/Vpn1716WeWxXSubcW0umrC+nY44ppt0HF9PCEYvpDeY+3sLzXOXvz+uzq3nPv2bHnxx8OPLjwxRFPXPHxwAcv/PDEF2/86aCHLvropLei35zwuXg386a3Y49BU+LKLlOj5p7psWHwzJjceW4sv3NhtN27OEb85puYMLYlfrVwdWw2cV0cfsH62HJSWxx3RU269c+16Zzjcs07l/do7U4upnc/KaZbjqhPQx+uT3u21Ke9ftaQrv5dQ3qnd0O6c3BD2u3+/Orec+/ZsefHHw48uPDFEU9c8fHABy/88MQXb/zpoIcu+uikt6LfujA3fD5snvrb1Li39rPYbt8v49qGefGLm76KmaOWxI4Dl8dbO6+Kd89bG7/q+W2kHfPxHnB+bTZn/31MIe29dT6Ob/asT/surs80dRjXkO7978b0w9Ma09MDGlOP5xvTvA8b04S5jel3X+dX9557z449P/5w4MGFL4544oqPBz544YcnvnjjTwc9dNFHJ70V/XKD9WGO+JzYnv5/vow1vebFlG2+jvMuWho9Ll0RffdYHRP7r8vmnvUoZ921V122frdul89p49b/sIbU9F5DmnN4Y5o2ojENqGlKAw5vSr+8ril9PKIpnfduUxo7tynduKIp/WBNfnXvuffs2PPjDwceXPjiiCeu+Hjggxd+eOKLN/500EMXfXTSW9EvP8oR1om54vPiI6/GpKXx8LoVMemD1dl6k4/lZ7npxjfr0vEfF7JxuXJofRp/Wpnj+oY0uW+u+Y1zm1L3F5vS9jXN6bVOzemTc5vTmL7Naei/mtMFo5rTe680p4Nfz6/uPfeeHXt+/OHAgwtfHPHEFR8PfPDCD0988cafDnrooo9Oeiv61Qh5Uq6wXswZnxvftEdLVnMemtoab+zbFtcOrUnvttVmedu6/LJrfeq+V0Ma+FVDNndn/KgpdRmUj+tfjmpOvW/JNd60uDnttEUpDdi9lHb+eSkt7FJKjx9VSjOOya/uPfeeHXt+/OHAgwtfHPHEFR8PfPDCD0988cafDnrooo9Oeiv61Um1Qr6UM6wbc8fnB+OattYYcm1bqM+jDq3L8vLkkcU049n6LHdZr8bnyAFN6a5iPn7G8z8rmtPyXUrpz0eU0qHnlNJZl5XS3/5eSpv1L6Wjby+lHw4qpZZB+dW9596zY8+PPxx4cOGLI5644uOBD1744Ykv3vjTQQ9d9NFJb0W/XkG9VDPkTbnD+jGHfI6wjl5Yk+Ucedj626G1Ph04pyFbn3FKvn4nn9acFjxfnse1pdTvoFzDGdfm2nrdW0rzhpbSyGGldFX5ev/9Zd33ldL19+ZX91d9954de3784cCDC18c8cQVHw988MIPT3zxxp8Oeuiij056K/r1S3oGdVPtkD/lEOvIXPJ5wvz15EJWr6/bNc/n8rY52XPX5jT87ny8zeEp55dS/5tKad8hpTSorOfyB8raBpfS1v1K6ZprSunui8vjWrZ5qkcp3XB2fnXvuffs2PPjDwceXPjiiCeu+Hjggxd+eOKLN/500EMXfXR2/P++/9Az6pv0DuqnGiKPyiXWkznlc4WtPp/TsTFt0ZDntkHH5eu0ZftSuu70UnqrTym9NyQfx9vuKaVbyrzHXFRK251USueVue+5QyndWiylM8savprfnGrm5Ff3nnvPjj0//nDgwYUvjnjiio8HPnjhhye+eONPBz100UcnvRX9+ma9o/5JD6GOqiXyqZxiXZlbPl8x2rbMa1WWz2c0p2cOKKVr/5yvY+PVuczzsj75uNLyvaZS2vhxc/rdo81pq6ub053dm1Prwc1pwl7NacVu+dW9596zY8+PPxx4nb+bT+KIJ674eOCDF3544os3/nTQQxd9dNJb0W/voH/WQ+qj9BLqqZoir8ot1pc55nMW67U/Nqc/fNWc5e2lV+fr1fq96pZ8Lvcvc9tmdXO6/OnmdMP5ZS3ty3N2elN69IGmtPSCpjTv0KZ0yj5N6Yzd86t7z71nx54ffzjw4MK/6rv8IK74eOCDF3544os3/nTQQxd9dNJb0a8+2kPoo/WS+ik9hbqqtsivcox1Zq75vMWUn+Xrkx7Ic1jpulIad2w+3stG5ePZdWVTuuy2XOP3P2hMl/duTEs7N6bDtiiv2aUN6eC5DdnVvefes2PPjz8ceHDhiyOeuOLjgQ9e+OGJL97400EPXfTRSW9Fvz2kfZS9hH5aT6mv0luor2qMPCvXWG/mnM9d7C2G5uuz42X5XLWezeGVDc3p8L5NaUqxKdPUvtCYbh5Q7u33bEhrPqxPRw2uTw/+qT7d0SO/uvfce3bs+fGHAw8ufHHEE1d8PPDBCz888cUbfzrooYs+Oumt6LePtpeUJ+0p9NV6S/2VHkOdVWvkWznHujP3fP44yNsv7F1emxOb014nNqdp4/PxfrpfYza+f4uG1PZgfTpmq/o0cGAx9dur3Md/XkhX/aeQznogv7r33Ht27PnxhwMPLnxxxBNXfDzwwQs/PPHFG3866KGLPjrpreh3lmA/LUfYV6kd+ms9pj5Lr6HeqjnyrtzT67u6bRxw+f7reQ6zfl9c1JiO3LsxTe3RkI3rp+8U04LNiumjMwpp7Ni6dNSv61KnebXpFyNq07/uzq/uPfeeHXt+/OHAgwtfHPHEFR8PfPDCD0988cafDnrooo9Oeiv6rQdnCvbV9pb2V/KnPluvqd/Sc6i7ao/8KwdZh+ai8cDJej377XxdDyo2ZON4+I+KqXeHQqZtszJ26fmaVGxfkx46Y2O0TGmLF//Zll3de+49O/b8+MOBBxe+OOKJKz4e+OCFH5744o0/HfTQRR+d9Fb06xGdq1gf9tf2mNk+rrzX0G/rOfVdeg/1Vw2Sh+Ui69GcNC64Tfg0X99PjClmc7vTlXVp89/WpgOOqUm0nrJwfdx/zbex8k+t8exb62LH29ZlV/eee8+OPT/+cODBhS+OeOKKjwc+eOGHJ754408HPXTRRye9Ff3O1ZwtOV9xxmC92Gvab8kl8qreU/+lB1GH1SL5WE6yLs1N44Nj84P5XP/FZnXZeBrfnY9fH19sXBefr14THY5cHW/Ur4r/6rwy/tTakl3de+49O/b8+MOBBxe+OOKJKz4e+OCFH5744o1/tm88LM8D9NFJb0W/s0X10RmTvslZg/229WPfZe+h/9aD6sP0IuqxmiQvy03WpzlqnHC1nn/Qoybd+tSGmP1wa7z64ppM4zvDVsQ9D34T63ZeFgP3XxpPzF6SXd177j079vz4w4EHF7444okrPh744IUfnvjijT8d9NBFH530VvQ7X3XG6JxNvXTe4szBvtve03qyB9GHy7f6MT2Juqw2yc9ylHVqrhovnB87dkM2t43rofNXxJ/GLIsbFy2Os277Oo4avzAWPbYgph2xILu699x7duz58YcDDy58ccQTV3w88MELPzzxxRt/OuihK9NX1klvRb/+2DmrueG8zZmT+qmXsP+2B7UPs77043KOvkxvoj6rUfK0XGW9mrPGDfeXJqyKDyYsz8b5pf/5OsbNmx8nbjc3nlw9K/Yb9mUs7/BldnXvuffs2PPjDwceXPjiiCeu+Hjggxd+eOKLN/500EMXfXTSW9EvH+oR9cvOHJ27mTPOX9RT/ZW9qP2YPYn1pjeVh/Uo6rRaJV/LWdatuWv8aHi885JsfOv7zM20bnnM5/HL/50e22z7aaztOy27uvfce3bs+fGHAw8ufHHEE1d8PLIeuynnhye+eONPBz100UcnvRX9vmtw3u7MWZ7UPzt/cwblHMZcyvr7wfm+LNubtM/XvT5Nr6Jeq1nyttxl/ZrDxpGWS5+cExeP/SI67Ds9zjvw43hymw/jnK3fjyU938uu7j33nh17fvzhwIMLXxzxxBUfD3zwwg9PfPHGnw566KKPTnor+u2P9AbO3Z0965ucQcqfzqKcxziTsC83x+zP7FH06XpV61FuUrfVLvlbDrOOzWXjSZNx/vDlD+OJNZOjzy7vxMahE2LKmLeyq3vPvWfHnh9/OPDgwhdHPHHFxwMfvPDDE1+88aeDHrroo5Pein7fOfnexXcP9s96BuewziKdx+mv5VVnE/bnao76a+7p1/Ws+jbrU/1Ww+Rxucx6NqeNK213X/VupvmJNa/HjS+9GsMGvZJd3XvuPTv2/PjDgQcXvjjiiSs+HvjghR+e+OKNPx300EUfnfRW9Dsn8d2T+ihHOIe3l3Qeq5dwLqe/0m87o5Bv7VXt19Rjfbs5qX/Tw1ivapl8LqdZ1+a28aVxxbTXov0HL8bhvUfHb+ePyq7uPc8/m8mZPT/+cODBhS+OeOKKjwc+eOGHJ754408HPXTRRye9Ff32hr5/0yP6HsZ3Efpn9dO+Si5xPqfHcE6j97Rft2eVh+1d1Gc9rD7OXFXPrV95XW6zvvM5/nqmdc99n427O/wnGkcPz67uPfeeHfvMr+wPBx5c+OKIJ674eOCDF3544os3/nTQQxd9dNJb0a8fsj/yPZw9o/2z7yScyzub1lfbY6ivzqqc18g5+jB7V/s3exj5Wa3Sz+lp1HVz2HqW46xzc91403xQ73/HsLp/Zlf3nnvPjj0//nDgwYUvjnjiio8HPnjhhye+eONPBz100UcnvRX9voN2TuLczPdxvpPSN6kdzuedUTundVap33Zm5dxG/bV/15PYx8lN+nk9rbytt1Hf1Th53ty23s154067v393de+59+zY8+MPBx5c+OKIJ674eOCDF3544os3/nTQQxd9dNK7afw3rf9N+X9T/a/2/q/a+/9q3/9V+/6/2s9/qv38r9rPf6v9/L/av/+p9u//qv3732r//r/af/9R7b//qfbff1X77/+q/fef1f7732r//Xe1//6/2v/+o9r//qfa//6r2v/+r9r//rPa//63mv/9X9GSdEF4nO3bh79V1bUv8MOB08/Z+5QN9nifei1XI8YaS5jDii3GZxTFgpogD0tiQ9HEElv0xRpfNI9IotHYxcTYYguiXBuSRBGBCBoEUVFAmnS467sWO//Ehs/Hz3TNOcrvt+acY4w51z51dRv+rTrwkfS7959Ig1qeSx/NGJs6Br2WXrvw7dSy97tpzoNT0s9fmZ62uXFmKveZkx7qPzed3jk/vfTQwjRw1ZL069bl6YhpK1PdWWvSsWPXpfnz6qJzZq844vn6mPiT3vHM1n2i65k+MXnXhpjxm4aYO78hftu/MUae0hjvXdIY864qWs/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574Vvn7/70HPpdOOf7l9E7z6+n8UyamXY+flLZYPjUdf8CHadNvz0rPfvBpurP/l2nXPb9K31i0OK06Y1m67Fcr05CfrUl79KuLp7/bK/oOr4/nhvWONYf3ib36NcSYNxti1LDG+Mb8xjjs9KZoH9cUe5ea4+rDmmPEhc1x0U3NMf5XRetZv3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT3yp/70PfMQe9nurfnZiOrX8vHTJlWlp0zEfpxpGz06kDP0/vjZ+Xzl60ML347tI0cviK9INnVufzvdmBvWLNz+vjH4/1zucr/tCQz2faoylm/7MpNjq7OTb+tDlKR7dE3YMtMfXLlhi8VWtseWhr3DWkNXqGFa1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfKv8rQnvxdjAfd9Ltxzyz/Tx0o/S8CM+SUMPm5v2WDQ/nXDo4jTsqGWpp2lV2uWitWnSxLp4fkB9TLmld7w4tk/0mtQQ+7/VGP0eLDhP3qgl3nm8Ja76VmvE71vjmHWtMf3ItvjwF22xy/NtccUHbXHograYurRoPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb5W9fWBveD5l+O/0r9Xr6k3TVrLlpznML0r37LEmHDF+erjt4deo/eV3a9OZe8W5b7zh2eDHf+49rzNfsCfc3x0fnFvN76V9bY/bBBacZm7fHUee2x+t/bo+hn7VH366OGPXNjrhsQEf0HFS0nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPGt8hcb7A9rxHsiO67fF2nIFl+lvSYsSX/bakV6Y9s1afk5dTFqy2Kt249i1uHXNuX7962RLfkaNm8D7m6LF3doj1/f0x43NXTEASd2xP73dMRXUzviFw2l2GS7Ulw0oBT7HFmK144uWs/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574VvmLj2KEfWKteF90xNUHrlyROsasSZu+WpfvN/FYfBab9tmyOXrvUsz3N5e3xk+ebIs0qD2u/rg9xz5ybEe0VUrxt8GlGHF7KW4cW4rzPy7FMatL8Y1SOa7duBwLNitaz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnvhW+csR4qRYYb9YM94b3Yemrclz2nXj66PfBX3iW8sb4qoTmvK4bV/+6qHWaL22LQ45sFjbt17UEV9/2ZHP6/b3lWKPOaWc476HlGPSsHIccGU5Jt9WjtGjy3HKfeW49f6i9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvlb88KVeIl2KGfWPteH9sLJpaH3Wj+uT5efjvmvK4fHVba9zaUcQu+9X8rP60Iw4fUsyf+Tz9yHLcf1k5tv59OZa/UI7uv5djx+nlGDu7HGs/L8cbX5bjgXlF61m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPfKn+1gnwpZ4ibYof9Yw15j2yt3b+IceKw/feP77fF3P2K/b34jx35/r36yVLc1VWO/31SOQb8v4JDeWrBbfMl5Ri1vBxnrChH/6w9+uuMd9a3+5Ki9dx//Tg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb5W/eknNIG/KHeKnGGIfWUveJ5vLtmvJ8/Vul7fl8VnctiY3vrwUpyws5fNkDV8zrhxpZjlmLyrHwIzPDssybgvK8dascnxrSjmOmJDNaybzw4zX3s8VrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098q/zVjOomtYP8KYeIo2KJ/WRNea9sy8/9bmiPcacWsW3gg8X+fmBEOXZ7qhw/nZHFs8XFPB6Y4Y4M9/lvlmPimHJs+styTL+oHPsPKUdXxuG3UY6n9itaz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnvhW+aub1Y7qJzWEPCqXiKdiin1lbXm/fPz5rI48V+XxfM9yDLulHLu+Vexj87Uww7vDjGJecXnl9HI8uUs5Kr3KMX5yKQ59ohRj7ijFZdeW4oEritazfuPkyNOjzw57C9evJ37445d/OOCBCz444YUbfjzwwQs/PPGt8nd2UD+rIdVRagn5VE4RV8UW+8sa8575GvF6KbY8sIjb975f7Ff7t/+cYi2nDNuE75Xjv1qzNT6uFK9cUoohu5fipGUdce/4rN75XUe0XN8R5SuL1rN+4+TI06PPDnvsst9/fXzgl3844IELPjjhhRt+PPDBCz888a3ylx+dIdTRakn1lJpCXpVbxFcxxj6z1rxvPsVn8bp5WRHDXspi1cgHinm7N4vX5rP+qFLs8HnB8dUdO+K/PmiP3///9lgxLKvxDm2P+d8pWs/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCV88t44lvl7wzpHOUsoZ5WU6qr1Bbyqxwjzoo19ps1573z/fKyYn9+/LdirdrP1vBDp5VixcyOuGZIwXnSye3xnc+y2v6qtnj0m22xZn5rHPdGaxz8QtF61m+cHHl69Nlhj132+eGP35fXvwN44IIPTnjhhh8PfPDCD098q/ydo50lxUlnCnW12lJ9pcaQZ+Ua8VbMse+sveb13MXts6/LfG9TjhmPZuvjP0r5/A2dXczvTqPa4s+rWmPtWa1xSHa+G3BtS3y0Z0v0b2qJ7mXNeetZv3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT339fgJy1JjlPixHOVXKH+lqNqc5Sa8i3co64K/Zsvj5vmwdYXs38imH2748Pzmqha9vj/75QzPPN/5mdcc9oiRuezs75mzXHmtFN8eWAppjfpykGLWzMW8/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574VunbD+4UnKudLZ2vxE91tlpTvaXmkHflHvFXDLIPrUXzAZP92rN1R76fBw5py+dx5YiW2OOagvPYNxvjr52N8ZdLGuK6poYYM65PdD3SJ2896zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544lvlr0Z0r2J/OF87YzpnOWuot9Wc6i61h/wrB4nDYpH9aE2aF9gu260938enbdSar+0vJ2W8n26Mz9xbZFw/mtg7rt64d+z8y/q4+Tv1ccD/KlrP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Fb5u1dzt+R+xR2D/eKs6bwlloirak/1lxpEHpaLxGMxyb60Ns0PjC+tLNb6/KFN+Xya34Ou6h33Da6PrY7rFW9cXhc7Pbcu/XTh2vT+mLV561m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPff8e/5+vz/OiOSd3krsF52/5x7nL2UH+rQdVhahH5WE4Sl8Um+9MaNU+w2s+vPd8QP/lWn7j/sfro2atXznm372dx97hV6fTJK9LKOctT5c7leetZv3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT3yp/96vuGN2zyZfuW9w5OHc7e9pPziDqcPFWPaYmkZflJvFZjLJPrVXzBXNzXZ98bZvXx0atSe+ftzLN/92y9NoBS9MTly5O3z95UYpVC/PWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOX8Mp74Vvnn9fGwYu27b3PnJH+qJZy/nUGdw+wv9biYoy5Tm8jPcpQ4LVbZr9aseYO9a0Bd7HPZ6nyet/58Sdpx1ML0/NvzU99Hvky/OeaLNHjG3Lz1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+Vv3ioRlQvu3N072bNuH+RT9VXzqLOY84k9pvaVBxWo8jTcpV4LWbZt9au+cs5LFqWz+85ey7IuV6y9tN03zmfpCsnzEqn7Tcrbz3rN06OPD367LDHLvv88Mcv/3DkNfbpBT444YUbfjzwwQs/PPGt8vetwX27O2dxUv3s/s0dlHsYaymv7xcU57L8bHJJse/VaWoV+VrOErfFLvvXGjaPuPzz9Plp2ojP0y9nzU4TP/9X6jdhRnrzzQ/ScRt/kLee9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888a3ydz5SG7h3d/esbnIHKX66i3If407Cudwacz5zRlGnq1XtR7FJ3pa7xG8xzD62ls0nTuZ5n/M+TD2PTktfTJ6chh0zKe11/rt561m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwzPnu/6fb06+u/j24PysZnAP6y7SfZz6Wlx1N+F8LufIv9aeel3Nqm6zP+VvOUwcF8vsZ2vavOK2duepOefKoxPT/B+/lRoHvpm3nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPGt8ndP4tuT/ChGuId3lnQfq5ZwL6e+Um+7o8jPY9lZ1XlNPla3W5PqNzWM/SqXiedimn1tbZtfHAffNCFdf91/pzG7j0vjR43NW8/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574Vvk7G/r+pkb0Hca3CPWz/OlcJZa4n1NjuKdRezqvO7OKw84u8rMaVh1nrcrn9q+4LrbZ39a4ecb11lkvpbXTn00/PvPpvPWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb5W/esj5yHc4Z0bnZ98k3Mu7m1ZXO2PIr+6q3NeIOeowZ1fnN2cY8VmuUs+paeR1a9h+FuPsc2vdfON8z+5/TE3PPJK3nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPGt8vcN2j2JezPf43yTUjfJHe7n3VG7p3VXqd52Z+XeRv51fleTOMeJTep5Na24rbaR3+U4cd7att+tefOO+81X3p23nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwSvnN6y4F9ow/xv2/4b4vyH/13r9V+v1f62f/2r9/F/r9z+1fv9X6/e/tX7/X+vff2r9+1+tf/+t9e//tf77j1r//U+t//6r1n//V+u//6z13//W+u+/a/33/7X+9x+1/vc/tf73X7X+93+1/veftf73vxv+1fa/o0c8lRY3vpge3fvVtHvprfSDn/8jbfaH99OQM6en/abOTNMXzUmXvvBFGrr7V2nNqUvSs7E8dU9blUbvuC5dvEV2Vry2Pnac2DveW9YnNm7M6oIVjXHRu02x/PbmmLlvS+z3t5ZYd3hrND3ZGpWmtnhjYFvce1FbrLutLTb6TdF61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfK3//fMvLV9OT1b6Vt934nvX7zlHT99TPShdvPSmMu+CydN3xeam9flL449et0/bCV6cKt1qbtJ9TFmT+ojxOn9o5Td26Ij87IYtPPmmLWFc2x/Q9b4vSds1g2Mzt/X9EWhzW2x4hL22PPaVn+27YjxpzeEXff2BH3/KEjFjxWtJ71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxrfL3PvQ9NOKddEL91PTwrh+mu5pmp4HXfJ5mPjg/PTVycdph6bL08lar0w296mLY273ipAuL+T74pMbY/u6mWDm+OZ+vs15szefzzO+2R2lxVgde0xEHruuIbw8vxY5ZXde7Iav39inH4aeV47WLy/GdK4rWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ75V/taE92Js9NkfplkXz057bTs3vfTTBem5S5ekG7M6aswla9IpY+viqbvq45Vjshrzk4aYPagpej3YHJ9OaYmdvmiNsz9uixhbcF7XPzunvFaKRw8rx1nZGffyjTqj6YzOaL6vM058tzMeXtwZFzR1RX2pK2896zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544lvlb19YG94PmXNOnpsGfbIgvd+zNO07d0VadtbadNSRvWLePr3jlfqGOPj+xlizdXNc8bNivs+Z1pav2atf6oiWG0r5PN73fjlKQwpOTXt0xaXXd8Wit7ri1rruSDt0x6sHd8cDg7pjwMlF61m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPfKn+xwf6wRrwnsv0GLk1PfndlumnV2nT7w73i1kd7x1bXNcSrexVr3X4Usy4a3Z7v3yW3lvI1bN7OfLYz5uzfFeP+0hXPbNEd51yQ/feX7thsYXc8tUVPHJR64p5BPTF0aE8sHF60nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPGt8hcfxQj7xFrxvuiIq2un9Ion5veOgz5oyPebeCw+i01n7NUR3zy0mO8TOjvjDxOyNfvjrnhsZVeO/d4p3bHnTj2x4vyeuPuRnnh6Sk/ctbInLqtU4tBtK/H4LpXYdPei9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvlb8cIU6KFfaLNeO90V3Xp8hpf5reFPGLlji5sy0eO689j9v25V9fzs7oozvjvJOKtf38zd3xHw3FvB7zQk+curYn5zhsSCXWXlGJc35dibqHK/H6U5W4/oVKPP9S0XrWb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8pfnpQrxEsxw76xdrw/NrZY2BQ7PtGS5+fbn2nP4/JjW5fj+f8sYpj9an62q+uJiy4u5s983ji0En//VSWOeq4SW79Xif0+rcSgJZX4fHUltq/vG4v69I13GorWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ75V/moF+VLOEDfFDvvHGvIe2dr+xCLGicP236qzO6NyXLG/t3ijO9+/Yyb0xGs7ZOv4wkoMf7TgsM9XBdeB7X3j1c6+cVtX3xictT8p9Y3FWd+p7UXrefD6cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPfKn/1kppB3pQ7xE8xxD6ylrxPNreKUp6vh9zRmcdncduaPOCOnrihpZgna3jMtEqcuaISpba+cX7G59hyxq2pbyxdVYmTF1Ti4lnZvGYyN0+qxA/fKVrP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Fb5qxnVTWqHPL/XF3FeLLGfrCnvlW35ef97uuLLkUVsO39ssb/fuakSp7xdiQeWVuKPbcU8/qi1b5yV4b5rZiWW/XclDs6wN92S7fGLszWecXj9hEp8eGzRetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3yl/drHZUP6kh5FG5RDwVU+wra8v75WPG1d15rrIfRx9ViV8+kM3bx5V8H5uvzTOcxy4t5hWXeZdmPA+txIBNKrFgXk9c+GZPTB3TEw+O7ol37ixaz/qNkyNPjz477G2+fj3xwx+//MMBD1zwwQlvHqfOK/ICPnl9kPHDE98qf2cH9bMaUh2llpBP5ZQ8rm5d7HdrzHvm6+6PeuLwk4q4/fb8Sr5f7d8T1xZr+cwM29f/J8O9VSWGTuuJebdle+TInvh5uScmTu+O8c90x+53d8fevy5az/qNkyNPjz477LHL/uD18YFf/uGABy744IQXbvjxwAcv/PDEt8pffnSGUEerJdVTagp5VW4RX8UY+8xa8775FJ/F613LRQz7LItV9/61mLeJWbw2nzsNyzj06sk5zj+wO45b3BVv/6krtrmyKy45rSs2GVS0nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPGt8neGdI5yllBPqynVVWoL+VWOEWfFGvvNmvPe+f6iXOzzjk+LtWo/W8OTLumJbVZ2x+MXF5zXjOiK4XVZTfubzph8cGds19QZV/6rHOdOKuetZ/3GyZGnR58d9thlnx/++P1i/TuABy744IQXbvjxwAcv/PDEt8rfOdpZUpx0plBXqy3VV2oMeVauEW/FHPvO2tt1PXdx+87fVuKC/SrRPD7z/e1ivm9dXczv8U90xoyeztjhmnKc36ccZ44uRcv3SjF4yyymlovWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ75V/u4SnKfFCOcquUN9rcZUZ6k15Fs5R9wVewauz9vmAZb5u1XyGGb/jjqlO7b9bVc8OamY52e/k51xLy/Fnydm5/zdOmK7p9uj3/HtsckW7XFVS9F61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfK335wp+Bc7WzpfCV+qrPVmuotNYe8K/eIv2KQfWgtmg+Y7NcB+3bn+/mCi4v53ubmUpx6V8F57sy2+Gz7tph1W2v8acvWmDqtJfZ9pSVvPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb5a9GdK9ifzhfO2Pm5+/srKHeVnOqu9Qe8q8cJA6LRfajNWleYHvwiK58H9/Yv5yv7X5fZrwntkXPS60515Y5zfHYLs0x+OGm+MtxTfGjvYvWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ75V/u7V3C25X3HHYL84azpviSXiqtpT/aUGkYflIvFYTLIvrU3zA+Nn3eV8DW9yeXs+n+b33FHNMfH8pvjujxpj8R0N8fKSPvHZbX2i77lF61m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zyu5mMJ75V/u4W5cf8jimrm9w1OG/bP85dzh7qbzWoOkwtIh/LSeKy2GR/WqPmCVb7+at3W+P+w1riH+ObYsD3GnOO48f1jkdeqY8P6uvjoRt7xR4/7JW3nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPGt8ne/6o7RPZt86b7FnYNzt7On/eQMog4Xb9VjahJ5WW4Sn8Uo+9RaNV8w77pxS762zWuvT3rHnUfXx72f1sVmF65LjY+sSQ/dtDrdsePqvPWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9eOb+MJ75V/upj96zWhvs2d07yp1rC+dsZ1DnM/lKPiznqMrWJ/CxHidNilf1qzZo32Pcb1BADB/XO5/mSTdaln725KpXXLE9n//PrtODqpenxjqV561m/cXLk6dFnhz122eeHP375z2usrQpc8MEJL9zw44EPXvjhie+/7z+yeKhGVC+7c3TvZs24f5FP1VfOos5jziT2W16bZnFYjSJPy1XitZhl31q75g+H3bp6hfkdN2xFznXizovS8tEL0nur5qWnz5mXt571GydHnh59dthjl31++OOXfzjyGvvS4swEJ7xww48HPnjhhye+Vf6+Nbhvd+csTqqf3b+5g3IPYy3l9X12JnUuy88mtxX7Xp2mVpGv5SxxW+yyf61h84hL/9uXp53vX5zm9CxIW2/6RTp71afpGys/SY8c+kneetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3yt/5SG3g3t3ds7rJHaT46S7KfYw7Cedya8z5zBlFna5WtR/FJnlb7hK/xTD72Fo2nziZ59vu+SwN/2BWisZ/pRevnpFu+v30vPWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb5W/b06+u/j24PysZnAP6y7SfZz6Wlx1N+F8LufIv9aeel3Nqm6zP+VvOUwcF8vsZ2vavOJ27Kkf55zP/GBKOvDu99LJIyflrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098q/zdk/j2JD+KEe7hnSXdx6ol3Mupr9Tb7ijy81h2VnVek4/V7dak+k0NY7/KZeK5mGZfW9vmF8fHX5ycpj/999T7jAlpk7fezFvP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Fb5Oxv6/qZG9B3Gtwj1s/zpXCWWuJ9TY7inUXs6rzuzisPOLvKzGlYdZ63K5/avuC622d/WuHnGdXbPG+nYjlfyv3/VetZvnBz5XC/TZ4c9dtnnhz9+87yT4YAHLvjghBdu+PHABy/88MT33/HvtuK85zucM6Pzs28S7uXdTaurnTHkV3dV7mvEHHWYs6vzmzOM+CxXqefUNPK6NWw/i3H2ubVuvnH+euhz6eQ5T+WtZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3yr/H2Ddk/i3sz3ON+k1E1yh/t5d9Tuad1VqrfdWbm3kX+d39UkznFik3peTStuq23kdzlOnLe27Xdr3rzj/vEfH85bz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnvhumP8N+39D/N+Q/2u9/qv1+r/Wz3+1fv6v9fufWr//q/X731q//6/17z+1/v2v1r//1vr3/1r//Uet//6n1n//Veu//6v133/W+u9/a/3337X++/9a//uPWv/7n1r/+69a//u/Wv/7z1r/+99a/vc/xlQhSnic7dv5o1VV+cdxLuPlzvM55957roqgoZJD5pz7SSLJBIeinDJNAc0hhzTNOcuxNHHKIRW1VCwcU0Q0xYxQU3FMmQQVFBUcQEAGv+e1t+f7Txz4ZbP3Xut53p+z1nqeZ61zbq9eG/5ducnjyQ4PPp0sXfRc8qtHX07+8o03k0P3eyuZ2LEoOft3HyQ9t3ycTDtqRXLHgtVJ1K9P1n3eK7Z4qnf84ti+kV/eL048eEA8d1t1nPr8wJg6pybmvFAbubvq4rqj6+M3LQ0x9/aGmLhJY9x1cWM8NLcxju5piuF7N8Ut45vikROyq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pesn7/nzX4v8mK7V9Jjl70ZjJw1wXJM9svTv7x6ofJso0+Te5vX5ns88ia5Nr+veLdgb1j9uI+8czEflGz84BYM7k6qvrVxHm71caCH9XF78bUx8ydG6JPv8Y4fUpjjB3TFEvmNEX7vs3xv3uao9+65hi9U0vEz1ri22e0xB/Pz67uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oesv6fR6eLdlkdnL9PQuSD+cvTuY9+FFyyTafJZuOWZWsHLwu2WFWr6h6r3ds8b++MeC2/rHue9l4L962NmaeUhc33lCfjlfdlY3peNYObo57ZzbH2we2xDuvtsSbu7fGc1e3xu2zW2NIc1t8sENbjB/VFvN+mF3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb1mxM+F+/m599LNhu8NDn95c+SXkNXJ2s3W58sHl8Vqyb0iS+v7hdjThoQRw4dGDdPq4kLhtXFbWfVx0WTG+K/TzZG/SNNsfDqTPPE/q3x5z+3xqiN26Luj23Rs7Qt7ty1PSad3h5r72yPvZ5pj7Z57XH7O9nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Zv3Vhbvh8tJk8cHly3YTVSf7J9ck/n62KYl3fWDaof1zWXB1HvDEwFp1RGzd9URcb/zgb7/p7m9I5O/iqlrj70Gx8R/y9Le7dPtN0V21HdB7aEVdO7IhtXu+IBV92xNjuXIwclov522VX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71l/WKD9WGO+Jy0PXD5+uSMdVVx1A/7xjfO7R/b/KY6/nVwTYxtyOa69ShmdZzcnK7fa8a1pnPYuNVc1h4X5TviiMs74oDlHdHwvVzUX56LaTNy8aPluXi3PR/fHpaP/rvmY0KSXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvWLj2KEdWKu+Lz0EVdvntw/9n+6OhbdV5OuN/FYfBab+je0xAs92XivXtQW3721PWpHdMToWZnm4ZNz8XrvfFw/Mh9xXj5+PDkf35qVj54P8rFkbT72HVCIR2sK6dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1m/HCFOihXWiznjc9P3ltnVac7Z74G6WHhYQ6xb1Bij9mxO47Z1edi1bfHaSe3Rsl02dw8+MhfTZ+fScV1+RT6qXs2nGgd8sxA3jylEw/GFmHhOIY66tBBDJxTi4Kuyq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pesn55Uq4QL8UM68bc8fmx8fiMunjuwoY0P2//h+Y0Lo/+ojUOXtuWxi7r1fj857VcdIzKxs94Dtu1ECccU4hllxfiX5MKMe+xQqx8phCXvlyImf8rxFWzC3HSnOzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLesX60gX8oZ4qbYYf2YQz5Htp7ZJotx4rD1d+Me7fHQltn6/udNuXT9jr41H+N7FaK4VyFqfpNpmP3vTNt7CwsxdnEhtn2vEGsWFaL73ZLutwvR6+3s6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3rF+9pGaQN+UO8VMMsY7MJZ8nm091tKb5+stj2tP4LG6bk+8ck4+hb2XjbQ7vc28hal8sxL0LCtFa0rOCtrmFuOalQqx7uhC5qYU4sdRm65KufndmV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Zf1qRnWT2kH+lEPEUbHEejKnfK5sy88LT+2IP4zOYlvrNdn6PumIQnx5ayH2fK4UzxZm49hY4q4rcX9rSiGuu7EQi0rsdx5ZiPpRhZi7SyGO3roQ526ZXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvWrm9WO6ic1hDwql4inYop1ZW75fPk4+8Ash6XxfEghtjurEOunZOvYeD1W4l3xbDautFy2byHO2agQby3Lxx//lY+2W/Jx+m/zMfLkfJx0XHZ177n32mmvn/7ssPfYV/OJH/745R8HHlz4cOLFjZ8Oeuiij056y/rtHdTPakh1lFpCPpVTxFWxxfoyx3zOfMVD+fhg2yxuH/90tl6t3zWvZHO5tsR27e6F+HxVPvrdm4/Lxudji03zsfmiXBz/QKne+UMuXj0lF7OPy67uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oesv65Ud7CHW0WlI9paaQV+UW8VWMsc7MNZ83n+KzeP3KV7Hs4hmFGH51Nm7Hr8vG8/nd8rHi9Uzj5Z25+HxmRxx3YUc8PaZU4+3YEVO3yq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oesv67SHto+wl1NNqSnWV2kJ+lWPEWbHGejPnfO58/35Rtj4nP5bNVevZHP7lPvl4+sVc7DMq03zz9zti4Oul2v6E9vhVd3vMnNsWmzzcFs2Tsqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ++2h7SXHSnkJdrbZUX6kx5Fm5RrwVc6w7c8/nj0Hc3vGXJd+thbjr+tL8aMyn47fNy9n4rrqwPc5e0hbPHNgWLaX9Xc3JrXH3kNZYs6Il5r3bkl7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb1O0uwnxYj7KvkDvW1GlOdpdaQb+UccVfssf7MQeOA5fKSXzHM+t1l+1ItdHJHjJmUjfOBbaU97g9b44e3l/b5NS0x89LmmDKsOaZ+1hSD3mpKr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056y/qtB2cK9tX2lvZX4qc6W62p3lJzyLtyj/grBlmH5qLxwGS9zm/Opeu5dVR7Oo7/PqI1qk7KNF86pSku+bIxfju+Mfb7vCFOv7ch5v4pu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLetXIzpXsT7sr+0x7bPsNdTbak51l9pD/pWDxGGxyHo0J40LtpGDOtJ1vFX/tnRuT5le0n17Uzzo3KKk9e5p9TF6QH18cU5dHLhVXTQ0ZVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvWX9ztWcLTlfccZgvdhr2m+JJeKq2lP9pQaRh+Ui8VhMsi7NTeOD8eL3s7k+9QfN6Xga36YT6uMXI+ti6fDauOrYmvjZswPj4vED4+ER2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1m/s0X50RmTuslZg/229WPfZe+h/laDqsPUIvKxnCQui03WpzlqnLBazxPuaozvbtwQJ95QF/OH1KYax/6pOva+bkCc+Ub/+N7P+sdrO2dX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71l/c5XnTE6Z5Mvnbc4c7Dvtve0nuxB1OHirXpMTSIvy03isxhlnZqrxgvzK0vr07ltXG99tDp23HxADH+8X2z9x75x+919YkV3nzj2w97p1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD12pvpJOesv60/p4TDb3nbc5c5I/1RL23/ag9mHWl3pczFGXqU3kZzlKnBarrFdz1rhhn7tVTby/VXU6zj85om8c/mjvGDqmKl4f3iu22+bL5JOp6xNX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71l/eKhGlG97MzRuZs54/xFPlVf2Yvaj9mTWG9qU3FYjSJPy1XitZhl3Zq7xo+GVxb3S8e39yVVqeamOWuSXfdaneTuWpmsKqxMr+4991477fXTnx322GWfH/745R9HWmPvm/HhxIsbPx300EUfnfSW9fuuwXm7M2dxUv3s/M0ZlHMYcymt7+dm+7J0bzI+W/fqNLWKfC1nidtil/VrDhtHWh7ZqCpO3H9dMvTJVcnYGcuTyXd+khx+x7LkoxVL06t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ++yO1gXN3Z8/qJmeQ4qezKOcxziTsy80x+zN7FHW6WtV6FJvkbblL/BbDrGNz2XjSZJxfGvVpcvdFHyXnP/B+sn7rxckLoxelV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Zf2+c/K9i+8e7J/VDM5hnUU6j1Nfi6vOJuzP5Rz519xTr6tZ1W3Wp/wth4njYpn1bE4bV9quqfsw1fy3ixYkF+w9L7lp8Nz06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3rN85ie+e5Ecxwjm8vaTzWLWEczn1lXrbGUW6HyvtVe3X5GN1uzmpflPDWK9ymXguplnX5rbxpfGTo+cnGx3xRjKi5dXkkF+9nF7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb12xv6/k2N6HsY30Won+VP+yqxxPmcGsM5jdrTft2eVRy2d5Gf1bDqOHNVPrd+xXWxzfo2x40zrZs/OSu5ZuqzSf89Z6ZX9557r532+unPDnvsss8Pf/zyjwMPLnw4u7+KgfjpoIcu+uikt6xfPWR/5Hs4e0b7Z99JOJd3Nq2utseQX51VOa8Rc9Rh9q72b/Yw4rNcpZ5T08jr5rD1LMZZ5+a68aZ5p5ankpuvfDy9uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6/cdtHMS52a+j/OdlLpJ7nA+74zaOa2zSvW2MyvnNvKv/buaxD5ObFLPq2nFbbWN/C7HifPmtvVuzht32of85IH06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KR3w/hvWP8b4v+G/F/p9V+l1/+Vvv+r9P1/pZ//VPr5X6Wf/1b6+X+lf/9T6d//Vfr3v5X+/X+l//6j0n//U+m//6r03/9V+u8/K/33v5X+++9K//1/pf/9R6X//U+l//1Xpf/9X6X//Wel//3vhn+V/e+p789Ixs17Pulpfi254905yas/eTu5/Iz3k1mxLLnnnuXJPs+sTj6csD758HdVMeWGPtH++36xxwED4qKqgbHNxTVxyce18c5O9XHZEQ3x0omNsfzIpth69+a4b31zXH9HS3y+c2s88lBrPNnTFs+f1BbnPdAWBy9oiymlum1Wv/b06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3rN//q/Z5Ldnsp3OT65veSXYZuyT54tCPk0Vfrkg23mtN8slGveKJE3vHPTf0jXU39Y/PzqyOhTvUxKDna6P1O/VRuL4hrpvVGKs/aIo/L2mOBc+3RNf1rXFFKa6dtaQtepfqtGHvtsfH3+mI4oSOGPffUl2wsiMOasrFnflcenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9bv8/Csa+93kmffWJJ013ySNMz/PJl60Npk0j97xVWb94nR4/pF4awBscdxA2PjnWqjfX5dOg5f/rtUb9Y0x4PbZOM8+GvZuG76SHv8p5TD1yztiHU/z8WnL5f2iVvkY9oJpRrvr/no81w+zl2Yj5XvZ1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvWX95oTPxbvG4Z8kPxq9Mpm0bm3yp6FVcc2dpby/tl80fa06clvWxPED6uLMx+vj4f0a46bpTfFoS0vcMrw13v1RKX+Nbo8vtsg0P3JDLh7aLh9j/5GPwUMKscP5hXiitIed3tAZbbt3xhE/7YytTu6MaadnV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Zf3Whbnh89Fm/jfWJWMPrYrbV/SJ1w/rH9+cWMqtU2rijr+WtB9fGvOmkr/Lm2OnD1vS8dhsRDa3dxuai6c+y6Xj+JM9CvGfmYVU05O3dMZ2n3XG33boipHHdsXqq7rirPu64rDpXbFyRnZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvWLzZYH+aIz0nbEY1948oJ/ePc96vj++21MTJXH3M+boizbmtK5571KGZ9vTpbx5PX5NI5bNw23bQzbvl7Z5wxuCtOuLgrNpvXFUMGd8crh3TH8Rd3x/pJ3XHg9O7oebE7Jr2SXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvWLj2KEdWKu+Lz0EVcfHl4bxxxUH+u/m61z8Vh8Fpt6buuIxQ9k491yZiEO3bHE+GZnjBuXaT5keHcsu7Y77p/bHQd0FOMXw4sxZlwxdji3GL0nFOOoG4vx8s3Z1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvWb8cIU6KFdaLOeNz03fKCfVpzjl6ZHN8saIl2s9si7Fz2tO4bV2etlUhlg3ojC1mdKZz9+TVXfHmCdm41m1ejMLPM40bPVOMKUuKsVmfnnikrSfO3bgnvr15T/xyaHZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvWL0/KFeKlmGHdmDs+PzZeO6Q53uluTfPz3oOyeD7u8nz88opCGrusV+Pz1jHd8fWF3en4Gc8RLxbj4l49UT2kJ0pZNz7fvycaD+uJ247qiYXH9cTfTuiJS0/Mru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056y/rVCvKlnCFuih3Wjznkc2Rr4dNtacwRh62/B18vxPNPdKbr8/VvZOt33I7FOOfq0jyeX4xBuUzDZwdn2qpO64mzzuyJ753VE62l6/a/LukuPcufll3dt371Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnr/X3+pXlIzyJtyh/gphlhH5pLPk83Zd+fSfJ2ryuK5uG1Oru1VjD1OycbbHB4/oic2HdsT/zm1J7Ys6Wk4o6Tt5J6YPL4n2kt6tt6nNK6lNnuWdBW/lV3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb1qxnVTWqHNL8fn8V5scR6Mqd8rmzLz1/UdsVf3u5KY9OWW2br9NJVxcjt1BM/PbwnjvpVNo6bl7gHl7jHjOqJ+7btifUl9idWF2PIwmKseKEY5/2rGH96Iru699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3rVzerHdVPagh5VC4RT8UU68rc8vnycc3SrjRXpfF8ajH2aumJjtHZOjZer5V46w/PxpWWv75bjGsfLMaq3xbjrgOLsdU3izGhUIzDqotxSe/s6t5z77XTXj/92WHvta/mEz/88cs/Djy48OHEixs/HfSk9UFJH530lvXbO6if1ZDqKLWEfCqniKtii/Vljvmc+Trg+8XoM6OYxu0LDsrWq/Xb+vNsLm9aYrvn5WI0XFaM4oiSlrXdsceU7kjO6I4LRnbHWYO646Oa7visd3Z177n32mmvn/7ssMcu+61fxQd++ceBBxc+nHhx46eDHrroo5Pesn750R5CHa2WVE+pKeRVuUV8FWOsM3PN582n+Cxef/hVLJt4SE8cvEU23hdOyMZz0azuqD8u03jHPV3R8NOuuKC7K+YuKcWQ5zrj5Sezq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pesn57SPsoewn1tJpSXaW2kF/lGHFWrLHezDmfO99/OSNbn//eP5vr1rM5/Pt3umPu2O4YvzDT9PBbnbHJsaXavl9nXH5fIRacVIid9y7E0CS7uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt67ePtpcUJ+0p1NVqS/WVGkOelWvEWzHHujP3fP4YxO19B5bW5p3FmL51aRxuz8Z75FFd6fg2FTvjmnMK8fbSfGxR2t8Nqi7V8VNz0XppLj7/dXZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvW7yzBflqMsK+SO9TXakx1llpDvpVzxF2xp+qrvG0csNxxcxbDrN/9Z5ZqoequOC7pTMf1xLvycc77uTh251wceHNHLNi4I16c3h4vXdQeu5ySXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvVbD84U7KvtLe2vxE91tlpTvaXmkHflHvFXDLIOzUXjgcl6XfnXrnQ9b7kwG+95q3JRGJBLtd02qj1uvaotblxbqksubY0rRrTGimHZ1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvWb8a0bmK9WF/bY+Z7uNKew31tppT3aX2kH/lIHFYLLIezUnjgu2wh7P1/Z0b8uncfvHHJd07t8dzJdu0PrVfS4y7sTla2pvjpCebYvO/NKVX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71l/c7VnC05X3HGYL3Ya9pviSXiqtpT/aUGkYflIvFYTLIuzU3jg3Hi2fl0Dr/0Xjbexvdr/VriwrlN0f+Nxvh7VWP8+rCGmLi2Pl54sz69uvfce+20109/dthjl31++OOXfxx4cOHDiRc3/nTfuGkWB+ijk96yfmeL8qMzJnWTswb7bevHvsveQ/2tBlWHqUXkYzlJXBabrE9z1DhhtZ4n7d4Wh/6jJS7epjlWTc00nz2sPo78el1cfXxtHL6yJpY+X5Ne3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfSW9TtfdcbonE2+dN7izMG+297TerIHUYeLt+oxNYm8LDeJz2KUdWquGi/MH57fks5t4zp13/rYZ1ptHPyDmthzyMCYFtXRcP+A+O15A9Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4MeulJ9JZ30lvWn9fGSbO47b3PmJH+qJey/7UHtw6wv9biYoy5Tm8jPcpQ4LVZZr+asccO+4smGqJpel47zKauq4/R9B8S3l/SLZf/rG9sO6xtXfNonvbr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLesXD9WI6mVnjs7dzBnnL/Kp+spe1H7MnsR6U5uKw2oUeVquEq/FLOvW3DV+NHx0Zk06vp0b9U+1bnx+79hhl6q4/ehe0TaoV3p177n32mmvn/7ssMcu+/zwxy//ONIau8SFDyde3PjpoIcu+uikt6zfdw3O2505i5PqZ+dvzqCcw5hLaX1/crYvS/cma7N1r05Tq8jXcpa4LXZZv+awcaRl1oP9Yt/d+8TfV/SKaz5Zl8x76YtkwqxVSXHjVenVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Zv/2R2sC5u7NndZMzSPHTWZTzGGcS9uXmmP2ZPYo6Xa1qPYpN8rbcJX6LYdaxuWw8aTLOfU5bk8y+//PkgbmfJlsf9HHy5WnL0qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ+3zn53sV3D/bPagbnsM4incepr8VVZxP253KO/GvuqdfVrOo261P+lsPEcbHMejanjSttM3ZYkWqec/+S5KFTs79/c3Xvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9bvnMR3T/KjGOEc3l7Seaxawrmc+kq97YxCvLVXtV+Tj9Xt5qT6TQ1jvcpl4rmYZl2b28aXxkFXvZfs84eFyam7zUt+P3FOenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9Zvb+j7NzWi72F8F6F+lj/tq8QS53NqDOc0ak/7dXtWcdjeRX5Ww6rjzFX53PoV18U269scN860HvDBm8mMd15JdjzxpfTq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLesXz1kf+R7OHtG+2ffSTiXdzatrrbHkF+dVTmvEXPUYfau9m/2MOKzXKWeU9PI6+aw9SzGWefmuvGm+ejdnkteeGxGenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9bvO2jnJM7NfB/nOyl1k9zhfN4ZtXNaZ5XqbWdWzm3kX/t3NYl9nNiknlfTittqG/ldjhPnzW3r3Zw37rSPuXBaenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00ENXqu/97Fxow/hvWP8b4v+G/F/p9V+l1/+Vvv+r9P1/pZ//VPr5X6Wf/1b6+X+lf/9T6d//Vfr3v5X+/X+l//6j0n//U+m//6r03/9V+u8/K/33v5X+++9K//1/pf/9R6X//U+l//1Xpf/9X6X//Wel//1vJf/7Px48bJN4nO3bibdU1ZUGcObxMb95rKr3XmG3GqMtKlGpbbTBMWCWGg1GIxI1DmlnjRjaASdERYxDOhhaxAlnQMEBcQA6kVbUGCCJs6LGiNgCAhK17+/e1F9RsJbres/ZZ3/fV+ecvfc5Va9Ll+3/3v1iZWnKFatL+yx6q7Rs2trShh6flh4ofFFa/9Hm0ktHfV16fK+u0fP27nHRn3vGmPW9Y87bfePV+/tH3ZEDYskbA6P+gMFxzrQh0bJwaJywbFhcvqg6nrmxJuKHtfEv22pjynV1cWC/+hh3dn38ZHl9DO7dEJ/s3hBjxjXET4/Jnt6162fH3jjj+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056y/r9f9uXb5UO6PVhaeHCT0tHV20o1ffaWupxzzelWVu6xiXn9Iixy3rFqPV9YtoX/eKyV6rirKkD49H84Jh965C4d93Q2KGzOq4u1cROo2rjzEJdzF1XF7k76qNqVEPcuKwhnt6rMf7ztsZ4YG1jbMo1xUcHN8XfTmyKPU/Pnt6162fH3jjj+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056y/p9HtpGbvi09LdLNpS+9+jW0k5Xflv69JJuMXJYz2if1DvefKJv3PtK/3j12QHx8LWDYs5u2Xxf31gdZx1XE/tPyeZ5/qT6dD7nVTXGj+Y1xtTvN8W0Z5ri0uHNcc7k5jhkaXP879bmmNHWEoP2aIkr982e3rXrZ8feOOP54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnrL+q0Jn4u+nT/ZWjp307elia91i+G/6hmd/+gd14/rF7MmVcXdkwfG1z8eHP2HDo3Rdw2LnWtr4uCTamOXW+vi3Ln1seCOhrhmcqb5wPVN8e9XNsfGPi0x/8KWWLaqJcZ2tMbhE1rjzhtb44t5rfHU8tY45KXs6V27fnbsjTOeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3rN++sDZ8Pmwmr+sWGx/tGf92UJ84aUG/WLqxKm7pPyhGfJVofz6Z84nV8e/v18T/lLL5fuy2hnTNrri4KX44JpvfT29uiR+1ZJrGbWyN50a3xd5T22L1kra4+uO2qOqZi/U1ubiyKXt6166fHXvjjOeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3rFxvsD2vE58T29Ql9ovBhvxi074D4yymDYvWpQ+K0A4ZF1ebqdO3Zj2LW4vGN6f7dd2y2ps3bvPNbY5eubdHvwrb49o22eGzXXCy4IBcnPpKLr9/IxbRvcvFxTT4ebM/HyB2yp3ft+tmxN854fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pesn7xUYywT6wVn5cx4uroWwfF1geHxHX/NSzdb+Kx+Cw2PfhlY5zfO5vv/17ZEuumtsa8ndti0xOZ5k9uycXkv+div13z8dHP8/HNLfn44Il8LPtjPm5cm4/N6/MxYUP29K5dPzv2xhnPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1i9HiJNihf1izfjcjB2zdEiac7b8tiauOagu5qysj427NKZx277sfUlLTB7fGk80Zmu322G5+PnSXDqvv70oH/cuzjQ+1FKIMaMK8dhRhTjwlEIMOrcQr1xUiO6/yp7etetnx9444/nhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oesv65Um5QrwUM+wba8fnx8fPHqmJc86sS/PzX89rTOPypveao/valjR22a/m5z+W5GLxiGz+zOfr7YWoP6IQt1xYiNNuKsQVdxfid/MLsdvThTjruULsvbQQDcuyp3ft+tmxN854fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pesn61gnwpZ4ibYof9Yw35HPk6qyGLceKw/bf/jq3xk+psf590VbafN03Nx8C/5WPpboV49NRMw2UPZ9qmryhE1SuFWJP8N3tlIV54KdH9v4W4Z0X29K5dPzv2xhnPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1q9eUjPIm3KH+CmG2EfWks+Tz1O/bUrz9d1HZPFc3LYmrz0iH6/+Pptva/jL2woxb1EhfvRiIZ5MtMx8OdG2vBD7PlWIOQ8V4pnZybz+phCrZhTigenZ07t2/ezYG2c8P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb+aUd2kdkjze5JDxFGxxH6ypnyufMvP1xzfFrvvmcW2Jydn+7vx0ELcfW0hPltQiM0vZvP4+B8KMT/h/cF/FyKuKMR1CfexhxViwYhCTEk0DK4vxPDq7Oldu3527I0znh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6xf3ax2VD+pIeRRuUQ8FVPsK2vL5wuj8/tZDkvj+YBC/Plnhbjrjmwfm6+JCc+ZC7J5pWXEyEIU+xTiqjX52PPBfDx1dT7yZ+Rj/fh8NByVPb1r18+OvXHG88PfxH+uJzjw4MLHAx+88MMTX7zxp4OetD5I9NFJb1m/s4P6WQ2pjlJLyKdyirgqtthf1pjPGdZHv8vHjMYsbtc8lO1X+3f24mwtz0u4jRpeiNvfzccDt+VjxLhkj/TPx8sv56JmZlLvnJ+Li4/LxWVHZU/v2vWzY2+c8fzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX98qMzhDpaLameUlPIq3KL+CrG2GfWms8bpvgsXk96OYth332kEJ/8Kpu32g+z+TyvMx8zn8007tE9F7fPa4vqM9vi9FFJjdfWFhNqsqd37frZsTfOeH7445d/OPDgwscDH7zwwxNfvPGngx666KOT3rJ+Z0jnKGcJ9bSaUl2ltpBf5RhxVqyx36w5nzvs3Vdm+/PIu7O1aj9bw0175eP0J3Lx5YhM8+jd2+KRJUltf0xrtPZsjTOXt8TvZ7XEohnZ07t2/ezYG2c8P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb9ztLOkOOlMoa5WW6qv1BjyrFwj3oo59p215/PHQdx++9gEe1s+xl2e5OnN2fytfiqb31lntkbnH1vi7O+3xBMvNMej45M6fmBzzH6rKa54uSl9eteunx1744znhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt63eX4DwtRjhXyR3qazWmOkutId/KOeKu2DP9n3nbPOCyx4Yshtm/7zYntdCxbfGPGdk8d/m6OQbu2xzbpiXn/C8a48xzG+P42sY44Y2G+MPvG9Knd+362bE3znh++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96yfvvBnYJztbOl85X4qc5Wa6q31Bzyrtwj/opB9qG1aD5wsl+v/Crbz0+OaE3n8YxDm+PeHzel2nZLfO/6cX3sOK4+trxVF7nf1MWUS7Ond+362bE3znh++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96yfjWiexX7w/naGTM9x+2c1fNqTnWX2kP+lYPEYbHIfrQmzQtu6/u1pfv4j581p2v7+PsT3dc1xPiL61OtP7yrNjatr4k7TqmJrjU18fiW6vTpXbt+duyNM54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropLes372auyX3K+4Y7BdnTectsURcVXuqv9Qg8rBcJB6LSfaltWl+cPzua9laP2GfxnQ+ze/Co2ujdteauHmn6tjnyGHRd8HQ+O64oXHcd7Knd+362bE3znh++OOXfzjw4MLHAx+88MMTX7zxT8+N52dxgD466S3rd7coP7pjUje5a3Detn+cu5w91N9qUHWYWkQ+lpPEZbHJ/rRGzROu9vPIGfWxrk9d1E+piasGVqcaB1w6JDZcOjg6nh8Unx88KH5VyJ7etetnx9444/nhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oesv63a+6Y3TPJl+6b3Hn4Nzt7Gk/OYOow8Vb9ZiaRF6Wm8RnMco+tVbNF86TVtema9u8HjRnSLw1aHB8cvfAWHXhgDjk11Vxe8+qGPan/unTu3b97NgbZzw//PHLPxx4cOHjgQ9e+OGJL97400EPXam+RCe9Zf1pfTwqW/vu29w5yZ9qCedvZ1DnMPtLPS7mqMvUJvKzHCVOi1X2qzVr3nCfUjMsptcMSee5x6EDos+c/vHKvv1i8k5949lL+kRudJ/06V27fnbsjTOeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3rF88VCOql905unezZty/yKfqK2dR5zFnEvtNbSoOq1HkablKvBaz7Ftr1/zRMOmVgen83nd2v1Trw6t6xbLresZui3vEnef1SJ/etetnx9444/nhj1/+4cCDCx+PtMYemfHDE1+88aeDHrroo5Pesn7fNbhvd+csTqqf3b+5g3IPYy2l9f3y7FyWnk3GZftenaZWka/lLHFb7LJ/rWHzSMtP+/SLt2/sHfsc1DN+fGj3+ObprnH0013i9hO7pE/v2vWzY2+c8fzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX9zkdqA/fu7p7VTe4gxU93Ue5j3Ek4l1tjzmfOKOp0tar9KDbJ23KX+C2G2cfWsvmkyTxPH9Qtth7zbenVKdtKh3XdWmrJbUmf3rXrZ8feOOP54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnrL+n3n5HsX3z04P6sZ3MO6i3Qfp74WV91NOJ/LOfKvtadeV7Oq2+xP+VsOE8fFMvvZmjavtK198+tU81fHbCi93vJ5ad2mz9Knd+362bE3znh++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96yfvckvnuSH8UI9/DOku5j1RLu5dRX6m13FOKts6rzmnysbrcm1W9qGPtVLhPPxTT72to2vzSW9v6/0hm7/7306/c/LM09cG369K5dPzv2xhnPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1u9s6Ps3NaLvYXwXoX6WP52rxBL3c2oM9zRqT+d1Z1Zx2NlFflbDquOsVfnc/hXXxTb72xo3z7SeN+P90tpr3ywdWf/X9Oldu3527I0znh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6xfPeR85Hs4Z0bnZ99JuJd3N62udsaQX91Vua8Rc9Rhzq7Ob84w4rNcpZ5T08jr1rD9LMbZ59a6+ab5qvdfL62b+Er69K5dPzv2xhnPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1u87aPck7s18H+c7KXWT3OF+3h21e1p3leptd1bubeRf53c1iXOc2KSeV9OK22ob+V2OE+etbfvdmjfvtJ/znWXp07t2/ezYG2c8P/zxyz8ceHDh44EPXvjhiS/e+NNBD12pvkQnvdvnf/v+3x7/t+f/Sq//Kr3+r/TzX6Wf/yv9/qfS7/8q/f630u//K/37n0r//q/Sv/+t9O//K/33H5X++59K//1Xpf/+r9J//1npv/+t9N9/V/rv/yv97z8q/e9/Kv3vvyr97/8q/e8/K/3vf7f/q+x/62rXlKbf93ZpzBsfll59ZF3pmx02lhaN/qr0dc8ucfribvH0wT2j/8NJzfT3vnFY16qY+38DYvXiQdF88pBY9tnQaD2qOn75u5po/0NtnLy6Lq55sT6W3tkQoyc2xi4Dkj08qyl+0NwcR01pjhPXNEdtQ0t8ProlDpvQEiedlj29a9fPjr1xxvPDH7/8w4EHFz4e+OCFH5744o0/HfTQRR+d9Jb1+/8dGz8qjf3Xz0ov/HVj6cTvbisNvblLXPWz7nFXv15x5RV94ojV/eKArgNiRo9BcfV7g+OCmUNj4b8le/C+mnjo29r4zp71cf3hDbHruKQm2r0pHk7OIMX5zTF0XEvcurolnj+4Na6Ym9RHm1tj225JDXNsW3x2XlvsOzl7eteunx1744znhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt6/d5aDugblNp45xtpTs/6RLNf+oeX8zoFaXOvrHDdf3j/RUD4qH3kjrotSGx4PZhMfeAbL5/vVN9nH9mQxx0S2M6X09c15zO56LW5Hy0tDWmH9EWN77SFleOzMUvp+fi8FW5eK1/Pm5LarvqA5Mz3Njs6V27fnbsjTOeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3rN+a8Lnoa+7dNZ6t6hGnftArdr6hb+w4sCp+PWFg3HXd4OSsOjS6nVEdQzpq45CFdbHbDknNeWFjjLivKS56ujmenN8SN0zPNP+gay4Ovi0XWxvz8URyXlvxcT6O3CM5yyZ1/n13Jmf55Mzz3JpCjHs7e3rXrp8de+OM54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLeu3L6wNnw+bKd/2iq0v9I2R46vi9OUD48VeQ2Jmy7DYu6omBr9eGzedXx+HbGqIlw7P5vvJuS3pmn3l+rb40THZ/H5xTz6O3SXTdGSv9vifo9sjZrbHm6+2x3VftceQuo7YNLwjpu2cPb1r18+OvXHG88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530lvWLDfaHNeJzYvvnc6tihy0Do3rskHjnomHx5sU1cdZRdTG0b7bW7Ucx64UzWtP9u/8JuXQNm7eFVxdi92HtMWhqe/Rc3x5P7d8RT17TET9/viO6r++IGYM747PhnTF/RGeUvpc9vWvXz469ccbzwx+//MOBBxc+HvjghR+e+OKNPx300EUfnfSW9YuPYoR9Yq34vIwRVw+9b1h8u6QmbnqgLt1v4rH4LDbN79MWkxqy+b773XxsmFmIRaX2+GpFpvnzeztiytcdMWb/zlg3KdF2X2d8sqIzVqztjFs3d8bXXYtxSs9i+vSuXT879sYZzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9YvR4iTYoX9Ys343Iw9bFVNmnO+ebAhbhjfFHPfbY6v9mtN47Z9OWBGPi4/oxDP7JSt3T7Hd8R/rOpI5/WOaZ3x4MrOVOOCXYpx6LhiPHlKMX5wUTFqrizGqmnF6HND9vSuXT879sYZzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9YvT8oV4qWYYd9YOz4/Pk57viF+eVlTmp/fvao1jctfbcxFn835NHbZr+bnvFc74oUx2fyZz7+MKEbLScWYObUYZ91VjGsXFWPOsmLs9XIxzv9jMfZbVYy21dnTu3b97NgbZzw//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Zv1pBvpQzxE2xw/6xhnyOfF2wYxbjxGH776B9C3FiMdvfp/+mI92/22Z2RvW2znjxgGI8fnGm4ernMm03v1mMoe8V463kv3vfLcYf3k50v5XM75vZ07t2/ezYG2c8P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb96Sc0gb8od4qcYYh9ZSz5PPs8ckkvz9QMnFdL4LG5bk9NP6oxVf8nm2xreNrcYC18sxk/eKMaSRMvsdxJta4qx/0vFmPtsMZYuKEbr/cV4Y04xHp2dPb1r18+OvXHG88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530lvWrGdVNagf5Uw4RR8US+8ma8rnyLT/fcFZ7fO+gLLY9Oz3b323HFeP+24uxcXkSz97I5vHpvxZjUcL7k3nFGH1rMW5KuB95fLLHxxRjaqKh5l+LsXMxe3rXrp8de+OM54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLetXN6sd1U9qCHlULhFPxRT7ytry+cLY8Ygsh6XxvK0Yb1+QzNv8bB+br1MTnrOXZ/NKy96HFGOnxmJM+6Qz9l3SGc/9V2cU/7MzNp3RGW2nZE/v2vWzY2+c8fzwd+o/1xMceHDh44EPXvjhiW8apxL+dNBDF3100lvW7+ygflZDqqPUEvKpnJLG1SS22F/WmM8Z1rpHOuO2nbK43fRstl/t33tXZmt5YcLtgJHFuHNDZ8yb2xl7T0j2SEtnvP5ORzQ91BFDr+6Iy87siKtPyZ7etetnx9444/nhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oesv65UdnCHW0WlI9paaQV+UW8VWMsc+sNZ83TPFZvL7knSyG7fF8MT6/IZu3pi3ZfE7aszNmv5Zp3KemI+5c2h6Nl7XH2ePaY/mu7XHy8OzpXbt+duyNM54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropLes3xnSOcpZQj2tplRXqS3kVzlGnBVr7DdrzucOe+S72f4cvyhbq/azNZw/uDPOXtER/xiTaT50dHs8/mpSC59WiI66Qpy3Jh8vP5qPZ+ZkT+/a9bNjb5zx/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Zf3O0c6S4qQzhbpabam+UmPIs3KNeCvm2HfWns8fB3H7g18k2AOKcdTNndGjX2c6f2++lM3vXZcVYse1+bjgiHws+VMuFp6Ri6Nzubjn87a49p229Oldu3527I0znh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6zfXYLztBjhXCV3qK/VmOostYZ8K+eIu2LPzf/M2+YBl30SXDHM/v3oO0kt9Iv26HZXNs89ByVn3LG56DorOef3aIvzr2yNiTu0xsmftcTKv7SkT+/a9bNjb5zxqZ/EH7/8w4EHFz4e+OCFH5744o0/HfTQRR+d9Jb12w/uFJyrnS2dr8RPdbZaU72l5pB35R7xVwyyD61F84GT/TqtqiPdz8+OKaTzeM5xuXjw9EzzXonvPb5qjl0nNMc3nzdF8f6mmHpT9vSuXT879sYZzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9avRnSvYn84XztjOmc5a6i31ZzqLrWH/CsHicNikf1oTZoX3DY1t6f7+M9d8unanrg40T2rJU64vjnVevTCxtjWtTHuuagheg1viKf6ZU/v2vWzY2+c8fzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX97tXcLblfccdgvzhrOm+JJeKq2lP9pQaRh+Ui8VhMsi+tTfOD4x4fZGv95B+0pvNpfhef2hjN+zfEb0fVx34n18Wg5bWxx4TamBjZ07t2/ezYG2c8P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb+7RfnRHZO6yV2D87b949zl7KH+VoOqw9Qi8rGcJC6LTfanNWqecLWfS3OaY0NjU7Te0hDTcvWpxqE31cTWm6rjX14fFl8eOywu3z17eteunx1744znhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt63e/6o7RPZt86b7FnYNzt7On/eQMog4Xb9VjahJ5WW4Sn8Uo+9RaNV84X/K3xnRtm9exj9fEB/nq+HzR0Hhj6pA4/O7BMbtucDR8NCh9eteunx1744znhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt60/r43HZ2nff5s5J/lRLOH87gzqH2V/qcTFHXaY2kZ/lKHFarLJfrVnzhvvU4XVxy/CadJ77HTckBj4+KFaNHRiXjxoQy2dURefRVenTu3b97NgbZzw//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Zv3ioRlQvu3N072bNuH+RT9VXzqLOY84k9pvaVBxWo8jTcpV4LWbZt9au+aPh0veGpvP78JSBqdbHPu4XL87qG3ut7BP3XdUnfXrXrp8de+OM54c/fvmHAw8ufDzSGvuQjB+e+OKNPx300EUfnfSW9fuuwX27O2dxUv3s/s0dlHsYaymt79dk57L0bDIh2/fqNLWKfC1nidtil/1rDZtHWk5qHBhr7+wf+43vG8cf1zt6rOwZP3k5+/sXT+/a9bNjb5zx/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Zf3OR2oD9+7untVN6V1lEj/dRbmPcSfhXG6NOZ85o6jT1ar2o9gkb8td4rcYZh9by+aTJvN8S75XdFvSPX7xetd4YEaXqC50SZ/etetnx9444/nhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oesv6fefkexffPTg/qxncw7qLdB+nvhZX3U04n8s58q+1p15Xs6rb7E/5Ww4Tx8Uy+9maNq+0benSPdXca/K20tv7bSltadicPr1r18+OvXHG88Mfv/zDgQcXPh744IUfnvjijX96p7o+q4Xoo5Pesn73JL57kh/FCPfwzpLuY9US7uXUV+ptdxTpeSw5qzqvycfqdmtS/aaGsV/lMvFcTLOvrW3zS+Mhx28tXXj0htKs3utLj52+Ln16166fHXvjjOeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3rdzb0/Zsa0fcwvotQP8ufzlViifs5NYZ7GrWn87ozqzjs7CI/q2HVcdaqfJ7u3ySui232tzVunmm99PG/lz5/eG3pp/u8nz69a9fPjr1xxvPDH7/8w4EHFz4e+OCFH5744o0/HfTQRR+d9Jb1q4ecj3wP58zo/Ow7Cffy7qbV1c4Y8qu7Kvc1Yo46zNnV+c0ZRnyWq9Rzahp53Rq2n8U4+9xaN980z+j9ZmnL1WvSp3ft+tmxN854fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pesn7fQbsncW/m+zjfSamb5A738+6o3dO6q1Rvu7NybyP/Or+rSZzjxCb1vJpW3FbbyO9ynDif7u9kv1vz5p32yT98KX16166fHXvjjOeHP375hwMPLnw88MELPzzxxRt/Ouihiz466d0+/9v3//b4vz3/V3r9V+n1f6Wf/yr9/F/p9z+Vfv9X6fe/lX7/X+nf/1T693+V/v1vpX//X+m//6j03/9U+u+/Kv33f5X++89K//1vpf/+u9J//1/pf/9R6X//U+l//1Xpf/9X6X//Wel//1vJ//4fYt2bB3ic7duJm1XVlfdxEWRGsKCoYqi56k5VtxxQca6lSRxb20TbsVWMQ6soGuNMFHFsW4So0WCjMQ4BNE6IM6IhHWdNnA1OiUYh4AyivAr6ns853PwTF57H53jO2Xut7+/uvddae99bG2yw/t+SB//Wc9meS3vi3E97nv3xqp6vn/m2568rN4hzXu8dy67oG9uOGRCXThkUaxcMiWdeGhq5P24S+08fHteNr42dHx8Zs3L1sWrSqLjxutHxjzljYqNZYyNOa4j/27Ix7ninMfqd0hTPftwUL+/fHH+b2xxXL2uOE+ta4pktWuL97bOre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96Kfv/fvuDTnt2fW9Xz6C/W9Nx1XK+Yfkyf6LN1v2h5a0D0PmBwvDRn4/jDS8Ni49dqos/8EbHyxJExrk99dJwzKkovjo7b+42Nga0NcVdzY6zo0xRdLzbFLRc2x4zmlhgxtyV6xrRGr8mt0f10a5zZuy2OL7fFxF3b4pF9sqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+n4dnOz60pufrm3tF04I+MfN3/WLSUQNjwarB8bvDhsYR128SnfOHx3631Mbmk+oiV5uN97C1Y2JlNMQTx2bjvNXhzel4bvlZSyz+VWsM6WiLjW9qi94D22PVhPZ4YXZ77PN2e9Ru2BFX1ndE/+bs6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot+c8Ll4d90bfWKHd/rFkvsGxm1HDIk57w6NYeNqouXwEVE4cmRM2bE+rvhyVDx96Zi4e/XYeH73xph3dlN8Na05tr6oJQYdmWl+9qW2eOq49jjjo/bY6tCO2O3hjnipby5e+WEuOk7LxWnX5GLH23Lxwt3Z1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb91YW74fLTp9eLAOONXQ+KBzmHxz2trYtc3RkT9pyPjobcT7bcmY75b4u+JhtijNRvv8ZNb0jm79xFt8WoxG99JZ3XE4u87Uk0vv56LHxbzsfDEfBxycz4GPpeP6Uvz8bPV+RjwXXZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRLzZYH+aIz0nbA340LG59uiaubKqN/9yrLg7ee1R8khsT0xePTeee9Shm9ezUmq7fxzfP5rRx2/LgXMz7Ry6mHZKPqY/nY/yIQow/pBBLrirElMcLMfS9QkxcXYhN+xZjwcBienXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9EvPooR1om54vPSR1x9+uy6+MUvR8XQc7N1Lh6Lz2LTZotbY/WytnRc2u7tiJNPysVWw/Jx5vWZ5pPOLsQGfy7En4YX44R/K8b5Zxfj2OuLsdsDxRj+dDHOfrkYH76WXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvTLEeKkWGG9mDM+N32fmT0qzTmTz2uIQV1Nkb+3Oc6oaU3jtnV52U87YoOdcrH92lw6dy/etBAfzS6k49pwWDFKv800br5BKZ5pLsX4bUvx3J6luOqAUvzksFJcfER2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0S9PyhXipZhh3Zg7Pj82ll7VEF/9pCnNz4cd1JrG5TOfaI+Ln+pIY5f1any+uKkQUZ+Nn/E8oG8p/nfrUow6tBSfnF6KfpeVouXaUtz3m1KsvKUUC2eX4vo52dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/WkG+lDPETbHD+jGHfI5srfy2OY054rD198SQXPztq1y6Pv95fLaezzypGL98LpnHtaUYt3emYaOrMm01d5Vi+r2lOHR+KdqT64/uKcVjybPiXdnVffu699ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0a9eUjPIm3KH+CmGWEfmks+TzY/fa0vzdWF8Fs/FbXNyyPhi7Pf7bLzN4bMml2LLWaVYfEcpdkj0NM1LtN1WisdvKEXuylLExcm4Jm0OSnR1/zy7uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6FczqpvUDml+T3KIOCqWWE/mlM+Vbfl58C75eHBUFtt2ODJb39d3l6IwqRQ/+3Upzr4zG8dtEu6tEu5jLyzFH/+rFEP3KsVLmyZrvL4UfRMNV31TjNu+KqZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/epmtaP6SQ0hj8ol4qmYYl2ZWz5fPua0Z7kqjeefF+PQ3UuRvyhbx8ZracLb9OtsXGl5aEwp5i4vxoAFxXhkRjF2nFiMW/69GKfuVIxZ22RX9557r532+unPDntL180nfvjjl38ceHDhw4kXN3466Enrgy+zOpHein57B/WzGlIdpZaQT+UUcVVssb7MMZ8zX8dPLcaItcU0bv/6l9l6tX47fpvN5S0TtkUDEu4/Jfl9cjEe3CJZI58WYt95hZh5XiGmH1SI76MQfbbNru4991477fXTnx322GW/fV184Jd/HHhw4cOJFzd+Ouihiz466a3olx/tIdTRakn1lJpCXpVbxFcxxjoz13zefIrP4vXadbFsfhKrTpyQjffMp7Px/LpfMRpvyTQ+/GE+mq7Jx69/ko9Pm/Pxgw3z8cHXufTq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei3x7SPspeQj2tplRXqS3kVzlGnBVrrDdzzufO9wPzsvX5xn9nc9V6NodvGF2Mz2YV4qz6Qqrp6ZH52OLmpBbePhe/XdoRK+Z2xJ4XdMR2p2dX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/fbR9pLipD2Fulptqb5SY8izco14K+ZYd+aezx+DuH1kT7I23y3GK8cUY+qb2Xgf/JtsfFv2y8Xc+zviy/aO2CHZ343bKanjP2+L9kVt0W9ednXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9HvLMF+Woywr5I71NdqTHWWWkO+lXPEXbGnZl3eNg5YHn4ti2HW71Hf5+OLnfJx3um5dFwv+Ft7/LKpPc49uS1OeK01VhzQGu+tbokPHmuJvX6fXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvRbD84U7KvtLe2vxE91tlpTvaXmkHflHvFXDLIOzUXjgcl6HfBOtq53qM+l4/hZd3uUdmxLtd13YUvMf7Y57tyiOSYvaopbJjdF36Ozq3vPvddOe/30T+dNfRYn2OeHP375x4EHFz6ceHHjp4Meuuijk96KfjWicxXrw/7aHjPdfw/L6nk1p7pL7SH/ykHisFhkPZqTxgXbqZ9k6/uAl9rTuf3eFa1x/8kt8W5im9ZXL22MM19uiLa9GuLCr8fGNm+NTa/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6nas5W3K+4ozBerHXtN8SS8RVtaf6Sw0iD8tF4rGYZF2am8YH4/z7srn+j8bWdDyN77bbN8bM4Q1RN3RsPDZ+TFx+7eiYv8Xo+Puw7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Lf2aL86IxJ3eSswX7b+rHvsvdQf6tB1WFqEflYThKXxSbr0xw1Tlit5wWnNccpHzXG/x7bEAO+yDTPOGpUnH50fcy+tS5OLdfF932yq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOFee3DjencNq7PXTIqJqyoixMvGxkHHVobfz5jRDT9c3hc8+Dw9Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIeuVF+ik96KfvWxc1Zzw3mbMyf5Uy1h/20Pah9mfanHxRx1mdpEfpajxGmxyno1Z40b9n6rR0fN6vp0nC/tro3LLxkeP2lOau+hm8QuRw2LmwvD0qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+8VCNqF525ujczZxx/iKfqq/sRe3H7EmsN7WpOKxGkaflKvFazLJuzV3jR8N3945Mx7fzP2pSrZs/vHHsdsqQuP/GwdFx0OD06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot93Dc7bnTmLk+pn52/OoJzDmEtpfX9bti+zN1GfW3/qNLWKfC1nidtil/VrDhtHWt5fvkn89LSh8VjnkHi7e1Ccf+OAePM3/aN51/7p1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/9kdrAubuzZ3WTM0jx01mU8xhnEvbl5pj9mT2KOl2taj2KTfK23CV+i2HWsblsPGkyzsNXDIgpM/rFR7duFMWj+sSVK3qnV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff2+c/K9i+8e7J/VDM5hnUU6j1Nfi6vOJuzP5Rz519xTr6tZ1W3Wp/wth4njYpn1bE4bV9pOf6lvqnnKjF7x1/e/7/nike96XN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvQ7J/Hdk/woRjiHt5d0HquWcC6nvlJvO6NI92PJXtV+TT5Wt5uT6jc1jPUql4nnYpp1bW4bXxpbz98gfvb/vumZOfernruGrEqv7j3PPpt+aXv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+e0Pfv6kRfQ/juwj1s/xpXyWWOJ9TYzinUXvar9uzisP2LvKzGlYdZ67K59avuC62Wd/ZHO+Vaj/nwJU9y/b9pOfgd5anV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3qIfsj38PZM9o/+07CubyzaXW1PYb86qzKeY2Yow6zd7V/s4cRn+Uq9ZyaRl43h61nMc46N9eNN82Xz/2g54vi39Ore8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96Kft9BOydxbub7ON9JqZvkDufzzqid0zqrVG87s3JuI//av6tJ7OPEJvW8mlbcVtvI73KcOG9uW+/mvHGn/cyVr6ZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ73rx3/9+l8f/9fn/2qv/6q9/q/2/V+17/+r/fyn2s//qv38t9rP/6v9+59q//6v2r//rfbv/6v99x/V/vufav/9V7X//q/af/9Z7b//rfbff1f77/+r/e8/qv3vf6r977+q/e//qv3vP6v973/X/6vuf8+/tqTn5OM+7cnPWtVzz8lrej77ea94/oI+cdIx/eLtsQOj6/bBMXnjofH5npvEwgnDY9SPa2O3hrqY9mR9bLlPsle6f0wsWzs2ri40xutbN8XqYnOM690SD/xfS9x4Ymt8811rLJzcFk/+oy1eGd8el5zVHhOSdb5wUXu89mx2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0e//By5e1bPpsjU9P36hV9z0dZ+Y+mW/+PpPA2PECUPiqw+Gxp+2ron5E0bEhkePjNU718eSb0dF/uoxUT+gIRqOaIwbrm2K7+5pjpvuboklV7dGU5Kjrq1pjwvubo9+4ztii9s7YtWAXLQemIuJV+XisEdzcfhrubjznezq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei3+fhWc1HvWL55htFzZ79Y9qWg+KnK4bEXRcNi5kfJ3vjztpo3CWpobcYFe1rR8eoW7Px7j2tKZb8pTkeWtWSjlfhk7Z0PPPndcTzbUmNel8uem2Wj69m5mPZZ/lYtFUhdplYiP5XFuKiOYX49q7s6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omgh65U30fZZ1DRb074XLybdmz/2OzEQbH4BxvHDZ8Oi1knDY/ef6yN2k/qYuzno+LU58fE+Rc2xIKRTXHzpc3x+Bst8bv+bbF8THsUh3fE9591pMwLJ+Tjka/zcfw5hSgsL8T2uxfjiWuK8eQrxajvXYr/ai/FZtuU4g87ZVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX91oW54fPR5svDN47j2zaJ2x4ZHm91jIxtj62PweeOjt9PHBvnj0vG/PWmWLB/S+w4Lxvv0sBsbsenuXjqoXw6jkf2K8bz0zOtTxyT7GseKsU935Zi7807Y+3BnTH1jM44+tLOWDMtu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrp/Vf8uyBb7+aIz0nbPV4dHjMPHBkX3VUf+745OvZ+e2z8/f7GmHpcNtetRzFr3Asd6fq99w/5dA4bt/w/i3HrqaWYsqwUp+3TGaVbkv+Wdcbilq44dZ+u2PCUrjj80q5ovaYr7r4uu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpregXH8UI68Rc8XnpI64+2n9MnNzUEBsOzta5eCw+i01tx+Xio7Oy8R65czF+uiaZszeW4oTOjH1C/6748j+74sGbu+Kwt7ri5/3LcXBnObb7UTn6HliOk44sx1+Pzq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv65QhxUqywXswZn5u+C7dqSHPOpCFJ3H2kNUbv3B4n3NSRxm3r8hdfFGLl88XonpbN7bMe64x3t8rGddjHXdGwaaaxfUY5Hr27HKWny/HY4nJc/GE5fvRxOc76NLu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3olyflCvFSzLBuzB2fHxtvtbTEsvda0/z846UdaVw+Yf9CnHVAMY1d1qvx+XCzrhg3Jxtn47nHNeW44olyDF5ejvf6dMc3dd0xoqM75pS7Y8kW3XHPVt0xY+vs6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol+tIF/KGeKm2GH9mEM+R7aW/E97GnPEYevv4euL8fLF2fp+a3Vnun4nrumKiw5J5vGt5ci9nWle3Zxp22jH7pi6c3fss0t31CXXbXu6Y17yrGHH7Oq+bt177bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3oVy+pGeRNuUP8FEOsI3PJ58nm30/Jp/l67JPFND6L2+bkBk92xa7bZeNkDk8c2B35Unc8v313bJroqYlE2zbdMb+rO0YnerYc0R1XJG32SnS1bJhd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9KsZ1U1qhzS/j8vivFhiPZlTPle25efvXyzF7XM709i06edd6TqdsbAcY9aW4+hcd5y0QzaOnQl3IeE+uKY7HviqHL3fLMcTjyVrfE45vvlVsuYvK8cNF2dX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/epmtaP6SQ0hj8ol4qmYYl2ZWz5fPmbN70xzlfV4yJRy/Psb5Rg9PFvHxuvNhLcml40rLb+/vRzXn12ONXuU487Gcmz+TVdc+25XHPNCV8x4Kru699x77bTXT3922Htz3Xzihz9++ceBBxc+nHjTOHVTlhfoSeuDRB+d9Fb02zuon9WQ6ii1hHwqp6Rxdf9svZtjPme+DhtWjv7Tsrh9eVO2Xq3f+k2zuZxP2O6bWY6a/crROjDRsihZI+d2xQ+jKy4f0hUXLO2MFX/pjK+fyq7uPfdeO+31058d9thlv25dfOCXfxx4cOHDiRc3fjrooYs+Oumt6Jcf7SHU0WpJ9ZSaQl6VW8RXMcY6M9d83nyKz+L15+ti2eyW7pjwWTZulx+YjfPya7uiZouuVOMdp3XG8PbO+J/3SvH+3aXY+spSvHFJdnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9FvD2kfZS+hnlZTqqvUFvKrHCPOijXWmznnc+f7tsjW53N12Vy3ns3hK2/rivdLXXHinEzzgt+VIrd5UtM+W4xfnVGMD8cXY6dNkrqhT3Z177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRbx9tLylO2lOoq9WW6is1hjwr14i3Yo51Z+75/DGI2/v/uRybnVSOJ79MfB+fjffe5c50fGvfL8asHxZj6fxCbJrs7/Iv5OPpKfmo2zeJqT3Z1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb+zBPtpMcK+Su5QX6sx1VlqDflWzhF3xZ6N1uVt44DljsSvGGb9Hjg9qYVeKMWpfUrpuJ4+Kdnj3pWPn32X7POPzsWHH3bEq5d2xBt7d0TPdtnVvefea6e9fvqndhJ77LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3WgzMF+2p7S/sr8VOdrdZUb6k55F25R/wVg6xDc9F4YLJe10zsTNfzZnOy8X5/YT4ans80z63piNkHt8dNi9pi0r5tce3AZC+/ojW9uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6FcjOlexPuyv7THT/Xey11BvqznVXWoP+VcOEofFIuvRnDQu2I75RSldx3tMKKRz+9WxuZj7XXu89Emm9amRrXHCkS1R92ZznHFJc3SekF3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0O1dztuR8xRmD9WKvab8lloirak/1lxpEHpaLxGMxybo0N40Pxtk/KKRz+I07s/E2vuVnW+Lym5tj0G+aYt6TjXFeR2PMXtQQr9zYkF7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQlZ7NJDrpreh3tig/pmdMSd3krMF+2/qx77L3UH+rQdVhahH5WE4Sl8Um69McNU5Yree7e7fHUee0xvRVzbFmSlOq8YIVY+P4lWPiunFj4thHR8fKq0enV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3OV50xOmeTL523OHOw77b3tJ7sQdTh4q16TE0iL8tN4rMYZZ2aq8YL8+e7t6Zz27g+XtsQ+08dExPqR8e/La+PRRvVR82ZdfHfu9alV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXSl+hKd9Fb0q4+ds5obztucOcmfagn7b3tQ+zDrSz0u5qjL1CbysxwlTotV1qs5a9ywf3NJY/S9dGw6zucsrI/zauti17trY+UNI2LrFdnv313de+69dtrrpz877LHLPj/88ct/WmPtl8VCfDjx4sZPBz100UdnqnfdP/FQjahedubo3M2ccf4in6qv7EXtx+xJrLe0Nk3isBpFnparxGsxy7o1d40fDV/sPDod36YPalOtHbvXxHbfD4u53cNi1NKh6dW9595rp71++rPDHrvs88Mfv/zjSGvs27M9E068uPHTQQ9d9NFJ77/2f5Pb0vN2Z87ipPrZ+ZszKOcw5lJa32+T7ePSvcmibN2r09Qq8rWcJW6LXdavOWwcaXn97Nr4j97DY94jw+IvCzeO07qHxAvlwTH8tUHp1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/9kdrAubuzZ3WTM0jx01mU8xhnEvbl5pj9mT2KOl2taj2KTfK23CV+i2HWsblsPGkyzn2nDolTGwfFu+MGxNgV/eKiqf3Sq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7fOfnexXcP9s9qBuewziKdx6mvxVVnE/bnco78a+6p19Ws6jbrU/6Ww8Rxscx6NqeNK23HTRiYav5540ZxxPm948SPN0yv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+p2T+O5JfhQjnMPbSzqPVUs4l1NfqbedUaT7sWSvar8mH6vbzUn1mxrGepXLxHMxzbo2t40vjbVD+8Qdg3rFlCfX9lzTuabH1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb+9oe/f1Ii+h/FdhPpZ/rSvEkucz6kxnNOoPe3X7VnFYXsX+VkNq44zV+XzdP0mcV1ss77NceNM65Gnf9Pz4qQve+LbL9Kre8+91057/fRnhz122eeHP37TvJNw4MGFDyde3PjpoIcu+uik91/xL6mH7I98D2fPaP/sOwnn8s6m1dX2GPKrsyrnNWKOOsze1f7NHkZ8lqvUc2oaed0ctp7FOOvcXDfeNJ/65Ec9f91taXp177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvR7zto5yTOzXwf5zspdZPc4XzeGbVzWmeV6m1nVs5t5F/7dzWJfZzYpJ5X04rbahv5XY4T581t692cN+60H77J2+nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSe/68V+//tfH//X5v9rrv2qv/6t9/1ft+/9qP/+p9vO/aj//rfbz/2r//qfav/+r9u9/q/37/2r//Ue1//6n2n//Ve2//6v2339W++9/q/3339X++/9q//uPav/7n2r/+69q//u/av/7z2r/+99q/vf/AV6aXkp4nO3bib+d09k38EREJjKPJ9NJzjzuvc/Z4a3gXIbQCBpVtCpEEmpsJF5DZWokMRMxFSmlTT+qDUVqCC8eDfVQKW0kxKNEquoxqyCa0Pf+3nd2/4mdfD4+y73WNfx+91rruq617n06ddr57/azP+g4qMtnHdvGbe84YEnn+N6Tu8aeL3aLl+/vGQefvkfc+EWf+Pv3+8dxNw2MunsGx6LbhsZ9p1fE5wNGxG3LR8bWXUbHUZMq46tzx0QsHhvTzq+KWydXR2W/mujxSE3MOKw26p+tjXyhLvZdUhcfP10Xz31aF3V96iOG1qetZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xL/P3/G+ds7+j8+87xaEXX6DWhe7y/f684qX/vmP9Q35jaNiBaFw+KkfcMiTPvGxbTlg6PyRNHxrJNo+KiYyrj0pVjovtbY+PUr6ui11fVMfnNmrhsZW10mloX72+vi1mL6+OnX9THicc2xJUrGmL9Gw3xTI/G+O+xjTGkKWs96zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544lvi733om/t/usZ3FnSPeT/pFZ8v7B3Pd/SLoX8ZELvsPTgeu2BoXLq0Iu5bMCKuPnRULP5kdDoPZ20cG5NHVkfVgdk8X7d3Nq/L/lgfe81qiNM7N8YZ8xpj6tuNcdS+TdG0qClWPtwUs19vig+3NMXJ27PWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74l/taE92Ls81W94pbVveOgZf2i2z4Do+ujg+OsPsNiwd7D4+J9R8Zrw0bHey9WRs2MsbH7+qpoqKmJPsfUxndOq4vrp9bHaftmnOvuaYzqCU2x7pmmuHav5vjlDc2R+1tz5Me0xEWTW+LPs1riliUt0Xhl1nrWb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8TfvrA2vB8yJ6zsF+vOHhgDug+Jg88ZFitWDY/znhsZg1aPjnd/nMx5VeLv59Vx59c16Xxcf2y2tn89vjEKu2Xz+MfvNMeerzWnnHKrWuKOrq1RMbE1HprfGj+4szXeW9MaL7zUGqe8mrWe9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xFxvsD2vEeyK7asyQ2OWXw+LDbcPjkbpR8VBDZUzqMjbef6AqXXv2o5h1a0VDun9H9s7WsHlbNq4lev9XS/zvnq3xxvLWuP7j5L89c3HgzFy8tjwXZz6Wi/9+KRdXbs7FsH9krWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098S/zFRzHCPrFWvC864mrtMaNi45mVceb3sn0uHovPYtNVDzTE0X9oTOflx1c3x/MTW+La91vipQsyzs8dnYsTfp2LMR/n4pn6fPz16HysuSAfv7w2H2evyMfL9+TjgPuz1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Jf5yhDgpVtgv1oz3RrduUWWac145Lom73Wtj8dV18dKH9Wncti//sV9zTKloiZs2tqRrd3OvXHxzUTavF34jH5fMzThe/Vo+ar/Kx/WDClFfV4iP2gpx7zcKsXl81nrWb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8RfnpQrxEsxw76xdrw/NibMrI6jcrVpfn602JDG5ZfuaIrNv2hOY5f9an6+NT8Xt27JpfNnPn+3OR9f9C/EeXsVYtK3C3HyyYWYP7sQ/ecUYvKPC1GxqBBfLspaz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+KsV5Es5Q9wUO+wfa8h7ZGvyK3VpzBGH7b+qd5tjn3Ut6f6ccHC2f9dPzMeHd+ZjxSf5uKYh4zDthxm3mZcX4r2rC/Hw0kIsTNpfXFmI4VcU4pLLs9bzwh3j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74l/uolNYO8KXeIn2KIfWQteZ9sHvp4Y5qvLx6QxXNx25o8fUA+7r0km29reP2xhVh2fiH2uqwQNyd85l6VcFtSiJEXFmLxWYW47aRCbE1kHjyyEFd8K2s96zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544lvir2ZUN6kd5E85RBwVS+wna8p7ZVt+Pm1Uawz8vDWNTTfvm+3TL3sWYsmhhfjTOYV4+bJsHm+4tBDXJrifOrEQlQcV4qwEe273ZI9vyceMhMNHG/LRbV3WetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3xF/drHZUP6kh5FG5RDwVU+wra8v75aNr5yxX2Y9PPZ+P1dXJvE3N9rH5OijBOfecbF5xGbQ1H7s9k49TfpKPIWfmY/kh+ejUnI8XKpL3NjBrPes3To48PfrssHfQjvXED3/88g8HPHDBBye8aZz6MMsL+OCFH574lvg7O6if1ZDqKLWEfCqnpHH1jmy/W2PeM1/PTMnH7I35NG5/dma2X+3fi+Zma3lZgm3U2/mYd3s+rjw24dInWbPP5eKeq3Lx2XG5eL+Yi+NH5mLaoKz1rN84OfL06LPDHrvsL9wRH/jlHw544IIPTnjhhh8PfPDCD098S/zlR2cIdbRaUj2lppBX5RbxVYyxz6w175tP8Vm8Pu6qLIb1nVmI5/bJ5vuzFdl8Hv1WLuYuyDgO/n1rzJvVGltaW+Owr1ri9tdbYv+XstazfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544YcnviX+zpDOUc4S6mk1pbpKbSG/yjHirFhjv1lz3jvfA67O9ue4k7O1bj9bw9s+z8VhF+Riw5aMU82nLXHN/KQWHtoSX69pjm8taY5fndAcNx2ZtZ71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfF3jnaWFCedKdTVakv1lRpDnpVrxFsxx76z9rx/GMTtx4cX4pZH8pE/IB+vP5jN90MXtqbzuyDXEl2vbY4jOzfHzRc1xbKKpmhb2xgLb01i6lVZ61m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPfEn93Cc7TYoRzldyhvlZjqrPUGvKtnCPuij0zd+Rt8wDL4PuzGGb/Pvk/SS00vDVeO7Ilndc3Hk3OuNsa438mJef8+5Lc3N4Q+62vj/2X18ddl2StZ/3GyZGnRz+1k9hjl31++OOXfzjggQs+OOGFG3488MELPzzxLfG3H9wpOFc7WzpfiZ/qbLWmekvNIe/KPeKvGGQfWovmAyb79ZTVrel+vmVLNt+H92qKS4Y1ptz6J7b73lkXvfrUxSu31kan79bGjMhaz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+KsR3avYH87Xzpjp+Ts5a6i31ZzqLrWH/CsHicNikf1oTZoX2F54Ntvfq+5uStf2fqcnvA+rj/Hj61KuhRk1sf6e6lhYVx2b1lXFDQ9Vpa1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfEv83au5W3K/4o7BfnHWdN4SS8RVtaf6Sw0iD8tF4rGYZF9am+YHxr7LmtI1vP+2bL7N70+G1MRnH1XFue+NjeEDx8b/zh4TffuMif0+qExbz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744JXezSQ88S3xd7coP6Z3TEnd5K7Bedv+ce5y9lB/q0HVYWoR+VhOEpfFJvvTGjVPsNrPw46si7XP1MTWA6rjlLUZ5/c7KmNdjI4uC0fFiz1GxZQ3R6atZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPz/R+csc/96vuGN2zyZfuW9w5OHc7e9pPziDqcPFWPaYmkZflJvFZjLJPrVXzBfNxN9aka9u8NkyvjMf/NCqeO3lkPLjXiGg6anjMfaoiPr2uIm096zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544lvin9bH2+vSteG+zZ2T/KmWcP52BnUOs7/U42KOukxtIj/LUeK0WGW/WrPmDfYZL42Js18anc7zWz1HxDvTKuLe7UNjyntD4vaOIfHvXbPWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHZ3qvvOOfeKhGVC+7c3TvZs24f5FP1VfOos5jziT2m9pUHFajyNNylXgtZtm31q75w+H7S0em83tZYVjKdekNg2LFYQOj/9wBsag4IG096zdOjjw9+uywxy77/PDHL/9wpDV2ggs+OOGFG3488MELPzzxLfH3rcF9uztncVL97P7NHZR7GGspre+XZOey9GyS1Of2nzpNrSJfy1nitthl/1rD5hGXeGZoPDF5cAzvPjC+0at/vD6nb+w1p0/MG9snbT3rN06OPD367LDHLvv88Mcv/3DAAxd8cMILN/x44IMXfnjiW+LvfKQ2cO/u7lnd5A5S/HQX5T7GnYRzuTXmfOaMok5Xq9qPYpO8LXeJ32KYfWwtm0+czPPZf+obr53RO765cPe4uKNXfPinnmnrWb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Sf9+cfHfx7cH5Wc3gHtZdpPs49bW46m7C+VzOkX+tPfW6mlXdZn/K33KYOC6W2c/WtHnF7S9375Fy/usZ3eO5tbvFhm/slrae9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xd0/i25P8KEa4h3eWdB+rlnAvp75Sb7ujSM9jyVnVeU0+Vrdbk+o3NYz9KpeJ52KafW1tm18cFxzfLQZ/b9e4K79LjJveOW096zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544lvi72zo+5sa0XcY3yLUz/Knc5VY4n5OjeGeRu3pvO7MKg47u8jPalh1nLUqn6f7N4nrYpv9bY2bZ1wrLu0UK3ps6xh449YOrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098S/zVQ85HvsM5Mzo/+ybhXt7dtLraGUN+dVflvkbMUYc5uzq/OcOIz3KVek5NI69bw/azGGefW+vmG+eDT/pnx8rNH6StZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3z/U/8Pze553Jv5HueblLpJ7nA/747aPa27SvW2Oyv3NvKv87uaxDlObFLPq2nFbbWN/C7HifPWtv1uzZt33NtWbk5bz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnvjunP+d+39n/N+Z/8u9/iv3+r/cz3/lfv4v9/ufcr//K/f733K//y/37z/l/v2v3L//lvv3/3L//Ue5//6n3H//Ve6//yv333+W++9/y/333+X++/9y//uPcv/7n3L/+69y//u/cv/7z3L/+9+d/8r737RLP+3oOnxbx+u1naNq2a6x99puMeS1nvHw43tE3Xl94/wuA+IPPxgU41ck+fORYTHj18Pj2vNGxsujR8eCOytjY++xUTy2Kl5fWB1jrqmJAxfVxvzj66LzyPp49+n6mPDdhui+viH67pvkyWWN8ec/N8Zv/t0Y3Yc3RWV1U9p61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfE3/+/OKFzbF67a/y0Ntn7k3vF84f3jgNG9YsT1wyI/fcbHH2uGRpfr66Iwx8bEQcuHxWFoytj9vtjYvq0qjj14ep456OamNgz2e/d66PwQX2c/nBDvHlGY6zt3hTfvqYp5nVpjo7pzXHWvc3x4HvN8atBLXFXa0ts3TNrPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4u996JtyUPcYd0WvmPKL3vHyVf3i7kkD48u/Do6/TRgWty0eHqctT2LeFaNj5jFjYsZXY9N5OOLvNVFoqIsu38rm+ZyDs3md/XJSk85rjkl7tMRhl7XE/v9siWKS13df2hpXPdUaR72b5P1OuTi4ey5tPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjgg1fK76DsHZT4WxPei7GXn+gdc57uF9W3Dox3DhkSb/9hWBwxfERMPXhUnDKxMh6rGRt/fK0qdju7Jj7YVBs9C/Xx8UkNMe7cxvi/ZzbFxIkZ5+6PtETXI1vjd+ta45wDc3HxHbno+1Eu+rXkY/rx+bh/Xj7mLMtHr5uy1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Jf72hbXh/ZDpeHhg/G7ukNgyoCJqk3y6+IlRceyGyvj8qYT7lcmcJ2er3e6pi0t7ZvN97vSmdM1ecUhL9O+fzePKqbkY8k4u5dT3iXxc1K8Q275TiJuSc+03VxXi+RcK8dtNhTjk7az1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+Jv9hgf1gj3hPZ61sq4m/3jogXuo2O5e1j4qZxVdHUpyaef7I2XXv2o5g1v7Y53b9fDcvWtHmbvX8+PvpjPp47oBBP3FmIc7cn/x3QFtVz2uKxO9vi8Gfb4q5NbXHWh23xr39mrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098S/zFRzHCPrFWvC864mq3aWPikQuq4vCTs30uHovPYtMPn0xq/L+0pPNy0i25uDs5t52zNR8PLM44/+aktuh4sC122d4Wvyq2x+MntceKxe2x5Lb2OPLe9njokfaoejxrPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4i9HiJNihf1izXhvdLsvrUpzzupT6mLiwIY4+ZbGeOBfTWncti+fOTQX+9Xm40d/z6drd82QtmhYms3r9ye0x6mXZhxnvtMe3XoU49wxxejRXowX9yvGNROKseaQrPWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb4m/PClXiJdihn1j7Xh/bNTOqYvi+IY0Py+P5jQuP3B3a6z5bS6NXfar+clf3hbzO2XzZz6v/7A9XhlVjGMPLEbzCcWYMKsYJ84vxj8vLkbhymJsu7oYry7NWs/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574lvirFeRLOUPcFDvsH2vIe2Sr8FZjGnPEYftv189zMfKNfLo/a7+d7d8Hj26PF1Yl6/ir9pg1LuNw4IUZt8k3FuP5W4px8/JiTEvaRTcVY3vSd+qNWet52o5xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Sf/WSmkHelDvETzHEPrKWvE82m55rSfP1D0Zn8VzctiYnjW6PZddl820NPzi9GLMXFWPIDcW4MOEz5eaE27JifL2kGCf/qBgLzkrmNZG5cUoxzvx+1nrWb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8RfzahuUjuk+T3JIeKoWGI/WVPeK9vy86GNhfiscxabLpyY7dNXBxfjlGOK8dsFxXj4hmwez7u+GOckuFecUYxOk4txRIK979Bkj3dK1njC4cXN7fHO61nrWb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Sf3Wz2lH9pIaQR+US8VRMsa+sLe+Xj7d3z3KV/fjLV9rjlnwyb2dm+9h81SQ4pyzI5hWXz7sU4x9/aY9DftEeW89vj7lHtcebe7XHvbXJe6vMWs/6jZMjT48+O+zV7FhP/PDHL/9wwAMXfHDCm8apf2V5AZ+0Pkj44Ylvib+zg/pZDamOUkvIp3JKGlfvzva7NeY98/Wr09rjqL+3p3F7/QXZfrV/p1+areXZCbZ/f9IeU1a2x1nTEy4VyZrd0BZLb26LDae0xdpoi30b2uKAMVnrWb9xcuTp0WeHPXbZn7YjPvDLPxzwwAUfnPDCDT8e+OCFH574lvjLj84Q6mi1pHpKTSGvyi3iqxhjn1lr3jef4rN4Pf7mLIZ9ksSq33wzm+8N92bzOe7jtphyRcbxi7WFOGFeIdbvXYiWHoVY+G4+xm7Kp61n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfEv8nSGdo5wl1NNqSnWV2kJ+lWPEWbHGfrPmvHe+t9yc7c/Bs7K1aj9bw6/t0h4ti9vioU5tKafd/p2PWZcntXB1Pl5/IRf5Zbm47PRc/GhK1nrWb5wceXr02WGPXfb54Y/fLTveATxwwQcnvHDDjwc+eOGHJ74l/s7RzpLipDOFulptqb5SY8izco14K+bYd9be+B3cxe2f1RVjzh/ao98R7fHE77P5vuniQjq/U8fn4+1bc9G2Ry4uvLo1ZtcmdfzGlph2VxJTb85az/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+LtLcJ4WI5yr5A71tRpTnaXWkG/lHHFX7Jm8I2+bB1i+eCyLYfbvz/9RiFxdIf7flHw6r//1THLW7dYajx6bnPMfa458R3OMfrMpxt7ZFJdfl7We9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888f3P+T/ZD+4UnKudLZ2vxE91tlpTvaXmkHflHvFXDLIPrUXzAZP9esjT2b6e0ymfzmPLkNY4taYl5fbpGU3xyf2N8X5FY6y+qyHenN4QBx2WtZ71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfFXI7pXsT+cr50x0/N3ctZQb6s51V1qD/lXDhKHxSL70Zo0L7Dduz7b39evbk3X9ujzEt7HNsWIQxpTrv3Pro8HHqmLae118eQbtXHemtq09azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvib97NXdL7lfcMdgvzprOW2KJuKr2VH+pQeRhuUg8FpPsS2vT/MD4yU+ztT62W3M6n+b3gqr62LCtNo75oia2j66JZ+dXxycV1THqy6q09azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD17p3UzCE98Sf3eL8mN6x5TUTe4anLftH+cuZw/1txpUHaYWkY/lJHFZbLI/rVHzBKv9/OXxjXHPuvrYeERdHLIx47x2UlWsOmxsvHXlmLhvUPb7V61n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfEv83a+6Y3TPJl+6b3Hn4Nzt7Gk/OYOow8Vb9ZiaRF6Wm8RnMco+tVbNF8zjf16frm3z2nNmVfzs1THxm1mVceOBo2P3E0fFlBdHxrqfjUxbz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744JXyS3jiW+KvPnbPam24b3PnJH+qJZy/nUGdw+wv9biYoy5Tm8jPcpQ4LVbZr9aseYN9wqbqmLxpbDrPTw8eHc/+cGQs6z4i9vuiIhZOqohNfbPWs37j5MjTo88Oe+yyzw9//PKf1lgrs1gIH5zwwg0/HvjghR+e+Jb4i4dqRPWyO0f3btaM+xf5VH3lLOo85kxiv6W16RVZbSNPy1XitZhl31q75g+HfZZXpvN7+r4jUq5n3zE0lnx3SHx6yeCYEYPT1rN+4+TI06PPDnvsss8Pf/zyD0daY3fJ8MEJL9zw44EPXvjhiW+Jv28N7tvdOYuT6mf3b+6g3MNYS2l9vyw7l6Vnk4ps36vT1CrytZwlbotd9q81bB5xGbNueNx+/LDYPmBIVAwZFI9fMiCGXtI/Tmjtn7ae9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xdz5SG7h3d/esbnIHKX66i3If407Cudwacz5zRlGnq1XtR7FJ3pa7xG8xzD62ls0nTub5yFcHxGPn94uGq/rEDyb1jhde3SNtPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4u+bk+8uvj04P6sZ3MO6i3Qfp74WV91NOJ/LOfKvtadeV7Oq2+xP+VsOE8fFMvvZmjavuK1a3Tfl/Pj5veLXG3vEQxN6pK1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfEv83ZP49iQ/ihHu4Z0l3ceqJdzLqa/U2+4o0vNYclZ1XpOP1e3WpPpNDWO/ymXiuZhmX1vb5hfHqaf2jC9mdIvL9+kag2bumrae9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xdzb0/U2N6DuMbxHqZ/nTuUoscT+nxnBPo/Z0XndmFYedXeRnNaw6zlqVz9P9m8R1sc3+tsbNM67brusSq67pFBvu/rpD61m/8VQukadHnx322GWfH/74TfNOggMeuOCDE1644ccDH7zwwxPf/8S/4dl5z3c4Z0bnZ98k3Mu7m1ZXO2PIr+6q3NeIOeowZ1fnN2cY8VmuUs+paeR1a9h+FuPsc2vdfOPc/UdbO374r087tJ71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfH3Ddo9iXsz3+N8k1I3yR3u591Ru6d1V6nedmfl3kb+dX5XkzjHiU3qeTWtuK22kd/lOHHe2rbfrXnzjvuWNe+krWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098d87/zv2/M/7vzP/lXv+Ve/1f7ue/cj//l/v9T7nf/5X7/W+53/+X+/efcv/+V+7ff8v9+3+5//6j3H//U+6//yr33/+V++8/y/33v+X+++9y//1/uf/9R7n//U+5//1Xuf/9X7n//We5//1vOf/7/+UZ4DN4nO3biZtU1ZnHccQFRRrZ963ppmma3rurqktjeOMyiruiohAVFcctYFxGRWOeUdCAxiUhIiIqREwQZtQkIoq7MRohkoBRRnEHjUQloNGMjsa5n3ut/BMFz+Nzvfee877fX51z3vc9p6o7ddrxr+fQz8e9OrFT5LfvHJdP7hI/vaVrTP9FRfSY0yN+GL1j7Qt9Y2jrgJg7fVCcMmtIPHrRsPhrjIimv1bGhvOrouWV6riusiZyh42OGZNq47bDx8TLNXVxwl/q4js3jY3bR9bHlDvr46wuDfEfkxtizMKG6Ly6IU55tyEu3Zpd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfSW9Pv/2h67xN7zu8Tft3WNAwZ3j+oBPWPB+71j5fX9Yv7uA+PMSYPj+FlDY8mPhseCMypjzvCqeP7B6lhVXxNPXjU6YlVtLPrzmDjgxbqYvXJsPH1VfRTzDVH9YkMsm9QYL73QGLc0NMUzlzVFxYNN8fWbTbHT501x1E7N6dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0m/z8OzB7rvGT8+rnusmNYzGk/oE7v06x9HLx0Y+/QYEp8eMSyeOmNEbDluZDw3ojoefW5UOg6/uK825nwyJiYPzMZ5TY9sPFcvbozzDmqKuzY0xZIJzXHro81xXe+WOP3Elth8Q0ssf6AlRq9piTvWZ1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX95oTPxbuma3vG+hv7xA/O7B/jeg2KfX8yJH7x7rBY2aMyHu9dFX23VUfVL2vi5L1r48DlY+K0/6uLg+rr48fjGuIP+cZY3DvTPGVWc5w0uCW63dESaypa4/VzW+PMh1vj7H+0xiM1bdH14LZ4cXJbnH5adnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9JvXZgbPh9t5l3VP7odNCgOe2NI/HD88HhtTmXcu6gqjrhxVFRNTMb889o4+dK6ePPPY9PxeKEhm9ubejbHOa81p+O4y9jWOO/Xmdaz5rTFKxvbYsLw9th2bHssuqI9qhe0R5fl7XHn/dnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Jv9hgfZgjPidtP/zHkNj78uExen1lfPxVVfzt61Ex85XRUf3jbK5bj2LWS9sa0/V73ObmdA4bt9V7tsVB89piZEV79L+gPV54NvmvWy4uPzAXfS/Ixd1zc7HT8lz87qFcHP1YdnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9IvPooR1om54vPSR1w9ub46eu1fE3c3ZetcPBafxaZnr2uKGxZm4/3w1NbYdUTC+HRbVByZad65Phfz/jMXJz6bi05f56JffT6+PCIfr5+Vj3suy8deV+fj8tnZ1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvSb8cIU6KFdaLOeNz0/eUE2vSnNOjpS4WvzE2HpvaEN1+15jGbetyeN/WmLetNdbd15bO3cHvtMeVJ2bj+pu98vHkMZnG536dj1NezMcLH+Rjylf5qN2jEO/vVYjBvbKre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96SfnlSrhAvxQzrxtzx+bFxxYF1cd2u9Wl+/qRrFs8rLm2JwZe1prHLejU+Pzo2Fy+vzsbZeH74UD6at+TjvopCzKwtxO37FGLlwYU45OhCzDm+EBNOLETrpOzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLekX60gX8oZ4qbYYf2YQz5Htubc25DGHHHY+pv8ZGv8xz1t6fr84ZBs/VaMyEfND5N5/Fw+nv86n2pYcECmbemUQlSfUYjtyX+rphZi42mJ7lML8cSU7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6RfvaRmkDflDvFTDLGOzCWfJ5tX/aw5zdePb2lN47O4bU7etSUXW07Kxskc7t5YiNWHF+K8UwqxPtGy4vRE2+RCHHdUIR7dvxAvF5JxTdpsHV2IZ0ZlV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Jf1qRnWT2iHN7xOzOC+WWE/mlM+Vbfl58d/b4vA/tKexaX3vbJ22vp2Px0cUosshhdhrSjaOa08uxJqE+8tcIU4YVIi7E/Yz38nHH1bnY2Giofa/8zHunuzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLekX92sdlQ/qSHkUblEPBVTrCtzy+fLx74b2tNclcbzn+dj+xf5eCyfrWPjdUUyXg+Mz8aVliPW5uPbt+fjzmn5OGq/fLw4NB/FzvnYfXsuWj7IpVf3nnuvnfb66c8Oe1d8M5/44Y9f/nHgwYUPJ17c+OmgJ60PEn100lvSb++gflZDqqPUEvKpnCKuii3Wlznmc+br67Z8LLsvi+MN+2fr1fp95JhsLq9O2I5/NB8rLs7HMw35OPzdZI0sysV7p+eioSUX1Xvm4uZP2mPBB+3p1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvSb/8aA+hjlZLqqfUFPKq3CK+ijHWmbnm8+ZTfBav556exbDxBxaic+9COm6Nl2fjef2qXDxwXKb1iPntseKg9mjYtT1mvZjUhA+0xWXLsqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3pJ+e0j7KHsJ9bSaUl2ltpBf5RhxVqyx3sw5nzvfh03N1ue0fbK5bj2bw20v5OLqI3LRfU2m6eTn2+L3xyY17dbWyC9ojdmTW+Ot9tb40+js6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pN8+2l5SnLSnUFerLdVXagx5Vq4Rb8Uc687c8/ljELf/sT3xfVM+zh6Qj/7XZ+P9t6Pa0/FduWsSM85qjWs3tMT6E1ri+W3JPuGu5lh1YXPcfnp2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0u8swX5ajLCvkjvU12pMdZZaQ76Vc8RdsWfpN3nbOGA5YnYW06zfz3+V1ELb26JPbVs6rgN+2hI165uj98jm6DS7KWbv0RSXLG+MGec3xtsnZVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX91oMzBftqe0v7K/FTna3WVG+pOeRduUf8FYOsQ3PReGCyXu+8sT1dz+tXZ+N99dvN8eTfMs2HJLbHX9EQ+7+b1CUX1UdHY30s7Jdd3XvuvXba66d/Om8Se+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX9akTnKtaH/bU9ZrqPS/Ya6m01p7pL7SH/ykHisFhkPZqTxgXb7ova0nX8wcyWdG5fEk1x6MjGuKhnQ6r1nL3HRsXVdfHwV2Ni4LIxsfb67Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6TfuZqzJecrzhisF3tN+y2xRFxVe6q/1CDysFwkHotJ1qW5aXwwHnxmSzqHZ6zLxtv4/vGjumh8dkz891O1cexfR0fl+NEx/t2auPi3NenVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjxp/vGRA9d9NFJb0m/s0X50RmTuslZg/229WPfZe+h/laDqsPUIvKxnCQui03WpzlqnLBaz0ePbohd7xgbzQPr4s67alONo/rVxJ79R8W3JlbH7m9Vxc0rq9Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96Sfuerzhids8mXzlucOdh323taT/Yg6nDxVj2mJpGX5SbxWYyyTs1V44V57vfGpnPbuJ5arInPllRH529VxdaKkTF1TGWsWDAixp4zIr2699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+OuihK9WX6KS3pD+tj1/M5r7zNmdO8qdawv7bHtQ+zPpSj4s56jK1ifwsR4nTYpX1as4aN+wLl42OpctGpeM89O3KqCyOiPfXD4t5Tw2N/+k7NDo2Dkmv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnpL+sVDNaJ62ZmjczdzxvmLfKq+she1H7Mnsd7UpuKwGkWelqvEazHLujV3jR8NPzujKh3fp7oMT7U+d+7geH3koDj0mIHxSNeB6dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0m/7xqctztzFifVz87fnEE5hzGX0vp+craPszdRn1t/6jS1inwtZ4nbYpf1aw4bR1ouvX1Y/G/NkDj2jYFxwdv9o98x/eL7R/eNB/+3T3p177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvSb3+kNnDu7uxZ3eQMUvx0FuU8xpmEfbk5Zn9mj6JOV6taj2KTvC13id9imHVsLhtPmozz0iX9ou9+feLKib3i8b49Y/TdPdKre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96Sft85+d7Fdw/2z2oG57DOIp3Hqa/FVWcT9udyjvxr7qnX1azqNutT/pbDxHGxzHo2p40rbV1n9U41992ve3Re0i269+iWXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvQ7J/Hdk/woRjiHt5d0HquWcC6nvlJvO6MQb+1V7dfkY3W7Oal+U8NYr3KZeC6mWdfmtvGl8aHWijiyqWu8s9vuMa3YJb269zz7bPqk7fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056S/rtDX3/pkb0PYzvItTP8qd9lVjifE6N4ZxG7Wm/bs8qDtu7yM9qWHWcuSqfW7/iuthmfWdzvHuqdcLJu0XXyTvHfpWd06t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3pJ+9ZD9ke/h7Bntn30n4Vze2bS62h5DfnVW5bxGzFGH2bvav9nDiM9ylXpOTSOvm8PWsxhnnZvrxpvmlRX/HDf0xs/Hubr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLen3HbRzEudmvo/znZS6Se5wPu+M2jmts0r1tjMr5zbyr/27msQ+TmxSz6tpxW21jfwux4nz5rb1bs4bd9rvOmFr+hm499x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466d0x/jvW/474vyP/l3v9V+71f7nv/8p9/1/u5z/lfv5X7ue/5X7+X+7f/5T793/l/v1vuX//X+6//yj33/+U+++/yv33f+X++89y//1vuf/+u9x//1/uf/9R7n//U+5//1Xuf/9X7n//We5//7vjX3n/u7fxn+Pueatz7HLZbjF+8x4xZURF7NvUI97o2TsOf75v3H78gPhw1aA4NckhjRXD49qvRsRDz4+Mry6ojru/GBVfnzo6Ji2rjV1eGhMHbaqLs18eG0vuq4/R32+IHgMb49zljdFY2xSFm5rigM1N8Y/q5lh3THM0Tm+Ogy7Jru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056S/r9/2fzd4vdK7vG0zMqoteSHvHxot5x1vn94up+ydr/yeDIbRoa1RUj4sIeI+PsrVUxcemomD8u2SOtqI0b96yL7vuPjfNOqo9e322IidEYN+3ZFF2eaIpPJjfHpZuSOHZ8S/z7gy0xd+fWeO3brbH2rNb445WtMeza7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Tf5+HZzFsqYvIbPWLWZ73jq7f6xYt3DIzhLUNij1uHxTMbRsSNW0fGQ29Ux8331MS1R2XjfVHH2Jj4g/qo+3lDOl4Lbm1Kx3N+XUt8+08tcf6U1rjgtSSnHdgWkxa2Res7bfGb/u0xY9/2+HRCe3xvcnZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvSb074XLz7qlefWDygfxyybWB0vy2pGwYNj4umV8Y1t1bF9QtHxaZLR8fHTWOi/rd10bu9PppnNUS/FY0x+fdNseCJ5vj+wkxzY0VbjF3SFq/WtMet89rjv/7eHvn9clFI6tk59+Xif/6Ui8Wbs/MPV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Jf3Whbnh89HmjD0Hxat/HBKDzhwehyf14/Je1XHFmJoYMqA2tr+ZjPlVY6N+p4a496RsvG97sDmds79a0BodZ2Tju/437bHvPpmmfK98LJ2aj8ql+Xj89XxM360QH48sxEtthZhWzK7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oekv6xQbrwxzxOWm76j+Hxx67jIxPJ1XHU9fUxOOza+Po0+rikz7ZXLcexawlM1rS9Vs1rS2dw8Zt/s+SOn54PrbdnI/3vsjHbUcW4rabk/3t2kJs+qIQFw7piD+2dcTc73TEiH/Lru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056S/rFRzHCOjFXfF76iKsNK2rirTW1ceFDdel6E4/FZ7HpZ31a47ujsvH+0UfJXnxpLm49NB8bN2Sa1z1QiDP26IjaIzti7Y86YvMDHbF6Q0cs394Rl+xcjDcqijG+Z3Z177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvSL0eIk2KF9WLO+Nz0bXynNs05bz5cH+ed2RjXfdQUGw9vSeO2dbn19vaYOiMXd3Zkc3vLOYU48p1COq5Xzu+IGzZ2pBpv3qcYDd8txm0XFaPpmmJ89pNirJxfjC0Lsqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3pJ+eVKuEC/FDOvG3PH5sXHY2vqYdENjmp+fntuSxuWNndpjS+csdlmvxuf41wtJzZ6Nn/F85DvF+Of5xbhiXjGO+VUxvvdMMa5eV4wBrxZj4pvFqHynGJ02ZVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX9agX5Us4QN8UO68cc8jmyNbGQxThx2PqrG5+L/Vuz9X3Y3YV0/b62tCM+3S2Zx0cV45bZmYazX8i0XbylGB9/VIwnthZjdnJd9kExRv41Gd8t2dX97G/ea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Jv3pJzSBvyh3ipxhiHZlLPk82jx7alubr6y/IpfFZ3DYnz7+gI1a+15GOkzn82oPFmP9yMfZ9vxiLEj0zP0y0bS5G9SvFuO4Pxbj7yWRckzaP3l+Mn96bXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvSrGdVNagf5Uw4RR8US68mc8rmyLT9//4p8DD4ui22LFmbru9M5xfjxPcV4aX0Sz97PxnHhX4pxa8K95vFijL6rGBcl7PlzkzU+oRjnJho+yxWje2t2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0q9uVjuqn9QQ8qhcIp6KKdaVueXz5aPblCyHWY9rxhbjyZnJuD2RrWPjdWjCOXN9Nq60DJlYjIqaYkz7rCOGremIn/+iI7pc1xEvz+iIThdlV/eee6+d9vrpzw57h34zn/jhj1/+ceDBhQ8n3jROJfx00EMXfXTSW9Jv76B+VkOqo9QS8qmcksbVTtl6N8d8znytfbQjZnRkcfvLNdl6tX7nbMzm8vyEbdSBxZj1dZLfH+yIIdOTNTKmI1Z8WIgvHy7EJ3MLcfoPCnH2RdnVvefea6e9fvqzwx677M/+Jj7wyz8OPLjw4cSLGz8d9NBFH530lvTLj/YQ6mi1pHpKTSGvyi3iqxhjnZlrPm8+xWfx+tQPsxjWf20x1t2WjduXSbw2npP374iZb2Qah1YWYtaf8vF/1+djwnfz8ct983FwW3Z177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvSbw9pH2UvoZ5WU6qr1Bbyqxwjzoo11ps553Pne9BH2fr81jPZXLWezeHOx3fEhA2FeH1Cprn+mHzc8npSC1+Si12rcnH85va477Hs/NPVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Jv320vaQ4aU+hrlZbqq/UGPKsXCPeijnWnbnn88cgbv/usmIsHliMwuKOeLdvRzp+j7+Sje81N+Si2/b2OGFKeyx6uy3mz2iLYn1bzP6yNb73YWt6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0u8swX5ajLCvkjvU12pMdZZaQ76Vc8Rdsefib/K2ccAyNPErhlm/v987qYUuy8em+7Nxfm9Qssed1BbvLEv2+T1aY+JPW+LA9pY4+IvmuP+95vTq3nPvtdNeP/1TO4k9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pef+3/k/XgTCHdvyd7S/sr8VOdrdZUb6k55F25R/wVg6xDc9F4YLJepw0opOt58YRcOo7HntMWN1yaaR6Y2O6/W3P0mt4Ub37ZGF1WNsa5d2ZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70l/WpE5yrWh/21PWa6/z40q+fVnOoutYf8KweJw2KR9WhOGhdsL9fm03W8qlt7OrcPfD7Rvbw59lvQlGrt+G1DvFbRELOvqY+/tGa/f3N177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDV3p+kOikt6TfuZqzJecrzhisF3tN+y2xRFxVe6q/1CDysFwkHotJ1qW5aXww9t+WzfWDJ7Wk42l877i4Ib48oj5+cMjYGHlhXWxbNyb6Tx8TBxyWXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NCVns0kOukt6Xe2KD+mZ0xJ3eSswX7b+rHvsvdQf6tB1WFqEflYThKXxSbr0xw1Tlit5xH3N8Wfaxrj68X1Ma1+bKrxkztq49U7R0fXt2piw1k1MTWyq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pekn7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOF+dRPG9K5bVybn66N3zWMjnXPjIrH5lVH66+rYmZVVXzx8cj06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pD+tjydnc995mzMn+VMtYf9tD2ofZn2px8UcdZnaRH6Wo8Rpscp6NWeNG/Zz2+rikrbadJw/OLs6/vbUyFg5uTKmHjIifnnH8Nht6vD06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pF88VCOql505OnczZ5y/yKfqK3tR+zF7EutNbSoOq1HkablKvBazrFtz1/jRcNrWUen43nRTZap13t+HxvLlQ2LgxsFx7dzB6dW9595rp71++rPDHrvs88Mfv/zjSGvsiRkfTry48dNBD1300Unvv/Z/tU3pebszZ3FS/ez8zRmUcxhzKa3vN2f7snRvMj1b9+o0tYp8LWeJ22KX9WsOG0daDqqpjGfvGxYjzxwScc6gePfVAfHtV/vHrCv7p1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX99kdqA+fuzp7VTc4gxU9nUc5jnEnYl5tj9mf2KOp0tar1KDbJ23KX+C2GWcfmsvGkyThf0jAwNq3uF0e+1Seuv6N3fNrQO72699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3p952T711892D/rGZwDuss0nmc+lpcdTZhfy7nyL/mnnpdzapusz7lbzlMHBfLrGdz2rjS9kq3fqnmzat7xLr6veL1+d3Tq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pekn7nJL57kh/FCOfw9pLOY9USzuXUV+ptZxTpfizZq9qvycfqdnNS/aaGsV7lMvFcTLOuzW3jS+M1j+wVQx/qFvff2DX2eXqP9Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Tf3tD3b2pE38P4LkL9LH/aV4klzufUGM5p1J726/as4rC9i/yshlXHmavyebp+k7gutlnf5rhxprXyL7vHK5t2jZ7Ldkmv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnr/Ff+mZ/s938PZM9o/+07CubyzaXW1PYb86qzKeY2Yow6zd7V/s4cRn+Uq9ZyaRl43h61nMc46N9eNN83LbtwpVi365zhX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ73/qv8vyc55nJv5Ps53UuomucP5vDNq57TOKtXbzqyc28i/9u9qEvs4sUk9r6YVt9U28rscJ86b29a7OW/caY9zPhnn6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KR3x/jvWP874v+O/F/u9V+51//lvv8r9/1/uZ//lPv5X7mf/5b7+X+5f/9T7t//lfv3v+X+/X+5//6j3H//U+6//yr33/+V++8/y/33v+X+++9y//1/uf/9R7n//U+5//1Xuf/9X7n//We5//1vOf/7f1Lr8fB4nO3b959W1bUGcBFFxIbSO8MwMMwwvb11XKLGEvXacoMNo0ZNuGpULBETNQYbQYMmNoSoYII9ykdiIVFJUYmxhEhsgCgBa65oFLg3oPf9nuN7/4kXftmcc/Zaz/Ocvfdaa+/zznbbbfs3d0qP+O/xO8bBS3vHdfW7xi9P3yMuv2CvqD5mQNzQd3C8M29otGw/In7VPSqmHV0VL+9XHVv71sSkJ8bFh/vUxn73TIjbP6mLg4ZPjGvrGuLXIxrjg42NccajTfGNbzXHQ582x3nfa4kfvNoS19S3RuGM1hg4pzWmLW6NWU+mrWv3PddPf3bs+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056y/r9P7+mdxz2nV2j99I9YvKHe0XmvQHx4GOD4/kThsX9r42I6XWjY+rRY+Kxb46NBzvGxbyPx8eqKyfEi1vq4pUjJ8bRMxvikbsaY/KCpph7VXOsOLIlDunVGpkFrfG7urZ4b15b3Le1LV47uD2qrmyPfg+1R/9l7XHKX9PWtfue66c/O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ71l/d6He8+t3iPuqOkXy4oDY1LtkBi8flic+v2Rcdia0bHzqOp4paMmttaMjzc21MbLN6fj/cSlDTH3D43xvfebkvF6a01LMp6rz2mLHw9qj98sbI9Hqzvi/lkdcfvajrhwQmdsntIZT87ojNxtnfHw/LR17b7n+unPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9ZvznhvXg26diBsf7EITG7a3gc9c7IOOKkqnhicXU8v6Ymlq8dH7VPT4iuC+vjnD4NMfnixrjg+aY4bktz3LFHa6zp1RaL17YlnM87uiPO/rAjRp/VGW+t6oxP8l1x8TVd8cNnu+KljV0xYnAm3q3PxAWtaevafc/1058de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3rJ+68Lc8H70uffI4TF60Kg48cGquGHI2NhwzLj4/dm1cdKJddE5fmI8vqwhzjmwKf51Vzrea7a2JnN249vtccn9Hck4Dv53Z/z48lTrxcdk4p/3ZeK0jzPRsyYbjxyaja6p2Rh2cTYWXZa2rt33XD/92bHnhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt6xcbrA9zxHvSd7vnquKwr4+N3Pxx0evF2uj5cl3cfM/EyByfznXrUcx6/+m2ZP1+95GOZA4bt1VvdsVxp2WiY1Um6idl4+2bsrFmZTZ+OiAXEybl4rFTctH/4ly8fnUuTr02bV2777l++rNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9YvPooR1om54n2xEVfP3VIbNf3q4/EvJybrTTwWn8Wm149rj/lnpOP9l/auGLKhK1bfkImqUSn3gVuyce/huTjzplz0e6mkbUsu+o7KxyeZfPzu4HxUfyMf101OW9fue66f/uzY88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530lvXLEeKkWGG9mDPeG9tpE+qTnDO2R1MsfrA5Xm5vjdE3tiVx27psW9cZ9zzdFesuTed246Js3DghHddn38rFK2NSjW9cno9zF+RjzZJ8nPdCPvKv52PLW/lofCdtXbvvuX76s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1i9PyhXipZhh3Zg73h8f1w9oittXNCf5eac325K4PPrAzmg8uCuJXdar8bltbC7en5OOs/Hc7pp87Pt4Pn6/Kh83b87Hw7sU4s+DCzGlqhBzxxXi9AmF2L8ubV2777l++rNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9avVpAv5QxxU+ywfswh75GveZekMU4ctv6+N7srrrkoXd83fJRN1m/VhlzkDsvHhpvzsfKlVPOD/VNtS5oLkekoxA6dhXixvRAft5Z0txTib81p69p9z/XTnx17fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pesn71kppB3pQ7xE8xxDoyl7xPPm/6dkeSr5c/3pXEZ3HbnHz08VxsaUjHyRyu+iIfq0cU4sdNhVhX0vJcW0lbfSG+O7oQL/crxAc7FWK/Up/tS7pe+zxtXbvvuX76s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1q9mVDepHeRPOUQcFUusJ3PKe+Vbfl78x0x8a24a29avzSXrdP+H87F8Qz6GDi1EdXM6ju80prz79irEGR/k4/ES94sXldb4nHw8dHU+Cj/Mx1EXpa1r9z3XT3927Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oesv61c1qR/WTGkIelUvEUzHFujK3vF8YRyzMprlKPJ+Wjx2fz8dfe6Xr2HjNLo3Xc0MKybjSctIv8nHkmflYVMzHKXvl491/5uKQ5aVxW5qL/ZekrWv3PddPf3bs+eFv9lfzCQ48uPDxwAcv/PDEN4lTN6Z5gR666KOT3rJ+ewf1sxpSHaWWkE/llCSuHpiud3PMe4bVb4d8PHlpGrf36ZeuV+v3xTHp3F7953xMnZWPZV8rzfGtuThpcWmNnJ2L/23LxT49cpF5Mxt3/yEbDy5JW9fue66f/uzY88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530lvXLj/YQ6mi1pHpKTSGvyi3iqxhjnZlr3jdM8Vm8XtiWxrDjBxRi4Np03Pb5ejrOd87MxXM1uUTjyd/JxrJB2YgVmbhlQSY+mpGJa6enrWv3PddPf3bs+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056y/rtIe2j7CXU02pKdZXaQn6VY8RZscZ6M+e8d9gntqfr80elnGWuWs/m8AHzcnHLyFyMuS3VfO6tmVg5tlTTPtkVB0/tirn1XfHZDl3xj02dSevafc/1058de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3rJ++2h7SXHSnkJdrbZUX6kx5Fm5RrwVc6w7c8/7x0Hc7vP7Eva38vGD93JRd0I63j2rssn4Pr+iK47IdMW8hZ2xrrYzVj3dEZdM64gX9y3F1La0de2+5/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb+zBPtpMcK+Su5QX6sx1VlqDflWzhF3xZ4lX+Vt44DLySVcMcz63e3yUi20NBO1m9NxnXhyaY87vyPGf1ra509uj7mvt8VPLm6La/dpi88b0ta1+57rpz879vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX91oMzBftqe0v7K/FTna3WVG+pOeRduUf8FYOsQ3PReOBkvS46MZus5/Vz0vG+9eGOeOWpVPOUku/jD22Nby5uibH7tcQhXzTHQ+ubk9a1+57rpz879vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX9akTnKtaH/bU9pn2WvYZ6W82p7lJ7yL9ykDgsFlmP5qRxwW3Y2ZlkHX95VGcyt2f2bY8pn7bGVW+3JFov6dMcVd9oihdeaIyJ0xvj7RPS1rX7nuunPzv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Zf3O1ZwtOV9xxmC92Gvab4kl4qraU/2lBpGH5SLxWEyyLs1N44Pj8V2dyRy+9s50vI3v2t81xaSbGmPp9Q1x+hMTo2PIxDh+cX3M/Fl90rp233P99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6zf2aL86IxJ3eSswX7b+rHvsvdQf6vF1GFqEflYThKXxSbr0xw1Trhaz6duaokhZzXHfu83xqJpDYnGzPq6GPXuhPiP8RNi+EO1cc9VtUnr2n3P9dOfHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96yfuerzhids8mXzlucOdh323taT/Yg6nDxVj2mJpGX5SbxWYyyTs1V44XzwkJzMreN6/k710ef8yfEwF1rY/vV4+LC/6mJ56bWxN65tHXtvuf66c+OPT/88cs/HHhw4eOBD1744Ykv3vjTQQ9dib6STnrL+pP6eEE69523OXOSP9US9t/2oPZh1pd3K+aoy9Qm8rMcJU6LVdarOWvccH9o+sT47fS6ZJybHx4X7TvXxJb51XHv9WPio3VV8fX7qpLWtfue66c/O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ71l/eKhGlG97MzRuZs54/xFPlVf2Yvaj9mTWG9qU3FYjSJPy1XitZhl3Zq7xo+GhR21yfiueLU60fpmfnRs+HRkTBkzMl56Y0TSunbfc/30Z8eeH/745R8OPLjw8Uhq7F+keyY88cUbfzrooYs+Oukt6/etwXm7M2dxUv3s/M0ZlHMYcymp7+vTfVyyN1mcrnt1mlpFvpazxG2xy/o1h40jLbPOrI5dNo2O0x8cGVc+PDzqxgyLGVVDY9lzQ5LWtfue66c/O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ71l/fZHagPn7s6e1U3JWWUpfjqLch7jTMK+3ByzP7NHUaerVa1HsUnelrvEbzHMOjaXjSdNxvm35w2LCXsNiZ+PHxTL1w2I3PkDkta1+57rpz879vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX9vjn57uLbg/2zmsE5rLNI53Hqa3HV2YT9uZwj/5p76nU1q7rN+pS/5TBxXCyzns1p40rbyKMHJ5on7NUvBp63Z4xZ0zdpXbvvuX76s2PPD3/88g8HHlz4eOCDF3544os3/smZ6qS0FqKPTnrL+p2T+PYkP4oRzuHtJZ3HqiWcy6mv1NvOKJL9WGmvar8mH6vbzUn1mxrGepXLxHMxzbo2t40vjX/Zfq84+cvdY+Pfd40f7bxr0rp2P303Q5L+7Njzwx+//MOBBxc+HvjghR+e+OKNPx300EUfnfSW9dsb+v6mRvQdxrcI9bP8aV8lljifU2M4p1F72q/bs4rD9i7ysxpWHWeuyufWr7gutlnf6Rzvl2g9vXGXGFnfO/7zk15J69p9z/XTnx17fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pesn71kP2R73D2jPbPvkk4l3c2ra62x5BfnVU5rxFz1GH2rvZv9jDis1ylnlPTyOvmsPUsxlnn5rrxpvnjv/eM+Tf3SFrX7nuun/7s2PPDH7/8w4EHFz4e+OCFH5744o0/HfTQRR+d9Jb1+wbtnMS5me9xvkmpm+QO5/POqJ3TOqtUbzuzcm4j/9q/q0ns48Qm9byaVtxW28jvcpw4b25b7+a8caf9+c2b9ta6dt9z/fRnx54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropHfb+G9b/9vi/7b8X+n1X6XX/5W+/6v0/X+ln/9U+vlfpZ//Vvr5f6V//6n073+V/v230r//V/rvPyr99z+V/vuvSv/9X6X//rPSf/9b6b//rvTf/1f6339U+t//VPrff1X63/9V+t9/Vvrf/277V9n/Jn+7Z9zbsFP0erZPHNyye5x05p7R/YP+8daUQXHYwKHxiwXD4587jYqT96uKpmOrY9bBNfH4wPHxxVO1sfCAutju1/Vx3KaJseOY0t66uSn+q7o5flWKTbW/a4k9T2uNMza3RvP5pbm8qi32b2mPzee0x/Lb26NpSXsc+Me0de2+5/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb//b1rXJ/qctXv88Zk9o/8n/eOzfw6KqU8OjatOGRHfWT0quprHxLhjx8Z5J4yLqfnaOObzCXHrrPqYuX1DzJ7cGH1nN8XZ9zZH/3taYvK1rXH95LbovWt7fHZ3e1zU3BF3LeiI03t2xs8P74xVP+mMlxZ3xssvdsaoV9PWtfue66c/O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ71l/d6HezP+sWccXz8grth3cHzRMCxe+XBEVF0yOnZZPyb+NLYmZufHx+P1E+KmjXUxa1463hdcUco/y5qj/uOWZLxuW9+WjOecCzti7xGdce4DnaUatCu+c0OpJnq/VK82ZeKRb2di+sxMbLwjE2fenbau3fdcP/3ZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3rNye8F8++OHFwzD91WBxSHBl7vDc6dju9Oi5YUhNXrR8f170/If7xp/r41w8aoqFvU/T/UXO0/rUlBm3fFscPaI+5u3bEOe93JJybj+2KiZ90xcppmbhtbSYe2KdU4/w0G9kXsvGTUj37+ohcLGjJRWsmbV2777l++rNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9ZvXZgb3o8+p00eGSuHV8WwR0o5dNS4uP/E2rjkgroYcerE+HRiY5z/UlM0HNYSv743He+5PdO5vejdUi5f1JWM4yvbZWPvq1OtXSfm4p6HczHm81w8VZePs4/Kx2ffy8erl+XjrCvT1rX7nuunPzv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Zf1ig/VhjnhP+v72heroc8S42LiwNn7/t7p4asXEOOrXjfHZSelctx7FrF8+05Gs35onupI5bNxufTsbg87IxSfv5OLdA/Ixb24+5pb2eV8fVoh1BxTivO8W4uXLCnHjdYWo+lnaunbfc/30Z8eeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3rF98FCOsE3PF+2IjrjZuXx9vD26I83dM17l4LD6LTTee1BlTzk3H++pcNlZ8no05t+Ri1diU+/IehTjtPwsxYW4hXnqlpK1HMf4ythgPdBfjosOL8daxxTh4Stq6dt9z/fRnx54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropLesX44QJ8UK68Wc8d7YNjU1JDlnTa+WOOeR1piVa4+VczqSuG1dfvxBJk59Jht3XpHO7Q8ezccRTem4/nhdIWbXphpvuroYjfcUY+7SYjT/rRibVhfjsXXF+ODdtHXtvuf66c+OPT/88cs/HHhw4eOBD1744Ykv3vjTQQ9d9NFJb1m/PClXiJdihnVj7nh/fBw6rCWOe7M1yc9/WNORxOWVh2big//IJrHLejU+36wrxC/vSMfZeP72umJ8+WQxLllbjKO+KMaZe3bHlSO7Y+j47pg8sTuqm7qjR3Paunbfc/30Z8eeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3rF+tIF/KGeKm2GH9mEPeI1/HzGhPYo44bP3Vl/bm+1+aru/DPs0n63fV54XYeFQx7p9XjFtWpJqnDk21XdjZHZ/luuPpfHfMLLX3ZUq6u7rjp51p63rmV8/1058de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3rJ+9ZKaQd6UO8RPMcQ6Mpe8Tz6PnNqV5Ovrnsom8VncNienPVWIx9rScTKHV/XsjjnV3bF3R3fcWdIzI1vS1tIdNeO6Y9aQ7vjVbt2x3Q7d8eTWYvz838Wkde2+5/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvWb+aUd2kdpA/5RBxVCyxnswp75Vv+fmcP+di+Px8Epvmv19I1mmPR4tx3cZi/H1Ud7zVkY7jL9q747YS77/s0h21G4pxfol712OlNX5HMc4oadh8eTH2uDRtXbvvuX76s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1q9uVjuqn9QQ8qhcIp6KKdaVueX9wtjtgXyaq8Tz7xdj6cvFuHbXdB0br0NKPGeMSseXlhF3FWP3acU4a99ijBpcjAX/KkTv10rj9kwheixNW9fue66f/uzY88PfIV/NJzjw4MLHAx+88MMT3yROzUnzAj100UcnvWX99g7qZzWkOkotIZ/KKUlcPTRd7+aY9wzrpZ2LMf2KNG5vHZyuV+t3Zm06t+eUuI27oRhXHFKa4z1LWpaU1sgFhfhNthBbexXiszX5+PayfExdmrau3fdcP/3ZseeHP375n/lVfIALHw988MIPT3zxxp8Oeuiij056y/rlR3sIdbRaUj2lppBX5RbxVYyxzsw17xum+Cxen5JNY9jgYd2x/L103LYeno7zCbMLMaO+kGgceVY+rhiRjy1v5OLoe3Jx98xcHHRZ2rp233P99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6zfHtI+yl5CPa2mVFepLeRXOUacFWusN3POe4c9LJeuz2IpZ5mr1rM53HNBIY4eW4jVd6SaG2/PxS11pZr2j9nodXY2Jrdk46E+2bhjayZpXbvvuX76s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNL7/wcApX20vaQ4aU+hrlZbqq/UGPKsXCPeijnWnbnn/eMgbj/zbAn7tGJk/rsQ609Ox/upcflkfK96Mxu7dWfjmAcycWdjJm59pityF3XFzINKMTWbtq7d91w//dmx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLct3lmA/LUbYV8kd6ms1pjpLrSHfyjnirthz4Vd52zjgMrKEK4ZZv8uuKtVCz+biH1vTcX3v9NIed2FXrN1U2uef0BmT3+qIA37UEQcdkP7+Revafc/1058de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3rJ+68GZgn21vaX9lfipzlZrqrfUHPKu3CP+ikHWobloPHCyXs86NZ+s5/l3pOP9jUe7YvafUs1DS74HH9Ue/Za0xZqD2qL3DqW9/EetSevafc/1058de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3rJ+NaJzFevD/toe0z7LXkO9reZUd6k95F85SBwWi6xHc9K44Pbq+blkHS85JpPM7a8N7Iyhm9tj33dTrbm+rbHq2Ja45m/N8d6lzTHvlLR17b7n+unPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Zv3M1Z0vOV5wxWC/2mvZbYom4qvZUf6lB5GG5SDwWk6xLc9P44Di4mEnm8EEL0/E2vrf/oSW+uK05fnhzU1Q/3RifjGyMwUsa4mu3NiSta/c9109/duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnrL+p0tyo/OmNRNzhrst60f+y57D/W3GlQdphaRj+UkcVlssj7NUeOEq/VctbUtVkwr4XzcHGdd1JRo/OzDifHmR/WxS0N9vLa4Lk69ti5pXbvvuX76s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb1u981Rmjczb50nmLMwf7bntP68keRB0u3qrH1CTystwkPotR1qm5arxwPmVSazK3jWvLHg3xzPT6WL5nXTy5tjbavhwfM84eH//eO21du++5fvqzY88Pf/zyDwceXPh44IMXfnjiizf+dNBDV6KvpJPesv6kPr47nfvO25w5yZ9qCftve1D7MOtLPS7mqMvUJvKzHCVOi1XWqzlr3HA/47LG+P5lE5Nx/ug3tbFh9/Hx2N01cdrNY+PuD6tjp4erk9a1+57rpz879vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvWX94qEaUb3szNG5mznj/EU+VV/Zi9qP2ZNYb2pTcViNIk/LVeK1mGXdmrvGj4ZT8nXJ+F6/qibRevM+Y+KBzaNjaO3o+MmaUUnr2n3P9dOfHXt++OOXfzjw4MLHI6mx70r3THjiizf+dNBDF3100lvW71uD83ZnzuKk+tn5mzMo5zDmUlLft6T7uGRvsiRd9+o0tYp8LWeJ22KX9WsOG0daDpxWE89uGRPVj4yOSY+OjPXjR0SMHx5XvDgsaV2777l++rNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9Zvf6Q2cO7u7FndlJxV9kjPopzHOJOwLzfH7M/sUdTpalXrUWySt+Uu8VsMs47NZeNJk3H+/vQRsW7QsDi8YUhc9+Gg2Dh9UNK6dt9z/fRnx54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropLes3zcn3118e7B/VjM4h3UW6TxOfS2uOpuwP5dz5F9zT72uZlW3WZ/ytxwmjotl1rM5bVxpe+OYoYnmdYMGxPKL+sXqdXslrWv3PddPf3bs+eGPX/7hwIMLHw988MIPT3zxxj85Uz0grYXoo5Pesn7nJL49yY9ihHN4e0nnsWoJ53LqK/W2M4pkP1baq9qvycfqdnNS/aaGsV7lMvFcTLOuzW3jS+PVvfvHyB33jEUrd4/iHrsnrWv303czLOnPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Zv72h729qRN9hfItQP8uf9lViifM5NYZzGrWn/bo9qzhs7yI/q2HVceaqfG79iutim/WdzvEBidbq9t3ijeY+sdem3knr2n3P9dOfHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96yfvWQ/ZHvcPaM9s++STiXdzatrrbHkF+dVTmvEXPUYfau9m/2MOKzXKWeU9PI6+aw9SzGWefmuvGm+b6VO8aUeT2T1rX7nuunPzv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Zf2+QTsncW7me5xvUuomucP5vDNq57TOKtXbzqyc28i/9u9qEvs4sUk9r6YVt9U28rscJ86b29a7OW/cad93hy17a12777l++rNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSu238t63/bfF/W/6v9Pqv0uv/St//Vfr+v9LPfyr9/K/Sz38r/fy/0r//VPr3v0r//lvp3/8r/fcflf77n0r//Vel//6v0n//Wem//630339X+u//K/3vPyr9738q/e+/Kv3v/yr97z8r/e9/K/nf/wFI7bQTeJzt24mbXFW193HhGlBIQoAwBQhk7HQn6XQ6PXdX1a+ZZFRAQO51IgwBmTSMYQzzFEW9iojKG6IgyKCoKBCDEFAiL1GigAoyXAaZL4gQZc5bn3Oo958o8jw8h3PO3mt9f7X3XmvtXdUf+tAH/xZNG5FHX/1I+heNzGmrN8g3Z2+c+dk0G03aImc+vGX+eOj4bLty21zykUk5cPyU/Hp0S156eFpmn9OWh9afkTnHzszFv2pP3zOzcsrrHbn82dn56x2d+fSZc7JDW1cWL+vKQf3dOWJJdxas7s70np6MOLgnBy7sySkXlFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvQ39/r/t2pEZ6hyTf120cXb6xaaZ+rMt8r2ztsqtLdvku9+fkC+8Pin7j5+aqydMy+VrWrPo1ulZuefM3HZ3e+7aqiPb7zM7Pzi6MzsdNSeL9urKb7bqzuCq7rQc1ZPrX+/JXw7tzXdW9GbF2L6M2bMva5/cl//4Rl/2/m55de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0O/z8OzmazbOV1/ZNLesOy6z/7lV1r1xm3xyu4mpXDs5bzw3NXetmZaXXmnLPUtn5Pa55Xhfs8vsLPpKZz738znFeP3h2u5iPFcO9uaYJ3pz1fy+/PB/+/Ld/fpz8Q39mfdaf56dNpAbPj6Q1kMGcsWR5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/OeFz8W725HF5sHXrnL7Wttnu+onJ9Cm5ZmFLll7bmuU3TM9mF83M1OFZOeCBjnxsx84cfMmc7Hp3V776UHfuW9WTK28oNR84vj+f/0V/RvcN5PdXD+R/Rgzm8E8O5oivD+a2OwYz8snBPLh6MIe8U17de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db0Wxfmhs9Hm8u22jajn5iYjy+YkjOfasnjk9ry04EZ2bO1PVNerY/5N2bngI3m5Mmjy/G+b0VPMWf/fl1fjjyhHN91fjuQ+buXmg6fNJRHjh/KvrcO5Z8vD+X7m1UytauSj+5YyZJdy6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+scH6MEd8Ttq+/PUpqWwyLa1HtmX1pTPyz8vac96xHWmZWs5161HM+utFvcX63f/0/mIOG7eVVw1ml46hTL56KONGVnLfAfX/fljJ6Y9XstnIaq6eWc1/7FjNir2r2edT5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/+ChGWCfmis9LH3F17t0zMvbR9lx9T0ex3sRj8Vls+t2UvnytpxzvX703kHWX1ufsZ4aywfNDBfuIuyu5bFw1nzmgmrUvq2bzu6t577lqHl+7luvG1rLRNrWcNrG8uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6JcjxEmxwnoxZ3xu+h74WnuRcza+tzM/WNCV29/rzgaf7y3itnU58ScD+fZFg7l/l3Jub31qJWe/VinG9Rc/qubOl6qFxnt2r2XuUbXcd24tB11aS9sPannxR7VsfX15de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0C9PyhXipZhh3Zg7Pj82zni8Mxcv7iry87+u7C3i8gYbDWTrsWXssl6Nz0UvV/LXg8vxM56v7F1L59m1/PTqWs67s5YrHqzl1idr2f3FWhb9o5Z9X6ul6/Xy6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3oV+tIF/KGeKm2GH9mEM+R7YW7VzGOHHY+vvcfw3mxO3L9X3GLyvF+h2ztJrWzevzeG4t915Warj8sVLbtW/VMnVNLa/V/1v2Xi2PvVPLfm/Xx/et8urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6FfvaRmkDflDvFTDLGOzCWfJ5vntvcX+Xr52YNFfBa3zcmrzq7mxX9Xi3Eyh8f8rpaVz9Yy/81aHqhrufndurbVtez/Qi23P1rLQ3+sj2u9zavLa7n79vLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLehX82oblI7yJ9yiDgqllhP5pTPlW35+cqLh/KJeWVse+CGcn13nVLLHUtr+ejT9Xj2VjmOq96o5fd17jX31fLpm2q5ps5++Kn1NX5wLYvrGto+Vst225dX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70N/epmtaP6SQ0hj8ol4qmYYl2ZWz5fPjK/UuQq63HNUC2vf7M+bqvKdWy8FtbH6+anynGlZc/DahnurWXJurXs/Ug1f765msHvVbPeomq6zi2v7j33Xjvt9dOfHfYWvj+f+OGPX/5x4MGFDyfeIk7V+emghy766KS3od/eQf2shlRHqSXkUzmliKsblevdHPM587X2H6q5YZcybnc8Wq5X6/e2l8q5vLLO9p/71XLLmFpWrKhmz4X1NTJQzfPvVtJxbyUtV1Vy6Vcqufzc8urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6FffrSHUEerJdVTagp5VW4RX8UY68xc83nzKT6L15e8W8aw3R6vZcQN5bh1bFIrxvOr+1Rz8yulxr06K7nliaHMWjyU848ayt8+PpRTdyiv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+u0h7aPsJdTTakp1ldpCfpVjxFmxxnoz53zufH/8vXJ9funBcq5az+Zwz6HVnP9cJRseUmo+4KCh3PtyvRa+YDD9XYO5aPVAnvrDQO5fXl7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db020fbS4qT9hTqarWl+kqNIc/KNeKtmGPdmXs+fwzi9puLanmwrZYjflbNFi3VYvz++UI5vksXDyZrD+bL8wfywD/7s/Ki/hxV6c+yUfWY+m5fcXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29DvLMF+Woywr5I71NdqTHWWWkO+lXPEXbHn2vfztnHAslfdrxhm/b6zW70WWjSUze4sx3ncjPoe98j+bLqsvs+f2JdFP+jNSTv25tT1e/P0v3uKq3vPvddOe/30L+zU7bHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db0Ww/OFOyr7S3tr8RPdbZaU72l5pB35R7xVwyyDs1F44HJel3SWinW84MHl+N9wSn9ufPCUvMeddu7bdaTnRZ2Z+PR3Rn8XVcW39hVXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvSrEZ2rWB/21/aYxf77M2U9r+ZUd6k95F85SBwWi6xHc9K4YFtvYKhYxy9vPVDM7ZMerute1pMTrusutB75wJyM2WZOll3amS136MyqlvLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeh37masyXnK84YrBd7TfstsURcVXuqv9Qg8rBcJB6LSdaluWl8MO621kAxh089orcYT+P7p/PnpOOAztz46dnZ75yOTH5qVnZbOCsnfba8uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooas4m6nrpLeh39mi/FicMdXrJmcN9tvWj32XvYf6Ww2qDlOLyMdykrgsNlmf5qhxwmo977O8Ox/p68qcn3dmSWV2obHlxvaM/unMVF+dkfVPnpFv71Ve3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29DtfdcbonE2+dN7izMG+297TerIHUYeLt+oxNYm8LDeJz2KUdWquGi/Ml6zTVcxt43rw/e15szozI/48Pa9e3ZZ5d7Xm5q7WtH+4vLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpbegv6uOjyrnvvM2Zk/yplrD/tge1D7O+1ONijrpMbSI/y1HitFhlvZqzxg374h06ct0O7cU4b3NKWybdPy0vHtmSb396av72kykZOH5KcXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29AvHqoR1cvOHJ27mTPOX+RT9ZW9qP2YPYn1pjYVh9Uo8rRcJV6LWdatuWv8aPjWmunF+P5mSUuh9f+OmJzHl03MHi9NyK+vnFBc3XvuvXba66c/O+yxyz4//PHLP46ixj6s5MOJFzd+Ouihiz466W3o912D83ZnzuKk+tn5mzMo5zDmUlHfry73ZcXeZGG57tVpahX5Ws4St8Uu69ccNo60nNLbkrfumJz9FkzMcadsmy1eGp9jXtw6t/z31sXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Dv/2R2sC5u7NndZMzSPHTWZTzGGcS9uXmmP2ZPYo6Xa1qPYpN8rbcJX6LYdaxuWw8aTLO11W3yWaPbJWzXx2X5T/ZIq21LYqre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96Gft85+d7Fdw/2z2oG57DOIp3Hqa/FVWcT9udyjvxr7qnX1azqNutT/pbDxHGxzHo2p40rbaPGb1Vo3vyRTTOiukk2vHZscXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29DvnMR3T/KjGOEc3l7Seaxawrmc+kq97Yyi2I/V96r2a/Kxut2cVL+pYaxXuUw8F9Osa3Pb+NK4dOUm2euejfL0FWPyxfs3KK7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv67Q19/6ZG9D2M7yLUz/KnfZVY4nxOjeGcRu1pv27PKg7bu8jPalh1nLkqnxfrtx7XxTbr2xw3zrTu+8bojFq9fnb81XrF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvQ796yP7I93D2jPbPvpNwLu9sWl1tjyG/OqtyXiPmqMPsXe3f7GHEZ7lKPaemkdfNYetZjLPOzXXjTfNjV6ybr88dUVzde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9P7/+v+C8pzHuZnv43wnpW6SO5zPO6N2TuusUr3tzMq5jfxr/64msY8Tm9TzalpxW20jv8tx4ry5bb2b88ad9mu+vKbm6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KT3g/H/YP1/EP8/yP/NXv81e/3f7Pu/Zt//N/v5T7Of/zX7+W+zn/83+/c/zf79X7N//9vs3/83++8/mv33P83++69m//1fs//+s9l//9vsv/9u9t//N/vffzT73/80+99/Nfvf/zX73382+9//fvCvuf91X7dOzjtuvTw5anRaFmyY6k1jM+6uzbLsqnGZ/tmtc/IL2+Sej09MbdHkrL9kag77+rR867Nt+ds6M3L2xTPz6Or29FY78sRh9fh7Ymc+dvicnLV9V0Z8uDv/e313dqn1ZOSynoyd3JsJC3rz4C29+fEzvVl/7b5MXr+vuLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpbej3/w/MGJ1nbtowV4zaJP/o3TyrurbMTiPG56Brt80OUyZl4xOnZO0lLdnzytbsdNb0dA/NzPH3t2feLh05cvHsvPTnzuz+6pz845WudD3QnaMX9+Tve/dm1Su92e/Evpz5Ql+237U/X7q0P7f+qT/XvVOvFzYZyDtbDxRX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70N/T4Pz+ZO3yR9x2yeuRdtmYePG58bOyfk3d9MyrMzpmbJEdNy1FltueSYGTm20p7Dnp5VjMPeKzvTPaYr6/aU43zizHJcT/h1X7Y8uD+feL0/e35pIDs+NJDejnqdfsJgvnbdYD71x3rN/Oxgdn2lvLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGr0De9/Awa+s0Jn4t3f/vhljn9+vGZds6EvNg+Oc/fMDV7r92ag2ZOz+Ed9dw6clbuu6sj632qM6+umJPRm3fntfpeq+8zvVnwyb7s0VFqHrlkIB/tG8wt9Vr1xLahXHjBUDb+81A2GVvJodtX8suDK1m4oF7TLiyv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+q0Lc8Pno832iyfkloPqOf+tqWmb15oLfjg9/3XbzLx1XV37sfUx37Tu75J6nf1qdzEeJ+1azu2vtg9k0zcHinG88WND2fK+oULT2Hote94blawZrOZ786vZ/TvVrPplNT9fUc1uvy+v7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+sUG68Mc8Tlp++2xLXnm0tbc//L0/J9x7fluPdfO+tfsrLpmTjH3rEcx68xR5Tpea61yDhu3E6ZV8trPKvlDazV3XVzNSU/V/2utpeXAWpZfXMteN9Zyw4pa5tf3ue8+VF7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db0i49ihHVirvi89BFX19ulPb/+fEf22r1c5+Kx+Cw2HXNNfwZuLcf7kDOH8tOhSk6s711uPaLU/JOda9nu8lrWeaqW67dM7tw5ueaI5MJzk30vTX61JGm5qry699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3olyPESbHCejFnfG76rn9CR5FzbtujK3u83Z0vnNmbW57oK+K2dXnv7KFsN6qS01ZWirm74r1qZp5QjuvnZyRHfrHUeOx9yfr/SE76yHBGjhvOA1OG880Zw1nRXl7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db0y5NyhXgpZlg35o7Pj43WA7vSO7GnyM+LW8p4fus3B7PiW0NF7LJejc+c+bWc9WytGD/j+e0Hk0dGDOfTbcOZteNwdtl/OAcdMpx/HTWc7mOHs+b44Tx2Qnl177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvQr1aQL+UMcVPssH7MIZ8jW9339hYxRxy2/tZ9dCgT7q4U67Otv1y/9W1r/vSd+jx+Ojl+q1LDx+aW2vY5bTirzhzO5WcNZ179ev7C4Xzo9OEccVp5dT/v/ffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29CvXlIzyJtyh/gphlhH5pLPk832nw4U+frwdcp4Lm6bk59YJ7nk5HK8zeGluw7nhMOHs+Wpwzm9rmfuGXVtC4azVn18DztgOGftUx/Xepvv7DCcL21XXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvSrGdVNaocivx9bxnmxxHoyp3yubMvPe2xYzZvPVYvYdHpHuU4fezc5vDKcn88bzq9OLcfx5FOGc2Kd+5q9h/Ph3uHsVWffeE09Bjyb7FzX8MA9yYu/La/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv61c1qR/WTGkIelUvEUzHFujK3fL58PP9atchVRTy/Pbl8s+F84ZPlOjZerXXOA+aV40rLWy8kL9ya7HZR8s7nkoUDyd/HJzeNSh5dt7y699x77bTXT3922Gt9fz7xwx+//OPAgwsfTry48dNBT1Ef1PXRSW9Dv72D+lkNqY5SS8incoq4KrZYX+aYz5mv6/ZM9luZIm4/9PlyvVq/h36xnMsn1NnWfiiZ+41k/q7Jm2vV5+xttfz3GbU8vEctq1pqGR5Ty04fKa/uPfdeO+31058d9thlf9778YFf/nHgwYUPJ17c+Omghy766KS3oV9+tIdQR6sl1VNqCnlVbhFfxRjrzFzzefMpPovXtTPKGLa6Hqt+PKsc74cvLcez/y+1HHBMqfGtm6qZe3A1D02opuMflZz7x0qmriiv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+u0h7aPsJdTTakp1ldpCfpVjxFmxxnoz53zufL9xRrk+t9i/nOvWszn8+PO1zD6ilqXPlprWe6aS4+bXa9r1K3nyl0PpWjCUL+9Vfv/t6t5z77XTXj/92WGPXfb54Y/fN97/DPDgwocTL278dNBDF3100tvQbx9tLylO2lOoq9WW6is1hjwr14i3Yo51Z+7V3tcubv9gdH1t3pBs0p3c9aNyvL97VLUY34MmVvL8OUPpeX0wpx8/mONH1ev4OwYy72sD2eWM8urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6HfWYL9tBhhXyV3qK/VmOostYZ8K+eIu2LPPu/nbeOA5e0ryxhm/V71h3otNLqaO3aoFOP6mx8P5k8vD+T26kCuv7I/XVP7M+l3fZlycV++cnJ5de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0G89OFOwr7a3tL8SP9XZak31lppD3pV7xF8xyDo0F40HJut1t+urxXo+/dlyvGe/N5AjRw4U2v61d19WX9abV9bqzbKv9eTpXXuy85zy6t5z77XTXj/9i3lTt8cu+/zwxy//OPDgwocTL278dNBDF3100tvQr0Z0rmJ92F/bYxb77/peQ72t5lR3qT3kXzlIHBaLrEdz0rhgu2lZub4vvWKwmNuTPtuff1f7sm17b6F1009159YlXTlkXFd+e/ecnHztnOLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeh37masyXnK84YrBd7TfstsURcVXuqv9Qg8rBcJB6LSdaluWl8ML5+9mAxh6e8XI638T1lve48/OSc/Odj9Xm3bmd+f8jsrF5rdib+T0dxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0O9sUX50xqRuctZgv2392HfZe6i/1aDqMLWIfCwnictik/VpjhonrNbzu9v35mdLu/NId1d2u6PU/MfOjtw8Z1aeO7Y9N70zM8MPzCyu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+p2vOmN0ziZfOm9x5mDfbe9pPdmDqMPFW/WYmkRelpvEZzHKOjVXjRfm2oXdxdw2rqP268j3l7fnx/vPzHfaZmTMTtMz9+a2/OW8tuLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHrkJfXSe9Df1FffxKbzE3nLc5c5I/1RL23/ag9mHWl3pczFGXqU3kZzlKnBarrFdz1rhh32XF7OyzYlYxzve8Oz2/37ct33xlWrZ7rCXndLbk6X9PLa7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv6xUM1onrZmaNzN3PG+Yt8qr6yF7Ufsyex3tSm4rAaRZ6Wq8RrMcu6NXeNHw05a2YxvkdNbi20HnvBlFxYm5x/Hz0ph7ZMKq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv6fdfgvN2Zszipfnb+5gzKOYy5VNT3C8p9mb2J+tz6U6epVeRrOUvcFrusX3PYONIyeem0XLn91Hzo7UkZ/96E3Hn0ttnq6G1y4CbbFFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvQ399kdqA+fuzp7VTc4gxU9nUc5jnEnYl5tj9mf2KOp0tar1KDbJ23KX+C2GWcfmsvGkyTjvu3zbLP/c+Mw8bqsc3rll7l8+rri699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3o952T711892D/rGZwDuss0nmc+lpcdTZhfy7nyL/mnnpdzapusz7lbzlMHBfLrGdz2rjSdvMVWxeal39u8/z4jk2zdMamxdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/cxLfPcmPYoRzeHtJ57FqCedy6iv1tjOKYj9W36var8nH6nZzUv2mhrFe5TLxXEyzrs1t40vjwZ/YLG/vNjYXT9ooW+y3YXF173n52Ywv2uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvTbG/r+TY3oexjfRaif5U/7KrHE+ZwawzmN2tN+3Z5VHLZ3kZ/VsOo4c1U+t37FdbHN+i7n+OaF1jUnj8kvTxyVlysji6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+9ZD9ke/h7Bntn30n4Vze2bS62h5DfnVW5bxGzFGH2bvav9nDiM9ylXpOTSOvm8PWsxhnnZvrxpvm8yd9NINPr1Nc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29PsO2jmJczPfx/lOSt0kdzifd0btnNZZpXrbmZVzG/nX/l1NYh8nNqnn1bTittpGfpfjxHlz23o354077e/tvFZxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNL7wfh/sP4/iP8f5P9mr/+avf5v9v1fs+//m/38p9nP/5r9/LfZz/+b/fufZv/+r9m//2327/+b/fcfzf77n2b//Vez//6v2X//2ey//2323383++//m/3vP5r973+a/e+/mv3v/5r97z+b/e9/m/nf/wN1R1KEeJzt2/ejXVWZPnCIlNCRmlCSkEJuclNuyu3tuedIUSGIAoKMg19KBGKAEFAUpYwJhARRujh0BCwZQCAkEaQklmFg5IvKGEAcEgcYBAQGGyDM7M/eHP+JQ35Z2Wu95Xn2Wut937X2uRtt9P6/Q1/ePLeu2CrDDtou+63eIf/4p53Tu8nI/Ob53fPRa0fln1v3yu+/Pi5HPTohUzZMzJJfTMo917bm7f2m5qbHpuWdjrYcfvaMDPvezOyzalY++/3ZuXFReybs05Ft/9CRE87pzJR3OtN+XFdqq7vypze78tjE7kypd+dDB1StZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3wb/P3/j/O3y2Z/3iEPztkl239xZF47fY/M3Xd0vvrSXjlu7vjMWrV3xm5oyYLnJueza6fk0K9MyxU7teX8pTNy4bMzs/WI2Zk/sz3bz+jIoTt35qJnO7PpZV15va07n1/VnRtae3Lssp5cvK4nT+3Ym0f7e/Pvh/Vmj6Oq1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Df7eh75zP7dLjrhrZM59ZI+8vWJ0Hl84NntuNiGbnzQxa5ZPytfWtmbFXVNz6VnTs2RCNd+nbjM7hx7cnolfqOb5ypO6yvm84n+703tzT05u780pP+jNcbv15fAFfWlb2ZcfvNyXL+zQnzda+nNiW9V61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHr5Lf56p30OBvTXgvxt5+YY9c98ro7P+Tsdn6lAnZ8tWJObU+OYtOmpJlC6Zl/YFteXWTmZn8zVn54BbtmXZER3Za2pkjrunKNy/rzkkLKs5TNvRm0hf7su7tvlw5rz/fe7g/s3cdSPuhAzl/0UD+4+aBXLd6INMfrFrP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Db42xfWhvdD5phnx2bdtydkRF9LPnLr5Hz3hSk5891p2e2VgvvdxZx/cnYm/0d7ls+s5vuqZd3lmr395N509FTz+/+X9Kd3+4rT7BcGckv3YEZ/ZTD33TmYzz09mNf+MphfDk/mbZuy9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvg7/YYH9YI94T2VWHtmTzJyfnjelT88CR03Pfp2fkoM5Zee3F2eXasx/FrBvn9JT7d69atabN2xUnDGTHPw7kDycO5nePDeaq8clVJyb735SsfyxZ8Hry78OHcvEuQxm1e9V61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfBX3wUI+wTa8X7oiOuti6dnt9ePyMLvjar3G/isfgsNl3yYk8+9VZvOS+L1/Tn8a8M5Moxg3lyecX5sQuSY36b7D1+KI/+w1A2XDCUf10+lO/+dCinrxvKbzYMZb/nq9azfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvg3+coQ4KVbYL9aM90Z3ysoZZc555qL2zO/rzAVruvLk2J4ybtuXL53an6PnDOSabaq1+8JgcuDKlPN69vyhXHhHxfHS7WtpnVHLVR+uZeqRtfxxbi13z6/lhZOr1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Df7ypFwhXooZ9o214/2x8ZGb2nP4MZ1lfn7w+J4yLj/5RF9e+HV/GbvsV/NzyJ3JjS3V/JnPVbvU8rd9azlzXi0fO6+WE66q5au31LLL7bUcencto1fW8u7KqvWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb4O/WkG+lDPETbHD/rGGvEe2Dt26inHisP3XMmogQ5tX+/sjX6r281NfGcobTxfreEItl3+64vDZGytup91fy2travnR2lrOK9rvPFjLmAdqufD+qvV83nvj5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74N/uolNYO8KXeIn2KIfWQteZ9sHvQ/vWW+XrZfFc/FbWvy5P2GsuLear6t4aeW1XLF92vp/VEt1xZ8zn2o4La6lrG31XLBDbXcdHkxr4XMDxfX8o2vVq1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfBv81YzqJrVDmd+LHCKOiiX2kzXlvbItP5/08cGMnFzFtmsXVPv73YFalp5Vyy9vreU3P6rm8Vv31XJlgftfL61lwhm1nFpgn51ij7cUa7zg8Mcta9l686r1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+Dv7pZ7ah+UkPIo3KJeCqm2FfWlvfLx5btVQ6zHx/eqJb7Dy/m7bJqH5uvDxc4z721mldcdptSy1ZvD2XeI0PZ4/qhXH/mUDb9zFB+Nad4b/tXrWf9xsmRp0efHfY+/N564oc/fvmHAx644IMT3jJOFfjxwKesDwp+eOLb4O/soH5WQ6qj1BLyqZxSxtUitthf1pj3zNejFw/lC9tUcfut66v9av+ef0e1lq8osI3brcD9qyK/Lyu41Is98m5y10PJWxclrx+f/L+Dk7kfrlrP+o2TI0+PPjvsscv+ee/FB375hwMeuOCDE1644ccDH7zwwxPfBn/50RlCHa2WVE+pKeRVuUV8FWPsM2vN++ZTfBavj3qoimE731TLY6dU8/3Wumo+jxhRcLir4rj7nwfzTzcP5s2jB3PwjMHcvMNg9h1etZ71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxbfB3hnSOcpZQT6sp1VVqC/lVjhFnxRr7zZrz3vkesabanz1XVWvVfraGN2odysHLk6dbUnKaPHEwl99Z1MIHDOQDf+3PIav78y+X9OeaxVXrWb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Gf+doZ0lx0plCXa22VF+pMeRZuUa8FXPsO2vP+4dB3F57UC3X/WEo7Z8fyu9+X833fbdV87vomIFs+dP+HNben2vv6csVc/rSuXFfznu8iKkP9ZatZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3wb/N0lOE+LEc5Vcof6Wo2pzlJryLdyjrgr9pz2Xt42D7Ds/nwVw+zfn25X1EIHDWb94oFyXv/r1b6i/urLs2cX5/znenLIZ3tS36In+z7Wndvu7S5bz/qNkyNPj35pp7DHLvv88Mcv/3DAAxd8cMILN/x44IMXfnji+/fzf7Ef3Ck4VztbOl+Jn+pstaZ6S80h78o94q8YZB9ai+YDJvt13ivVfr6uZaCcx4MH+3Lhgb0lt10L2zs/3ZXt61155vHObHphZ044rWo96zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544tvgr0Z0r2J/OF87Y5bn7zFVPa/mVHepPeRfOUgcFovsR2vSvMD2q3eq/b1qfV+5tuvXFrzP6S42T1fJteObHXlyQ3vOO7I9z23enm+9NLtsPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOLb4O9ezd2S+xV3DPaLs6bzllgirqo91V9qEHlYLhKPxST70to0PzDu/JNqre87vaecT/N79Uc78ta49nxp9OyM2X9WXrllZnauz0xtr6r1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXuXdTMET3wZ/d4vyY3nHVNRN7hqct+0f5y5nD/W3GlQdphaRj+UkcVlssj+tUfMEq/08anFXfvF2R975fHvmbTy75Pj6whlZd1pbhq+Ynif6p+fonavWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74N/u5X3TG6Z5Mv3be4c3Dudva0n5xB1OHirXpMTSIvy03isxhln1qr5gvmo/6to1zb5nXalTOydlhbHrtqWu6dNzVt50/JuX9tzV9+1lq2nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwavkV/DEt8Fffeye1dpw3+bOSf5USzh/O4M6h9lf6nExR12mNpGf5ShxWqyyX61Z8wb7CcNn5fThM8p5fnFgal65ojUr2ibn6NGTcvPClmzS3VK2nvUbJ0eeHn122GOXfX7445f/ssb6VRUL4YMTXrjhxwMfvPDDE98Gf/FQjahedufo3s2acf8in6qvnEWdx5xJ7LeyNr2rqm3kablKvBaz7Ftr1/zh8Jm108r5vei4ySXXyx7eO989Z0J2vWN8lhw/vmw96zdOjjw9+uywxy77/PDHL/9wlDX2lAofnPDCDT8e+OCFH574/v38905ned/uzlmcVD+7f3MH5R7GWirr+9XVuaw8m9Srfa9OU6vI13KWuC122b/WsHnEZZ+3J+XHiyZmTN+EDAyOy+9u3yt9t4/JPx02pmw96zdOjjw9+uywxy77/PDHL/9wwAMXfHDCCzf8eOCDF3544tvg73ykNnDv7u5Z3eQOUvx0F+U+xp2Ec7k15nzmjKJOV6vaj2KTvC13id9imH1sLZtPnMzz6cPGZv11o3Pgij2zbOEeeWPYHmXrWb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Gf9+cfHfx7cH5Wc3gHtZdpPs49bW46m7C+VzOkX+tPfW6mlXdZn/K33KYOC6W2c/WtHnF7dfrR5WcN1w3Mj/feESenr9r2XrWb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8HfPYlvT/KjGOEe3lnSfaxawr2c+kq97Y6iPI8VZ1XnNflY3W5Nqt/UMParXCaei2n2tbVtfnFc9I0R2f1rO+e2Y3dM95U7lK1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfBv8nQ19f1Mj+g7jW4T6Wf50rhJL3M+pMdzTqD2d151ZxWFnF/lZDauOs1bl83L/FnFdbLO/rXHzjOvo+z6YX6/aNtudvU3ZetZvnBx5evTZYY9d9vnhj98y7xQ44IELPjjhhRt+PPDBCz888f17/KtX5z3f4ZwZnZ99k3Av725aXe2MIb+6q3JfI+aow5xdnd+cYcRnuUo9p6aR161h+1mMs8+tdfON83eO3TJHThhetp71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxbfD3Ddo9iXsz3+N8k1I3yR3u591Ru6d1V6nedmfl3kb+dX5XkzjHiU3qeTWtuK22kd/lOHHe2rbfrXnzjvuopcPK1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+78//+/v//fj/fv5v9vqv2ev/Zj//Nfv5v9nvf5r9/q/Z73+b/f6/2b//NPv3v2b//tvs3/+b/fcfzf77n2b//Vez//6v2X//2ey//2323383++//m/3vP5r973+a/e+/mv3v/5r97z+b/e9/3//X3P9efml4BlZsnW/N2T6/XbVj/vTHXfKLD+yWhc/vkQ3XjM7M1rE59+vj8+dH9s7a9S0Z/YvJOfDaKblkv2npfWx6LuuYkVfPmpmrvlvUSStn593vtad7UUfu+1Bnbn6lMxud05Uf/60rjx7bnSeLNX3hm92ZO7Ena2s9+c1Hq9azfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvg3+/r9s/va59k875pNzds2tZ+yWJafvmXf2GZPdXxqbvx03If+2cmJ+uH5Shj/XmnfXTM3LX56eqTvNyKilMzP+2Vn59q7t2WRmR25t68zLO3VlwrNdufrS7ixp68k2q3rS1dqbt5f2pmVdbxbs2Jdj+vty7GF9uesfq9azfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvg3+3oe+EZ/bNa/duVtGPrJnLlkxJscvHJcVm+6da+e35IjlkzO+iC8H3jUtk89qy5gJ1XxvuU17Xv5YRx74fDXP00/qLudz6v/25Jff7s1m7X3Z/Ad9+dvI/rx6Sn9+dk9/9n+5P9vuMJClLQPZuK1qPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOLb4G9NeC/GLnlhz3S8MibP/nhcbjp579zwh5ZsWW/N7idNzdgF03PGgTNy/iaz8tCVs/Od4R35yeGd+f4FXXnt6u60XdaTTRdUnNeu78uDZ/Tn5Lf7M31ecVZ8eCCP7DKYRw8ZzKhFg5l/82A6Vg/mpw9UrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098G/ztC2vD+yHz1n+Oy8nf3ju3907Khltai0PH1Ozw7vQiP8/IeXfPyhafbM9DT3SkPrOa77YiX1mz+55c1KTd1fwev2Qgv9iu4vTI84Pp707u+XLyieLs9oGnk/P/UtR+Rc07bNuhsvWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb4O/2GB/WCPeE9mDDp2Ua9e1Zun0aTnsyLZ84tMz80LH7Cx5sb1ce/ajmNU9p7fcv6uHqjVt3qaeMJjvvTGYxUUNf2ZRz88ozjFtJw7lP28cyhmPDWX460M5dngtk9xj7Fa1nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPFt8BcfxQj7xFrxvuiIq2suaMvp18/MFl+bXe438Vh8Fpsmvdib19/sK+dljzUDOb6o26eNSU5ZXnGeW5zj3npmKD8aV8sx/1DLFy+o5ajltQz9tJat19WycEMtv32uaj3rN06OPD367LDHLvv88Mcv/3DAAxd8cMILN/x44IMXfnji2+AvR4iTYoX9Ys14b3TX3jOzzDmnXdSRTfu6MmZNd04Z21vGbfvyq6cO5M0Di7PKNtXaPWtwKM/dM1TO667FuX7cHRXHydvXs6atnrYP1/PjT9WzbG49B8yv56yTq9azfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvg3+8qRcIV6KGfaNteP9sbH+xo68enRXmZ8/eXxvGZdPeaI/Z/16oIxd9qv5eekHQ+luqebPfH5sl3ou3beeHebV88Lieja+qp7dbqnnttvqefmueu65p57LV1atZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3wb/NUK8qWcIW6KHfaPNeQ9svXKVlWME4ftvwf2HMy6zar9veGL1X5e8JValj5dSybUM+XTFYd3b6i4bXV/PUvW1HPI2npGFe3gg/WsLPrG3V+1nke9N06OPD367LDHLvv88Mcv/3DAAxd8cMILN/x44IMXfnji2+CvXlIzyJtyh/gphthH1pL3yebzr/eV+XrsflU8F7etyc32q+WAe6v5toYXLKtn6vfr+eV99bQXfEY8VHBbXc/qf6lnTMGn5/J6LitkPl7wmvjVqvWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb4O/mlHdpHaQP+UQcVQssZ+sKe+Vbfl5048nd0yqYlv7gmp/Xz5Qz15n1XPirfUs/FE1jzML3NMK3J+5tJ77vlDPFkfW88hgscdb6tmo4LBsy3pu2qxqPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOLb4K9uVjuqn9QQ8qhcIp6KKfaVteX98nHD7CqH2Y+f2aieQw8v5u2yah+br2cLvCNureYVlx+01nPjW7UMe6SWu66rpfPMWq4+qpZ5c4r3tn/VetZvnBx5evTZYe/Z99YTP/zxyz8c8MAFH5zwlnGqwI8HPnjhhye+Df7ODupnNaQ6Si0hn8opZVwtYov9ZY15z3wdc3Et225Txe2Lr6/2q/076o5qLU8tsP1wZD0jf1VLy7KCS63YI+8O5SMPDeXii4ay5Pih/PVj1fcvrWf9xsmRp0efHfbYZX/Ue/GBX/7hgAcu+OCEF2748cAHL/zwxLfBX350hlBHqyXVU2oKeVVuEV/FGPvMWvO++RSfxes/vxfLlt9Yz9xTqvm+eF01n6/vWsuIuyqOd/4pGXlz8o2jk/8uwnHfDskzm1etZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3wb/J0hnaOcJdTTakp1ldpCfpVjxFmxxn6z5rx3vm9/qNqfj3+zWqv2szV85eRa/vv7Qzm1ZajktGbvZMqdRS380cF86y8DeWnVQD50yUBmL65az/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnvg2+DtHO0uKk84U6mq1pfpKjSHPyjXirZhj31l73j8M4vanDqqn4w+1PHp6LV/6fTXfn7itmt/djxnMDT8ZyCuzB9JenO+mzunPzzfqz56PFzH1ob6y9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvg7+7BOdpMcK5Su5QX6sx1VlqDflWzhF3xZ6t3svb5gGWO5+rYpj9++ntilpoTnLG4sFyXs98tb+ov/rzhbOLc/5zvXl5bm+eGt6bZ37ek33u7Slbz/qNkyNPj35pp7DHLvv88Mcv/3DAAxd8cMILN/x44IMXfnji2+BvP7hTcK52tnS+Ej/V2WpN9ZaaQ96Ve8RfMcg+tBbNB0z267BXqv3c0TJYzuOLA/0Zd2Bfye22S3uy/Knu3FrrzmmPd+XqZV3Z6LSq9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Vnyfe+fGtG9iv3hfO2M6ZzlrKHeVnOqu9Qe8q8cJA6LRfajNWleYJv3TrW/D1rfX67tp64peJ/dk1+7tyi4/vzKzizY0JE9j+zIlzfvyIyX2svWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74N/u7V3C25X3HHYL84azpviSXiqtpT/aUGkYflIvFYTLIvrU3zA+PyH1dr/ZlpveV8mt9ZH+3MxeM68sHR7Vm53+wsvmVWltdm5akxVetZv3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+8yruZgie+Df7uFuXH8o6pqJvcNThv2z/OXc4e6m81qDpMLSIfy0nisthkf1qj5glW+3nFou6c8HZnLvt8R4Zt3F5yXLJwZk4+bUauu7stn+tvy5s7Va1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfBv83a+6Y3TPJl+6b3Hn4Nzt7Gk/OYOow8Vb9ZiaRF6Wm8RnMco+tVbNF8x/frizXNvm9SdXzMynhs3I3Kum5+PzpuVn503NiL9Oydd/NqVsPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOLb4F/Wx23V2nff5s5J/lRLOH87gzqH2V/qcTFHXaY2kZ/lKHFarLJfrVnzBvtGw2dn6+Ezy3k+Z2BaFl0xJQe0tebNUZPTt3BS/rlrUtl61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfBXzxUI6qX3Tm6d7Nm3L/Ip+orZ1HnMWcS+01tKg6rUeRpuUq8FrPsW2vX/OHwlzXTy/mdcFxrybX14YnJOXvnttsnZPTxE8rWs37j5MjTo88Oe+yyzw9//PIPR1ljt1b44IQXbvjxwAcv/PDEt0Hftwb37e6cxUn1s/s3d1DuYaylsr5fXZ3LyrNJrdr36jS1inwtZ4nbYpf9aw2bR1x+89bkHLmoJSt7984TA+PzpdvH5pe37ZWRh+1Vtp71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxbfB3PlIbuHd396xucgcpfrqLch/jTsK53BpzPnNGUaerVe1HsUnelrvEbzHMPraWzSdO5nnrYeNyxnVj8l93j8rYhXtm6bA9y9azfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544Ycnvg3+vjn57uLbg/OzmsE9rLtI93Hqa3HV3YTzuZwj/1p76nU1q7rN/pS/5TBxXCyzn61p84rbSetHl5y/eN1umbvxyJw6f0TZetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3wd89iW9P8qMY4R7eWdJ9rFrCvZz6Sr3tjqI8jxVnVec1+Vjdbk2q39Qw9qtcJp6Lafa1tW1+cdz9GyNz54W7ZJ9jd8rjV+xYtp71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxbfB3NvT9TY3oO4xvEepn+dO5SixxP6fGcE+j9nRed2YVh51d5Gc1rDrOWpXPy/1bxHWxzf62xs0zrvfcu0NOWrVdbjlr27L1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+Dv3rI+ch3OGdG52ffJNzLu5tWVztjyK/uqtzXiDnqMGdX5zdnGPFZrlLPqWnkdWvYfhbj7HNr3XzjPHjsVvmf8VuUrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098G/x9g3ZP4t7M9zjfpNRNcof7eXfU7mndVaq33Vm5t5F/nd/VJM5xYpN6Xk0rbqtt5Hc5Tpy3tu13a968477igg+UrWf9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD09835//9/f/+/H//fzf7PVfs9f/zX7+a/bzf7Pf/zT7/V+z3/82+/1/s3//afbvf83+/bfZv/83++8/mv33P83++69m//1fs//+s9l//9vsv/9u9t//N/vffzT73/80+99/Nfvf/zX73382+9//NvO//wPQLcyQeJzt24m7HVWV93GUIAKRQeYEAoGQebq5Se587++eUxpBREVAxZdBMN0KyBihg4QQaBEUX1A6ERwIijRDGEREMAoECZMIMujbCCrggIAQEGQKBN/6VHH6nzjkeXiKqtp7re/v7L3XWnufc9db7+1/ay/bKHse955cOnKLPHP8Vln/2m3z2C2jsuQHO+b5T+2cPLVLzv7QbhnxlQm5f/mkTDtnSj71f6blwg1m5ANfm5nv/7Mj6/o7c8m/z87TX5iTkZ+bm3mNrvzynd25dkV3Nh3syQMre/LwLr352/G9+db1vVnw197cv15fnt6or7q699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3p9//nT9kiK67dKvNHbpfr5o7Oss4x2WTE2Ey8bNdsPG58HvrCxNyxfHK2uWhqRi6ZnrW9M9P3QEemfqAzsy6YnR/9dk7e+/zcXLemK2sf6E7nBT25/KO9WbamN6OP78v7n+rLRrv3Z+6y/iy+vz/HvN6fY7cayC07DFRX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70t/T4Pz8ZP3i5vHj06E84ckwuPG5vjO8blF7eOzxVTJuXfD5uSWUum5VPHzEh3f0em/3lWNQ7b3j0nazftyj2z63EemFqPa9+NfXn8kP5s9WJ/tj5qIBs/NJB10wfz2wWD2e/ywexw32DOe2Iwm62pr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rNCZ+LdxdePCbFirF59tRxuWbahFx9xaRs+46pmTR1embOmJnTN5mVpb/ozK/3nZOf3D43D27TnZ/O68mb+/dmcO++bDmj1nz/8oHcO3cwi346mP5JQ/nwl4fyu98M5eH3JlMbyRcPTYoTkt8sqq/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oelv6rQtzw+ejzbsvGJdFh0zIja9NyvOfmZq9Lp6enX8+MzdfPiv/dWw55luX/s7tykef767GY3D3em7vM20gj7wyUI3jF94/lMfuGao0/e4HyQdfSVb3DufTRw9ni/OHs/S64Sy8fTib/6q+uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6RcbrA9zxOek7QFbTs4Vy6bmvGen5zPbd+TTozvz0j9nZ9klc6u5Zz2KWfNG1uv4jn8NVHPYuPVNSG64Jjl34nDO/NpwBv9U/jexkWcPbuT0rzWyzdWNHHt7I3N/08itD9VX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70t/eKjGGGdmCs+L33E1fvmdeS0AzuzzQfrdS4ei89iU9cl/fnX9fV4Tz5lKOWj9P8xOfmwWvOCeY28+zuN3P14I8eMaubL85r5/GHN7PWfzYxa1sySC5t55qL66t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pV+OECfFCuvFnPG56Xv/gs4q55y6Zxl313Zn+im9OfmxvipuW5dfnzmUDUcmjbtTzd2z1g3nhQX1uI6b0kzHkbXG7nubuW9NM4MbFnlguyLnjyuy/5QiZ02rr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rlSblCvBQzrBtzx+fHxnMHd2Xdzj1Vfp4/vo7nJ587mLOWDlWxy3o1Pq8d1ci8JxrV+BnPA3/TzPdGFNl5UpGXmkU2+3iRiZ8p8rMjiqw9psjqBUUu+kJ9de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0q9WkC/lDHFT7LB+zCGfI1tr7+qtYo44bP3d88hQnlidan0+11Wv38V9zZx3fjmP/9xM7+haw8iDa23bn1Rk6SlFDllSZEp5/dDJRW4rn3WcVF/dT3nrvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfS29KuX1Azyptwhfooh1pG55PNk859XD1T5euYGdTwXt83JrTZoZv+F9Xibw4t3L9L3uSKPnVikWeoZv7jUdkKROw4vMv2gIh/4WDmuZZuDS11zhuure8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96WfjWjukntIH/KIeKoWGI9mVM+V7bl5y03H85NfxuuYlNzRr1OL3qjmRn9Rf5jfpElX6zHcajk7i+5j/xokV/OKbLt9kV+t66MAU80s2mp4fw7m7lmdX1177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvSr25WO6qf1BDyqFwinoop1pW55fPl4+oXhqtcZT0eeVMzh25Tjtve9To2XmtK3vHz63Gl5eanmvnhDc1sfmYztxzQzPt6mrl8x2YWjiw/t3fVV/eee6+d9vrpzw57a96aT/zwxy//OPDgwocTbxWnHqvzAj100UcnvS399g7qZzWkOkotIZ/KKVVcPbde7+aYz5mvYz7czA53N6u4vfzAer1av1OPrOdyX8l25/80M+EbzczdvdSyXjlnf97IJxY3snzPRpaNb+RdmzUycsP66t5z77XTXj/92WGPXfanvBUf+OUfBx5c+HDixY2fDnrooo9Oelv65Ud7CHW0WlI9paaQV+UW8VWMsc7MNZ83n+KzeD1icR3DVpaxasH0eryXL6vH883fNjL+mFrjqmuHM+HQ4Vyw83BeXpPscV/y99vqq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln57SPsoewn1tJpSXaW2kF/lGHFWrLHezDmfO983Lq7X56P71XPdejaHL36ykZc/18gpT9Safv2XpPfosqbdKLn0uqG8dvxQ9v7IUBrN+urec++1014//dlhj132+eGP3xvf+gzw4MKHEy9u/HTQQxd9dNLb0m8fbS8pTtpTqKvVluorNYY8K9eIt2KOdWfujXhLu7j92fcUKa5o5uHOZs64tB7vTx8xXI3vpLHJ1acN5fUXBtMs93d9Iwfz+5sGMuXsMqYurq/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oelv6nSXYT4sR9lVyh/pajanOUmvIt3KOuCv2bP9W3jYOWFZdVMcw6/fwe8paaORwTm+mGtczryz3uM8O5EsD5T7/ojI3j+vPk7f35e9n9eVjC+ure8+91057/fSv7JT22GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/qtB2cK9tX2lvZX4qc6W62p3lJzyLtyj/grBlmH5qLxwGS9br5iuFrPxRP1eL/yxkA6NhmotP38o31ZeV5vrluvN6ee3ZPLd+/JprPqq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln41onMV68P+2h6z2n+Xew31tppT3aX2kH/lIHFYLLIezUnjgm3hz+r1fcDywWpuP/mpUvdAX/7q3KLU+si+3Vl8YVembN+Vr9w2N0OXza2u7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnpb+p2rOVtyvuKMwXqx17TfEkvEVbWn+ksNIg/LReKxmGRdmpvGB+PKUwerOfz3Z+rxNr7DG3Vn+eNzs9Mf5uS2Debk3M/Mzsr1ZufJP3ZWV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXRVZzOlTnpb+p0tyo/VGVNZNzlrsN+2fuy77D3U32pQdZhaRD6Wk8Rlscn6NEeNE1br+dZGb074aXe+P7srm99ca17W0ZlFs2blymM7cuLrM7PhgzOrq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOFecQZ3dXcNq4P7tOZz67qyIKPz8zBk2bkt8X0jP/JtHz3S9Oqq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pelv6qPl7TW80N523OnORPtYT9tz2ofZj1pR4Xc9RlahP5WY4Sp8Uq69WcNW7YN719dkbdPqsa5//7xvR8Y59p2X/NlGz4h8nZo2NyLnt5UnV177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvSLx6qEdXLzhydu5kzzl/kU/WVvaj9mD2J9aY2FYfVKPK0XCVei1nWrblr/GjYYMnManw7d51aae358sTsNTghP//8+EwbP766uvfce+20109/dthjl31++OOXfxxVjV1y4cOJFzd+Ouihiz466W3p912D83ZnzuKk+tn5mzMo5zDmUlXfn1Dvy6q9SVmfW3/qNLWKfC1nidtil/VrDhtHWp6+YUo+15iU214bnz+/MS5nfH7XPH7ELpmw1S7V1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvS7/9kdrAubuzZ3WTM0jx01mU8xhnEvbl5pj9mT2KOl2taj2KTfK23CV+i2HWsblsPGkyzqNW7ZrTDxibF47dKTM7xuS8VTtWV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf2+c/K9i+8e7J/VDM5hnUU6j1Nfi6vOJuzP5Rz519xTr6tZ1W3Wp/wth4njYpn1bE4bV9pOWr5zpfnLB4zOgpu3zylTtq+u7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnpb+p2T+O5JfhQjnMPbSzqPVUs4l1NfqbedUVT7sXKvar8mH6vbzUn1mxrGepXLxHMxzbo2t40vjZP2GpVVe2ybj+2ydf64z1bV1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvS7+9oe/f1Ii+h/FdhPpZ/rSvEkucz6kxnNOoPe3X7VnFYXsX+VkNq44zV+Xzav2WcV1ss77NceNM6+qFW+ak4zfPj/s3q67uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oelv61UP2R76Hs2e0f/adhHN5Z9PqansM+dVZlfMaMUcdZu9q/2YPIz7LVeo5NY28bg5bz2KcdW6uG2+aP7TLyKz3542qq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pe/63/N6rPeZyb+T7Od1LqJrnD+bwzaue0zirV286snNvIv/bvahL7OLFJPa+mFbfVNvK7HCfOm9vWuzlv3Gm/dd6I6urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uik9+3xf3v9vx3/387/7V7/tXv93+77v3bf/7f7+U+7n/+1+/lvu5//t/v3P+3+/V+7f//b7t//t/vvP9r99z/t/vuvdv/9X7v//rPdf//b7r//bvff/7f733+0+9//tPvff7X73/+1+99/tvvf/779r73/LR6/ce577j2ZeuYWOebFrXLGjO0yf3B03jV2TL7w0M65bf6u2fKXu+XMd03MvjtMzo9GTs1jD03LbqfOyD0bdWTCMbOy5KedmfKX2TnqhTn5+l/n5lc3deXDi7vTPbEn567syX5dvTlweW8Of7E3O83uy6uf7st+i/py5On11b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvS7//H3PpFpk5c+s8fcZ26b12dEb9cEzOOWVsrtxtXM6+cHwOeGFi9txhSr6907Scs256Fl9f5sO9ZpX7t878ZNSczN17bpYd0ZXew7tz8od7csOo3sy4t1z7h/flwhf6cvf8/nzttv6sfO9A1t9rIC+dMJBXzhnI+8+vr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/p9Hp6t+O/tctqzo7Nig50y7vmxWXvluMzLhHRcOil/f2JKrl83LY8+OyM33tCRHx1Uj/d35s3N4q+WtcA13dV43XJpbzWeq3r6M//R/pxfxvBv/X0gZ+8zmCUrBvPJf5Q5fPxQvrfnUHY8dCj/dVh9de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQ1el77/rz6Cl35zwuXi32y475c4Ju+TYf43LnMsnZPakyfnOoqm56tLp+fGKmdnkjFnZfmh29nlgTvqaXfnEuWUNtLrcZ/1Pb35xb1++uaLWvN8Og/nYtYN559yh3HLxUH6zfnLAR5ODzk6uuSlZ77HkrheTT66tr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/qtC3PD56PN10btlnc+OiGN4ydnweNT88DYGbm4uyPFhM5s/1w55l+fm302785vj6jH+9bb+qo5+7vLBnLwgnp81/5iKPP3qDUdOHY49x03nN2vL/eqzwxn2daNjJrVyLpGI0s/UF/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Lb0iw3Whznic9L2T2dPTseW07LjYTPy5NKOPPHNziw8Zk5GjavnuvUoZt19Rn+1fj940mA1h43bqouSgenD2e7i4bxn47LGP7D87wdljf+HRjbZuJlvl/u5VxrN/Owj5X523/rq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLelX3wUI6wTc8XnpY+4uu/qjrz7kc58+4451XoTj8Vnsennuw7kP2fX4331G0N5/fpyzu4/nPX/Nlyxv3ZruV/drpmPHNjMy+X+buTqZl54opkH1yuy/L1FNtixyDE711f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS39coQ4KVZYL+aMz03fff/RWeWcDe/qyjeP78m1b/TmnQf0V3Hbutz6yqGcdUZyx7x6bm9xYiMn/KNRjetllzTzk6eblcYb9yiy7+FFbj2tyMeXFhnzvSJ/vKTIFpfXV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf3ypFwhXooZ1o254/NjY8EfunLqd3uq/PzU9/uruLz+5kPZ4r117LJejc+iZxr51SH1+BnPP32kyPglRS6+uMjCVUXOfbDIlY8VyVNFFq8psvs/ikx8ob6699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3pVyvIl3KGuCl2WD/mkM+RrcXvr2OcOGz97f2J5PDhen0v+HGjWr/r39DMDtuU8/igIjd/s9bw9d/X2i54tciodUX+Vv73wzeK3L+2yB6vleP7an1177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvSr15SM8ibcof4KYZYR+aSz5PN/5g6WOXrHy9JFZ/FbXPy/CXNPPpSsxonc3jE7UVW/bXI/FeK3FlqWfF6qe3FIns+WeRHjxT51a/LcS3b/OXmIitvrK/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oelv61YzqJrVDld/LHCKOiiXWkznlc2Vbfj7vrOE0P1PHtjtX1Ot74sIiP76hyLrHy3j2aj2Oq18uckvJ/cI9Rfb6UZHvlOwHnliu8UOKfKPUMOZ99fm3q3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln51s9pR/aSGkEflEvFUTLGuzC2fLx+dRzWqXFXF894iT36jyLX31uvYeB1XjteKx+txpaX4tyKz5xRZukGR9z/czC+va2bGt5p584xmJpxWX9177r122uunPzvsHffWfOKHP375x4EHFz6ceHHjp4Oeqj4o9dFJb0u/vYP6WQ2pjlJLyKdyirgqtlhf5pjPma+X7m7me/PquL3rI/V6tX6vebqey6tKtg/tU3JvWuRnt5Xjs6hcI93N/P71RsbdVdY7FzXy1a82cs5p9dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0u//GgPoY5WS6qn1BTyqtwivoox1pm55vPmU3wWr898vY5hQ38o8url9biN27KoxvO0vZu5/Nla4/tmNrLi0eHs+t3hnHj4cH6953CObtRX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70t/faQ9lH2EuppNaW6Sm0hv8ox4qxYY72Zcz53vhtv1Ovz0AfruWo9m8OT5jfzxScaGXForXmfTw/npmfKWvj0ZOqs5OQXh/L/fjWU22+ur+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rto+0lxUl7CnW12lJ9pcaQZ+Ua8VbMse7MPZ8/BnH72TOL3DWxyEE/bOY9uzWr8fvrk/X4XvXdZPZ6ySlHDeXO5wez6ozBHNw3mB9uUsbU1weqq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln5nCfbTYoR9ldyhvlZjqrPUGvKtnCPuij0XvJW3jQOW95V+xTDr97ndy1rozOFsvKoe500nl3vcwwaz0cqBvLzTQE7+Xn8+3+zP0Rv156GX+qqre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96WfuvBmYJ9tb2l/ZX4qc5Wa6q31Bzyrtwj/opB1qG5aDwwWa9LJzSq9XzXIfV4f3HhYH7y5VpzSttDW/elZ1FvNhzZmxm39+QbV/VUV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf1qROcq1of9tT1mtf/ev67n1ZzqLrWH/CsHicNikfVoThoXbG92DVfr+E+jh6q5/fmH+jO8si+HXdZbaT34ge6sv2N3rl7alc0aXVm9W31177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvS71zN2ZLzFWcM1ou9pv2WWCKuqj3VX2oQeVguEo/FJOvS3DQ+GIf+Vc/1oz7XX42n8b39S90Zd2BXfvDJudnj1DnZ9vHZGVo0O0d8qr6699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+OuihqzqbKXXS29LvbFF+rM6YyrrJWYP9tvVj32Xvof5Wg6rD1CLysZwkLotN1qc5apywWs/zbu7NG3N6Mv6ariztm1tpHH1VZ95x9azMeq4jb57Qka9+uL6699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3pd77qjNE5m3zpvMWZg323vaf1ZA+iDhdv1WNqEnlZbhKfxSjr1Fw1XpjPHNFTzW3j+vH7O/NM/6y8+uDM/OXiGdn/lulZMWt6xr6zvrr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGr0lfqpLelX33snNXccN7mzEn+VEvYf9uD2odZX+pxMUddpjaRn+UocVqssl7NWeOG/dzGnFzQ6KzGecuFM7Lt/dPyx8Om5qxPTsm9V07O9OMmV1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS394qEaUb3szNG5mznj/EU+VV/Zi9qP2ZNYb2pTcViNIk/LVeK1mGXdmrvGj4avrJtZje8Ny6dWWm9cf1IeXDkhw0+PzzXfH19d3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfS29PuuwXm7M2dxUv3s/M0ZlHMYc6mq71+s92X2Jupz60+dplaRr+UscVvssn7NYeNIy1FzpmbNTZOyx/ET8tmFu2Xk07vm357aJVecs0t1de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0m9/pDZw7u7sWd3kDFL8dBblPMaZhH25OWZ/Zo+iTlerWo9ik7wtd4nfYph1bC4bT5qM8/L+cdnk4bE54bmdct2VY7LjwJjq6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pd93Tr538d2D/bOawTmss0jnceprcdXZhP25nCP/mnvqdTWrus36lL/lMHFcLLOezWnjSts7dhhbad7k4dF5tW9UNrh0++rq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLel3zmJ757kRzHCOby9pPNYtYRzOfWVetsZRbUfK/eq9mvysbrdnFS/qWGsV7lMPBfTrGtz2/jSeNUvR+V9d2ybhy7YOofev1V1de95/dmMrdrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Lb02xv6/k2N6HsY30Won+VP+yqxxPmcGsM5jdrTft2eVRy2d5Gf1bDqOHNVPrd+xXWxzfqu5/joSuvuL2+Zd7y4eXp+ull1de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNL7v/FvUb3f8z2cPaP9s+8knMs7m1ZX22PIr86qnNeIOeowe1f7N3sY8VmuUs+paeR1c9h6FuOsc3PdeNP8wAUj86WDNq6u7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnpb+n0H7ZzEuZnv43wnpW6SO5zPO6N2TuusUr3tzMq5jfxr/64msY8Tm9TzalpxW20jv8tx4ry5bb2b88ad9g+sHlFd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfS+Pf5vr/+34//b+b/d6792r//bff/X7vv/dj//affzv3Y//2338/92//6n3b//a/fvf9v9+/92//1Hu//+p91//9Xuv/9r999/tvvvf9v999/t/vv/dv/7j3b/+592//uvdv/7v3b/+892//vfdv73/wEP83dQeJzt24e/XVWZPvDQpEyEX8RgQkJ6SHK5uclNub08955zxGFEg4pIcURBpAiEIgwloCKCiKK0SIb6U4IiLdSICShBcWgjgiNdiiAMTQEFQsmc796cv+Iknw+fzV57ve/zPHut9b7vWvvcESPW/zv2i1vk7pYtM/P2Uflq2+icdOCY7H3MuGyw14Qs3npyfnXx1Gy1yfb51tDM7LJbS67asTWPbN2WSavn5L+q7ZlyxbwseX1+ZkxcmINmd+R7kzrzu7c6s9PNXZm/T3e+/4/ufOrwnuzxcE++0tabbQ/tzevn92aXlb058Nfl1b12z/XTnx17fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pehn7/P/bpUWk9aHSeXTMmHS+PyzYvTMjpv5ycn+09Lac9sn12nz0rH9tth5y7x+yc3jUnx706N7/8zrxcsW5+rt11YeZ9ryNnXtaZjuVdOfa07ly3a09aNu/NNst785+z+/Lbi/vynRH9uXHn/qw7tT9/v7Y/r97Vn6EHyqt77Z7rpz879vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvQ393oe25U+OyQkzx+eyTMykHabkn89NS+W4GWl9elb+Ork113a15ZGZc7PytfZctawc7x99syPH/rYzO7/YVYzX6qd7ivFcdWRfvrhtf86+vD/nbD+Q084YyJJnB7Jr62D+54uDOf+UwYy5cDBnXFpe3Wv3XD/92bHnhz9++YcDDy58PPDBCz888cUbfzrooYs+Oult6DcnvBfPJn1+Ym7/0pQc0jM97c/MyJx9W/Kjla352dNtuebZufnAmnkZfeyCfPKDHek4oTOfubcr3eu6c8KHenPL5n0569m+gvOndhvIJ14eyHuLB7P6icH890Cy++nJnncmV76VvL3tUH7TNpTPLCyv7rV7rp/+7Njzwx+//MOBBxc+HvjghR+e+OKNPx300EUfnfQ29FsX5ob3o8+pu07Pe2Nnpn9FSxaPn51795qTi49oz+CX5ufDLQuz9O6OfPLfunLfZeV43zKinNsP/KU/e109UIzjP98dzBdPLrXuvtdQ7rpqKNVXh/LkjOGcuWg4ow8ezltLhvODk8qre+2e66c/O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ70N/WKD9WGOeE/6Pn5nS1o/MTtjLp2Tv/y+PU/+YX6+dsXCbPOFcq5bj2LWHWv6ivW7400DxRw2br98POk+YChbPzGUzWvDufW84dzy5+EcPKaSTWuVnLtfJa8uqeSm71ZS+UF5da/dc/30Z8eeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3oV98FCOsE3PF+2Ijri5a156NtlmQpRuW61w8Fp/Fppv+vT9fP7Qc78s7kzdeTVadM5R1k0vur783nFM/Xcm/nVfJ3++ra1tXycuTq/nv3mr+c+dqNvhcNV/ds7y61+65fvqzY88Pf/zyDwceXPh44IMXfnjiizf+dNBDF3100tvQL0eIk2KF9WLOeG9sd2ldUOScDTfuylkrunNVZ2/eW9pXxG3rctRzgzllTbLmm+XcHnnDcI5oLcf10qcquXZ6qXHlydUsWl7NLbdU86nfVzP20Woefqqakc+UV/faPddPf3bs+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056G/rlSblCvBQzrBtzx/vj49AxXVnyYHeRn595rK+Iy+/tNJiRO6eIXdar8TlmRiV3XFCOs/F8/LvVTF5VzcVPVPO1t6s5Y8tafjqulr5ptRw7q5Zaay1TZ5dX99o9109/duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnob+tUK8qWcIW6KHdaPOeQ98nXcN3qLmCMOW387n5V85fhyfS9+ZbhYv+terWTMLtXcu6yam/9Qaj79I6W28+bXsk1XLU/V/7uis5Z7FtZ1L6hlxfzy6l675/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvQ796Sc0gb8od4qcYYh2ZS94nn0d+ZaDI19esShGfxW1z8pxVlTw8txwnc3jdiFpWTarli/NqWVPXsryjrq2tlh2n1nLVNrX8botapmxQyxNrq7nxzWpxda/dc/30Z8eeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3oV/NqG5SO8ifcog4KpZYT+aU98q3/HzWHUMZuKiMbbc/WynW6dTrq7nmtWreHF/LBvPLcfxVe8n75c1q2emlapbWue9+Q32NX1DN9+satv16Ne3Hl1f32j3XT3927Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oehv61c1qR/WTGkIelUvEUzHFujK3vF8Ycy4fLnOVeP61ap6+p5qrNy/XsfE6pD5ey8eX40vL4CXVzF1czQ9SzdDoan7zt0pa/lgftzWVTL2lvLrX7rl++rNjzw9/h7w/n+DAgwsfD3zwwg9PfIs4tbTMC/TQRR+d9Db02zuon9WQ6ii1hHwqpxRxdadyvZtj3jOsv3+gmvO/WcbtiduU69X6vWJ6ObdX1bl97IxqLvvX+hwfUdeysr5GjqjkwY5KJm5cyTaPD+fbvx3O6beUV/faPddPf3bs+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056G/rlR3sIdbRaUj2lppBX5RbxVYyxzsw17xum+Cxen9xRxrCeMbW8/kw5bhM/UY7zid+rZPnMSqExBw3nsm2HM+HBoRy1fCh3njKUg5aUV/faPddPf3bs+eGPX/7hwIMLHw988MIPT3zxxp8Oeuiij056G/rtIe2j7CXU02pKdZXaQn6VY8RZscZ6M+e8d9j9neX6/EI9Z5mr1rM5PP3iSo6aXMmIC0vNi84fys0z6jXtr5OZByfHtiV/2DS5be1gcXWv3XP99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6HfPtpeUpy0p1BXqy3VV2oMeVauEW/FHOvO3PP+cRC3n7u9jr1PNXu8UMlme5fj/eTU4WJ8f/ZgMqc3Oe7ywazZYTC/XDOQvY4ayBUfrcfUjvLqXrvn+unPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Dv7ME+2kxwr5K7lBfqzHVWWoN+VbOEXfFnvPez9vGAZfUccUw6/eFb9VroduH8oG3y3Hd4sv1Pe6lA9nkH/V9/h79OfbRvhxwQl8Oqvbl/rnl1b12z/XTnx17fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pehn7rwZmCfbW9pf2V+KnOVmuqt9Qc8q7cI/6KQdahuWg8cLJef/Cl4WI9335BOd5HXz+Qa28rNffVffcs6s3ClT3ZcMeetGxQ38s/311c3Wv3XD/92bHnhz9++YcDDy58PPDBCz888cUbfzrooYs+Oult6FcjOlexPuyv7THts+w11NtqTnWX2kP+lYPEYbHIejQnjQtubx0+VKzjxz47WMzt/bfuT98/evPlv5Ra9/pgd9bt1pWf/74zWyzpzK17l1f32j3XT3927Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oehv6nas5W3K+4ozBerHXtN8SS8RVtaf6Sw0iD8tF4rGYZF2am8YHx56ewWIOH/STcryN769/1ZVJ53XmorM7Ulu9MFuPX5ielQuy/7kLiqt77Z7rpz879vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvQ39zhblR2dM6iZnDfbb1o99l72H+lstpg5Ti8jHcpK4LDZZn+aoccLVeq6s7ckbi7sz5cXO/OCojkLjNs/Pz7vPz8vslnlZe217Tjmtvbi61+65fvqzY88Pf/zyDwceXPh44IMXfnjiizf+dNBDF3100tvQ73zVGaNzNvnSeYszB/tue0/ryR5EHS7eqsfUJPKy3CQ+i1HWqblqvHA+ebC7mNvG9dMjF+S5o+fl9S3b88QTc7LrO21ZfnBbtusvr+61e66f/uzY88Mfv/zDgQcXPh744IUfnvjijT8d9NBV6KvrpLehv6iPl5dz33mbMyf5Uy1h/20Pah+25v13K+aoy9Qm8rMcJU6LVdarOWvccP/+koVZtmR+Mc5bXj8nHxrZlocvbc2pZ++QO59ryayrWoqre+2e66c/O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ70N/eKhGlG97MzRuZs54/xFPlVf2Yvaj9mTWG9qU3FYjSJPy1XitZhl3Zq7xo+Gk7vai/G97uHWQusvBmbl3n/MSN/0Gbnyse2Lq3vtnuunPzv2/PDHL/9w4MGFj0dRY19S7pnwxBdv/Omghy766KS3od+3BuftzpzFSfWz8zdnUM5hzKWivm8r93HF3mRlue7VaWoV+VrOErfFLuvXHDaOtBy4uDXPvzUrtRUzsu/107PZ9Gn50rSpueyuKcXVvXbP9dOfHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96GfvsjtYFzd2fP6qbirLIeP51FOY9xJmFfbo7Zn9mjqNPVqtaj2CRvy13itxhmHZvLxpMm47zs6GnZdPSUHN4yKdc8NyFj/mNCcXWv3XP99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6HfNyffXXx7sH9WMziHdRbpPE59La46m7A/l3PkX3NPva5mVbdZn/K3HCaOi2XWszltXGl757OTC82bjh6f14/aNiOeHltc3Wv3XD/92bHnhz9++YcDDy58PPDBCz888cUb/+JMtVbWQvTRSW9Dv3MS357kRzHCOby9pPNYtYRzOfWVetsZRbEfq+9V7dfkY3W7Oal+U8NYr3KZeC6mWdfmtvGl8fJNxiUbjskDD43OF0aOLq7utZfvZkrRnx17fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pehn57Q9/f1Ii+w/gWoX6WP+2rxBLnc2oM5zRqT/t1e1Zx2N5FflbDquPMVfnc+hXXxTbru5zj4wuttfYP553Zo7Lg9a2Kq3vtnuunPzv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Df3qIfsj3+HsGe2ffZNwLu9sWl1tjyG/OqtyXiPmqMPsXe3f7GHEZ7lKPaemkdfNYetZjLPOzXXjTfM9D43M15dtUVzda/dcP/3ZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466W3o9w3aOYlzM9/jfJNSN8kdzuedUTundVap3nZm5dxG/rV/V5PYx4lN6nk1rbittpHf5Thx3ty23s154057Zd3GxdW9ds/1058de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3vXjv379r4//6/N/s9d/zV7/N/v+r9n3/81+/tPs53/Nfv7b7Of/zf79p9m//zX7999m//7f7L//aPbf/zT777+a/fd/zf77z2b//W+z//672X//3+x//9Hsf//T7H//1ex//9fsf//Z7H//u/5fc/97aY8tMjBtyyxbPSp/njE6/9xnTP5w+LgcueuEPDVycuYtm5pvvDc9b/TMzJpFLZk01JpPfLAtZ904J70D7Tnn0nl55aX5OW/Mwjy2fUfWje1Mz2udWXVdVy7dqzsbvNKd2w/qyd339+ShGb05ff/e7Hdub9as6M2jN5dX99o9109/duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnob+v3/6Y+OyoX7js7nVo/JT/86Lqf+ZULeu35yxu0xLe88sH3u2n5Wbl60Qzb7zOy81z4nL70wN7NPmpcJb83PtE8uzE++3ZGNL+nMTy/qyosndWf7T/bkgg17c+pFvfngjL50L+vL22/1ZeaO/Tnsm/3Z54r+fPk3/bnunvLqXrvn+unPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Dv/ehbcwjY/K3yeMztmdizpw2Jfs/NS03HDkjFz06K7uPa830eW3Zecrc7PBSvaY6uxzvLY7vyEu3dubWZ7qK8ZrzWE8xnm2H9OX+rfuz6U/6s9mkgbx76kBe+fNA7pg+mI/tOZgtvzGY7y4dzIYXlVf32j3XT3927Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oehv6zQnvxbOzPluvDfaakifmT8+PH5+RSz7fki2ubc24x9oy5Ym5OWbVvJxyxILc9oGO/Ozozvz2jq78/M3u/O1fejN3o75s8kRfwfn2RQP59V8HsvjAwcx5eDBDXfU9c72Ouades098LTnkw0PpnDmUO9rKq3vtnuunPzv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Df3Whbnh/eiz9hPTs3jrmbn68pY8NXp28tk5+dDB7bl2z/k5ZWp9zH/bkduqXalcUo53+9reYs7u+Hh/7v3pQDGO+78xmPtPKLXevetQ+n86lJteGMqn6zX8xjvV9wX7Deego4ez0ZLy6l675/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvQ7/YYH2YI96Tvotub8mFO87Ody+ck8/e2Z5P3z0/f710YU79XDnXrUcxq3t1X7F+f3HNQDGHjVvbg8nPvzSUbz80lOMGhtN+Vv2/h4bz51H1vetAJZvvXcm+R1cy6+RKbvhOeXWv3XP99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6FffBQjrBNzxftiI67e9mZ7jtpqQTZ/Z2Gx3sRj8VlsavlcvXbZvxzv7eqv+4AX69rPGMph40ruX3lzOGs/XsnqMyvZ565Kjn2zkr3HVTO0sJoP7ljNEbvU9/afKa/utXuun/7s2PPDH7/8w4EHFz4e+OCFH5744o0/HfTQRR+d9Db0yxHipFhhvZgz3hvbNdMXFDnnyHc7s8nPuzO5vTeLf9hXxG3r8qQnB7N2VbLw+HJun3jVcJ6ZXo7rRx6tZNrEUmPLidWsuaia9pXV3P5f1Zz+x2o+Xt/zn/h4eXWv3XP99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6FfnpQrxEsxw7oxd7w/Pp4c1ZVX7usu8vNuf+or4vJh1cGc+NEUsct6NT4vTKqkZ2k5zsZz0cnVnH1DNVs/XM1fX6/v8zerZdzoWq7arpaXptRy0/Razt2+vLrX7rl++rNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTS29CvVpAv5QxxU+ywfswh75Gvl44tY5w4bP3dWt+jPfS1cn0/9dxwsX4Pe7GS03aqz+Ozq5l9d6n5vf9Xahs5u5ZT22vZdV4tE+rXwTl13bPL8y9X9xPef66f/uzY88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530NvSrl9QM8qbcIX6KIdaRueR98vns3gNFvp5yY4r4LG6bk5veWMnOLeU4mcOHr62mbdta7t+hlo66nrFz69pm1vKL8bVMquvp2biWs+t9PlXXNfPV8upeu+f66c+OPT/88cs/HHhw4eOBD1744Ykv3vjTQQ9d9NFJb0O/mlHdpHYo8vvUMs6LJdaTOeW98i0/b/Lroaz4URnbOp6oFOv03CurmfJSNQduU8sRreU4zqvznlPnvfeGtax6tprN76zmrquqmbu0mhF1DacfU82Pv1Ze3Wv3XD/92bHnhz9++YcDDy58PPDBCz888cUbfzrooYs+Oult6Fc3qx3VT2oIeVQuEU/FFOvK3PJ+YVzy4+EiVxXx/NBqdr2jmskblevYeD1Z5zumztO40rJiWTX//4BqNuqp5votq+n830ouuLc+bqsrOeem8upeu+f66c+OPT/8Pfn+fIIDDy58PPDBCz888cUbfzroKeqDuj466W3ot3dQP6sh1VFqCflUThFXxRbryxzznmHtM6KaLY8v4/YPtyrXq/U7cWI5t9vq3G4+tZqxlfocX1sfnxX1NXJwJTvNreSH79brnT8N561bh/PeTeXVvXbP9dOfHXt++OOX/wnvxwe48PHABy/88MQXb/zpoIcu+uikt6FffrSHUEerJdVTagp5VW4RX8UY68xc875his/i9Rvvx7IrR9Wy35/LcTtzx3Kc//7tSsZMqRQar913OGM/XNd531Ceu6he431jKI8fVV7da/dcP/3ZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466W3ot4e0j7KXUE+rKdVVagv5VY4RZ8Ua682c895hXzO3XJ/3bVor5qr1bA4vPa+S57et5PClpebbzhlK6+Sh3HVzsmy/5MUZSXWDZMHrg8XVvXbP9dOfHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96Gfvtoe0lx0p5CXa22VF+pMeRZuUa8FXOsO3PP+8dB3N7zljr256u55y917N3L8f70dsPF+I77Q3LJguTlHw9mYX1/N3v1QO49dCATMpAN5pZX99o9109/duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnob+p0l2E+LEfZVcof6Wo2pzlJryLdyjrgr9ox8P28bB1yureOKYdbv50+o10Krh/Ifr5fjevy/D+a0Cwdy9Mv92fcz/Xnxj3155Oi+PNbfl1pLeXWv3XP99GfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6HfenCmYF9tb2l/JX6qs9Wa6i01h7wr94i/YpB1aC4aD5ys1w33Gi7Wc8fScryfv3Ig01aVmq/asC9X/mtvLlvRkyPTk/PXdmfE093F1b12z/XTnx17fvjjl3848ODCxwMfvPDDE1+88aeDHrroo5Pehn41onMV68P+2h6z2MfV9xrqbTWnukvtIf/KQeKwWGQ9mpPGBbeDvjpUrONPLhos5vYjI/tz9cu9+VPdN633fqA7h+3Sle3u7MySozozb4/y6l675/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvQ79zNWdLzlecMVgv9pr2W2KJuKr2VH+pQeRhuUg8FpOsS3PT+OB4xfzBYg4/dkE53sZ3/s1dOfPMzoz6fkdW3rgwJ49emCtWLMjDZyworu61e66f/uzY88Mfv/zDgQcXPh744IUfnvjijX+xb3ywjAP00UlvQ7+zRfnRGZO6yVmD/bb1Y99l76H+VoOqw9Qi8rGcJC6LTdanOWqccLWeb3itJwcc2J2zn+nMRos7Co3feWp+Dn16Xi6eOi9fvaI9b53UXlzda/dcP/3ZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466W3od77qjNE5m3zpvMWZg323vaf1ZA+iDhdv1WNqEnlZbhKfxSjr1Fw1Xji/0dVdzG3j+ptNFmSPw+Zlv83a86mH5+R3/2jL2K+05YyO8upeu+f66c+OPT/88cs/HHhw4eOBD1744Ykv3vjTQQ9dhb66Tnob+ov6+KJy7jtvc+Ykf6ol7L/tQe3DrC/1uJijLlObyM9ylDgtVlmv5qxxw33E0Qsz8uj5xTh//co5+dYmbfn4Ra1Z+70d0vdUS86/rKW4utfuuX76s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNLb0C8eqhHVy84cnbuZM85f5FP1lb2o/Zg9ifWmNhWH1SjytFwlXotZ1q25a/xoeLO9vRjf6Q+0Flp36JqVoVdm5OoJMzLxT9sXV/faPddPf3bs+eGPX/7hwIMLH4+ixl5W7pnwxBdv/Omghy766KS3od+3BuftzpzFSfWz8zdnUM5hzKWivp9Z7uOKvcmKct2r09Qq8rWcJW6LXdavOWwcaXn0gNbs9dqsrLx8Rv7nyuk5dsK0PLDd1Iz9zZTi6l675/rpz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvQ7/9kdrAubuzZ3WTM0jx01mU8xhnEvbl5pj9mT2KOl2taj2KTfK23CV+i2HWsblsPGkyziMPm5ZjtpySZ6ZOypSnJuS7h00oru61e66f/uzY88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530NvT75uS7i28P9s9qBuewziKdx6mvxVVnE/bnco78a+6p19Ws6jbrU/6Ww8Rxscx6NqeNK22HLJpcaD5my/HZb/G2OfzRscXVvXbP9dOfHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96Gfuckvj3Jj2KEc3h7Seexagnncuor9bYzCvHWXtV+TT5Wt5uT6jc1jPUql4nnYpp1bW4bXxrHr9s21739kXz0/tG5b5PRxdW99vLdTCn6s2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNLb0G9v6PubGtF3GN8i1M/yp32VWOJ8To3hnEbtab9uzyoO27vIz2pYdZy5Kp9bv+K62GZ9l3N8fKH1ppYP55AZo7L8pa2Kq3vtnuunPzv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Df3qIfsj3+HsGe2ffZNwLu9sWl1tjyG/OqtyXiPmqMPsXe3f7GHEZ7lKPaemkdfNYetZjLPOzXXjTfPg/SPz2llbFFf32j3XT3927Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oehv6fYN2TuLczPc436TUTXKH83ln1M5pnVWqt51ZObeRf+3f1ST2cWKTel5NK26rbeR3OU6cN7etd3PeuNN+45sbF1f32j3XT3927Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9OeteP//r1vz7+r8//zV7/NXv93+z7v2bf/zf7+U+zn/81+/lvs5//N/v3n2b//tfs33+b/ft/s//+o9l//9Psv/9q9t//NfvvP5v997/N/vvvZv/9f7P//Uez//1Ps//9V7P//V+z//1ns//9bzP/+z9giAydeJzt2/ejXFW5/3E6ARIIEggmkJBCej855+T0z5kZRaQEkCQClxap0gQJIAjxAiJNES5NqpRwrxAuXa4UUaRKkS49fOkB5AJKE75457U381cM+WVn773W87w/s9Z6nmetmbPCCl/9e+pra2b884Ny3KJ1c9+yIVk2fMPcOml4dh40Ig/ctUmGbzcm3//tpnnpg/FZOmBS1vh0ctrvnpofHzg9Yz+akWN2npWnl7Tk2Edm554XW/Pmo20Zc1V7rthvTn4xpCNvXdGRq8d05qZTOnPnss4ctklX5m7dlaX7duXuQ8qre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96Gfv9fdOa6+dlG66d/0YY5/eLhOfiCEXlj/1FZ5Wtj89qp43LjixNy2YDJeX+tqXlj+bQ8ddmMbNA1K6tf15JBq7fm571t+dt323P6gjl5sqsj66zemRNu6czBC7ry8YtdGb1dd169rjvr/qs7O3b2ZMs9erL10T258Kfl1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvQ7/Pw7MV/2PDPPPM8Kz0wYgc9fyobHve2Fw0ZXxOPHNiKo9PztpvTU3bs9MzZMnMrLFlOd5/b2nLU4e3578unFOM14ZndRbjOXRcd257oDvv7dST9//ak9fTm6fP6c21L/Rm5np9+WROXw6d25e355dX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70N/eaEz8W7H689MiOHjM79b4/NqWePz8nrT8rf952SVc6alrXOnZGFh87KDybPzlW/b80Z09tzzeI5OfPajjzzp858/dauvHtOqfnqAb258uLe7DC6Lxue0ZdJ7/Xlxp7kt0clA65KFjyYbPJScu3r5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/dWFu+Hy0eWW1TbPDA+Pzq4WT8sBDUzJx7en5bOzMnL9eS37wXH3Mj27LVZ+3Z8oO5XgPu76rmLMzzu7JzbuV47vtNX25ra3UdNOg/ozbrT+/vqw/Pc/0528rVnLwiEq2n17JO7PLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn6xwfowR3xO2nb8eFJ+9q8pOXT+9PQdOzPdx7fkkZ1bc/Dgcq5bj2LW6EXdxfq9dJ/eYg4bt6G/TM4c1p+DTu/PHh/1Z9gWlQw7vZL77q9k4UeVfDC0mq2nV/O1nmou6i+v7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+sVHMcI6MVd8XvqIq1ddOzO73tuSD25oLdabeCw+i03rDe7Jc5uU473a8r5sd3kydLP+7Ph4qXmbayt5ZZVqrvh2NVsdV833rq1m88ermfS3aj76opp/W6OW+wbWiqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+OUKcFCusF3PG56bv0hdaipyz803teXdhR9Zc3pkdNu8u4rZ1uf+v+vLKocmI2eXc3mevSh5+oVKM6wpnVjPor9VC45D2WpYuqGXYD2q5+t9rWfTzWlrPrGWfs8ure8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96GfnlSrhAvxQzrxtzx+bHx5/vb8/RJHUV+zmndRVze8fPe7PNFXxG7rFfj88TTlYyZW46f8ezoqeXoA2r5/PRaHllay1t31LLKQ7Wc82QtTz1by69fqGXxi+XVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Dv1pBvpQzxE2xw/oxh3yObD01q4xx4rD191+15M6p5fp+4NeVYv3ueHk1P1yplklb1rLB8aWGN+4rtX34ai0HL6+l961aVq9fJ7xR1/1aLQNfK6/uV//yvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29KuX1Azyptwhfooh1pG55PNk8y8b9hb5eq0DU8RncducfO+AatpeLsfbHN7p+lqGPlbLba/UMrKuZ6U369pequXSJ2pZo65nzG31ca236arrWvfK8urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6FfzahuUjsU+b2eQ8RRscR6Mqd8rmzLz+8e0Z/ztilj28hzy/W9eM9a1lpSy/YP1+PZq+U4Dq9zb1jn3vyWWpZcVMsHdfYb96qv8bm1LO+ur/mZtZw6tby699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3oVzerHdVPagh5VC4RT8UU68rc8vnycfJOZQ4r4vn4OtviWta8tVzHxuvPdd4VHy7HlZbzt6vllFG1vPN+NRfeU80ml1ZzwgnVzFtUzTEHlVf3nnuvnfb66c8Oe3/+cj7xwx+//OPAgwsfTry48dNBT1Ef1PXRSW9Dv72D+lkNqY5SS8incoq4KrZYX+aYz5mvLf+nmo9byrh95L3lerV+B/y1nMtD62yXpT6HP6tm3evr47NvfY1sWk3Lm5UceVO93jmtkpcPr+SNg8qre8+91057/fRnhz122V/9y/jAL/848ODChxMvbvx00EMXfXTS29AvP9pDqKPVkuopNYW8KreIr2KMdWau+bz5FJ/F65e+jGVn31/L3HPKcTvqX+V4PttbzYrPlhrP36iSlR7sz5En9efRBfUar6M/904rr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056G/rtIe2j7CXU02pKdZXaQn6VY8RZscZ6M+d87nz/6s1yfd5yRzlXrWdz+CfbVvPYY5XsNLfUfNVW/Vn/mXotfEhy3IjkyWV9mfq7vmy8tLy699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3ot4+2lxQn7SnU1WpL9ZUaQ56Va8RbMce6M/d8/hjE7dphdd/r1/LbC6rZY91qMX7dT5bju8rJycnv9OWvO/VlZH1/t8Gi3tw8vjerf9KTt97oKa7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv6nSXYT4sR9lVyh/pajanOUmvIt3KOuCv2WH/moHHAcn7drxhm/X6zrV4LLerP7kvLcd5zg778cH5vdruiJ1sN7MmTP+/OXdO7c8+HXZn2cldxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0G89OFOwr7a3tL8SP9XZak31lppD3pV7xF8xyDo0F40HJuv1nfUqxXoeOTfFOD62Z28GHVpqPueWrpy9Yld+uW9ndv6kIz+9viPLzyuv7j33Xjvt9dO/mDd1e+yyzw9//PKPAw8ufDjx4sZPBz100UcnvQ39akTnKtaH/bU9ZrGP26ys59Wc6i61h/wrB4nDYpH1aE4aF2zzxvYX63jOgL5ibt91V3fOvaIrf6zbpvXm38/JjmvMyWrHtmevae0Z/rXy6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3od+5mrMl5yvOGKwXe037LbFEXFV7qr/UIPKwXCQei0nWpblpfDCe9XY51++Z112Mp/Hd6JA5Oerb7fnnN9pyyYGtOfCh2Tl739n502bl1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48Rf7xl+WcYA+Oult6He2KD86Y1I3OWuw37Z+7LvsPdTfalB1mFpEPpaTxGWxyfo0R40TVuv5oqs6s93ojhx9YXveGd9WaDzkvJZ89/xZOem5mZm3x8y83FVe3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29DtfdcbonE2+dN7izMG+297TerIHUYeLt+oxNYm8LDeJz2KUdWquGi/ML703p5jbxvW/b29JdeKszP3DjHSdMT3XXT0tK42cliPenVpc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300FXoq+ukt6G/qI8XlHPfeZszJ/lTLWH/bQ9qH2Z9qcfFHHWZ2kR+lqPEabHKejVnjRv25dNa8+G0lmKcv7/n9Bx4+9S0LpiSV74xOZueNyk/3XVScXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29AvHqoR1cvOHJ27mTPOX+RT9ZW9qP2YPYn1pjYVh9Uo8rRcJV6LWdatuWv8aPh/y2cU47v2qVMKrUPem5BJ/zk+5z41LgNOG1dc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29PuuwXm7M2dxUv3s/M0ZlHMYc6mo718q92X2Jupz60+dplaRr+UscVvssn7NYeNIy92jpuQbV03MJQvH5449N833nhqT258cnZWPHl1c3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29NsfqQ2cuzt7Vjc5gxQ/nUU5j3EmYV9ujtmf2aOo09Wq1qPYJG/LXeK3GGYdm8vGkybj/OGEsVl4z6g8/NzIrHXeiBw6cURxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0O87J9+7+O7B/lnN4BzWWaTzOPW1uOpswv5czpF/zT31uppV3WZ9yt9ymDgullnP5rRxpW3BgFGF5oX3DM/cCcOy05lfL67uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv6nZP47kl+FCOcw9tLOo9VSziXU1+pt51RiLf2qvZr8rG63ZxUv6lhrFe5TDwX06xrc9v40rjqzcNywQ1DM/2U9XPL7UOKq3vPy89mVNFeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeh397Q929qRN/D+C5C/Sx/2leJJc7n1BjOadSe9uv2rOKwvYv8rIZVx5mr8rn1K66LbdZ3OceHF1p//fJ6WbBscE5bsk5xde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0K8esj/yPZw9o/2z7yScyzubVlfbY8ivzqqc14g56jB7V/s3exjxWa5Sz6lp5HVz2HoW46xzc9140zzhlIF5fos1i6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+30E7J3Fu5vs430mpm+QO5/POqJ3TOqtUbzuzcm4j/9q/q0ns48Qm9byaVtxW28jvcpw4b25b7+a8caf94mtXKa7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oer8a/6/W/1fx/6v83+z1X7PX/82+/2v2/X+zn/80+/lfs5//Nvv5f7N//9Ps3/81+/e/zf79f7P//qPZf//T7L//avbf/zX77z+b/fe/zf7772b//X+z//1Hs//9T7P//Vez//1fs//9Z7P//e9X/5r7X9tJa+Rn2w3KK28PzoT5Q9J7xtAMv2RYbj9u40zu2iRH3Tc6f56yafr2HZ+Biydm34Mm5+yuqXn+1Wk5fv8ZeeHxmZmzUUte/ubsjJvXmm99qy3HjWrPqi/Xa6aT5+TbG3dk0HkdWX+lzoyeX5/HZ3fmmrs6M/Clzmy6vLy699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3o9/8n11w3b5wxJJe8PTTvrz88j35tRDZ7ZZPsceKYfGPlcRkyb0JWXjwp2x47JZvtNi1tw2bksOtmZu/xLTng6Nn5242t2eovbXn/ofa0Xj8nBx3dkddmdObRhzozf15X/v2+rtQmdOfger6+5dp6LHu2O//99+58/ll5de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0O/z8Gz3NTZMxzbDs3CfEXluu1G5bvDYfHHpuLy55sRcuvnkHLDb1Jy9zfQcOnxm9r1zVjEO37myNW3vtmXAkHKcj1irHM/DL+jKRpV6bfJYd7bduiffvLknc9buzeDte3P6Sb1ZcE1vnri7N1s8VF7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db0mxM+F++eP35EFp88KhMXjs07A8fnrVMm5jsvTc4ea03LfmvPyJ1vzcwjl9T3ka2t+WBJW9b5qD3/GNeRjs7O/GhmV7Zeu9Q8aHFP1tygN787tzdHDOjLyXv1ZciNfdngg77sMyq5uZL8ZH4yeOfy6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3od+6MDd8PtpUjx6b3/WPzydPT8zk2pScdPy07HT+jHx20qw8sm19zP/RmrV+2J5T/zKnGI8jJ5Rz+5cDezK0nrON43Wb9mWjq0ut6x+fnPBUskK9hr1gbn+2OqI/j57ZnxuX9GeLq8qre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96GfrHB+jBHfE7a/uqDiXlj0ZQ88eC0XPzJjFzwz1mZ8cTsPHpCOdetRzHr2Le7ivW70rKeYg4bt8NXS/5Rr9X/snp/7tq/P0f+sT8/Wr2SCankzv0r2fYXlVy9pJJDbqjki5vLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn7xUYywTswVn5c+4upa42fmjp6WbDepXOfisfgsNh1yQne6zinHe69d+3L9sDrj7cktm5earx1XSfWoSlb7YyVLP63kT+Oq+c3m1Zz8vWrmL6rmtsXVjD+uvLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpbeiXI8RJscJ6MWd8bvoO3L6lyDm3T27P1s/Myb67duZ3d3QVcdu6fHCdvlTf7ssxV6aYu/c+359p25fjutua1RywVanxh1dXM/Dhao58vZpBn1TzxMq1nLVmuf91de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0C9PyhXipZhh3Zg7Pj82JqU9c1boKPLzr1ct4/kth/TmvkP7ithlvRqf2XMrOfbucpyN569uqOaFV+r7/AG1zBhTy7fbavletZaPt6ilbdtaVti+lhe3L6/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv61QrypZwhbood1o855HNkq+03nUXMEYetvwG39mX05SnW5+Sh5fq9ZVg1jx9RzUl3VnPYP6uFhs36Sm3zdqrl0V1ruXC3WvauX0/cua7732rZf6fy6n7vL99rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/eknNIG/KHeKnGGIdmUs+Tzann9ZT5Ov9Xu0r4rO4bU5u82olZ3+3HCdz+NYJtRz+rVo22rGWxXU9u+9S1za/lpXq47tvby3HzaqPa73N+aNrOXiT8urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6FfzahuUjsU+X3bMs6LJdaTOeVzZVt+3vp/k0/v6S9i0+K1y3W67Llq9hteyw21Wm7bsRzHo3ao5Yg6929m1LLq+rVsV2cf8kI1P7q7ms3rGp78z2reuay8uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Fc3qx3VT2oIeVQuEU/FFOvK3PL58vHWo/1Friri+YXVXPRhNd+fWa5j4zWxzrl7rRxXWv55XzVvn1PNlvtU8/+7q/nJhtW8/nl93N6u5MXXyqt7z73XTnv99GeHvYlfzid++OOXfxx4cOHDiRc3fjroKeqDuj466W3ot3dQP6sh1VFqCflUThFXxRbryxzzOfO1dFo1C64s4/izPeV6tX733qqcy4fX2Va+uZqFB1dz8IS6lmX1NXJ+Jf+xSyXPTq7k0VUr6X+3P5u93l9c3XvuvXba66c/O+yxy/7eX8YHfvnHgQcXPpx4ceOngx666KOT3oZ++dEeQh2tllRPqSnkVblFfBVjrDNzzefNp/gsXmeXMoZ9WI9V1wyqFeP23KJynDtvqmT3bUqtn53Rn4WV/jzzr2Tmw/Wa8Jpk/JLy6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3od8e0j7KXkI9raZUV6kt5Fc5RpwVa6w3c87nzvenu5Trc1hbOdetZ3P4pXsrmbl5JbfeXWpe665k0dxkyPK+vHJmX1rn9+Xn0/ty9Ojy6t5z77XTXj/92WGPXfb54Y/fT7/8DPDgwocTL278dNBDF3100tvQbx9tLylO2lOoq9WW6is1hjwr14i3Yo51Z+7lS+3i9uXv1H2fUs0G69XH4WfleF+wRX8xvnusUI8ZC/vS/lhvjvlObw57u75PuKgnex/Yk2/vUl7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Db0O0uwnxYj7KvkDvW1GlOdpdaQb+UccVfsmfdl3jYOWD47toxp1u8VS+u10DvJH0enGNe7T+3N4w/25A8b9WTpsd1pXaU7Y6/oyrj9u/KL75ZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70N/daDMwX7antL+yvxU52t1lRvqTnkXblH/BWDrENz0Xhgsl63OLm/WM+L7y7He9bzPTngrVLzxzO68tHhnXlvWb0uObAjr03oyObrllf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvQ39akTnKtaH/bU9ZrGPq+811NtqTnWX2kP+lYPEYbHIejQnjQu2G89LsY7PPaa3mNtju+q6N+rKJgM7C61DW+fklsXt2euTttxzeVuOOrG8uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Heu5mzJ+YozBuvFXtN+SywRV9We6i81iDwsF4nHYpJ1aW4aH4wf7t5bzOFxD5bjbXx//GZ7nvtDW3a8rTUrvjY7D1dn58NlLRnz+5bi6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+It9Y10PXfTRSW9Dv7NF+dEZk7rJWYP9tvVj32Xvof5Wg6rD1CLysZwkLotN1qc5apywWs9fjOrM9efOyQvrtWfLi1oLjY8Nbsn/rDsry7edmZuenZHK9TOKq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOFOXvPKea2cV17dksuu3hmrmmbkfMHTM/gsdOy8KypeXqPqcXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXYW+uk56G/qL+vihcu47b3PmJH+qJey/7UHtw6wv9biYoy5Tm8jPcpQ4LVZZr+asccO++ZLZmbdkVjHO9z83LQ+1TM1ZD01O9bZJ+engSXntyYnF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvQ794qEZULztzdO5mzjh/kU/VV/ai9mP2JNab2lQcVqPI03KVeC1mWbfmrvGjIbvNKMb3wJWmFFoP3WtCTt54fD7eclz2WXVccXXvuffaaa+f/uywxy77/PDHL/84ihq7zoUPJ17c+Omghy766KS3od93Dc7bnTmLk+pn52/OoJzDmEtFfT+/3McVe5Nl5bpXp6lV5Gs5S9wWu6xfc9g40rLpuZNz+aiJWfGZcRn5/Nj8acsx2XjL0Vn491HF1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvQ7/9kdrAubuzZ3WTM0jx01mU8xhnEvbl5pj9mT2KOl2taj2KTfK23CV+i2HWsblsPGkyzvMuHpM7u0dl2nYjs9/gEXn84o2Lq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn7fOfnexXcP9s9qBuewziKdx6mvxVVnE/bnco78a+6p19Ws6jbrU/6Ww8Rxscx6NqeNK203H7NJofnO7uG55qKv59Y1v15c3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29Dsn8d2T/ChGOIe3l3Qeq5ZwLqe+Um87oxBv7VXt1+Rjdbs5qX5Tw1ivcpl4LqZZ1+a28aVxz6nD8tnEoTltxfUzbPaQ4ure8/KzGVW0109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Lc39P2bGtH3ML6LUD/Ln/ZVYonzOTWGcxq1p/26Pas4bO8iP6th1XHmqnxu/YrrYpv1Xc7x4YXWFXZYLzfPG5z/Hb5OcXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29CvHrI/8j2cPaP9s+8knMs7m1ZX22PIr86qnNeIOeowe1f7N3sY8VmuUs+paeR1c9h6FuOsc3PdeNN84ooD03XnGsXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Dv++gnZM4N/N9nO+k1E1yh/N5Z9TOaZ1VqredWTm3kX/t39Uk9nFik3peTStuq23kdzlOnDe3rXdz3rjT/sW4VYqre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meugp9D5XnQl+N/1fr/6v4/1X+b/b6r9nr/2bf/zX7/r/Zz3+a/fyv2c9/m/38v9m//2n27/+a/fvfZv/+v9l//9Hsv/9p9t9/Nfvv/5r995/N/vvfZv/9d7P//r/Z//6j2f/+p9n//qvZ//6v2f/+s9n//reZ//0fgE/MX3ic7duJu1xVlfdxiLyCEsZAIJCQm5B5vjfJzZ3rV1WggAwBBWUUFQQZZAaDElEgBCKTgCKT2AihAW0ZfGlmEJVWmecZEQRF6BYlgHkZ3vM5h+p/osjz8BzOOXuv9f3V3nuttXfVXWWVj/4Nv22N7HXy8NzUsW7eP3VENrx7ZP7x6Kic/Z+jM+zQsdnpvXH5yZcmZOTFk/LidVNS++m0HHzojFw7alZ2+8nsXL9GZ9bZsSs3fnNu3j1lXjY7bn523aU7z4xckN/cviAdO/Xkpft68lp3b/51am+u/kNvlvyrNy9u0Jd3x/SVV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf3+/6raurn17hE5pmOj3L3NJrni02MyZuOO9N06PqN7JubVUybnqeumZsoN07PZuTMzfIfZ2e7lORnaoytbXDs3v/7rvExYrTt3D1uQ4a8syJbX9uSWfXtzxbC+zDy1L194ry+b7tmfra7sz1l/7s8J6wzkxCkDeXhOdXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29Lv8/CsZ2ijrHvSJum9aEyuPbkjS7fcPI88PjG31aZk0eJp2eLcGTn4pFnZZuGc5O3OchymPj8vwzfvzvNbVeO8Q6px3e7Bvvzz6P5MWn0gk08YyOjXBrJOczCvLB3M/rcNZtZLg7ly5WDGDRsqr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rNCZ+Ld9feOCa73N6RVX64ee6qT8qdd0zJ1A2npz8z02jOznljO7P8sa688LV5+a+n5ufP0xbkD7v3ZN1DerPwq32Z2Kw0v3jdQP64zWDOuHcw2w8O5UsXDOVvfxnKa5NqGdqlltOOqWWXZbW8fFZ1de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0m9dmBs+H202uXbznHH0pNy/1tQMWzQ9e984M10PzM6Dt3Xm8iXFmE8t/C3vzldWq8Z74Z7V3P5qfSCvr1mN48m7DeUfLwyVmv72n7XsuWby2PbJEScmm/8sWf67ZNlTyfg/Vlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS39YoP1YY74nLQ9ZPLU3Hbl9Fy56qwcPXNOjpjdldU/MS9X3Dy/nHvWo5i1a0d/uX6fHFHNYeO2XX8tv/9NLZcNJBf8JFn4VvHfQD0fHFnPeT+pZ8pd9Zz4VD1b/aWeR1+rru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rFRzHCOjFXfF76iKt/2n1Ozj28K1O+WK1z8Vh8Fpu2vrk/690zUI7LwDlDWbpDLdv/o5YzF1eal+xezya/qOfZFfWcMKuRH+3eyLcXN/Kl8xqZcWUjZ1/fyPs3VFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS39coQ4KVZYL+aMz03fF5d2lTnnnL27M2HtnuSc3pz5Zl8Zt63LS7cYyqiOWj73fK2cuxevV89qp1Tj2l1rpPndSuM2f2rkT8OaWbhpMy/NaOaqnmYOqjVzcb26uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Zcn5QrxUsywbswdnx8bqx7VnXXm95T5+Zi+/jIun7l8MBf/+1AZu6xX47PmifXsurJejp/xPPQvjVy3cTNdg82s/oVmxh3YTN83mrnv+GaGL2nmsaXN/PKU6urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6VfrSBfyhnipthh/ZhDPke2hj/XW8Yccdj6e/5/hvLOE7VyfQ7btlq/Z+3QyJU/a2TvtxvZdnalYbMjK23Tz2zminOaOfLcZgaL6xe/38zjxbPmmdXV/eCH77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pV+9pGaQN+UO8VMMsY7MJZ8nmx//9UCZrxujqngubpuTk0Y1ctBp1Xibw2ft2cx2xzXzz9Ob2bnQ03N2oW1ZM09+u1kE+GZ226+Z64s2h3++mU/vXF3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Lb0qxnVTWoH+VMOEUfFEuvJnPK5si0/T5yQPPD/UsamnZvVOv3lus3UFzZz6qJmzj6jGscdC+7tC+7j923mma2bmTqzmb+tV6zxlY10FBqueqaRu56oru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rVzWpH9ZMaQh6VS8RTMcW6Mrd8vnzc+fEqV1mPxz/UyFHTinH7arWOjdcqBWfPompcaXnwvUZ+dU8j4y9q5OHDGvn8do3c0tnIso7ic9ukurr33HvttNdPf3bYY5d9fvjjl38ceHDhw4m3jFNvVnmBHrroo5Peln57B/WzGlIdpZaQT+WUMq4ur9a7OeZz5uuErzQy6/lGGbevObxar9bv0HerubxdwfbU3xrpvbyRrfYstGxQzNkH6jng7Hqu2bueK/rq2XjzejbbtLq699x77bTXT3922GOX/cEP4wO//OPAgwsfTry48dNBD1300UlvS7/8aA+hjlZLqqfUFPKq3CK+ijHWmbnm8+ZTfBavR55dxbB7ili1pFGN9zVXVuO53qv19JxUaXzo7qT3mOQXBcIaH0v2eKmW956slVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS399pD2UfYS6mk1pbpKbSG/yjHirFhjvZlzPne+7z+7Wp9vHFDNdevZHL7h3XrWWFzP91dWml54p5ZtTyxq4TG13PS7oay5bCj77DOUz32+urr33HvttNdPf3bYY5d9fvjj9/4PPwM8uPDhxIsbPx300EUfnfS29NtH20uKk/YU6mq1pfpKjSHPyjXirZhj3Zl7Iz/ULm4fO66ZXe5o5LVPN3L+LdV4H3F8yvHtn1/LnT8cylqrD2XnYn+3Xcdg/vuhgQxeWsTUs6ure8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96WfmcJ9tNihH2V3KG+VmOqs9Qa8q2cI+6KPdM/zNvGActDN1QxzPo97oWiFhqXnPf5WjmuF9xZ7HVXHcwPdyz2+TcUubm3Pyuf6st7l/Rl39Oqq3vPvddOe/30L+0U9thlnx/++OUfBx5c+HDixY2fDnrooo9Oelv6rQdnCvbV9pb2V+KnOlutqd5Sc8i7co/4KwZZh+ai8cBkvY6/vVrXu6ysxvsT6w2mOXag1Hbfvn255+re3L1Bb865tCe37NmTjk9VV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf1qROcq1of9tT1muf8u9hrqbTWnukvtIf/KQeKwWGQ9mpPGBduy+6v1fch1g+XcXnlIoXvHvrzt3KLQ+vrXFuSs67szOLM7Fz45PzveOr+8uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Xeu5mzJ+YozBuvFXtN+SywRV9We6i81iDwsF4nHYpJ1aW4aH4z3/KCa6++t0l+Op/H97JgFuWbF/HS+MS+Pj5qXy74xN/dsMDcr/9FVXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBVns0UOult6Xe2KD+WZ0xF3eSswX7b+rHvsvdQf6tB1WFqEflYThKXxSbr0xw1Tlit50d36c0p9y7I9Vt1Z/zDleYrtuzKGZ/qzO1L5uR768zJqFdml1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS39zledMTpnky+dtzhzsO+297Se7EHU4eKtekxNIi/LTeKzGGWdmqvGC/PICxeUc9u4/nn/rhz7yJwsOXB2Dh+clVe+MDM9v5+R//jRjPLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLelv6yPh1Vz33mbMyf5Uy1h/20Pah9mfanHxRx1mdpEfpajxGmxyno1Z40b9o6n5mbGU53lOF+y7qz8dP8ZOWjY9Ix6Y2r22HJqbv5kdXXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29IvHqoR1cvOHJ27mTPOX+RT9ZW9qP2YPYn1pjYVh9Uo8rRcJV6LWdatuWv8aNjo3Nnl+G65YHqp9TMXTM7eO03Kfd+ZmFrfxPLq3nPvtdNeP/3ZYY9d9vnhj1/+cZQ1dsGFDyde3PjpoIcu+uikt6Xfdw3O2505i5PqZ+dvzqCcw5hLZX2/rNqXlXuToj63/tRpahX5Ws4St8Uu69ccNo60vHvPtHxzlyl5fK1JWbHuhJz/nfH55/Hj0jtlXHl177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvSb3+kNnDu7uxZ3eQMUvx0FuU8xpmEfbk5Zn9mj6JOV6taj2KTvC13id9imHVsLhtPmozzjEfG57zDOrLayZulseWYXPnI6PLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLel33dOvnfx3YP9s5rBOayzSOdx6mtx1dmE/bmcI/+ae+p1Nau6zfqUv+UwcVwss57NaeNK2+nXjS01/+iwTbLk4Y3z/drG5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0u/cxLfPcmPYoRzeHtJ57FqCedy6iv1tjOKcj9W7FXt1+Rjdbs5qX5Tw1ivcpl4LqZZ1+a28aWx/8uj8tBeI7Nv9wZ5Y/8R5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0u/vaHv39SIvofxXYT6Wf60rxJLnM+pMZzTqD3t1+1ZxWF7F/lZDauOM1fl83L9FnFdbLO+zXHjTOtjp62f009dJ79duHZ5de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0q8esj/yPZw9o/2z7yScyzubVlfbY8ivzqqc14g56jB7V/s3exjxWa5Sz6lp5HVz2HoW46xzc9140/zF7jWz/ttrlFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100Ucnvf9b/4+pznmcm/k+zndS6ia5w/m8M2rntM4q1dvOrJzbyL/272oS+zixST2vphW31Tbyuxwnzpvb1rs5b9xpf3T3j5VX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70fjf9H6/+j+P9R/m/3+q/d6/923/+1+/6/3c9/2v38r93Pf9v9/L/dv/9p9+//2v3733b//r/df//R7r//affff7X77//a/fef7f7733b//Xe7//6/3f/+o93//qfd//6r3f/+r93//rPd//73o3/t/W+3a1bPVceumdU3WCfbLl4/X75pw9R+t3FeuGrT7PCVzfLjv3fkvz+3efY5a2LmLJ+c0344NTd9pdg/rDWzqFWLuuLd2dlji858/JBib3Xc3Bx0aBGLtp6fqZ/szvrXdefrWy5I568WpHdaTz61uCf/uq0nD7/Wkzlr9Gbr9XrLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln7//6+udbLmzevnNyNGZsOhUVnRNzoHrjk2S38xLl+bPiE9x03K5OVTctSV03Lg0hnZrTEr5z85O8t26MxZl3VlvWfn5rC352XDt+Zn16e6c/ZlC/KJXXuyYkVPjj2uN5f9vTf7L+zLuRf15bkn+vLAsP48tGl/OiZUV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf0+D89O6hyZPb8xKkvOHJ0Pjh2bR3vGZ/wfJmT43Mn57WFT8/2l03PTN2bmvCK/nPbqnHIcjnlobnYbOT8zBqpxvnBuNa4X/Lo3OaAvR6zsy1FF/D7g+f7s0T2Qed8ayC+vGcg3Hx/IO68P5JAV1dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0u/OeFz8W6Vn43OpdeOzXanjs+68ydm7esn55g1pmXp3Bk5o3tWXl5/Tt78XWdm7zk3I++bl7mbdWfjHRZkzy/35KJde3N4d6W5c3l/Zg0N5Nk7BnLhnMH8/PTB9DwzmL5NhvK9rYfy9AFD+eniocw7qbq699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3pty7MDZ+PNvtdNj7Pfm1iRq86JTscNC0/u3pGvn3XrIy9ttC+qBjz0YW/C+bnF293l+Nx8cJqbl8/rz/9H/SX4/jodoPJo4Olpt6rixz//lAmNGq5o6hzDruklhW31PLEvbUc8nB1de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0i82WB/miM9J21s3mZI1L56Wd96ckbs6ZueO8Z353LtdWfHzeeXcsx7FrMtH9JXrV51iDhu3C2YNZeMbh/LP2bX85Zxif/rXWi6anWy7f/LyOcnR/zd58N7kB09X9a+re8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96WfvFRjLBOzBWflz7i6uyirnhx384cvVO1zsVj8Vls+sHP+/LF26vxPvXkwTzWKBj/PJTnDqs0P1LU8ftdmkz7a/LAuHpe2b6eew+r5+fL6jn2onr+uLyez1xVXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530tvTLEeKkWGG9mDM+N33nfKuzzDkvfHZ+Dl91QU4/uSfPvtJbxm3r8u8LBrPfiKH820ND5dx9bbVkp29V43piVz1nHVVp/OGj9cx5q9i/r91IZ0cj70xv5MauRl6bV13de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Lb0y5NyhXgpZlg35o7Pj43t95+fPaYsKPPzr2dW8fy58wfy2oWDZeyyXo3PF45JLn895fgZz1ufrmfV4Y0cP6eRz32mka/v1cjJBzay6ZGN7LaokQnfauRjx1VX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70t/WoF+VLOEDfFDuvHHPI5srXbgz1lzBGHrb8ZLw7mU/cMletzh1q1fp9r1PP2JcU8frWe88dXGg7cr9K26IRGVpzcyJ1LG1lWXK8+qdB9YiNnnlBd3S/78L122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530tvSrl9QM8qbcIX6KIdaRueTzZPOzN/SX+fqM4VU8F7fNySOH13PT8dV4m8PPL2zkgkMbyXcbubTQs2RJoW1xI5OOaOS0rzayfLdiXHds5PZtGjl3q+rq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLelX82oblI7lPl9URXnxRLryZzyubItPx++US1j/qdWxqZLu6t1+rHVGjmj2cjjBzXyx+9W4/jj7zRyYcF97xcamTrYyNEFe8//aeSi1+s5uNDwr/vrWfee6urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Vf3ax2VD+pIeRRuUQ8FVOsK3PL58vH2itrZa4q4/lv6vnVmEZO37Vax8Zr+4LzpIOqcaVlszfqWeeOeg49s55x+9bz09TzyYn1PDGinmFrV1f3nnuvnfb66c8Oe9t/OJ/44Y9f/nHgwYUPJ17c+Omgp6wPCn100tvSb++gflZDqqPUEvKpnCKuii3Wlznmc+brgV3q+eZD9TJuv79vtV6t32VHVXP5goJt8vP1LPlRPecuLLSsUczZu5IbliTvfzZZMTPZd2Ry4NrV1b3n3munvX76s8Meu+wv+zA+8Ms/Djy48OHEixs/HfTQRR+d9P7vBrDIj/YQ6mi1pHpKTSGvyi3iqxhjnZlrPm8+xWfxep8lVQzbZP9GHp5fjfcHF1XjudezyUnfqDSOvbmWJQfU8v7kWnZ+q4ghjw/lM/dWV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lfn2kPZR9hLqaTWlukptIb/KMeKsWGO9mXM+d77HnFytz6G9qrluPZvDq/092fmw5PnXK02zXxvKj44pavv1hrL6rYPZdfFgrvn8YH6yTXV177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvSbx9tLylO2lOoq9WW6is1hjwr14i3Yo51Z+75/DGI2/+1QbE2r6unr78Yh/+oxvuOI2rl+C6dMpS1lw1m95UD+bdvDuT8EUUd/9v+LPtBf76+pLq699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3pd5ZgPy1G2FfJHeprNaY6S60h38o54q7Ys+jDvG0csIy9qoph1u/vHylqoQ1q+fM2Q+W4/vX6gbz9Zn9e2qI/D17Zl11n9GWr+3qzzTm9ufb46urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpKH/XV+iij056W/qtB2cK9tX2lvZX4qc6W62p3lJzyLtyj/grBlmH5qLxwGS9HnJtrVzPl75ejfcuqw3krPX7S22bFrY3uaQnG6zRkxd+sCCf2HFBDu6tru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056W/rViM5VrA/7a3vMch9X7DXU22pOdZfaQ/6Vg8Rhsch6NCeNC7YnflWt71suHyjn9lZfKXRv2Zst5vWUWvv37M5zy+fn1I75efWeefnxL+aVV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf3O1ZwtOV9xxmC92Gvab4kl4qraU/2lBpGH5SLxWEyyLs1N44Nx1KkD5Rze5s1qvI3vJet254O/zMvil+Zm4lpz848DuzJqja58+uXO8urec++1014//dlhj132+eGPX/5x4MGFDyde3PjLfeOsKg7QRye9Lf3OFuVHZ0zqJmcN9tvWj32XvYf6Ww2qDlOLyMdykrgsNlmf5qhxwmo9j9+mJ4/d0Z1VB+bn0N9Wmt/q6cwzvXOy1rGz8+Sw2fnqU7PKq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOFeZ8zusu5bVy79ujM3XfPzsN7zcrtc2Zm3rYzsuTW6Xn3e9PLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrpKfYVOelv6y/p4RU85N5y3OXOSP9US9t/2oPZh1pd6XMxRl6lN5Gc5SpwWq6xXc9a4YT/43q4sundOOc6vf2xm3th9em5cMTX7vTQl/94zJZ94f3J5de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0i8eqhHVy84cnbuZM85f5FP1lb2o/Zg9ifWmNhWH1SjytFwlXotZ1q25a/xo2HfprHJ8vz9tWqn1vNMn5edbTszooybkezMnlFf3nnuvnfb66c8Oe+yyzw9//PKPo6yxCy58OPHixk8HPXTRRye9Lf2+a3De7sxZnFQ/O39zBuUcxlwq6/vF1b6s3JsU9bn1p05Tq8jXcpa4LXZZv+awcaRl6zum5ndbT87EVSemudrmeeXIcakf2ZElm3aUV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Lf32R2oD5+7OntVNziDFT2dRzmOcSdiXm2P2Z/Yo6nS1qvUoNsnbcpf4LYZZx+ay8aTJOC+6e1xe3mdsdjp2TM7oGZ237960vLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpben3nZPvXXz3YP+sZnAO6yzSeZz6Wlx1NmF/LufIv+aeel3Nqm6zPuVvOUwcF8usZ3PauNL29OWblZpf3mdUHv7tRnm+a6Py6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pd85ie+e5Ecxwjm8vaTzWLWEczn1lXrbGYV4a69qvyYfq9vNSfWbGsZ6lcvEczHNuja3jS+Np+y8cTp22jDXTR2RoT3WL6/uPa8+m7Fle/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peln57Q9+/qRF9D+O7CPWz/GlfJZY4n1NjOKdRe9qv27OKw/Yu8rMaVh1nrsrn1q+4LrZZ39UcH1VqnfCd9fL0cWtnxBZrlVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvS396iH7I9/D2TPaP/tOwrm8s2l1tT2G/OqsynmNmKMOs3e1f7OHEZ/lKvWcmkZeN4etZzHOOjfXjTfNV0/9ZPZ+dfXy6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pd930M5JnJv5Ps53UuomucP5vDNq57TOKtXbzqyc28i/9u9qEvs4sUk9r6YVt9U28rscJ86b29a7OW/caR+/w7Dy6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omgh65S34rqXOij8f9o/X8U/z/K/+1e/7V7/d/u+7923/+3+/lPu5//tfv5b7uf/7f79z/t/v1fu3//2+7f/7f77z/a/fc/7f77r3b//V+7//6z3X//2+6//2733/+3+99/tPvf/7T733+1+9//tfvff7b73/+287//D/yJQsx4nO3bibtcVZX+cUABGcOYiSRkHu5N7r2581RVb9BGZYpMEmZkVAaBCArSgj4SkFFRIDImBmUSbBrt/IgyNRiBnwIKqCiThAABRLQJoM3U9TmH+iuKPA/P4Zyz91rft/bea629q+4663z4b8JhG+T42Rvn1ys3yxYdW2bGsdvkI6eNyo8OHJttth2fw5dtn1s3mJyZH5+atQumZ/dPz8wZ27bkl3e25tgd5+RXN7dl4pvt+f8T52bz9s50TO7KMW935W+/6M4fD+9J51s9eeNLvXn3id5s3NGXO0/oy+Kr+7J2RV82u7e8uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Pf/d6zeLA8fu2XOWblN/vTaqKz469i03zE+uxw6MW1PTc47bdPyyoIZGThgVtoHWzNh7ewcdF5bPrNuR/beZ25+f2Fnem7oyp+u687483uyzz69eWjjvvz8ur7U2vtz9LL+zF5vIPvOH8iycwdy8c8GcumDA3n+9+XVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Dv8/Ds52e2yaTW0Znpx22y72zJ+SylyfmhX+fkt+unpZzp8zMZwdbcnrL7BzwxpzsfmU53kNndmbC/V35+6vdxXgd8nxvMZ4Hf7k/Hx03kP6bBjIwczBtFw1m4prB/HPOUL562FByzlBuXzKUruvKq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHroKfc+Vn0FDvznhc/Hulwdtl6MOn5AthyflsRem5JEjpmfo5zOz6/Mt2XPN7Nz4y7bcdlpHXt+8M38+oytvPdydJ9fpzaRt+vK5TfrTu6a/YH5jwWD+57XB/GDhUA5ZNZSFGc47FwznvV8P5zNvD2fJuEo+31HJP3vLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn7rwtzw+Wgze59J+cF2U/PsrdOz9YRZOfGg1nz85Dl57rD23NZaH/OHOvP6Lt056YZyvA9dr5zbp7wwkPdvGSzG8bL3h/LRs0ut7x5YyfG3VLLm9UoWzaqmZ49qVnyxmivPqKZ7UXl177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvQLzZYH+aIz0nbb/xmeh6ePyu3X9uasx+ZkzMfa8/on8zNikPKuW49illHr+wv1u/Ltw0Wc9i4HfyX4Tx5dCX/79lKbtqxmkOvqP/3bDVbjq3lxh1rGfx8LZeeUct+F9TywkXl1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvQ7/4KEZYJ+aKz0sfcfX1ddpy3aiODH60XOfisfgsNu1/yECmnFiO924Dw7l8bX3OLq5k2ZSS/fvr1NK6dy2vXV7LJY/W8uN1koumJAsrSXV+8sN9ky0OLK/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv65QhxUqywXswZn5u+a+d0FDnn2vW70/vTnuwx0JcfXNZfxG3r8mcvDaV15XCOPLOc27csr2ZkWzmun1pdy94zSo0HnJ2svS459O7kzd8ldzyVfG11cssL5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/PClXiJdihnVj7vj82NhqbHcm/bmnyM/feqa/iMvLdhnKLbsNF7HLejU+42bVcsyScpyN5zcuSFbekXxiVTL63aRzi3nZZfy8PDNtXia0zsuaOfNyX1t5de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0K9WkC/lDHFT7LB+zCGfI1sTvtlXxBxx2Pr7+8XD2fj0cn1v/Y9qsX6Xra3lF3vU5/GVyUGPlZo7xpTaKj3zsmJgXs4anJf59esJffPyUv3ZXj3l1f38D95rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/eknNIG/KHeKnGGIdmUs+TzZHfWGwyNd73jlcxGdx25zsv7OW0zvLcTKHr1lvXg6ePC8f7Z6Xo+p6duqva+uYl5enzsvuo+flmE3nZWW9zTffSfb93xRX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70N/WpGdZPaocjvrWWcF0usJ3PK58q2/Nz3QCWrllaL2HTUmlqxTu/7r2TPN5IrJ8zLD7vLcTysa14OqXNftPG8vPq3ZPCR5J3l9TW+JJlb13DHN5LHvlZe3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29Kub1Y7qJzWEPCqXiKdiinVlbvl8+Xjkx9UiVxXx/CvJWQ8ne2xSrmPjtVWdc6cJ5fjS8tyy5NETk+4dkudHJp//n1oe+kMtV62s5Vd3lVf3nnuvnfb66c8Oe1t9MJ/44Y9f/nHgwYUPJ17c+Omgp6gP6vropLeh395B/ayGVEepJeRTOUVcFVusL3PM58zXxR9LameWcfueUeV6tX4/M6Oc2wfX2f76nTr3zsl+6yWrVtTXyMm1nNZfy73r17LimWpa7q+m/e7y6t5z77XTXj/92WGPXfbnfxAf+OUfBx5c+HDixY2fDnrooo9Oehv65Ud7CHW0WlI9paaQV+UW8VWMsc7MNZ83n+KzeD2zv4xhT9dj1eIXy3G7d345zpO/XcunW2qFxtXHVrPTuGru+VMlY66v5IvnVDLijPLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeh3x7SPspeQj2tplRXqS3kVzlGnBVrrDdzzufO97P95fpcr56zzFXr2Ry+/we1jJ1SyzVLSs2vX1XJgbPqNe09w/n1F4czvmM4J280nCPeGSqu7j33Xjvt9dOfHfbYZZ8f/vh99oPPAA8ufDjx4sZPBz100UcnvQ399tH2kuKkPYW6Wm2pvlJjyLNyjXgr5lh35t7MD7SL2+f/qu77iOS9v9Z9f64c7zOnVYvx3fXPw3l0eDjb3zSUo+r7u4NWDub9rwxm/qcG09lfXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvQ7S7CfFiPsq+QO9bUaU52l1pBv5RxxV+ypfJC3jQOW1QekiGHW74Vn1WuhX1VywzvluN58ZH2Pe+1grn9zIJccMJDxT/dn06/3Z8SO/flyZ3l177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100tvQbz04U7Cvtre0vxI/1dlqTfWWmkPelXvEXzHIOjQXjQcm67X78Gqxno9aUo732OWD2fuXpeZnNu7P07v35fEVvbn2U715aL3ezH2lp7i699x77bTXT/9i3tTtscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvSrEZ2rWB/21/aYxf67vtdQb6s51V1qD/lXDhKHxSLr0Zw0LtiuOqlSrONvLBgq5vam2w7kL2/2ZaMXSq3vb96TZft2Z7dHuvKT07ty2KHl1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvQ79zNWdLzlecMVgv9pr2W2KJuKr2VH+pQeRhuUg8FpOsS3PT+GB8emiomMObX1uOt/E94p7u3Ht5V3a4tDMv3Tk3y8fPzdMrOrLJ9zuKq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn5ni/KjMyZ1k7MG+23rx77L3kP9rQZVh6lF5GM5SVwWm6xPc9Q4YbWeX3i7N1cs7MnKV7vSfUpnofHnL7dn6Stt+V1rW6762Zy0nD+nuLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpbeh3vuqM0TmbfOm8xZmDfbe9p/VkD6IOF2/VY2oSeVluEp/FKOvUXDVemGfO6ynmtnF9c7OOnHdqWxZvMSffXNWaf73bkp2Ob8nd1fLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHrkJfXSe9Df3qY+es5obzNmdO8qdawv7bHtQ+zPpSj4s56jK1ifwsR4nTYpX1as4aN+ydZ8xN5Yz2Ypxv/a/WLN+sJV+7bmZaL52R416engf/Y3pxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNLb0C8eqhHVy84cnbuZM85f5FP1lb2o/Zg9ifWmNhWH1SjytFwlXotZ1q25a/xomDU4pxjfzz45s9B6QKZl4VtT8pfpU/KZZyYXV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Df2+a3De7sxZnFQ/O39zBuUcxlwq6vuOch9nb6I+t/7UaWoV+VrOErfFLuvXHDaOtGy2cGYueHtaXrp1SjZcPik/nj4x60/fPjs/OKG4uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6Lc/Uhs4d3f2rG5yBil+OotyHuNMwr7cHLM/s0dRp6tVrUexSd6Wu8RvMcw6NpeNJ03GuXrqxNw4ckJGzh6XvV4em9tPHVtc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29PvOyfcuvnuwf1YzOId1Fuk8Tn0trjqbsD+Xc+Rfc0+9rmZVt1mf8rccJo6LZdazOW1caVu6YHyh+caRo7P4lJH54epti6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+5yS+e5IfxQjn8PaSzmPVEs7l1FfqbWcUxX6svle1X5OP1e3mpPpNDWO9ymXiuZhmXZvbxpfGXTccldUf2SZfeWLLrLf5lsXVveflZzOhaK+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS29Bvb+j7NzWi72F8F6F+lj/tq8QS53NqDOc0ak/7dXtWcdjeRX5Ww6rjzFX53PoV18U267uc46MLrWs6t8jS9s3y+BubFFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvQ396iH7I9/D2TPaP/tOwrm8s2l1tT2G/OqsynmNmKMOs3e1f7OHEZ/lKvWcmkZeN4etZzHOOjfXjTfNJz7xsUy9coPi6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3od930M5JnJv5Ps53UuomucP5vDNq57TOKtXbzqyc28i/9u9qEvs4sUk9r6YVt9U28rscJ86b29a7OW/caX9xnXWLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5PeD8f/w/X/Yfz/MP83e/3X7PV/s+//mn3/3+znP81+/tfs57/Nfv7f7N//NPv3f83+/W+zf//f7L//aPbf/zT777+a/fd/zf77z2b//W+z//672X//3+x//9Hsf//T7H//1ex//9fsf//Z7H//++G/5v6376MfzY1Xfiwb9G6anZeOyKFPbpXqK9vmLw+OzvxF22XJVhPy6pcn5rCfTk77A1Nz/orp+fmimXm/rSXXLW/NuhPmZP8j27L+Re359JKOHPPdubn2mM7Mmt2VLX/fleOO6k7H6u7079KTf1vak3/9pSePbN6b9pbefKqrvLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpbej3///ca9Ns/NSI/LJn62xzyMisPWBMjp4zrp5DJ+QLu05K35Ipmf7AtJz0mxk5+sZZ2ffw1lz29uycd2JbvnNfe7Z4vyMnjOnMNqO7suCdrnz3vu5sdFpP3hjVm68u6c2PturLUQv7cvFdfXnqf/vy8NT+/K7Sn4k7llf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvQ39Pg/PFu25dQ68fGQW3Tom7105Lo/tt30mvTopm+w9NSu/Nz0X3TgzKy5vyeIjZuf8Tcvx/vLajuzb35nWg8pxvmLvnmI8L3+hXiOe35cvjevPSd/vzxfWHcj+CwbSdfVAfvboQE7710DeGjGYL44aLK7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnroKvTtWX4GDf3mhM/Fu/cfGpNlj43LLjdtnxH7TM5mf5iaL7fMyNl7z8qFC1rzfPecvP5KW9rO6Mi2f5+bznRl1IndOeDMnlx5Wm9OXFBq7nigP3PqdemTqwZyxR6Dublet/S9V89pw0M575ih/Pn8oVyztMx/ru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056G/qtC3PD56PNUfdtnyfPm5xxU6Zltwtn5KaHZuX05+s577G69ivqY16t+7ujM/8xphzvqxb2FnP2p5/tz+CkchwfO34wtbcGC039Dw3lxonDmXL4cO6+bDgn3DOctU8P54+vDef4N8qre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96GfrHB+jBHfE7a3j48LRvfPSNvjWzJPTvMzl2fqNdVEzqy9rdzi7lnPYpZP+rpK9bvtFnlnDZul39mKKOeqNdtuw/nxeXDuWqTSq7avZKdz63k+eWVnPx4Jb97rZJL3q1k0nrV4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6FffBQjrBNzxeelj7jaduLsrDq7LSefVK5z8Vh8Fpsu/W1fDnq2vxiXc24YzO8PH8oVGw7nqe+Vmh89oZIjV1bSskk1v/14NS+cUM1vvlfNzTdXc+pd1TzzQDU7P1he3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29MsR4qRYYb2YMz43fduvbityzrMnd+bEKd25oL7XeHKjviJuW5ev7TuYI3vqdfraoWLuvjK9kt2vLsf1m3tV853FpcbFb1XTPrqWqzpq6dihln/uWstte9XyymfLq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pehn55Uq4QL8UM68bc8fmxseu5nTlgp+4iP987v6+Iy0/dPpBX7hwsYpf1anz2uaySa0eU42c8b3+3mnXaajljj1r2PK6W475ey9n1ve7YS2vZ94paplxdy3pLyqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+tYJ8KWeIm2KH9WMO+RzZ2vf1niLmiMPWX+v6Q/m3vw0V63O3z5Xr96nDq3nznvo83rSWyz5RajjmnFLbKT+qZe0Ntfz3jbWcW7/++Lpapl5by7d/VF7dn/vBe+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6FcvqRnkTblD/BRDrCNzyefJ5h5/6i/y9YVtZTwXt83JL7XV9+/LyvE2h59eWMvl362l9sNaltX1LLq+rm1pLdMuqeX8b9Vy7b/Xx/VLtdx5bC0XH11e3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29KsZ1U1qhyK/13OIOCqWWE/mlM+Vbfl54cBwxm9ZxrZlC8p1ut70Wi48opY/XljLMz8sx/Hqa2q5os79m6/WMvPgWk6us/fNqK/xEbUcW9fwz39UM+Jv5dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/ulntqH5SQ8ijcol4KqZYV+aWz5ePzcaVuaqI5y9W89+1Wi44rVzHxmvXOueiC8txpWXC1rVsvqqa42+tZuLZ1VxzaDUbfbKax3uqWbejvLr33HvttNdPf3bY2/WD+cQPf/zyjwMPLnw48eLGTwc9RX3wSlkn0tvQb++gflZDqqPUEvKpnCKuii3Wlznmc+br4VOq+eraahG33z27XK/W73mLy7l8eZ1txrp17l/U8/vCasa31Ofs85Usv76S906uZO38So7or+TojvLq3nPvtdNeP/3ZYY9d9s/9ID7wyz8OPLjw4cSLGz8d9NBFH530NvTLj/YQ6mi1pHpKTSGvyi3iqxhjnZlrPm8+xWfx+rDryxg25txaHtmnHO/37irH88D3Kznz8lLj9k8NZ9H5w3n308PZa/RwbvjXUHZ6bai4uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oult6LeHtI+yl1BPqynVVWoL+VWOEWfFGuvNnPO58z3uhnJ9Vr5ezlXr2Rz+yFbV7P29Sp4eUSk0tW0+nO9fVq+Fu4aywTODWbB0MLecOpilx5ZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70N/fbR9pLipD2Fulptqb5SY8izco14K+ZYd+aezx+DuH1fb31t/r6agQOrefF35XjfdclwMb5n7zSUzW4ezH7jBrPsqoFc1lOv49f059zb+nPc9eXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Dv7ME+2kxwr5K7lBfqzHVWWoN+VbOEXfFnlM+yNvGAcv2D5YxzPp94M3h7NM7nNXHDhXjuuYPA3lz5ECeO7I/v/1NXxbs1pdP/r03Oy3vzX8uK6/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oehv6rQdnCvbV9pb2V+KnOlutqd5Sc8i7co/4KwZZh+ai8cBkvR7/WLmul40YKsZx7+kD+U53f6FtbN32mHt6snVLT569rTsbfak7x+5fXt177r122uunfzFvRpRxgn1++OOXfxx4cOHDiRc3fjrooYs+Oult6FcjOlexPuyv7TGL/feGZT2v5lR3qT3kXzlIHBaLrEdz0rhge3x1ub5vv3+gmNufXNSX7Y7qzSc+21NoHTyjK0890JlzdujMS3+bm6sfmVtc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQ29DtXc7bkfMUZg/Vir2m/JZaIq2pP9ZcaRB6Wi8RjMcm6NDeND8bRN5Vz/dMj+4rxNL5LOrvy3sad+doGczO1vSP/uKA9Y1ras+PHyqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3oZ+Z4vyozMmdZOzBvtt68e+y95D/a0GVYepReRjOUlcFpusT3PUOGG1nicd25M/rKr7Oagzx68pNb+xX1ue2H9ONr1ydh6fOjtHvNNaXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvQ7X3XG6JxNvnTe4szBvtve03qyB1GHi7fqMTWJvCw3ic9ilHVqrhovzIf9Z1cxt43r3NPb8quXZueRr7fmzj1a0v3FWVn0zMy8/ZOZxdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9dhb66Tnob+tXHzlnNDedtzpzkT7WE/bc9qH2Y9aUeF3PUZWoT+VmOEqfFKuvVnDVu2I97rT2nvDanGOdXp7XkH1+bmdtGzciRG0zP9ftNy8cmTiuu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+sVDNaJ62ZmjczdzxvmLfKq+she1H7Mnsd7UpuKwGkWelqvEazHLujV3jR8Nh9/YWozvRbvMKLQuvmVKbj5qcrZbPCnnzZ9UXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530NvT7rsF5uzNncVL97PzNGZRzGHOpqO+XlvsyexP1ufWnTlOryNdylrgtdlm/5rBxpOVTq6bn/mOmZuqUydlh+sS8cOmE5NLxOasyvri699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3otz9SGzh3d/asbnIGKX46i3Ie40zCvtwcsz+zR1Gnq1WtR7FJ3pa7xG8xzDo2l40nTcb51Jcm5PmzxmX3K8fm2/uNyVsvjS6u7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnob+n3n5HsX3z3YP6sZnMM6i3Qep74WV51N2J/LOfKvuadeV7Oq26xP+VsOE8fFMuvZnDautD1x/3aF5ufPGplH1myTp/fapri699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466W3od07iuyf5UYxwDm8v6TxWLeFcTn2l3nZGUezH6ntV+zX5WN1uTqrf1DDWq1wmnotp1rW5bXxp/NZXts32J22VW3feIpXTRxRX956Xn824or1++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0O/vaHv39SIvofxXYT6Wf60rxJLnM+pMZzTqD3t1+1ZxWF7F/lZDauOM1flc+tXXBfbrO9yjo8stE65ZvM8sWSTbH3kxsXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Dv3rI/sj3cPaM9s++k3Au72xaXW2PIb86q3JeI+aow+xd7d/sYcRnuUo9p6aR181h61mMs87NdeNN8007b5iDN12/uLr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpbej3HbRzEudmvo/znZS6Se5wPu+M2jmts0r1tjMr5zbyr/27msQ+TmxSz6tpxW21jfwux4nz5rb1bs4bd9o/vuq9mqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3g/H/8P1/2H8/zD/N3v91+z1f7Pv/5p9/9/s5z/Nfv7X7Oe/zX7+3+zf/zT793/N/v1vs3//3+y//2j23/80+++/mv33f83++89m//1vs//+u9l//9/sf//R7H//0+x//9Xsf//X7H//2ex//9vM//4P4m3Ci3ic7dz3g1XVtQdwDFawUKUjMJRhZphe7p07FxdGsKGI4gsmUaLBbgwo9hIJKmoQOyZoYjAGlajETpDYMRaEqDGgpth4T4lBTREVJe98zuHmn7jwy/bsvcr3e/bea629zx07ddr2r+vXOse3X9wxlk3vEl+t3i16du0eH/frFdd+uWd0erBfHDpuYNz6y8HR650h8famYTH2/eFxyoMj476jKuPI9aPj/onVsduNNfHI42Ni80u1MejJupi6sD7e+GZDPN25MfZa0Bjv9GiKDec1xabVTbFkj+a4pNgcb09tji+OyVrP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb4++8lc7rEiq67x1nTu8ez83vF4h/1iYHf7h/57QZF/wv2ig9eGhrrNlXEyM0jYuDro6Lr9aPjoKrq6Ph5Tezz6Zh4akxdDNu/Pp6d0BBdqhtj308bY/ldTbF4QnNUr26O/xnXEv0WtcSEjS1x9ejWmH14a8w5tTVenpW1nvUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPEt8fc+9LX+sHvs/nyvaHu7T/z6xf5x2RWD4tUBQ+K3c4bF2U8Nj31eHxmnPF8ZB9xQFWML2XxXVtRF1xPq48/zGtL5OviSpnQ+J/ZuiU+Wt8Twg1pj5O9aY0B9W+w2ty3Wr2qL47+Wi5rKXNw1NhdDJmStZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xL/K0J78XYfV/1iSmdB8SWNwbFk5cOice3r4jKI0dE/pJREXNHx03frY5f9h8Tb91TG78bXB/vndYQz9/aGLs/0BSHLGmOirkZ53c2tcZf57fF/O65OHh2Lqb9NRcf1OTjbyfno7gwH/MezccRa/Kx/rWs9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvib99YW14P2T6fjoo5i8fEi9NrohOvx0RR381Kup7VcXvv1YTv3whmfPv1cVbf6uPY/bP5nvSouZ0zR53aWt8OCmb38t+lotPRmScNnyZj29Nao/XrmuPmc+1x7BP2mPxboW4YnAhhgzPWs/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574lviLDfaHNeI9kT3tlIpYsXFE3DW+MmbNrIqZZ9TEDgfXxuL/1KVrz34Us74xvSXdv2u/0ZauYfM28Qf5eH6X9rj94vb4yfr2mNReiEMuLsRXywpx0/pCjNypI344uCP2q+mIV+uz1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Jf7ioxhhn1gr3hcdcfWtW6vi+odrYtQvatP9Jh6Lz2LTfv9piW7dsvkurMvF3OvzMbG1Pa5+KuN86a2F6PuvQryZ74jZp3fEj2/tiIue6ohpf+qI6o0dce1nHfHl5qz1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhie9/E2CSI8RJscJ+sWa8N7pvr6pJc851t9dHxWGNMXZdU8zPtaRx275cdHku+k7Px+EV2dq95YhCdH6pkM5ry5yO2OfZjOP+I4vx9oRiTJpWjHdmFOOuC4px8pxi/PTSrPWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9e+OGJb4m+PClXiJdihn1j7Xh/bPxnWX3sdm5jmp/PvKgljctX/60tfvr3XBq77Ffzs8tzhfjG2Gz+zOdpNcW4/9vFqJ9djB1uKcZeS4uRW1GMVc8Uo+sLxXhtVTEeeClrPes3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4q9WkC/lDHFT7LB/rCHvka2uw7IYJw7bf39uysemgdn+7nRNId2/V1/fEXd+0hFHF4px0BkZh4HLMm5VfyjG4nXFOP31YnQk7VF/THgnfeP+kLWeO7aOkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+KuX1Azyptwhfooh9pG15H2yuf3ObWm+jqOyeC5uW5MjjuqIU17O5tsavmZRMSY+WYxPXinGlIRP69qE25pirH26GGMfKcbUXyXzmsjMuLkYE36StZ71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfFXM6qb1A5pfk9yiDgqlthP1pT3yrb8XHFie6zeO4ttU+Zm+/vBKcWIG4px+W+Lce2r2TwemuA+OMF90V3FeOOqYoyaWYwPjijGIWOLMTjhsGRIMZ4cmLWe9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xVzerHdVPagh5VC4RT8UU+8ra8n75ePzALIel8XzPYpxxWjH2XpLtY/O1JcHb+ttsXnFZM64YT3QrxtC3O+LlhzriiGs74tEzO+KK6R3xwNFZ61m/cXLk6dFnh70tW9cTP/zxyz8c8MAFH5zwwg0/Hvik9UHCD098S/ydHdTPakh1lFpCPpVTxFWxxf6yxrxnvmbf0RE1FVncXvpwtl/t345ns7U8McG2rq4YbRs6YsKijlgzNdkjvTrixLWFWHp7Uu9cVIg9TyjEwGlZ61m/cXLk6dFnhz122e/YGh/45R8OeOCCD0544YYfD3zwwg9PfEv85UdnCHW0WlI9paaQV+UW8VWMsc+sNe+bT/FZvO69NothLySx6pLLsnn79cZsPveo7YjW5zOOv+9aiLZH2+Pec9pjx/2SGq+yPb4clLWe9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xd4Z0jnKWUE+rKdVVagv5VY4RZ8Ua+82a8975Xr02258f3ZutVfvZGn4oOmLHpwpxzdiM81sd7XHgc0ltf0w+lu2Wjy5rcnHsnbk47Oas9azfODny9Oizwx677PPDH7+rt74DeOCCD0544YYfD3zwwg9PfEv8naOdJcVJZwp1tdpSfaXGkGflGvFWzLHvrL3eW7mL2+cel/jevhgbfpTEhU4d6fzNfCab3/y5+Xj8zVzselAuDk/OdwdNb4sP92yLjv9rjb3WtqatZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xL/N0lOE+LEc5Vcof6Wo2pzlJryLdyjrgr9lRtzdvmAZbfb85imP17/oikFjquPRbcnM3zwh1ycef4trjxxuScv7klulzYEp8PbonN7zXHd19uTlvP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb42w/uFJyrnS2dr8RPdbZaU72l5pB35R7xVwyyD61F8wGT/TqkcyHdz1PG5tN53OmIttjnu60pt1V3NceLHzfFyqlNcd3/NcbyRY0x+Mqs9azfODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvib8a0b2K/eF87YyZnuNas3pezanuUnvIv3KQOCwW2Y/WpHmB7Yqe7ek+/t6mtnRtf/5AwvvG5vh3YhvXD+9piKs/q4/CzPq4eVB9HLpd1nrWb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8TfvZq7Jfcr7hjsF2dN5y2xRFxVe6q/1CDysFwkHotJ9qW1aX5gfOGNbK1v3rclnU/zO/mYhvh1vj7qWurij0fVxi9WjIkXpo6Jz1qz1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww5+eG3+QxQH88MS3xN/dovzojknd5K7Bedv+ce5y9lB/q0HVYWoR+VhOEpfFJvvTGjVPsNrPry5sirndG+P+efUxtE9dyvGOK2riqiur47EXquLKw6uiT3XWetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3xN/9qjtG92zypfsWdw7O3c6e9pMziDpcvFWPqUnkZblJfBaj7FNr1XzB3PuthnRtm9d3766Jc/pWxyVLR8eM2ZWx/pZR0bb7qLjnzyPT1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnil/BKe+Jb4p/XxhGztu29z5yR/qiWcv51BncPsL/W4mKMuU5vIz3KUOC1W2a/WrHmDffDg2qgaXJPO88+mVMZtd4+MkyeMiL4tw+ObV1TE8kMq0tazfuPkyNOjzw577LLPD3/88g8HPHDBBye8cMOPBz544YcnviX+4qEaUb3sztG9mzXj/kU+VV85izqPOZPYb2pTcViNIk/LVeK1mGXfWrvmD4fer49O5/fr549IuR7w16ExbcGQWLVyryhetFfaetZvnBx5evTZYY9d9vnhj1/+4Uhr7HEZPjjhhRt+PPDBCz888S3x963Bfbs7Z3FS/ez+zR2UexhrKa3v12TnsvRsMjXb9+o0tYp8LWeJ22KX/WsNm0dcvug2Is5dOCz+OHlI/GvK4PjxyoHxj2cGRNupA9LWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74l/s5HagP37u6e1U3uIMVPd1HuY9xJOJdbY85nzijqdLWq/Sg2ydtyl/gthtnH1rL5xMk8V/UdFDc91D86v9g34oo+cWffPmnrWb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Sf9+cfHfx7cH5Wc3gHtZdpPs49bW46m7C+VzOkX+tPfW6mlXdZn/K33KYOC6W2c/WtHnFbd6mfinnmx7qFZf06RnXzOmRtp71GydHnh59dthjl31++OOXfzjggQs+OOGFG3488MELPzzxLfF3T+Lbk/woRriHd5Z0H6uWcC+nvlJvu6MQb51VndfkY3W7Nal+U8PYr3KZeC6m2dfWtvnFsX1xz/j9bd1i+nm7x0d375a2nvVn76Z/Kk+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb4Oxv6/qZG9B3Gtwj1s/zpXCWWuJ9TY7inUXs6rzuzisPOLvKzGlYdZ63K5/avuC622d/ZGu+Vcn3t5V1j3upd4pkbdk5bz/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+KuHnI98h3NmdH72TcK9vLtpdbUzhvzqrsp9jZijDnN2dX5zhhGf5Sr1nJpGXreG7Wcxzj631s03zkedt0N0K3ROW8/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574lvj7Bu2exL2Z73G+Samb5A738+6o3dO6q1Rvu7NybyP/Or+rSZzjxCb1vJpW3FbbyO9ynDhvbdvv1rx5x/2OvTfvrfWs3zg58vTos8Meu+zzwx+//MMBD1zwwQkv3PDjgQ9eKb+EJ77b5n/b/t8W/7fl/3Kv/8q9/i/381+5n//L/f6n3O//yv3+t9zv/8v9+0+5f/8r9++/5f79v9x//1Huv/8p999/lfvv/8r995/l/vvfcv/9d7n//r/c//6j3P/+p9z//qvc//6v3P/+s9z//nfbv/L+1/RRp7h02fbx1uSdY8SKrtHx2e7Rb6cesfyDXjF6UZ84t7Z/PHfdwCiuGRxd1g+J418bFjcsGh6vHzgyZr8yKsnTo5M9VRVv3V0dFY/WxPh7x8TFc2uj8/518eHHdbHfnPro0qkhep7YEENWNMSrXzbEPVXJep7QGMMmZa1n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfEv8/fcrM3aO9z7rGj+bvEdsPL9HrD6nd+x7QN84ZmP/+PpJg6L7o0m9uH5oTHq/IsY/OyKaLk5q5D6j47irquLkd6tjQxJ7D2qpjY1NddHUtz5Ofbc+3l3QEGuaGmPKo43xg9qm2Gd+U3z/zaZYtmdzLInm+NWR2f//QOtZv3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT3xJ/70PftO/vEW0P94hpq3vH68v6xtKzBsTmnQfH+hlD4udLh8Upzw5PaqqRMXN2ZRxfmc33od3GRNOU2tjhvGyez5zZkM7nrK81Rb87m+LgXHMc8mBzfH1QS7TOaondk1h+9UctcUTvJPZVt8b+TVnrWb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvFJ+38/eQYm/NeG9GHt9Q++48OO+MfK5AbHh9MHx/idD4tAJFXHszBFx0qxR8fiho+Olnapj55tr4qOutbHrt+viH/Pqo+3nDXHWTY0xcVbGucv65tjpgpZ4eEtLnHlaa1y+qjV69G+LnlOT+iXJbw/e2RYXrkhy3dNZ61m/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPfEn/7wtrwfsiMe3dAPHzH4Ph07NCoXFIRczeMiCO3q4zPPkq4P5LM+TfHxM6v18aVLdl8nz2/MV2zV53eHL2K2fze+6OkRuuZceqxoS0u6cjFVz/IxcKHcnHgX3Kx+otc3Nc1Hwd0z6etZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xL/MUG+8Ma8Z7ILpg6NNa/WREvN46Mnx5dGQu/UxVj2mti9Ydj0rVnP4pZF09uSvfvf/bN1rR5m3VqW3zyaVus+l4unnwlF2ePysfZ38vHyMX5ePyVfEz6Vz5+1bU9vt8vu//UetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3xF98FCPsE2vF+6Ijru5yVXJ++EVVTLqmJt1v4rH4LDbN+LApcl81p/Py3ZWtsfTitjizIhePLM043zMvH+Pezsf2o9pjybT2eGJeUvcvTc5vzyfn1zfbY3lythnxQdZ61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfEX44QJ8UK+8Wa8d7odlleleacR6+tjYP2ro8TVjbEIyOa0rhtXz5/ZmvE5LY4v1u2dlfuk4/q5dl3i6NmtMfJD2QcZ/YsxC7NhTh7YiG6Hl2IV04qxHUzCrHy9Kz1rN84OfL06LPDHrvs88Mfv/zDAQ9c8MEJL9zw44EPXvjhiW+JvzwpV4iXYoZ9Y+14f2xULq6N1uPr0/z8s1Oa0rj8yLqWWPlGaxq77Ffz0/hQPi6uzubPfC7oV4g3DijEkacVovaKQux/SyGOuasQ/7qvEE2PJOfc3xTiT8uz1rN+4+TI06PPDnvsss8Pf/zyDwc8cMEHJ7xww48HPnjhhye+Jf5qBflSzhA3xQ77xxryHtlq2iOLceKw/bfj0LbYq0u2vysvzPbzsuSc/vJfknVcWYgzvpNxGP/LjNthTxZi9cpC3PxsIaYn7WVPF2JL0nfyk1nrefrWcXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwzOtZ7b+Uy+pGeRNuUP8FEPsI2vJ+2RzzL+b03x90oFZPBe3rcmDD2yP6x/L5tsaXja/ELPuLUS/JwpxQcJn2jMJtxWF6JTM7wm3F2L2j5N5TWR+fHkhTrssaz3rN06OPD367LDHLvv88Mcv/3DAAxd8cMILN/x44IMXfnjiW+KvZlQ3qR3S/J7kEHFULLGfrCnvlW35eeIRudhUk8W2C2Zl+/tP4wpx4uxC3LekEMufyObxnMcLcWaCe/GCQnQ+vxCHJth7fD3Z49WF2C/h8MpuhdiwS9Z61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwTOvErf/UzWpH9ZMaQh6VS8RTMcW+sra8Xz7eb8tymP14R+dC3PKtZN5uyvax+RqV4Jy2JJtXXD6rLcQHX7XHAavb44vb2uOii9rj3WPb4/7JyXs7KGs96zdOjjw9+uywN2rreuKHP375hwMeuOCDE940TiX48cAnrQ8SfnjiW+Lv7KB+VkOqo9QS8qmcksbVJLbYX9aY98zXkhva44huWdxe94tsv9q/xz2QreVZCbbtBiW41yb5fX7CZXyyR7Zrj2ufyce6a/Ox5pR87D0lH/tOzFrP+o2TI0+PPjvsscv+9K3xgV/+4YAHLvjghBdu+PHABy/88MS3xF9+dIZQR6sl1VNqCnlVbhFfxRj7zFrzvvkUn8Xr4jNZDPtnEqvuOSOb73VvZvPZNiDh8HDG8fPPcvGdO3Ox9rhc1DXnYk7vXAzvmrWe9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xd4Z0jnKWUE+rKdVVagv5VY4RZ8Ua+82a8975/vSZbH/2vSVbq/azNfyXMe1RtzQfv6nOp5x2rsrFGQ8ltfCktnj7i9ZoXNEaP7qxNc6/PGs96zdOjjw9+uywxy77/PDH76db3wE8cMEHJ7xww48HPnjhhye+Jf7O0c6S4qQzhbpabam+UmPIs3KNeCvm2HfWXnErd3F70WGFuPCT9uh5bns8+fdsvhfel83vsce3xfvPtUZzrjUu+E1LzJrcEr23b4npf0hi6jPNaetZv3Fy5OnRZ4c9dtnnhz9++YcDHrjggxNeuOHHAx+88MMT3xJ/dwnO02KEc5Xcob5WY6qz1BryrZwj7oo9h23N2+YBls/fz2KY/Xt7j6QWOiwXj1/els7rU/9oSeqvlnjsh8k5//0kN5/cFEN3bYrhrzTGvMca09azfuPkyNOjn9pJ7LHLPj/88cs/HPDABR+c8MINPx744IUfnvj+9/yf7Ad3Cs7VzpbOV+KnOlutqd5Sc8i7co/4KwbZh9ai+YDJfj3g42w/X1jdls5j3T4tcfKhzSm3fy9ojH/+uSE2jm+IR/9QH+/Or4/9zs5az/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+KsR3avYH87Xzpjp+bsiq+fVnOoutYf8KweJw2KR/WhNmhfY7u+US/fxgvda0rU9dFHC+4eNMfj0hpRrr5vr4pH1tTH96Np4ukttnLNxTNp61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfE372auyX3K+4Y7BdnTectsURcVXuqv9Qg8rBcJB6LSfaltWl+YPzn77K1PryxKZ1P83veIXWxbmRtTB02JrYcWBMv3lUd/xxfHUOGZ61n/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwSu9mEp74lvi7W5Qf0zumpG5y1+C8bf84dzl7qL/VoOowtYh8LCeJy2KT/WmNmidY7ecv5zbEr7fUxZvn1sYB249JOa45qyoePnt0/O8jlfFAVEb0zVrP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb4u191x+ieTb503+LOwbnb2dN+cgZRh4u36jE1ibwsN4nPYpR9aq2aL5iLL9Wla9u87rqwKhbtMDruuWVU/OS0kbH7lSNi2ubh8doLw9PWs37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eKX8Ep74lvirj92zWhvu29w5yZ9qCedvZ1DnMPtLPS7mqMvUJvKzHCVOi1X2qzVr3mDfr2tNHN61Kp3n340bGS/+ZHhc31QRMWxYzDlraLxTGJq2nvUbJ0eeHn122GOXfX7445f/tMZam8VC+OCEF2748cAHL/zwxLfEXzxUI6qX3Tm6d7Nm3L/Ip+orZ1HnMWcS+y2tTR/Oaht5Wq4Sr8Us+9baNX84jH12VDq/p55YkXI9fdVeMXfO4Pj3/YPi+FMGpa1n/cbJkadHnx322GWfH/745R+OtMauzfDBCS/c8OOBD1744Ynvf89/nRrS+3Z3zuKk+tn9mzso9zDWUlrfr8jOZenZZHy279VpahX5Ws4St8Uu+9caNo+4VGwZFrfNHRJbxg6OgfsMjCfv7x/97+8X3zmyX9p61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfE3/lIbeDe3d2zuskdpPjpLsp9jDsJ53JrzPnMGUWdrla1H8UmeVvuEr/FMPvYWjafOJnnw3cYEI/f1jeql+0ZJ53VO17eoXfaetZvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3xN83J99dfHtwflYzuId1F+k+Tn0trrqbcD6Xc+Rfa0+9rmZVt9mf8rccJo6LZfazNW1ecXvovT4p5ydu6xF3b989fjOjW9p61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfE3z2Jb0/yoxjhHt5Z0n2sWsK9nPpKve2OIj2PJWdV5zX5WN1uTarf1DD2q1wmnotp9rW1bX5xPPb67vH51bvHvBN2jT4Lu6atZ/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xL/J0NfX9TI/oO41uE+ln+dK4SS9zPqTHc06g9ndedWcVhZxf5WQ2rjrNW5fN0/yZxXWyzv61x84zrV491iYce3Sn+PnvHtPWs3zg58vTos8Meu+zzwx+/ad5JcMADF3xwwgs3/Hjggxd+eOL73/g3ITvv+Q7nzOj87JuEe3l30+pqZwz51V2V+xoxRx3m7Or85gwjPstV6jk1jbxuDdvPYpx9bq2bb5wvO6Fz5Cu3S1vP+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb4+wbtnsS9me9xvkmpm+QO9/PuqN3TuqtUb7uzcm8j/zq/q0mc48Qm9byaVtxW28jvcpw4b23b79a8ecf9s36b9tZ61m+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxHfb/G/b/9vi/7b8X+71X7nX/+V+/iv383+53/+U+/1fud//lvv9f7l//yn373/l/v233L//l/vvP8r99z/l/vuvcv/9X7n//rPcf/9b7r//Lvff/5f733+U+9//lPvff5X73/+V+99/lvvf/5bzv/8HXEZ2F3ic7dv5o5VV9cdxVEAgRPQyXbhcLsO93Hk859xzHWI5ZFIkmQMaKYoIZoJgTulXUyNQM0VzwBQtRySHcDZLTBxIJRIHHMHUEgcs0sxI4Htez8P5Kw788vA8z95rvT9n773W2vuc263b9n+3ZjePGzNtxzhvc494ckbveOPmvvHwvbvGkVftHismDIwhrw+OGV8dGm+eVRF3LKiMnudXRce3RsWPPh8dI8+tjrP+VhMvN9XGj4+oi+XT6+NvRzZEVUdj3PRpY/zs+qb4e3NzLPlNc9xb1hLLZrTEKYtbYsIrLXHHxpZ4YlN6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1O//p1T0jLm39I6vbu4bl47tH7PGlMV7nw2MHX45JN4ZMCyWTh8ev1owIj75xch4b87oeLGhOsqW10T3rtroc1ldXPx0fXz4dkNcuq4xVi9vir6XNccF+7bErHUt8en01qh8vTX+2tUW/ea3xaQn2mL8x23xjR7tce0u7cnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv8/Dsy1Dd4lXju0fW39UFmdOGxQHjSqP6+4fFj+tqIxxk6uizymjomPqmOjfVBM9XxqbjMM/H62P1Vsb4tbqdJwHDk/Hc8DdrfHIIW3x8bttsWFKe7y7oj1eHtERdx3fEc3XdcRnj3fE7DUdsX5tenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9RvTvhcvDvz6rKouH5QPP3D8riosiLmL6qMf26sih2Gj45eVdVx9Jc1MfO+2lh8QH1c9lBD3LlzU1yeb45XvtkSg/ZrjY9GpJqXLGiP28Z2xOFLOmLg0EyMPTMTS5/KxH07ZaNHRzYOOTQbw0/Ixl2z0qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3qJ+68Lc8Plo8/al5XH4IRVx1YeVseKwkVFz9ej44s7quOa6sXHScXXxjx4Ncfvcxqj7a1MyHoP2SOd2U2V73L++PRnHgzoz8chjmUTTvVdlY/T6bFzfkIuuY3Px4UW5mHVbLg5+KBfrf59e3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQW9YsN1oc54nPSNtd9RMydPzLmrB0de/Wpia6+tbHyb3Uxa2E6161HMWvE5tZk/d74z/ZkDhu3siHZuPymbJxUnotjz83F4BdzMai8M546uDOmnNsZn9zYGd94qDN2faozrvtTenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9QvPooR1om54vPSR1xdnK+JyRNr4x97putcPBafxaZdF7bFq4vT8d5xTiYmNmZjwKpsTJqcap6Q74y3L+mMm1d3xviv5OOYfD4OmJyPsafl49N5+Tjy8nw8eWV6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1C9HiJNihfVizvjc9L3j+Nok53x378b46MOm6DmnJQ5/oTWJ29bl90dmYt2XmRj2+2wyd6d9kovnjk/HdfOwfPSZkmrsvywfi9flY/AX+VjSuyvmDOyK9oqumFaZXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530FvXLk3KFeClmWDfmjs+PjWcOboyXd2tO8vPeg9N4PmluR0ybl0lil/VqfF44pjNGrOlMxs945p7Kx1n/zscX5V2xMtMV73+9K7od1hVXHtUVq6d2xaLju+Ls6enVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv1pBvpQzxE2xw/oxh3yObL34u5Yk5ojD1t+tz2di2QPZZH2uqE3X76TGfMy+OB81L+WjrG+q4b1vp9o2ntQVs+Z0xR6ndEX3wrX65ILumV3Re2Z6dd9923vttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLepXL6kZ5E25Q/wUQ6wjc8nnyebzv2pP8nWvzzNJfBa3zckN/+6M9hPTcTKHj9ijKwZ8tyse+UFXVBT0bKHthK648Xtd0bOgp2r/wrgW2uQLuvq1p1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvUX9akZ1k9pB/pRDxFGxxHoyp3yubMvPH3XLxdWv5pLYVFGVrtOzN+SjV1NXfPvwrjjypHQchxS4Bxa4D9i3K26q6Yp/FNiXfpKPQWvy8fcn83HKI/m46IH06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qF/drHZUP6kh5FG5RDwVU6wrc8vny8f8d3NJrkri+T352HPnrth5v3QdG6+nC7xbDkvHlZZrXs/HhXfk44Mf5ePag/IxvD4fF/TLx8GbO+Ps/3QmV/eee6+d9vrpzw57T2+bT/zwxy//OPDgwocTL278dNBDF3100lvUb++gflZDqqPUEvKpnCKuii3Wlznmc+ZrfOTjs0fzSdw+Y2K6Xq3f7lPSuTygwParFfnYekE++u1R0LKxMzru6ozW2Z1xxt6dMWtwZ6zdmov3/pNLru4991477fXTnx322GW/+7b4wC//OPDgwocTL278dNBDF3100lvULz/aQ6ij1ZLqKTWFvCq3iK9ijHVmrvm8+RSfxeu3tsWyKw7uigkj0vE+Y346nmue7owtx6ZaF96Si62H5OL03XLx53WFmvCP2Vj+YHp177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvUbw9pH2UvoZ5WU6qr1Bbyqxwjzoo11ps553Pn+6rZ6fp86OvpXLeezeFzXuuMP3+3M45Yk2pa/HI2dj+2UNtvysR5t2Vi9YxM1O+TiaGZ9Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6jfPtpeUpy0p1BXqy3VV2oMeVauEW/FHOvO3PP5YxC3Y0vB96J83DumMA7XpuPddVQuGd8dds/G/FMz8eK7HTGssL8r21zYJ9zTHt3Pa4/3T06v7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnqL+p0l2E+LEfZVcof6Wo2pzlJryLdyjrgr9lh/5qBxwLLwyjSmWb/7PVaohTZn4+hMNhnXqTcU9rhr2+Oo5sI+/8q2WD2wLf74UGssP6c1Gk5Mr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056i/qtB2cK9tX2lvZX4qc6W62p3lJzyLtyj/grBlmH5qLxwGS9rr8ul6znijXpeK/a0B59vkw1X7lva/ziopb4+cZCXXJec1ywR3P8fVR6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1K9GdK5ifdhf22PaZ9lrqLfVnOoutYf8KweJw2KR9WhOGhdsB9+ZTdZxdkFHMrf/OKGgu7k1/uDcoqD1/gOaYtLljbFTn8aY+mBDDP5lQ3J177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvU71zN2ZLzFWcM1ou9pv2WWCKuqj3VX2oQeVguEo/FJOvS3DQ+GK/4YUcyh5e/lY638S3f1Bhnrm6I/6ysj0Wf18UPDquLKzbWxuOrapOre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96ifmeL8qMzJnWTswb7bevHvsveQ/2tBlWHqUXkYzlJXBabrE9z1DhhtZ6v62iJiUua4qzqxlh/T32icdao2jhs9Nj46XE18Z2Pq2Pd8urk6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qN/5qjNG52zypfMWZw723fae1pM9iDpcvFWPqUnkZblJfBajrFNz1XhhfuvMpmRuG9fffK02YmlNTDiwOvJDx8Rd2dGx5bZRcdrpo5Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4MeuhJ9BZ30FvUn9fG6dO47b3PmJH+qJey/7UHtw6wv9biYoy5Tm8jPcpQ4LVZZr+asccP+9wfr4l8Pjk3GefqG0XHi10ZF+7qqeHvliBg1akRc8H5lcnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9QvHqoR1cvOHJ27mTPOX+RT9ZW9qP2YPYn1pjYVh9Uo8rRcJV6LWdatuWv8aHhrTnUyvl8ZMDLRutuZw2NsS0VcefSw6DF4WHJ177n32mmvn/7ssMcu+/zwxy//OJIau8CFDyde3PjpoIcu+uikt6jfdw3O2505i5PqZ+dvzqCcw5hLSX1/QrovS/YmG9N1r05Tq8jXcpa4LXZZv+awcaTliTuqYp+Oyrjhw2Hx+w3lcczRQ+J3Rw2Ord0HJ1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvUX99kdqA+fuzp7VTc4gxU9nUc5jnEnYl5tj9mf2KOp0tar1KDbJ23KX+C2GWcfmsvGkyTj/67dDYspBg+K54wZEr1FlMXvp7snVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv++cfO/iuwf7ZzWDc1hnkc7jum2Lq84m7M/lHPnX3FOvq1nVbdan/C2HieNimfVsThtX2g5dMDDRPOWg/jHht/3iiIp+ydW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1G/cxLfPcmPYoRzeHtJ57FqCedy6iv1tjOKZD9W2Kvar8nH6nZzUv2mhrFe5TLxXEyzrs1t40vjjuN2jYV79o3Gsj7x0Nd6J1f3nqefzaCkvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvUb+9oe/f1Ii+h/FdhPpZ/rSvEkucz6kxnNOoPe3X7VnFYXsX+VkNq44zV+Vz61dcF9us73SO90+0LjqxVxw6o0dc0tQ9ubr33HvttNdPf3bYY5d9fvjjl38ceHDhw1m9LQbip4Meuuijk96ifvWQ/ZHv4ewZ7Z99J+Fc3tm0utoeQ351VuW8RsxRh9m72r/Zw4jPcpV6Tk0jr5vD1rMYZ52b68ab5uqyHWLp7ZvHubr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLer3HbRzEudmvo/znZS6Se5wPu+M2jmts0r1tjMr5zbyr/27msQ+TmxSz6tpxW21jfwux4nz5rb1bs4bd9o75/xrnKt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx66En1r03Oh7eO/ff1vj//b83+p13+lXv+X+v6v1Pf/pX7+U+rnf6V+/lvq5/+l/v1PqX//V+rf/5b69/+l/vuPUv/9T6n//qvUf/9X6r//LPXf/5b6779L/ff/pf73H6X+9z+l/vdfpf73f6X+95+l/ve/2/+V9r8Xen8x7tTrt467esZO8cYLPWPjLn3izxW7xOytu8baB3eP5v0HxjmLB8e/3iuPZZuGRcVHw2P8QyPismNGRuf6UbFg4pj46JrquOqJmnjtL2Pjf8trI7eoLh4+qj5+3bMhNhdy0uMDG2PFOYU68oXGuHD3ppgaTbFsclO8Oi29uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6vf/C+ftFL/st3McOqNP3HJ5IT5c2j82HV0Wg7sPii/OHRLP/GVoPLipIrpvqYxNb1TFB1eNirqmMTH05uqo+m9N/Kq1Nrp9sy5uGV8f65saYtR/G2LhnY0xd3xT9H6hKTL7N8d/bm6OMRubY2ZjS0w5vCWOPbkl7jkjvbr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLer3eXg24Kd94uPndomB7/WPS/9cFtMuGRRLKws5YN6wOOyp4VH15ogY//zIGHvN6Kj4ajrePWtq44Pv18Wjl9Un49UwvzEZz/ohzbHqD82x40Et0f3ZlvhveyE3XtQay1e1xv492qJPQ1vM36ctthyYXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530FvWbEz4X7y7rtlu09xwQb741KG68sDwW7VwRPb9XGYPnV0XlxaPitOlj4ifDa+Kx346NW0fWxRNz6uP2mxri4wcao/Guptjh4lTz45ta4g+Xt8ZJA9qiYW5b7P1OWzzT0h5/mtkewxa1x4mPtUfH6vZY/mp6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1G9dmBs+H20+/2JQnPSH8vjNoRWxdlll7NVtZPQbPDru7lEdP1lZGPPZtfHYJ3Ux7pvpeDfd0pTM2f0ubIlnv5OO77Rft8Wq2lTTiq3t0fWdjrjvqo6Y+FxHdPusI+b2z8SMwt5lS016de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1C82WB/miM9J2wmzKuKXGytj/oEj4zunjo6Jp1fHuxPHxtwd07luPYpZ2RnNyfp94LutyRw2bvUXtMftfTvigp90xBnrO6Jp70w0/iQTbzyaidPWZ6J7n2wcMzIb1S2FWq8jvbr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLeoXH8UI68Rc8XnpI64+dtPoOOWR6uhx29hkvYnH4rPYVL1jS3yyezre5W+0xfFXt0d9V0fMfCrVfNxNmfj888I+YK9sTDktG6cX9jDfeyobe6/LRu+N2Tj5f9l4fUt6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1C9HiJNihfVizvjc9F22qjrJObNvr4sdDmuIijca46Q9m5O4bV3++Gdt8fn09mirSefuWUdk4q+rMsm4ls3LRtWfUo01dblYNj4XTVNz8fgPczH/x7k4cF4uzr4wvbr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLeqXJ+UK8VLMsG7MHZ8fG289Whcfnd2Q5OdDzm9O4vLMT1rj7H+2JbHLejU+7z+biew+6fgZzwktuVgwJRe7zs3FuzfkYvPSwj54WS6WPJOLD57PxX2rCvvav6RX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71F/WoF+VLOEDfFDuvHHPI5svXBmDTGicPW36O5dD9jfa69IpOs35lXZ2PeZ9nY66u5qDs91bDpd6m2XmtyMfeNXHz7zVwMLVz3fK2ge43vltOr+6Hb3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvUb96Sc0gb8od4qcYYh2ZSz5PNt/p05rk68pj0ngubpuTOx2TjfEvpeNtDs+6JRf1T+Zi1cu5aC/oGfB6QdvqXDzwdC4qCnpydxfGtdDmoIKuMdenV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Rf1qRnWT2iHJ74UcIo6KJdaTOeVzZVt+3uEHHXHnvmlsa784Xd9XTMpF5TW5mP54Lk5+JR3H5gJ3Q4H7e3fm4uEFuehxai6eOSIXjfvk4svmXFw4Ohc3jkiv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnqL+tXNakf1kxpCHpVLxFMxxboyt3y+fCz6VprDknhenouD5+Ri+F3pOjZebxZ4Bzyejistd+2fixvKcrH13Wzc83A2Oq7MxrVnZmPGjGxcfmx6de+599ppr5/+7LD35rb5xA9//PKPAw8ufDjx4sZPBz1JfVDQRye9Rf32DupnNaQ6Si0hn8op4qrYYn2ZYz5nvqYsyUafmjRu//yRdL1av0P/lM7l+gLbg+25GLghG2NuycZdkwtrZHA2Dng9Ez+/vVDvnJ+Jz76fiU3Hplf3nnuvnfb66c8Oe+yyP3RbfOCXfxx4cOHDiRc3fjrooYs+Oukt6pcf7SHU0WpJ9ZSaQl6VW8RXMcY6M9d83nyKz+L1p9ti2eJHczH1onTcLt2YjueG1mwMeD7VeHe/TAx8rCMuObsj3htfqPEaOuL1qvTq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeo3x7SPspeQj2tplRXqS3kVzlGnBVrrDdzzufO952vp+tz5dJ0rlrP5vAv9svGe09mYtY+qebHxnVE7XOF2n5ae1zdvz3Wv9AW8Zu2aL0hvbr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLeq3j7aXFCftKdTVakv1lRpDnpVrxFsxx7oz93z+GMTtSScUfO+cixWXFuLCTtlk/CY+k47v4P9rj0Vr2+LDb7VFW2F/VzejNZ4tb42hH7bE5tdakqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3qJ+Zwn202KEfZXcob5WY6qz1BryrZwj7oo9vbblbeOA5e4taQyzfo+sLdRCMzri1BvScT6zV1vMO7A1friwsM/f0hzrf9wca0Y2x2vvN8U+LzUlV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRR2dyXrHtn/XgTMG+2t7S/kr8VGerNdVbag55V+4Rf8Ug69BcNB6YrNctPTLJem7fpz0Zx79Nao2q6S2JtiV3NsUdnzbGzZMbY/aHDbHwlob48pL06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qF+N6FzF+rC/tsdM9nFdaT2v5lR3qT3kXzlIHBaLrEdz0rhgmzGoI1nH39zUmsztNQ8WdC9sihcLtml99rf1MfN/dVF+al38qKoumrunV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRR2dyjrTtn3M1Z0vOV5wxWC/2mvZbYom4qvZUf6lB5GG5SDwWk6xLc9P4YFz8VjrXX/t6czKexrdlWn1culdd7JKvjfuPGRvnL6uJxZNr4pWu9Orec++1014//dlhj132+eGPX/5x4MGFDyde3PiTfeMFaRygj056i/qdLcqPzpjUTc4a7LetH/suew/1txpUHaYWkY/lJHFZbLI+zVHjhNV6XrqoMY4f0BALLquLreW1icafXlIdP/j5mLh+5eg44fDR8e+m9Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6jf+aozRuds8qXzFmcO9t32ntaTPYg6XLxVj6lJ5GW5SXwWo6xTc9V4Yf70nfpkbhvXP95THYcPGxNT7x0VB80dGctvrIqBu1XFz94ekVzde+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQlegr6KS3qD+pj8enc995mzMn+VMtYf9tD2ofZn2px8UcdZnaRH6Wo8Rpscp6NWeNG/Yvq8ZGr5HVyTj/36SRcd49I+LA8ZXxeefwyF9SEQsPrkiu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnqL+sVDNaJ62ZmjczdzxvmLfKq+she1H7Mnsd7UpuKwGkWelqvEazHLujV3jR8Nn74xKhnfkedWJlrHvjM09r62PJasGBLDzh+SXN177r122uunPzvsscs+P/zxyz+OpMbeP+XDiRc3fjrooYs+Oukt6vddg/N2Z87ipPrZ+ZszKOcw5lJS369O92XJ3mRyuu7VaWoV+VrOErfFLuvXHDaOtLxaVhmTFg2L+w8tj9WTBsfpKwbGX54ZEANPHpBc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfQW9dsfqQ2cuzt7Vjc5gxQ/nUU5j3EmYV9ujtmf2aOo09Wq1qPYJG/LXeK3GGYdm8vGkybj3GvYoDjt4bL468rdovKS/jFvWP/k6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qN93Tr538d2D/bOawTmss0jnceprcdXZhP25nCP/mnvqdTWrus36lL/lMHFcLLOezWnjStuJm3ZPNJ/28C4xdWjfmDXvK8nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Rv3MS3z3Jj2KEc3h7Seexagnncuor9bYzCvHWXtV+TT5Wt5uT6jc1jPUql4nnYpp1bW4bXxqH3NE37r61d+x7zs6x8p6eydW95+lnU5a0109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6rc39P2bGtH3ML6LUD/Ln/ZVYonzOTWGcxq1p/26Pas4bO8iP6th1XHmqnxu/YrrYpv1nc7xXRKt973UI058Yce46Zodkqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3qJ+9ZD9ke/h7Bntn30n4Vze2bS62h5DfnVW5bxGzFGH2bvav9nDiM9ylXpOTSOvm8PWsxhnnZvrxpvmMzZ9Oe6ts78Y5+rec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6jfd9DOSZyb+T7Od1LqJrnD+bwzaue0zirV286snNvIv/bvahL7OLFJPa+mFbfVNvK7HCfOm9vWuzlv3Gk/7msbks/Avefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXYm+gk56t4//9vW/Pf5vz/+lXv+Vev1f6vu/Ut//l/r5T6mf/5X6+W+pn/+X+vc/pf79X6l//1vq3/+X+u8/Sv33P6X++69S//1fqf/+s9R//1vqv/8u9d//l/rff5T63/+U+t9/lfrf/5X633+W+t//lvK//wdGbKZ/eJzt24mbVNW1BXAQFMUwz1MD3fTcXVXdhXEi9A4mRhSVRBPFxKcxTogTDjzxBR8JRFQCqATU6DPRCKKCKA4oDohG4oQmcYgzEo0zUcSIoOi7v3tT+ScKvs/ves85e6+16pyz9z6nqtu12/Hvg6M+aZu7cWtb1aXt4qRtHeKCb3aKH3+3c3xZ2yUmre8W953aMzr/pXf8b5d+Ma5qQNzUa1C8sH5wDL64Iv7YfVgMOW94nPdQZVR+UBUnbh0RF31YHY88WhPfvbA2cvm6uHhNXRw8uj5+uLg+jttWH332bYiPTm6IcTMb4oQ52dO7dv3GGc+OPT/88cs/HHhw4eOBD1744Ykv3vjTQQ9d9NFJb0m//++zvF3U7tkxNszrFC2rOkePlV1i1qzucUNTr/jVjX3i8K39Yr+qgXFZzeCY1bEipjw4NO7+4fC48cnKWDZ8RDRPqI45Z9dEy1m1ce6P6mL58Pqofr4+epzVEAu3NsSaUxtj5lONcfuApth2eFN8eEFTbLyiKUb9Pnt6167fOOPZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3p93lou25Zp5j6aee4/htdY9CW7rHpzl4x+nt9o255//j7xoGxrOOQeOHTirhj9bC46cRsvucfUh3nXl4TB9xTm87XPcvr0/lcGY3xk7cbY96Uprj0k6a48MfNcd6K5hj/eXP8pTkXVxyWi16n5GL25OzpXbt+44xnx54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropLek35rwuegbVN81Vud6xMRdekfT7X2joTAg5s8cFDcsHxK3rBga7ecNj+77V8VBL42I1gNr4tDf1sbIJ+ti6uv1ce/zDTF3Rab54KrmGLuqObaOysU9S3PxROd8HH5kPn60MB9LHs3Hlrfz8dC2fIxvX0if3rXrN854duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnpL+u0La8PnY8yM4b1j6z/6xl7TBsSkdwfF43UVcXXbsNgnVxndPquKy6+sjgP71cZTZ2fzfe9TDema/fNtTXHE/2Tzu+nxXPzk+5mmH9YVYu35hWh7sBCvbi7EnMEt0WPvlvh0bEvMPjR7eteu3zjj2bHnhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt6Rcb7A9rxOdk7EsLB0TtwMHRe3JFrL9mWLx6bWWced6I6NGYrXX7Ucx6eF5jun/HzGhO17B5u/vmfIzcoxDdlhaiY4+WWHVCS9x7S0uc/FZL7NSjNS5rbY2NY1tjxRGtMfon2dO7dv3GGc+OPT/88cs/HHhw4eOBD1744Ykv3vjTQQ9d9NFJb0m/+ChG2CfWis+Ljbh60JPD4qsNlXH50yPS/SYei89i04qGpviffbP5XtQhH588mI+VPy3Eto2FlPtHT7TEjKGtsf8JrfHh/7VGhydb472NrfFEp2IsHFCML6uKcVJt9vSuXb9xxrNjzw9//PIPBx5c+Hjggxd+eOKLN/500EMXfXTSW9IvR4iTYoX9Ys343NiO+7wyzTnbn6mJudPq4qYODbH1Z41p3LYvv3FnLn45Lx8PHpKt7U6/aInTP29J5/X3t7bGsk2tqcY7vl+Mg84qxqpLinHwNcXovaQYz99ajE63Z0/v2vUbZzw79vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvSX98qRcIV6KGfaNtePz4+OUt2rivBvq0vz8xk2NaVze1jcXnQZkMcx+NT/nbG6Jhydm82c+XzqiGEMuKsbVS4tx5p+KccnLxfjDO8XY8+NiTPlXMeLzYlRszZ7etes3znh27Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oekv61QrypZwhbood9o815HPka8rBWYwTh+2/A47Jx3EHZPt70n0t6f7d9mBr9BpSjMdPLMbd12YaZr2ZafvN18Xo0XFkvJb8d2OHkfFY+5ER7UbG0qTd07t2/cYZz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvSb96Sc0gb8od4qcYYh9ZSz5PPs8oNqf5+paL8ml8FretyUsvao3nv2xN58ka/uKpYqz8sBg/+aoYqxMt1+2UaNtWjDEfFeOmvxfjkReSeV1XjFfWFuP2P2ZP79r1G2c8O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ70l/WpGdZPaQf6UQ8RRscR+sqZ8rnzLz3PnF2LvSVlsW70i298V04txy+pibH43iWcJX/N43/Zi3JPwfu+5Ynz33mJcnnA//BfFuHdiMS5ONPQZV4ymA7Knd+36jTOeHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96SfnWz2lH9pIaQR+US8VRMsa+sLZ8vjIYpLWmuSuP5t4vx+lXFuPn5bB+br4kJz+vezeaVln1OK0bjqGL8+hvFGLWhNR66vzWqr2uNT+e1RsUl2dO7dv3GGc+OPT/8Tfz3eoIDDy58PPDBCz888cUbfzrooYs+Oukt6Xd2UD+rIdVRagn5VE4RV8UW+8sa8znD+vCvrXHFIVncHvj3bH/bvzduytbyyoTbfj8uxvV9kjX+VGvsM7M1XmhrjWd3ao2Bf07qnZtb4heXt8SsS7Knd+36jTOeHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96SfvnRGUIdrZZUT6kp5FW5RXwVY+wza83nDVN8Fq+n75TFsj3eKsZHt2fzNnBgMZ3P8ye0xnWfZhr33bMlrn+7EANuKMTks5Ia77BCnDg2e3rXrt8449mx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLel3hnSOcpZQT6sp1VVqC/lVjhFnxRr7zZrzucPeq0O2z496OVur9rM1POzU1pi8sSW+mJhpPujkQty1Oant5+Sjau98nLstF+uezcUDa7Ond+36jTOeHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96SfudoZ0lx0plCXa22VF+pMeRZuUa8FXPsO2vP54+DuP3mpQl2vhg/XJmsj6bWdP5e/Sib3xtuyEdDp3xMmZKLB7c0x93zmuOIMc1xY8/muGSn7Oldu37jjGfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6TfXYLztBjhXCV3qK/VmOostYZ8K+eIu2LPb/6dt80DLvsmuGKY/fv2+KQWurQQ7f+UzfPOLckZd3JztFuTnPNrmuLcJY1x/IGNcWL3xnj6y4b06V27fuOMZ8eeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3pN9+cKfgXO1s6Xwlfqqz1ZrqLTWHvCv3iL9ikH1oLZoPnOzX2bmWdD+vnpjN91nTm2PZ3Ezznonvbw5uiMLM+tjesz6q19XFxXfVpU/v2vUbZzw79vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvSX9akT3KvaH87UzpnOWs4Z6W82p7lJ7yL9ykDgsFtmP1qR5we3T0YV0H79YmUvX9vHrE91rGuLY2+pTrUe8VBvbqmpj8TU1sfPYmljVlD29a9dvnPHs2PPDH7/8w4EHFz4e+OCFH5744o0/HfTQRR+d9Jb0u1dzt+R+xR2D/eKs6bwlloirak/1lxpEHpaLxGMxyb60Ns0PjnvskkvX8IlnNqbzaX7v/3VtDDqhJn57bHXExSOi67tVscfMqvjZcdnTu3b9xhnPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Jv7tF+dEdk7rJXYPztv3j3OXsof5Wg6rD1CLysZwkLotN9qc1ap5wtZ9Hr62PT0bVxZB7amL2mOpUY4+7KuPzu4ZH3WfD4l8XDItf/ih7eteu3zjj2bHnhz9++YcDDy58PPDBCz888cUbfzrooYs+Oukt6Xe/6o7RPZt86b7FnYNzt7On/eQMog4Xb9VjahJ5WW4Sn8Uo+9RaNV84T9+9Ll3b5vWQFyvjzf2Gx0cvD41XllbE+MeGxHV7D4n+u2VP79r1G2c8O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dKX6Ep30lvSn9fFZ2dp33+bOSf5USzh/O4M6h9lf6nExR12mNpGf5ShxWqyyX61Z84b7xWNHxIKxlek87za9Irq8ODienzwoZhw7MB69c0BUnz8gfXrXrt8449mx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLekXD9WI6mV3ju7drBn3L/Kp+spZ1HnMmcR+U5uKw2oUeVquEq/FLPvW2jV/NEzvOCyd31sXD0q13tm5fzyxpm/sualPLLmpT/r0rl2/ccazY88Pf/zyDwceXPh4pDX2admZCU988cafDnrooo9Oekv6fdfgvt2dszipfnb/5g7KPYy1lNb327JzWXo2mZnte3WaWkW+lrPEbbHL/rWGzSMtJ4waFG892j++Pa1vHDO9d3TY1DOO/rhHXH9Fj/TpXbt+44xnx54f/vjlHw48uPDxwAcv/PDEF2/86aCHLvropLek3/lIbeDe3d2zuskdpPjpLsp9jDsJ53JrzPnMGUWdrla1H8UmeVvuEr/FMPvYWjafNJnnBfv1ip02dI/TP+sat9zZJXp9p0v69K5dv3HGs2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb0u87J9+7+O7B+VnN4B7WXaT7OPW1uOpuwvlczpF/rT31uppV3WZ/yt9ymDgultnP1rR5pW1LZfdU804bOsdHY3aLL27dNX16167fOOPZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3pd0/iuyf5UYxwD+8s6T5WLeFeTn2l3nZHkZ7HkrOq85p8rG63JtVvahj7VS4Tz8U0+9raNr80LvrLbrHv07vEM4s6xlEvdkif3rVnn033dDw79vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvSX9zoa+f1Mj+h7GdxHqZ/nTuUoscT+nxnBPo/Z0XndmFYedXeRnNaw6zlqVz+1fcV1ss7+zNd451Rrbd4p/bv667b+mb2/z9K5dv3HGs2PPD3/88g8HHlz4eOCDF3544os3/nTQQxd9dNJb0q8ecj7yPZwzo/Oz7yTcy7ubVlc7Y8iv7qrc14g56jBnV+c3ZxjxWa5Sz6lp5HVr2H4W4+xza91803zpQVvatjz1Sfr0rl2/ccazY88Pf/zyDwceXPh44IMXfnjiizf+dNBDF3100lvS7zto9yTuzXwf5zspdZPc4X7eHbV7WneV6m13Vu5t5F/ndzWJc5zYpJ5X04rbahv5XY4T561t+92aN++0T1v4Tvr0rl2/ccazY88Pf/zyDwceXPh44IMXfnjiizf+dNBDV6pvcnYvtGP+d+z/HfF/R/4v9/qv3Ov/cj//lfv5v9zvf8r9/q/c73/L/f6/3L//Kffv/8r9+99y//6/3H//Ue6//yn333+V++//yv33n+X++99y//13uf/+v9z//qPc//6n3P/+q9z//q/c//6z3P/+d8e/8v73Sd2HbQvu29x28D+3tU3a0C5+OaRjHNOUxIduneOMtd+I1Yd1i673JHnh014xvnPfWLqtX7y8dkAMPXNQ/GnL4Bh+TEX8/MahUfPXYTHxjeEx+9nKWLu0KsaelsTIvsm+WFId46trYsKcpCbZUBMDKmtj86G1MX5SbUw8J3t6167fOOPZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3p9/8tTV+0NVS0j7emdIyR13WK3td2jktO7xI39uoeF8/tGUe80Tv279wvFnQZELM/GBhTFw2OVaMq0lh7267DoxCVcdlRVTFywoiY+q3qWLFrTdTfXxN9JtTGb9+ojUcPq4uL7qiLu9rVx1f71sfHJ9THpgvqI2ZlT+/a9RtnPDv2/PDHL/9w4MGFjwc+eOGHJ754408HPXTRRye9Jf0+D22LftMxpr3SKRZv7hxDX+8S/7q6e3w71ysaF/aJt5/rF7d/MCBefmVQrFw8JJYenM33wj0qY+rUqhj3uxHpfN2/sCadz1W1dXHsurqYf3R9/OalJGaPaYifX9UQh69viOd7N8bV+zRGv+83xtwjs6d37fqNM54de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3pJ+a8Lnom9o993jkT5d49SN3aNwZa/I9esbCyf1jyULB8byqwbHzlMqonfzsDjkoeGxR0tV/OAXI2KvFdUx7dGauP/+pAa5KtM8vnNDHHxdQ1LbNsZ98xvj6U2NcWRbU0yY1hS3LE1i/bqmeGRDUxz2bvb0rl2/ccazY88Pf/zyDwceXPh44IMXfnjiizf+dNBDF3100lvSb19YGz4fY2bt2iO+fKpXjDq+b5zxTP9Y121Q/K5mSIzuMzR6vZbM+f9WxiFfVcWfj8rm+4E7atM1++wV9XHUcdn8fnpbYxyzV6bpyG7N8cRPm2O/Rc3xxstJXu+Qi97DcrGlkIt538ye3rXrN854duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnpL+sUG+8Ma8TkZ++q0vtHYfkD0O3JQvDljSLzxq6Fx9jHDo0/PbK3bj2LW2il16f797ikN6Ro2b6sua4o9BzdHz/nNsWtSzzwwLhcPXJ6LU5/Mxc6f52JBcl7dVMjHXaPzMWa/7Oldu37jjGfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uik9z8JoFsW6+wTa8XnxUZcPXTFkNjp8aGx4K7h6X4Tj8VnsenuHvVxQWU23ze93xj/WtQU9x3QHNufyzRvvj0Xs3bJx4Hj8vHxzHzssiIfHz6Xj3X/zMdV7QrRbvdCTOqaPb1r12+c8ezY88Mfv/zDgQcXPh744IUfnvjijT8d9NBFH530luTLEeKkWGG/WDM+N7bj1w9Nc077lVVx2fFJzfV+TWw/sC6N2/Zl96sb48KkRl2zR7a2dz85F5PX59J5/cOCfNz2Yj7VuHKvQhw6oRAPTC7E92cUov+8Qry0oBC7X5k9vWvXb5zx7Njzwx+//MOBBxc+HvjghR+e+OKNPx300EUfnfSW9MuTcoV4KWbYN9aOz4+P05+sip/Prk7z81uX1qVxefv2hti9XRa77Ffzc97LuVg7Pps/8/na6EIMO6MQv5tfiHNuLcTcNYW48elC7PO3Qkx9tRD7rU+y2BvZ07t2/cYZz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvSb9aQb6UM8RNscP+sYZ8jnxNHZnFOHHY/hu3f1OckM/29+nX59L9+9WifPTrmKzjgwtx768yDbOfyLRd+XYhen9QiA3Jfze/X4in3i3Ed95J5vft7Oldu37jjGfHnh/++OUfDjy48PHABy/88MQXb/zpoIcu+uikt6RfvaRmkDflDvFTDLGPrCWfJ59nD2xI8/XyM5rS+CxuW5Pzz8jHS2/m03myhr+6oxCrni3EMf8oxMOJlkXvJdo2FGL/Fwqx7PFC/OmBZF7vLMTrywpx5y3Z07t2/cYZz449P/zxyz8ceHDh44EPXvjhiS/e+NNBD1300UlvSb+aUd2kdpA/5RBxVCyxn6wpnyvf8vPl5zfHt36QxbaHr8r2d+VJhbh1cSG2PJPEs7ezeXzwrULcl/DeeF8hxv6+EAsT7keenOzx8YWYk2joXyxEIZ89vWvXb5zx7Njzwx+//MOBBxc+HvjghR+e+OKNPx300EUfnfSW9Kub1Y7qJzWEPCqXiKdiin1lbfl8YeSOznKY/bixrhB/n57M2/3ZPjZfpyXzteiZbF5pGX14IfJVhZi3OR/xWD7++Id81F+Uj8+n5KNycvb0rl2/ccazY88Pf6f9ez3BgQcXPh744IUfnvimcSrhTwc9dNFHJ70l/c4O6mc1pDpKLSGfyilpXE1ii/1ljfmcYX18bz6u3iOL2xWPZ/vV/r3lxWwtr0q4fW9MIRZ/meT3O/IxelKyR2ry8bf3clGxMhd9LsvFr6Zm9x+e3rXrN854duz54Y9f/uHAgwsfD3zwwg9PfPHGnw566KKPTnpL+uVHZwh1tFpSPaWmkFflFvFVjLHPrDWfN0zxWbye8V4Ww/Z+shCbr8zmraJ9IZ3PaZGPRa9kGtsqcrF4XXMMmd0c505ojsf3aY5TCtnTu3b9xhnPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9JvzOkc5SzhHpaTamuUlvIr3KMOCvW2G/WnM8d9qj3s/35X2uytWo/W8MjDsvHuc/l4uvxmeZDDm2Oe19OauFzmqJ2WFOct6Ex/rKqMdYsy57etes3znh27Pnhj1/+4cCDCx8PfPDCD0988cafDnrooo9Oekv6naOdJcVJZwp1tdpSfaXGkGflGvFWzLHvrD2fPw7i9jv/XYhH+hZiwrX56NQrn87fGy9k87tkdlPk/tkY5x/dGA+/3hCrpjTEj+sb4uat9TH3vfr06V27fuOMZ8eeH/745R8OPLjw8cAHL/zwxBdv/Omghy766KS3pN9dgvO0GOFcJXeor9WY6iy1hnwr54i7Ys+V/87b5gGXtgRXDLN/398zqYX+uzl2vjWb5137J2fcIxui45LknN+lPqbOq4uTWurilC218dc3a9Ond+36jTOeHfvUT+KPX/7hwIMLHw988MIPT3zxxp8Oeuiij056S/rtB3cK6fk9OVs6X4mf6my1pnpLzSHvyj3irxhkH1qL5gMn+3Ven1y6nx8Z35TO45STGuK2czPN+ya+9+5QGyMn1UT7bdVRf2d1zLkme3rXrt8449mx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLelXI7pXsT+cr50x0/P3AVk9r+ZUd6k95F85SBwWi+xHa9K84PZ5dXO6j1/drTFd2yetTXQvqY3jr6hJtR710Ij4qvOIuHlGVexWqIoHe2VP79r1G2c8O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dKX3B4lOekv63au5W3K/4o7BfnHWdN4SS8RVtaf6Sw0iD8tF4rGYZF9am+YHx703Zmv9lCPq0vk0vw+dPSIqxlXFtd+rjO+cOTx6PjMs9p40LE4cmz29a9dvnPHs2PPDH7/8w4EHFz4e+OCFH5744o0/HfTQld7NJDrpLel3tyg/pndMSd3krsF52/5x7nL2UH+rQdVhahH5WE4Sl8Um+9MaNU+42s9jltXEZ1XVMfx3VTGvvjLV2OeaofHlNRXR9NqQ2HrCkLjwW9nTu3b9xhnPjj0//PHLPxx4cOHjgQ9e+OGJL97400EPXfTRSW9Jv/tVd4zu2eRL9y3uHJy7nT3tJ2cQdbh4qx5Tk8jLcpP4LEbZp9aq+cJ5xicj0rVtXn+wemi801ARm9cMjvXzB8XhywfGomEDY/DHA9Knd+36jTOeHXt++OOXfzjw4MLHAx+88MMTX7zxp4Meuuijk96S/rQ+npCtffdt7pzkT7WE87czqHOY/aUeF3PUZWoT+VmOEqfFKvvVmjVvuM8pDI+rCkPTee5y0qDosXpAvHRk/7jwe/3i8av7Rt1P+6ZP79r1G2c8O/b88Mcv/3DgwYWPBz544YcnvnjjTwc9dNFHJ70l/eKhGlG97M7RvZs14/5FPlVfOYs6jzmT2G9qU3FYjSJPy1XitZhl31q75o+GmR8MTud3xZz+qdZ7NvWOdUt6xb4v9oyll/ZMn9616zfOeHbs+eGPX/7hwIMLH4+0xj4844cnvnjjTwc9dNFHJ73/Of9V16T37e6cxUn1s/s3d1DuYayltL7fkJ3L0rPJpGzfq9PUKvK1nCVui132rzVsHmmZWNU/3l3aJ75zfK847qQe0enFbnHs37rG4gu6pk/v2vUbZzw79vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvSX9zkdqA/fu7p7VTe4gxU93Ue5j3Ek4l1tjzmfOKOp0tar9KDbJ23KX+C2G2cfWsvmkyTxf1dA9dn6sS0x+bfdYfnXn6NfYOX16167fOOPZseeHP375hwMPLnw88MELPzzxxRt/Ouihiz466S3p952T71189+D8rGZwD+su0n2c+lpcdTfhfC7nyL/Wnnpdzapusz/lbzlMHBfL7Gdr2rzS9sVuXVLNuzzWKTbX7xJfL9g5fXrXrt8449mx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrpLel3T+K7J/lRjHAP7yzpPlYt4V5OfaXedkeRnseSs6rzmnysbrcm1W9qGPtVLhPPxTT72to2vzQuuWeXaLurQ/z11+3j6NXt0qd37fqNM54de37445d/OPDgwscDH7zwwxNfvPGngx666KOT3pJ+Z0Pfv6kRfQ/juwj1s/zpXCWWuJ9TY7inUXs6rzuzisPOLvKzGlYdZ63K5+n+TeK62GZ/W+PmmdZZj33d9tmarW0nHrIlfXrXrt8449mx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrp/U/8m5Sd93wP58zo/Ow7Cffy7qbV1c4Y8qu7Kvc1Yo46zNnV+c0ZRnyWq9Rzahp53Rq2n8U4+9xaN980XzlgU9tXv/0wfXrXrt8449mx54c/fvmHAw8ufDzwwQs/PPHFG3866KGLPjrp/U/9f052z+PezPdxvpNSN8kd7ufdUbundVep3nZn5d5G/nV+V5M4x4lN6nk1rbittpHf5Thx3tq236158077zOM3pE/v2vUbZzw79vzwxy//cODBhY8HPnjhhye+eONPBz100UcnvTvmf8f+3xH/d+T/cq//yr3+L/fzX7mf/8v9/qfc7//K/f633O//y/37n3L//q/cv/8t9+//y/33H+X++59y//1Xuf/+r9x//1nuv/8t999/l/vv/8v97z/K/e9/yv3vv8r97//K/e8/y/3vf8v53/8DHRBcDnic7duHm1XVucdxEASBQcoAMwPD9Dll5owtWLCdV2MMUWNu1MSIJYJca4jYLqISsUSjURETY48aLrZEIdYoGM21RCQxNojlaiygoNcKogQld3/25uSfOPA8Ptu991rv+/2dtdb7vmudM716bfr37ikryhf3+6C85/g15SWD15e//J9e8fJzfeLMe/vFqhMGxPh1g+Jnh28ZG64ZGk/PHx75m0bEQT8aFdeOrI89b2iI6/uOibX7NcZN08fG8p82Rb8ZzbHHAS3x2PDW+N3C1thi/7ZY8nRbvLBde7xxQXv84s/tMfWz9nh6aEe83dCRXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvT7/87pa8r7XLi+/MPG3jF/774x++v9Y/MRA6PtwZroM25IPP/TYfGn+bUx5J6RsfmculizT0OMe2t0dP6gMbrvGhu/XdEUg3q1xPwNLbH6rdbouast5k5qj9kb2mPEBR1RXtcRmx3SGVvf0hmnv9kZxw/KxY86cvFQKbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3o93l41rxz7/h8Vt9ouaZ/XHPewDhxj8Gx6IUhccsuw+PIM0ZEac6oOOic+thuv9GRXz0mHYdhrzbFmqaWeHKvbJx32DUb1+3/2hGvnNwZW/bJxZCzc9F3ZS7W7p6PZ87Px3ceysfIN/Jxxdp8DNiQXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvSbEz4X7669r3/stnBgvHvF4Lhjt6Fx26LhMWzYyGjbtS6K5YaYNWZMXPZ8Yyz+z6ZYsKw5/pprjbsPbovPj2+PHSd3RE0507xkfi6e2jsf0xfnY4fxhZhwVSGeX16IF9uKkTugGKedUozdLyzGM5dmV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3Whbnh89Gm912DY/rJQ+P+AbWx6tSR8c376qLhLw3x4EOJ9nOTMe9M/M1tiX16ZeO90yHZ3N5/t1ws7Z+N44nfL8QrrxVSTS/cW4y9+nfFH/fpiomzumLQ7V0x+4muOHlZVwz83+zq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeiX2ywPswRn5O2B7fXxrxbRsYVX9XF4cXRMbG7MT7s2xSzH2hO5571KGZFY2e6fh8dks1h47b9jsW4+0/FuHSnrjj3hq7Y6dOu2HGn7nhnWnfMuqE7hj7SHScs645tlnfHopXZ1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/4KEZYJ+aKz0sfcXXxwaNj5o8bY+ih2ToXj8VnsWmbBzpj3Z9z6bh0XF6IafsmjB8W4/QzMs0/Prg7ev+uOx7/pDuO7yrFOQeX4pgzSjHhl6UYcUspzlhQihX3ZFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX9coQ4KVZYL+aMz03fp89vTHPOmYe1RM3Atihc3h7TP+5I47Z1eXEUondjMXZ9tZjO3QsGd8f/nZ+Na9Mupej+SaZx29dL8fSGUuxU1xNLCj1xxbieOHCXnrhgt+zq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeiX56UK8RLMcO6MXd8fmysnNYSa7dpS/PzETt0pnH59Ln5uGBeIY1d1qvx+fTs7oi13en4Gc+Dl5fiuhE9MXp8T3x4YE9scUxPtJ7aE/ed1RNrzumJP57fEzf8NLu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3oVyvIl3KGuCl2WD/mkM+RrTUvt6cxRxy2/p58vxBvvFhM1+eqb2br9/R9SzHn9mQery7FuO5Mw+bTMm21l/TE7Mt74tA5PdGZXPe+LNGdPOu6JLu679z4Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+tVLagZ5U+4QP8UQ68hc8nmy+cEjuTRfF0dm8VzcNie3HFmKgy7KxtscnnFIT2w/oydeubgndkv0tMxOtF3YE4+e2RP5E3tij6OScU3aHJLo2vq72dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/mlHdpHZI83uSQ8RRscR6Mqd8rmzLzzUtXfHA511pbNqtnK3TG2p6orhfT5x0Wk+c8fNsHMcn3Dsk3MdM6onHvtETQ4s98fzgnthxbSn6Jxp+8VIp7ngxu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprehXN6sd1U9qCHlULhFPxRTrytzy+fJx22ZZrkrj+TOlOCzXE4XJ2To2XisT3ubTsnGl5Q/rSnH7U6UYeE0pFk4txe7fKsV/95Ti5MZSXD8qu7r33HvttNdPf3bYW7lxPvHDH7/848CDCx9OvLjx00FPWh8k+uikt6Lf3kH9rIZUR6kl5FM5RVwVW6wvc8znzNfxPyzFyFdLady++sfZerV+O3+SzeXtE7Y/vVuKlt+UYutDEi1Dkzn7l+747uzuuPqw7pi9Q3f0au6Ozeuyq3vPvddOe/30Z4c9dtnv3Bgf+OUfBx5c+HDixY2fDnrooo9Oeiv65Ud7CHW0WlI9paaQV+UW8VWMsc7MNZ83n+KzeL1hYyy7N4lVU3fPxvuaW7Lx/GJFdzSfk2l88LGuaDmlK67epis+2pDEkDeKsWJpdnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTS++/9T7KHtI+yl1BPqynVVWoL+VWOEWfFGuvNnPO58/3A7Gx9vnR0NtetZ3P41190x0czumPG2kzT4jXF+NqspLZvKMbNTxRi9QWF2PfIQuxyYHZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvRbx9tLylO2lOoq9WW6is1hjwr14i3Yo51Z+75/DGI25PHJmtzUSle/HoyDn/IxnviWV3p+LZtW4zbflGIzzYrxK7J/m5cY1LHP5OLzhtzscXs7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6LfWYL9tBhhXyV3qK/VmOostYZ8K+eIu2JP7ca8bRywPHhPFsOs3ymvJbVQY1ecfWAxHdfzHs7HnK9y8ZNv5+KEezpj9bjOeGtZRyy/viP2uyi7uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6LcenCnYV9tb2l+Jn+pstaZ6S80h78o94q8YZB2ai8YDk/U6YGFXup53W5uN98c1+egek0u13TepI+69rT3uGtoeZ97YFnMPaYv+e2ZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/WpE5yrWh/21PWa6j0v2GuptNae6S+0h/8pB4rBYZD2ak8YF28lLsvX9/fn5dG6/dUJn3P/tjng9sU3r0v9sjdMXtERHsSXOX9oc4x9sTq/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6nas5W3K+4ozBerHXtN8SS8RVtaf6Sw0iD8tF4rGYZF2am8YH4z1X5NM5vPzLbLyN784NrXHNJ81R/0FTPDKyKS45dWzcM3RsvPlhY3p177n32mmvn/7ssMcu+/zwxy//OPDgwocTL2786b5xxywO0EcnvRX9zhblR2dM6iZnDfbb1o99l72H+lsNqg5Ti8jHcpK4LDZZn+aoccJqPS86oD2mLW6N6/ZqiYF/yzRfvkdj/NeeY+LWc0fHKYOSHPR2Q3p177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvR73zVGaNzNvnSeYszB/tue0/ryR5EHS7eqsfUJPKy3CQ+i1HWqblqvDBvuKo1ndvG9S9TGmPSs6Nj6jENccj4+njmoLpoeXJU/OrKUenVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXam+RCe9Ff1pfbyhPZ0bztucOcmfagn7b3tQ+zDrSz0u5qjL1CbysxwlTotV1qs5a9yw9182NmqXjUnH+cKa+vj5lFFx4IYR0fuD2vj6HrUxt192de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0S8eqhHVy84cnbuZM85f5FP1lb2o/Zg9ifWmNhWH1SjytFwlXotZ1q25a/xo+NflDen4lr42MtW63VXDYsL+Q+P+mUMit8OQ9Orec++1014//dlhj132+eGPX/5xpDV2woUPJ17c+Omghy766KS3ot93Dc7bnTmLk+pn52/OoJzDmEtpfX9hti9L9yZJfW79qdPUKvK1nCVui13WrzlsHGl5+6kRcdQBw+ORAUPjtZot45yZNfHqWYOipWNQenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9Fvf6Q2cO7u7Fnd5AxS/HQW5TzGmYR9uTlmf2aPok5Xq1qPYpO8LXeJ32KYdWwuG0+ajHPtszUxa+rA+L9zt4jiHv1jzrP90qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+3zn53sV3D/bPagbnsM4incepr8VVZxP253KO/GvuqdfVrOo261P+lsPEcbHMejanjSttp80fkGqeNbVvTP3bZjFjl83Sq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7nJL57kh/FCOfw9pLOY9USzuXUV+ptZxTirb2q/Zp8rG43J9VvahjrVS4Tz8U069rcNr40th/RJx6a2CuunfJlecHif5Zd3XuefTYD0/b66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX99oa+f1Mj+h7GdxHqZ/nTvkoscT6nxnBOo/a0X7dnFYftXeRnNaw6zlyVz61fcV1ss76zOd431X5W7bry+zWry4de83F6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0a8esj/yPZw9o/2z7yScyzubVlfbY8ivzqqc14g56jB7V/s3exjxWa5Sz6lp5HVz2HoW46xzc91403zplPfKq1esSK/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6fQftnMS5me/jfCelbpI7nM87o3ZO66xSve3MyrmN/Gv/riaxjxOb1PNqWnFbbSO/y3HivLltvZvzxp32GfNfSa/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9OejeN/6b1vyn+b8r/1V7/VXv9X+37v2rf/1f7+U+1n/9V+/lvtZ//V/v3P9X+/V+1f/9b7d//V/vvP6r99z/V/vuvav/9X7X//rPaf/9b7b//rvbf/1f7339U+9//VPvff1X73/9V+99/Vvvf/276V93/nt7l9fLUZ1aUO3p/UL5r6eryq9/+Z3nJ9r3iR/V94tW/bR7dh28RM/40MD76qiYW1g6J+r7DYu9nh8fPZ4yIr/UeFZceWxfvLqiPOa82xNJVo+Pz/03W4v2Ncd9/jY1fNzfFut83xaKtmuPxXzXHc+81x0+7W+KIQ1pi0akt8eLM7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Lf/29R/qBc+s6a8k291pdvuqNXzLq1T6yd3i9qxw6Iz64aFI+tGhx31yY5pG54rF1TGyvuGhmde9dF3aL6aBw+Oq7/1pj48qjGuGny2Fi+d1M0DW+OK59ojnMmt0S/91pi28NbY/Wi1mhJarPjvtEWh57YFof/rC1+d3l2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0e/z8Kx11/XlVct7xbCv+sTF7/aLI+cNiDt3rImrbtwyvvv60Bj72fD4xooR0b5gVNQfnI33ZuUxseLcxnjgtrHpeOVvak7HM7dtayxZ1hr/Oroter3dFp/t2x7v/qY9HlnZHns0dUT/vTrivIkd8c9J2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/OeFz8e7nDX1jq+b+8dLaAXHdzTVxbcuQ2Oy0YTHiptoYPXdknHR2XZy9Q0M8tHh03LxzY/zx4rExd2GyR3qmOQpPtsRXv8k0L6ptjwfvaI9jezoif0NH7Ly+Ix6b0BlPXNAZdfd3xtF/T2L9+53xyCfZ1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb91YW74fLRZPWxgHLusJm6bOiReeWlY7NQwIgZtMyruaKqPs99JxvyiMfFQ/7Gxy5RsvIsPt6RztnxzkpdPyMb3yIc6YskemabH63Oxwwm5mH9XLvZbnosva/Ixq5iPo3bOx/pydnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9EvNlgf5ojPSdsJFw6JXw0cHudNGhH7Xzoq9ptdH/84dnRSX2Vz3XoUs7ad1Zqu39+f0p7OYeOWu64z5nbm4ifX5+KU3vkofj/57/p8vPRiPk7qnewX2wtx+M6FaJ1QiDv3y67uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv6xUcxwjoxV3xe+oirCxeOih8/Xx+9HxmdrjfxWHwWm9rGtMV73dl4j1zTEZPmd0b+gFwc93ouZf/hwnx8OqQQ93+vEIddVoiTFxbiB68XYvwXhdh8YDFOGFGMv9dlV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9/57/SY4QJ8UK68Wc8bnpu3BlfZpzpj7aGF9NbYqGNc1x7EGtady2Ls/874749OzO6Clnc3v6Sfl4bWU+HdchNxai8a1CqrF9z2IsnFyM4pnFePiSYpx/dbInurEY02/Oru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/rlSblCvBQzrBtzx+fHxisvNsbKXzal+fk717amcfm4/h0xfUAWu6xX4/P22/nYbmI2fsZzwoRiXHJ6MQbdUIx/PFCMdU8Xo/alYtzi3H9FMeavLMZlq7Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfrWCfClniJtih/VjDvkc2VqxWxbjxGHr7w/f6YzndsrW9yu/zafr97j5hTh3cDKPDy5G5+xMw+cvZNr6flyMWWuK8e3PijEque74aTEWJM8aP86u7kdtfK+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3qJTWDvCl3iJ9iiHVkLvk82Xy9vT3N16NndKbxWdw2J/91eiG+8UEhHSdz+PiHk73sa8VY8mExtkr0DFudaHu/GHf/oxj1iZ7t/pyMa9Jmn0RXy33Z1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb+aUd2kdkjz+zsNaRwVS6wnc8rnyrb8vOG8XNx+aBbbtpqbre/LphVj9IJiHPVyEs8+ysaxK+HOJ9w/eKIY995ejM2Svf7jJyVrfGIxvvhmsuZ3LcZ1O2VX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/epmtaP6SQ0hj8ol4qmYYl2ZWz5fPq45Op/mqjSeb1eM/S8uRsOT2To2Xi8nvMNezsaVljsOL8a1pWKs/7IQv3uuENvcWYgr5xRiyqxCXHpGdnXvuffaaa+f/uyw9/LG+cQPf/zyjwMPLnw48eLGTwc9aX2Q6KOT3op+ewf1sxpSHaWWkE/lFHFVbLG+zDGfM1+HPlaI/uUsbl/0fLZerd+6t7K5nEvY7tk34e5XjNaHk/E5NVkj2xRiz9X5uPjRpN65Nh+fnJuPtWdkV/eee6+d9vrpzw577LI/amN84Jd/HHhw4cOJFzd+Ouihiz466a3olx/tIdTRakn1lJpCXpVbxFcxxjoz13zefIrP4vVHG2PZvBeLccRvsnG7OInXxnPVtwoxdEWm8bf5fAz7ey4u+mUu3pici+33ysWy8dnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fvz2kfZS9hHpaTamuUlvIr3KMOCvWWG/mnM+d79tWZ+tz8dPZXLWezeHZhxXizdfycfzETPNDP8hFx/KkFp7ZGVcUO2P5ex2x6+MdUXogu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprei3j7aXFCftKdTVakv1lRpDnpVrxFsxx7oz93z+GMTtA88pxtYtxXji1kKc0lhIx2/fN7LxHXFlZ1z7eUe8c3RHbJXs73Kz2uPJ7dpjVJ8kpn7all7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb0O0uwnxYj7KvkDvW1GlOdpdaQb+UccVfs6bsxbxsHLL9N/Iph1u/39khqoVm5mPZANs6ntiZ73EntceLv2+KwurZYfnVrvLBzayzr1Rq7f9CSXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvRbD84U7KvtLe2vxE91tlpTvaXmkHflHvFXDLIOzUXjgcl6Xd+UT9fz1hM703F8c1p7NJ6dab7liZaYV9MSN57aHFP7NMeVDzfFF/Oa0qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+NaJzFevD/toeM91/H5DV82pOdZfaQ/6Vg8Rhsch6NCeNC7YpW+fSdTyhtiOd2y/8rTVu/X1LPJvYpvXJxWPjuBFjY+SljXHa+MboGptd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9DtXc7bkfMUZg/Vir2m/JZaIq2pP9ZcaRB6Wi8RjMcm6NDeND8Z5a7O5vvTI1nQ8jW9p5ti4+HuNMeC7Y2LBjNEx86WGmHdqQzx/QHZ177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDV3o2k+ikt6Lf2aL8mJ4xJXWTswb7bevHvsveQ/2tBlWHqUXkYzlJXBabrE9z1DhhtZ7vvL85Jvc0xSW3Ncb67cakGs+ZVx/H3FIXV78zKqacOCo+2Tu7uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6He+6ozROZt86bzFmYN9t72n9WQPog4Xb9VjahJ5WW4Sn8Uo69RcNV6YP1o/Np3bxvXhp+rjgHF1ccSSkbHPDSPi0T/UxrCu2rhw3fD06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omgh65UX6KT3op+9bFzVnPDeZszJ/lTLWH/bQ9qH2Z9qcfFHHWZ2kR+lqPEabHKejVnjRv2deNHR9+d69NxnjFtRMx8anjsNXlYfPofQ2PcvCHxy+OHpFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX94qEaUb3szNG5mznj/EU+VV/Zi9qP2ZNYb2pTcViNIk/LVeK1mGXdmrvGj4aP14xMx7fpqmGp1vb1g2P83TVx65uDou7aQenVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRmerd+M93Dc7bnTmLk+pn52/OoJzDmEtpff9+ti+zN1GfW3/qNLWKfC1nidtil/VrDhtHWpaWhsVB928ZC6bWxDPTBsbJb24Rf3mjfwz/Wf/06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot/+SG3g3N3Zs7rJGaT46SzKeYwzCftyc8z+zB5Fna5WtR7FJnlb7hK/xTDr2Fw2njQZ583HDYiTnusXr73TN8bM6xPnjeuTXt177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvT7zsn3Lr57sH9WMziHdRbpPE59La46m7A/l3PkX3NPva5mVbdZn/K3HCaOi2XWszltXGk7prZfqvmk53rFw0dvKC/d/auyq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7nJL57kh/FCOfw9pLOY9USzuXUV+ptZxTpfizZq9qvycfqdnNS/aaGsV7lMvFcTLOuzW3jS2Ph/H+Vvz9zXfms0mflK+asTq/uPc8+m35pe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein57Q9+/qRF9D+O7CPWz/GlfJZY4n1NjOKdRe9qv27OKw/Yu8rMaVh1nrsrn1q+4LrZZ39kc7xW0HvHqJ+W/vvh+ebdJq9Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk95/x79Ts/2e7+HsGe2ffSfhXN7ZtLraHkN+dVblvEbMUYfZu9q/2cOIz3KVek5NI6+bw9azGGedm+vGm+YTS2+Xl935enp177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvR7zto5yTOzXwf5zspdZPc4XzeGbVzWmeV6m1nVs5t5F/7dzWJfZzYpJ5X04rbahv5XY4T581t692cN+60Hzb9hfTq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropHfT+G9a/5vi/6b8X+31X7XX/9W+/6v2/X+1n/9U+/lftZ//Vvv5f7V//1Pt3/9V+/e/1f79f7X//qPaf/9T7b//qvbf/1X77z+r/fe/1f7772r//X+1//1Htf/9T7X//Ve1//1ftf/9Z7X//W81//t/oASXzHic7duHm1XV1cdxehsGhmF6vXdm7sQ3ouaNhsSCd4kSNWqMvjEaFJUAGgl2jRIJEiHmtWF9xViiohJrxBITiVFiA0uI2CJiwxILoAGVYuM9n3O4+ScuPI/P8Zyz91rf3917r7X2vnd69Njy78oZLxZHDX+t+OmYd4rTm1YVb79kbXHS/A3Fm0/9qrj72p5x6Zl9YsVb/eLg3MDoHFkRM7or4w9rh8THV1XFVZ3V8em5w2P/52pi45e1MWpwfRyxqT6ufKkhWn/bGP1GN8X455ui64DmGHF/c+xY2RKr92uJx89oia45LbHLddnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Jv/9/aeY7xS8uXVU8YczHxaorNxafuXRT8fAre8UZxb4xbkH/2HrwoGgaOTiO2XFIHF5fFfstHRYX/HR4nPlaTczaoS76TKmPiWc3xIBfN8a+xzTF2Ts0x5fvNsf7s1riuMGt8dszW+PQ11vjf0e0xdKj2+LRi9visVvbouae7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Tf5+HZmhkfF68f8llxanuPWDuwdyxe1Ddqxw6ITX8bFAt6VMav64fGHf2HxXnPVseMqdl4Tx5fH/vd1BDtTzWm43Xhw83peM7+n9bYfmNrHH1OW/y0b3uMO6499n+sPb5WkYtbIhfHH5WLldNy8ZNZ2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0m/OeFz8e7jnXvE5bv1jmjsF30eHRC9dq+IyXMqY9rDQ+Osx4bFsuuHx7uH1EbHqroYOK4huu9ojIrXmuKANc1x0XstMemxTHPXyPbI/709ntk/Fxc+lIu5rfnY+mf52OaWfJz5Uj6WbMzHnMqO+FpNR3p177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvSb12YGz4fbQ7doV88s2FAVF1UEaM/r4zrdq6Kkw+sjurdauLdAXUx+bb66Ph6Y9xwdjbeF7/eks7Z3z/SFtvObk/HcfErudh+YqZpxM4d8bsLOqJ+aUfc268zJm7XGe/t0xlPHdYZE36SXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvSLDdaHOeJz0nb+LRWxacSQWDmzKu67szruvasm9jyvLt4blc1161HM+u3c1nT9Nl7ens5h4zb7r/mo2Ksj/vVgRyzv7IyLT0/+e7AzYn1nLOvsimPGdMVjh3XFOZO7ovb47Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6RffBQjrBNzxeelj7ja+Vp1vPhJTRyzoi5db+Kx+Cw2nTuqLQ78fjbev6zLxxNLkzl7Skcs7ZGxL3q1M8Z+syvaTu+KR+d3xcuvdsXCHoW4vqkQx44oxHMjC1HcKbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3plyPESbHCejFnfG76dlZkOe2FNxti0kVN8au6lnjm561p3LYu33o8F2Pn5uP/xmdz+/VLO2NMRTaup/2tK2b1yTSeN7EQnb8uxMXXFKJwZyFWLSjE7X8rxOuPZFf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX98qRcIV6KGdaNuePzY2P0+ob4wZ+a0vz8pwda07i89L9y8frWWQyzXo3PPv264spp2Tgbz/mTC/HJlYU4+aFC7PlyIcavLsQZnxViSO/u2G9Ad9RXdMe6iuzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLekX60gX8oZ4qbYYf2YQz5HtvY7Motx4rD1lzspHzsemq3v0Us60/W7dGlXrNwumcdTC3HBXZmGI9YVUm1Tqrvjvbru+GN9d0xPrtfWdEfD8O6YVZ1d3U/f/F477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056S/rVS2oGeVPuED/FEOvIXPJ5svnd77an+XrmVfk0Povb5uTRV3XFHUOzcTKHn329ELM3FWL7Yd1xeaJnam2irbI7mnp1x4xPC3HV+8m4Jm3uXlaI//1ndnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9KvZlQ3qR3S/D4gi/NiifVkTvlc2Zafj5rXEcOmZ7Ht8se60nW67pJCnPVsIZ76vBDPD8vG8ZKq7rgw4V74biFani7E5IR9xGXJGp9WiCMTDasOL0TvQ7Ore8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96SfnWz2lH9pIaQR+US8VRMsa7MLZ8vHz3P6UxzVRrPf1iI+24vxK/eK6Tr2HjtlnBO/TwbV1qqZxSi1/6FmNBeiJpPuuKKf3TFl/d0xdNzu+LTq7Ore8+91057/fRnh73dNs8nfvjjl38ceHDhw4kXN3466Enrg0QfnfSW9Ns7qJ/VkOootYR8KqeIq2KL9WWO+Zz5euSdrjh+fBa313xSSNer9Xtmn+50Ls9O2JqPS7i3KsQ5ryfjMydZIwd2xa21XbH2zaTeeaAzfnxTZxx+TXZ177n32mmvn/7ssMcu+9M3xwd++ceBBxc+nHhx46eDHrroo5Pekn750R5CHa2WVE+pKeRVuUV8FWOsM3PN582n+CxeH1ybxbDK9YVY9Gg2bmuTeG08D5jSFaf370o1Dv9eZ/xiY0esua8j9vp1R1xzVEfselh2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0m8PaR9lL6GeVlOqq9QW8qscI86KNdabOedz57uqLlvn/706m6vWszm8fnpX7N2jK56dlmnuOKMjzu+X1LTX5eOzffKxb2U+bvxXLi5blkuv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnr/s/9L9tH2kuKkPYW6Wm2pvlJjyLNyjXgr5lh35p7PH4O4/ZcbCjFndCG2eTLxvWs23vf26kzHd9qf8tGrKR/fPycXlw/Kxey57bHtQe0xvZDE1Nrs6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pN9Zgv20GGFfJXeor9WY6iy1hnwr54i7Ys+UzXnbOGAZnvgVw6zfv05IaqEbOuKlZdk4v7J7ssed2R7/fC7Z5+/YFvv+pTV2Htcau3a2xryh2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0m/9eBMwb7a3tL+SvxUZ6s11VtqDnlX7hF/xSDr0Fw0Hpis1wm7dabrec60bLz3vrQ9Zl2faR6S2K7criUGzGmOFwrN8eXrTXHk4qb06t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KT3P+c/SY3oXMX6sL+2x0z338leQ72t5lR3qT3kXzlIHBaLrEdz0rhge/qAjnQdz/9WLp3bO69tjaHPt8R3HmlOtW67qjGWjmyMX97ZEK8e2hCXFLOre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96SfudqzpacrzhjsF7sNe23xBJxVe2p/lKDyMNykXgsJlmX5qbxwVjZmEvn8KiZrel4Gt/Lrm2Mtac1xEkn10fD1XXxzme1UTmnNnY6Nbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+OuihKz2bSXTSW9LvbFF+TM+YkrrJWYP9tvVj32Xvof5Wg6rD1CLysZwkLotN1qc5apywWs+1y5rjyf2b4pMnG2LCQfWpxvcX1cQ/Fie5Z+Dw+PvF1fHjY6rTq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pekn7nq84YnbPJl85bnDnYd9t7Wk/2IOpw8VY9piaRl+Um8VmMsk7NVeOF+eC2pnRuG9fCyppY8KPhsWj1sLj7oarYavnQmLrv0PioObu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+OuihK9WX6KS3pF997JzV3HDe5sxJ/lRL2H/bg9qHWV/qcTFHXaY2kZ/lKHFarLJezVnjhn38YXUx5bCadJxXXFIV73wwJG6fVRljTx4cVy+qiC/Or0iv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnpL+sVDNaJ62ZmjczdzxvmLfKq+she1H7Mnsd7UpuKwGkWelqvEazHLujV3jR8Nh9RXp+N79v2VqdbzWgfF9c8PiKF9BsSZD/RPr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056S/p91+C83ZmzOKl+dv7mDMo5jLmU1vfJntS+zN5EfW79qdPUKvK1nCVui13WrzlsHGkZtX9lPPDSoGi4aECMvLRfvNy7b+zQu0/84tbe6dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0m//ZHawLm7s2d1kzNI8dNZlPMYZxL25eaY/Zk9ijpdrWo9ik3yttwlfoth1rG5bDxpMs7H/qhvLPu4V4wZ2DP6Xrip+OIdXxVd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfSW9PvOyfcuvnuwf1YzOId1Fuk8Tn0trjqbsD+Xc+Rfc0+9rmZVt1mf8rccJo6LZdazOW1cafvHt3oFzfe8u7F4wW3rijfN/DS9uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6XdO4rsn+VGMcA5vL+k8Vi3hXE59pd52RpHux5K9qv2afKxuNyfVb2oY61UuE8/FNOva3Da+NG5YvL7Y/fCa4r4nri7+5MWV6dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0m/vaHv39SIvofxXYT6Wf60rxJLnM+pMZzTqD3t1+1ZxWF7F/lZDauOM1flc+tXXBfbrG9z3DjTum3ug+I1jW8XK+etSK/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oev8T/+Zk+z3fw9kz2j/7TsK5vLNpdbU9hvzqrMp5jZijDrN3tX+zhxGf5Sr1nJpGXjeHrWcxzjo31403zcUTlxfnrX0xvbr33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLen3HbRzEudmvo/znZS6Se5wPu+M2jmts0r1tjMr5zbyr/27msQ+TmxSz6tpxW21jfwux4nz5rb1bs4bd9pHPPBUenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSu2X8t6z/LfF/S/4v9/qv3Ov/ct//lfv+v9zPf8r9/K/cz3/L/fy/3L//Kffv/8r9+99y//6/3H//Ue6//yn333+V++//yv33n+X++99y//13uf/+v9z//qPc//6n3P/+q9z//q/c//6z3P/+d8u/8v538Oglxc+ff6F4d/9Xi7u88lbxmB9+UOw86d/FSd9eV9x93ufFE4/sEQsf7RUje/aNXvX944j+A+OC5wbFs9MGxy/6DInnfzY0tr23Kl56bVi0rK6OXd8YHlPvr4kvptbG2x11EX+si97frI+KK+uj4cP6eHrbhrjpsIbodXpDNP8qu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLen3/5ePebW44KC3i9v2X1lccuia4uyD1hd/se6L4thcz9j5qt4xaHXf2Fg3IPZsGhSjNlTEiLsrY8reQ2PcQ1UxobY63tp3eOx+dJIfJ9XG1t+ri0m19fHK4vpYNKkh9lvdEKcf2Rg7LWyMoyubYv5eTTH3pKa48bym+PjS7Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6Tf5+HZnaNXFo94Zk1xfo8NxbkvfFn8/c0945Od+sRrc/vFFSsGxMQNg+L89wbH5HuGxBFjs/Hee/TwGHF2TXx1W206XsfdUJ+O57E7NEb1y43x3clNsee/mmKX/Ztj23lJfbaqOX6Tb4nv79kST45rid0mZVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX95oTPxbsbdtxQ/GCPr4rtn/WMN2/sE2909o+9Tx8YY2+oiPHzKuPPZw2Nx3ccFj3/Xp3UWjXRd3ZtfPBgXWz3bH0c/0RD7DEv09y7vjl6/KE57vxGEv+va4kZX7XEoH1bY/C5rXH4/a1xx8ut8fMPW6Pfp9nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Jv3Vhbvh8tNmptlfcuaxPfHRC/8i/MjDObBkcB2w/JNbkq+Lx95MxP3949Ez2FWcdnY33CQsb0jl79o1NUXl8Nr6//2tLVI/JNFW0tMW049pi3V1tcem7bbF7VXssGtEet45qj9G7Z1f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX9YoP1YY74nLS98Nz+8WrloHhy4uD4v4uGxCWXVEX3lOpY1JbNdetRzDp9ZmO6fjf8vDmdw8bt2N+1xgdbJXn92rZY0Kc9Tvhx8t+17dH2Unv8uU8u9urOxY2jkv3qPrn4ZP/s6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3pF98FCOsE3PF56WPuNrzoSHxxxeqYq+Hq9P1Jh6Lz2LTMW1N8d/bZeN92PqWuPnu1jj2oLaYv6ItZZ/3YHvsODwXXxySixsuzsX9D+bi2hW5mPF5dt59d30+2pqzq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pekn45QpwUK6wXc8bnpm+vVVVpzrnnkZrY48S6OHJ9fdx5cGMat63Lh3/fEjvObI1TRmdz+8FTklp9VXs6rj+am4sJ7+RSjZPH5KPXUfk4YXo+el+Uj6euysd5yf79wRuzq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pekn55Uq4QL8UM68bc8fmxkXupJra9oi7Nz5df05jG5fmDWuLBwVnssl6Nz9ffbY+p47LxM54X7pOP587Ix4HX5aP7L/mIJfkYuzwfq99K9oTv52Pdyny8sCq7uvfce+2010//Czd/X8Iu+/zwxy//OPDgwocTL278dNBDF3100lvSr1aQL+UMcVPssH7MIZ8jWyN2y2KcOGz9fXVgazTskq3v/J3t6fqdf3cunqhK5vHYfEy5JNOw6z8zbft8nI9F6/Nx2YZ8jEuu0z9NdCfPfvJxdnU/bvN77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3pVy+pGeRNuUP8FEOsI3PJ58lm4WvNab4eP601jc/itjn53WT/dv6/c+k4mcN3LczHsW/ko3ptPk5N9ByyLtH2YT42vJmPI17Mx9Qnk3FN2ly8IB9H/zm7uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6VczqpvUDml+T3KIOCqWWE/mlM+Vbfl5j9+0xb8Pz2LbqfOy9f3CyfkYf08+bn0liWdrs3E8cU0+jku4r12cj89vz8deCfugU5M1Pi4fxUTDU8V8vLlzdnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9KvblY7qp/UEPKoXCKeiinWlbnl8+XjjWPa01yVxvNvJWwX5OPIJ7J1bLxyCefBr2TjSsuaI/OxYrt8jO6Rj4+fz8XP5+filctycdvMXDz/y+zq3nPvtdNeP/3ZYS+3eT7xwx+//OPAgwsfTry48dNBT1ofJPropLek395B/ayGVEepJeRTOUVcFVusL3PM58zX3Mdzsd/oLG4/80K2Xq3fw9/J5vKxCdvG7ydzeGA+frowGZ/TkjWyfS7OWdceSx9J6p1r2uM7Z7fHqOnZ1b3n3munvX76s8Meu+yP2xwf+OUfBx5c+HDixY2fDnrooo9Oekv65Ud7CHW0WlI9paaQV+UW8VWMsc7MNZ83n+KzeD1yXRbDViWx6qabsnFbmsRr4/mN/XJx8HuZxjVfb49DXm6LZ+a0xdeOSmq8PduidVR2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0m8PaR9lL6GeVlOqq9QW8qscI86KNdabOedz5/ujddn6rFqSzVXr2Rx+8YhcbLWiPe4al2nueVhb/OzdpBb+VWssG9EaW3/YEjMXtcTJC7Kre8+91057/fRnhz122eeHP34/2vwZ4MGFDyde3PjpoIcu+uikt6TfPtpeUpy0p1BXqy3VV2oMeVauEW/FHOvO3Bu5Wbu4feWsxHdnPgbflosF7bl0/C55KxvfsVe0xhuftcQ2k1vi1JXNMWVmc1SObI5x/Zoj1jWlV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Jf3OEuynxQj7KrlDfa3GVGepNeRbOUfcFXv22Zy3jQOWtU35NIZZv1fvkdRCs9riTwuycf5LV0s8MbE57ru3KW5oaoqtr26Mpl0bo6VPY8z6d0N6de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0m89OFOwr7a3tL8SP9XZak31lppD3pV7xF8xyDo0F40HJut1dEd7up5PHdeajuNWpzTHhLMyzasXN8SqoQ3xr9Pq455+9bF8YV0Ub6lLr+4991477fXTP503iT122eeHP375x4EHFz6ceHHjp4Meuuijk96SfjWicxXrw/7aHjPdxx2U1fNqTnWX2kP+lYPEYbHIejQnjQu2277Zlq7j2XUt6dxueq4xPry3IepvrE+1Vv69NubX18ZhF9XEA7vUxIm57Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6TfuZqzJecrzhisF3tN+y2xRFxVe6q/1CDysFwkHotJ1qW5aXwwrtyYzfWWiY3peBrfk2bUxtJDauIHPxwe66dVx6PLh8Wq04ZF44+yq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx40/3jb/L4gB9dNJb0u9sUX50xqRuctZgv2392HfZe6i/1aDqMLWIfCwnictik/VpjhonrNbzJ/fXxy3fqIvnbquJ0SOHpxoX31wVf7hlaLz+/pC47aQh8Z3vZVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvSX9zledMTpnky+dtzhzsO+297Se7EHU4eKtekxNIi/LTeKzGGWdmqvGC/PITbXp3DaufZ6uit9+e2jctKQyLr5ucPR/oCIO2aYilnwxKL2699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+OuihK9WX6KS3pD+tjydlc995mzMn+VMtYf9tD2ofZn2px8UcdZnaRH6Wo8Rpscp6NWeNG/biqOrYZ1RVOs4LTx4cjz41KM6bNDB2/OGAOOPm/rH82P7p1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvSb94qEZULztzdO5mzjh/kU/VV/ai9mP2JNab2lQcVqPI03KVeC1mWbfmrvGj4dsbKtPxnXjlwFTr5K/6xow/9okP3+4dh1/TO72699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3p912D83ZnzuKk+tn5mzMo5zDmUlrff5jty+xN1OfWnzpNrSJfy1nitthl/ZrDxpGW5m8MjKvu7xfrT+gTtaf0ivvf7hHdizcV76rbVHR177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvSb3+kNnDu7uxZ3eQMUvx0FuU8xpmEfbk5Zn9mj6JOV6taj2KTvC13id9imHVsLhtPmozzPt/uGSfc8mVxr+c3Fh/5wfripcevS6/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oekv6fefkexffPdg/qxmcwzqLdB6nvhZXnU3Yn8s58q+5p15Xs6rbrE/5Ww4Tx8Uy69mcNq60HbrNF6nmE25ZU/zesR8WJ4xZnV7de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb0Oyfx3ZP8KEY4h7eXdB6rlnAup75SbzujSPdjyV7Vfk0+Vrebk+o3NYz1KpeJ52KadW1uG18a7zv3o+JbM98vDtr+nWLuirfSq3vPs8/my6L2+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70l/faGvn9TI/oexncR6mf5075KLHE+p8ZwTqP2tF+3ZxWH7V3kZzWsOs5clc+tX3FdbLO+szm+JtW6asWK4qHLlxefOnpZenXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvzpb80TPXTRRye9Jf3qIfsj38PZM9o/+07CubyzaXW1PYb86qzKeY2Yow6zd7V/s4cRn+Uq9ZyaRl43h61nMc46N9eNN81ffvO54oR7l6RX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70l/b6Ddk7i3Mz3cb6TUjfJHc7nnVE7p3VWqd52ZuXcRv61f1eT2MeJTep5Na24rbaR3+U4cd7ctt7NeeNO+/u/fCS9uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+OtPvL7aM/5b1vyX+l33+L/f6r9zr/3Lf/5X7/r/cz3/K/fyv3M9/y/38v9y//yn37//K/fvfcv/+v9x//1Huv/8p999/lfvv/8r995/l/vvfcv/9d7n//r/c//6j3P/+p9z//qvc//6v3P/+s9z//rec//0/TQsvqnic7duHu1TVucfxQzkHDpzeZk6Z2FuuRI1ec637FbHEgtGYqGhUrBhb9IYY1Ago6jWCxIIk2MUYk4hdsRsLFlBRFBXFelFBFI2IgCDe/dnbuf/EwPP4bPfea73v9zdrrfd915o5VVVr//UZOyO5ufWF5Fe7v5p83PVW0nb5+8mLd3ycNP/us2TJgi+TS75bnmz+7Ork4uur4uD7ese9N/eND06viU16+sdLU2tjs4EDY9zP6+JH59TH6eMb4orRjTH74KbYv7M5tn+iOSYd2BKHvNwSw7drjVMmtMZ6L7bGqlWtcXChLU5bty27uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6/f/u4x7NTn2ireSebt9kIyasjDZ7oolyUb/+VVyxOiVyfoj1yRHjO8V+93XJ655oDoun9wvzt2/Np5YOCDuPrwuHrinPrb7tCH+UtMUO1U3x9hFzfHgPS2x1YjWKFW3xY3j2+KF79riT0e0xyO3tkfNwvZY0dwRK3/YEXtunV/de+69dtrrpz877LHLPj/88cs/Djy48OHEm3Gn/HTQQxd9dNJb1u/z8GzY2A+SAY2LkkOTz5OhbcuSbyZ+k1x+z3fJ1oN7x5IxfeOByTXxwYX947EDBsS9Kwdm43Dd+w0xdqOmOHDvfJyfGpyP65OvtMWIUe1xVW1HXH1+R1y6pCPG7VaIwy4uxNv/KsTUjwqxzreFuLJvMbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3rNyd8Lt7t9/vPkyvPW5Ys+vGq5L+GVMW2T/aO6wrVccfgfjF9t9qoX39g9Myri1+e1BA7vd0Yhw5qjji8Jc4/rTVmjGiLKbvlmg+5ryN+sW8h+r5UiKeSYrx2TTGOXFyMozbrjHsO7ozeZ3bG8xM649Ar8qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ+68Lc8Plo84MTViXVo6piSFOfOOOs6pj7UL/425za2P3xgdF9UX1c+x+pv380xRs1+XjPOCKf22/t2hFHN+Tj+O1hxRixoJhpOvKhzphT3xV7798VCy/oir/c3hU9z3dF1dtdMfmD/Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6xfbLA+zBGfk7YLNusTW0+rjnX69o/FWwyIhVvVxdkDG6L0aGM296xHMevF9duz9Tu0I5/Dxu2JnTojnu2MrqQrmm7qiqdXdMWMnbvjt2d0R8NN3XHNjO5YOb87Hv2kO/b6PL+699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3rFx/FCOvEXPF56SOuHnT4gBgwsi6uHZ6vc/FYfBabHn2kPS58sSMblzuvLMaa/Tvjya86o2ZsrnnVr7pj4l3dccCK7lixZU80HN4Ty8b0xGtTeuLGW3ui//Se+O8H86t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ+OUKcFCusF3PG56bvwRfXZTmn9uimmNLUEvde2RrVy9uyuG1dFvcoxiXrd8bM9zuzudva1h1nXpyP66279MT943KNjy3oiYOqSzGjVIpDtijFujuU4v1dStE6JL+699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3rlyflCvFSzLBuzB2fHxu/O6Mpxv2kJcvPn+7YnsXl6n8UovXWYha7rFfjM+aC7nhxdXc2fsbzw096YtPuUvwtKcXZw0px5cmluP3MUux6XinG/k8p9rm4FD8cn1/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb1qxXkSzlD3BQ7rB9zyOfI1rnvtWYxRxy2/g78shinvNWZrc8zhubrt+aAnljnjp6Yu7InHt8q13D573Jt119WitLkUixK/7v7ylK8ekWq+/JS3H9ZfnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9avXlIzyJtyh/gphlhH5pLPk82znu7I8vX07jyei9vm5NXdPfH+xHy8zeGaI0vx5OhSjLi0FDNTLdMmpdomlGLouaW4d2QpZp9Qis3SNh8fUoqHD8qv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrL+tWM6ia1g/wph4ijYon1ZE75XNmWn6ds3BW7renKYtOs3fJ1+sPWUtx3QCm+O6sU/S/Lx/GZP+Xcy44vxf77lOLalP3ItnSNr+6JSamG9d7tif96K7+699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3rVzerHdVPagh5VC4RT8UU68rc8vnysW3t97lKPH+1Jz7ZPGUaka9j4zUyHa9pZ+XjSsvuVaX4yeyemHxdT+z52554fr+e2GqbnqjaIP3cSvnVvefea6e9fvqzw97I7+cTP/zxyz8OPLjw4cSbxanleV6ghy766KS3rN/eQf2shlRHqSXkUzkli6v/yNe7OeZz5mvFsT0x9f2eLG5vPDJfr9bv3ePyufxkyrbfkp647ZaeeOSIVEshnbNzuuPdSd2x8dHdUdqpOyZs1B2Xl/Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96yfvnRHkIdrZZUT6kp5FW5RXwVY6wzc83nzaf4LF6Pn5THsF3OKMWqIfl4bzwtH88LPu2OaRfmGveY2RW3jeqKjX7SFX+o7oqXP+qM0+d3Zlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvWX99pD2UfYS6mk1pbpKbSG/yjHirFhjvZlzPne+h1yZr8/jTs7nqvVsDm/+XXf8YUx39Ps213TQqs54/IK0Fl63M7Z4vhhjJhRj3nHFeO6Q/Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6zfPtpeUpy0p1BXqy3VV2oMeVauEW/FHOvO3PP5YxC3P9+gFLOe6Inhe/VE42P5eC88tysb3zt+0hnbTinGubXFmPnHQjyxflrHz+2Iu/6axtRJ+dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1m/swT7aTHCvkruUF+rMdVZag35Vs7J4vyIfP2Zg8YByx4P5jHM+v3yf9NaaIOuqB/WmY1r81PpXrdvIeoOTPf5D7TH2B3a49S32+L0qW3x5sT86t5z77XTXj/9MzupPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ+68GZgn21vaX9lfipzlZrqrfUHPKu3CP+ikHWobloPDBZr5Mfz9f1rNX5eJ/TWoj71+vItO2a2t7l9tbYsdAatTe3xFZHtsSkPfOre8+91057/fRnhz122eeHP375x4EnywsH5PUBXtz46aCHLvropLesX43oXMX6sL+2x7TPstdQb6s51V1qD/lXDhKHxSLr0Zw0Ltiq5uTre8G9hWxun3p6qvvAtjhp19ZM69EnNUfN9Ka4a4umaJ7fGE8/1phd3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfSW9TtXc7bkfMUZg/Vir2m/JZaIq2pP9ZcaRB6Wi8RjMcm6NDeND8Zd/pLP9dP7tGfjaXyfXac5NlnRGDcvbYh9ehqi66z62KVQH6cuq8uu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrL+p0tyo/OmNRNzhrst60f+y57D/W3WkwdphaRj+UkcVlssj7NUeOE1Xre65DWWDO7OTbbuykmz801l/asi74/HRjbXDQgerUMiEsW1WZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71l/c5XnTE6Z5Mvnbc4c7Dvtve0nuxB1OHirXpMTSIvy03isxhlnZqrxgvz+Gubs7ltXIedWBefvzYgVp1cGx8n/eOwQ/vFtOdrYsOra7Kre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4MeujJ9qU56y/qz+rg6n/vO25w5yZ9qCftve1D7sJnff7ZijrpMbSI/y1HitFhlvZqzxg37pPn1ccP8gdk4t7f2j84Ta+L9vtUxcWmfeHmPPrFlfX5177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvWLx6qEdXLzhydu5kzzl/kU/WVvaj9mD2J9aY2FYfVKPK0XCVei1nWrblr/GgYP7k2G98Ht6vOtP7rml4x98CquLD/d8mIUWsSV/eee6+d9vrpzw577LLPD3/88o8jq7Grcj6ceHHjp4Meuuijk96yft81OG935ixOqp+dvzmDcg5jLmX1/YR8X5btTdL63PpTp6lV5Gs5S9wWu6xfc9g40nLa7L7xxcG9Y5+mqpi78eqk1H9l8nLN8uSwX3ydXd177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvXbH6kNnLs7e1Y3ZWeVh+dnVs5jnEnYl5tj9mf2KOp0tar1KDbJ23KX+C2GWcfmsvGkyTgPnrYy6V74VbK05d/JKROXJDvf9ll2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1u87J9+7+O7B/lnN4BzWWaTzOPW1uOpswv5czpF/zT31uppV3WZ9yt9ymDgullnP5rRxpa3mpKWZ5p6FC5Nl//wwaRi3ILu699x77bTXT3922GOXfX7445d/HHhw4cOJFzf+7Ez1prwWoo9Oesv6nZP47kl+FCOcw9tLOo9VSziXU1+pt51RZPuxdK9qvyYfq9vNSfWbGsZ6lcvEczEtW+/p3Da+NA5/7qPkkifeS+49bX4y67U3s6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3rJ+e0Pfv6kRfQ/juwj1s/xpXyWWOJ9TYzinUXvar9uzisP2LvKzGlYdZ67K59avuC62Wd/muHGmdfK685KarleS3938UnZ177n32mXxIO2nPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvWrh+yPfA9nz2j/7DsJ5/LOptXV9hjyq7Mq5zVijjrM3tX+zR5GfJar1HNqGnndHLaexTjr3Fw33jTfctrMpGHpjOzq3nPvtdM+65f2Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pesn7fQTsncW7m+zjfSamb5A7n886ondM6q1RvO7NybiP/2r+rSezjxCb1vJpW3FbbyO9ynDhvblvv5rxxp/2Khx/Mru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056147/2vW/Nv6vzf+VXv9Vev1f6fu/St//V/r5T6Wf/1X6+W+ln/9X+vc/lf79X6V//1vp3/9X+u8/Kv33P5X++69K//1fpf/+s9J//1vpv/+u9N//V/rff1T63/9U+t9/Vfrf/1X6339W+t//rv1X2f+u2vHhJJn9ZPJ1r1nJmNdeTqYNfSM5/qR3kr9vtSC58PpFySYPLUlmnLc0uX318mTPTVcnY/tWxe0v9YqvRvWJq3tVx9cjauJnd/aLb97qHzt/UhtHvj0grrpvYPzgjLqoWbc+jrqrPjbaoiEGTW6I7Rc3xJI0Tj9zSGNsOLIxdjonv7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpLev3/28ms5I1+81JTu81L2n55bvJnP0+TB794pNkxfZfJA9tuSw5+NWVybabrklOKPSKI5b1jqG3941Ldq+J0Q/3i/NbaqN6rwFx7DED07qrLvbdoz4ubGmINTMaYtFRjXHqJ40x5VdNcdgjTXHRgOaYs1tzPHVqczz9P83Rfml+de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1u/z8GzpjvOSqTPfTb765sPko9mLk8v3/ney+W++TqpiVTLyke+SC5b1its+7BPj76iOsQfl431iMiCGnjcw1v17XTZef7q+IRvPiVs1xTavN8WI45vjhP9tjsP3aYmfTW2JTRe1xN9/0Bq/GZLuJYa1xtFH5Vf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvWX95oTPxbuPt/4o+VHyaXLukn8ntUOWJ9WDVycnjqyKs6/vHedN7Rtvjq6Jhdv2jw1m1saAHQbGJml9Xfdwfew/uyEufboxjpuaa96orSXW/2dLvDwo3Tdek9bLaY22+U/b4kcXtsWY+9pi9utt8efFbbHpl/nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Zv3Vhbvh8tJm+4ZfJjdOWJ+vNX53sOq8qbujsE/+9ZXW0rtMvFn6UjvlFA2KD/nVx0zH5eF/2SGM2Z2+5oTm2OCkf3+cebI1tBueaBnW2x7Untkfx9va4d0F7HFvfEYs264jnt++IYyK/uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oukt6xcbrA9zxOek7VGN3ybfDegVnw7vE9MnVMc9E/vFnifUxqLufK5bj2LWlDFN2frt+m1LNoeN28Sr2qJu4/b4+Or2mN+rIy77Zfrf1R0RczvizV6F+PUGhXh6+0L8cc9CdOybX9177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530lvWLj2KEdWKu+Lz0EVc3eLg6Xp/TL379WG223sRj8Vlsuri7OX6+eT7e53zVGjNvb4uJB7THnHfaM/ZnH+qIQ5sK8YNfFmLGJWnd/lAhHn+nEDeuKMQpA4rxalsxophf3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfSW9csR4qRYYb2YMz43fTdc1C/LOXP/NTCOO6U+zv2qIV4+sCmL29blgpta49AxbXFlks/t907riN0XdWTj+vvrCnH+B4VM4/jBxdjw6GJcdlYxNppQjM/+XIxp1xXjvRvyq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pesn55Uq4QL8UM68bc8fmxMXjuwPjZpPosP98/pSmLy3P6tcZ7tXnssl6Nzz4L0np9WD5+xvPOPYux7PfF+G26l9nz/nTvM6sYZ79RjMb3izH0o2IUFxVj+aL86t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766Mz0fv9PrSBfyhnipthh/ZhDPke2hu6cxzhx2Ppb92dtsf12+fre9daObP3Oub0Qi+vTeXxQMS6ZmGs48tVc28lfFGPRV8W4b1kxRqfX679Mdf+7GOO+yK/uR3//Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrL+tVLagZ5U+4QP8UQ68hc8nmyuceGLVm+Pm9UWxafxW1zcsSoQtz2WSEbJ3P4lUeKMfHtYmzzeTEmp3rOXJpqS/e0Xe8VY+wrxbjqmXRc0zZ3Ty/GRffmV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Zf1qRnWT2iHL72kOEUfFEuvJnPK5si0/HzeuPVoOy2Pb5Kn5+l7+m2Kcd0cxnp+XxrPP83G8fEkx/pRyPz6jGKV/FOPXKfvmp6drfFgxhqcaPtsx3d9vl1/de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Jb1q5vVjuonNYQ8KpeIp2KKdWVu+Xz56H18R5arsnj+45Ttj8U49+l8HRuvwSnnqHn5uNLSengx+gwqxjHpPr99TiH+PK0Qay4txAtjCvH1mfnVvefea6e9fvqzw97g7+cTP/zxyz8OPLjw4cSLGz8d9GT1QaqPTnr/f/6newf1sxpSHaWWkE/lFHFVbLG+zDGfM19PPVmIU5M8bn85J1+v1u+YD/K5PDFl694nncM1xfjjI+n4jEzXyJaF+OfSjlj6r7TemdIRw87riCPOyq/uPfdeO+31058d9thlf/T38YFf/nHgwYUPJ17c+Omghy766KS3rF9+tIdQR6sl1VNqCnlVbhFfxRjrzFzzefMpPovXBy/NY1jD3GI8c2M+bkvTeG08D9irEKM+zDW2btoRZ77eHl9e0R4/PTqt8Ya0R7J9fnXvuffaaa+f/uywxy77/PDHL/848ODChxMvbvx00EMXfXTSW9ZvD2kfZS+hnlZTqqvUFvKrHCPOijXWmznnc+e7+at8ff54Vj5XrWdzeMVhhdjrnY54ZViueYND2mPCgrQWPqctVm3WFvsubo2/PtUak6bnV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9/7//S/fR9pLipD2Fulptqb5SY8izco14K+ZYd+aezx+DuP3w2NT3usX40S2FmN9TyMbvnvfy8T17Ulv0XtEa+x3fGpMXtsQlY1pii61bYnSfljhqaXN2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1u8swX5ajLCvkjvU12pMdZZaQ76Vc8Rdsefk7/O2ccDSmvoVw6zfR3dJa6Gx7TFvej7Ob6/XGouHt8QbdzbHjEJz7PuXpthxh6bYuVdT3PxZY3Z177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvWbz04U7Cvtre0vxI/1dlqTfWWmkPelXvEXzHIOjQXjQcm6/WYdTqy9Tx5WFs2jnud1hLnj841N6a2G+obo//IhpjbpyG+faQ+ht9cn13de+69dtrrp382b1J77LLPD3/88o8DDy58OPHixk8HPXTRRye9Zf1qROcq1of9tT1mto87IK/n1ZzqLrWH/CsHicNikfVoThoXbC9s0Z6t4ztaW7O5veNLTdF0V2Nsd0NDpnWLmXUxp60uzpkwMN7ZbmBcXsqv7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrL+p2rOVtyvuKMwXqx17TfEkvEVbWn+ksNIg/LReKxmGRdmpvGB2P98nyu7zy8KRtP43vFH+pi6S8Gxun7D4jOM2vjozf6R8PI/rHDz/Ore8+91057/fRnhz122eeHP375x4EHFz6ceHHjz/aNV+VxgD466S3rd7YoPzpjUjc5a7Dftn7su+w91N9qUHWYWkQ+lpPEZbHJ+jRHjRNW67ljekPMGlQfy24ZGMdsPSDT+Mlf+8VLN9dEr4+r44VTq2PYHvnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Zv/NVZ4zO2eRL5y3OHOy77T2tJ3sQdbh4qx5Tk8jLcpP4LEZZp+aq8cJ88Oq6bG4b142f6xcPbVMTz8zqG3df0yc2e6B3nPnD3vHFyl7Z1b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD12ZvlQnvWX9WX18VD73nbc5c5I/1RL23/ag9mHWl3pczFGXqU3kZzlKnBarrFdz1rhhH759bZy8fb9snD/4TZ/46NleMe2oqrjvxjXJDnt/m3wzd3V2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1i8eqhHVy84cnbuZM85f5FP1lb2o/Zg9ifWmNhWH1SjytFwlXotZ1q25a/xoOGRZ32x8L5hcFbR2Ll+ZDDl2ebLOU8uSXv+5LLu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466S3r912D83ZnzuKk+tn5mzMo5zDmUlbfL873ZfYm6nPrT52mVpGv5SxxW+yyfs1h40jLToOqYtTJq5Ifz/86OeWDL5P7nvw8+fUTnyXLmj7Lru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056y/rtj9QGzt2dPaubnEGKn86inMc4k7AvN8fsz+xR1OlqVetRbJK35S7xWwyzjs1l40mTcX5rxBfJPVMXJ+Nf/Djpt/eHyesnLMiu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnrL+n3n5HsX3z3YP6sZnMM6i3Qep74WV51N2J/LOfKvuadeV7Oq26xP+VsOE8fFMuvZnDautF23ySeZ5numvptccvz85G/JW9nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Zv3MS3z3Jj2KEc3h7Seexagnncuor9bYzimw/lu5V7dfkY3W7Oal+U8NYr3KZeC6mWdfmtvGl8ZtxbyebnPN6MnTQK8kxl72cXd17nn82i7P2+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71l/faGvn9TI/oexncR6mf5075KLHE+p8ZwTqP2tF+3ZxWH7V3kZzWsOs5clc+tX3FdbLO+8zn+bqZ1y/mzk+vmPpc0HvVMdnXvuffaaZ/1S/uzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Zv3rI/sj3cPaM9s++k3Au72xaXW2PIb86q3JeI+aow+xd7d/sYcRnuUo9p6aR181h61mMs87NdeNN8y6DHk/+dtvD2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1m/76Cdkzg3832c76TUTXKH83ln1M5pnVWqt51ZObeRf+3f1ST2cWKTel5NK26rbeR3OU6cN7etd3PeuNM+6Pd3Zlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvWvHf+36Xxv/1+b/Sq//Kr3+r/T9X6Xv/yv9/KfSz/8q/fy30s//K/37n0r//q/Sv/+t9O//K/33H5X++59K//1Xpf/+r9J//1npv/+t9N9/V/rv/yv97z8q/e9/Kv3vvyr97/8q/e8/K/3vfyv53/8BmbmQoXic7duJ/13Tvf/x7zffeTjnO5yEomal0ih6SxvT+rjUPKUuQUjNQ0sNvcSc1FQtQcxFrlKEqlSMdQk1E5GYQgZUgohERCSIJJLffu7t3MfvfzjyeHhse++1Pp/X+6y1Pp/PWud86+q++7feqfelZ1v+N52z1ZOpueuF9NM/TErzb3sjbfbr6ak07d/pnkUfpN0f+zhtucWnafKhn6eLt/8yfTDt6/TbAd+kf69ZFwMvrI+rXu4T2y5piN83N8Vfv26Kd19rjsOuaondtmmN2ye1xrG7t8VJ97fFOS3tsfku7dF+WnscO6o9RtxQXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvX7/0NPfzJdcPELacnAyen6y6akAy6ekXbceGY693ez0/bHzUvvdn6WHjt0cTrwmCXpF+svT+tdtzK9enh9PD21T7zw48bY5eimuHNEc+wxvCWuOKI1Jvy4Lbaf1RabDG+P+5o74p0zOuLmaR0xccPO6Hd4Z7Re2hltt3fGAfcUV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Vf0+D8/OOHVy2rjhzXTWf7ydTmidlVa74KN0352fpItOX5iWffFFunL9pen9hhVp8sS6eOZ3xXiPHdIUo25ujiOebcnH6/XH2vLxfG3Pjhi2qCPuPr8z/r6yM245thRXPVGK3zSVY/5W5bj/0HJsOqwcd5xbXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvWbEz4X7357/NvpwWGzUutGc9LlZ89Pl5z5eTp4/a/S8DOWpZHDV6Y1b6qPH+3bEEfPbow9BzfHr8e0xN5TW+OaeW3xxqz2uOuJQvOxm5XiqOdL0Xe3crz+SDlmr9oVJx7VFSf/tSuefq0rehd3xYyW7vhNuTu/uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6rcuzA2fjzbbHjIn/XD2/DSm76JUmvdVevE3y9PDe9TF/lv3iR81NMbY25vi6A1a4qMRxXhPmdaez9l54zvjlItL+Th2vlWOYUMLTSdt0R2z/tAdQ17qjiV1PXHnxj0xYKee6BrcE2MOLq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeqv6xQbrwxzxOWk7Z+dF6cK9lqShy5enpXfVxZK7+8QlFzbGgJ8Xc916FLPeuakjX7+HXFHK57Bxe+3hrtj7P7uj/yPdsfZaPTHllOy/f/bEBQt7Ys21euOe1Bttg3vj5SN748Djiqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3qp+8VGMsE7MFZ+XPuLqMVPrYvUFfeKeGY35ehOPxWexadLPOuPaXYrxfrK7K0oTszn72+7ot6w7Z++Y2hP/M6A3Dj+lN1rv7o21pvZG47Le+LBvJcZtWIlVN6/E+T8tru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056q/rlCHFSrLBezBmfm77HNBU5bbV3muOuP7XGs93t0ffkjjxuW5cbPVmO/7mpK6YNKeb2+pf1xB+binF99NHeeGFFb65x8tBKHDO8ElOuq8Rxd1Viswcr8dmjlVj/8eLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeqX56UK8RLMcO6MXd8fmxctLA5rh7XmufnZQ915HG53wblWH/DIoZZr8bn8rreePe0YvyM5+IjK/Hzayrx8COVuOSNStz+USWeWFyJX35TiVF9+saQpr6xVXNxde+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1a9WkC/lDHFT7LB+zCGfI1ujDipinDhs/R15fFecs1+xvi96oSdfv/0m9sam/bN5/LtKvHp3oeGvnxVa7+3sGwN6+sbX2X9PdfeN98t94+BS33ihs7i699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3qVy+pGeRNuUP8FEOsI3PJ58nmn6KU5+vnr+nK47O4bU7efU1vLGwrxskcXmV6JV77uhLDOvrG9EzL+K5MW0vfbA5W4pkFlXj3/WxcszZfvl6Jia8WV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Vf1qRnWT2iHP7w1FnBdLrCdzyufKtvz8t790x36nF7Ft+hPF+t5qZCWem1iJri8r8b3OYhzfbO8br2fcjbMqcehzlRibsZ90WbbGT6vEbZmGzQ6sxM77FVf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvVX96ma1o/pJDSGPyiXiqZhiXZlbPl8+fnF+T56r8ni+dyWW3lGJZzNW69h4XZiN1/gvinGlZf8zK7HTrpUYs1olDvi0N95+sTe2H9sb3aN7Y+B1xdW9595rp71++rPD3oXfzid++OOXfxx4cOHDiRc3fjroyeuDTB+d9Fb12zuon9WQ6ii1hHwqp4irYov1ZY75nPlqea837h9SxO0tsjlrvVq/T68o5vJrGduvjs2416vEy9Oy8RmVrZE9euPTrt7Y8p2s3nm4J0bf3BO3Xldc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9cuP9hDqaLWkekpNIa/KLeKrGGOdmWs+bz7FZ/H6xq4ihg1aWImOJ4px23KjSj6e1xzdG4/V9+YaB+/YE48v6o4txnXHpcO7Y+ah3XHe/sXVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Vvz2kfZS9hHpaTamuUlvIr3KMOCvWWG/mnM+d7//qLtb5qR8Vc9V6Noe3PqM3Ri7tiVWGFZqPPrU7XqnLatobumK7nbriipaumPNeOaa+Xs6v7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnqr+u2j7SXFSXsKdbXaUn2lxpBn5RrxVsyx7sw9nz8GcXvl6ErM2KYSJz+T+R5YjPeS5cX4/mtcV+zUtyuuPL8c0xvL8dpNpThl71I8tXYWU7uKq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Peqn5nCfbTYoR9ldyhvlZjqrPUGvKtnCPuij33fpu3jQOWwZlfMcz6rR+a1UKju+P7bxTjvM522R733FKsMSnb5/+0M654sCOGD+6I89bsiLltxdW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb1W/9eBMwb7a3tL+SvxUZ6s11VtqDnlX7hF/xSDr0Fw0Hpis1zFb9+TrecZpxXiPHFmKF24sNP8ysz1o4/bYY1RbrLZOW2w/vTVue6o1v7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprepXIzpXsT7sr+0x8/13ttdQb6s51V1qD/lXDhKHxSLr0Zw0Lti69+jO1/HiTcv53B7+SUfsO6k9zh7flms9ZXZL9Nu8JZ68qznW3b853hxYXN177r122uunPzvsscs+P/zxyz8OPLjw4cSLGz8d9NBFH530VvU7V3O25HzFGYP1Yq9pvyWWiKtqT/WXGkQelovEYzHJujQ3jQ/GQZVyPod/f05HPp7Gd+qfW2LLU5rjoROa4uBrG2PjLxpi0KiGOPfE4urec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIeu/Gwm00lvVb+zRfkxP2PK6iZnDfbb1o99l72H+lsNqg5Ti8jHcpK4LDZZn+aoccJqPR/4eluUd2uNnz/bHGP2bso1bvJUn6g8XR87NtRH96V1MfqIuvzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeq3/mqM0bnbPKl8xZnDvbd9p7Wkz2IOly8VY+pSeRluUl8FqOsU3PVeGG+8Xut+dw2rsd92CdW7FMf/V5Zmeb/7ps09W/L0pkjl6ZjBizNr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8OeujK9WU66a3qVx87ZzU3nLc5c5I/1RL23/ag9mHWl3pczFGXqU3kZzlKnBarrFdz1rhhv33/xrh3/z75OO+6+jdp0ISv08xvvkzbzFicnjx/URpRXpRf3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9YuHakT1sjNH527mjPMX+VR9ZS9qP2ZPYr2pTcVhNYo8LVeJ12KWdWvuGj8abuqpC+N71TFf5Vpv3vSzNGH0/HTH8nnpDyfMy6/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeqv6fdfgvN2Zszipfnb+5gzKOYy5lNf32Z7UvszeRH1u/anT1CrytZwlbotd1q85bBxpqb/qy1R3x8L0z77z0+LVP07bLv8wfbb0/XTWru/nV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Vf32R2oD5+7OntVNziDFT2dRzmOcSdiXm2P2Z/Yo6nS1qvUoNsnbcpf4LYZZx+ay8aTJOB92y+y01dszU2/Lu2nk+TPS0Fun51f3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvVX9vnPyvYvvHuyf1QzOYZ1FOo9TX4urzibsz+Uc+dfcU6+rWdVt1qf8LYeJ42KZ9WxOG1fafnDoe7nmrd+ekvr95bW0yemv5lf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvVX9zkl89yQ/ihHO4e0lnceqJZzLqa/U284o8v1Ytle1X5OP1e3mpPpNDWO9ymXiuZhmXZvbxpfGEeNfT2Mfejm9cdSLae6E5/Ore8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96qfntD37+pEX0P47sI9bP8aV8lljifU2M4p1F72q/bs4rD9i7ysxpWHWeuyufWr7gutlnf5rhxpvWhvs+lH5T/la65YXx+de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNL7f/FvVLHf8z2cPaP9s+8knMs7m1ZX22PIr86qnNeIOeowe1f7N3sY8VmuUs+paeR1c9h6FuOsc3PdeNP8/FEPpx9/dF9+de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb1e87aOckzs18H+c7KXWT3OF83hm1c1pnleptZ1bObeRf+3c1iX2c2KSeV9OK22ob+V2OE+fNbevdnDfutD9w75j86t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KT3u/H/bv1/F/+/y/+1Xv/Vev1f6/u/Wt//1/r5T62f/9X6+W+tn//X+vc/tf79X61//1vr3//X+u8/av33P7X++69a//1frf/+s9Z//1vrv/+u9d//1/rff9T63//U+t9/1frf/9X633/W+t//fvevtv9d2//ONHD8P9JnCx5KZz4zPo3Z5pl02EET0m1rv5J+n82Zde+anp44+d/pb3PfTzusMict/3JeGnz5gjRr5ufpJwu/SLOfWJJu3GdZWnD7N+m0p1amQ96oi+vvqY81ftsnGldtiF/d1RDrbdgY/S9rjJ/Naox56zXFM/s0xXrHN8VWpxZX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71V/f7/jU0eTku2fTwdv+CZ1LnjS2nitq+mf777Zvr8h1k+WGtm+uVTH6bNVpmbXv7+p+mRqQvTtXt8kVY9a0n6+uhlqbGyIvXZvi4OH1IfzQf1id22a4gL2hpj2WON8dGBTXH8zKa47r+a48AHmuOi+paYvE1LPHl0SzydreXei4ure8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96qfp+HZ/P7P5tG//Ol9OmcV9PM8W+lkQPfSRsOnZWWbvJROvHueal52oK0/yOLUu/eX6XlNy3Nx+HYLeti9zPrY82/9MnHa+R1jfl4XvrD5th8UnMcNbQljp7eEkN2aI09b2iNH7zXGmP6tcUJW7fFx4Pa4tADi6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3qp+c8Ln4t2sdV9LG28yNZ399jup4Sfvp5WbzkmvTP0kLfrxwlS/xRdp7PwlacKQ5SnOW5laflIfG5zXJ9rub4i9nmuMy8Y3xRE3FJrX62iNtW9tjUkbtMXIq9vi5s/bYuNojx+d2x7n3NMeEydlOTzL4z/4uLi699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3qty7MDZ+PNuN630033fh+WmPCnDTiL1ndtO7naeZeX6Z1BixNEx7NxnxEXayzsj5uGVKM9+UPNOVz9vbrs/rziGJ8nxvXFpsPLDT17+6Imw7viH53ZDltRkcc3tgZs9fpjBc374zDflZc3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9YsN1oc54nPS9uBv5qSvGz5Nr437PB3X9lU6orQs/elfK9Ls3mKuW49i1nXDmvP1u+pvWvM5bNwuvbI92tbsiA+u6ohpSzri8j074/KrOmO7iZ3x1pLOOGb1Ujy9eSn+kEpR2bG4uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6hcfxQjrxFzxeekjrm5/9FfpzquWpUnHr0zWm3gsPotNF/e2xD7rF+N9VlaPPn9He4zctSMmTyk0P3tfVt+0lOL7e5biqQtLMfW+Ujw+pRQ3L8jqwPpyvNpRjm27iqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3qp+OUKcFCusF3PG56bvDv9alue01x+ujyOOaojh8xpj0u7Nedy2Lmfe2BYHDGuPq7Ys5vY7x3bGDu915uN66rWlOG9aKdf4x4HlWPegclx+SjnWv6Accy8vx9+uLcc71xdX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ71V/fKkXCFeihnWjbnj82MjTayPvS5tyPPzg6Oa87g8eUVrvFNXxC7r1fjsOqMzrh9UjJ/xHJvK8fmJ5Tj56nL84h/l+NVT5ThjcrY3nFqO3d8pR7/3yrH4veLq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeqX60gX8oZ4qbYYf2YQz5Htnbfoohx4rD1t9bO7fGzzYr1HX/tzNfv5DtKMacxm8d7leOSiwoNh7xUaPv1R9kecF62z/mkHGdn19Efl2OVOdn4flRc3Z/97XvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprepXL6kZ5E25Q/wUQ6wjc8nnyeaOa7Tm+XrESe15fBa3zcmjTsr2ph+U8nEyh195oByXvlGOzWeX4+pMz7C5mbZZ5fhetoc/d0I5rn88G9eszb1jy3HR34ure8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96qfjWjukntkOf3LIeIo2KJ9WRO+VzZlp+PPKsjuvYtYtvVNxTre/Ex5RgxphwvvpLFs9nFOF7xYTlGZtyPP1aO1W8px7EZe//jsjU+qBxDMw1z/6Mc9ZsVV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Vf3qZrWj+kkNIY/KJeKpmGJdmVs+Xz5WHlLksDyeb1yOB35fjuHji3VsvFLGOeyVYlxp6d6vHHUblOOwxaXofbEU195WimUXl2LCsFIsOrm4uvfce+20109/dthL384nfvjjl38ceHDhw4kXN3466Mnrg0wfnfRW9ds7qJ/VkOootYR8KqeIq2KL9WWO+Zz5evJ/S3HClkXcXvBisV6t33OmFXP50oxttR0y7m+y/P5ANj7HZ2tko1LcObczPns4q3dGdcbgMzvj4FOKq3vPvddOe/30Z4c9dtk/+9v4wC//OPDgwocTL278dNBDF3100lvVLz/aQ6ij1ZLqKTWFvCq3iK9ijHVmrvm8+RSfxev95hYxrGNiOZ75czFun2Xx2njuvX0pTnu70NizdmcMm9QRCy7piJ0O6ogbt+6IbTYvru4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056q/rtIe2j7CXU02pKdZXaQn6VY8RZscZ6M+d87nyX5xXrc9OnirlqPZvDX+xbip2ndMYrgwrN6+zTEX+akdXCp7bHknXaY7dZbXHro21x5dji6t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3qt8+2l5SnLSnUFerLdVXagx5Vq4Rb8Uc687c8/ljELcfOb0c16xajh/dXIpplVI+fuPeKsb3zEvbo25BW+wxtC2u/ndrXDqsNQb0b42zl7bEoXNb8qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666Mvr2ExvVb+zBPtpMcK+Su5QX6sx1VlqDflWzhF3xZ5ff5u3jQOWnsyvGGb9PvrzrBY6vSPeHFuM8/TvZXvcA1pjyp0t8VS5JXa7ojkG/qQ5tlnSFLd90JRf3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300EUfnfRW9VsPzhTsq+0t7a/ET3W2WlO9peaQd+Ue8VcMsg7NReOByXo9bJXOfD1fM6g9H8edj22N804rNHdmtjsam6Lp+MZ4fWlDLHugIYaOLq7uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeqv61YjOVawP+2t7zHz/vWtRz6s51V1qD/lXDhKHxSLr0Zw0LtgmbNiRr+Ox7W353B74fHOU7mqKLa9vzLUOeLJPTO7oE2ddUB8zNquPK/oWV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Vf3O1ZwtOV9xxmC92Gvab4kl4qraU/2lBpGH5SLxWEyyLs1N44Ox49Nirm99QHM+nsb3yv/uE5/tUR8n7lIXA2atSM/d/E3qN3V5Ounq5fnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfnZTKaT3qp+Z4vyY37GlNVNzhrst60f+y57D/W3GlQdphaRj+UkcVlssj7NUeOE1XqujG2MFzZoiM9vro/D+tcFjZMGLks3bv11Wv7oV+mal79M/zj7y/zq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLeq3/mqM0bnbPKl8xZnDvbd9p7Wkz2IOly8VY+pSeRluUl8FqOsU3PVeGHeb1GffG4b151HLEsnD16S/njhF+mwjRel3Q9dmD79z8/S9JkL8qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx66cn2ZTnqr+tXHzlnNDedtzpzkT7WE/bc9qH2Y9aUeF3PUZWoT+VmOEqfFKuvVnDVu2McfviJNOXxpPs7jJ3+enh2+IO13/yfp3ivmpi0GfpwWPz0nv7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreoXD9WI6mVnjs7dzBnnL/Kp+spe1H7MnsR6U5uKw2oUeVquEq/FLOvW3DV+NPx96hf5+LasOT/XWvnww7Tdvu+n1e+bmZatNzO/uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6vddg/N2Z87ipPrZ+ZszKOcw5lJe388q9mX2Jupz60+dplaRr+UscVvssn7NYeNIy6m7fJL+e8hHacCEWenYV95N48bNSEfeOy0tWDE1v7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreq3P1IbOHd39qxucgYpfjqLch7jTMK+3ByzP7NHUaerVa1HsUnelrvEbzHMOjaXjSdNxnnK/m+nsaPeShc99nqqH/hqenXwK/nVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Vv++cfO/iuwf7ZzWDc1hnkc7j1NfiqrMJ+3M5R/4199TralZ1m/Upf8th4rhYZj2b08aVtj/3ezPX/I9RL6WL93sh3bLJ8/nVvefea6e9fvqzw16eOzP7/PDHL/848ODChxMvbvx00EMXfXTSW9XvnMR3T/KjGOEc3l7Seaxawrmc+kq97Ywi349le1X7NflY3W5Oqt/yGiZbr3KZeC6mWdfmtvGlcfEpL6b1jn867bLGE2noiPH51b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvVb+9oe/f1Ii+h/FdhPpZ/rSvEkucz6kxnNOoPe3X7VnFYXsX+VkNq44zV+Vz61dcF9usb3PcONPaf8Kj6c9PP5ja9rk/v7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrp/b/4d3yx3/M9nD2j/bPvJJzLO5tWV9tjyK/OqpzXiDnqMHtX+zd7GPFZrlLPqWnkdXPYehbjrHNz3XjTvPUa96Rbb7ozv7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjqf/v/+/sV30M5JnJv5Ps53UuomucP5vDNq57TOKtXbzqyc28i/9u9qEvs4sUk9r6YVt9U28rscJ86b29a7OW/cad/o6NH51b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300Unvd+P/3fr/Lv5/l/9rvf6r9fq/1vd/tb7/r/Xzn1o//6v1899aP/+v9e9/av37v1r//rfWv/+v9d9/1Prvf2r991+1/vu/Wv/9Z63//rfWf/9d67//r/W//6j1v/+p9b//qvW//6v1v/+s9b//reV//w+R/mH3eJzt24mblMW1x/GZbmZpMeKWEDUJLjFqjHEhMXHhngoG9WrQuMYrxgX3qEhco0QiqHFJzFVU4lVRMai44AKuKIKiiAgKqICCIsgi+87AADO3P+9L/xUNz+Pz+r5v1TnfX1fVOaeqe2pqtvxrOmNAPLBsUJy4+7Mxfe3QKF3+eoz+58ioO/G9+GbUuLhp+sex66BPo+0PP49BR38ZZ+4zK15/e04cseO3ce8ei+KolUtiY9/l8ftpK2Pa6tXxg+lro9+d6+Lf2zTHxWdviA63bIwnem+KV45riYlrW+JXf2mNhZ+0xol1NemSbWqSq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein7//8uzn43Tew6Lj3YbHj2uGRU/7zkmdt5ufJzcbVK0P2FKDFv9RfQ7embsf/w3sXPb+bGu98L4y5Al0e3/lscFXVbFBS+tiZ8saIoe89bH2uc2xMVdNsUfnm2J/ee1xkPX16T3l9SkO7rWplcfqE01U2rTytbatPr7hdR5t0J2de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0e/z8Oz4Pw6P1oWj4ve7vB+dl4+PpZdMjtvumhrdzp4RE7/8Oi5sOzdeW/RtXNlncZz58bJsHA56ZE00/WRdPHRFczZefz2nJRvXEW/XpO4X1qb7mmrTv68spH/OKKTeHYvp1OuKaepzxTTg02LaeVEx3b0yv7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreg3J3wu3h1x8vtxx1kT4qttPonzzpsW53T/Mg5qOztOOWdedL9wYbTbdWn87F8rYuBLq+Py/k3x9MHNcdX9G6PlrZYYeWpNurdjrvmkQYX0+8OKqXVEMb21X5s08R9t0umft0lntK9Lzx1ZlzZdWJfG9KpLp/bNr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/qtC3PD56PNDl0+iZYJ0+KGjV/G7Mmz4+GT5scRfRZFnzOXxb5LV8aBHdfGwAPWx6AFG7LxHtU1n9tTDiykP24sZOPYdEyb1H1ym0xTt6fq0vgNdenIqE+zr6pP9wyoT+2H16fmcfXp7on51b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/YYH2YIz4nbUfs/1WcfvA30XHO/Bh32OJ4L5bH4pWr4uenNWVzz3oUs8Zum6/jo9vkc9i4jdi3Lh36Sl367n71aat+9WnUvPo08mcNqcf5DamxX0O6f1hDWjWuIb02rSH99sv86t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol98FCOsE3PF56WPuPrY/YujNGZ5HPDI6my9icfis9j02jO1qc+b+Xg/e3ObtC7KjLPrUs3luea1xzak2x9tSL+b15BW/qgxlX7XmJb1aEwTb2tMDz3QmAqPN6bLBudX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/XKEOClWWC/mjM9N30Erl2c5p+GxdbH3pg1xVqk1WufUZHHbutz+l23S7dvWpXc/rsvm7jaFhnTVdfm4PrF/Yxp2Ra7x9cmN6cRVjWlU21I66YeltPM+pTR9/1La5qD86t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol+elCvESzHDujF3fH5sfD1uXWw6ZmOWn+f9NI/nNfcX0zYPtMlil/VqfK6/qiGNXdiQjZ/xnDmtMe1RKqXH9iula44upbu6ldJTF5VSpz+X0l+vKaUjryulPa/Pr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/rVCvKlnCFuih3Wjznkc2Rr3UOtIeaIw9bfcV+3SRd9UJetzz8fnq/fmtSYdnq4PI/nN6Y3O+Qa7jwv1/bgjaXU/pZS+qb835CbS+mjvmXdfUpp6I351b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb96Sc0gb8od4qcYYh2ZSz5PNq9+qZDl6xdLeTwXt83J/qXGNOOGfLzN4drjSmnEZaXU/W+l9F5Zy+Cbytp6ldLRPUvp+XNL6YM/lMe13GbWUaX0apf86t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol/NqG5SO8ifcog4KpZYT+aUz5Vt+fneHetTLK7PYtN7HfN1umdtKb2YSmn9xaVUuDEfx7d7l9JbZe5lp5TSsYeW0v1l9tMLpTRyYWP637KGXSY0poM+yK/uPfdeO+31058d9thlnx/++OUfBx5c+HDixY2fDnrooo9Oeiv61c1qR/WTGkIelUvEUzHFujK3fL58HNBUn+WqLJ6/05jm7FxKL5yar2Pj1bM8Xk9enI8rLWlpYzpwRGPqd2djOqJ7YxrTqTH9bPfG1LxtY/px2/zq3nPvtdNeP/3ZYa/n5vnED3/88o8DDy58OPHixp/lq7Ieuuijk96KfnsH9bMaUh2llsjy6fV5nBdbrC9zzOfM18qTGtOAjxuzuL3rufl6tX6HXJHP5RFltv+e0ZgG929Mr3Yta6krz9lRDenzmxrSric0pPb7NqRbd2hId7bNr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/rlR3sIdbRaUj2lppBX5RbxVYyxzsw1nzef4rN4/feb8hh22PmltOagfLx3ezAfzxu/aEhPXp1r/M1r9WnwhfVp1z3r07WryjHk07p02bj86t5z77XTXj/92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ot8e0j7KXkI9raZUV6kt5Fc5RpwVa6w3c87nznfcnK/Ps7vlc916Nod/sqQhXdujIdUuyjWdsKAuvXFVubbfpi7tM7xN6tWrTfrk5DZp9FH51b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb99tL2kOGlPoa5WW6qv1BjyrFwj3oo51p255/PHIG4v3K68Nl9oTGf8ujwOQ/Lxnt2zPhvfp/esSwfc1ibd0FRM7/6lmN7ctlzHjy6kIfcU0l035Vf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX9zhLsp8UI+yq5Q32txlRnqTXkWzlH3BV7Htyct40Dlt8MzmOY9bt4UrkW2q4+NRxdl41r26HFtNPKQqrvXEirnqxNvfapTX/6sCZdendN+vSG/Orec++1014//dlhj132+eGPX/5x4MGFDyde3PjpoIcu+uikt6LfenCmYF9tb2l/JX6qs9Wa6i01h7wr94i/YpB1aC4aD0zW693P12fr+b2F+Xj/pbaYhrUrZNo6lW1fe2hrXLpVSzTsvSn+8NDG+NFlG7Ore8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfjWicxXrw/7aHjPbx5X3GuptNae6S+0h/8pB4rBYZD2ak8YFW/PIfH1/9Z9iNrf/dHZZd+eaNKF7S6Z1+EvNUXPM+jjtsHXR/t6m6NOtKbu699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3od67mbMn5ijMG68Ve035LLBFX1Z7qLzWIPCwXicdiknVpbhofjIfdWszm8KUr8vE2vrfs0hydxzdFGr0m7txxdew9eWVcu9XKmDxmRXZ177n32mmvXzZfynbYY5d9fvjjl38ceHDhw4kXN/5s37hvHgfoo5Pein5ni/KjMyZ1k7MG+23rx77L3kP9rQZVh6lF5GM5SVwWm6xPc9Q4YbWeb/tXS6zotSGOvGJd7HHrmkzj/pcuj42XLY0/Ll0ca1sXxbbPL8qu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+p2vOmN0ziZfOm9x5mDfbe9pPdmDqMPFW/WYmkRelpvEZzHKOjVXjRfmrXfakM1t4zp46PKYfPuSWPjqwnin27cxpN+8OP7quXH4jnOzq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHroyfWWd9Fb0q4+ds5obztucOcmfagn7b3tQ+zDrSz0u5qjL1CbysxwlTotV1qs5a9ywd7hvVRx837JsnDsUvo29hs6JV+bOiu1Hz4z+l3wVp6z9Mru699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3oz85Tr8/rfGeOzt3MGecv8qn6yl7UfsyexHpTm4rDahR5Wq4Sr8Us69bcNX40fKftomx8Lzp+dqb1qvbT45FbpkWvOVPijFOmZFf3nnuvnfb66c8Oe+yyzw9//PKPI6uxy1z4cOLFjZ8Oeuiij056K/p91+C83ZmzOKl+dv7mDMo5jLmU1fe98n1Ztjcp1+fWnzpNrSJfy1nitthl/ZrDxpGWKdfPis/unBF3bpwa4wqfxvZzJsaY2R/FCQd+lF3de+69dtrrpz877LHLPj/88cs/Djy48OHEixs/HfTQRR+d9Fb02x+pDZy7O3tWNzmDFD+dRTmPcSZhX26O2Z/Zo6jT1arWo9gkb8td4rcYZh2by8aTJuP8q9snRbt3x8f8pWPj3EvGRMc73suu7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+n3n5HsX3z3YP6sZnMM6i3Qep74WV51N2J/LOfKvuadeV7Oq26xP+VsOE8fFMuvZnDautG046sNM87bvjoqFt46I4tlvZlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100Udn9j3U5n/OSXz3JD+KEc7h7SWdx6olnMupr9TbzijEW3tV+zX5WN1uTqrf1DDWq1wmnotp1rW5bXxpPPXxt+Kmh1+Lp7u+FKOGDs2u7j33Xjvt9dOfHfbYZZ8f/vjlHwceXPhw4sWNnw566KKPTnor+u0Nff+mRvQ9jO8i1M/yp32VWOJ8To3hnEbtab9uzyoO27vIz2pYdZy5Kp9bv+K62GZ9m+PGmdZ/bnwhNqx5Oi7pOzi7uvfce+20z/qV+7PDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NGZfd+4+Z96yP7I93D2jPbPvpNwLu9sWl1tjyG/OqtyXiPmqMPsXe3f7GHEZ7lKPaemkdfNYetZjLPOzXXjTfOAro9F8eMB2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/76Cdkzg3832c76TUTXKH83ln1M5pnVWqt51ZObeRf+3f1ST2cWKTel5NK26rbeR3OU6cN7etd3PeuNN++/39sqt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx66Mn0r83OhLeO/Zf1vif9b8n+113/VXv9X+/6v2vf/1X7+U+3nf9V+/lvt5//V/v1PtX//V+3f/1b79//V/vuPav/9T7X//qvaf/9X7b//rPbf/1b777+r/ff/1f73H9X+9z/V/vdf1f73f9X+95/V/ve/W/5V978jt+4XCx7+vxg46dH46RNPxmk/ei62P/ylOLl2eBzUc2RMvuPduPykD+L08RNiVdOkGDLts2j8c3nPMHpGfDN5ZvQfODuOPWhuPHLr/Nhr0IK45I5FMevwJTFvRHmv0W559PjFiliz38qoa1kZHZ5YFX/fa3UcctPqWP366thzfH5177n32mmvn/7ssMcu+/zwxy//OPDgwocTL278dNBDF3100lvR7/9vbjcwnuowOH446bkYsefLcUOHN+LiUaPiP1uNiQtqPozioI9jVtMn0btlalw8fHoc9fOZ8f4Zs+Ppo+fGy6vnx8vnLoyry7XGiPuWRpczl8frq1fEE91WRe/7Vsdtg9bEV3esjXOPaYoRc5ri+G7rouPz6+LgWevi0xX51b3n3munvX76s8Meu+zzwx+//OPAgwsfTry48dNBD1300UlvRb/Pw7OHt34+jnvg5Xhk3Btx9yNvR6dyvJwa4+OZdpOiw52fxSvDP4+GB7+Mdw6YFUN6z8nGoc9xC+PIKYtj0W7LsvH6cNtV2Xh+cNDa2KF3U1z/8Lr4a//1ccFFzXHs9zbEhoEbomXrjXHHaRujbzmO97w3v7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreg3J3wu3vUrvhmfb/NO7PfW+zFshwnxwnaTo8/wKTFo2+nx4vdmlvPM7OjVaV4sP3dBvNVlcayfuzRGH7UiuvZYFRPOWBPXfi/XvKZpfSzdc0N03XdjfLjVplg+ZlMUu7dEw1ct8czhrXH031pj+hOt0Twsv7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprei3LswNn4823Ve/H11vmBDjn5kcB/adGksKM6LfAV/HxO/MiesHzI8bZy+M5TOXxKr7l2fj8dExa7I527z9+igNbs7GsVM5X+1wcq61UFuTrjqpJi3pX86B42vSoWtq0lvb1aaBu9emQ/bOr+4991477fXTnx322GWfH/745R8HHlz4cOLFjZ8Oeuiij056K/rFBuvDHPE5afudmZPj6blTo+89M2KnRV/HjsvmxGGPfRs3NORz3XoUs2ZOXJut35mvNmdz2LiNrW+NWd+pSW/eXJOGLqhJF/5Xbbrw5tr0vRG16fkFtSnaFtKDuxfSWQcU0uJf5Ff3nnuvnfb66c8Oe+yyzw9/md+yfxx4cOHDiRc3fjrooYs+Oumt6BcfxQjrxFzxeekjrq48alacdvXc+NtxC7L1Jh6Lz2LTqPp1ccLe+Xg/8dqmiP1b4/xDa9KTY3LNA/5Tmw5cV65zOhXSA9cU0gv/KaT+Ywrp2q8L6YiVhfR0uZb/bk0xu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrpreiXI8RJscJ6MWd8bvquGjg3yzmnnrAkrn12eTz32qroet3aLG5bl1futCnOntgSl+yVz92X/6c27TKpNhvXrrcW0unjco3n/LSY1h9TTBeeW0wbriqmd24spr63FtPLt+dX9557r532+unPDnvsss8Pf/zyjwMPLnw48eLGTwc9dNFHJ70V/fKkXCFeihnWjbnj82PjgOuXxO+al2f5eZe6piwuHzdzQ/zpm01Z7LJejc/u42tTz875+BnPWw8opnFnF9N/31JMP3q0mH49rJhOGFVMc8YW0x4fFdOSicU0flJ+de+599ppr5/+7LDHLvv88Mcv/zjw4MKHEy9u/HTQQxd9dNJb0a9WkC/lDHFT7LB+zCGfI1tH/W51FnPEYetv8eUt0W63fH1//97abP0O/nchvb2mPI+jmM69NtfwyzdzbZ2nlfeBM4rpH18W08nl6zVfFNPS8rPTp+VX9ydvfq+d9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff3qJTWDvCl3iJ9iiHVkLvk82Tzk+81Zvn7xnfLesxyfxW1zstM5hXTTZ/l4m8ODHy+m894rptLUYrq0rOf46WVtnxTT8veL6Q9vFNOfny+Pa7nNbY8U05kD8qt7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+NaO6Se0gf8oh4qhYYj2ZUz5XtuXnwy+tSfOPyGPbpf/I1/f404rptPuLaeDb5Xg2NR/Hi6YU0/ll7v5DimnV3cWUri6mwunlNd65mH5V1vDOj4vpi13zq3vPvddOe/30Z4c9dtnnhz9++ceBBxc+nHhx46eDHrroo5Pein51s9pR/aSGkEflEvFUTLGuzC2fLx/TjstzmPX4753Le/UryuP2XL6OjVf7Mufxb+fjSsu3XYrp8x2L6ZC5hbTw9ULqcV8hfXJdIT12USGN755f3XvuvXba66c/O+y13zyf+OGPX/5x4MGFDyde3PjpoIcu+uikt6Lf3kH9rIZUR6kl5FM5RVwVW6wvc8znzNcDzxRSl73yuD12eL5erd9TxuVz+bwy24qOZe6l5fz+eCF9e0Z5jZT3+X2m16axg2vTyL61af9LatMvz82v7j33Xjvt9dOfHfbYZf/kzfGBX/5x4MGFDyde3PjpoIcu+uikt6JffrSHUEerJdVTagp5VW4RX8UY68xc83nzKT6L1/tNz2PYN+VYNeCOfNzGrszHc6+Dyhom5BoXtKtNvx9Zk97/a03qcGxNuvJnNWnH3fOre8+91057/fRnhz122eeHP375x4EHFz6ceHHjp4Meuuijk96KfntI+yh7CfW0mlJdpbaQX+UYcVassd7MOZ873/Om5+uzcVg+V61nc/ij3xZShzG16anOueZ1qSa9d39rtBnfEgP3aIkuT2yKNadtis/+K7+699x77bTXT3922GOXfX7443fe5s8ADy58OPHixk8HPXTRRye9Ff320faS4qQ9hbpabam+UmPIs3KNeCvmWHfm3n6btYvbd19cTJc1FlPxrkJ6sU0hG787xubjO6i5JV4YuSmOfnhjTHt0Q4yd2Bylg5vjqSnlmPrK+uzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei31mC/bQYYV8ld6iv1ZjqLLWGfCvniLtiT+fNeds4YFnQmscw6/fefcq10MU16Y/Rmo3r+TuU97j3NEe3juvjF61N0aXQFHscuTb2nrwm1j29Jru699x77bTXT3922GOXfX7445d/HHhw4cOJFzd+Ouihiz466a3otx6cKdhX21vaX4mf6my1pnpLzSHvyj3irxhkHZqLxgOT9XpIQ222nr+4uSUbxxjaHC9/tC7T9kG3NTFmwap44/WVcerUFfHEsSvish/kV/eee6+d9vrpzw577LLPD3/88o8DDy58OPHixp/pKOuhiz466a3oVyM6V7E+7K/tMe2z7DXU22pOdZfaQ/6Vg8Rhsch6NCeNC7bH2pfjZHkdb920IZvbu/dsinEd18QPtl+VaS2dtyyOX78knly4OC44YnFM3Cq/uvfce+20109/dthjl31++OOXfxx4cOHDiRc3fjrooYs+Oumt6Heu5mzJ+YozBuvFXtN+SywRV9We6i81iDwsF4nHYpJ1aW4aH4xjRmzI5vBe/dZm42l8Px23NO7utTjuumJhzBj9bVzbZ36MeX1e7HbNvOzq3nPvtdNeP/3ZYY9d9vnhj1/+ceDBhQ8nXtz46aCHLvropLei39mi/OiMSd3krMF+2/qx77L3UH+rQdVhahH5WE4Sl8Um69McNU5YreepnVZF2nd53Lfbkrji4IWZxt67zI1jf/hNPDtgVnR5/us468yvs6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3op+56vOGJ2zyZfOW5w52Hfbe1pP9iDqcPFWPaYmkZflJvFZjLJOzVXjhbnb2GXZ3DauTefMjd0OmR2HXDgztmv7ZWz8zfR4+MdfxD9Gf55d3XvuvXba66c/O+yxyz4//PHLPw48uPDhxIsbPx300JXpK+ukt6Jffeyc1dxw3ubMSf5US9h/24Pah1lf6nExR12mNpGf5ShxWqyyXs1Z44a9x2+/jVt+Oycb5x4vzohrzvk86u6bEudc8WnM3fmTGPT45Ozq3nPvtdNeP/3ZYY9d9vnhj1/+sxqrzIMLH068uPHTQQ9d9NFJb0W/eKhGVC87c3TuZs44f5FP1Vf2ovZj9iTWW1abTshrG3larhKvxSzr1tw1fjScMXxmNr6vtUzJtI4e83Es+8WEGHfPh/FMmw+zq3vPvddOe/30Z4c9dtnnhz9++ceR1dhdcj6ceHHjp4Meuuijk96Kft81OG935ixOqp+dvzmDcg5jLmX1/Sf5vizbm5yRr3t1mlpFvpazxG2xy/o1h40jLT/56ZT4cadJMeOZ8bHT0LFxzj3vxXf7jY5Hv34nu7r33HvttNdPf3bYY5d9fvjjl38ceHDhw4kXN3466KGLPjrprei3P1IbOHd39qxucgYpfjqLch7jTMK+3ByzP7NHUaerVa1HsUnelrvEbzHMOjaXjSdNxvnvvx4TZ135dhz88IgYuvMb0feQ4dnVvefea6e9fvqzwx677PPDH7/848CDCx9OvLjx00EPXfTRSW9Fv++cfO/iuwf7ZzWDc1hnkc7j1NfiqrMJ+3M5R/4199TralZ1m/Upf8th4rhYZj2b08aVtmOaRmaaz7ry5TjkV0PjxHYvZlf3nnuvnfb66c8Oe+yyzw9//PKPAw8ufDjx4sZPBz100UcnvRX9zkl89yQ/ihHO4e0lnceqJZzLqa/U284osv1Yea9qvyYfq9vNSfWbGsZ6lcvEczHNuja3jS+Nj588LCZ3HRLrNw6Odt2fzK7uPc8/m7ez9vrpzw577LLPD3/88o8DDy58OPHixk8HPXTRRye9Ff32hr5/UyP6HsZ3Eepn+dO+SixxPqfGcE6j9rRft2cVh+1d5Gc1rDrOXJXPrV9xXWyzvvM5/nKmdfozj8cxjz8Sww8ckF3de+69dtpn/cr92WGPXfb54Y9f/nHgwYUPJ17c+Omghy766KS3ol89ZH/kezh7Rvtn30k4l3c2ra62x5BfnVU5rxFz1GH2rvZv9jDis1ylnlPTyOvmsPUsxlnn5rrxpnnxxv5xYu9+2dW9595rp71++rPDHrvs88Mfv/zjwIMLH068uPHTQQ9d9NFJb0W/76Cdkzg3832c76TUTXKH83ln1M5pnVWqt51ZObeRf+3f1ST2cWKTel5NK26rbeR3OU6cN7etd3PeuNM+7ahbs6t7z73XTnv99GeHPXbZ54c/fvnHgQcXPpx4ceOngx666KOT3i3jv2X9b4n/W/J/tdd/1V7/V/v+r9r3/9V+/lPt53/Vfv5b7ef/1f79T7V//1ft3/9W+/f/1f77j2r//U+1//6r2n//V+2//6z23/9W+++/q/33/9X+9x/V/vc/1f73X9X+93/V/vef1f73v9X87/8BBOHtvnic7dvpl5XVlQZwF06JqNEkQlwa41J0OaFoQjDSZicYYwZaScfEjhCJRjtOTUtjo41mSSQqKhJjtO2EQcEWAhoILQYBBQoDKrMMylBAATVAURQ1UcO9jfT9nZvb/0J/uO/58vKes4fnueecvfc5b3HUUVkbc+Xjcf7KZ2LH4efjF+snxAvfmxrX3/nH+G3vWTFs4htx8ry34vVH3okXOyuiT6/lse+YFXHtpNWx9uC6+NKRDbFh9Ucx9pYtUfnGtvj5uu0x/S8744t37Ypz6ndHW//qeO1nNXHFzbUx4KK6GLK+Lpb+cG+MnL03+tTujds6i0/v+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb4+3dF/xei5vsT4yeHp0bXD2bEgu/Pjlcb5sbOry6IqZcsjlj3bpzV6/1YcNGqmFa7NsbcvCGOefKjqL1/S7ScXRktv9kR//3Xquiq2B2PPlUdh86ujT1P1MWCir2xbN2+OGNefbw8cn/kTmmIcU80xH3bGmLESQfi1LMOpKd3/cbJkadHnx322GWfH/745R8OeOCCD0544YYfD3zwwg9PfEv8/R76tl75Sjy1fEZUts+ONSvfjFHXLYzP3bsk6voviyHzP4jW2tXxrfc+jCNDNkX9zM1pHt4ZtSPGdNsVF1y/J83Xp66uS/N57ND6GDRzf8xb0RDzlx6IV55vjLEDDsaVaw7GVV9riuW/borFc5riT0uKT+/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e+OCFH574lvhbE34XY2sv+3P06P+XuLt+YTRFRTRcvTzeqV0RVX+3NhoHbIgJ+Y/irbu2Ru9nt0d+eFX0/eyeOOr+mnjqD3VxwpP7Yu6AIufLezXGxf9wMJ68qSmO79ccl7Q2xzfGt8Q1J7RG3Z2t8dhrrdFzQ2v0qyo+ves3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4m9fWBt+HzKTz347npxREZ/evDyGzVoZF122LtYM2RgnXbU55n1QmPOTd0bvE3dHn2XVaT66P7Avrdl+cSCu3diY5vHfhzfHDaNbEqdvXtoWvTa0Rc+bD8WgZYdiTo/2mH9De4we3h6zHy4+ves3To48PfrssMcu+/zwx29abwUc8MAFH5zwwg0/HvjghR+e+Jb4iw32hzXidyL73e7vRe2pq2Lx4nXx456bYtAZW+LBNZWx4MtVae3Zj2LWmYfr0/49s7oxrWHzduyXW+PIdW3xZt9D8fKRQ9F9Rnt079sRd07riAlHOmLhgM4YMbwz8uM64/P/UXx612+cHHl69Nlhj132+eEv+S34hwMeuOCDE1644ccDH7zwwxPfEn/xUYywT6wVvxcdcfXS+zfFC1O2xMJR29N+E4/FZ7Hp8BUN8cyNxfneU90cDw1ujeOmtMXT84ucHxjREZPP7Ixef+yM4ad3xaQRXXHX/K645EBXvHtKLp49Lxe/uKT49K7fODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744Ylvib8cIU6KFfaLNeN3o9tnzZaUc5775a54Y3N17K+ui6derU9x277887XNMel/WuJzD7WltTt9Z3uMWNOR5vXjq7qieUlX4vjJ6FxctjQX3VtzcUWPfFT0zseA/vmYHsWnd/3GyZGnR58d9thlnx/++OUfDnjggg9OeOGGHw988MIPT3xL/OVJuUK8FDPsG2vH78fGvdN2xdjza1J+/sfL96e4/HT3ppj+mZYUu+xX8zP6rx3xxTmdaf7M5/eeycWHB3Kx9qv5ePDefLz+XD52vp6P4xblY8z7+ei5Jh+b1haf3vUbJ0eeHn122GOXfX7445d/OOCBCz444YUbfjzwwQs/PPEt8VcryJdyhrgpdtg/1pDfka0xD+5NMUcctv8umNgSg4e1pf057MaOtH/HDe6KRT1zcfFruTj6jCKHaf9V5FZRmY8FNfn4YV0+aqrzccGufHxhRz6aKotP7/qNkyNPjz477LHLPj/88cs/HPDABR+c8MINPx744IUfnviW+KuX1Azyptwhfooh9pG15Pdkc+S3GlO+bmxsSfFZ3LYm5zV2xjUfd6V5soafeSAfx87Lx6Ct+TitwGfb7gK39fk48+181E/Nx1lP52N9Qeb6e/LR9U/Fp3f9xsmRp0efHfbYZZ8f/vjlHw544IIPTnjhhh8PfPDCD098S/zVjOomtYP8KYeIo2KJ/WRN+V3Zlp/nHlNY73PbU2w67Zri/t60PRcHhuTjkdn5eHZbcR5P2pKP4wu4734iH+cMysfbBezfqMrFCXNyMXNcLir+LRdN/1x8etdvnBx5evTZYY9d9vnhj1/+4YAHLvjghBdu+PHABy/88MS3xF/drHZUP6kh5FG5RDwVU+wra8vvy0fDB+0pV9mPd9+aixtPzcf+scV9bL7uKczX1lnFecXlxLdy0fijXMxu74pTX+6KL9zUFXu+1BWjD3fGxubO9PSu3zg58vTos8PePX9bT/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4u/soH5WQ6qj1BLyqZwiroot9pc15nfm674xXbF8VC7F7VVTivvV/q1bUlzLxxawnfV8Lio/lYvcyK44sbawR37aGV/f0xGrftkRCy4v1ALdOmJaS3t6etdvnBx5evTZYY9d9vnhL/kt+IcDHrjggxNeuOHHAx+88MMT3xJ/+dEZQh2tllRPqSnkVblFfBVj7DNrze/Np/gsXr+4uxjDjp6Wj5HfLM736lNzaT7HPdsZW5cXuZ48sD0qZx6KlecdilFL2+Lcx9rijvuKT+/6jZMjT48+O+yxyz4//PHLPxzwwAUfnPDCDT8e6bxZ4IUfnviW+DtDOkc5S6in1ZTqKrWF/CrHiLNijf1mzfnd+f50dXF/DnyuuNbtZ2t485ud8dBbHTF+TpFz71lt0W1ZoRbubIkdN7TEr9Y3xxWPNcdn7yk+ves3To48PfrssMcu+/zwxy//cMADF3xwwgs3/Hjggxd+eOJb4u8c7SwpTjpTqKvVluorNYY8K9eIt2KOfWft+f1hELeHHslFj6sLcXlgV7zUtzPN36B3DqX5rTq/NRr2N8djK5ritNUH45jDjfHt2xqjpltjvL77QHp612+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfE312C87QY4Vwld6iv1ZjqLLWGfCvniLtiT8Xf8rZ5gOXkgl8xzP69/ZFCLfRJW/zhntY0r1MKVeeixY3xn0MPxPCLG+LRS/fH0H+tj9s/2Rdf+XhfenrXb5wceXr02WGPXfb54Y9f/uGABy744IQXbvjxwAcv/PDEt8TffnCn4FztbOl8JX6qs9Wa6i01h7wr94i/YpB9aC2aD5js11lXtaf93GNOS5rHh3c0RnOuyPm4sfvi6B57o7OmNp47ujZ2P1ATM79Tk57e9RsnR54efXbYY5d9fvjjl3844IELPjjhhRt+PPDBCz888S3xVyO6V7E/nK+dMZ2znDXU22pOdZfaQ/6Vg8Rhsch+tCbNC2y/GtyW9vF3zm1Ka3voxP1x/M/2xU++Xpe4Xvvsnhh33u6o7rErXvmXqjipX1V6etdvnBx5evTZYS/FjcHF3yDliYHFeAAHPHDBBye8cMOPBz544YcnviX+7tXcLblfccdgvzhrOm+JJeKq2lP9pQaRh+Ui8VhMsi+tTfMDY7f6g2kN376oPs2n+T2lY3esnl4VqybviNObKmPun7bF0bVb45apW9PTu37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74l/u4W5Ud3TOomdw3O2/aPc5ezh/pbDaoOU4vIx3KSuCw22Z/WqHmC1X7+/N118fBN1bH+73fF7Nt2JI4Lr9sSY7/7cez7YFM8um1jTHxqY3p612+cHHl69Nlhj132+eGPX/7hgAcu+OCEF2748cAHL/zwxLfE3/2qO0b3bPKl+xZ3Ds7dzp72kzOIOly8VY+pSeRluUl8FqPsU2vVfMH8YtuetLbN61fGb4lb7vgoRv5uQ1zf78P42rC1sW3Qmnj/4Or09K7fODny9Oizwx677PPDH7/8wwEPXPDBCS/c8OOBD1744YlviX+qjyuKa999mzsn+VMt4fztDOocZn+px8UcdZnaRH6Wo8Rpscp+tWbNG+wz76uMpfdtTvM8c/u6eOOZ1TGgYkVMmvx+nHPde7Hrw+Xp6V2/cXLk6dFnhz122eeHP375hwMeuOCDE1644ccDH7zwwxPfEn/xUI2oXnbn6N7NmnH/Ip+qr5xFncecSew3tak4rEaRp+Uq8VrMsm+tXfOHw+9rN6T5bbtoZeJ6VOu7cfGtFXH8ksWxt8/i9PSu3zg58vTos8Meu+zzwx+//MORauwCLvjghBdu+PHABy/88MS3xN+3Bvft7pzFyVTn9+1Id1DuYaylVN+vL57L0tmktrjv1WlqFflazhK3xS771xo2j7jc9uMVcetdy+L0zUviRzvejsmL58cPFs2L7SfOS0/v+o2TI0+PPjvsscs+P/zxyz8c8MAFH5zwwg0/HvjghR+e+Jb4Ox+pDdy7u3tWN7mDFD/dRbmPcSfhXG6NOZ85o6jT1ar2o9gkb8td4rcYZh9by+YTJ/O89PYFMeGlN2PEijnR+O3ZsfiOWenpXb9xcuTp0WeHPXbZ54c/fvmHAx644IMTXrjhxwMfvPDDE98Sf9+cfHfx7cH5Wc3gHtZdpPs49bW46m7C+VzOkX+tPfW6mlXdZn/K33KYOC6W2c/WtHnF7fFz5ybOE1+aESN/Pi3G9381Pb3rN06OPD367LDHLvv88Mcv/3DAAxd8cMILN/x44IMXfnjiW+LvnsS3J/lRjHAP7yzpPlYt4V5OfaXedkch3jqrOq/Jx+p2a1L9poaxX+Uy8VxMs6+tbfOL467R0+Mzo6ZE3wsnxcDxE9LTu37j5MjTo88Oe+yyzw9//PIPBzxwwQcnvHDDjwc+eOGHJ74l/s6Gvr+pEX2H8S1C/Sx/OleJJe7n1BjuadSezuvOrOKws4v8rIZVx1mr8rn9K66Lbfa3NW6ece25+ffx+Ie/i/af/jY9ves3To48PfrssMcu+/zwxy//cMADF3xwwpvuHXsX6wB88MIPT3z/7/6rUA85H/kO58zo/OybhHt5d9PqamcM+dVdlfsaMUcd5uzq/OYMIz7LVeo5NY28bg3bz2KcfW6tm2+cL7jw6fjNzMfT07t+4+TI06PPDnvsss8Pf/zyD0eqwQq44IMTXrjhxwMfvPDDE98Sf9+g3ZO4N/M9zjcpdZPc4X7eHbV7WneV6m13Vu5t5F/ndzWJc5zYpJ5X04rbahv5XY4T561t+92aN++4X7h3ZHp612+cHHl69Nlhj132+eGPX/7hgAcu+BLOyiJu+PHABy/88MQ3m/9s/2fxP8v/5V7/lXv9X+7nv3I//5f7/U+53/+V+/1vud//l/v3n3L//lfu33/L/ft/uf/9R7n//U+5//1Xuf/9X7n//We5//1vuf/9d7n//X+5//+Pcv//P+X+/7/K/f//lfv//yz3//+btaxlLWtZy1rWspa1rGUta1nLWtaylrWsZS1rWcta1rKWtaxlLWtZy1rWspa1rGUta1nLWtaylrWsZS1rWcta1rKWtaxlLWtZy1rWspa1rGUta1nLWtay9v/Z/hclUV/1
+  </AppendedData>
+</VTKFile>
diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index c039fbdd641..cbdd0d5105c 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -288,7 +288,7 @@ for more information.
 On some platforms, linking with `libunwind` was responsible for an increase of the runtime of the final application.
 If you experience such an issue, we recommend to compile \ceres without `glog` support.
 
-\attention In the master branch of \ceres `glog` was dropped as a dependecy and `abseil` was added instead. It is not compatible with \visualstudio 2017 or earlier versions.
+\attention In the master branch of \ceres `glog` was dropped as a dependency and `abseil` was added instead. It is not compatible with \visualstudio 2017 or earlier versions.
 
 \subsection thirdpartyGLPK GLPK
 
diff --git a/Documentation/doc/Documentation/packages.txt b/Documentation/doc/Documentation/packages.txt
index e3f1d34622b..b311159a37f 100644
--- a/Documentation/doc/Documentation/packages.txt
+++ b/Documentation/doc/Documentation/packages.txt
@@ -71,6 +71,7 @@
 \package_listing{Triangulation_on_sphere_2}
 \package_listing{Periodic_2_triangulation_2}
 \package_listing{Hyperbolic_triangulation_2}
+\package_listing{Triangulation_on_hyperbolic_surface_2}
 \package_listing{Periodic_4_hyperbolic_triangulation_2}
 \package_listing{Triangulation_3}
 \package_listing{TDS_3}
@@ -94,6 +95,7 @@
 \package_listing{Skin_surface_3}
 \package_listing{SMDS_3}
 \package_listing{Mesh_3}
+\package_listing{Isosurfacing_3}
 \package_listing{Tetrahedral_remeshing}
 \package_listing{Periodic_3_mesh_3}
 \package_listing{Alpha_wrap_3}
diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 2692995162c..a2ad6677ee6 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -22,7 +22,6 @@
 
 
 
-
 @article{ cgal:afh-pdecm-02,
     author =  "P. K. Agarwal and E. Flato and D. Halperin",
     title =   "Polygon Decomposition for Efficient Construction of {Minkowski} Sums",
@@ -130,6 +129,21 @@
   ,update       = "04.04 kettner"
 }
 
+@book{cgal:b-gdg-83,
+  title={The Geometry of Discrete Groups},
+  author={Beardon, A.F.},
+  series={Graduate texts in mathematics},
+  year={1983},
+  publisher={Springer}
+}
+
+@book{cgal:b-gscrs-92,
+  title={Geometry and Spectra of Compact Riemann Surfaces},
+  author={Peter Buser},
+  year={1992},
+  publisher={Springer}
+}
+
 @article{ cgal:bbp-iayed-01
   ,author       = "H. Br{\"o}nnimann and C. Burnikel and S. Pion"
   ,title        = "Interval arithmetic yields efficient dynamic filters
@@ -387,6 +401,12 @@ Boissonnat}
   organization={ACM}
 }
 
+@techreport{ cgal:c-mcctci-95,
+  title={Marching Cubes 33: Construction of Topologically Correct Isosurfaces},
+  author={Chernyaev, Evgeni},
+  year={1995}
+}
+
 @inproceedings{cgal::c-mssbo-04,
   author={Chen, L.},
   title={{Mesh Smoothing Schemes based on Optimal Delaunay Triangulations}},
@@ -643,6 +663,17 @@ note="Conference version: Symp. on Geometry Processing 2003"
   , year = 2009
 }
 
+@article{cgal:dljjaw-sisp-15,
+  title={A survey on Implicit Surface Polygonization},
+  author={De Ara{\'u}jo, Bruno Rodrigues and Lopes, Daniel S and Jepp, Pauline and Jorge, Joaquim A and Wyvill, Brian},
+  journal={ACM Computing Surveys (CSUR)},
+  volume={47},
+  number={4},
+  pages={1--39},
+  year={2015},
+  publisher={ACM New York, NY, USA}
+}
+
 @article{cgal:dfg-cvtaa-99t,
   title={{Centroidal Voronoi Tessellations: Applications and Algorithms}},
   author={Du, Q. and Faber, V. and Gunzburger, M.},
@@ -689,6 +720,33 @@ Mourrain and Monique Teillaud"
   keywords = "Convex hull problem, Frame, Linear programming, Data envelopment analysis, Redundancy"
 }
 
+@inproceedings{despre2020flipping,
+  title={Flipping geometric triangulations on hyperbolic surfaces},
+  author={Despr{\'e}, Vincent and Schlenker, Jean-Marc and Teillaud, Monique},
+  booktitle={36th International Symposium on Computational Geometry},
+  year={2020},
+  url={https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.35}
+}
+
+@article{despre2022experimental,
+  title={Experimental analysis of {Delaunay} flip algorithms on genus two hyperbolic surfaces},
+  author={Despr{\'e}, Vincent and Dubois, Lo{\"\i}c and Kolbe, Benedikt and Teillaud, Monique},
+  year={2022},
+  url={https://inria.hal.science/hal-03665888v1/document}
+}
+
+@article{aigon2005hyperbolic,
+  title={Hyperbolic octagons and {Teichm{\"u}ller} space in genus 2},
+  author={Aigon-Dupuy, Aline and Buser, Peter and Cibils, Michel and K{\"u}nzle, Alfred F and Steiner, Frank},
+  journal={Journal of mathematical physics},
+  volume={46},
+  number={3},
+  year={2005},
+  publisher={AIP Publishing},
+  url = {https://doi.org/10.1063/1.1850177}
+}
+
+
 @article{cgal:dl-cginc-19,
   author = {Despr\'{e}, Vincent and Lazarus, Francis},
   title = {Computing the Geometric Intersection Number of Curves},
@@ -909,6 +967,17 @@ Teillaud"
    pages   = "19--27",
    year    = "2003"}
 
+@inproceedings{ cgal:g-ctcmi-16,
+  title={Construction of Topologically Correct and Manifold Isosurfaces},
+  author={Grosso, Roberto},
+  booktitle={Computer Graphics Forum},
+  volume={35},
+  number={5},
+  pages={187--196},
+  year={2016},
+  organization={Wiley Online Library}
+}
+
 @inproceedings{ cgal:g-frseb-99
   ,author       = "B. G{\"a}rtner"
   ,title        = "Fast and robust smallest enclosing balls"
@@ -1248,6 +1317,14 @@ Teillaud"
   ,update       = "01.06 hoffmann"
 }
 
+@inproceedings{ cgal:jlsw-dchd-02,
+  title={Dual contouring of Hermite Data},
+  author={Ju, Tao and Losasso, Frank and Schaefer, Scott and Warren, Joe},
+  booktitle={Proceedings of the 29th annual conference on Computer graphics and interactive techniques},
+  pages={339--346},
+  year={2002}
+}
+
 @incollection{ cgal:k-dat-96
   ,author       = "Keffer, T."
   ,title        = "The Design and Architecture of {T}ools.h{\tt ++}"
@@ -2386,6 +2463,46 @@ location    = {Salt Lake City, Utah, USA}
   ,update       = "98.01 kettner"
 }
 
+@article{cgal:vc-acvdupmc-04,
+ author = {Valette, Sébastien and Chassery, Jean-Marc},
+ doi = {10.1111/j.1467-8659.2004.00769.x},
+ hal_id = {hal-00534535},
+ hal_version = {v1},
+ journal = {Computer Graphics Forum},
+ note = {Eurographics 2004 proceedings},
+ number = {3},
+ pages = {381-389},
+ pdf = {https://hal.archives-ouvertes.fr/hal-00534535/file/valette.pdf},
+ publisher = {Wiley},
+ title = {Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening},
+ url = {https://hal.archives-ouvertes.fr/hal-00534535},
+ volume = {23},
+ year = {2004}
+}
+
+@inproceedings{cgal:audette2011approach,
+  title={Approach-guided controlled resolution brain meshing for fe-based interactive neurosurgery simulation},
+  author={Audette, M and Rivi{\`e}re, D and Ewend, M and Enquobahrie, A and Valette, S},
+  booktitle={Workshop on Mesh Processing in Medical Image Analysis, in conjunction with MICCAI 2011},
+  pages={176--186},
+  year={2011}
+}
+
+@article{cgal:vcp-grtmmdvd-08,
+ author = {Valette, Sébastien and Chassery, Jean-Marc and Prost, Rémy},
+ doi = {10.1109/TVCG.2007.70430},
+ hal_id = {hal-00537025},
+ hal_version = {v1},
+ journal = {IEEE Transactions on Visualization and Computer Graphics},
+ number = {2},
+ pages = {369--381},
+ pdf = {https://hal.archives-ouvertes.fr/hal-00537025/file/VCP08TVCG.pdf},
+ publisher = {Institute of Electrical and Electronics Engineers},
+ title = {Generic remeshing of 3D triangular meshes with metric-dependent discrete Voronoi Diagrams},
+ url = {https://hal.archives-ouvertes.fr/hal-00537025},
+ volume = {14},
+ year = {2008}
+}
 
 @techreport{cgal:vla-lod-15,
   title={LOD Generation for Urban Scenes},
@@ -3111,14 +3228,12 @@ pages = "207--221"
   bibsource = {dblp computer science bibliography, https://dblp.org/}
 }
 
-@inproceedings {dunyach2013curvRemesh,
-  booktitle = {Eurographics 2013 - Short Papers},
-  title = {{Adaptive Remeshing for Real-Time Mesh Deformation}},
-  author = {Dunyach, Marion and Vanderhaeghe, David and Barthe, Loïc and Botsch, Mario},
-  year = {2013},
-  publisher = {The Eurographics Association},
-  ISSN = {1017-4656},
-  DOI = {10.2312/conf/EG2013/short/029-032}
+@inproceedings{dunyach2013curvRemesh,
+  title={Adaptive remeshing for real-time mesh deformation},
+  author={Dunyach, Marion and Vanderhaeghe, David and Barthe, Loïc and Botsch, Mario},
+  booktitle={Eurographics 2013},
+  year={2013},
+  organization={The Eurographics Association}
 }
 
 @book{botsch2010PMP,
diff --git a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
index 66f51ad476c..e5b0e33e964 100644
--- a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
@@ -222,7 +222,7 @@ ALIASES                = "cgal=%CGAL" \
 # language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
 # Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
 # VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
-# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# FortranFree, unknown formatted Fortran: Fortran. In the latter case the parser
 # tries to guess whether the code is fixed or free formatted code, this is the
 # default for Fortran type files). For instance to make doxygen treat .inc files
 # as Fortran files (default is PHP), and .f files as C (default is Fortran),
diff --git a/Documentation/doc/resources/1.10.0/hacks.js b/Documentation/doc/resources/1.10.0/hacks.js
index a290b02cee8..614428d1bdf 100644
--- a/Documentation/doc/resources/1.10.0/hacks.js
+++ b/Documentation/doc/resources/1.10.0/hacks.js
@@ -98,14 +98,14 @@ $(document).ready(function() {
     if(window.location.href.includes("doc.cgal.org")){ 
       var url='https://doc.cgal.org/latest/Manual/menu_version.js';
       var script = document.createElement("script"); // Make a script DOM node
-      script.src = url; // Set it's src to the provided URL
+      script.src = url; // Set its src to the provided URL
       document.head.appendChild(script);
     }
     else
     {
       var url='../Manual/menu_version.js';
       var script = document.createElement("script"); // Make a script DOM node
-      script.src = url; // Set it's src to the provided URL
+      script.src = url; // Set its src to the provided URL
       document.head.appendChild(script);
     }
 })();
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 4bd2e290d30..0b0cdcd4cd0 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -213,7 +213,7 @@ ALIASES                = "cgal=%CGAL" \
 # language is one of the parsers supported by doxygen: IDL, Java, Javascript,
 # C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
 # FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
-# Fortran. In the later case the parser tries to guess whether the code is fixed
+# Fortran. In the latter case the parser tries to guess whether the code is fixed
 # or free formatted code, this is the default for Fortran type files), VHDL. For
 # instance to make doxygen treat .inc files as Fortran files (default is PHP),
 # and .f files as C (default is Fortran), use: inc=Fortran f=C.
diff --git a/Documentation/doc/resources/1.8.13/hacks.js b/Documentation/doc/resources/1.8.13/hacks.js
index 26d9ae47435..9c96bcec48b 100644
--- a/Documentation/doc/resources/1.8.13/hacks.js
+++ b/Documentation/doc/resources/1.8.13/hacks.js
@@ -98,14 +98,14 @@ $(document).ready(function() {
     if(window.location.href.includes("doc.cgal.org")){ 
       var url='https://doc.cgal.org/latest/Manual/menu_version.js';
       var script = document.createElement("script"); // Make a script DOM node
-      script.src = url; // Set it's src to the provided URL
+      script.src = url; // Set its src to the provided URL
       document.head.appendChild(script);
     }
     else
     {
       var url='../Manual/menu_version.js';
       var script = document.createElement("script"); // Make a script DOM node
-      script.src = url; // Set it's src to the provided URL
+      script.src = url; // Set its src to the provided URL
       document.head.appendChild(script);
     }
 })();
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 72b23dbc0fa..a0eb9568a19 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -222,7 +222,7 @@ ALIASES                = "cgal=%CGAL" \
 # language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
 # Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
 # VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
-# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# FortranFree, unknown formatted Fortran: Fortran. In the latter case the parser
 # tries to guess whether the code is fixed or free formatted code, this is the
 # default for Fortran type files). For instance to make doxygen treat .inc files
 # as Fortran files (default is PHP), and .f files as C (default is Fortran),
diff --git a/Documentation/doc/resources/1.9.6/hacks.js b/Documentation/doc/resources/1.9.6/hacks.js
index 26d9ae47435..9c96bcec48b 100644
--- a/Documentation/doc/resources/1.9.6/hacks.js
+++ b/Documentation/doc/resources/1.9.6/hacks.js
@@ -98,14 +98,14 @@ $(document).ready(function() {
     if(window.location.href.includes("doc.cgal.org")){ 
       var url='https://doc.cgal.org/latest/Manual/menu_version.js';
       var script = document.createElement("script"); // Make a script DOM node
-      script.src = url; // Set it's src to the provided URL
+      script.src = url; // Set its src to the provided URL
       document.head.appendChild(script);
     }
     else
     {
       var url='../Manual/menu_version.js';
       var script = document.createElement("script"); // Make a script DOM node
-      script.src = url; // Set it's src to the provided URL
+      script.src = url; // Set its src to the provided URL
       document.head.appendChild(script);
     }
 })();
diff --git a/Documentation/doc/scripts/generate_how_to_cite.py b/Documentation/doc/scripts/generate_how_to_cite.py
index 409678ebb91..b88d25dbd74 100644
--- a/Documentation/doc/scripts/generate_how_to_cite.py
+++ b/Documentation/doc/scripts/generate_how_to_cite.py
@@ -230,6 +230,7 @@ def protect_accentuated_letters(authors):
         .replace("ş", r"{\c{s}}")
         .replace("%", "")
         .replace("đ", r"{\-d}")
+        .replace("ï", r"{\"i}")
     )
     try:
         res.encode("ascii")
diff --git a/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp b/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp
index c69d93421e7..dd6e63907c0 100644
--- a/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp
+++ b/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp
@@ -16,9 +16,9 @@ struct My_orientation_2
   typedef typename K::RT            RT;
   typedef typename K::Point_2       Point_2;
 
-  typedef typename K::Orientation   result_type;
+  typedef typename K::Orientation   Orientation;
 
-  result_type
+  Orientation
   operator()(const Point_2 &p, const Point_2 &q, const Point_2 &r) const
   {
     RT prx = p.x() - r.x();
diff --git a/Filtered_kernel/include/CGAL/EPIC_predicate_if_convertible.h b/Filtered_kernel/include/CGAL/EPIC_predicate_if_convertible.h
new file mode 100644
index 00000000000..615774f275e
--- /dev/null
+++ b/Filtered_kernel/include/CGAL/EPIC_predicate_if_convertible.h
@@ -0,0 +1,69 @@
+// Copyright (c) 2017  GeometryFactory
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Andreas Fabri, Laurent Rineau
+
+#ifndef CGAL_EPIC_PREDICATE_IF_CONVERTIBLE_H
+#define CGAL_EPIC_PREDICATE_IF_CONVERTIBLE_H
+
+#include <CGAL/Epic_converter.h>
+
+namespace CGAL {
+
+template <typename AK, typename FP, typename EpicP>
+class EPIC_predicate_if_convertible {
+public:
+  FP fp;
+  EpicP epicp;
+
+  template <typename... Args>
+  auto
+  operator()(const Args&... args) const
+    -> decltype(fp(args...))
+  {
+    const CGAL::Epic_converter<AK> converter;
+
+    std::tuple<decltype(converter(approx(args)))...> converted_args;
+
+    // When C++20 is available, check the blame and clean this all up with lambdas
+    bool success = convert_all_impl(std::index_sequence_for<Args...>{}, converter, converted_args, args...);
+    if(!success) // failed to convert all arguments, call the base predicate
+      return fp(args...);
+
+    return call_epicp_impl(std::index_sequence_for<Args...>{}, converted_args);
+  }
+
+private:
+  template <std::size_t... I, typename Converter, typename Tuple, typename... Args>
+  bool convert_all_impl(std::index_sequence<I...>,
+                        const Converter& converter,
+                        Tuple& converted_args,
+                        const Args&... args) const
+  {
+    auto convert = [&](auto index, const auto& arg) {
+      auto converted = converter(approx(arg));
+      if(converted.second)
+        std::get<index>(converted_args) = converted;
+      return converted.second;
+    };
+
+    return (... && convert(std::integral_constant<std::size_t, I>{}, args));
+  }
+
+  template <std::size_t... I, typename Tuple>
+  auto call_epicp_impl(std::index_sequence<I...>, const Tuple& converted_args) const
+    -> decltype(epicp(std::get<I>(converted_args).first...))
+  {
+    return epicp(std::get<I>(converted_args).first...);
+  }
+};
+
+} // CGAL
+
+#endif // CGAL_EPIC_PREDICATE_IF_CONVERTIBLE_H
diff --git a/Filtered_kernel/include/CGAL/Filtered_construction.h b/Filtered_kernel/include/CGAL/Filtered_construction.h
index 51910605980..7bdfc916a34 100644
--- a/Filtered_kernel/include/CGAL/Filtered_construction.h
+++ b/Filtered_kernel/include/CGAL/Filtered_construction.h
@@ -16,6 +16,8 @@
 #include <CGAL/basic.h>
 #include <CGAL/Interval_arithmetic.h>
 
+#include <type_traits>
+
 namespace CGAL {
 
 template <class AC, class EC, class FC, class C2E, class C2F,
@@ -30,81 +32,70 @@ private:
   E2C From_Exact;
   F2C From_Filtered;
 
-  typedef typename AC::result_type  AC_result_type;
-  typedef typename FC::result_type  FC_result_type;
-  typedef typename EC::result_type  EC_result_type;
-
-public:
-  typedef AC_result_type           result_type;
-
 public:
   Filtered_construction() {}
 
   template <class A1>
-  result_type
-  operator()(const A1 &a1) const
+  auto operator()(const A1 &a1) const
+    -> typename std::invoke_result<AC, A1>::type
   {
     {
-      // Protection is outside the try block as VC8 has the CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
       Protect_FPU_rounding<Protection> P1;
       try
       {
-        return From_Filtered( Filter_construction(To_Filtered(a1)) );
+        return From_Filtered(Filter_construction(To_Filtered(a1)));
       }
       catch (Uncertain_conversion_exception&)
       {}
     }
     Protect_FPU_rounding<!Protection> P(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    return From_Exact( Exact_construction(To_Exact(a1)) );
+    return From_Exact(Exact_construction(To_Exact(a1)));
   }
+
   template <class A1, class A2>
-  result_type
-  operator()(const A1 &a1, const A2 &a2) const
+  auto operator()(const A1 &a1, const A2 &a2) const
+    -> typename std::invoke_result<AC, A1, A2>::type
   {
     {
       Protect_FPU_rounding<Protection> P1;
       try
       {
-        return From_Filtered( Filter_construction(To_Filtered(a1),
-                                                  To_Filtered(a2)) );
+        return From_Filtered(Filter_construction(To_Filtered(a1),
+                                                 To_Filtered(a2)));
       }
       catch (Uncertain_conversion_exception&)
       {}
     }
     Protect_FPU_rounding<!Protection> P(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    return From_Exact( Exact_construction(To_Exact(a1),
-                                          To_Exact(a2)) );
+    return From_Exact(Exact_construction(To_Exact(a1),
+                                         To_Exact(a2)));
   }
 
   template <class A1, class A2, class A3>
-  result_type
-  operator()(const A1 &a1, const A2 &a2, const A3 &a3) const
+  auto operator()(const A1 &a1, const A2 &a2, const A3 &a3) const
+    -> typename std::invoke_result<AC, A1, A2, A3>::type
   {
     {
       Protect_FPU_rounding<Protection> P1;
       try
       {
-        return From_Filtered( Filter_construction(To_Filtered(a1),
-                                                  To_Filtered(a2),
-                                                  To_Filtered(a3)) );
+        return From_Filtered(Filter_construction(To_Filtered(a1),
+                                                 To_Filtered(a2),
+                                                 To_Filtered(a3)));
       }
       catch (Uncertain_conversion_exception&)
       {}
     }
     Protect_FPU_rounding<!Protection> P(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    return From_Exact( Exact_construction(To_Exact(a1),
-                                          To_Exact(a2),
-                                          To_Exact(a3)) );
+    return From_Exact(Exact_construction(To_Exact(a1),
+                                         To_Exact(a2),
+                                         To_Exact(a3)));
   }
-
 };
 
-
-
-} //namespace CGAL
-
+} // namespace CGAL
 
 #endif // CGAL_FILTERED_CONSTRUCTION_H
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Angle_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Angle_3.h
index e9428fd2917..f54f028d47d 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Angle_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Angle_3.h
@@ -34,13 +34,12 @@ template < typename K_base >
 class Angle_3
   : public K_base::Angle_3
 {
-  typedef typename K_base::Point_3   Point_3;
+  typedef typename K_base::Angle   Angle;
+  typedef typename K_base::Point_3 Point_3;
+
   typedef typename K_base::Angle_3 Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
   Sign sign_with_error(const double x, const double error) const {
@@ -49,7 +48,7 @@ public:
     else return ZERO;
   }
 
-  result_type operator()(const Point_3 &p, const Point_3& q, const Point_3& r) const
+  Angle operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
   {
     CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Angle_3", tmp);
 
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Collinear_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Collinear_3.h
index 9279f60c3d2..4dd64070b5c 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Collinear_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Collinear_3.h
@@ -24,16 +24,16 @@ template < typename K_base >
 class Collinear_3
   : public K_base::Collinear_3
 {
+  typedef typename K_base::Boolean          Boolean;
   typedef typename K_base::Point_3          Point_3;
   typedef typename K_base::Vector_3         Vector_3;
   typedef typename K_base::Sphere_3         Sphere_3;
   typedef typename K_base::Tetrahedron_3    Tetrahedron_3;
-  typedef typename K_base::Collinear_3    Base;
+
+  typedef typename K_base::Collinear_3      Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-  result_type
+  Boolean
   operator()(const Point_3 &p, const Point_3 &q, const Point_3 &r) const
   {
     CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Collinear_3", tmp);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_distance_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_distance_3.h
index f3880b3f0e2..4589aa9aa81 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_distance_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_distance_3.h
@@ -30,17 +30,16 @@ template < typename K_base >
 class Compare_distance_3
   : public K_base::Compare_distance_3
 {
-  typedef typename K_base::Point_3   Point_3;
-  typedef typename K_base::Vector_3  Vector_3;
+  typedef typename K_base::Comparison_result    Comparison_result;
+  typedef typename K_base::Point_3              Point_3;
+  typedef typename K_base::Vector_3             Vector_3;
+
   typedef typename K_base::Compare_distance_3   Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type operator()(const Point_3 &p, const Point_3& q, const Point_3& r) const
+  Comparison_result operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_squared_radius_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_squared_radius_3.h
index 8e0683677aa..aecee9d3618 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_squared_radius_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_squared_radius_3.h
@@ -24,15 +24,16 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
   class Compare_squared_radius_3
     : public K_base::Compare_squared_radius_3
   {
-    typedef typename K_base::Point_3 Point_3;
-    typedef typename K_base::FT FT;
-    typedef typename K_base::Compare_squared_radius_3 Base;
-  public:
-    typedef typename Base::result_type result_type;
+    typedef typename K_base::Comparison_result        Comparison_result;
+    typedef typename K_base::Point_3                  Point_3;
+    typedef typename K_base::FT                       FT;
 
+    typedef typename K_base::Compare_squared_radius_3 Base;
+
+  public:
     using Base::operator();
 
-    result_type operator() (
+    Comparison_result operator() (
         const Point_3& p,
         const Point_3& q,
         const Point_3& r,
@@ -185,7 +186,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         return Base::operator()(p,q,r,s,w);
     }
 
-    result_type operator() (
+    Comparison_result operator() (
         const Point_3& p,
         const Point_3& q,
         const Point_3& s,
@@ -312,14 +313,14 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                 }
             }
         }
-        return static_cast<result_type>(int_tmp_result);
+        return static_cast<Comparison_result>(int_tmp_result);
       }
       else
         return Base::operator()(p,q,s,w);
     }
 
 
-    result_type operator() (
+    Comparison_result operator() (
         const Point_3& p,
         const Point_3& q,
         const FT& w
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_weighted_squared_radius_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_weighted_squared_radius_3.h
index 41b9f1b9e77..3a8afc92ba3 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_weighted_squared_radius_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_weighted_squared_radius_3.h
@@ -27,15 +27,16 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
   class Compare_weighted_squared_radius_3:
     public K_base::Compare_weighted_squared_radius_3
   {
-    typedef typename K_base::Weighted_point_3 Weighted_point_3;
-    typedef typename K_base::FT FT;
-    typedef typename K_base::Compare_weighted_squared_radius_3 Base;
-  public:
-    typedef typename Base::result_type result_type;
+    typedef typename K_base::Comparison_result                 Comparison_result;
+    typedef typename K_base::Weighted_point_3                  Weighted_point_3;
+    typedef typename K_base::FT                                FT;
 
+    typedef typename K_base::Compare_weighted_squared_radius_3 Base;
+
+  public:
     using Base::operator();
 
-    result_type operator() (
+    Comparison_result operator() (
         const Weighted_point_3& p,
         const Weighted_point_3& q,
         const Weighted_point_3& r,
@@ -175,7 +176,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         return Base::operator()(p,q,r,s,w);
     }
 
-    result_type
+    Comparison_result
     operator() (
       const Weighted_point_3& p,
       const Weighted_point_3& q ,
@@ -292,7 +293,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         return Base::operator()(p,q,r,w);
     }
 
-    result_type
+    Comparison_result
     operator() (
       const Weighted_point_3& p,
       const Weighted_point_3& q,
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_x_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_x_2.h
index 29c6d291051..3478f524983 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_x_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_x_2.h
@@ -31,17 +31,16 @@ template < typename K_base >
 class Compare_x_2
   : public K_base::Compare_x_2
 {
-  typedef typename K_base::Point_2   Point_2;
-  typedef typename K_base::Line_2    Line_2;
-  typedef typename K_base::Compare_x_2   Base;
+  typedef typename K_base::Comparison_result  Comparison_result;
+  typedef typename K_base::Point_2            Point_2;
+  typedef typename K_base::Line_2             Line_2;
+
+  typedef typename K_base::Compare_x_2        Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type operator()(const Point_2 &p, const Point_2& q) const
+  Comparison_result operator()(const Point_2& p, const Point_2& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_2.h
index da9b97215a8..043a174ce99 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_2.h
@@ -31,17 +31,16 @@ template < typename K_base >
 class Compare_y_2
   : public K_base::Compare_y_2
 {
-  typedef typename K_base::Point_2   Point_2;
-  typedef typename K_base::Line_2    Line_2;
-  typedef typename K_base::Compare_y_2   Base;
+  typedef typename K_base::Comparison_result  Comparison_result;
+  typedef typename K_base::Point_2            Point_2;
+  typedef typename K_base::Line_2             Line_2;
+
+  typedef typename K_base::Compare_y_2        Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type operator()(const Point_2 &p, const Point_2& q) const
+  Comparison_result operator()(const Point_2 &p, const Point_2& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_at_x_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_at_x_2.h
index 5de1af9d7b2..8c9204f718f 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_at_x_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Compare_y_at_x_2.h
@@ -22,13 +22,14 @@ template < typename K_base, typename Kernel >
 class Compare_y_at_x_2
   : public K_base::Compare_y_at_x_2
 {
-  typedef typename K_base::Point_2          Point_2;
-  typedef typename K_base::Segment_2        Segment_2;
-  typedef typename K_base::FT               FT;
-  typedef typename K_base::Compare_y_at_x_2 Base;
+  typedef typename K_base::Comparison_result  Comparison_result;
+  typedef typename K_base::Point_2            Point_2;
+  typedef typename K_base::Segment_2          Segment_2;
+  typedef typename K_base::FT                 FT;
+
+  typedef typename K_base::Compare_y_at_x_2   Base;
 
 public:
-
   using Base::operator();
 
   Comparison_result
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_3.h
index fedf31fcba9..38c4384769c 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_3.h
@@ -25,17 +25,14 @@ template < typename K_base, typename SFK >
 class Coplanar_3
   : public K_base::Coplanar_3
 {
-  typedef typename K_base::Point_3 Point_3;
+  typedef typename K_base::Boolean    Boolean;
+  typedef typename K_base::Point_3    Point_3;
+
   typedef typename K_base::Coplanar_3 Base;
   typedef typename SFK::Orientation_3 Orientation_3;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
-
-
-  result_type
+  Boolean
   operator()(const Point_3& p,const Point_3& q, const Point_3& r, const Point_3& s) const
   {
     return Orientation_3()(p,q,r,s) == COPLANAR;
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_orientation_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_orientation_3.h
index 212dddec6cf..255f95c1ab7 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_orientation_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_orientation_3.h
@@ -40,12 +40,12 @@ template < typename Kernel >
 class Coplanar_orientation_3
   : public Kernel::Coplanar_orientation_3
 {
+  typedef typename Kernel::Orientation              Orientation;
   typedef typename Kernel::Point_3                  Point_3;
+
   typedef typename Kernel::Coplanar_orientation_3   Base;
 
 public:
-  typedef Orientation result_type;
-
   Orientation operator()(const Point_3 &p, const Point_3 &q, const Point_3 &r) const
   {
       return opti_coplanar_orientationC3(
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_side_of_bounded_circle_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_side_of_bounded_circle_3.h
index 48c96ec886c..ae9c2e36229 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_side_of_bounded_circle_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Coplanar_side_of_bounded_circle_3.h
@@ -44,8 +44,6 @@ class Side_of_bounded_circle_3
   }
 
 public:
-  typedef Bounded_side result_type;
-
   Bounded_side operator()(const Point &p, const Point &q,
                           const Point &r, const Point &t) const
   {
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_2.h
index a5533c253fa..088648b9d72 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_2.h
@@ -28,16 +28,13 @@ template < typename K_base, typename SFK >
 class Do_intersect_2
   : public K_base::Do_intersect_2
 {
+  typedef typename K_base::Boolean   Boolean;
   typedef typename K_base::Point_2   Point_2;
   typedef typename K_base::Segment_2 Segment_2;
+
   typedef typename K_base::Do_intersect_2 Base;
 
-  typedef K_base TA1;
-  typedef SFK TA2;
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
   // The internal::do_intersect(..) function
@@ -47,19 +44,19 @@ public:
   // the  statically filtered kernel we avoid
   // that doubles are put into Interval_nt
   // to get taken out again with fit_in_double
-  result_type
+  Boolean
   operator()(const Segment_2 &s, const Segment_2& t) const
   {
     return Intersections::internal::do_intersect(s,t, SFK());
   }
 
-  result_type
+  Boolean
   operator()(const Point_2 &p, const Segment_2& t) const
   {
     return Intersections::internal::do_intersect(p,t, SFK());
   }
 
-  result_type
+  Boolean
   operator()(const Segment_2& t, const Point_2 &p) const
   {
     return Intersections::internal::do_intersect(p,t, SFK());
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_3.h
index 2b0ef97d7fc..1d19ce5a469 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Do_intersect_3.h
@@ -39,18 +39,17 @@ template < typename K_base, typename SFK >
 class Do_intersect_3
   : public K_base::Do_intersect_3
 {
+  typedef typename K_base::Boolean   Boolean;
   typedef typename K_base::Point_3   Point_3;
   typedef typename K_base::Ray_3     Ray_3;
   typedef typename K_base::Segment_3 Segment_3;
   typedef typename K_base::Triangle_3 Triangle_3;
   typedef typename K_base::Tetrahedron_3 Tetrahedron_3;
   typedef typename K_base::Sphere_3 Sphere_3;
+
   typedef typename K_base::Do_intersect_3 Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
   Sign sign_with_error(const double x, const double error) const {
@@ -67,32 +66,31 @@ public:
   // the  statically filtered kernel we avoid
   // that doubles are put into Interval_nt
   // to get taken out again with fit_in_double
-  result_type
+  Boolean
   operator()(const Segment_3 &s, const Triangle_3& t) const
   {
     return Intersections::internal::do_intersect(t,s, SFK());
   }
 
-  result_type
+  Boolean
   operator()(const Triangle_3& t, const Segment_3 &s) const
   {
     return Intersections::internal::do_intersect(t,s, SFK());
   }
 
-  result_type
+  Boolean
   operator()(const Triangle_3 &t0, const Triangle_3& t1) const
   {
     return Intersections::internal::do_intersect(t0,t1, SFK());
   }
 
-
-  result_type
+  Boolean
   operator()(const Bbox_3& b, const Segment_3 &s) const
   {
     return this->operator()(s, b);
   }
 
-  result_type
+  Boolean
   operator()(const Segment_3 &s, const Bbox_3& b) const
   {
     CGAL_BRANCH_PROFILER_3(std::string("semi-static failures/attempts/calls to   : ") +
@@ -111,7 +109,7 @@ public:
     {
       CGAL_BRANCH_PROFILER_BRANCH_1(tmp);
 
-      const Uncertain<result_type> ub =
+      const Uncertain<Boolean> ub =
         Intersections::internal::do_intersect_bbox_segment_aux
         <double,
          true, // bounded at t=0
@@ -127,13 +125,13 @@ public:
     return Base::operator()(s,b);
   }
 
-  result_type
+  Boolean
   operator()(const Bbox_3& b, const Tetrahedron_3 &t) const
   {
     return this->operator()(t, b);
   }
 
-  result_type
+  Boolean
   operator()(const Tetrahedron_3 &t, const Bbox_3& b) const
   {
     CGAL_BRANCH_PROFILER_3(std::string("semi-static failures/attempts/calls to   : ") +
@@ -168,13 +166,13 @@ public:
     return Base::operator()(t,b);
   }
 
-  result_type
+  Boolean
   operator()(const Bbox_3& b, const Ray_3 &r) const
   {
     return this->operator()(r, b);
   }
 
-  result_type
+  Boolean
   operator()(const Ray_3 &r, const Bbox_3& b) const
   {
     CGAL_BRANCH_PROFILER_3(std::string("semi-static failures/attempts/calls to   : ") +
@@ -193,7 +191,7 @@ public:
     {
       CGAL_BRANCH_PROFILER_BRANCH_1(tmp);
 
-      const Uncertain<result_type> ub =
+      const Uncertain<Boolean> ub =
         Intersections::internal::do_intersect_bbox_segment_aux
         <double,
          true, // bounded at t=0
@@ -209,8 +207,7 @@ public:
     return Base::operator()(r,b);
   }
 
-
-  result_type
+  Boolean
   operator()(const Bbox_3& b, const Triangle_3 &t) const
   {
     return this->operator()(t, b);
@@ -487,7 +484,7 @@ public:
     return false;
   };
 
-  result_type
+  Boolean
   operator()(const Triangle_3 &t, const Bbox_3& b) const
   {
     CGAL_BRANCH_PROFILER_3(std::string("semi-static failures/attempts/calls to   : ") +
@@ -616,14 +613,14 @@ public:
     return Base::operator()(t,b);
   }
 
-  result_type
+  Boolean
   operator()(const Bbox_3& b, const Sphere_3 &s) const
   {
     return this->operator()(s, b);
   }
 
   // The parameter overestimate is used to avoid a filter failure in AABB_tree::closest_point()
-  result_type
+  Boolean
   operator()(const Sphere_3 &s, const Bbox_3& b, bool overestimate = false) const
   {
     CGAL_BRANCH_PROFILER_3(std::string("semi-static failures/attempts/calls to   : ") +
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_2.h
index 60b2360a939..79832da2535 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_2.h
@@ -31,18 +31,16 @@ template < typename K_base >
 class Equal_2
   : public K_base::Equal_2
 {
+  typedef typename K_base::Boolean   Boolean;
   typedef typename K_base::FT        FT;
   typedef typename K_base::Point_2   Point_2;
   typedef typename K_base::Vector_2  Vector_2;
   typedef typename K_base::Equal_2   Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type operator()(const Point_2 &p, const Point_2& q) const
+  Boolean operator()(const Point_2& p, const Point_2& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
@@ -61,8 +59,7 @@ public:
     return Base::operator()(p, q);
   }
 
-
-  result_type operator()(const Vector_2 &p, const Vector_2& q) const
+  Boolean operator()(const Vector_2& p, const Vector_2& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_3.h
index 10c44051ae2..5d04c892d7f 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Equal_3.h
@@ -31,17 +31,16 @@ template < typename K_base >
 class Equal_3
   : public K_base::Equal_3
 {
+  typedef typename K_base::Boolean   Boolean;
   typedef typename K_base::Point_3   Point_3;
   typedef typename K_base::Vector_3  Vector_3;
+
   typedef typename K_base::Equal_3   Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type operator()(const Point_3 &p, const Point_3& q) const
+  Boolean operator()(const Point_3& p, const Point_3& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
@@ -62,7 +61,7 @@ public:
   }
 
 
-  result_type operator()(const Vector_3 &p, const Vector_3& q) const
+  Boolean operator()(const Vector_3& p, const Vector_3& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
@@ -83,7 +82,7 @@ public:
   }
 
 
-  result_type operator()(const Vector_3 &p, const Null_vector &q) const
+  Boolean operator()(const Vector_3& p, const Null_vector& q) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
                          std::string(CGAL_PRETTY_FUNCTION), tmp);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Is_degenerate_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Is_degenerate_3.h
index a4af481f7e1..6b43f629126 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Is_degenerate_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Is_degenerate_3.h
@@ -25,6 +25,7 @@ template < typename K_base, typename SFK >
 class Is_degenerate_3
   : public K_base::Is_degenerate_3
 {
+  typedef typename K_base::Boolean   Boolean;
   typedef typename K_base::Ray_3     Ray_3;
   typedef typename K_base::Segment_3 Segment_3;
   typedef typename K_base::Plane_3 Plane_3;
@@ -35,25 +36,21 @@ class Is_degenerate_3
   typedef typename SFK::Equal_3 Equal_3;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type
+  Boolean
   operator()(const Segment_3& s) const
   {
     return Equal_3()(Construct_source_3()(s), Construct_target_3()(s));
   }
 
-
-  result_type
+  Boolean
   operator()(const Ray_3& r) const
   {
     return Equal_3()(Construct_source_3()(r), Construct_second_point_3()(r));
   }
 
-  result_type
+  Boolean
   operator()(const Plane_3& p) const
   {
     CGAL_BRANCH_PROFILER(std::string("semi-static attempts/calls to   : ") +
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_2.h
index cbb4494e7cd..11cd803458a 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_2.h
@@ -25,16 +25,14 @@ template < typename K_base >
 class Orientation_2
   : public K_base::Orientation_2
 {
+  typedef typename K_base::Orientation      Orientation;
   typedef typename K_base::Point_2          Point_2;
   typedef typename K_base::Vector_2         Vector_2;
-  typedef typename K_base::Circle_2          Circle_2;
+  typedef typename K_base::Circle_2         Circle_2;
 
   typedef typename K_base::Orientation_2    Base;
 
 public:
-
-  typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
   Orientation
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_3.h
index 2fdffde6fda..f7d126dfaf0 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Orientation_3.h
@@ -27,18 +27,18 @@ template < typename K_base >
 class Orientation_3
   : public K_base::Orientation_3
 {
+  typedef typename K_base::Orientation      Orientation;
   typedef typename K_base::Point_3          Point_3;
   typedef typename K_base::Vector_3         Vector_3;
   typedef typename K_base::Sphere_3         Sphere_3;
   typedef typename K_base::Tetrahedron_3    Tetrahedron_3;
+
   typedef typename K_base::Orientation_3    Base;
 
 public:
- typedef typename Base::result_type  result_type;
-
   using Base::operator();
 
-  result_type
+  Orientation
   operator()(const Point_3 &p, const Point_3 &q,
              const Point_3 &r, const Point_3 &s) const
   {
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
index f9097923bab..e7f1c195da8 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
@@ -26,15 +26,15 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
   class Power_side_of_oriented_power_circle_2:
     public K_base::Power_side_of_oriented_power_circle_2
   {
+    typedef typename K_base::Oriented_side Oriented_side;
     typedef typename K_base::Weighted_point_2 Weighted_point_2;
     typedef typename K_base::FT FT;
     typedef typename K_base::Power_side_of_oriented_power_circle_2 Base;
-  public:
-    typedef typename Base::result_type result_type;
 
+  public:
     using Base::operator();
 
-    result_type operator() ( const Weighted_point_2 & p,
+    Oriented_side operator()(const Weighted_point_2 & p,
                              const Weighted_point_2 & q,
                              const Weighted_point_2 & r,
                              const Weighted_point_2 & t) const
@@ -64,7 +64,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
           double drx = (rx - tx);
           double dry = (ry - ty);
           double drz = (((square( drx ) + square( dry )) - rwt) + twt);
-          result_type int_tmp_result;
+          Oriented_side int_tmp_result;
           double RT_tmp_result;
           double eps;
           RT_tmp_result = CGAL::determinant( dpx, dpy, dpz, dqx, dqy, dqz, drx, dry, drz );
@@ -162,7 +162,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
     }
 
 
-    result_type operator() ( const Weighted_point_2 & p,
+    Oriented_side operator()(const Weighted_point_2 & p,
                              const Weighted_point_2 & q,
                              const Weighted_point_2 & t) const
     {
@@ -219,7 +219,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
           double upper_bound_1;
           if( (cmpx != 0) )
             {
-              result_type int_tmp_result;
+              Oriented_side int_tmp_result;
               double RT_tmp_result;
               RT_tmp_result = CGAL::determinant( dpx, dpz, dqx, dqz );
               lower_bound_1 = max2;
@@ -265,11 +265,11 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                         }
                     }
                 }
-              return static_cast<result_type>(cmpx * int_tmp_result);
+              return static_cast<Oriented_side>(cmpx * int_tmp_result);
             }
           int cmpy;
           cmpy = ((py > qy) ? 1 : ((py < qy) ? -1 : 0));
-          result_type int_tmp_result_FFWKCAA;
+          Oriented_side int_tmp_result_FFWKCAA;
           double RT_tmp_result_k60Ocge = CGAL::determinant( dpy, dpz, dqy, dqz );
           lower_bound_1 = max4;
           upper_bound_1 = max4;
@@ -314,7 +314,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                     }
                 }
             }
-          return static_cast<result_type>(cmpy * int_tmp_result_FFWKCAA);
+          return static_cast<Oriented_side>(cmpy * int_tmp_result_FFWKCAA);
 
         }
       else
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
index f4adbbe18cf..c6fabbb4927 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
@@ -26,12 +26,12 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
   class Power_side_of_oriented_power_sphere_3:
     public K_base::Power_side_of_oriented_power_sphere_3
   {
+    typedef typename K_base::Oriented_side    Oriented_side;
     typedef typename K_base::Weighted_point_3 Weighted_point_3;
     typedef typename K_base::FT FT;
     typedef typename K_base::Power_side_of_oriented_power_sphere_3 Base;
-  public:
-    typedef typename Base::result_type result_type;
 
+  public:
     using Base::operator();
 
     void
@@ -107,11 +107,11 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
     }
 
 
-    result_type operator() ( const Weighted_point_3 & p,
-                             const Weighted_point_3 & q,
-                             const Weighted_point_3 & r,
-                             const Weighted_point_3 & s,
-                             const Weighted_point_3 & t) const
+    Oriented_side operator() (const Weighted_point_3& p,
+                              const Weighted_point_3& q,
+                              const Weighted_point_3& r,
+                              const Weighted_point_3& s,
+                              const Weighted_point_3& t) const
     {
       CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Power_side_of_power_sphere_3 with 4+1 wpoints", tmp);
 
@@ -225,7 +225,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
               return Base::operator()(p,q,r,s,t);
             }
 
-            result_type int_tmp_result;
+            Oriented_side int_tmp_result;
 
             double eps = (1.67106803095990471147e-13 * (((max2 * max3) * max4) * (CGAL::max) ( max5, (max1 * max1) )));
 
@@ -253,10 +253,10 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         return Base::operator()(p,q,r,s,t);
     }
 
-    result_type operator() ( const Weighted_point_3 & p,
-                             const Weighted_point_3 & q,
-                             const Weighted_point_3 & r,
-                             const Weighted_point_3 & t) const
+    Oriented_side operator() (const Weighted_point_3& p,
+                              const Weighted_point_3& q,
+                              const Weighted_point_3& r,
+                              const Weighted_point_3& t) const
     {
 
       CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Power_side_of_oriented_power_sphere_3 with 3+1 wpoints", tmp);
@@ -408,15 +408,15 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                   }
               }
           }
-        return static_cast<result_type>(cmp * int_tmp_result_FFWKCAA);
+        return static_cast<Oriented_side>(cmp * int_tmp_result_FFWKCAA);
       }
       else
         return Base::operator()(p,q,r,t);
     }
 
-    result_type operator() ( const Weighted_point_3 & p,
-                             const Weighted_point_3 & q,
-                             const Weighted_point_3 & t) const
+    Oriented_side operator() (const Weighted_point_3& p,
+                              const Weighted_point_3& q,
+                              const Weighted_point_3& t) const
     {
 
       CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Power_side_of_oriented_power_sphere_3 with 2+1 wpoints", tmp);
@@ -506,7 +506,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                     }
                 }
             }
-            return static_cast<result_type>(cmp * int_tmp_result);
+            return static_cast<Oriented_side>(cmp * int_tmp_result);
         }
         cmp = ((py > qy) ? 1 : ((py < qy) ? -1 : 0));
         if( (cmp != 0) )
@@ -549,7 +549,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                   }
               }
           }
-          return static_cast<result_type>(cmp * int_tmp_result_FFWKCAA);
+          return static_cast<Oriented_side>(cmp * int_tmp_result_FFWKCAA);
         }
         cmp = ((pz > qz) ? 1 : ((pz < qz) ? -1 : 0));
         int int_tmp_result_3SPBwDj;
@@ -592,7 +592,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                 }
             }
         }
-        return static_cast<result_type>(cmp * int_tmp_result_3SPBwDj);
+        return static_cast<Oriented_side>(cmp * int_tmp_result_3SPBwDj);
       }
       else
         return Base::operator()(p,q,t);
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_circle_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_circle_2.h
index 3b59fed08db..0762a4948f4 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_circle_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_circle_2.h
@@ -23,11 +23,11 @@ template < typename K_base >
 class Side_of_oriented_circle_2
   : public K_base::Side_of_oriented_circle_2
 {
+  typedef typename K_base::Oriented_side                Oriented_side;
   typedef typename K_base::Point_2                      Point_2;
   typedef typename K_base::Side_of_oriented_circle_2    Base;
 
 public:
-
   Oriented_side operator()(const Point_2 &p, const Point_2 &q,
                            const Point_2 &r, const Point_2 &t) const
   {
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_sphere_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_sphere_3.h
index 41a54d33012..90b128c5eee 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_sphere_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_sphere_3.h
@@ -22,11 +22,11 @@ template < typename K_base >
 class Side_of_oriented_sphere_3
   : public K_base::Side_of_oriented_sphere_3
 {
+  typedef typename K_base::Oriented_side                Oriented_side;
   typedef typename K_base::Point_3                      Point_3;
   typedef typename K_base::Side_of_oriented_sphere_3    Base;
 
 public:
-
   Oriented_side
   operator()(const Point_3 &p, const Point_3 &q, const Point_3 &r,
              const Point_3 &s, const Point_3 &t) const
diff --git a/Filtered_kernel/include/CGAL/Filtered_predicate.h b/Filtered_kernel/include/CGAL/Filtered_predicate.h
index acfe6892a7c..99be87fecf1 100644
--- a/Filtered_kernel/include/CGAL/Filtered_predicate.h
+++ b/Filtered_kernel/include/CGAL/Filtered_predicate.h
@@ -28,7 +28,7 @@ namespace CGAL {
 
 // TODO :
 // - each predicate in the default kernel should define a tag that says if it
-//   wants to be filtered or not (=> all homogeneous predicate define this
+//   wants to be filtered or not (=> all homogeneous predicates define this
 //   tag).  We could even test-suite that automatically.  It makes a strong
 //   new requirement on the kernel though...
 //   Could be done with a traits mechanism ?
@@ -52,18 +52,13 @@ class Filtered_predicate
   EP  ep;
   AP  ap;
 
-  typedef typename AP::result_type  Ares;
-
 public:
-
+  // AP's result type must be convertible to EP's result type.
   typedef AP    Approximate_predicate;
   typedef EP    Exact_predicate;
   typedef C2E   To_exact_converter;
   typedef C2A   To_approximate_converter;
 
-  typedef typename EP::result_type  result_type;
-  // AP::result_type must be convertible to EP::result_type.
-
   Filtered_predicate()
   {}
 
@@ -85,11 +80,14 @@ public:
   {}
 
   template <typename... Args>
-  result_type
+  auto
   operator()(const Args&... args) const
   {
+    typedef typename Remove_needs_FT<CGAL::cpp20::remove_cvref_t<decltype(ep(c2e(args)...))> >::Type result_type;
 
 #ifndef CGAL_EPICK_NO_INTERVALS
+    typedef typename Remove_needs_FT<CGAL::cpp20::remove_cvref_t<decltype(ap(c2a(args)...))> >::Type Ares;
+
     CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
     // Protection is outside the try block as VC8 has the CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
     {
@@ -98,7 +96,7 @@ public:
         {
           Ares res = ap(c2a(args)...);
           if (is_certain(res))
-            return get_certain(res);
+            return result_type(get_certain(res));
         }
       catch (Uncertain_conversion_exception&) {}
     }
@@ -106,7 +104,7 @@ public:
     Protect_FPU_rounding<!Protection> p(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
 #endif // CGAL_EPICK_NO_INTERVALS
-    return ep(c2e(args)...);
+    return result_type(ep(c2e(args)...));
   }
 };
 
@@ -120,27 +118,28 @@ class Filtered_predicate_RT_FT
   EP_FT ep_ft;
   AP ap;
 
-  using Ares = typename Remove_needs_FT<typename AP::result_type>::Type;
-
-public:
-  using result_type = typename Remove_needs_FT<typename EP_FT::result_type>::Type;
-
 private:
+  // Detect if the predicate's result type has been wrapped with the `Needs_FT` class
   template <typename... Args>
   struct Call_operator_needs_FT
   {
-    using Actual_approx_res = decltype(ap(c2a(std::declval<const Args&>())...));
-    using Approx_res = std::remove_cv_t<std::remove_reference_t<Actual_approx_res> >;
-    enum { value = std::is_same<Approx_res, Needs_FT<Ares> >::value };
+    template <typename T>
+    struct is_Needs_FT : std::false_type { };
+    template <typename ...T>
+    struct is_Needs_FT<Needs_FT<T...> > : std::true_type { };
+
+    typedef CGAL::cpp20::remove_cvref_t<decltype(ap(c2a(std::declval<const Args&>())...))> Actual_approx_res;
+    enum { value = is_Needs_FT<Actual_approx_res>::value };
   };
 
+  // If there is no `Needs_FT` in the result, then we can use an RT-based exact predicate
   template <typename... Args,
             std::enable_if_t<Call_operator_needs_FT<Args...>::value>* = nullptr>
-  result_type call(const Args&... args) const { return ep_ft(c2e_ft(args)...); }
+  decltype(auto) exact_call(const Args&... args) const { return ep_ft(c2e_ft(args)...); }
 
   template <typename... Args,
             std::enable_if_t<! Call_operator_needs_FT<Args...>::value>* = nullptr>
-  result_type call(const Args&... args) const { return ep_rt(c2e_rt(args)...); }
+  decltype(auto) exact_call(const Args&... args) const { return ep_rt(c2e_rt(args)...); }
 
 public:
   // ## Important note
@@ -154,10 +153,14 @@ public:
   bool needs_FT(const Args&...) const { return Call_operator_needs_FT<Args...>::value; }
 
   template <typename... Args>
-  result_type
+  auto
   operator()(const Args&... args) const
   {
+    typedef typename Remove_needs_FT<CGAL::cpp20::remove_cvref_t<decltype(exact_call(args...))> >::Type result_type;
+
 #ifndef CGAL_EPICK_NO_INTERVALS
+    typedef typename Remove_needs_FT<CGAL::cpp20::remove_cvref_t<decltype(ap(c2a(args)...))> >::Type Ares;
+
     CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
     // Protection is outside the try block as VC8 has the CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
     {
@@ -166,7 +169,7 @@ public:
         {
           Ares res = ap(c2a(args)...);
           if (is_certain(res))
-            return get_certain(res);
+            return result_type(get_certain(res));
         }
       catch (Uncertain_conversion_exception&) {}
     }
@@ -174,7 +177,7 @@ public:
     Protect_FPU_rounding<!Protection> p(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
 #endif // CGAL_EPICK_NO_INTERVALS
-    return call(args...);
+    return result_type(exact_call(args...));
   }
 };
 
diff --git a/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h b/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h
index 991fe8247b5..d985227f21c 100644
--- a/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h
+++ b/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h
@@ -33,33 +33,27 @@ class Filtered_predicate_with_state
   O1  o1;
   mutable std::optional<EP>  oep;
   AP  ap;
-  typedef typename AP::result_type  Ares;
 
 public:
-
+  // AP::result_type must be convertible to EP::result_type.
   typedef AP    Approximate_predicate;
   typedef EP    Exact_predicate;
   typedef C2E   To_exact_converter;
   typedef C2A   To_approximate_converter;
 
-  typedef typename EP::result_type  result_type;
-  // AP::result_type must be convertible to EP::result_type.
-
   Filtered_predicate_with_state(const O1 &o1)
     : c2e(), c2a(), o1(o1), oep(), ap(c2a(o1))
   {}
 
   template <typename... Args>
-  result_type
-  operator()(const Args&... args) const;
-};
-
-template <class EP, class AP, class C2E, class C2A, class O1, bool Protection>
-  template <typename... Args>
-typename Filtered_predicate_with_state<EP,AP,C2E,C2A,O1,Protection>::result_type
-Filtered_predicate_with_state<EP,AP,C2E,C2A,O1,Protection>::
+  auto
   operator()(const Args&... args) const
-{
+  {
+    typedef typename Remove_needs_FT<CGAL::cpp20::remove_cvref_t<decltype((*oep)(c2e(args)...))> >::Type result_type;
+
+#ifndef CGAL_EPICK_NO_INTERVALS
+    typedef typename Remove_needs_FT<CGAL::cpp20::remove_cvref_t<decltype(ap(c2a(args)...))> >::Type Ares;
+
     CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
     // Protection is outside the try block as VC8 has the CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
     {
@@ -68,18 +62,22 @@ Filtered_predicate_with_state<EP,AP,C2E,C2A,O1,Protection>::
         {
           Ares res = ap(c2a(args)...);
           if (is_certain(res))
-            return get_certain(res);
+            return result_type(get_certain(res));
         }
       catch (Uncertain_conversion_exception&) {}
     }
     CGAL_BRANCH_PROFILER_BRANCH(tmp);
     Protect_FPU_rounding<!Protection> p(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
+#endif
     if(! oep){
       oep.emplace(c2e(o1));
     }
-    return (*oep)(c2e(args)...);
-}
+    return result_type((*oep)(c2e(args)...));
+  }
+};
+
+
 
 } //namespace CGAL
 
diff --git a/Filtered_kernel/include/CGAL/Kernel_profiler.h b/Filtered_kernel/include/CGAL/Kernel_profiler.h
index 20611510e94..aaaa310afce 100644
--- a/Filtered_kernel/include/CGAL/Kernel_profiler.h
+++ b/Filtered_kernel/include/CGAL/Kernel_profiler.h
@@ -25,8 +25,6 @@ template < typename P >
 struct Primitive_profiler
   : public P
 {
-    typedef typename P::result_type  result_type;
-
 // #define CGAL_KERNEL_PROFILER CGAL_PROFILER(CGAL_PRETTY_FUNCTION);
 #define CGAL_KERNEL_PROFILER \
         CGAL_PROFILER(typeid(static_cast<const P&>(*this)).name())
@@ -35,7 +33,7 @@ struct Primitive_profiler
       : P(p) {}
 
     template <class ... A>
-    result_type
+    decltype(auto)
     operator()(A&& ... a) const
     {
         CGAL_KERNEL_PROFILER;
diff --git a/Filtered_kernel/include/CGAL/Lazy.h b/Filtered_kernel/include/CGAL/Lazy.h
index 164653d522a..4fafd3f9219 100644
--- a/Filtered_kernel/include/CGAL/Lazy.h
+++ b/Filtered_kernel/include/CGAL/Lazy.h
@@ -867,217 +867,6 @@ struct Exact_converter
   { return b; }
 };
 
-//____________________________________________________________
-
-
-
-template <typename AC, typename EC, typename E2A, typename L1>
-class Lazy_rep_with_vector_1 final
-  : public Lazy_rep<std::vector<Object>, std::vector<Object>, E2A>
-  , private EC
-{
-  typedef std::vector<Object> AT;
-  typedef std::vector<Object> ET;
-  typedef Lazy_rep<AT, ET, E2A> Base;
-
-  mutable L1 l1_;
-
-  const EC& ec() const { return *this; }
-
-public:
-
-  void
-  update_exact() const
-  {
-    auto* p = new typename Base::Indirect();
-    // TODO : This looks really unfinished...
-    std::vector<Object> vec;
-    //this->et->reserve(this->at.size());
-    ec()(CGAL::exact(l1_), std::back_inserter(p->et_));
-    this->set_at(p);
-    this->set_ptr(p);
-    // Prune lazy tree
-    lazy_reset_member(l1_);
-  }
-
-  Lazy_rep_with_vector_1(const AC& ac, const EC& /*ec*/, const L1& l1)
-    : l1_(l1)
-  {
-    ac(CGAL::approx(l1), std::back_inserter(this->at_orig.at_));
-  }
-
-#ifdef CGAL_LAZY_KERNEL_DEBUG
-  void
-  print_dag(std::ostream& os, int level) const
-  {
-    this->print_at_et(os, level);
-    os << "A Lazy_rep_with_vector_1 of size " <<  this->approx().size() << std::endl;
-    if(this->is_lazy()){
-      CGAL::msg(os, level, "DAG with one child node:");
-      CGAL::print_dag(l1_, os, level+1);
-
-    }
-  }
-#endif
-};
-
-
-template <typename AC, typename EC, typename E2A, typename L1, typename L2>
-class Lazy_rep_with_vector_2 final
-  : public Lazy_rep<std::vector<Object>, std::vector<Object>, E2A>
-  , private EC
-{
-  typedef std::vector<Object> AT;
-  typedef std::vector<Object> ET;
-  typedef Lazy_rep<AT, ET, E2A> Base;
-
-  mutable L1 l1_;
-  mutable L2 l2_;
-
-  const EC& ec() const { return *this; }
-
-public:
-
-  void
-  update_exact() const
-  {
-    auto* p = new typename Base::Indirect();
-    p->et_.reserve(this->at_orig.at().size());
-    ec()(CGAL::exact(l1_), CGAL::exact(l2_), std::back_inserter(p->et_));
-    this->set_at(p);
-    this->set_ptr(p);
-    // Prune lazy tree
-    lazy_reset_member(l1_);
-    lazy_reset_member(l2_);
-  }
-
-  Lazy_rep_with_vector_2(const AC& ac, const EC& /*ec*/, const L1& l1, const L2& l2)
-    : l1_(l1), l2_(l2)
-  {
-    ac(CGAL::approx(l1), CGAL::approx(l2), std::back_inserter(this->at_orig.at_));
-  }
-
-#ifdef CGAL_LAZY_KERNEL_DEBUG
-  void
-  print_dag(std::ostream& os, int level) const
-  {
-    this->print_at_et(os, level);
-    os << "A Lazy_rep_with_vector_2 of size " <<  this->approx().size() << std::endl;
-    if(this->is_lazy()){
-      CGAL::msg(os, level, "DAG with two child nodes:");
-      CGAL::print_dag(l1_, os, level+1);
-      CGAL::print_dag(l2_, os, level+1);
-    }
-  }
-#endif
-};
-
-
-template <typename AC, typename EC, typename E2A, typename L1, typename L2, typename R1>
-class Lazy_rep_2_1 final
-  : public Lazy_rep<typename R1::AT, typename R1::ET, E2A>
-  , private EC
-{
-  typedef typename R1::AT AT;
-  typedef typename R1::ET ET;
-  typedef Lazy_rep<AT, ET, E2A> Base;
-
-  mutable L1 l1_;
-  mutable L2 l2_;
-
-  const EC& ec() const { return *this; }
-
-public:
-
-  void
-  update_exact() const
-  {
-    auto* p = new typename Base::Indirect();
-    ec()(CGAL::exact(l1_), CGAL::exact(l2_), p->et_);
-    this->set_at(p);
-    this->set_ptr(p);
-    // Prune lazy tree
-    lazy_reset_member(l1_);
-    lazy_reset_member(l2_);
-  }
-
-  Lazy_rep_2_1(const AC& ac, const EC& /*ec*/, const L1& l1, const L2& l2)
-    : Lazy_rep<AT,ET,E2A>(), l1_(l1), l2_(l2)
-  {
-    this->set_depth((std::max)(CGAL::depth(l1), CGAL::depth(l2)));
-    ac(CGAL::approx(l1), CGAL::approx(l2), this->at_orig.at_);
-  }
-
-#ifdef CGAL_LAZY_KERNEL_DEBUG
-  void
-  print_dag(std::ostream& os, int level) const
-  {
-    this->print_at_et(os, level);
-    os << "A Lazy_rep_2_1" << std::endl;
-    if(this->is_lazy()){
-      CGAL::msg(os, level, "DAG with two child nodes:");
-      CGAL::print_dag(l1_, os, level+1);
-      CGAL::print_dag(l2_, os, level+1);
-    }
-  }
-#endif
-};
-
-
-//____________________________________________________________________________________
-// The following rep class stores two non-const reference parameters of type R1 and R2
-
-template <typename AC, typename EC, typename E2A, typename L1, typename L2, typename R1, typename R2>
-class Lazy_rep_2_2 final
-  : public Lazy_rep<std::pair<typename R1::AT,typename R2::AT>, std::pair<typename R1::ET, typename R2::ET>, E2A>
-  , private EC
-{
-  typedef std::pair<typename R1::AT, typename R2::AT> AT;
-  typedef std::pair<typename R1::ET, typename R2::ET> ET;
-  typedef Lazy_rep<AT, ET, E2A> Base;
-
-  mutable L1 l1_;
-  mutable L2 l2_;
-
-  const EC& ec() const { return *this; }
-
-public:
-
-  void
-  update_exact() const
-  {
-    auto* p = new typename Base::Indirect();
-    ec()(CGAL::exact(l1_), CGAL::exact(l2_), p->et_.first, p->et_.second );
-    this->set_at(p);
-    this->set_ptr(p);
-    // Prune lazy tree
-    lazy_reset_member(l1_);
-    lazy_reset_member(l2_);
-  }
-
-  Lazy_rep_2_2(const AC& ac, const EC& /*ec*/, const L1& l1, const L2& l2)
-    : Lazy_rep<AT,ET,E2A>(), l1_(l1), l2_(l2)
-  {
-    this->set_depth((std::max)(CGAL::depth(l1), CGAL::depth(l2)));
-    ac(CGAL::approx(l1), CGAL::approx(l2), this->at_orig.at_.first, this->at_orig.at_.second);
-  }
-
-#ifdef CGAL_LAZY_KERNEL_DEBUG
-  void
-  print_dag(std::ostream& os, int level) const
-  {
-    this->print_at_et(os, level);
-    os << "A Lazy_rep_2_2"  << std::endl;
-    if(this->is_lazy()){
-      CGAL::msg(os, level, "DAG with two child nodes:");
-      CGAL::print_dag(l1_, os, level+1);
-      CGAL::print_dag(l2_, os, level+1);
-    }
-  }
-#endif
-};
-
-
 //____________________________________________________________
 // The handle class
 template <typename AT_, typename ET_, typename E2A>
@@ -1181,41 +970,8 @@ public :
   Self_rep * ptr() const { return (Self_rep*) PTR; }
 };
 
-// The magic functor for Construct_bbox_[2,3], as there is no Lazy<Bbox>
-
 template <typename LK, typename AC, typename EC>
-struct Lazy_construction_bbox
-{
-  static const bool Protection = true;
-  typedef typename LK::Approximate_kernel AK;
-  typedef typename LK::Exact_kernel EK;
-  typedef typename AC::result_type result_type;
-
-  CGAL_NO_UNIQUE_ADDRESS AC ac;
-  CGAL_NO_UNIQUE_ADDRESS EC ec;
-
-  template <typename L1>
-  decltype(auto)
-  operator()(const L1& l1) const
-  {
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      // Protection is outside the try block as VC8 has the CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-      Protect_FPU_rounding<Protection> P;
-      try {
-        return ac(CGAL::approx(l1));
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    return ec(CGAL::exact(l1));
-  }
-};
-
-
-template <typename LK, typename AC, typename EC>
-struct Lazy_construction_optional_for_polygonal_envelope
+struct Lazy_construction_optional_for_polyhedral_envelope
 {
   static const bool Protection = true;
   typedef typename LK::Approximate_kernel AK;
@@ -1301,7 +1057,7 @@ struct Lazy_construction_optional_for_polygonal_envelope
   }
 };
 
-
+// used in Newkernel_d
 template <typename LK, typename AC, typename EC>
 struct Lazy_construction_nt {
   Lazy_construction_nt(){}
@@ -1318,10 +1074,10 @@ struct Lazy_construction_nt {
 
   template<class...L>
   auto operator()(L const&...l) const ->
-  Lazy_exact_nt<std::remove_cv_t<std::remove_reference_t<decltype(ec(CGAL::exact(l)...))>>>
+  Lazy_exact_nt<CGAL::cpp20::remove_cvref_t<decltype(ec(CGAL::exact(l)...))>>
   {
-    typedef std::remove_cv_t<std::remove_reference_t<decltype(ec(CGAL::exact(l)...))>> ET;
-    typedef std::remove_cv_t<std::remove_reference_t<decltype(ac(CGAL::approx(l)...))>> AT;
+    typedef CGAL::cpp20::remove_cvref_t<decltype(ec(CGAL::exact(l)...))> ET;
+    typedef CGAL::cpp20::remove_cvref_t<decltype(ac(CGAL::approx(l)...))> AT;
     CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
     {
       Protect_FPU_rounding<Protection> P;
@@ -1378,51 +1134,7 @@ CGAL_Kernel_obj(Point_3)
   return Object();
 }
 
-
-// This functor selects the i'th element in a vector of Object's
-// and casts it to what is in the Object
-
-template <typename T2>
-struct Ith {
-  typedef T2 result_type;
-
-  // We keep a Sign member object
-  // for future utilization, in case
-  // we have pairs of 2 T2 objects e.g.
-  // for a numeric_point vector returned
-  // from a construction of a possible
-  // lazy algebraic kernel
-
-  int i;
-  Sign sgn;
-
-  Ith(int i_)
-    : i(i_)
-  {sgn=NEGATIVE;}
-
-  Ith(int i_, bool b_)
-    : i(i_)
-  { sgn= (b_) ? POSITIVE : ZERO;}
-
-  const T2&
-  operator()(const std::vector<Object>& v) const
-  {
-    if(sgn==NEGATIVE)
-    return *object_cast<T2>(&v[i]);
-
-    typedef std::pair<T2,unsigned int >         Pair_type_1;
-    typedef std::pair<T2,std::pair<bool,bool> > Pair_type_2;
-
-    if(const Pair_type_1 *p1 = object_cast<Pair_type_1>(&v[i]))
-            return p1->first;
-    else if(const Pair_type_2 *p2 = object_cast<Pair_type_2>(&v[i]))
-        return p2->first;
-
-    CGAL_error_msg( " Unexpected encapsulated type ");
-  }
-};
-
-// This functor selects the i'th element in a vector of T2's
+// This functor selects the i-th element in a vector of T2's
 template <typename T2>
 struct Ith_for_intersection {
   typedef T2 result_type;
@@ -1440,33 +1152,6 @@ struct Ith_for_intersection {
   }
 };
 
-// This functor selects the i'th element in a vector of T2's
-template <typename T2>
-struct Ith_for_intersection_with_variant {
-  typedef T2 result_type;
-  int i;
-
-  Ith_for_intersection_with_variant(int i_)
-    : i(i_)
-  {}
-
-  template< typename ... U >
-  const T2&
-  operator()(const std::optional< std::variant< U ... > >& o) const
-  {
-    const std::vector<T2>* ptr = (std::get_if<std::vector<T2> >(&(*o)));
-    return (*ptr)[i];
-  }
-
-  template< typename ... U >
-  const T2&
-  operator()(const std::variant< U ... >& o) const
-  {
-    const std::vector<T2>* ptr = (std::get_if<std::vector<T2> >(&o));
-    return (*ptr)[i];
-  }
-};
-
 template <typename LK, typename AC, typename EC>
 struct Lazy_cartesian_const_iterator_2
 {
@@ -1524,181 +1209,6 @@ public:
 
 };
 
-
-// This is the magic functor for functors that write their result in a  reference argument
-// In a first version we assume that the references are of type Lazy<Something>,
-// and that the result type is void
-
-template <typename AC, typename EC, typename E2A>
-struct Lazy_functor_2_1
-{
-  static const bool Protection = true;
-  typedef void result_type;
-
-  CGAL_NO_UNIQUE_ADDRESS AC ac;
-  CGAL_NO_UNIQUE_ADDRESS EC ec;
-
-public:
-
-  template <typename L1, typename L2, typename R1>
-  void
-  operator()(const L1& l1, const L2& l2, R1& r1) const
-  {
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        // we suppose that R1 is a Lazy<Something>
-        r1 = R1(new Lazy_rep_2_1<AC, EC, E2A, L1, L2, R1>(ac, ec, l1, l2));
-        return;
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    typename R1::ET et;
-    ec(CGAL::exact(l1), CGAL::exact(l2), et);
-    r1 = R1(new Lazy_rep_0<typename R1::AT,typename R1::ET,E2A>(et));
-  }
-};
-
-
-template <typename T>
-struct First
-{
-   typedef typename T::first_type result_type;
-
-   const typename T::first_type&
-   operator()(const T& p) const
-   {
-     return p.first;
-   }
- };
-
-template <typename T>
-struct Second
-{
-  typedef typename T::second_type result_type;
-
-  const typename T::second_type&
-  operator()(const T& p) const
-  {
-    return p.second;
-  }
-};
-
-// This is the magic functor for functors that write their result in a reference argument
-// In a first version we assume that the references are of type Lazy<Something>,
-// and that the result type is void
-
-//template <typename LK, typename AK, typename EK, typename AC, typename EC, typename EFT, typename E2A>
-template <typename LK, typename AC, typename EC>
-struct Lazy_functor_2_2
-{
-  static const bool Protection = true;
-
-  typedef void result_type;
-  typedef typename LK::Approximate_kernel AK;
-  typedef typename LK::Exact_kernel EK;
-  typedef typename LK::E2A E2A;
-
-  CGAL_NO_UNIQUE_ADDRESS AC ac;
-  CGAL_NO_UNIQUE_ADDRESS EC ec;
-
-public:
-
-  template <typename L1, typename L2, typename R1, typename R2>
-  void
-  operator()(const L1& l1, const L2& l2, R1& r1, R2& r2) const
-  {
-    typedef Lazy<typename R1::AT, typename R1::ET, E2A> Handle_1;
-    typedef Lazy<typename R2::AT, typename R2::ET, E2A> Handle_2;
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        typedef Lazy<std::pair<typename R1::AT, typename R2::AT>, std::pair<typename R1::ET, typename R2::ET>, E2A> Lazy_pair;
-        Lazy_pair lv(new Lazy_rep_2_2<AC, EC, E2A, L1, L2, R1, R2>(ac, ec, l1, l2));
-        // lv->approx() is a std::pair<R1::AT, R2::AT>;
-        r1 = R1(Handle_1(new Lazy_rep_n<void, void, First<std::pair<typename R1::AT, typename R2::AT> >, First<std::pair<typename R1::ET, typename R2::ET> >, E2A, false, Lazy_pair>(First<std::pair<typename R1::AT, typename R2::AT> >(), First<std::pair<typename R1::ET, typename R2::ET> >(), lv)));
-        r2 = R2(Handle_2(new Lazy_rep_n<void, void, Second<std::pair<typename R1::AT, typename R2::AT> >, Second<std::pair<typename R1::ET, typename R2::ET> >, E2A, false, Lazy_pair>(Second<std::pair<typename R1::AT, typename R2::AT> >(), Second<std::pair<typename R1::ET, typename R2::ET> >(), lv)));
-        return;
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    typename R1::ET et1, et2;
-    ec(CGAL::exact(l1), CGAL::exact(l2), et1, et2);
-    r1 = R1(Handle_1(new Lazy_rep_0<typename R1::AT,typename R1::ET,E2A>(et1)));
-    r2 = R2(Handle_2(new Lazy_rep_0<typename R2::AT,typename R2::ET,E2A>(et2)));
-  }
-};
-
-
-// This is the magic functor for functors that write their result as Objects into an output iterator
-
-template <typename LK, typename AC, typename EC>
-struct Lazy_intersect_with_iterators
-{
-  static const bool Protection = true;
-  typedef typename LK::Approximate_kernel AK;
-  typedef typename LK::Exact_kernel EK;
-  typedef typename LK::E2A E2A;
-  typedef void result_type;
-  typedef Lazy<Object, Object, E2A> Lazy_object;
-  typedef Lazy<std::vector<Object>, std::vector<Object>, E2A> Lazy_vector;
-
-  CGAL_NO_UNIQUE_ADDRESS AC ac;
-  CGAL_NO_UNIQUE_ADDRESS EC ec;
-
-public:
-
-  // In the example we intersect two Lazy<Segment>s
-  // and write into a back_inserter(list<Object([Lazy<Point>,Lazy<Segment>]) >)
-  template <typename L1, typename L2, typename OutputIterator>
-  OutputIterator
-  operator()(const L1& l1, const L2& l2, OutputIterator it) const
-  {
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        Lazy_vector lv(new Lazy_rep_with_vector_2<AC, EC, E2A, L1, L2>(ac, ec, l1, l2));
-        // lv.approx() is a std::vector<Object([AK::Point_2,AK::Segment_2])>
-        // that is, when we get here we have constructed all approximate results
-        for (unsigned int i = 0; i < lv.approx().size(); i++) {
-  // FIXME : I'm not sure how this work...
-  #define CGAL_Kernel_obj(X) if (object_cast<typename AK::X>(& (lv.approx()[i]))) { \
-            *it++ = make_object(typename LK::X(new Lazy_rep_n<typename AK::X, typename EK::X, Ith<typename AK::X>, \
-                                                                        Ith<typename EK::X>, E2A, false, Lazy_vector> \
-                                                   (Ith<typename AK::X>(i), Ith<typename EK::X>(i), lv))); \
-            continue; \
-          }
-
-  #include <CGAL/Kernel/interface_macros.h>
-
-          std::cerr << "we need  more casts" << std::endl;
-        }
-        return it;
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    // TODO: Instead of using a vector, write an iterator adapter
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    std::vector<Object> exact_objects;
-    ec(CGAL::exact(l1), CGAL::exact(l2), std::back_inserter(exact_objects));
-    for (std::vector<Object>::const_iterator oit = exact_objects.begin();
-         oit != exact_objects.end();
-         ++oit){
-      *it++ = make_lazy<LK>(*oit);
-    }
-    return it;
-  }
-};
-
-
 template <typename T>
 struct Object_cast
 {
@@ -1714,9 +1224,6 @@ struct Object_cast
 // The following functor returns an Object with a Lazy<Something> inside
 // As the nested kernels return Objects of AK::Something and EK::Something
 // we have to unwrap them from the Object, and wrap them in a Lazy<Something>
-//
-// TODO: write operators for other than two arguments. For the current kernel we only need two for Intersect_2
-
 template <typename LK, typename AC, typename EC>
 struct Lazy_construction_object
 {
@@ -1735,16 +1242,15 @@ struct Lazy_construction_object
   CGAL_NO_UNIQUE_ADDRESS EC ec;
 
 public:
-
-  template <typename L1>
+  template <class... L>
   decltype(auto)
-  operator()(const L1& l1) const
+  operator()(const L&... l) const
   {
     CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
     {
       Protect_FPU_rounding<Protection> P;
       try {
-        Lazy_object lo(new Lazy_rep_n<result_type, result_type, AC, EC, E2A, false, L1>(ac, ec, l1));
+        Lazy_object lo(new Lazy_rep_n<result_type, result_type, AC, EC, E2A, false, L...>(ac, ec, l...));
 
         if(lo.approx().is_empty())
           return Object();
@@ -1758,116 +1264,42 @@ public:
 
 #include <CGAL/Kernel/interface_macros.h>
 
-        std::cerr << "object_cast inside Lazy_construction_rep::operator() failed. It needs more else if's (#1)" << std::endl;
-        std::cerr << "dynamic type of the Object : " << lo.approx().type().name() << std::endl;
-
-        return Object();
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    ET eto = ec(CGAL::exact(l1));
-    return make_lazy<LK>(eto);
-  }
-
-  template <typename L1, typename L2>
-  decltype(auto)
-  operator()(const L1& l1, const L2& l2) const
-  {
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        Lazy_object lo(new Lazy_rep_n<result_type, result_type, AC, EC, E2A, false, L1, L2>(ac, ec, l1, l2));
-
-        if(lo.approx().is_empty())
-          return Object();
-
-  #define CGAL_Kernel_obj(X) \
-        if (object_cast<typename AK::X>(& (lo.approx()))) { \
-          typedef Lazy_rep_n<typename AK::X, typename EK::X, Object_cast<typename AK::X>, Object_cast<typename EK::X>, E2A, false, Lazy_object> Lcr; \
-          Lcr * lcr = new Lcr(Object_cast<typename AK::X>(), Object_cast<typename EK::X>(), lo); \
-          return make_object(typename LK::X(lcr)); \
-        }
-
-  #include <CGAL/Kernel/interface_macros.h>
-
       // We now check vector<X>
-
-  #define CGAL_Kernel_obj(X) \
-        {  \
-          const std::vector<typename AK::X>* v_ptr;\
+#define CGAL_Kernel_obj(X) \
+        { \
+          const std::vector<typename AK::X>* v_ptr; \
           if ( (v_ptr = object_cast<std::vector<typename AK::X> >(& (lo.approx()))) ) { \
-            std::vector<typename LK::X> V;\
-            V.resize(v_ptr->size());                           \
-            for (unsigned int i = 0; i < v_ptr->size(); i++) {               \
+            std::vector<typename LK::X> V; \
+            V.resize(v_ptr->size()); \
+            for (unsigned int i = 0; i < v_ptr->size(); i++) { \
               V[i] = typename LK::X(new Lazy_rep_n<typename AK::X, typename EK::X, Ith_for_intersection<typename AK::X>, \
                                                    Ith_for_intersection<typename EK::X>, E2A, false, Lazy_object> \
                                     (Ith_for_intersection<typename AK::X>(i), Ith_for_intersection<typename EK::X>(i), lo)); \
-            }                                                           \
-            return make_object(V);                                      \
+            } \
+            return make_object(V); \
           }\
         }
 
-  CGAL_Kernel_obj(Point_2)
-  CGAL_Kernel_obj(Point_3)
-  #undef CGAL_Kernel_obj
+CGAL_Kernel_obj(Point_2)
+CGAL_Kernel_obj(Point_3)
+#undef CGAL_Kernel_obj
 
         std::cerr << "object_cast inside Lazy_construction_rep::operator() failed. It needs more else if's (#1)" << std::endl;
         std::cerr << "dynamic type of the Object : " << lo.approx().type().name() << std::endl;
 
-      } catch (Uncertain_conversion_exception&) {}
-      return Object();
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    ET eto = ec(CGAL::exact(l1), CGAL::exact(l2));
-    return make_lazy<LK>(eto);
-  }
-
-  template <typename L1, typename L2, typename L3>
-  decltype(auto)
-  operator()(const L1& l1, const L2& l2, const L3& l3) const
-  {
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        Lazy_object lo(new Lazy_rep_n<result_type, result_type, AC, EC, E2A, false, L1, L2, L3>(ac, ec, l1, l2, l3));
-
-        if(lo.approx().is_empty())
-          return Object();
-
-  #define CGAL_Kernel_obj(X) \
-        if (object_cast<typename AK::X>(& (lo.approx()))) { \
-          typedef Lazy_rep_n<typename AK::X, typename EK::X, Object_cast<typename AK::X>, Object_cast<typename EK::X>, E2A, false, Lazy_object> Lcr; \
-          Lcr * lcr = new Lcr(Object_cast<typename AK::X>(), Object_cast<typename EK::X>(), lo); \
-          return make_object(typename LK::X(lcr)); \
-        }
-
-  #include <CGAL/Kernel/interface_macros.h>
-
-        std::cerr << "object_cast inside Lazy_construction_rep::operator() failed. It needs more else if's (#1)" << std::endl;
-        std::cerr << "dynamic type of the Object : " << lo.approx().type().name() << std::endl;
         return Object();
       } catch (Uncertain_conversion_exception&) {}
     }
     CGAL_BRANCH_PROFILER_BRANCH(tmp);
     Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    ET eto = ec(CGAL::exact(l1), CGAL::exact(l2), CGAL::exact(l3));
+    ET eto = ec(CGAL::exact(l)...);
     return make_lazy<LK>(eto);
   }
 };
 
-
-
 //____________________________________________________________
 // The magic functor that has Lazy<Something> as result type.
-// Two versions are distinguished: one that needs to fiddle
-// with decltype and another that can forward the result types.
 
 namespace internal {
 BOOST_MPL_HAS_XXX_TRAIT_DEF(result_type)
@@ -1969,195 +1401,24 @@ struct Fill_lazy_variant_visitor_0 {
 
 } // internal
 
-template <typename LK, typename AC, typename EC>
-struct Lazy_construction_variant {
-  static const bool Protection = true;
-
-  typedef typename LK::Approximate_kernel AK;
-  typedef typename LK::Exact_kernel EK;
-  typedef typename LK::E2A E2A;
-
-
-  template<typename>
-  struct result {
-    // this does not default, if you want to make a lazy lazy-kernel,
-    // you are on your own
-  };
-
-  template <typename F, class... T>
-  struct result<F(T...)>
-  {
-    typedef typename Type_mapper<decltype(std::declval<AC>()(std::declval<typename Type_mapper<T,LK,AK>::type>()...)),AK,LK>::type type;
-  };
-
-  template <typename L1, typename L2>
-  decltype(auto)
-  operator()(const L1& l1, const L2& l2) const {
-
-    typedef typename result<Lazy_construction_variant(L1, L2)>::type result_type;
-
-    // typedef decltype(std::declval<AC>()(std::declval<typename Type_mapper<L1, LK, AK>::type>(),
-    //                                     std::declval<typename Type_mapper<L2, LK, AK>::type>())) AT;
-    // typedef decltype(std::declval<EC>()(std::declval<typename Type_mapper<L1, LK, EK>::type>(),
-    //                                     std::declval<typename Type_mapper<L2, LK, EK>::type>())) ET;
-
-    typedef decltype(std::declval<AC const&>()(CGAL::approx(l1), CGAL::approx(l2))) AT;
-    typedef decltype(std::declval<EC const&>()( CGAL::exact(l1),  CGAL::exact(l2))) ET;
-
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-
-      try {
-        Lazy<AT, ET, E2A> lazy(new Lazy_rep_n<AT, ET, AC, EC, E2A, false, L1, L2>(AC(), EC(), l1, l2));
-
-        // the approximate result requires the trait with types from the AK
-        AT approx_v = lazy.approx();
-        // the result we build
-        result_type res;
-
-        if(!approx_v) {
-          // empty
-          return res;
-        }
-
-        // the static visitor fills the result_type with the correct unwrapped type
-        internal::Fill_lazy_variant_visitor_2< result_type, AK, LK, EK, Lazy<AT, ET, E2A> > visitor(res, lazy);
-        std::visit(visitor, *approx_v);
-
-        return res;
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    ET exact_v = EC()(CGAL::exact(l1), CGAL::exact(l2));
-    result_type res;
-
-    if(!exact_v) {
-      return res;
-    }
-
-    internal::Fill_lazy_variant_visitor_0<result_type, AK, LK, EK> visitor(res);
-    std::visit(visitor, *exact_v);
-    return res;
-  }
-
-  template <typename L1, typename L2, typename L3>
-  decltype(auto)
-  operator()(const L1& l1, const L2& l2, const L3& l3) const {
-    typedef typename result<Lazy_construction_variant(L1, L2, L3)>::type result_type;
-
-    // typedef decltype(std::declval<AC>()(std::declval<typename Type_mapper<L1, LK, AK>::type>(),
-    //                                     std::declval<typename Type_mapper<L2, LK, AK>::type>(),
-    //                                     std::declval<typename Type_mapper<L3, LK, AK>::type>())) AT;
-    // typedef decltype(std::declval<EC>()(std::declval<typename Type_mapper<L1, LK, EK>::type>(),
-    //                                     std::declval<typename Type_mapper<L2, LK, EK>::type>(),
-    //                                     std::declval<typename Type_mapper<L3, LK, EK>::type>())) ET;
-
-    typedef decltype(std::declval<AC const&>()(CGAL::approx(l1), CGAL::approx(l2), CGAL::approx(l3))) AT;
-    typedef decltype(std::declval<EC const&>()( CGAL::exact(l1),  CGAL::exact(l2),  CGAL::exact(l3))) ET;
-
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-
-      try {
-        Lazy<AT, ET, E2A> lazy(new Lazy_rep_n<AT, ET, AC, EC, E2A, false, L1, L2, L3>(AC(), EC(), l1, l2, l3));
-
-        // the approximate result requires the trait with types from the AK
-        AT approx_v = lazy.approx();
-        // the result we build
-        result_type res;
-
-        if(!approx_v) {
-          // empty
-          return res;
-        }
-
-        // the static visitor fills the result_type with the correct unwrapped type
-        internal::Fill_lazy_variant_visitor_2< result_type, AK, LK, EK, Lazy<AT, ET, E2A> > visitor(res, lazy);
-        std::visit(visitor, *approx_v);
-
-        return res;
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    ET exact_v = EC()(CGAL::exact(l1), CGAL::exact(l2), CGAL::exact(l3));
-    result_type res;
-
-    if(!exact_v) {
-      return res;
-    }
-
-    internal::Fill_lazy_variant_visitor_0< result_type, AK, LK, EK> visitor(res);
-    std::visit(visitor, *exact_v);
-    return res;
-  }
+template<class AK, class AC>
+struct Disable_lazy_pruning
+{
+  static const bool value = false;
+};
+template<class AK>
+struct Disable_lazy_pruning<AK, typename AK::Construct_weighted_point_2>
+{
+  static const bool value = true;
+};
+template<class AK>
+struct Disable_lazy_pruning<AK, typename AK::Construct_weighted_point_3>
+{
+  static const bool value = true;
 };
 
-template<typename LK, typename AC, typename EC, typename E2A = Default,
-         bool has_result_type = internal::has_result_type<AC>::value && internal::has_result_type<EC>::value >
-struct Lazy_construction;
-
-template<class AK, class AC> struct Disable_lazy_pruning { static const bool value = false; };
-template<class AK> struct Disable_lazy_pruning<AK, typename AK::Construct_weighted_point_2> { static const bool value = true; };
-template<class AK> struct Disable_lazy_pruning<AK, typename AK::Construct_weighted_point_3> { static const bool value = true; };
-
-// we have a result type, low effort
-template<typename LK, typename AC, typename EC, typename E2A_>
-struct Lazy_construction<LK, AC, EC, E2A_, true> {
-  static const bool Protection = true;
-
-  typedef typename LK::Approximate_kernel AK;
-  typedef typename LK::Exact_kernel EK;
-  typedef std::remove_cv_t<
-    std::remove_reference_t < typename AC::result_type > > AT;
-  typedef std::remove_cv_t<
-    std::remove_reference_t < typename EC::result_type > > ET;
-
-  typedef typename Default::Get<E2A_, typename LK::E2A>::type E2A;
-
-  typedef typename Type_mapper<AT, AK, LK>::type result_type;
-
-  static const bool noprune = Disable_lazy_pruning<AK, AC>::value;
-
-  CGAL_NO_UNIQUE_ADDRESS AC ac;
-  CGAL_NO_UNIQUE_ADDRESS EC ec;
-
-  template <class... L>
-  decltype(auto)
-  operator()(const L&... l) const {
-    typedef Lazy < AT, ET, E2A > Handle;
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
-    {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        return result_type(Handle(new Lazy_rep_n< AT, ET, AC, EC, E2A, noprune, L...>(ac, ec, l...)));
-      } catch (Uncertain_conversion_exception&) {}
-    }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    return result_type(Handle(new Lazy_rep_0< AT, ET, E2A >(ec(CGAL::exact(l)...))));
-  }
-
-
-  // nullary
-  decltype(auto)
-  operator()() const
-  {
-    typedef Lazy<AT, ET, E2A> Handle;
-    return result_type( Handle() );
-  }
-
-};
-
-
-template <typename LK, typename AC, typename EC, typename E2A_>
-struct Lazy_construction<LK, AC, EC, E2A_, false>
+template <typename LK, typename AC, typename EC, typename E2A_ = Default>
+struct Lazy_construction
 {
   static const bool Protection = true;
 
@@ -2165,49 +1426,188 @@ struct Lazy_construction<LK, AC, EC, E2A_, false>
   typedef typename LK::Exact_kernel EK;
   typedef typename Default::Get<E2A_, typename LK::E2A>::type E2A;
 
-  template<typename>
-  struct result {
-    // this does not default, if you want to make a lazy lazy-kernel,
-    // you are on your own
-  };
-
-  static const bool noprune = Disable_lazy_pruning<AK, AC>::value;
-
   CGAL_NO_UNIQUE_ADDRESS AC ac;
   CGAL_NO_UNIQUE_ADDRESS EC ec;
 
-  template <typename F, class... T>
-  struct result<F(T...)>
-  {
-    typedef typename Type_mapper<decltype(std::declval<AC>()(std::declval<typename Type_mapper<T,LK,AK>::type>()...)),AK,LK>::type type;
-  };
+  // to detect the return type of Intersection_[23]'s functors
+  template <typename T>
+  struct is_optional_variant : std::false_type { };
+
+  template <typename ...Args>
+  struct is_optional_variant<std::optional<std::variant<Args...> > > : std::true_type { };
 
   template <class... L>
   decltype(auto)
-  operator()(const L&... l) const {
-    typedef typename Type_mapper<decltype(std::declval<EC>()(std::declval<typename Type_mapper<L, LK, EK>::type>()...)),EK,EK>::type ET;
-    typedef typename Type_mapper<decltype(std::declval<AC>()(std::declval<typename Type_mapper<L, LK, AK>::type>()...)),AK,AK>::type AT;
-    typedef Lazy<AT, ET, E2A> Handle;
-    typedef typename result<Lazy_construction(L...)>::type result_type;
-    CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
+  operator()(const L&... l) const
+  {
+    typedef typename Type_mapper<std::invoke_result_t<AC, typename Type_mapper<L, LK, AK>::type...>, AK, AK>::type AT;
+
+    // ----------------------- FT -----------------------
+    if constexpr (std::is_same_v<AT, typename AK::FT>)
     {
-      Protect_FPU_rounding<Protection> P;
-      try {
-        return result_type(Handle(new Lazy_rep_n<AT, ET, AC, EC, E2A, noprune, L...> (ac, ec, l...)));
-      } catch (Uncertain_conversion_exception&) {}
+      typedef typename Type_mapper<std::invoke_result_t<EC,typename Type_mapper<L, LK, EK>::type...>,EK,EK>::type ET;
+
+      typedef Lazy_exact_nt<CGAL::cpp20::remove_cvref_t<decltype(ec(CGAL::exact(l)...))>> result_type;
+
+      CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
+      {
+        Protect_FPU_rounding<Protection> P;
+        try {
+          return result_type(new Lazy_rep_n<AT, ET, AC, EC, To_interval<ET>, false, L... >(ac, ec, l...));
+        } catch (Uncertain_conversion_exception&) {}
+      }
+      CGAL_BRANCH_PROFILER_BRANCH(tmp);
+      Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
+      CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
+      return result_type(new Lazy_rep_0<AT,ET,To_interval<ET> >(ec( CGAL::exact(l)... )));
+    }
+    // ----------------------- Bounding boxes -----------------------
+    else if constexpr (std::disjunction_v<std::is_same<AT, CGAL::Bbox_2>,
+                                          std::is_same<AT, CGAL::Bbox_3> >)
+    {
+      CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
+      {
+        // Protection is outside the try block as VC8 has the CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
+        Protect_FPU_rounding<Protection> P;
+        try {
+          return ac(CGAL::approx(l...));
+        } catch (Uncertain_conversion_exception&) {}
+      }
+      CGAL_BRANCH_PROFILER_BRANCH(tmp);
+      Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
+      CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
+      return ec(CGAL::exact(l...));
+    }
+    // ----------------------- CGAL::Object -----------------------
+    else if constexpr (std::is_same_v<AT, CGAL::Object>)
+    {
+      typedef Lazy<Object, Object, E2A> Lazy_object;
+
+      CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
+      {
+        Protect_FPU_rounding<Protection> P;
+        try {
+          Lazy_object lo(new Lazy_rep_n<CGAL::Object, CGAL::Object, AC, EC, E2A, false, L...>(ac, ec, l...));
+
+          if(lo.approx().is_empty())
+            return Object();
+
+#         define CGAL_Kernel_obj(X) \
+          if (object_cast<typename AK::X>(& (lo.approx()))) { \
+            typedef Lazy_rep_n< typename AK::X, typename EK::X, Object_cast<typename AK::X>, Object_cast<typename EK::X>, E2A, false, Lazy_object> Lcr; \
+            Lcr * lcr = new Lcr(Object_cast<typename AK::X>(), Object_cast<typename EK::X>(), lo); \
+            return make_object(typename LK::X(lcr)); \
+          }
+
+#         include <CGAL/Kernel/interface_macros.h>
+
+          // We now check vector<X>
+#         define CGAL_Kernel_obj(X) \
+          { \
+            const std::vector<typename AK::X>* v_ptr; \
+            if ( (v_ptr = object_cast<std::vector<typename AK::X> >(& (lo.approx()))) ) { \
+              std::vector<typename LK::X> V; \
+              V.resize(v_ptr->size()); \
+              for (unsigned int i = 0; i < v_ptr->size(); i++) { \
+                V[i] = typename LK::X(new Lazy_rep_n<typename AK::X, typename EK::X, Ith_for_intersection<typename AK::X>, \
+                                                    Ith_for_intersection<typename EK::X>, E2A, false, Lazy_object> \
+                                      (Ith_for_intersection<typename AK::X>(i), Ith_for_intersection<typename EK::X>(i), lo)); \
+              } \
+              return make_object(V); \
+            }\
+          }
+
+          CGAL_Kernel_obj(Point_2)
+          CGAL_Kernel_obj(Point_3)
+#         undef CGAL_Kernel_obj
+
+          std::cerr << "object_cast inside Lazy_construction_rep::operator() failed. It needs more else if's (#1)" << std::endl;
+          std::cerr << "dynamic type of the Object : " << lo.approx().type().name() << std::endl;
+
+          return Object();
+        } catch (Uncertain_conversion_exception&) {}
+      }
+      CGAL_BRANCH_PROFILER_BRANCH(tmp);
+      Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
+      CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
+      CGAL::Object eto = ec(CGAL::exact(l)...);
+      return make_lazy<LK>(eto);
+    }
+    // std::optional<std::variant< > > (Intersection_23 result types)
+    else if constexpr (is_optional_variant<AT>::value)
+    {
+      typedef typename Type_mapper<std::invoke_result_t<EC, typename Type_mapper<L, LK, EK>::type...>,EK,EK>::type ET;
+
+      typedef typename Type_mapper<std::invoke_result_t<AC, typename Type_mapper<L, LK, AK>::type...>, AK, LK>::type result_type;
+
+      CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
+      {
+        Protect_FPU_rounding<Protection> P;
+
+        try {
+          Lazy<AT, ET, E2A> lazy(new Lazy_rep_n<AT, ET, AC, EC, E2A, false, L...>(AC(), EC(), l...));
+
+          // the approximate result requires the trait with types from the AK
+          AT approx_v = lazy.approx();
+          // the result we build
+          result_type res;
+
+          if(!approx_v) {
+            // empty
+            return res;
+          }
+
+          // the static visitor fills the result_type with the correct unwrapped type
+          internal::Fill_lazy_variant_visitor_2< result_type, AK, LK, EK, Lazy<AT, ET, E2A> > visitor(res, lazy);
+          std::visit(visitor, *approx_v);
+
+          return res;
+        } catch (Uncertain_conversion_exception&) {}
+      }
+      CGAL_BRANCH_PROFILER_BRANCH(tmp);
+      Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
+      CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
+      ET exact_v = EC()(CGAL::exact(l)...);
+      result_type res;
+
+      if(!exact_v) {
+        return res;
+      }
+
+      internal::Fill_lazy_variant_visitor_0<result_type, AK, LK, EK> visitor(res);
+      std::visit(visitor, *exact_v);
+      return res;
+    }
+    // ----------------------- GENERIC -----------------------
+    else
+    {
+      typedef typename Type_mapper<std::invoke_result_t<EC,typename Type_mapper<L, LK, EK>::type...>,EK,EK>::type ET;
+
+      typedef Lazy<AT, ET, E2A> Handle;
+      typedef typename Type_mapper<std::invoke_result_t<AC, typename Type_mapper<L, LK, AK>::type...>, AK, LK>::type result_type;
+
+      static const bool noprune = Disable_lazy_pruning<AK, AC>::value;
+
+      CGAL_BRANCH_PROFILER(std::string(" failures/calls to   : ") + std::string(CGAL_PRETTY_FUNCTION), tmp);
+      {
+        Protect_FPU_rounding<Protection> P;
+        try {
+          return result_type(Handle(new Lazy_rep_n<AT, ET, AC, EC, E2A, noprune, L...>(ac, ec, l...)));
+        } catch (Uncertain_conversion_exception&) {}
+      }
+      CGAL_BRANCH_PROFILER_BRANCH(tmp);
+      Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
+      CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
+      return result_type(Handle(new Lazy_rep_0<AT, ET, E2A> (ec(CGAL::exact(l)...))));
     }
-    CGAL_BRANCH_PROFILER_BRANCH(tmp);
-    Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
-    CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    return result_type(Handle(new Lazy_rep_0<AT, ET, E2A> (ec(CGAL::exact(l)...))));
   }
 
   // nullary
   decltype(auto)
   operator()() const
   {
-    typedef decltype(std::declval<AC>()()) AT;
-    typedef decltype(std::declval<EC>()()) ET;
+    typedef std::invoke_result_t<AC> AT;
+    typedef std::invoke_result_t<EC> ET;
     typedef Lazy<AT, ET, E2A> Handle;
     typedef typename Type_mapper<AT, AK, LK>::type result_type;
 
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index a6b2ac165ba..819ed0fa8ee 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/basic.h>
 //#include <CGAL/Filtered_predicate.h>
-#include <CGAL/Static_filtered_predicate.h>
+#include <CGAL/EPIC_predicate_if_convertible.h>
 #include <CGAL/Filtered_kernel.h>
 #include <CGAL/Cartesian_converter.h>
 #include <CGAL/Simple_cartesian.h>
@@ -37,62 +37,14 @@
 
 namespace CGAL {
 
-namespace internal {
-
-// SFINAE way to detect result_type typedefs.
-template<typename T>
-class Has_result_type_helper
-{
-  typedef char one;
-  typedef struct { char arr[2]; } two;
-
-  template<typename _Up>
-  struct Wrapper {};
-
-  template<typename U>
-  static one test(Wrapper<typename U::result_type>*);
-
-  template<typename U>
-  static two test(...);
-
-public:
-  static const bool value = sizeof(test<T>(0)) == 1;
-};
-
-template<typename T>
-struct Has_result_type
-  : std::integral_constant< bool,
-                              Has_result_type_helper< std::remove_cv_t<T>>::value>
-{};
-
-template <typename T>
-struct Get_result_type {
-  typedef typename T::result_type type;
-};
-
-template <typename T>
-struct Lazy_result_type
-  : boost::mpl::eval_if< Has_result_type<T>,
-                         Get_result_type<T>,
-                         boost::mpl::identity<void> >
-{};
-
-class Enum_holder {
-protected:
-  enum { NONE, NT, VARIANT, OBJECT, BBOX, OPTIONAL_ };
-};
-
-} // internal
-
 // Exact_kernel = exact kernel that will be made lazy
 // Kernel = lazy kernel
 
-// the Generic base simply applies the generic magic functor stupidly.
-// then the real base fixes up a few special cases.
+// `Lazy_kernel_generic_base` applies the generic magic functor stupidly.
+// `Lazy_kernel_base` fixes up a few special cases.
 template < typename EK_, typename AK_, typename E2A_, typename Kernel_ >
-class Lazy_kernel_generic_base : protected internal::Enum_holder
+class Lazy_kernel_generic_base
   // : public Filtered_kernel_base<EK_>
-    // TODO : Static_filters_base too ?  Check performance
 {
 public:
 
@@ -127,9 +79,18 @@ public:
   typedef typename Exact_kernel::Rep_tag                          Rep_tag;
 
   enum { Has_filtered_predicates = true };
-  enum { Has_static_filters = false };
   typedef Boolean_tag<Has_filtered_predicates> Has_filtered_predicates_tag;
 
+#ifdef CGAL_NO_STATIC_FILTERS_FOR_LAZY_KERNEL
+  enum { Has_static_filters = false };
+#else
+  // @fixme, this should be 'true' but it's broken because EPIC_predicate_if_convertible
+  // assumes the static filtered predicate and the (non-static) filtered predicate
+  // have the same signature, which is not always the case, for example in
+  //   Do_intersect_3(Sphere_3, Bbox_3, *bool*)
+  enum { Has_static_filters = false };
+#endif
+
   // Types
   typedef CGAL::Lazy_exact_nt<typename Exact_kernel::FT>  FT;
   typedef FT RT;
@@ -168,115 +129,26 @@ public:
   typedef CGAL::Aff_transformationC2<Kernel>              Aff_transformation_2;
   typedef CGAL::Aff_transformationC3<Kernel>              Aff_transformation_3;
 
-private:
-  // We use a combination of partial and logic to extract the right
-  // construction. Constructions without a result_type always have to
-  // be done through specializations.
-  //
-  // The case distinction goes as follows:
-  // result_type == FT                              => NT
-  // result_type == Object                          => Object
-  // result_type == std::optional                 => OPTIONAL_    Only for Intersect_point_3_for_polyhedral_envelope which returns a handle for a singleton
-  // result_type == Bbox_2 || result_type == Bbox_3 => BBOX
-  // default                                        => NONE
-  // no result_type                                 => NONE
-  //
-  //
-  // we require a Dummy because we cannot have complete
-  // specializations inside a non-namespace scope.
-  // The default implementation does some default handling,
-  // the special cases are filtered by partial specializations.
-  template <typename Construction, typename Dummy = std::nullopt_t>
-  struct Lazy_wrapper_traits :
-    boost::mpl::eval_if< internal::Has_result_type<Construction>,
-                         boost::mpl::eval_if< std::is_same< std::remove_cv_t<
-                                                            std::remove_reference_t<
-                                                              typename internal::Lazy_result_type<Construction>::type
-                                                                  > >,
-                                                            typename Approximate_kernel::FT>,
-                                              boost::mpl::int_<NT>,
-                                              boost::mpl::eval_if< std::is_same< typename internal::Lazy_result_type<Construction>::type,
-                                                                                   CGAL::Object >,
-                                                                   boost::mpl::int_<OBJECT>,
-                                                                   boost::mpl::eval_if< std::bool_constant<
-                                                                                          std::is_same_v< typename internal::Lazy_result_type<Construction>::type, CGAL::Bbox_2 > ||
-                                                                                          std::is_same_v< typename internal::Lazy_result_type<Construction>::type, CGAL::Bbox_3 > >,
-                                                                                        boost::mpl::int_<BBOX>,
-                                                                                        boost::mpl::int_<NONE> > > >,
-                         boost::mpl::int_<NONE> >::type {};
-
-#define CGAL_WRAPPER_TRAIT(NAME, WRAPPER)                               \
-  template<typename Dummy>                                              \
-  struct Lazy_wrapper_traits<typename Approximate_kernel::NAME, Dummy>  \
-    : boost::mpl::int_<WRAPPER> {};
-
-  CGAL_WRAPPER_TRAIT(Intersect_2, VARIANT)
-  CGAL_WRAPPER_TRAIT(Intersect_3, VARIANT)
-  CGAL_WRAPPER_TRAIT(Intersect_point_3_for_polyhedral_envelope, OPTIONAL_)
-  CGAL_WRAPPER_TRAIT(Compute_squared_radius_2, NT)
-  CGAL_WRAPPER_TRAIT(Compute_x_3, NT)
-  CGAL_WRAPPER_TRAIT(Compute_y_3, NT)
-  CGAL_WRAPPER_TRAIT(Compute_z_3, NT)
-
-#undef CGAL_WRAPPER_TRAIT
-
-  template <typename Construction, int Type = Lazy_wrapper_traits<Construction>::value>
-  struct Select_wrapper_impl;
-
-  template <typename Construction>
-  struct Select_wrapper_impl<Construction, NONE> {
-    template<typename Kernel, typename AKC, typename EKC>
-    struct apply { typedef Lazy_construction<Kernel, AKC, EKC> type; };
-  };
-
-  template <typename Construction>
-  struct Select_wrapper_impl<Construction, NT> {
-    template<typename Kernel, typename AKC, typename EKC>
-    struct apply { typedef Lazy_construction_nt<Kernel, AKC, EKC> type; };
-  };
-
-  template <typename Construction>
-  struct Select_wrapper_impl<Construction, VARIANT> {
-    template<typename Kernel, typename AKC, typename EKC>
-    struct apply { typedef Lazy_construction_variant<Kernel, AKC, EKC> type; };
-  };
-
-  template <typename Construction>
-  struct Select_wrapper_impl<Construction, OBJECT> {
-    template<typename Kernel, typename AKC, typename EKC>
-    struct apply { typedef Lazy_construction_object<Kernel, AKC, EKC> type; };
-  };
-
-  template <typename Construction>
-  struct Select_wrapper_impl<Construction, BBOX> {
-    template<typename Kernel, typename AKC, typename EKC>
-    struct apply { typedef Lazy_construction_bbox<Kernel, AKC, EKC> type; };
-  };
-
-  template <typename Construction>
-  struct Select_wrapper_impl<Construction, OPTIONAL_> {
-    template<typename Kernel, typename AKC, typename EKC>
-    struct apply { typedef Lazy_construction_optional_for_polygonal_envelope<Kernel, AKC, EKC> type; };
-  };
-
-  template <typename Construction>
-  struct Select_wrapper : Select_wrapper_impl<Construction> {};
-
 public:
-
-
 #ifdef CGAL_NO_STATIC_FILTERS_FOR_LAZY_KERNEL
 #define CGAL_Kernel_pred(P, Pf)                                         \
     typedef Filtered_predicate<typename Exact_kernel::P, typename Approximate_kernel::P, C2E, C2F> P; \
     P Pf() const { return P(); }
 #else
-#define CGAL_Kernel_pred(P, Pf)  \
-  typedef Static_filtered_predicate<Approximate_kernel, Filtered_predicate<typename Exact_kernel::P, typename Approximate_kernel::P, C2E, C2F>, Exact_predicates_inexact_constructions_kernel::P> P; \
+// - the first template parameter is because either it fits in a double, or not, so
+//   we might as well use the approximate kernel directly rather than the complete lazy kernel
+// - the second is the predicate to be called if EPICK is not usable
+// - the third is the equivalent predicate in EPICK
+#define CGAL_Kernel_pred(P, Pf) \
+  typedef EPIC_predicate_if_convertible<Approximate_kernel, \
+                                        Filtered_predicate<typename Exact_kernel::P, \
+                                                           typename Approximate_kernel::P, C2E, C2F>, \
+                                        Exact_predicates_inexact_constructions_kernel::P> P; \
     P Pf() const { return P(); }
 #endif
 
 #define CGAL_Kernel_cons(C, Cf) \
-  typedef typename Select_wrapper<typename Approximate_kernel::C>::template apply<Kernel, typename Approximate_kernel::C, typename Exact_kernel::C>::type C; \
+  typedef Lazy_construction<Kernel, typename Approximate_kernel::C, typename Exact_kernel::C> C; \
   C Cf() const { return C(); }
 
 #include <CGAL/Kernel/interface_macros.h>
@@ -287,11 +159,6 @@ public:
   struct Handle { typedef T   type; };
 };
 
-
-
-
-
-
 template < typename EK_, typename AK_, typename E2A_, typename Kernel_ >
 class Lazy_kernel_base
   : public Lazy_kernel_generic_base<EK_, AK_, E2A_, Kernel_>
@@ -308,18 +175,16 @@ public:
 
   typedef CommonKernelFunctors::Assign_2<Kernel>        Assign_2;
   typedef CommonKernelFunctors::Assign_3<Kernel>        Assign_3;
-  typedef Lazy_construction_bbox<Kernel, typename Approximate_kernel::Construct_bbox_2, typename Exact_kernel::Construct_bbox_2>             Construct_bbox_2;
-  typedef Lazy_construction_bbox<Kernel, typename Approximate_kernel::Construct_bbox_3, typename Exact_kernel::Construct_bbox_3>             Construct_bbox_3;
   typedef Lazy_cartesian_const_iterator_2<Kernel, typename Approximate_kernel::Construct_cartesian_const_iterator_2, typename Exact_kernel::Construct_cartesian_const_iterator_2>   Construct_cartesian_const_iterator_2;
   typedef Lazy_cartesian_const_iterator_3<Kernel, typename Approximate_kernel::Construct_cartesian_const_iterator_3, typename Exact_kernel::Construct_cartesian_const_iterator_3>   Construct_cartesian_const_iterator_3;
 
   typedef CGAL::CartesianKernelFunctors::Compute_approximate_squared_length_3<Kernel>  Compute_approximate_squared_length_3;
   typedef CGAL::CartesianKernelFunctors::Compute_approximate_area_3<Kernel>  Compute_approximate_area_3;
 
-  // typedef void Compute_z_3; // to detect where .z() is called
-  // typedef void Construct_point_3; // to detect where the ctor is called
-
-
+  typedef CGAL::Lazy_construction_optional_for_polyhedral_envelope<
+            Kernel,
+            typename Approximate_kernel::Intersect_point_3_for_polyhedral_envelope,
+            typename Exact_kernel::Intersect_point_3_for_polyhedral_envelope> Intersect_point_3_for_polyhedral_envelope;
 
   struct Compute_weight_2 : public BaseClass::Compute_weight_2
   {
@@ -552,7 +417,6 @@ public:
 
   };
 
-
   struct Less_xyz_3 : public BaseClass::Less_xyz_3
   {
     typedef typename Kernel_::Point_3 Point_3;
@@ -593,14 +457,6 @@ public:
   assign_3_object() const
   { return Assign_3(); }
 
-  Construct_bbox_2
-  construct_bbox_2_object() const
-  { return Construct_bbox_2(); }
-
-  Construct_bbox_3
-  construct_bbox_3_object() const
-  { return Construct_bbox_3(); }
-
   Construct_cartesian_const_iterator_2
   construct_cartesian_const_iterator_2_object() const
   { return Construct_cartesian_const_iterator_2(); }
@@ -617,6 +473,10 @@ public:
   compute_approximate_area_3_object() const
   { return Compute_approximate_area_3(); }
 
+  Intersect_point_3_for_polyhedral_envelope
+  intersect_point_3_for_polyhedral_envelope_object() const
+  { return Intersect_point_3_for_polyhedral_envelope(); }
+
   Less_xyz_3
   less_xyz_3_object() const
   { return Less_xyz_3(); }
diff --git a/Filtered_kernel/include/CGAL/Static_filtered_predicate.h b/Filtered_kernel/include/CGAL/Static_filtered_predicate.h
deleted file mode 100644
index 9ff3aea5d1c..00000000000
--- a/Filtered_kernel/include/CGAL/Static_filtered_predicate.h
+++ /dev/null
@@ -1,238 +0,0 @@
-// Copyright (c) 2017  GeometryFactory
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org)
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
-//
-// Author(s)     : Andreas Fabri, Laurent Rineau
-
-#ifndef CGAL_STATIC_FILTERED_PREDICATE_H
-#define CGAL_STATIC_FILTERED_PREDICATE_H
-
-#include <CGAL/Epic_converter.h>
-
-namespace CGAL {
-
-template <typename AK, typename FP, typename EpicP>
-class Static_filtered_predicate {
-public:
-  FP fp;
-  EpicP epicp;
-  typedef typename AK::FT IA;
-  typedef typename FP::result_type result_type;
-
-  template <typename A1>
-  result_type operator()(const A1& a1) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1);
-    }
-
-    return epicp(aa1.first);
-  }
-
-
-  template <typename A1, typename A2>
-  result_type operator()(const A1& a1, const A2& a2) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2);
-    }
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2);
-    }
-    return epicp(aa1.first, aa2.first);
-  }
-
-
-  template <typename A1, typename A2, typename A3>
-  result_type operator()(const A1& a1, const A2& a2, const A3& a3) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2, a3);
-    }
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2, a3);
-    }
-    auto aa3 = convert(approx(a3));
-    if(! aa3.second){
-      return fp(a1, a2, a3);
-    }
-    return epicp(aa1.first, aa2.first, aa3.first);
-  }
-
-
-  template <typename A1, typename A2, typename A3, typename A4>
-  result_type operator()(const A1& a1, const A2& a2, const A3& a3, const A4& a4) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2, a3, a4);
-    }
-
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2, a3, a4);
-    }
-
-    auto aa3 = convert(approx(a3));
-    if(! aa3.second){
-      return fp(a1, a2, a3, a4);
-    }
-
-    auto aa4 = convert(approx(a4));
-    if(! aa4.second){
-      return fp(a1, a2, a3, a4);
-    }
-    return epicp(aa1.first, aa2.first, aa3.first, aa4.first);
-  }
-
-  template <typename A1, typename A2, typename A3, typename A4, typename A5>
-  result_type operator()(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2, a3, a4, a5);
-    }
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2, a3, a4, a5);
-    }
-    auto aa3 = convert(approx(a3));
-    if(! aa3.second){
-      return fp(a1, a2, a3, a4, a5);
-    }
-    auto aa4 = convert(approx(a4));
-    if(! aa4.second){
-      return fp(a1, a2, a3, a4, a5);
-    }
-    auto aa5 = convert(approx(a5));
-    if(! aa5.second){
-      return fp(a1, a2, a3, a4, a5);
-    }
-    return epicp(aa1.first, aa2.first, aa3.first, aa4.first, aa5.first);
-  }
-
-  template <typename A1, typename A2, typename A3, typename A4, typename A5, typename A6>
-  result_type operator()(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2, a3, a4, a5, a6);
-    }
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2, a3, a4, a5, a6);
-    }
-    auto aa3 = convert(approx(a3));
-    if(! aa3.second){
-      return fp(a1, a2, a3, a4, a5, a6);
-    }
-    auto aa4 = convert(approx(a4));
-    if(! aa4.second){
-      return fp(a1, a2, a3, a4, a5, a6);
-    }
-    auto aa5 = convert(approx(a5));
-    if(! aa5.second){
-      return fp(a1, a2, a3, a4, a5, a6);
-    }
-    auto aa6 = convert(approx(a6));
-    if(! aa6.second){
-      return fp(a1, a2, a3, a4, a5, a6);
-    }
-    return epicp(aa1.first, aa2.first, aa3.first, aa4.first, aa5.first, aa6.first);
-  }
-
-  template <typename A1, typename A2, typename A3, typename A4, typename A5, typename A6, typename A7>
-  result_type operator()(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A6& a7) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    auto aa3 = convert(approx(a3));
-    if(! aa3.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    auto aa4 = convert(approx(a4));
-    if(! aa4.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    auto aa5 = convert(approx(a5));
-    if(! aa5.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    auto aa6 = convert(approx(a6));
-    if(! aa6.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    auto aa7 = convert(approx(a7));
-    if(! aa7.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7);
-    }
-    return epicp(aa1.first, aa2.first, aa3.first, aa4.first, aa5.first, aa6.first, aa7.first);
-  }
-
-
-  template <typename A1, typename A2, typename A3, typename A4, typename A5, typename A6, typename A7, typename A8>
-  result_type operator()(const A1& a1, const A2& a2, const A3& a3, const A4& a4, const A5& a5, const A6& a6, const A7& a7, const A8& a8) const
-  {
-    CGAL::Epic_converter<AK> convert;
-    auto aa1 = convert(approx(a1));
-    if(! aa1.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7, a8);
-    }
-    auto aa2 = convert(approx(a2));
-    if(! aa2.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7, a8);
-    }
-    auto aa3 = convert(approx(a3));
-    if(! aa3.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7, a8);
-    }
-    auto aa4 = convert(approx(a4));
-    if(! aa4.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7, a8);
-    }
-    auto aa5 = convert(approx(a5));
-    if(! aa5.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7, a8);
-    }
-    auto aa6 = convert(approx(a6));
-    if(! aa6.second){
-      return fp(a1, a2, a3, a5, a5, a6, a7, a8);
-    }
-    auto aa7 = convert(approx(a7));
-    if(! aa7.second){
-      return fp(a1, a2, a3, a5, a5, a6, a7, a8);
-    }
-    auto aa8 = convert(approx(a8));
-    if(! aa8.second){
-      return fp(a1, a2, a3, a4, a5, a6, a7, a8);
-    }
-    return epicp(aa1.first, aa2.first, aa3.first, aa4.first, aa5.first, aa6.first, aa7.first, aa8.first);
-  }
-};
-
-} // CGAL
-
-#endif // CGAL_STATIC_FILTERED_PREDICATE_H
diff --git a/Generalized_map/include/CGAL/GMap_dart_iterators.h b/Generalized_map/include/CGAL/GMap_dart_iterators.h
index 3e8b843eb6f..6a4c611bdaa 100644
--- a/Generalized_map/include/CGAL/GMap_dart_iterators.h
+++ b/Generalized_map/include/CGAL/GMap_dart_iterators.h
@@ -134,7 +134,7 @@ namespace CGAL {
   //****************************************************************************
   /* Class CMap_dart_iterator_basic_of_two_alpha<Ai,delta>: to iterate
    * on the darts of the orbit <Ai,Ai+delta>: Ai<Ai+delta<=dimension.
-   * This general case if for delta>1 (ie at most 4 darts).
+   * This general case if for delta>1 (i.e. at most 4 darts).
    * Basic classes do not guaranty correct marks (i.e. do not unmark darts in
    * the destructor, possible problem with the rewind). If you are not sure,
    * use CMap_dart_iterator_basic_of_two_alpha.
@@ -445,7 +445,7 @@ namespace CGAL {
   /* Class CMap_dart_iterator_basic_of_three_alpha<Ai,delta1,delta2>: to iterate
    * on the darts of the orbit <Ai,Ai+delta1,Ai+delta2>:
    * Ai<Ai+delta1<Ai+delta2<=dimension.
-   * This general case if for delta1>1 and delta2>1 (ie at most 8 darts).
+   * This general case if for delta1>1 and delta2>1 (i.e. at most 8 darts).
    * Basic classes do not guaranty correct marks (i.e. do not unmark darts in
    * the destructor, possible problem with the rewind). If you are not sure,
    * use CMap_dart_iterator_basic_of_two_alpha.
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index 4af0ee3a09a..acb4cc583da 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -876,7 +876,7 @@ namespace CGAL {
     { return mnb_used_marks; }
 
     /** Test if a given mark is reserved.
-     *  @return true iff the mark is reserved (ie in used).
+     *  @return true iff the mark is reserved (i.e. in used).
      */
     bool is_reserved(size_type amark) const
     {
diff --git a/GraphicsView/include/CGAL/Qt/ImageInterface.ui b/GraphicsView/include/CGAL/Qt/ImageInterface.ui
index 0dfa667b8a8..dcc25b0cce0 100644
--- a/GraphicsView/include/CGAL/Qt/ImageInterface.ui
+++ b/GraphicsView/include/CGAL/Qt/ImageInterface.ui
@@ -141,7 +141,7 @@
      <item>
       <widget class="QDoubleSpinBox" name="oversampling">
        <property name="toolTip">
-        <string>Antialiases image (when larger then 1.0)</string>
+        <string>Antialiases image (when larger than 1.0)</string>
        </property>
        <property name="prefix">
         <string>x </string>
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/CircleH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/CircleH2.h
index f2414a459e4..e46139d0cd6 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/CircleH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/CircleH2.h
@@ -84,20 +84,20 @@ public:
     CircleH2<R>
     opposite() const;
 
-    Oriented_side
+    typename R_::Oriented_side
     oriented_side(const Point_2& ) const;
 
-    Bounded_side
+    typename R_::Bounded_side
     bounded_side(const Point_2& ) const;
 
     bool  operator==( const CircleH2<R>& ) const;
     bool  operator!=( const CircleH2<R>& ) const;
-    bool  has_on_positive_side(const Point_2& ) const;
-    bool  has_on_negative_side(const Point_2& ) const;
-    bool  has_on_boundary( const Point_2& ) const;
-    bool  has_on_bounded_side( const Point_2& ) const;
-    bool  has_on_unbounded_side(const Point_2&) const;
-    bool  is_degenerate() const;
+    typename R_::Boolean has_on_positive_side(const Point_2& ) const;
+    typename R_::Boolean has_on_negative_side(const Point_2& ) const;
+    typename R_::Boolean has_on_boundary( const Point_2& ) const;
+    typename R_::Boolean has_on_bounded_side( const Point_2& ) const;
+    typename R_::Boolean has_on_unbounded_side(const Point_2&) const;
+    typename R_::Boolean is_degenerate() const;
 
     // bool  oriented_equal( const CircleH2<R>& ) const;
     // bool  unoriented_equal( const CircleH2<R>& ) const;
@@ -133,17 +133,15 @@ CircleH2<R>::orientation() const
 
 template <class R>
 CGAL_KERNEL_INLINE
-Oriented_side
+typename R::Oriented_side
 CircleH2<R>::oriented_side( const typename CircleH2<R>::Point_2& p) const
 {
   FT sq_dist = squared_distance( p, center() );
-  FT sq_rad  = squared_radius();
-  Comparison_result vgl = CGAL_NTS compare( sq_dist, sq_rad );
-  Oriented_side rel_pos = (vgl == LARGER ) ?
-                                   ON_NEGATIVE_SIDE :
-                                   ( (vgl == SMALLER ) ?
-                                          ON_POSITIVE_SIDE :
-                                          ON_ORIENTED_BOUNDARY);
+  const FT& sq_rad  = squared_radius();
+  typename R::Comparison_result vgl = CGAL_NTS compare( sq_dist, sq_rad );
+  typename R::Oriented_side rel_pos = (vgl == LARGER ) ? ON_NEGATIVE_SIDE
+                                                       : ((vgl == SMALLER) ? ON_POSITIVE_SIDE
+                                                                           : ON_ORIENTED_BOUNDARY);
   if (orientation() == POSITIVE)
   { return rel_pos; }
   else       // NEGATIVE
@@ -152,7 +150,7 @@ CircleH2<R>::oriented_side( const typename CircleH2<R>::Point_2& p) const
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleH2<R>::has_on_positive_side(const typename CircleH2<R>::Point_2& p) const
 {
   if ( orientation() == POSITIVE )
@@ -163,7 +161,7 @@ CircleH2<R>::has_on_positive_side(const typename CircleH2<R>::Point_2& p) const
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleH2<R>::has_on_boundary(const typename CircleH2<R>::Point_2& p) const
 {
   FT sq_dist = squared_distance( p, center() );
@@ -173,7 +171,7 @@ CircleH2<R>::has_on_boundary(const typename CircleH2<R>::Point_2& p) const
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleH2<R>::has_on_negative_side( const typename CircleH2<R>::Point_2&p) const
 {
   if ( orientation() == NEGATIVE )
@@ -188,12 +186,12 @@ CircleH2<R>::has_on_negative_side( const typename CircleH2<R>::Point_2&p) const
 
 template <class R>
 CGAL_KERNEL_INLINE
-Bounded_side
+typename R::Bounded_side
 CircleH2<R>::bounded_side(const typename CircleH2<R>::Point_2& p) const
 {
   FT sq_dist = squared_distance( p, center() );
-  FT sq_rad  = squared_radius();
-  Comparison_result vgl = CGAL_NTS compare( sq_dist, sq_rad );
+  const FT& sq_rad  = squared_radius();
+  typename R::Comparison_result vgl = CGAL_NTS compare( sq_dist, sq_rad );
   return  (vgl == LARGER ) ? ON_UNBOUNDED_SIDE :
                                    ( (vgl == SMALLER ) ?
                                           ON_BOUNDED_SIDE :
@@ -202,33 +200,33 @@ CircleH2<R>::bounded_side(const typename CircleH2<R>::Point_2& p) const
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleH2<R>::has_on_bounded_side(const typename CircleH2<R>::Point_2& p) const
 {
   FT sq_dist = squared_distance( p, center() );
-  FT sq_rad  = squared_radius();
+  const FT& sq_rad  = squared_radius();
   return ( sq_dist < sq_rad );
 }
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleH2<R>::has_on_unbounded_side(const typename CircleH2<R>::Point_2&p) const
 {
   FT sq_dist = squared_distance( p, center() );
-  FT sq_rad  = squared_radius();
+  const FT& sq_rad  = squared_radius();
   return ( sq_rad < sq_dist );
 }
 
 template <class R>
 inline
-bool
+typename R::Boolean
 CircleH2<R>::is_degenerate() const
 { return ( squared_radius() == FT(0) ); }
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 CircleH2<R>::operator==(const CircleH2<R>& c) const
 {
   return  ( center() == c.center() )
@@ -238,7 +236,7 @@ CircleH2<R>::operator==(const CircleH2<R>& c) const
 
 template <class R>
 inline
-bool
+typename R::Boolean
 CircleH2<R>::operator!=(const CircleH2<R>& c) const
 { return !(*this == c); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH2.h
index b30267cf7d2..54e59877d8d 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH2.h
@@ -64,9 +64,8 @@ public:
      : base( w > RT(0) ? CGAL::make_array(x, y, w)
                        : CGAL::make_array<RT>(-x, -y, -w) ) {}
 
-    bool    operator==( const DirectionH2<R>& d) const;
-    bool    operator!=( const DirectionH2<R>& d) const;
-
+    typename R_::Boolean operator==( const DirectionH2<R>& d) const;
+    typename R_::Boolean operator!=( const DirectionH2<R>& d) const;
 
     Vector_2       to_vector() const;
 
@@ -81,7 +80,7 @@ public:
 
 template <class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 DirectionH2<R>::operator==( const DirectionH2<R>& d) const
 {
   return (  ( x() * d.y() == y() * d.x() )
@@ -91,7 +90,7 @@ DirectionH2<R>::operator==( const DirectionH2<R>& d) const
 
 template <class R >
 inline
-bool
+typename R::Boolean
 DirectionH2<R>::operator!=( const DirectionH2<R>& d) const
 { return !(*this == d); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH3.h
index a4098d72848..4faa0dc180a 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/DirectionH3.h
@@ -66,10 +66,10 @@ public:
     : base( w >= RT(0) ? CGAL::make_array(x, y, z, w)
                        : CGAL::make_array<RT>(-x, -y, -z, -w) ) {}
 
-  bool  is_degenerate() const;
+  typename R::Boolean is_degenerate() const;
 
-  bool  operator==( const DirectionH3<R>& d) const;
-  bool  operator!=( const DirectionH3<R>& d) const;
+  typename R::Boolean operator==( const DirectionH3<R>& d) const;
+  typename R::Boolean operator!=( const DirectionH3<R>& d) const;
 
   Vector_3    to_vector() const;
   Vector_3    vector() const { return to_vector(); }
@@ -87,7 +87,7 @@ public:
 
 template <class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 DirectionH3<R>::operator==( const DirectionH3<R>& d) const
 {
   return ( ( hx()*d.hy() == hy()*d.hx() )
@@ -100,13 +100,13 @@ DirectionH3<R>::operator==( const DirectionH3<R>& d) const
 
 template <class R >
 inline
-bool
+typename R::Boolean
 DirectionH3<R>::operator!=( const DirectionH3<R>& d) const
 { return !operator==(d); }
 
 template <class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 DirectionH3<R>::is_degenerate() const
 { return ((hx() == RT(0)) && (hy() == RT(0)) && (hz() == RT(0))); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_cuboidH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_cuboidH3.h
index e4830033289..35f2a2a29f0 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_cuboidH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_cuboidH3.h
@@ -63,23 +63,21 @@ public:
   Iso_cuboidH3(const RT& min_hx, const RT& min_hy, const RT& min_hz,
                const RT& max_hx, const RT& max_hy, const RT& max_hz);
 
-  bool      operator==(const Iso_cuboidH3<R>& s) const;
-  bool      operator!=(const Iso_cuboidH3<R>& s) const;
+  typename R::Boolean operator==(const Iso_cuboidH3<R>& s) const;
+  typename R::Boolean operator!=(const Iso_cuboidH3<R>& s) const;
 
   const Point_3 & min BOOST_PREVENT_MACRO_SUBSTITUTION () const;
   const Point_3 & max BOOST_PREVENT_MACRO_SUBSTITUTION () const;
   Point_3  vertex(int i) const;
   Point_3  operator[](int i) const;
 
-  Iso_cuboidH3<R>
-            transform(const Aff_transformation_3& t) const;
-  Bounded_side
-            bounded_side(const Point_3& p) const;
-  bool      has_on(const Point_3& p) const;
-  bool      has_on_boundary(const Point_3& p) const;
-  bool      has_on_bounded_side(const Point_3& p) const;
-  bool      has_on_unbounded_side(const Point_3& p) const;
-  bool      is_degenerate() const;
+  Iso_cuboidH3<R> transform(const Aff_transformation_3& t) const;
+  typename R::Bounded_side bounded_side(const Point_3& p) const;
+  typename R::Boolean has_on(const Point_3& p) const;
+  typename R::Boolean has_on_boundary(const Point_3& p) const;
+  typename R::Boolean has_on_bounded_side(const Point_3& p) const;
+  typename R::Boolean has_on_unbounded_side(const Point_3& p) const;
+  typename R::Boolean is_degenerate() const;
   FT        xmin() const;
   FT        ymin() const;
   FT        zmin() const;
@@ -189,14 +187,14 @@ Iso_cuboidH3(const RT& min_hx, const RT& min_hy, const RT& min_hz,
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::
 operator==(const Iso_cuboidH3<R>& r) const
 { return  ((this->min)() == (r.min)()) && ((this->max)() == (r.max)()); }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::
 operator!=(const Iso_cuboidH3<R>& r) const
 { return !(*this == r); }
@@ -313,7 +311,7 @@ Iso_cuboidH3<R>::operator[](int i) const
 
 template < class R >
 CGAL_KERNEL_MEDIUM_INLINE
-Bounded_side
+typename R::Bounded_side
 Iso_cuboidH3<R>::
 bounded_side(const typename Iso_cuboidH3<R>::Point_3& p) const
 {
@@ -337,34 +335,34 @@ bounded_side(const typename Iso_cuboidH3<R>::Point_3& p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::
 has_on_boundary(const typename Iso_cuboidH3<R>::Point_3& p) const
 { return ( bounded_side(p) == ON_BOUNDARY ); }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::has_on(const typename Iso_cuboidH3<R>::Point_3& p) const
 { return ( bounded_side(p) == ON_BOUNDARY ); }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::
 has_on_bounded_side(const typename Iso_cuboidH3<R>::Point_3& p) const
 { return ( bounded_side(p) == ON_BOUNDED_SIDE ); }
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::
 has_on_unbounded_side(const typename Iso_cuboidH3<R>::Point_3& p) const
 { return ( bounded_side(p) == ON_UNBOUNDED_SIDE ); }
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 Iso_cuboidH3<R>::is_degenerate() const
 {
   return (  ( (this->min)().hx() == (this->max)().hx() )
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_rectangleH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_rectangleH2.h
index 6bdde3dec91..65f9e220174 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_rectangleH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/Iso_rectangleH2.h
@@ -52,7 +52,7 @@ public:
   const Point_2 & min BOOST_PREVENT_MACRO_SUBSTITUTION () const;
   const Point_2 & max BOOST_PREVENT_MACRO_SUBSTITUTION () const;
 
-  Bounded_side bounded_side(const Point_2& p) const;
+  typename R_::Bounded_side bounded_side(const Point_2& p) const;
 };
 
 
@@ -71,7 +71,7 @@ Iso_rectangleH2<R>::max BOOST_PREVENT_MACRO_SUBSTITUTION () const
 
 template < class R >
 CGAL_KERNEL_INLINE
-Bounded_side
+typename R::Bounded_side
 Iso_rectangleH2<R>::
 bounded_side(const typename Iso_rectangleH2<R>::Point_2& p) const
 {
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/LineH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/LineH2.h
index ab69b965f35..66d45a41a1a 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/LineH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/LineH2.h
@@ -47,8 +47,8 @@ public:
     LineH2(const RT& a, const RT& b, const RT& c)
       : base{a, b, c} {}
 
-    bool           operator==(const LineH2<R>& l) const;
-    bool           operator!=(const LineH2<R>& l) const;
+    typename R_::Boolean operator==(const LineH2<R>& l) const;
+    typename R_::Boolean operator!=(const LineH2<R>& l) const;
 
     const RT &     a() const { return get_pointee_or_identity(base)[0]; }
     const RT &     b() const { return get_pointee_or_identity(base)[1]; }
@@ -58,7 +58,7 @@ public:
 
 template < class R >
 CGAL_KERNEL_MEDIUM_INLINE
-bool
+typename R::Boolean
 LineH2<R>::operator==(const LineH2<R>& l) const
 {
   if (  (a() * l.c() != l.a() * c() )
@@ -83,7 +83,7 @@ LineH2<R>::operator==(const LineH2<R>& l) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 LineH2<R>::operator!=(const LineH2<R>& l) const
 { return !(*this == l); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PlaneH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PlaneH3.h
index 6b05951a064..5e7ae6ac99c 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PlaneH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PlaneH3.h
@@ -67,8 +67,8 @@ public:
     const RT & c() const;
     const RT & d() const;
 
-    bool       operator==( const PlaneH3<R>& ) const;
-    bool       operator!=( const PlaneH3<R>& ) const;
+    typename R::Boolean operator==( const PlaneH3<R>& ) const;
+    typename R::Boolean operator!=( const PlaneH3<R>& ) const;
 
     Line_3  perpendicular_line(const Point_3& ) const;
     Plane_3 opposite() const;  // plane with opposite orientation
@@ -78,13 +78,13 @@ public:
     Direction_3    orthogonal_direction() const;
     Vector_3       orthogonal_vector() const;
 
-    Oriented_side  oriented_side(const Point_3 &p) const;
-    bool           has_on(const Point_3 &p) const;
-    bool           has_on(const Line_3 &p) const;
-    bool           has_on_positive_side(const Point_3&l) const;
-    bool           has_on_negative_side(const Point_3&l) const;
+    typename R::Oriented_side oriented_side(const Point_3& p) const;
+    typename R::Boolean has_on(const Point_3& p) const;
+    typename R::Boolean has_on(const Line_3& p) const;
+    typename R::Boolean has_on_positive_side(const Point_3& l) const;
+    typename R::Boolean has_on_negative_side(const Point_3& l) const;
 
-    bool           is_degenerate() const;
+    typename R::Boolean is_degenerate() const;
 
     Aff_transformation_3 transform_to_2d() const;
     Point_2   to_2d(const Point_3& )  const;
@@ -163,7 +163,7 @@ PlaneH3<R>::new_rep(const RT &a, const RT &b, const RT &c, const RT &d)
 
 template < class R >
 inline
-bool
+typename R::Boolean
 PlaneH3<R>::operator!=(const PlaneH3<R>& l) const
 {
  return !(*this == l);
@@ -397,7 +397,7 @@ PlaneH3<R>::orthogonal_vector() const
 { return Vector_3(a(), b(), c() ); }
 
 template < class R >
-bool
+typename R::Boolean
 PlaneH3<R>::is_degenerate() const
 {
  const RT RT0(0);
@@ -405,14 +405,14 @@ PlaneH3<R>::is_degenerate() const
 }
 
 template < class R >
-bool
+typename R::Boolean
 PlaneH3<R>::has_on_positive_side( const typename PlaneH3<R>::Point_3& p) const
 {
  return (a()*p.hx() + b()*p.hy() + c()*p.hz() + d()*p.hw() > RT(0) );
 }
 
 template < class R >
-bool
+typename R::Boolean
 PlaneH3<R>::has_on_negative_side( const typename PlaneH3<R>::Point_3& p) const
 {
  return (a()*p.hx() + b()*p.hy() + c()*p.hz() + d()*p.hw() < RT(0) );
@@ -420,14 +420,14 @@ PlaneH3<R>::has_on_negative_side( const typename PlaneH3<R>::Point_3& p) const
 
 
 template < class R >
-bool
+typename R::Boolean
 PlaneH3<R>::has_on( const typename PlaneH3<R>::Point_3& p) const
 {
  return (a()*p.hx() + b()*p.hy() + c()*p.hz() + d()*p.hw() == RT(0) );
 }
 
 template < class R >
-bool
+typename R::Boolean
 PlaneH3<R>::has_on( const typename PlaneH3<R>::Line_3& l) const
 {
  Point_3   p   = l.point();
@@ -439,7 +439,7 @@ PlaneH3<R>::has_on( const typename PlaneH3<R>::Line_3& l) const
 }
 
 template < class R >
-Oriented_side
+typename R::Oriented_side
 PlaneH3<R>::oriented_side( const typename PlaneH3<R>::Point_3& p) const
 {
  return CGAL_NTS sign( a()*p.hx() + b()*p.hy() + c()*p.hz() + d()*p.hw() );
@@ -447,7 +447,7 @@ PlaneH3<R>::oriented_side( const typename PlaneH3<R>::Point_3& p) const
 
 
 template < class R >
-bool
+typename R::Boolean
 PlaneH3<R>::operator==(const PlaneH3<R>& l) const
 {
  if (  (a() * l.d() != l.a() * d() )
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
index 06ff55945fe..62dc1f28783 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
@@ -63,8 +63,8 @@ public:
     PointH2(const RT& hx, const RT& hy, const RT& hw)
       : base(hx, hy, hw) {}
 
-    bool    operator==( const PointH2<R>& p) const;
-    bool    operator!=( const PointH2<R>& p) const;
+    typename R::Boolean operator==( const PointH2<R>& p) const;
+    typename R::Boolean operator!=( const PointH2<R>& p) const;
 
     const RT & hx() const { return base.hx(); }
     const RT & hy() const { return base.hy(); }
@@ -94,7 +94,7 @@ public:
 
 template < class R >
 inline
-bool
+typename R::Boolean
 PointH2<R>::operator==( const PointH2<R>& p) const
 {
   return base == p.base;
@@ -102,7 +102,7 @@ PointH2<R>::operator==( const PointH2<R>& p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 PointH2<R>::operator!=( const PointH2<R>& p) const
 { return !(*this == p); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
index f64d5b64c9a..ead132b42d5 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
@@ -90,8 +90,8 @@ public:
   Direction_3 direction() const;
   Point_3     transform( const Aff_transformation_3 & t) const;
 
-  bool  operator==( const PointH3<R>& p) const;
-  bool  operator!=( const PointH3<R>& p) const;
+  typename R::Boolean operator==( const PointH3<R>& p) const;
+  typename R::Boolean operator!=( const PointH3<R>& p) const;
 };
 
 
@@ -175,7 +175,7 @@ PointH3<R>::direction() const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 PointH3<R>::operator==( const PointH3<R> & p) const
 {
   return base == p.base;
@@ -183,7 +183,7 @@ PointH3<R>::operator==( const PointH3<R> & p) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 PointH3<R>::operator!=( const PointH3<R> & p) const
 { return !(*this == p); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/RayH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/RayH3.h
index 8a48ffd52bf..3a3999d459b 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/RayH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/RayH3.h
@@ -63,12 +63,12 @@ public:
     const Vector_3 & to_vector() const;
     Line_3  supporting_line() const;
     RayH3<R>   opposite() const;
-    bool           has_on(const Point_3& p) const;
-    bool           collinear_has_on(const Point_3 &p) const;
-    bool           is_degenerate() const;
+    typename R::Boolean has_on(const Point_3& p) const;
+    typename R::Boolean collinear_has_on(const Point_3 &p) const;
+    typename R::Boolean is_degenerate() const;
 
-    bool           operator==(const RayH3<R>& r) const;
-    bool           operator!=(const RayH3<R>& r) const;
+    typename R::Boolean operator==(const RayH3<R>& r) const;
+    typename R::Boolean operator!=(const RayH3<R>& r) const;
 };
 
 template < class R >
@@ -133,7 +133,7 @@ RayH3<R>::opposite() const
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 RayH3<R>::has_on(const typename RayH3<R>::Point_3 &p) const
 {
   return ( (  p == start() )
@@ -142,25 +142,25 @@ RayH3<R>::has_on(const typename RayH3<R>::Point_3 &p) const
 
 template < class R >
 inline                                      /* XXX */
-bool
+typename R::Boolean
 RayH3<R>::collinear_has_on(const typename RayH3<R>::Point_3 &p) const
 { return has_on(p); }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 RayH3<R>::is_degenerate() const
 { return to_vector() == NULL_VECTOR; }
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 RayH3<R>::operator==(const RayH3<R>& r) const
 { return ( (start() == r.start() )&&( direction() == r.direction() ) ); }
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 RayH3<R>::operator!=( const RayH3<R>& r) const
 { return !operator==(r); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/SphereH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/SphereH3.h
index a00ec51b275..1615004c68b 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/SphereH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/SphereH3.h
@@ -57,10 +57,10 @@ public:
       SphereH3(const Point_3&  p,
                const Orientation& o = COUNTERCLOCKWISE);
 
-      bool
+      typename R::Boolean
       operator==(const SphereH3<R>&) const;
 
-      bool
+      typename R::Boolean
       operator!=(const SphereH3<R>& s) const
       { return !(*this == s); }
 
@@ -70,32 +70,32 @@ public:
 
       Orientation orientation() const;
 
-      bool is_degenerate() const;
+      typename R::Boolean is_degenerate() const;
 
       SphereH3<R> opposite() const;
 
-      Oriented_side oriented_side(const Point_3& p) const;
+      typename R::Oriented_side oriented_side(const Point_3& p) const;
 
-      bool
+      typename R::Boolean
       has_on_boundary(const Point_3& p) const
       { return oriented_side(p)==ON_ORIENTED_BOUNDARY; }
 
-      bool
+      typename R::Boolean
       has_on_positive_side(const Point_3& p) const
       { return oriented_side(p)==ON_POSITIVE_SIDE; }
 
-      bool
+      typename R::Boolean
       has_on_negative_side(const Point_3& p) const
       { return oriented_side(p)==ON_NEGATIVE_SIDE; }
 
-      Bounded_side
+      typename R::Bounded_side
       bounded_side(const Point_3& p) const;
 
-      bool
+      typename R::Boolean
       has_on_bounded_side(const Point_3& p) const
       { return bounded_side(p)==ON_BOUNDED_SIDE; }
 
-      bool
+      typename R::Boolean
       has_on_unbounded_side(const Point_3& p) const
       { return bounded_side(p)==ON_UNBOUNDED_SIDE; }
 };
@@ -162,7 +162,7 @@ SphereH3<R>::SphereH3(const typename SphereH3<R>::Point_3& p,
 
 template <class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 SphereH3<R>::operator==(const SphereH3<R>& s) const
 {
    return    ( orientation() == s.orientation())
@@ -190,23 +190,23 @@ SphereH3<R>::orientation() const
 
 template <class R>
 inline
-bool
+typename R::Boolean
 SphereH3<R>::is_degenerate() const
 { return squared_radius() <= FT(0) ; }
 
 template <class R>
 CGAL_KERNEL_MEDIUM_INLINE
-Oriented_side
+typename R::Oriented_side
 SphereH3<R>::oriented_side(const typename SphereH3<R>::Point_3& p) const
 { return Oriented_side(static_cast<int>(bounded_side(p)) * static_cast<int>(orientation())); }
 
 template <class R>
 CGAL_KERNEL_INLINE
-Bounded_side
+typename R::Bounded_side
 SphereH3<R>::bounded_side(const typename SphereH3<R>::Point_3& p) const
 {
-  return Bounded_side(CGAL_NTS compare(squared_radius(),
-                                       squared_distance(center(),p)));
+  return enum_cast<Bounded_side>(CGAL_NTS compare(squared_radius(),
+                                          squared_distance(center(),p)));
 }
 
 template <class R>
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
index 92afeec7941..1ae244802f1 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
@@ -80,10 +80,10 @@ public:
     return static_cast<const Self& >(*this);
   }
 
-   bool    operator==( const VectorH2<R>& v) const;
-   bool    operator!=( const VectorH2<R>& v) const;
-   bool    operator==( const Null_vector&) const;
-   bool    operator!=( const Null_vector& v) const;
+   typename R::Boolean operator==( const VectorH2<R>& v) const;
+   typename R::Boolean operator!=( const VectorH2<R>& v) const;
+   typename R::Boolean operator==( const Null_vector&) const;
+   typename R::Boolean operator!=( const Null_vector& v) const;
 
    const RT & hx() const { return CGAL::get_pointee_or_identity(base)[0]; };
    const RT & hy() const { return CGAL::get_pointee_or_identity(base)[1]; };
@@ -129,19 +129,19 @@ public:
 
 template < class R >
 inline
-bool
+typename R::Boolean
 VectorH2<R>::operator==( const Null_vector&) const
 { return (hx() == RT(0)) && (hy() == RT(0)); }
 
 template < class R >
 inline
-bool
+typename R::Boolean
 VectorH2<R>::operator!=( const Null_vector& v) const
 { return !(*this == v); }
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 VectorH2<R>::operator==( const VectorH2<R>& v) const
 {
   return (  (hx() * v.hw() == v.hx() * hw() )
@@ -150,7 +150,7 @@ VectorH2<R>::operator==( const VectorH2<R>& v) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 VectorH2<R>::operator!=( const VectorH2<R>& v) const
 { return !(*this == v); }  /* XXX */
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
index 56a0e2b9ad8..3bf8af6e68b 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
@@ -129,8 +129,8 @@ public:
 
   Vector_3 operator-() const;
 
-  bool  operator==( const VectorH3<R>& v) const;
-  bool  operator!=( const VectorH3<R>& v) const;
+  typename R::Boolean operator==( const VectorH3<R>& v) const;
+  typename R::Boolean operator!=( const VectorH3<R>& v) const;
 
   Vector_3 operator+( const VectorH3 &v) const;
   Vector_3 operator-( const VectorH3 &v) const;
@@ -171,7 +171,7 @@ VectorH3<R>::direction() const
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 VectorH3<R>::operator==( const VectorH3<R>& v) const
 {
  return ( (hx() * v.hw() == v.hx() * hw() )
@@ -181,7 +181,7 @@ VectorH3<R>::operator==( const VectorH3<R>& v) const
 
 template < class R >
 inline
-bool
+typename R::Boolean
 VectorH3<R>::operator!=( const VectorH3<R>& v) const
 { return !(*this == v); }
 
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH2.h
index 680c6dccc02..ccac644485b 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH2.h
@@ -24,7 +24,7 @@ namespace CGAL {
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-bool
+typename R::Boolean
 has_larger_distance_to_point(const PointH2<R>& p,
                               const PointH2<R>& q,
                               const PointH2<R>& r)
@@ -74,7 +74,7 @@ has_larger_distance_to_point(const PointH2<R>& p,
 
 template < class R>
 CGAL_KERNEL_INLINE
-Comparison_result
+typename R::Comparison_result
 compare_signed_distance_to_line(const LineH2<R>&  l,
                                 const PointH2<R>& p,
                                 const PointH2<R>& q)
@@ -111,7 +111,7 @@ compare_signed_distance_to_line(const LineH2<R>&  l,
 
 template < class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 has_larger_signed_distance_to_line(const LineH2<R>&  l,
                                     const PointH2<R>& p,
                                     const PointH2<R>& q)
@@ -140,7 +140,7 @@ has_larger_signed_distance_to_line(const LineH2<R>&  l,
 
 template < class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 has_smaller_signed_distance_to_line(const LineH2<R>&  l,
                                     const PointH2<R>& p,
                                     const PointH2<R>& q)
@@ -167,7 +167,7 @@ has_smaller_signed_distance_to_line(const LineH2<R>&  l,
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-Comparison_result
+typename R::Comparison_result
 compare_signed_distance_to_line(const PointH2<R>& p,
                                 const PointH2<R>& q,
                                 const PointH2<R>& r,
@@ -208,7 +208,7 @@ compare_signed_distance_to_line(const PointH2<R>& p,
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-bool
+typename R::Boolean
 has_smaller_signed_distance_to_line(const PointH2<R>& p,
                                     const PointH2<R>& q,
                                     const PointH2<R>& r,
@@ -241,7 +241,7 @@ has_smaller_signed_distance_to_line(const PointH2<R>& p,
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-bool
+typename R::Boolean
 has_larger_signed_distance_to_line(const PointH2<R>& p,
                                     const PointH2<R>& q,
                                     const PointH2<R>& r,
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH3.h
index ede98c97698..aacad83beb0 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/distance_predicatesH3.h
@@ -21,43 +21,43 @@
 namespace CGAL {
 
 template <class R>
-Comparison_result
+typename R::Comparison_result
 compare_distance_to_point(const PointH3<R>& ,
                           const PointH3<R>& ,
                           const PointH3<R>& );
 
 template <class R>
-bool
+typename R::Boolean
 has_larger_distance_to_point(const PointH3<R>& ,
                              const PointH3<R>& ,
                              const PointH3<R>& );
 
 template <class R>
-bool
+typename R::Boolean
 has_smaller_distance_to_point(const PointH3<R>& ,
                               const PointH3<R>& ,
                               const PointH3<R>& );
 
 template <class R>
-Comparison_result
+typename R::Comparison_result
 compare_signed_distance_to_plane(const PlaneH3<R>& ,
                                  const PointH3<R>& ,
                                  const PointH3<R>& );
 
 template <class R>
-bool
+typename R::Boolean
 has_larger_signed_distance_to_plane(const PlaneH3<R>& ,
                                     const PointH3<R>& ,
                                     const PointH3<R>& );
 
 template <class R>
-bool
+typename R::Boolean
 has_smaller_signed_distance_to_plane(const PlaneH3<R>&,
                                      const PointH3<R>& ,
                                      const PointH3<R>& );
 
 template <class R>
-Comparison_result
+typename R::Comparison_result
 compare_signed_distance_to_plane(const PointH3<R>& ,
                                  const PointH3<R>& ,
                                  const PointH3<R>& ,
@@ -65,7 +65,7 @@ compare_signed_distance_to_plane(const PointH3<R>& ,
                                  const PointH3<R>& );
 
 template <class R>
-bool
+typename R::Boolean
 has_larger_signed_distance_to_plane(const PointH3<R>& ,
                                     const PointH3<R>& ,
                                     const PointH3<R>& ,
@@ -73,7 +73,7 @@ has_larger_signed_distance_to_plane(const PointH3<R>& ,
                                     const PointH3<R>& );
 
 template <class R>
-bool
+typename R::Boolean
 has_smaller_signed_distance_to_plane(const PointH3<R>& ,
                                      const PointH3<R>& ,
                                      const PointH3<R>& ,
@@ -82,7 +82,7 @@ has_smaller_signed_distance_to_plane(const PointH3<R>& ,
 
 template <class R>
 CGAL_KERNEL_MEDIUM_INLINE
-Comparison_result
+typename R::Comparison_result
 compare_distance_to_point(const PointH3<R>& p,
                           const PointH3<R>& q,
                           const PointH3<R>& r)
@@ -121,7 +121,7 @@ compare_distance_to_point(const PointH3<R>& p,
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-bool
+typename R::Boolean
 has_larger_distance_to_point(const PointH3<R>& p,
                              const PointH3<R>& q,
                              const PointH3<R>& r)
@@ -157,7 +157,7 @@ has_larger_distance_to_point(const PointH3<R>& p,
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-bool
+typename R::Boolean
 has_smaller_distance_to_point(const PointH3<R>& p,
                               const PointH3<R>& q,
                               const PointH3<R>& r)
@@ -193,7 +193,7 @@ has_smaller_distance_to_point(const PointH3<R>& p,
 
 template < class R>
 CGAL_KERNEL_INLINE
-Comparison_result
+typename R::Comparison_result
 compare_signed_distance_to_plane(const PlaneH3<R>& pl,
                                  const PointH3<R>& p,
                                  const PointH3<R>& q)
@@ -227,7 +227,7 @@ compare_signed_distance_to_plane(const PlaneH3<R>& pl,
 }
 
 template <class R>
-bool
+typename R::Boolean
 has_larger_signed_distance_to_plane(const PlaneH3<R>& pl,
                                     const PointH3<R>& p,
                                     const PointH3<R>& q )
@@ -257,7 +257,7 @@ has_larger_signed_distance_to_plane(const PlaneH3<R>& pl,
 }
 
 template <class R>
-bool
+typename R::Boolean
 has_smaller_signed_distance_to_plane(const PlaneH3<R>& pl,
                                      const PointH3<R>& p,
                                      const PointH3<R>& q )
@@ -288,7 +288,7 @@ has_smaller_signed_distance_to_plane(const PlaneH3<R>& pl,
 
 template <class R>
 inline
-Comparison_result
+typename R::Comparison_result
 compare_signed_distance_to_plane(const PointH3<R>& p,
                                  const PointH3<R>& q,
                                  const PointH3<R>& r,
@@ -302,7 +302,7 @@ compare_signed_distance_to_plane(const PointH3<R>& p,
 
 template <class R>
 inline
-bool
+typename R::Boolean
 has_larger_signed_distance_to_plane(const PointH3<R>& p,
                                     const PointH3<R>& q,
                                     const PointH3<R>& r,
@@ -313,7 +313,7 @@ has_larger_signed_distance_to_plane(const PointH3<R>& p,
 
 template <class R>
 inline
-bool
+typename R::Boolean
 has_smaller_signed_distance_to_plane(const PointH3<R>& p,
                                      const PointH3<R>& q,
                                      const PointH3<R>& r,
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h b/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h
index b88aab964dc..00b6c05b1ad 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h
@@ -49,26 +49,27 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Angle_2
   {
+    typedef typename K::Angle               Angle;
     typedef typename K::Point_2             Point_2;
     typedef typename K::Vector_2            Vector_2;
     typedef typename K::Construct_vector_2  Construct_vector_2;
-    Construct_vector_2 c;
-  public:
-    typedef typename K::Angle               result_type;
 
+    Construct_vector_2 c;
+
+  public:
     Angle_2() {}
     Angle_2(const Construct_vector_2& c_) : c(c_) {}
 
-    result_type
+    Angle
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     { return operator()(c(q,p), c(q,r)); }
 
-    result_type
+    Angle
     operator()(const Point_2& p, const Point_2& q,
                const Point_2& r, const Point_2& s) const
     { return operator()(c(q,p), c(s,r)); }
 
-    result_type
+    Angle
     operator()(const Vector_2& u, const Vector_2& v) const
     { return enum_cast<Angle>(CGAL_NTS sign(u * v)); }
 
@@ -78,33 +79,34 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Angle_3
   {
+    typedef typename K::Angle               Angle;
     typedef typename K::Point_3             Point_3;
     typedef typename K::Vector_3            Vector_3;
     typedef typename K::Construct_vector_3  Construct_vector_3;
-    Construct_vector_3 c;
-  public:
-    typedef typename K::Angle               result_type;
 
+    Construct_vector_3 c;
+
+  public:
     Angle_3() {}
     Angle_3(const Construct_vector_3& c_) : c(c_) {}
 
-    result_type
+    Angle
     operator()(const Vector_3& u, const Vector_3& v) const
     { return enum_cast<Angle>(CGAL_NTS sign(u * v)); }
     // FIXME: scalar product
 
-    result_type
+    Angle
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     { return enum_cast<Angle>(CGAL_NTS sign(c(q,p) * c(q,r))); }
     // FIXME: scalar product
 
-    result_type
+    Angle
     operator()(const Point_3& p, const Point_3& q,
                const Point_3& r, const Point_3& s) const
     { return enum_cast<Angle>(CGAL_NTS sign(c(q,p) * c(s,r))); }
     // FIXME: scalar product
 
-    result_type
+    Angle
     operator()(const Point_3& p, const Point_3& q,
                const Point_3& r, const Vector_3& n) const
     {
@@ -116,14 +118,14 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Bounded_side_2
   {
+    typedef typename K::Bounded_side    Bounded_side;
     typedef typename K::Point_2         Point_2;
     typedef typename K::Circle_2        Circle_2;
     typedef typename K::Triangle_2      Triangle_2;
     typedef typename K::Iso_rectangle_2 Iso_rectangle_2;
-  public:
-    typedef typename K::Bounded_side    result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Circle_2& c, const Point_2& p) const
     {
       typename K::Compute_squared_distance_2 squared_distance;
@@ -131,7 +133,7 @@ namespace HomogeneousKernelFunctors {
                                                    squared_distance(c.center(),p)));
     }
 
-    result_type
+    Bounded_side
     operator()( const Triangle_2& t, const Point_2& p) const
     {
       typename K::Collinear_are_ordered_along_line_2
@@ -154,7 +156,7 @@ namespace HomogeneousKernelFunctors {
         : ON_UNBOUNDED_SIDE;
     }
 
-    result_type
+    Bounded_side
     operator()( const Iso_rectangle_2& r, const Point_2& p) const
     {
       return  r.rep().bounded_side(p);
@@ -164,20 +166,20 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Bounded_side_3
   {
+    typedef typename K::Bounded_side    Bounded_side;
     typedef typename K::RT              RT;
     typedef typename K::Point_3         Point_3;
     typedef typename K::Vector_3        Vector_3;
     typedef typename K::Sphere_3        Sphere_3;
     typedef typename K::Tetrahedron_3   Tetrahedron_3;
     typedef typename K::Iso_cuboid_3    Iso_cuboid_3;
-  public:
-    typedef typename K::Bounded_side    result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.rep().bounded_side(p); }
 
-    result_type
+    Bounded_side
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     {
       Vector_3 v1 = t.vertex(1)-t.vertex(0);
@@ -250,7 +252,7 @@ namespace HomogeneousKernelFunctors {
       return (t5 && t6) ? ON_BOUNDED_SIDE : ON_BOUNDARY;
     }
 
-    result_type
+    Bounded_side
     operator()( const Iso_cuboid_3& c, const Point_3& p) const
     { return c.rep().bounded_side(p); }
   };
@@ -258,21 +260,21 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Collinear_are_ordered_along_line_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::RT              RT;
     typedef typename K::Point_2         Point_2;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Collinear_2 Collinear_2;
     Collinear_2 c;
 #endif // CGAL_kernel_exactness_preconditions
-  public:
-    typedef typename K::Boolean         result_type;
 
+  public:
 #ifdef CGAL_kernel_exactness_preconditions
     Collinear_are_ordered_along_line_2() {}
     Collinear_are_ordered_along_line_2(const Collinear_2& c_) : c(c_) {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       CGAL_kernel_exactness_precondition( c(p, q, r) );
@@ -309,20 +311,20 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Collinear_are_ordered_along_line_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Collinear_3 Collinear_3;
     Collinear_3 c;
 #endif // CGAL_kernel_exactness_preconditions
-  public:
-    typedef typename K::Boolean         result_type;
 
+  public:
 #ifdef CGAL_kernel_exactness_preconditions
     Collinear_are_ordered_along_line_3() {}
     Collinear_are_ordered_along_line_3(const Collinear_3& c_) : c(c_) {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       CGAL_kernel_exactness_precondition( c(p, q, r) );
@@ -390,21 +392,21 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Collinear_are_strictly_ordered_along_line_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_2         Point_2;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Collinear_2 Collinear_2;
     Collinear_2 c;
 #endif // CGAL_kernel_exactness_preconditions
-  public:
-    typedef typename K::Boolean         result_type;
 
+  public:
 #ifdef CGAL_kernel_exactness_preconditions
     Collinear_are_strictly_ordered_along_line_2() {}
     Collinear_are_strictly_ordered_along_line_2(const Collinear_2& c_) : c(c_)
     {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       CGAL_kernel_exactness_precondition( c(p, q, r) );
@@ -440,22 +442,22 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Collinear_are_strictly_ordered_along_line_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
     typedef typename K::Direction_3     Direction_3;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Collinear_3 Collinear_3;
     Collinear_3 c;
 #endif // CGAL_kernel_exactness_preconditions
-  public:
-    typedef typename K::Boolean         result_type;
 
+  public:
 #ifdef CGAL_kernel_exactness_preconditions
     Collinear_are_strictly_ordered_along_line_3() {}
     Collinear_are_strictly_ordered_along_line_3(const Collinear_3& c_) : c(c_)
     {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       CGAL_kernel_exactness_precondition( c(p, q, r) );
@@ -469,6 +471,7 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Collinear_has_on_2
   {
+    typedef typename K::Boolean               Boolean;
     typedef typename K::Point_2               Point_2;
     typedef typename K::Direction_2           Direction_2;
     typedef typename K::Ray_2                 Ray_2;
@@ -480,23 +483,22 @@ namespace HomogeneousKernelFunctors {
     Collinear_are_ordered_along_line_2 co;
     Construct_point_on_2 cp;
     Compare_xy_2 cxy;
-  public:
-    typedef typename K::Boolean               result_type;
 
+  public:
     Collinear_has_on_2() {}
     Collinear_has_on_2(const Construct_point_on_2& cp_,
                        const Compare_xy_2& cxy_)
       : cp(cp_), cxy(cxy_)
     {}
 
-    result_type
+    Boolean
     operator()( const Ray_2& r, const Point_2& p) const
     {
       const Point_2 & source = cp(r,0);
       return p == source || Direction_2(p - source) == r.direction();
     } // FIXME
 
-    result_type
+    Boolean
     operator()( const Segment_2& s, const Point_2& p) const
     {
       return co(cp(s,0), p, cp(s,1));
@@ -506,16 +508,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Collinear_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Orientation_2  Orientation_2;
-    Orientation_2 o;
-  public:
-    typedef typename K::Boolean        result_type;
 
+    Orientation_2 o;
+
+  public:
     Collinear_2() {}
     Collinear_2(const Orientation_2 o_) : o(o_) {}
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       typedef typename K::RT RT;
@@ -558,13 +561,13 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_angle_with_x_axis_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Vector_2           Vector_2;
     typedef typename K::Direction_2        Direction_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Direction_2& d1, const Direction_2& d2) const
     {
       typedef typename K::RT  RT;
@@ -625,11 +628,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_distance_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       typedef typename K::RT RT;
@@ -673,14 +676,14 @@ namespace HomogeneousKernelFunctors {
     }
 
     template <class T1, class T2, class T3>
-    result_type
+    Comparison_result
     operator()(const T1& p, const T2& q, const T3& r) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(p, r));
     }
 
     template <class T1, class T2, class T3, class T4>
-    result_type
+    Comparison_result
     operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(r, s));
@@ -690,11 +693,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_distance_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       typedef typename K::RT RT;
@@ -724,16 +727,15 @@ namespace HomogeneousKernelFunctors {
       return CGAL_NTS sign(dosd);
     }
 
-
     template <class T1, class T2, class T3>
-    result_type
+    Comparison_result
     operator()(const T1& p, const T2& q, const T3& r) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(p, r));
     }
 
     template <class T1, class T2, class T3, class T4>
-    result_type
+    Comparison_result
     operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
     {
       return CGAL::compare(squared_distance(p, q), squared_distance(r, s));
@@ -743,13 +745,11 @@ namespace HomogeneousKernelFunctors {
   template < typename K >
   class Compare_power_distance_2
   {
-  public:
+    typedef typename K::Comparison_result        Comparison_result;
     typedef typename K::Weighted_point_2         Weighted_point_2;
     typedef typename K::Point_2                  Point_2;
-    typedef typename K::Comparison_result        Comparison_result;
-
-    typedef Comparison_result   result_type;
 
+  public:
     Comparison_result operator()(const Point_2& r,
                                  const Weighted_point_2& p,
                                  const Weighted_point_2& q) const
@@ -763,14 +763,13 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_signed_distance_to_line_2
   {
-    typedef typename K::Point_2   Point_2;
-    typedef typename K::Line_2    Line_2;
+    typedef typename K::Comparison_result     Comparison_result;
+    typedef typename K::Point_2               Point_2;
+    typedef typename K::Line_2                Line_2;
     typedef typename K::Less_signed_distance_to_line_2 Less_signed_distance_to_line_2;
 
   public:
-    typedef Comparison_result   result_type;
-
-    result_type
+    Comparison_result
     operator()(const Point_2& p, const Point_2& q,
                const Point_2& r, const Point_2& s) const
     {
@@ -796,7 +795,7 @@ namespace HomogeneousKernelFunctors {
       return compare(scaled_dist_r_minus_scaled_dist_s, 0);
     }
 
-    result_type
+    Comparison_result
     operator()(const Line_2& l, const Point_2& p, const Point_2& q) const
     {
       Less_signed_distance_to_line_2 less = K().less_signed_distance_to_line_2_object();
@@ -809,13 +808,13 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_slope_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Line_2             Line_2;
     typedef typename K::Segment_2          Segment_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Line_2& l1, const Line_2& l2) const
     {
       if (l1.is_horizontal())
@@ -840,22 +839,22 @@ namespace HomogeneousKernelFunctors {
                             CGAL::abs(l1.a() * l2.b()) );
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()(const Segment_2& s1, const Segment_2& s2) const
     {
       return (*this)(s1.source(), s1.target(),
                      s2.source(), s2.target());
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_2& s1s, const Point_2& s1t, const Point_2& s2s, const Point_2& s2t) const
     {
       typedef typename K::FT        FT;
 
-      typename K::Comparison_result cmp_y1 = compare_y(s1s, s1t);
+      Comparison_result cmp_y1 = compare_y(s1s, s1t);
       if (cmp_y1 == EQUAL) // horizontal
         {
-          typename K::Comparison_result cmp_x2 = compare_x(s2s, s2t);
+          Comparison_result cmp_x2 = compare_x(s2s, s2t);
 
           if (cmp_x2 == EQUAL) return SMALLER;
           FT s_hw = s2s.hw();
@@ -864,10 +863,10 @@ namespace HomogeneousKernelFunctors {
                    CGAL_NTS sign(s2s.hx()*t_hw - s2t.hx()*s_hw);
         }
 
-      typename K::Comparison_result cmp_y2 = compare_y(s2s, s2t);
+      Comparison_result cmp_y2 = compare_y(s2s, s2t);
       if (cmp_y2 == EQUAL)
         {
-          typename K::Comparison_result cmp_x1 = compare_x(s1s, s1t);
+          Comparison_result cmp_x1 = compare_x(s1s, s1t);
 
           if (cmp_x1 == EQUAL) return LARGER;
           FT s_hw = s1s.hw();
@@ -876,8 +875,8 @@ namespace HomogeneousKernelFunctors {
                  CGAL_NTS sign(s1s.hx()*t_hw - s1t.hx()*s_hw);
         }
 
-      typename K::Comparison_result cmp_x1 = compare_x(s1s, s1t);
-      typename K::Comparison_result cmp_x2 = compare_x(s2s, s2t);
+      Comparison_result cmp_x1 = compare_x(s1s, s1t);
+      Comparison_result cmp_x2 = compare_x(s2s, s2t);
       if (cmp_x1 == EQUAL)
         return cmp_x2 == EQUAL ? EQUAL : LARGER;
 
@@ -909,12 +908,12 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_x_at_y_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Line_2             Line_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h) const
     {
       typedef typename K::RT RT;
@@ -927,17 +926,17 @@ namespace HomogeneousKernelFunctors {
       return ( ors == ON_NEGATIVE_SIDE ) ? SMALLER : EQUAL;
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h1, const Line_2& h2) const
     { return CGAL::compare(h1.x_at_y( p.y() ), h2.x_at_y( p.y() )); }
     // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2, const Line_2& h) const
     { return compare_x_at_y( gp_linear_intersection( l1, l2 ), h); }
     // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     { return compare_x_at_y( gp_linear_intersection( l1, l2 ), h1, h2 ); }
@@ -947,11 +946,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_xyz_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     {
       typedef typename K::RT RT;
@@ -986,11 +985,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_xy_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     {
       typedef typename K::RT RT;
@@ -1016,11 +1015,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_yx_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     {
       typedef typename K::RT RT;
@@ -1046,11 +1045,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_xy_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     {
       typedef typename K::RT RT;
@@ -1074,31 +1073,31 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_x_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Line_2             Line_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     {
       return CGAL::compare(p.hx()*q.hw(), q.hx()*p.hw());
     }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& l1, const Line_2& l2) const
     {
       Point_2 ip = gp_linear_intersection( l1, l2 );
       return this->operator()(p, ip);
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l, const Line_2& h1, const Line_2& h2) const
     {
       return this->operator()(l, h1, l, h2);
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     {
@@ -1111,11 +1110,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_x_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return CGAL::compare(p.hx() * q.hw(), q.hx() * p.hw() ); }
   };
@@ -1123,13 +1122,13 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_y_at_x_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Line_2             Line_2;
     typedef typename K::Segment_2          Segment_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h) const
     {
       CGAL_kernel_precondition( ! h.is_vertical() );
@@ -1139,23 +1138,23 @@ namespace HomogeneousKernelFunctors {
       return ors;
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& h1, const Line_2& h2) const
     { return CGAL::compare(h1.y_at_x( p.x() ), h2.y_at_x( p.x() )); }
     // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2, const Line_2& h) const
     { return compare_y_at_x( gp_linear_intersection( l1, l2 ), h); }
     // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     { return compare_y_at_x( gp_linear_intersection( l1, l2 ), h1, h2 ); }
     // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Segment_2& s) const
     {
       // compares the y-coordinates of p and the vertical projection of p on s.
@@ -1183,7 +1182,7 @@ namespace HomogeneousKernelFunctors {
       }
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p,
                 const Segment_2& s1, const Segment_2& s2) const
     {
@@ -1243,12 +1242,12 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_y_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_2            Point_2;
     typedef typename K::Line_2             Line_2;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_2& p, const Point_2& q) const
     {
       typedef typename K::RT RT;
@@ -1260,20 +1259,20 @@ namespace HomogeneousKernelFunctors {
       return CGAL::compare(phy * qhw, qhy * phw);
     }
 
-    result_type
+    Comparison_result
     operator()( const Point_2& p, const Line_2& l1, const Line_2& l2) const
     {
       Point_2 ip = gp_linear_intersection( l1, l2 );
       return compare_y( p, ip );
     } // FIXME
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l, const Line_2& h1, const Line_2& h2) const
     {
       return this->operator()(l, h1, l, h2);
     }
 
-    result_type
+    Comparison_result
     operator()( const Line_2& l1, const Line_2& l2,
                 const Line_2& h1, const Line_2& h2) const
     {
@@ -1286,11 +1285,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_y_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return CGAL::compare(p.hy() * q.hw(), q.hy() * p.hw() ); }
   };
@@ -1298,11 +1297,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compare_z_3
   {
+    typedef typename K::Comparison_result   Comparison_result;
     typedef typename K::Point_3             Point_3;
-  public:
-    typedef typename K::Comparison_result   result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()( const Point_3& p, const Point_3& q) const
     { return CGAL::compare(p.hz() * q.hw(), q.hz() * p.hw() ); }
   };
@@ -1317,10 +1316,10 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_2           Point_2;
     typedef typename K::Vector_2          Vector_2;
     typedef typename K::Construct_vector_2 Construct_vector_2;
-    Construct_vector_2 co;
-  public:
-    typedef FT               result_type;
 
+    Construct_vector_2 co;
+
+  public:
     FT
     operator()( const Point_2& p, const Point_2& q, const Point_2& r ) const
     {
@@ -1346,10 +1345,9 @@ namespace HomogeneousKernelFunctors {
   {
     typedef typename K::FT                FT;
     typedef typename K::Vector_2          Vector_2;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Vector_2& v, const Vector_2& w) const
     {
         return determinant(v.hx(), v.hy(),
@@ -1362,10 +1360,9 @@ namespace HomogeneousKernelFunctors {
   {
     typedef typename K::FT                FT;
     typedef typename K::Vector_3          Vector_3;
-  public:
-    typedef FT               result_type;
 
-    result_type
+  public:
+    FT
     operator()(const Vector_3& v, const Vector_3& w, const Vector_3& t) const
     {
         return determinant(v.hx(), v.hy(), v.hz(),
@@ -1381,9 +1378,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::RT                RT;
     typedef typename K::FT                FT;
     typedef typename K::Vector_2          Vector_2;
-  public:
-    typedef FT               result_type;
 
+  public:
     FT
     operator()(const Vector_2& v, const Vector_2& w) const
     {
@@ -1398,9 +1394,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::RT                RT;
     typedef typename K::FT                FT;
     typedef typename K::Vector_3          Vector_3;
-  public:
-    typedef FT               result_type;
 
+  public:
     FT
     operator()(const Vector_3& v, const Vector_3& w) const
     {
@@ -1416,10 +1411,9 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT          FT;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Circle_2    Circle_2;
-  public:
-    typedef FT               result_type;
 
-    FT
+  public:
+    decltype(auto)
     operator()( const Circle_2& c) const
     { return c.rep().squared_radius(); }
 
@@ -1446,10 +1440,9 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT          FT;
     typedef typename K::Point_3     Point_3;
     typedef typename K::Sphere_3    Sphere_3;
-  public:
-    typedef FT               result_type;
 
-    FT
+  public:
+    decltype(auto)
     operator()( const Sphere_3& s) const
     { return s.rep().squared_radius(); }
 
@@ -1486,9 +1479,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Vector_3       Vector_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
     typedef typename K::Iso_cuboid_3   Iso_cuboid_3;
-  public:
-    typedef FT               result_type;
 
+  public:
     FT
     operator()(const Point_3& p0, const Point_3& p1,
                const Point_3& p2, const Point_3& p3) const
@@ -1531,20 +1523,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_x_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2        Vector_2;
 
   public:
-    typedef FT               result_type;
-
-    FT
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().x();
     }
 
-    FT
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().x();
@@ -1554,20 +1543,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_x_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3        Vector_3;
 
   public:
-    typedef FT               result_type;
-
-    FT
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().x();
     }
 
-    FT
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().x();
@@ -1577,20 +1563,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_y_2
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2        Vector_2;
 
   public:
-    typedef FT               result_type;
-
-    FT
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().y();
     }
 
-    FT
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().y();
@@ -1600,20 +1583,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_y_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3        Vector_3;
 
   public:
-    typedef FT               result_type;
-
-    FT
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().y();
     }
 
-    FT
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().y();
@@ -1623,20 +1603,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_z_3
   {
-    typedef typename K::FT             FT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3        Vector_3;
 
   public:
-    typedef FT               result_type;
-
-    FT
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().z();
     }
 
-    FT
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().z();
@@ -1646,13 +1623,10 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_dx_2
   {
-    typedef typename K::RT                 RT;
     typedef typename K::Direction_2        Direction_2;
 
   public:
-    typedef const RT&                      result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_2& d) const
     {
       return d.rep().dx();
@@ -1662,13 +1636,10 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_dx_3
   {
-    typedef typename K::RT                 RT;
     typedef typename K::Direction_3        Direction_3;
 
   public:
-    typedef const RT&                      result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_3& d) const
     {
       return d.rep().dx();
@@ -1678,13 +1649,10 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_dy_2
   {
-    typedef typename K::RT             RT;
     typedef typename K::Direction_2        Direction_2;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_2& d) const
     {
       return d.rep().dy();
@@ -1694,13 +1662,10 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_dy_3
   {
-    typedef typename K::RT             RT;
     typedef typename K::Direction_3        Direction_3;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_3& d) const
     {
       return d.rep().dy();
@@ -1710,13 +1675,10 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_dz_3
   {
-    typedef typename K::RT             RT;
     typedef typename K::Direction_3        Direction_3;
 
   public:
-    typedef const RT&               result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Direction_3& d) const
     {
       return d.rep().dz();
@@ -1726,21 +1688,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hx_2
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2        Vector_2;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().hx();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().hx();
@@ -1750,21 +1708,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hx_3
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3        Vector_3;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hx();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hx();
@@ -1774,21 +1728,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hy_2
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().hy();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().hy();
@@ -1798,21 +1748,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hy_3
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const RT   &               result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hy();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hy();
@@ -1822,21 +1768,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hz_3
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hz();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hz();
@@ -1846,21 +1788,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hw_2
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Vector_2       Vector_2;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_2& p) const
     {
       return p.rep().hw();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_2& v) const
     {
       return v.rep().hw();
@@ -1870,21 +1808,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Compute_hw_3
   {
-    typedef typename K::FT             FT;
-    typedef typename K::RT             RT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
 
   public:
-    typedef const RT&                  result_type;
-
-    result_type
+    decltype(auto)
     operator()(const Point_3& p) const
     {
       return p.rep().hw();
     }
 
-    result_type
+    decltype(auto)
     operator()(const Vector_3& v) const
     {
       return v.rep().hw();
@@ -1898,11 +1832,11 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Plane_3    Plane_3;
     typedef typename K::RT         RT;
     typedef typename K::Construct_orthogonal_vector_3
+
     Construct_orthogonal_vector_3;
     Construct_orthogonal_vector_3 co;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Construct_base_vector_3() {}
     Construct_base_vector_3(const Construct_orthogonal_vector_3& co_)
       : co(co_)
@@ -1951,9 +1885,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Triangle_2       Triangle_2;
     typedef typename K::Circle_2         Circle_2;
-  public:
-    typedef Bbox_2           result_type;
 
+  public:
     Bbox_2
     operator()( const Point_2& p) const
     {
@@ -2016,9 +1949,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
     typedef typename K::Sphere_3         Sphere_3;
-  public:
-    typedef Bbox_3           result_type;
 
+  public:
     Bbox_3
     operator()(const Point_3& p) const
     {
@@ -2091,12 +2023,10 @@ namespace HomogeneousKernelFunctors {
   class Construct_bisector_2
   {
     typedef typename K::RT      RT;
-    typedef typename K::FT      FT;
     typedef typename K::Point_2 Point_2;
     typedef typename K::Line_2  Line_2;
-  public:
-    typedef Line_2           result_type;
 
+  public:
     Line_2
     operator()(const Point_2& p, const Point_2& q) const
     {
@@ -2134,12 +2064,10 @@ namespace HomogeneousKernelFunctors {
   class Construct_bisector_3
   {
     typedef typename K::RT      RT;
-    typedef typename K::FT      FT;
     typedef typename K::Point_3 Point_3;
     typedef typename K::Plane_3 Plane_3;
-  public:
-    typedef Plane_3          result_type;
 
+  public:
     Plane_3
     operator()(const Point_3& p, const Point_3& q) const
     {
@@ -2180,16 +2108,14 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Construct_centroid_2
   {
-    typedef typename K::FT          FT;
+    typedef typename K::RT          RT;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Triangle_2  Triangle_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
-      typedef typename K::RT  RT;
       const RT phw(p.hw());
       const RT qhw(q.hw());
       const RT rhw(r.hw());
@@ -2230,9 +2156,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_3        Point_3;
     typedef typename K::Triangle_3     Triangle_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
-  public:
-    typedef Point_3          result_type;
 
+  public:
     Point_3
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
@@ -2281,12 +2206,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Construct_circumcenter_2
   {
-    typedef typename K::FT          FT;
+    typedef typename K::RT          RT;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Triangle_2  Triangle_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()(const Point_2& p, const Point_2& q) const
     {
@@ -2297,7 +2221,6 @@ namespace HomogeneousKernelFunctors {
     Point_2
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
-      typedef typename K::RT RT;
       const RT & phx = p.hx();
       const RT & phy = p.hy();
       const RT & phw = p.hw();
@@ -2361,14 +2284,13 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Construct_circumcenter_3
   {
-    typedef typename K::FT             FT;
+    typedef typename K::RT             RT;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Triangle_3     Triangle_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
     typedef typename K::Plane_3        Plane_3;
-  public:
-    typedef Point_3          result_type;
 
+  public:
     Point_3
     operator()(const Point_3& p, const Point_3& q) const
     {
@@ -2394,8 +2316,6 @@ namespace HomogeneousKernelFunctors {
     operator()(const Point_3& p, const Point_3& q,
                const Point_3& r, const Point_3& s) const
     {
-      typedef typename K::RT RT;
-
       RT phw( p.hw() );
       RT qhw( q.hw() );
       RT rhw( r.hw() );
@@ -2468,9 +2388,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_cross_product_vector_3
   {
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()(const Vector_3& a, const Vector_3& b) const
     {
@@ -2485,9 +2404,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_difference_of_vectors_2
   {
     typedef typename K::Vector_2  Vector_2;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Vector_2
     operator()(const Vector_2& v, const Vector_2& w) const
     {
@@ -2501,9 +2419,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_difference_of_vectors_3
   {
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()(const Vector_3& v, const Vector_3& w) const
     {
@@ -2528,8 +2445,6 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::RT              RT;
 
   public:
-    typedef Direction_2       result_type;
-
     Rep // Direction_2
     operator()(Return_base_tag, const RT& x, const RT& y) const
     { return Rep(x, y); }
@@ -2595,9 +2510,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Segment_3       Segment_3;
     typedef typename K::RT              RT;
     typedef typename Direction_3::Rep   Rep;
-  public:
-    typedef Direction_3       result_type;
 
+  public:
     Rep // Direction_3
     operator()(Return_base_tag, const RT& x, const RT& y, const RT& z) const
     { return Rep(x, y, z); }
@@ -2646,9 +2560,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_sum_of_vectors_2
   {
     typedef typename K::Vector_2  Vector_2;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Vector_2
     operator()(const Vector_2& v, const Vector_2& w) const
     {
@@ -2662,9 +2575,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_sum_of_vectors_3
   {
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()(const Vector_3& v, const Vector_3& w) const
     {
@@ -2681,9 +2593,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT FT;
     typedef typename K::RT RT;
     typedef typename K::Vector_2  Vector_2;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Vector_2
     operator()(const Vector_2& v, const FT& f ) const
     {
@@ -2704,9 +2615,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT FT;
     typedef typename K::RT RT;
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()(const Vector_3& v, const FT& f ) const
     {
@@ -2732,8 +2642,6 @@ namespace HomogeneousKernelFunctors {
     typedef typename Iso_rectangle_2::Rep     Rep;
 
   public:
-    typedef Iso_rectangle_2   result_type;
-
     Rep // Iso_rectangle_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q, int) const
     {
@@ -2851,9 +2759,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_2                    Point_2;
     typedef typename K::Point_3                    Point_3;
     typedef typename K::Plane_3                    Plane_3;
-  public:
-    typedef Point_3          result_type;
 
+  public:
     Point_3
     operator()(const Plane_3& h, const Point_2& p) const
     {
@@ -2875,10 +2782,10 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Line_2                    Line_2;
     typedef typename Line_2::Rep                  Rep;
     typedef typename K::Construct_point_on_2      Construct_point_on_2;
-    Construct_point_on_2 cp;
-  public:
-    typedef Line_2            result_type;
 
+    Construct_point_on_2 cp;
+
+  public:
     Construct_line_2() {}
     Construct_line_2(const Construct_point_on_2& cp_) : cp(cp_) {}
 
@@ -2958,9 +2865,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT        FT;
     typedef typename K::Point_2   Point_2;
     typedef typename K::Segment_2 Segment_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()(const Point_2& p, const Point_2& q) const
     {
@@ -2992,9 +2898,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT        FT;
     typedef typename K::Point_3   Point_3;
     typedef typename K::Segment_3 Segment_3;
-  public:
-    typedef Point_3          result_type;
 
+  public:
     Point_3
     operator()(const Point_3& p, const Point_3& q) const
     {
@@ -3027,9 +2932,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_opposite_vector_2
   {
     typedef typename K::Vector_2    Vector_2;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v) const
     { return Vector_2(-v.hx(), -v.hy(), v.hw()); }
@@ -3039,9 +2943,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_opposite_vector_3
   {
     typedef typename K::Vector_3    Vector_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& v) const
     { return Vector_3(-v.hx(), -v.hy(), -v.hz(), v.hw()); }
@@ -3053,9 +2956,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_3     Point_3;
     typedef typename K::Vector_3    Vector_3;
     typedef typename K::Plane_3     Plane_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()( const Plane_3& p ) const
     { return p.rep().orthogonal_vector(); }
@@ -3071,9 +2973,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_perpendicular_vector_2
   {
     typedef typename K::Vector_2   Vector_2;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, Orientation o) const
     {
@@ -3089,9 +2990,8 @@ namespace HomogeneousKernelFunctors {
   class Construct_perpendicular_direction_2
   {
     typedef typename K::Direction_2   Direction_2;
-  public:
-    typedef Direction_2      result_type;
 
+  public:
     Direction_2
     operator()( const Direction_2& d, Orientation o) const
     {
@@ -3110,9 +3010,8 @@ namespace HomogeneousKernelFunctors {
   {
     typedef typename K::Line_2    Line_2;
     typedef typename K::Point_2   Point_2;
-  public:
-    typedef Line_2           result_type;
 
+  public:
     Line_2
     operator()( const Line_2& l, const Point_2& p) const
     { return typename K::Line_2( -l.b()*p.hw(), l.a()*p.hw(), l.b()*p.hx() - l.a()*p.hy()); }
@@ -3128,23 +3027,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Vector_2   Vector_2;
     typedef typename K::Line_2     Line_2;
     typedef typename Point_2::Rep  Rep;
+
   public:
-
-    template<typename>
-    struct result {
-      typedef Point_2 type;
-    };
-
-    template<typename F>
-    struct result<F(Weighted_point_2)> {
-      typedef const Point_2& type;
-    };
-
-    template<typename F>
-    struct result<F(Point_2)> {
-      typedef const Point_2& type;
-    };
-
     Rep // Point_2
     operator()(Return_base_tag, Origin o) const
     { return Rep(o); }
@@ -3193,7 +3077,7 @@ namespace HomogeneousKernelFunctors {
     operator()(const Point_2 & p) const
     { return p; }
 
-    const Point_2&
+    decltype(auto)
     operator()(const Weighted_point_2 & p) const
     { return p.rep().point(); }
 
@@ -3221,22 +3105,6 @@ namespace HomogeneousKernelFunctors {
     typedef typename Point_3::Rep  Rep;
 
   public:
-
-  template<typename>
-    struct result {
-      typedef Point_3 type;
-    };
-
-    template<typename F>
-    struct result<F(Weighted_point_3)> {
-      typedef const Point_3& type;
-    };
-
-    template<typename F>
-    struct result<F(Point_3)> {
-      typedef const Point_3& type;
-    };
-
     Rep // Point_3
     operator()(Return_base_tag, Origin o) const
     { return Rep(o); }
@@ -3258,7 +3126,7 @@ namespace HomogeneousKernelFunctors {
     operator()(const Point_3 & p) const
     { return p; }
 
-    const Point_3&
+    decltype(auto)
     operator()(const Weighted_point_3 & p) const
     { return p.rep().point(); }
 
@@ -3288,9 +3156,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_2            Point_2;
     typedef typename K::Weighted_point_2   Weighted_point_2;
     typedef typename Weighted_point_2::Rep Rep;
-  public:
-    typedef Weighted_point_2               result_type;
 
+  public:
     Rep
     operator()(Return_base_tag, Origin o) const
     { return Rep(o); }
@@ -3331,9 +3198,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_3            Point_3;
     typedef typename K::Weighted_point_3   Weighted_point_3;
     typedef typename Weighted_point_3::Rep Rep;
-  public:
-    typedef Weighted_point_3               result_type;
 
+  public:
     Rep
     operator()(Return_base_tag, Origin o) const
     { return Rep(o); }
@@ -3373,9 +3239,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_2     Point_2;
     typedef typename K::Direction_2 Direction_2;
     typedef typename K::Line_2      Line_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()( const Line_2& l, const Point_2& p ) const
     {
@@ -3400,16 +3265,6 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Ray_3      Ray_3;
 
   public:
-    template<typename>
-    struct result {
-      typedef const Point_3 type;
-    };
-
-    template<typename F>
-    struct result<F(Point_3, Point_3)> {
-      typedef const Point_3& type;
-    };
-
     Point_3
     operator()( const Line_3& l, const Point_3& p ) const
     {
@@ -3432,7 +3287,7 @@ namespace HomogeneousKernelFunctors {
       return l.point() + ( (lambda_num * dir)/lambda_den );
     }
 
-    Point_3
+    decltype(auto)
     operator()( const Plane_3& h, const Point_3& p ) const
     { return h.rep().projection(p); }
 
@@ -3462,10 +3317,7 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT                FT;
 
   public:
-
-    typedef Line_2 result_type;
-
-    result_type
+    Line_2
     operator() (const Circle_2 & c1, const Circle_2 & c2) const
     {
       // Concentric Circles don't have radical line
@@ -3494,10 +3346,7 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT                 FT;
 
   public:
-
-    typedef Plane_3 result_type;
-
-    result_type
+    Plane_3
     operator() (const Sphere_3 & s1, const Sphere_3 & s2) const
     {
       // Concentric Spheres don't have radical plane
@@ -3527,9 +3376,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::RT         RT;
     typedef typename K::FT         FT;
     typedef typename K::Vector_2   Vector_2;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Vector_2
     operator()( const Vector_2& v, const RT& c) const
     {
@@ -3549,9 +3397,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::RT         RT;
     typedef typename K::FT         FT;
     typedef typename K::Vector_3   Vector_3;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Vector_3
     operator()( const Vector_3& v, const RT& c) const
     {
@@ -3570,9 +3417,8 @@ namespace HomogeneousKernelFunctors {
   {
     typedef typename K::Point_2   Point_2;
     typedef typename K::Vector_2  Vector_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()( const Point_2& p, const Vector_2& v) const
     {
@@ -3593,9 +3439,8 @@ namespace HomogeneousKernelFunctors {
   {
     typedef typename K::Point_3   Point_3;
     typedef typename K::Vector_3  Vector_3;
-  public:
-    typedef Point_3          result_type;
 
+  public:
     Point_3
     operator()( const Point_3& p, const Vector_3& v) const
     {
@@ -3624,9 +3469,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Point_2      Point_2;
     typedef typename K::Direction_2  Direction_2;
     typedef typename Vector_2::Rep   Rep;
-  public:
-    typedef Vector_2         result_type;
 
+  public:
     Rep // Vector_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q) const
     {
@@ -3731,9 +3575,8 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Vector_3     Vector_3;
     typedef typename K::Point_3      Point_3;
     typedef typename Vector_3::Rep   Rep;
-  public:
-    typedef Vector_3         result_type;
 
+  public:
     Rep // Vector_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q) const
     {
@@ -3835,22 +3678,13 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Segment_2        Segment_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Triangle_2       Triangle_2;
+
   public:
-    template<typename>
-    struct result {
-      typedef const Point_2& type;
-    };
-
-    template<typename F>
-    struct result<F(Iso_rectangle_2, int)> {
-      typedef Point_2 type;
-    };
-
-    const Point_2 &
+    decltype(auto)
     operator()( const Segment_2& s, int i) const
     { return s.vertex(i); }
 
-    const Point_2 &
+    decltype(auto)
     operator()( const Triangle_2& t, int i) const
     { return t.rep().vertex(i); }
 
@@ -3871,14 +3705,10 @@ namespace HomogeneousKernelFunctors {
     }
   };
 
-} //namespace HomogeneousKernelFunctors
-
-
-namespace HomogeneousKernelFunctors {
-
   template <typename K>
   class Coplanar_orientation_3
   {
+    typedef typename K::Orientation  Orientation;
     typedef typename K::Point_3      Point_3;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Coplanar_3   Coplanar_3;
@@ -3887,7 +3717,6 @@ namespace HomogeneousKernelFunctors {
     Collinear_3 cl;
 #endif // CGAL_kernel_exactness_preconditions
   public:
-    typedef typename K::Orientation  result_type;
 
 #ifdef CGAL_kernel_exactness_preconditions
     Coplanar_orientation_3() {}
@@ -3895,7 +3724,7 @@ namespace HomogeneousKernelFunctors {
       : cp(cp_), cl(cl_) {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Orientation
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       Orientation oxy_pqr = sign_of_determinant(p.hx(), p.hy(), p.hw(),
@@ -3915,7 +3744,7 @@ namespace HomogeneousKernelFunctors {
                                     r.hx(), r.hz(), r.hw());
     }
 
-    result_type
+    Orientation
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     {
@@ -3960,6 +3789,7 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Coplanar_side_of_bounded_circle_3
   {
+    typedef typename K::Bounded_side  Bounded_side;
     typedef typename K::Point_3   Point_3;
 #ifdef CGAL_kernel_exactness_preconditions
     typedef typename K::Coplanar_3   Coplanar_3;
@@ -3968,7 +3798,6 @@ namespace HomogeneousKernelFunctors {
     Collinear_3 cl;
 #endif // CGAL_kernel_exactness_preconditions
   public:
-    typedef typename K::Bounded_side  result_type;
 
 #ifdef CGAL_kernel_exactness_preconditions
     Coplanar_side_of_bounded_circle_3() {}
@@ -3977,7 +3806,7 @@ namespace HomogeneousKernelFunctors {
       : cp(cp_), cl(cl_) {}
 #endif // CGAL_kernel_exactness_preconditions
 
-    result_type
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& t) const
     {
@@ -3995,11 +3824,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Equal_xy_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     {
       return   (p.hx() * q.hw() == q.hx() * p.hw() )
@@ -4010,11 +3839,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Equal_x_2
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_2    Point_2;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return p.hx()*q.hw() == q.hx()*p.hw(); }
   };
@@ -4022,11 +3851,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Equal_x_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.hx()*q.hw() == q.hx()*p.hw(); }
   };
@@ -4034,11 +3863,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Equal_y_2
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_2    Point_2;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return p.hy()*q.hw() == q.hy()*p.hw(); }
   };
@@ -4046,11 +3875,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Equal_y_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.hy()*q.hw() == q.hy()*p.hw(); }
   };
@@ -4058,11 +3887,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Equal_z_3
   {
+    typedef typename K::Boolean    Boolean;
     typedef typename K::Point_3    Point_3;
-  public:
-    typedef typename K::Boolean    result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return p.hz()*q.hw() == q.hz()*p.hw(); }
   };
@@ -4070,6 +3899,7 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Has_on_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Line_3           Line_3;
     typedef typename K::Ray_3            Ray_3;
@@ -4077,30 +3907,29 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::Plane_3          Plane_3;
     typedef typename K::Triangle_3       Triangle_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Line_3& l, const Point_3& p) const
     { return l.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Ray_3& r, const Point_3& p) const
     { return r.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Segment_3& s, const Point_3& p) const
     { return s.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl, const Point_3& p) const
     { return pl.rep().has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl, const Line_3& l) const
     { return pl.rep().has_on(l); }
 
-    result_type
+    Boolean
     operator()( const Triangle_3& t, const Point_3& p) const
     {
       if (!t.is_degenerate() )
@@ -4143,11 +3972,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_distance_to_point_2
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Point_2   Point_2;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       typedef typename K::RT RT;
@@ -4195,11 +4024,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_distance_to_point_3
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Point_3   Point_3;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     {
       typedef typename K::RT RT;
@@ -4232,19 +4061,19 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_signed_distance_to_line_2
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Point_2   Point_2;
     typedef typename K::Line_2    Line_2;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()(const Point_2& p, const Point_2& q,
                const Point_2& r, const Point_2& s) const
     {
       return Compare_signed_distance_to_line_2<K>().operator()(p, q, r, s) == SMALLER;
     }
 
-    result_type
+    Boolean
     operator()(const Line_2& l, const Point_2& p,
                const Point_2& q) const
     {
@@ -4270,14 +4099,14 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_signed_distance_to_plane_3
   {
+    typedef typename K::Boolean            Boolean;
     typedef typename K::RT                 RT;
     typedef typename K::Point_3            Point_3;
     typedef typename K::Plane_3            Plane_3;
     typedef typename K::Construct_plane_3  Construct_plane_3;
-  public:
-    typedef typename K::Boolean            result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Plane_3& pl, const Point_3& p, const Point_3& q) const
     {
       const RT & pla = pl.a();
@@ -4300,7 +4129,7 @@ namespace HomogeneousKernelFunctors {
       return scaled_dist_p_minus_scaled_dist_q < 0;
     }
 
-    result_type
+    Boolean
     operator()(const Point_3& plp, const Point_3& plq, const Point_3& plr,
                const Point_3& p, const Point_3& q) const
     {
@@ -4312,16 +4141,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_xyz_3
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Compare_xyz_3  Compare_xyz_3;
-    Compare_xyz_3 c;
-  public:
-    typedef typename K::Boolean        result_type;
 
+    Compare_xyz_3 c;
+
+  public:
     Less_xyz_3() {}
     Less_xyz_3(const Compare_xyz_3& c_) : c(c_) {}
 
-    result_type
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return c(p, q) == SMALLER; }
   };
@@ -4329,16 +4159,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_xy_2
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_2       Point_2;
     typedef typename K::Compare_xy_2  Compare_xy_2;
-    Compare_xy_2 c;
-  public:
-    typedef typename K::Boolean       result_type;
 
+    Compare_xy_2 c;
+
+  public:
     Less_xy_2() {}
     Less_xy_2(const Compare_xy_2& c_) : c(c_) {}
 
-    result_type
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return c(p, q) == SMALLER; }
   };
@@ -4346,16 +4177,17 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_xy_3
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_3       Point_3;
     typedef typename K::Compare_xy_3  Compare_xy_3;
-    Compare_xy_3 c;
-  public:
-    typedef typename K::Boolean       result_type;
 
+    Compare_xy_3 c;
+
+  public:
     Less_xy_3() {}
     Less_xy_3(const Compare_xy_3& c_) : c(c_) {}
 
-    result_type
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return c(p, q) == SMALLER; }
   };
@@ -4363,11 +4195,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_x_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_2         Point_2;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return ( p.hx()*q.hw() < q.hx()*p.hw() ); }
   };
@@ -4375,11 +4207,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_x_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return ( p.hx()*q.hw() < q.hx()*p.hw() ); }
   };
@@ -4387,11 +4219,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_yx_2
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_2       Point_2;
-  public:
-    typedef typename K::Boolean       result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     {
       typedef typename K::RT RT;
@@ -4422,11 +4254,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_y_2
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_2         Point_2;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_2& p, const Point_2& q) const
     { return ( p.hy()*q.hw() < q.hy()*p.hw() ); }
   };
@@ -4434,11 +4266,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_y_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return ( p.hy()*q.hw() < q.hy()*p.hw() ); }
   };
@@ -4446,11 +4278,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Less_z_3
   {
+    typedef typename K::Boolean         Boolean;
     typedef typename K::Point_3         Point_3;
-  public:
-    typedef typename K::Boolean         result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Point_3& p, const Point_3& q) const
     { return   (p.hz() * q.hw() < q.hz() * p.hw() ); }
   };
@@ -4458,13 +4290,13 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Orientation_2
   {
+    typedef typename K::Orientation  Orientation;
     typedef typename K::Point_2      Point_2;
     typedef typename K::Vector_2     Vector_2;
     typedef typename K::Circle_2     Circle_2;
-  public:
-    typedef typename K::Orientation  result_type;
 
-    result_type
+  public:
+    Orientation
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       typedef typename K::RT RT;
@@ -4490,14 +4322,14 @@ namespace HomogeneousKernelFunctors {
       return CGAL::compare(A*D, B*C);
     }
 
-    result_type
+    Orientation
     operator()(const Vector_2& u, const Vector_2& v) const
     {
       return sign_of_determinant(u.hx(), u.hy(),
                                     v.hx(), v.hy());
     }
 
-    result_type
+    Orientation
     operator()(const Circle_2& c) const
     {
       return c.rep().orientation();
@@ -4507,14 +4339,14 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Orientation_3
   {
+    typedef typename K::Orientation    Orientation;
     typedef typename K::Point_3        Point_3;
     typedef typename K::Vector_3       Vector_3;
     typedef typename K::Tetrahedron_3  Tetrahedron_3;
     typedef typename K::Sphere_3       Sphere_3;
-  public:
-    typedef typename K::Orientation  result_type;
 
-    result_type
+  public:
+    Orientation
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     {
@@ -4525,7 +4357,7 @@ namespace HomogeneousKernelFunctors {
                                      s.hx(), s.hy(), s.hz(), s.hw());
     }
 
-    result_type
+    Orientation
     operator()( const Vector_3& u, const Vector_3& v, const Vector_3& w) const
     {
       return sign_of_determinant( u.hx(), u.hy(), u.hz(),
@@ -4533,13 +4365,13 @@ namespace HomogeneousKernelFunctors {
                                      w.hx(), w.hy(), w.hz());
     }
 
-    result_type
+    Orientation
     operator()( const Tetrahedron_3& t) const
     {
       return t.rep().orientation();
     }
 
-    result_type
+    Orientation
     operator()(const Sphere_3& s) const
     {
       return s.rep().orientation();
@@ -4561,7 +4393,7 @@ namespace HomogeneousKernelFunctors {
     typedef typename K::FT                                FT;
     typedef typename K::Weighted_point_3                  Weighted_point_3;
     typedef typename K::Oriented_side                     Oriented_side;
-    typedef Oriented_side    result_type;
+    typedef typename K::Oriented_side                     Orientation;
 
     Oriented_side operator() ( const Weighted_point_3 & p,
                                const Weighted_point_3 & q,
@@ -4625,12 +4457,10 @@ namespace HomogeneousKernelFunctors {
   template < typename K >
   class Power_side_of_oriented_power_circle_2
   {
-  public:
-    typedef typename K::Weighted_point_2         Weighted_point_2;
     typedef typename K::Oriented_side            Oriented_side;
+    typedef typename K::Weighted_point_2         Weighted_point_2;
 
-    typedef Oriented_side    result_type;
-
+  public:
     Oriented_side operator()(const Weighted_point_2& p,
                              const Weighted_point_2& q,
                              const Weighted_point_2& r,
@@ -4678,20 +4508,20 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Oriented_side_2
   {
+    typedef typename K::Oriented_side  Oriented_side;
     typedef typename K::RT             RT;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Circle_2       Circle_2;
     typedef typename K::Line_2         Line_2;
     typedef typename K::Triangle_2     Triangle_2;
     typedef typename K::Segment_2      Segment_2;
-  public:
-    typedef typename K::Oriented_side  result_type;
 
-    result_type
+  public:
+    Oriented_side
     operator()( const Circle_2& c, const Point_2& p) const
     { return Oriented_side(static_cast<int>(c.bounded_side(p)) * static_cast<int>(c.orientation())); }
 
-    result_type
+    Oriented_side
     operator()( const Line_2& l, const Point_2& p) const
     {
       CGAL_kernel_precondition( ! l.is_degenerate() );
@@ -4699,7 +4529,7 @@ namespace HomogeneousKernelFunctors {
       return CGAL_NTS sign(v);
     }
 
-    result_type
+    Oriented_side
     operator()( const Triangle_2& t, const Point_2& p) const
     {
       typename K::Collinear_are_ordered_along_line_2
@@ -4724,7 +4554,7 @@ namespace HomogeneousKernelFunctors {
         : -ot;
     }
 
-    result_type
+    Oriented_side
     operator()(const Segment_2& s, const Triangle_2& t) const
     {
       typename K::Construct_source_2 source;
@@ -4764,11 +4594,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Side_of_bounded_circle_2
   {
+    typedef typename K::Bounded_side   Bounded_side;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Bounded_side   result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Point_2& p, const Point_2& q, const Point_2& t) const
     {
       typedef typename K::RT RT;
@@ -4783,12 +4613,11 @@ namespace HomogeneousKernelFunctors {
       const RT& thy = t.hy();
       const RT& thw = t.hw();
 
-      return enum_cast<Bounded_side>(
-                                     CGAL::compare((thx*phw-phx*thw)*(qhx*thw-thx*qhw),
+      return enum_cast<Bounded_side>(CGAL::compare((thx*phw-phx*thw)*(qhx*thw-thx*qhw),
                                                    (thy*phw-phy*thw)*(thy*qhw-qhy*thw)) );
     }
 
-    result_type
+    Bounded_side
     operator()( const Point_2& q, const Point_2& r,
                 const Point_2& s, const Point_2& t) const
     {
@@ -4854,11 +4683,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Side_of_bounded_sphere_3
   {
+    typedef typename K::Bounded_side   Bounded_side;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Bounded_side   result_type;
 
-    result_type
+  public:
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q, const Point_3& t) const
     {
       typedef typename K::RT RT;
@@ -4882,7 +4711,7 @@ namespace HomogeneousKernelFunctors {
                             + (thz*phw-phz*thw)*(qhz*thw-thz*qhw)));
     }
 
-    result_type
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& t) const
     {
@@ -4890,7 +4719,7 @@ namespace HomogeneousKernelFunctors {
       return enum_cast<Bounded_side>( compare_distance_to_point(center, p, t) );
     } // FIXME
 
-    result_type
+    Bounded_side
     operator()( const Point_3& p, const Point_3& q, const Point_3& r,
                 const Point_3& s, const Point_3& test) const
     {
@@ -4920,11 +4749,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Side_of_oriented_circle_2
   {
+    typedef typename K::Oriented_side  Oriented_side;
     typedef typename K::Point_2        Point_2;
-  public:
-    typedef typename K::Oriented_side  result_type;
 
-    result_type
+  public:
+    Oriented_side
     operator()( const Point_2& q, const Point_2& r,
                 const Point_2& s, const Point_2& t) const
     {
@@ -4981,11 +4810,11 @@ namespace HomogeneousKernelFunctors {
   template <typename K>
   class Side_of_oriented_sphere_3
   {
+    typedef typename K::Oriented_side  Oriented_side;
     typedef typename K::Point_3        Point_3;
-  public:
-    typedef typename K::Oriented_side  result_type;
 
-    result_type
+  public:
+    Oriented_side
     operator()( const Point_3& p, const Point_3& q, const Point_3& r,
                 const Point_3& s, const Point_3& t) const
     {
@@ -5034,13 +4863,11 @@ namespace HomogeneousKernelFunctors {
   template < typename K >
   class Construct_radical_axis_2
   {
-  public:
     typedef typename K::Weighted_point_2                Weighted_point_2;
     typedef typename K::Line_2                          Line_2;
     typedef typename K::RT RT;
 
-    typedef Line_2                                      result_type;
-
+  public:
     Line_2
     operator()(const Weighted_point_2 & p, const Weighted_point_2 & q) const
     {
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH2.h
index 6c2177c916e..f51d9f61f3c 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH2.h
@@ -24,7 +24,7 @@ namespace CGAL {
 
 template < class R>
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 equal_xy(const PointH2<R>& p,
          const PointH2<R>& q)
 {
@@ -39,7 +39,7 @@ equal_xy(const PointH2<R>& p,
 
 template <class R>
 CGAL_KERNEL_MEDIUM_INLINE
-Oriented_side
+typename R::Oriented_side
 _where_wrt_L_wedge( const PointH2<R>& p, const PointH2<R>& q )
 {
   Sign xs = CGAL_NTS sign( q.hx()*p.hw() - p.hx()*q.hw() );  // sign( qx - px )
@@ -53,7 +53,7 @@ _where_wrt_L_wedge( const PointH2<R>& p, const PointH2<R>& q )
 }
 
 template <class RT>
-Comparison_result
+typename Compare<RT>::result_type
 compare_power_distanceH2(const RT& phx, const RT& phy, const RT& phw,
                          const Quotient<RT>& pwt,
                          const RT& qhx, const RT& qhy, const RT& qhw,
@@ -82,7 +82,7 @@ compare_power_distanceH2(const RT& phx, const RT& phy, const RT& phw,
 
 
 template <class RT>
-Oriented_side
+typename Same_uncertainty_nt<Oriented_side, RT>::type
 power_testH2( const RT &phx, const RT &phy, const RT &phw, const Quotient<RT> &pwt,
               const RT &qhx, const RT &qhy, const RT &qhw, const Quotient<RT> &qwt,
               const RT &rhx, const RT &rhy, const RT &rhw, const Quotient<RT> &rwt,
@@ -129,7 +129,7 @@ power_testH2( const RT &phx, const RT &phy, const RT &phw, const Quotient<RT> &p
 
 
 template <class RT>
-Oriented_side
+typename Same_uncertainty_nt<Oriented_side, RT>::type
 power_testH2( const RT &phx, const RT &phy, const RT &phw, const Quotient<RT> &pwt,
               const RT &qhx, const RT &qhy, const RT &qhw, const Quotient<RT> &qwt,
               const RT &thx, const RT &thy, const RT &thw, const Quotient<RT> &twt)
@@ -180,7 +180,7 @@ power_testH2( const RT &phx, const RT &phy, const RT &phw, const Quotient<RT> &p
 // Unused, undocumented, un-functorized.
 template < class R >
 CGAL_KERNEL_MEDIUM_INLINE
-Comparison_result
+typename R::Comparison_result
 compare_deltax_deltay(const PointH2<R>& p,
                       const PointH2<R>& q,
                       const PointH2<R>& r,
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH3.h
index e734ac9493d..c1956fddb63 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/predicates_on_pointsH3.h
@@ -25,8 +25,9 @@ namespace CGAL {
 
 template < class R >
 CGAL_KERNEL_MEDIUM_INLINE
-bool lexicographically_xy_smaller(const PointH3<R> &p,
-                                  const PointH3<R> &q)
+typename R::Boolean
+lexicographically_xy_smaller(const PointH3<R> &p,
+                             const PointH3<R> &q)
 {
   typedef typename R::RT RT;
   RT pV = p.hx()*q.hw();
@@ -51,7 +52,7 @@ bool lexicographically_xy_smaller(const PointH3<R> &p,
 
 template < class R>
 CGAL_KERNEL_MEDIUM_INLINE
-Comparison_result
+typename R::Comparison_result
 compare_xy(const PointH3<R>& p, const PointH3<R>& q)
 {
   typedef typename R::RT RT;
@@ -82,7 +83,7 @@ compare_xy(const PointH3<R>& p, const PointH3<R>& q)
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 equal_xy(const PointH3<R> &p, const PointH3<R> &q)
 {
   return   (p.hx() * q.hw() == q.hx() * p.hw() )
@@ -91,7 +92,7 @@ equal_xy(const PointH3<R> &p, const PointH3<R> &q)
 
 template < class R >  // ???  ->   ==
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 equal_xyz(const PointH3<R> &p, const PointH3<R> &q)
 {
   return   (p.hx() * q.hw() == q.hx() * p.hw() )
@@ -101,27 +102,27 @@ equal_xyz(const PointH3<R> &p, const PointH3<R> &q)
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 less_x(const PointH3<R> &p, const PointH3<R> &q)
 { return   (p.hx() * q.hw() < q.hx() * p.hw() ); }
 
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 less_y(const PointH3<R> &p, const PointH3<R> &q)
 { return   (p.hy() * q.hw() < q.hy() * p.hw() ); }
 
 template < class R >
 CGAL_KERNEL_INLINE
-bool
+typename R::Boolean
 less_z(const PointH3<R> &p, const PointH3<R> &q)
 { return   (p.hz() * q.hw() < q.hz() * p.hw() ); }
 
 
 
 template <class RT>
-Oriented_side
+typename Same_uncertainty_nt<Oriented_side, RT>::type
 power_side_of_oriented_power_sphereH3(
              const RT &phx, const RT &phy, const RT &phz, const RT &phw, const Quotient<RT> &pwt,
              const RT &qhx, const RT &qhy, const RT &qhz, const RT &qhw, const Quotient<RT> &qwt,
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
index 1aaec1a1a00..2f6cef0e871 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
@@ -170,7 +170,7 @@ public:
   /// @}
 
   /// \name
-  /// The following functions must be provided only if the methods of `Hyperbolic_Delaunay_triangulation_2`
+  /// The following functions must be provided only if the methods of `CGAL::Hyperbolic_Delaunay_triangulation_2`
   /// that return elements of the Voronoi diagram are instantiated:
   /// @{
         Construct_hyperbolic_segment_2       construct_hyperbolic_segment_2_object();
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
index d5b32a20979..418991dc8f9 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
@@ -15,7 +15,7 @@ namespace CGAL {
 <img src="header.png" style="max-width:50%; width:50%;"/>
 </center>
 
-This package enables the computation of Delaunay triangulations of
+This package enables the computation of hyperbolic Delaunay triangulations of
 point sets in the Poincar&eacute; disk model of the hyperbolic plane.
 
 \section HT2_Poincare_model The Poincar&eacute; Disk Model of the Hyperbolic Plane
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_2/internal/Hyperbolic_Delaunay_triangulation_traits_2_functions.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_2/internal/Hyperbolic_Delaunay_triangulation_traits_2_functions.h
index 16e863753e2..63bb0c0c47f 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_2/internal/Hyperbolic_Delaunay_triangulation_traits_2_functions.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_2/internal/Hyperbolic_Delaunay_triangulation_traits_2_functions.h
@@ -225,13 +225,11 @@ class Side_of_oriented_hyperbolic_segment_2
   typedef typename Traits::Construct_weighted_circumcenter_2  Construct_weighted_circumcenter_2;
 
 public:
-  typedef Oriented_side                                       result_type;
-
   Side_of_oriented_hyperbolic_segment_2(const Traits& gt = Traits()) : _gt(gt) {}
 
-  result_type operator()(const Hyperbolic_point_2& p,
-                         const Hyperbolic_point_2& q,
-                         const Hyperbolic_point_2& query) const
+  Oriented_side operator()(const Hyperbolic_point_2& p,
+                           const Hyperbolic_point_2& q,
+                           const Hyperbolic_point_2& query) const
   {
     // Check first if the points are collinear with the origin
     Circle_2 poincare(Hyperbolic_point_2(FT(0),FT(0)), FT(1));
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 4db4c84f92c..e423b259b26 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -6,16 +6,39 @@
 ### General Changes
 - The minimal supported version of Boost is now 1.74.0.
 
+
+### [3D Constrained Triangulations](https://doc.cgal.org/6.1/Manual/packages.html#PkgConstrainedTriangulation3) (new package)
+-   This package adds the function `CGAL::make_conforming_constrained_Delaunay_triangulation_3()`
+    to create a conforming constrained Delaunay triangulation in 3D, which can be represented by the new
+    class template `CGAL::Conforming_constrained_Delaunay_triangulation_3`.
+
+### 2D Triangulations on Hyperbolic Surfaces (new package)
+-   This package enables building and handling triangulations of closed orientable hyperbolic surfaces.
+    It offers functions for the generation of the triangulation from a convex fundamental domain,
+    the Delaunay flip algorithm and the construction of a portion of the lift of the triangulation
+    in the Poincaré disk. A method is offered that generates such domains in genus two.
+
+### 3D Isosurfacing (new package)
+
+-   This package provides algorithms to extract isosurfaces from different inputs. The input is represented
+    as a 3D domain and can be an implicit function or a %Cartesian grid. The output is an indexed face
+    set that stores an isosurface in the form of a surface mesh. The provided algorithms include Marching Cubes,
+    topologically correct Marching Cubes, and Dual Contouring.
+
+
 ### [Polygon Mesh Processing](https://doc.cgal.org/6.1/Manual/packages.html#PkgPolygonMeshProcessing)
 - Added the function `CGAL::Polygon_mesh_processing::discrete_mean_curvature` and `CGAL::Polygon_mesh_processing::discrete_Guassian_curvature` to evaluate the discrete curvature at a vertex of a mesh.
 - Added the function `CGAL::Polygon_mesh_processing::angle_sum` to compute the sum of the angles around a vertex.
 - Added a function in the [visitor of the corefinement based methods](https://doc.cgal.org/6.1/Polygon_mesh_processing/classPMPCorefinementVisitor.html)
   to know faces in the output meshes that are corresponding to input coplanar faces.
+-   Added the function `CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing()`
+    to remesh triangle meshes. This remeshing algorithm uses clustering on polygonal meshes as to
+    approximate a Centroidal Voronoi Diagram construction, and can move vertices as to recover
+    sharp features and corners.
 
 ### [Point Set Processing](https://doc.cgal.org/6.1/Manual/packages.html#PkgPointSetProcessing3)
 - Added `poisson_eliminate()` to downsample a point cloud to a target size while providing Poisson disk property, i.e., a larger minimal distance between points.
 
-
 ### [Algebraic Kernel](https://doc.cgal.org/6.1/Manual/packages.html#PkgAlgebraicKernelD)
 -   **Breaking change**: Classes based on the RS Library are no longer provided.
 
@@ -40,6 +63,12 @@
   - `initial_points` : enables the user to specify a `Range` of initial points.
 -   Added a new meshing parameter `surface_only`, to improve performances when the user is only interested in surface mesh generation.
 
+### [3D Subdivision Methods](https://doc.cgal.org/6.1/Manual/packages.html#PkgSurfaceSubdivisionMethod3)
+
+-   Added a new named parameter for `CGAL::Subdivision_method_3::Loop_subdivision()` and
+    `CGAL::Subdivision_method_3::CatmullClark_subdivision()`, which enables users to subdivide
+    a mesh without modifying its geometry.
+
 ### [2D Triangulations](https://doc.cgal.org/6.1/Manual/packages.html#PkgTriangulation2)
 
 -  **Breaking change**: In the class template `Constrained_triangulation_plus_2`, the value type of the range returned
@@ -54,6 +83,11 @@
 -   All triangulations now offer the functions `point(Vertex_handle)` and `point(Simplex, int)`, which enables users to access the geometric position of a vertex and of the i-th vertex of a simplex of a triangulation.
 
 
+
+### [CGAL and the Boost Graph Library (BGL)](https://doc.cgal.org/6.1/Manual/packages.html#PkgBGL)
+
+-   Added the function `dijkstra_shortest_path()` which computes the geometrically shortest sequence of halfedges between two vertices.
+
 ## [Release 6.0.1](https://github.com/CGAL/cgal/releases/tag/v6.0.1)
 
 ### [Poisson Surface Reconstruction](https://doc.cgal.org/6.0.1/Manual/packages.html#PkgPoissonSurfaceReconstruction3)
diff --git a/Installation/include/CGAL/config.h b/Installation/include/CGAL/config.h
index a9e215f26e2..f3c8845350e 100644
--- a/Installation/include/CGAL/config.h
+++ b/Installation/include/CGAL/config.h
@@ -481,7 +481,7 @@ namespace cpp11{
 }//namespace cpp11
 } //namespace CGAL
 
-#if __cpp_lib_concepts >= 201806L
+#if __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
 #  define CGAL_CPP20_REQUIRE_CLAUSE(x) requires x
 #  define CGAL_TYPE_CONSTRAINT(x) x
 #else
diff --git a/Installation/include/CGAL/license/Isosurfacing_3.h b/Installation/include/CGAL/license/Isosurfacing_3.h
new file mode 100644
index 00000000000..345fae13a82
--- /dev/null
+++ b/Installation/include/CGAL/license/Isosurfacing_3.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2016  GeometryFactory SARL (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s) : Andreas Fabri
+//
+// Warning: this file is generated, see include/CGAL/licence/README.md
+
+#ifndef CGAL_LICENSE_ISOSURFACING_3_H
+#define CGAL_LICENSE_ISOSURFACING_3_H
+
+#include <CGAL/config.h>
+#include <CGAL/license.h>
+
+#ifdef CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE
+
+#  if CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#    if defined(CGAL_LICENSE_WARNING)
+
+       CGAL_pragma_warning("Your commercial license for CGAL does not cover "
+                           "this release of the 3D Isosurfacing package.")
+#    endif
+
+#    ifdef CGAL_LICENSE_ERROR
+#      error "Your commercial license for CGAL does not cover this release \
+              of the 3D Isosurfacing package. \
+              You get this error, as you defined CGAL_LICENSE_ERROR."
+#    endif // CGAL_LICENSE_ERROR
+
+#  endif // CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#else // no CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE
+
+#  if defined(CGAL_LICENSE_WARNING)
+     CGAL_pragma_warning("\nThe macro CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE is not defined."
+                          "\nYou use the CGAL 3D Isosurfacing package under "
+                          "the terms of the GPLv3+.")
+#  endif // CGAL_LICENSE_WARNING
+
+#  ifdef CGAL_LICENSE_ERROR
+#    error "The macro CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE is not defined.\
+            You use the CGAL 3D Isosurfacing package under the terms of \
+            the GPLv3+. You get this error, as you defined CGAL_LICENSE_ERROR."
+#  endif // CGAL_LICENSE_ERROR
+
+#endif // no CGAL_ISOSURFACING_3_COMMERCIAL_LICENSE
+
+#endif // CGAL_LICENSE_ISOSURFACING_3_H
diff --git a/Installation/include/CGAL/license/Polygon_mesh_processing/acvd.h b/Installation/include/CGAL/license/Polygon_mesh_processing/acvd.h
new file mode 100644
index 00000000000..eb65e39c3b8
--- /dev/null
+++ b/Installation/include/CGAL/license/Polygon_mesh_processing/acvd.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2016  GeometryFactory SARL (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s) : Andreas Fabri
+//
+// Warning: this file is generated, see include/CGAL/license/README.md
+
+#ifndef CGAL_LICENSE_POLYGON_MESH_PROCESSING_ACVD_H
+#define CGAL_LICENSE_POLYGON_MESH_PROCESSING_ACVD_H
+
+#include <CGAL/config.h>
+#include <CGAL/license.h>
+
+#ifdef CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE
+
+#  if CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#    if defined(CGAL_LICENSE_WARNING)
+
+       CGAL_pragma_warning("Your commercial license for CGAL does not cover "
+                           "this release of the Polygon Mesh Processing - ACVD remeshing package.")
+#    endif
+
+#    ifdef CGAL_LICENSE_ERROR
+#      error "Your commercial license for CGAL does not cover this release \
+              of the Polygon Mesh Processing - ACVD remeshing package. \
+              You get this error, as you defined CGAL_LICENSE_ERROR."
+#    endif // CGAL_LICENSE_ERROR
+
+#  endif // CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#else // no CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE
+
+#  if defined(CGAL_LICENSE_WARNING)
+     CGAL_pragma_warning("\nThe macro CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE is not defined."
+                          "\nYou use the CGAL Polygon Mesh Processing - ACVD remeshing package under "
+                          "the terms of the GPLv3+.")
+#  endif // CGAL_LICENSE_WARNING
+
+#  ifdef CGAL_LICENSE_ERROR
+#    error "The macro CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE is not defined.\
+            You use the CGAL Polygon Mesh Processing - ACVD remeshing package under the terms of \
+            the GPLv3+. You get this error, as you defined CGAL_LICENSE_ERROR."
+#  endif // CGAL_LICENSE_ERROR
+
+#endif // no CGAL_POLYGON_MESH_PROCESSING_ACVD_COMMERCIAL_LICENSE
+
+#endif // CGAL_LICENSE_POLYGON_MESH_PROCESSING_ACVD_H
diff --git a/Installation/include/CGAL/license/Triangulation_on_hyperbolic_surface_2.h b/Installation/include/CGAL/license/Triangulation_on_hyperbolic_surface_2.h
new file mode 100644
index 00000000000..d3ce6f035fd
--- /dev/null
+++ b/Installation/include/CGAL/license/Triangulation_on_hyperbolic_surface_2.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2016  GeometryFactory SARL (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s) : Andreas Fabri
+//
+// Warning: this file is generated, see include/CGAL/license/README.md
+
+#ifndef CGAL_LICENSE_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_H
+#define CGAL_LICENSE_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_H
+
+#include <CGAL/config.h>
+#include <CGAL/license.h>
+
+#ifdef CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE
+
+#  if CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#    if defined(CGAL_LICENSE_WARNING)
+
+       CGAL_pragma_warning("Your commercial license for CGAL does not cover "
+                           "this release of the 2D Triangulations on Hyperbolic Surfaces package.")
+#    endif
+
+#    ifdef CGAL_LICENSE_ERROR
+#      error "Your commercial license for CGAL does not cover this release \
+              of the 2D Triangulations on Hyperbolic Surfaces package. \
+              You get this error, as you defined CGAL_LICENSE_ERROR."
+#    endif // CGAL_LICENSE_ERROR
+
+#  endif // CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#else // no CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE
+
+#  if defined(CGAL_LICENSE_WARNING)
+     CGAL_pragma_warning("\nThe macro CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE is not defined."
+                          "\nYou use the CGAL 2D Triangulations on Hyperbolic Surfaces package under "
+                          "the terms of the GPLv3+.")
+#  endif // CGAL_LICENSE_WARNING
+
+#  ifdef CGAL_LICENSE_ERROR
+#    error "The macro CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE is not defined.\
+            You use the CGAL 2D Triangulations on Hyperbolic Surfaces package under the terms of \
+            the GPLv3+. You get this error, as you defined CGAL_LICENSE_ERROR."
+#  endif // CGAL_LICENSE_ERROR
+
+#endif // no CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_COMMERCIAL_LICENSE
+
+#endif // CGAL_LICENSE_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_H
diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index 4111229b47b..4d8e2fbc203 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -26,6 +26,7 @@ Hyperbolic_triangulation_2 2D Hyperbolic Delaunay Triangulations
 Inscribed_areas Inscribed Areas
 Interpolation 2D and Surface Function Interpolation
 Interval_skip_list Interval Skip List
+Isosurfacing_3 3D Isosurfacing
 Jet_fitting_3 Estimation of Local Differential Properties of Point-Sampled Surfaces
 Kinetic_surface_reconstruction Kinetic Surface Reconstruction
 Matrix_search Monotone and Sorted Matrix Search
@@ -68,6 +69,7 @@ Polygon_mesh_processing/miscellaneous Polygon Mesh Processing - Miscellaneous
 Polygon_mesh_processing/detect_features Polygon Mesh Processing - Feature Detection
 Polygon_mesh_processing/collision_detection Polygon Mesh Processing - Collision Detection
 Polygon_mesh_processing/autorefinement Polygon Mesh Processing - Autorefinement
+Polygon_mesh_processing/acvd Polygon Mesh Processing - ACVD remeshing
 Polyhedron 3D Polyhedral Surface
 Polyline_simplification_2 2D Polyline Simplification
 Polytope_distance_d Optimal Distances
@@ -106,6 +108,7 @@ Three Three
 Triangulation_2 2D Triangulation
 Triangulation_3 3D Triangulations
 Triangulation dD Triangulations
+Triangulation_on_hyperbolic_surface_2 2D Triangulations on Hyperbolic Surfaces
 Triangulation_on_sphere_2 2D Triangulation on Sphere
 Visibility_2 2D Visibility Computation
 Voronoi_diagram_2 2D Voronoi Diagram Adaptor
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Tetrahedron_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Tetrahedron_3_intersection.h
index f1d8bdff1fd..706ceea7488 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Tetrahedron_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Tetrahedron_3_intersection.h
@@ -26,7 +26,6 @@ struct Tetrahedron_Line_intersection_3
   : public Tetrahedron_lines_intersection_3_base<K, typename K::Line_3, Tetrahedron_Line_intersection_3<K> >
 {
   typedef Tetrahedron_lines_intersection_3_base<K, typename K::Line_3, Tetrahedron_Line_intersection_3<K> > Base;
-  typedef typename Base::Result_type Result_type;
 
   Tetrahedron_Line_intersection_3(const typename K::Tetrahedron_3& tet,
                                   const typename K::Line_3& l)
diff --git a/Interval_skip_list/include/CGAL/Interval_skip_list.h b/Interval_skip_list/include/CGAL/Interval_skip_list.h
index a445981a3f2..d2721b844ff 100644
--- a/Interval_skip_list/include/CGAL/Interval_skip_list.h
+++ b/Interval_skip_list/include/CGAL/Interval_skip_list.h
@@ -1111,7 +1111,7 @@ template <class Interval>
   Interval_skip_list<Interval>::removeMarkers(IntervalSLnode<Interval>* left,
                                             const Interval& I)
   {
-    // Remove markers for interval I, which has left as it's left
+    // Remove markers for interval I, which has left as its left
     // endpoint,  following a staircase pattern.
 
     //    Interval_handle res=0, tmp=0; // af: assignment not possible with std::list
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/CMakeLists.txt b/Isosurfacing_3/benchmark/Isosurfacing_3/CMakeLists.txt
new file mode 100644
index 00000000000..b1ecd2b02d3
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/CMakeLists.txt
@@ -0,0 +1,36 @@
+# Created by the script cgal_create_cmake_script
+# This is the CMake script for compiling a CGAL application.
+
+cmake_minimum_required(VERSION 3.1...3.23)
+project( Isosurfacing_3_benchmark )
+
+find_package(CGAL REQUIRED)
+
+find_package(Eigen3 3.1.0 QUIET) #(3.1.0 or greater)
+include(CGAL_Eigen3_support)
+
+find_package(TBB)
+include(CGAL_TBB_support)
+
+if(TARGET CGAL::Eigen3_support)
+  create_single_source_cgal_program("benchmark.cpp" )
+  create_single_source_cgal_program("contouring_seq_vs_parallel_implicit.cpp" )
+  create_single_source_cgal_program("contouring_seq_vs_parallel_image.cpp" )
+
+  target_compile_definitions(benchmark PUBLIC ${SCENARIO})
+  target_compile_definitions(benchmark PUBLIC ${KERNEL})
+  target_compile_definitions(benchmark PUBLIC ${ALGO})
+  target_compile_definitions(benchmark PUBLIC ${TAG})
+
+  target_link_libraries(benchmark PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_seq_vs_parallel_implicit PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_seq_vs_parallel_image PRIVATE CGAL::Eigen3_support)
+
+  if(TARGET CGAL::TBB_support)
+    target_link_libraries(benchmark PUBLIC CGAL::TBB_support)
+    target_link_libraries(contouring_seq_vs_parallel_implicit PUBLIC CGAL::TBB_support)
+    target_link_libraries(contouring_seq_vs_parallel_image PUBLIC CGAL::TBB_support)
+  endif()
+else()
+  message(STATUS "NOTICE: Some benchmarks use Eigen, and will not be compiled.")
+endif()
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark.cpp b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark.cpp
new file mode 100644
index 00000000000..a2d1e2a73fa
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark.cpp
@@ -0,0 +1,350 @@
+#include <CGAL/Cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Gradient_function_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_gradients_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+
+#include <CGAL/boost/graph/IO/OFF.h>
+#include <CGAL/Image_3.h>
+#include <CGAL/Isosurfacing_3/IO/Image_3.h>
+#include <CGAL/Real_timer.h>
+
+#include <cmath>
+#include <iostream>
+#include <limits>
+
+#ifndef M_PI
+# define M_PI 3.141592653589793238462643383279502884L
+#endif
+
+template <class GeomTraits>
+struct Sphere_value
+{
+  using FT = typename GeomTraits::FT;
+  using Point = typename GeomTraits::Point_3;
+
+  FT operator()(const Point& point) const
+  {
+    return CGAL::approximate_sqrt((point - CGAL::ORIGIN).squared_length());
+  }
+};
+
+template <class GeomTraits>
+struct Sphere_gradient
+{
+  using FT = typename GeomTraits::FT;
+  using Point = typename GeomTraits::Point_3;
+  using Vector = typename GeomTraits::Vector_3;
+
+  Vector operator()(const Point& point) const
+  {
+    Vector g = point - CGAL::ORIGIN;
+    return g / CGAL::approximate_sqrt(g.squared_length());
+  }
+};
+
+template <class GeomTraits>
+struct Implicit_sphere
+{
+  using FT = typename GeomTraits::FT;
+  using Vector = typename GeomTraits::Vector_3;
+
+  using Grid = CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>;
+  using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+  using Gradients = CGAL::Isosurfacing::Gradient_function_3<Grid>;
+  using Domain = CGAL::Isosurfacing::internal::Isosurfacing_domain_3<Grid, Values, Gradients>;
+
+  Implicit_sphere(const std::size_t N)
+    : res(2. / N, 2. / N, 2. / N),
+      grid { CGAL::Bbox_3 {-1, -1, -1, 1, 1, 1}, CGAL::make_array<std::size_t>(N, N, N) },
+      values { Sphere_value<GeomTraits>{}, grid },
+      gradients { Sphere_gradient<GeomTraits>{}, grid }
+  { }
+
+  Domain domain() const
+  {
+    return { grid, values, gradients };
+  }
+
+  FT iso() const
+  {
+    return 0.8;
+  }
+
+private:
+  Vector res;
+  Grid grid;
+  Values values;
+  Gradients gradients;
+};
+
+template <class GeomTraits>
+struct IWPValue
+{
+  using FT = typename GeomTraits::FT;
+  using Point = typename GeomTraits::Point_3;
+
+  FT operator()(const Point& point) const
+  {
+    const FT alpha = 5.01;
+    // const FT alpha = 1.01;
+
+    const FT x = alpha * (point.x() + 1) * M_PI;
+    const FT y = alpha * (point.y() + 1) * M_PI;
+    const FT z = alpha * (point.z() + 1) * M_PI;
+
+    return cos(x)*cos(y) + cos(y)*cos(z) + cos(z)*cos(x) - cos(x)*cos(y)*cos(z); // isovalue = 0
+  }
+};
+
+template <class GeomTraits>
+struct IWPGradient
+{
+  using FT = typename GeomTraits::FT;
+  using Point = typename GeomTraits::Point_3;
+  using Vector = typename GeomTraits::Vector_3;
+
+  Vector operator()(const Point& point) const
+  {
+    const FT alpha = 5.01;
+    // const FT alpha = 1.01;
+
+    const FT x = alpha * (point.x() + 1) * M_PI;
+    const FT y = alpha * (point.y() + 1) * M_PI;
+    const FT z = alpha * (point.z() + 1) * M_PI;
+
+    const FT gx = M_PI * alpha * sin(x) * (cos(y) * (cos(z) - 1.0) - cos(z));
+    const FT gy = M_PI * alpha * sin(y) * (cos(x) * (cos(z) - 1.0) - cos(z));
+    const FT gz = M_PI * alpha * sin(z) * (cos(x) * (cos(y) - 1.0) - cos(y));
+
+    return { gx, gy, gz };
+  }
+};
+
+template <class GeomTraits>
+struct Implicit_iwp
+{
+  using FT = typename GeomTraits::FT;
+  using Vector = typename GeomTraits::Vector_3;
+
+  using Grid = CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>;
+  using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+  using Gradients = CGAL::Isosurfacing::Gradient_function_3<Grid>;
+  using Domain = CGAL::Isosurfacing::internal::Isosurfacing_domain_3<Grid, Values, Gradients>;
+
+  Implicit_iwp(const std::size_t N)
+    : res(2. / N, 2. / N, 2. / N),
+      grid { CGAL::Bbox_3{-1, -1, -1, 1, 1, 1}, CGAL::make_array<std::size_t>(N, N, N) },
+      values { IWPValue<GeomTraits>{}, grid },
+      gradients { IWPGradient<GeomTraits>{}, grid }
+  { }
+
+  Domain domain() const
+  {
+    return { grid, values, gradients };
+  }
+
+  FT iso() const
+  {
+    return 0.;
+  }
+
+private:
+  Vector res;
+  Grid grid;
+  Values values;
+  Gradients gradients;
+};
+
+template <class GeomTraits>
+struct Grid_sphere
+{
+  using Grid = CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>;
+  using Values = CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>;
+  using Gradients = CGAL::Isosurfacing::Interpolated_discrete_gradients_3<Grid>;
+  using Domain = CGAL::Isosurfacing::internal::Isosurfacing_domain_3<Grid, Values, Gradients>;
+
+  using FT = typename GeomTraits::FT;
+  using Point = typename GeomTraits::Point_3;
+
+  Grid_sphere(const std::size_t N)
+    : grid { CGAL::Bbox_3{-1., -1., -1., 1., 1., 1.},
+             CGAL::make_array<std::size_t>(N, N, N) },
+      values { grid },
+      gradients { grid }
+  {
+    const Sphere_value<GeomTraits> sphere_val;
+    const Sphere_gradient<GeomTraits> sphere_grad;
+    const FT resolution = 2.0 / N;
+
+    for(std::size_t x = 0; x < grid.xdim(); x++)
+    {
+      const FT xp = x * resolution - 1.0;
+      for(std::size_t y = 0; y < grid.ydim(); y++)
+      {
+        const FT yp = y * resolution - 1.0;
+        for(std::size_t z = 0; z < grid.zdim(); z++)
+        {
+          const FT zp = z * resolution - 1.0;
+
+          values(x, y, z) = sphere_val(Point(xp, yp, zp));
+          gradients(x, y, z) = sphere_grad(Point(xp, yp, zp));
+        }
+      }
+    }
+  }
+
+  Domain domain() const
+  {
+    return { grid, values, gradients };
+  }
+
+  typename GeomTraits::FT iso() const
+  {
+    return 0.8;
+  }
+
+private:
+  Grid grid;
+  Values values;
+  Gradients gradients;
+};
+
+template <class GeomTraits>
+struct Skull_image
+{
+  using FT = typename GeomTraits::FT;
+  using Grid = CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>;
+  using Values = CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>;
+  using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<GeomTraits>;
+  using Domain = CGAL::Isosurfacing::internal::Isosurfacing_domain_3<Grid, Values, Gradients>;
+
+  Skull_image(const std::size_t N)
+    : grid { },
+      values { grid }
+  {
+    const std::string fname = CGAL::data_file_path("images/skull_2.9.inr");
+    CGAL::Image_3 image;
+    if(!image.read(fname))
+      std::cerr << "Error: Cannot read file " << fname << std::endl;
+
+    Grid grid;
+    Values values { grid };
+    if(!CGAL::Isosurfacing::IO::convert_image_to_grid(image, grid, values))
+      std::cerr << "Error: Cannot convert image to Cartesian grid" << std::endl;
+  }
+
+  Domain domain() const
+  {
+    const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+    Gradients gradients { values, step };
+    return { grid, values, gradients };
+  }
+
+  typename GeomTraits::FT iso() const
+  {
+    return 2.9;
+  }
+
+private:
+  Grid grid;
+  Values values;
+};
+
+int main(int argc, char* argv[])
+{
+  std::size_t N = 100;
+
+  const int argc_check = argc - 1;
+
+  for(int i=1; i<argc; ++i)
+  {
+    if(!strcmp("-N", argv[i]) && i < argc_check)
+      N = std::stoi(argv[++i]);
+  }
+
+#if defined KERNEL_SIMPLE_CARTESIAN_DOUBLE
+  std::cout << "KERNEL_SIMPLE_CARTESIAN_DOUBLE" << std::endl;
+  using Kernel = CGAL::Simple_cartesian<double>;
+#elif defined KERNEL_SIMPLE_CARTESIAN_FLOAT
+  std::cout << "KERNEL_SIMPLE_CARTESIAN_FLOAT" << std::endl;
+  using Kernel = CGAL::Simple_cartesian<float>;
+#elif defined KERNEL_CARTESIAN_DOUBLE
+  std::cout << "KERNEL_CARTESIAN_DOUBLE" << std::endl;
+  using Kernel = CGAL::Cartesian<double>;
+#elif defined KERNEL_EPIC
+  std::cout << "KERNEL_EPIC" << std::endl;
+  using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+#else
+  std::cout << "no kernel selected!" << std::endl;
+  using Kernel = CGAL::Simple_cartesian<double>;
+#endif
+
+  using Point = Kernel::Point_3;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+#if defined SCENARIO_GRID_SPHERE
+  std::cout << "SCENARIO_GRID_SPHERE" << std::endl;
+  auto scenario = Grid_sphere<Kernel>(N);
+#elif defined SCENARIO_IMPLICIT_SPHERE
+  std::cout << "SCENARIO_IMPLICIT_SPHERE" << std::endl;
+  auto scenario = Implicit_sphere<Kernel>(N);
+#elif defined SCENARIO_IMPLICIT_IWP
+  std::cout << "SCENARIO_IMPLICIT_IWP" << std::endl;
+  auto scenario = Implicit_iwp<Kernel>(N);
+#elif defined SCENARIO_SKULL_IMAGE
+  std::cout << "SCENARIO_SKULL_IMAGE" << std::endl;
+  auto scenario = Skull_image<Kernel>(N);
+#else
+  std::cout << "no scenario selected!" << std::endl;
+  auto scenario = Implicit_sphere<Kernel>(N);
+#endif
+
+  Point_range points;
+  Polygon_range polygons;
+
+  CGAL::Real_timer timer;
+  timer.start();
+
+#if defined TAG_PARALLEL
+  std::cout << "TAG_PARALLEL" << std::endl;
+  using Tag = CGAL::Parallel_tag;
+#elif defined TAG_SEQUENTIAL
+  std::cout << "TAG_SEQUENTIAL" << std::endl;
+  using Tag = CGAL::Sequential_tag;
+#else
+  std::cout << "no tag selected!" << std::endl;
+  using Tag = CGAL::Sequential_tag;
+#endif
+
+#if defined ALGO_MARCHING_CUBES
+  std::cout << "ALGO_MARCHING_CUBES" << std::endl;
+  CGAL::Isosurfacing::marching_cubes<Tag>(scenario.domain(), scenario.iso(), points, polygons);
+#elif defined ALGO_DUAL_CONTOURING
+  std::cout << "ALGO_DUAL_CONTOURING" << std::endl;
+  CGAL::Isosurfacing::dual_contouring<Tag>(scenario.domain(), scenario.iso(), points, polygons);
+#else
+  std::cout << "no algorithm selected!" << std::endl;
+  CGAL::Isosurfacing::marching_cubes<Tag>(scenario.domain(), scenario.iso(), points, polygons);
+#endif
+
+  timer.stop();
+
+  if(points.size() > std::numeric_limits<std::size_t>::max() - 2)
+    std::cout << "This should never print and only prevents optimizations" << std::endl;
+
+  std::cout << "internal timer: " << timer.time() << std::endl;
+  std::cout << "internal polygons: " << polygons.size() << std::endl;
+  std::cout << "internal points: " << points.size() << std::endl;
+}
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_size.py b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_size.py
new file mode 100644
index 00000000000..962b10edd43
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_size.py
@@ -0,0 +1,42 @@
+from benchmark_util import *
+
+# KERNEL_SIMPLE_CARTESIAN_DOUBLE
+# KERNEL_SIMPLE_CARTESIAN_FLOAT
+# KERNEL_CARTESIAN_DOUBLE
+# KERNEL_EPIC
+kernel = "KERNEL_CARTESIAN_DOUBLE"
+
+# SCENARIO_GRID_SPHERE
+# SCENARIO_IMPLICIT_SPHERE
+# SCENARIO_IMPLICIT_IWP
+# SCENARIO_SKULL_IMAGE
+scenario = "SCENARIO_SKULL_IMAGE"
+
+# TAG_SEQUENTIAL
+# TAG_PARALLEL
+tag = "TAG_PARALLEL"
+
+# ALGO_MARCHING_CUBES
+# ALGO_DUAL_CONTOURING
+algorithm = "ALGO_DUAL_CONTOURING"
+threads = 1
+exponent = 1.2
+min_cells = 100000
+max_cells = 100000000
+
+build(scenario, kernel, algorithm, tag)
+
+data = []
+
+c = min_cells
+while c < max_cells:
+	n = int(c ** (1.0 / 3.0))
+
+	res = execute(n, threads, 5)
+	data.append([scenario, kernel, algorithm, tag, threads, int(c), res["time"], res["polygons"], res["points"]])
+
+	c *= exponent
+
+df = pd.DataFrame(data, columns=["scenario", "kernel", "algorithm", "tag", "threads", "cells", "time", "polygons", "points"])
+
+df.to_csv("benchmark_size.csv")
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_threads.py b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_threads.py
new file mode 100644
index 00000000000..e53c26236ed
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_threads.py
@@ -0,0 +1,23 @@
+from benchmark_util import *
+
+scenario = "SCENARIO_IMPLICIT_IWP"
+kernel = "KERNEL_SIMPLE_CARTESIAN_DOUBLE"
+algorithm = "ALGO_MARCHING_CUBES"
+tag = "TAG_PARALLEL"
+min_threads = 1
+max_threads = 26
+n = 500
+cells = n ** 3
+
+build(scenario, kernel, algorithm, tag)
+
+data = []
+
+for t in range(min_threads, max_threads + 1):
+	res = execute(n, t, times=5)
+
+	data.append([scenario, kernel, algorithm, tag, t, cells, res["time"], res["bandwidth"]])
+
+df = pd.DataFrame(data, columns=["scenario", "kernel", "algorithm", "tag", "threads", "cells", "time", "bandwidth"])
+
+df.to_csv("benchmark_threads.csv")
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_util.py b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_util.py
new file mode 100644
index 00000000000..8bdc615aca0
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/benchmark_util.py
@@ -0,0 +1,73 @@
+import os
+import sys
+import re
+import subprocess
+import pandas as pd
+
+def print_stream(stream):
+    while True:
+        line = stream.readline()
+        if not line:
+            break
+        print(line, end="")
+
+def run(cmd, output=True):
+    process = subprocess.Popen(cmd, stdout=subprocess.PIPE, stderr=subprocess.PIPE, universal_newlines=True)
+    exit_code = process.wait()
+    if output:
+        print_stream(process.stdout)
+    if exit_code != 0:
+        print_stream(process.stderr)
+        sys.exit(exit_code)
+    return process
+
+def build(scenario, kernel, algorithm, tag):
+    run(["cmake", "-E", "make_directory", "build"])
+    run(["cmake", "-B", "build", "-DCMAKE_BUILD_TYPE=Release", "-DSCENARIO=" + scenario, "-DKERNEL=" + kernel, "-DALGO=" + algorithm, "-DTAG=" + tag, "-DCGAL_DIR=../../../"])
+    run(["make", "-C", "build"])
+
+def execute(n, threads, times=1):
+    measurements = {"time" : 0, "polygons" : 0, "points" : 0, "bandwidth" : 0, "transfer" : 0, "performance" : 0, "clock" : 0, "intensity" : 0}
+
+    for i in range(times):
+        process = run(["likwid-perfctr", "-g", "MEM_DP", "-C", "S0:0-" + str(threads - 1), "./build/benchmark", "-N", str(n)], False)
+
+        for line in process.stdout.readlines():
+            print(line, end='')
+
+            m = re.search(r'internal timer:\s*(\d+)', line)
+            if m is not None:
+                measurements["time"] += int(m.group(1))
+
+            m = re.search(r'internal polygons:\s*(\d+)', line)
+            if m is not None:
+                measurements["polygons"] += int(m.group(1))
+
+            m = re.search(r'internal points:\s*(\d+)', line)
+            if m is not None:
+                measurements["points"] += int(m.group(1))
+
+            m = re.search(r'Memory bandwidth.*\s+(\d+(\.\d+)?) \|\s*$', line)
+            if m is not None:
+                measurements["bandwidth"] += float(m.group(1))
+
+            m = re.search(r'Memory data volume.*\s+(\d+(\.\d+)?) \|\s*$', line)
+            if m is not None:
+                measurements["transfer"] += float(m.group(1))
+
+            m = re.search(r'DP.*\s+(\d+(\.\d+)?) \|\s*$', line)
+            if m is not None:
+                measurements["performance"] += float(m.group(1))
+
+            m = re.search(r'Clock.*\s+(\d+(\.\d+)?) \|\s*$', line)
+            if m is not None:
+                measurements["clock"] += float(m.group(1))
+
+            m = re.search(r'Operational intensity.*\s+(\d+(\.\d+)?) \|\s*$', line)
+            if m is not None:
+                measurements["intensity"] += float(m.group(1))
+
+    for item in measurements.items():
+        measurements[item[0]] = item[1] / times
+
+    return measurements
\ No newline at end of file
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/contouring_seq_vs_parallel_image.cpp b/Isosurfacing_3/benchmark/Isosurfacing_3/contouring_seq_vs_parallel_image.cpp
new file mode 100644
index 00000000000..8085431820f
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/contouring_seq_vs_parallel_image.cpp
@@ -0,0 +1,156 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+
+#include <CGAL/Real_timer.h>
+
+#include <CGAL/Isosurfacing_3/IO/Image_3.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+int main(int argc, char** argv)
+{
+  const std::string fname = (argc > 1) ? argv[1] : CGAL::data_file_path("images/skull_2.9.inr");
+  const FT isovalue = (argc > 2) ? std::stod(argv[2]) : - 2.9;
+
+  // load volumetric image from a file
+  CGAL::Image_3 image;
+  if(!image.read(fname))
+  {
+    std::cerr << "Error: Cannot read image file " << fname << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  // convert image to a Cartesian grid
+  Grid grid;
+  Values values { grid };
+  if(!IS::IO::convert_image_to_grid(image, grid, values))
+  {
+    std::cerr << "Error: Cannot convert image to Cartesian grid" << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+  Gradients gradients { values, step };
+
+  const bool triangulate_faces = false;
+
+  // DC sequential
+  {
+    using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+    Domain domain { grid, values, gradients };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Sequential)" << std::endl;
+    IS::dual_contouring<CGAL::Sequential_tag>(
+      domain, isovalue, points, triangles, CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_image_sequential.off", points, triangles);
+  }
+
+  // DC parallel
+  {
+    using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+    Domain domain { grid, values, gradients };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Parallel)" << std::endl;
+    IS::dual_contouring<CGAL::Parallel_if_available_tag>(
+      domain, isovalue, points, triangles, CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_image_parallel.off", points, triangles);
+  }
+
+  // MC Sequential
+  {
+    using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+    Domain domain { grid, values };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Marching Cubes (Sequential)" << std::endl;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain, isovalue, points, triangles);
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("marching_cubes_image_sequential.off", points, triangles);
+  }
+
+  // MC parallel
+  {
+    using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+    Domain domain { grid, values };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Marching Cubes (Parallel)" << std::endl;
+    IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("marching_cubes_image_parallel.off", points, triangles);
+  }
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/contouring_seq_vs_parallel_implicit.cpp b/Isosurfacing_3/benchmark/Isosurfacing_3/contouring_seq_vs_parallel_implicit.cpp
new file mode 100644
index 00000000000..b5948907efe
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/contouring_seq_vs_parallel_implicit.cpp
@@ -0,0 +1,208 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h>
+
+#include <CGAL/Bbox_3.h>
+#include <CGAL/Real_timer.h>
+#include <CGAL/IO/polygon_soup_io.h>
+#include <CGAL/number_utils.h>
+
+#include <tbb/task_arena.h>
+
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+auto implicit_function = [](const Point& q) -> FT
+{
+  auto cyl = [](const Point& q) { return IS::Shapes::infinite_cylinder<Kernel>(Point(0,0,0), Vector(0,0,1), 0.5, q); };
+  auto cube = [](const Point& q) { return IS::Shapes::box<Kernel>(Point(-0.5,-0.5,-0.5), Point(0.5,0.5,0.5), q); };
+  auto cyl_and_cube = [&](const Point& q) { return IS::Shapes::shape_union<Kernel>(cyl, cube, q); };
+
+  auto sphere = [](const Point& q) { return IS::Shapes::sphere<Kernel>(Point(0,0,0.5), 0.75, q); };
+  return IS::Shapes::shape_difference<Kernel>(cyl_and_cube, sphere, q);
+};
+
+int main(int argc, char** argv)
+{
+  int num_threads = tbb::this_task_arena::max_concurrency();
+  std::cout << "Number of TBB threads: " << num_threads << std::endl;
+
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.;
+  std::cout << "Isovalue: " << isovalue << std::endl;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox = {-2., -2., -2., 2., 2., 2.};
+  Grid grid { bbox, CGAL::make_array<std::size_t>(500, 500, 500) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  // fill up values and gradients
+  Values values { implicit_function, grid };
+
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+  Gradients gradients { values, step };
+
+  const bool triangulate_faces = false;
+
+  // DC parallel
+  {
+    using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+    Domain domain { grid, values, gradients };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Parallel)" << std::endl;
+    IS::dual_contouring<CGAL::Parallel_tag>(
+      domain, isovalue, points, triangles, CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_implicit_parallel.off", points, triangles);
+  }
+
+  // DC sequential
+  {
+    using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+    Domain domain { grid, values, gradients };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Sequential)" << std::endl;
+    IS::dual_contouring<CGAL::Sequential_tag>(
+      domain, isovalue, points, triangles, CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_implicit_sequential.off", points, triangles);
+  }
+
+  // TMC parallel
+  {
+    using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+    Domain domain { grid, values };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- TC Marching Cubes (Parallel)" << std::endl;
+    IS::marching_cubes<CGAL::Parallel_tag>(domain, isovalue, points, triangles);
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("toco_marching_cubes_implicit_parallel.off", points, triangles);
+  }
+
+  // TMC Sequential
+  {
+    using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+    Domain domain { grid, values };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- TC Marching Cubes (Sequential)" << std::endl;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain, isovalue, points, triangles);
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("toco_marching_cubes_implicit_sequential.off", points, triangles);
+  }
+
+  // MC parallel
+  {
+    using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+    Domain domain { grid, values };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Marching Cubes (Parallel)" << std::endl;
+    IS::marching_cubes<CGAL::Parallel_tag>(domain, isovalue, points, triangles,
+                                           CGAL::parameters::use_topologically_correct_marching_cubes(false));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("marching_cubes_implicit_parallel.off", points, triangles);
+  }
+
+  // MC Sequential
+  {
+    using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+    Domain domain { grid, values };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Marching Cubes (Sequential)" << std::endl;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain, isovalue, points, triangles,
+                                             CGAL::parameters::use_topologically_correct_marching_cubes(false));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("marching_cubes_implicit_sequential.off", points, triangles);
+  }
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/benchmark/Isosurfacing_3/graphs.py b/Isosurfacing_3/benchmark/Isosurfacing_3/graphs.py
new file mode 100644
index 00000000000..c2794f76cc9
--- /dev/null
+++ b/Isosurfacing_3/benchmark/Isosurfacing_3/graphs.py
@@ -0,0 +1,87 @@
+
+import pandas as pd
+import numpy as np
+import matplotlib.pyplot as plt
+
+
+def save_svg(file):
+    fig = plt.gcf()
+    fig.set_size_inches((10, 5), forward=False)
+    plt.savefig(file, bbox_inches="tight")
+
+
+def add_threads_graph(data, label):
+    x = data["threads"]
+    y = data["cells"] / data["time"] / 10 ** 3
+    plt.plot(x, y, label=label)
+    plt.legend()
+
+
+def add_size_graph(data, label):
+    x = data["cells"]
+    y = data["cells"] / data["time"] / 10 ** 3
+    plt.plot(x, y, label=label)
+    plt.legend()
+
+
+def add_triangle_graph(data, label, factor):
+    x = data["cells"]
+    y = data["polygons"] * factor
+    plt.plot(x, y, label=label)
+    plt.legend()
+
+
+def plot_graph(file, name, log, ylabel, xlabel):
+    plt.title(name)
+    plt.xlabel(xlabel)
+    plt.ylabel(ylabel)
+    if log:
+        plt.xscale("log")
+    plt.gca().yaxis.grid(color='#cccccc')
+    plt.gca().xaxis.grid(color='#cccccc')
+    plt.ylim(ymin=0)
+    save_svg(file)
+    plt.show()
+
+
+latex_export = True
+if latex_export:
+    #plt.rcParams["svg.fonttype"] = "none"
+    plt.rcParams["axes.unicode_minus"] = False
+    plt.rcParams['font.size'] = "17"
+
+
+data = pd.read_csv("implicit_iwp_mc_1.csv")
+add_threads_graph(data, "MC")
+
+#data = pd.read_csv("threads_grid.csv")
+#add_threads_graph(data, "grid")
+
+xt = np.arange(0, min(max(data["threads"]), 9) + 0.1, 2)
+if max(data["threads"]) > 10:
+    print("more")
+    xt = np.concatenate((xt, np.arange(10, max(data["threads"]) + 0.1, 2)))
+
+yt = np.arange(0, 20 + 0.1, 2)
+
+print(xt)
+plt.xticks(xt)
+plt.yticks(yt)
+plot_graph("perf_threads.svg", "", False, "performance [10^3 cubes/s]", "cores")
+
+
+data = pd.read_csv("size_iwp_mc.csv")
+add_size_graph(data, "MC")
+
+data = pd.read_csv("size_iwp_dc.csv")
+add_size_graph(data, "DC")
+
+plot_graph("perf_size.svg", "", False, "performance [10^3 cubes/s]", "cells")
+
+data = pd.read_csv("size_iwp_mc.csv")
+add_triangle_graph(data, "MC", 1)
+
+data = pd.read_csv("size_iwp_dc.csv")
+add_triangle_graph(data, "DC", 1)
+
+plot_graph("triangles_size.svg", "", False, "triangles", "cells")
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingDomainWithGradient_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingDomainWithGradient_3.h
new file mode 100644
index 00000000000..ff72f3b738d
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingDomainWithGradient_3.h
@@ -0,0 +1,52 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+\cgalRefines{IsosurfacingDomain_3}
+
+\brief The concept `IsosurfacingDomainWithGradient_3` describes the set of requirements to be
+fulfilled by any class used as input data for some isosurfacing algorithms.
+
+This concept refines `IsosurfacingDomain_3` to add a `gradient()` function which is used
+by isosurfacing domains to query the domain for the gradient of the values field
+at a 3D query point (not necessarily a vertex) in space.
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Isosurfacing::Dual_contouring_domain_3}
+\cgalHasModelsEnd
+*/
+class IsosurfacingDomainWithGradient_3
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+  The geometric traits type.
+  Must be a model of `IsosurfacingTraits_3`.
+  */
+  typedef unspecified_type Geom_traits;
+
+  /*!
+  The 3D point type.
+  */
+  typedef Geom_traits::Point_3 Point_3;
+
+  /*!
+  The 3D vector type.
+  */
+  typedef Geom_traits::Vector_3 Vector_3;
+
+  /// @}
+
+  /// \name Operations
+  /// @{
+
+  /*!
+  returns the gradient at the point `p`.
+  */
+  Vector_3 gradient(Point_3 p) const;
+
+  /// @}
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingDomain_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingDomain_3.h
new file mode 100644
index 00000000000..81c14bd1b49
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingDomain_3.h
@@ -0,0 +1,185 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+\brief The concept `IsosurfacingDomain_3` describes the set of requirements to be
+fulfilled by any class used as input data for isosurfacing algorithms.
+
+A model of the concept `IsosurfacingDomain_3` provides a partition of the Euclidean space in cells,
+and a scalar field defined over the whole partition.
+The isosurfacing algorithms traverse these cells and query the domain class
+at the vertices of each cell, using the functions `point()` and `value()`.
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Isosurfacing::Marching_cubes_domain_3}
+\cgalHasModels{CGAL::Isosurfacing::Dual_contouring_domain_3}
+\cgalHasModelsEnd
+
+\sa `IsosurfacingDomainWithGradient_3`
+*/
+class IsosurfacingDomain_3
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+  The geometric traits type.
+  Must be a model of `IsosurfacingTraits_3`.
+  */
+  typedef unspecified_type Geom_traits;
+
+  /*!
+  The scalar type.
+  */
+  typedef Geom_traits::FT FT;
+
+  /*!
+  The 3D point type.
+  */
+  typedef Geom_traits::Point_3 Point_3;
+
+  /*!
+  A descriptor that uniquely identifies a vertex.
+  Must be a model of the concepts `Descriptor` and `Hashable`.
+  */
+  typedef unspecified_type vertex_descriptor;
+
+  /*!
+  A descriptor that uniquely identifies an edge.
+  Must be a model of the concept `Descriptor` and `Hashable`.
+  */
+  typedef unspecified_type edge_descriptor;
+
+  /*!
+  A descriptor that uniquely identifies a cell.
+  Must be a model of the concepts `Descriptor` and `Hashable`.
+  */
+  typedef unspecified_type cell_descriptor;
+
+  /*!
+  A container for the two vertices of an edge.
+  Must be a model of the concept `RandomAccessContainer` of size `2` whose value type is `vertex_descriptor`.
+  */
+  typedef unspecified_type Edge_vertices;
+
+  /*!
+  A container for the cells incident to an edge.
+  Must be a model of the concept `ForwardRange` whose value type is `cell_descriptor`.
+  */
+  typedef unspecified_type Cells_incident_to_edge;
+
+  /*!
+  A container for the vertices of a cell.
+  Must be a model of the concept `ForwardRange` whose value type is `vertex_descriptor`.
+  */
+  typedef unspecified_type Cell_vertices;
+
+  /*!
+  A container for the edges of a cell.
+  Must be a model of the concept `ForwardRange` whose value type is `edge_descriptor`.
+  */
+  typedef unspecified_type Cell_edges;
+
+
+  /// @}
+
+  /// \name Operations
+  /// @{
+
+  /*!
+  returns the geometric traits.
+  */
+  Geom_traits geom_traits();
+
+  /*!
+  returns the 3D location of the vertex `v`.
+  */
+  Point_3 point(vertex_descriptor v) const;
+
+  /*!
+  returns the value of the value field at the point `p`.
+  */
+  FT value(Point_3 p) const;
+
+  /*!
+  returns the value of the value field at the vertex `v`.
+  */
+  FT value(vertex_descriptor v) const;
+
+  /*!
+  returns the two vertices incident to the edge `e`.
+  */
+  Edge_vertices incident_vertices(edge_descriptor e) const;
+
+  /*!
+  returns all the cells incident to the edge `e`, in a clockwise or counterclockwise order.
+  */
+  Cells_incident_to_edge incident_cells(edge_descriptor e) const;
+
+  /*!
+  returns all the vertices of the cell `c`.
+  */
+  Cell_vertices cell_vertices(cell_descriptor c) const;
+
+  /*!
+  returns all the edges of the cell `c`.
+  */
+  Cell_edges cell_edges(cell_descriptor c) const;
+
+  /*!
+  iterates over all vertices, and calls the functor `f` on each one.
+
+  \tparam ConcurrencyTag decides if the vertices are iterated sequentially or in parallel.
+  Can be either `CGAL::Sequential_tag`, `CGAL::Parallel_if_available_tag`, or `CGAL::Parallel_tag`.
+  \tparam Functor must implement `void operator()(vertex_descriptor vertex)`
+
+  \param f the functor called on every vertex
+  */
+  template <typename ConcurrencyTag, typename Functor>
+  void for_each_vertex(Functor& f) const;
+
+  /*!
+  iterates over all edges, and calls the functor `f` on each one.
+
+  \tparam ConcurrencyTag decides if the edges are iterated sequentially or in parallel.
+  Can be either `CGAL::Sequential_tag`, `CGAL::Parallel_if_available_tag`, or `CGAL::Parallel_tag`.
+  \tparam Functor must implement `void operator()(edge_descriptor edge)`.
+
+  \param f the functor called on every edge
+  */
+  template <typename ConcurrencyTag, typename Functor>
+  void for_each_edge(Functor& f) const;
+
+  /*!
+  iterates over all cells, and calls the functor `f` on each one.
+
+  \tparam ConcurrencyTag decides if the cells are iterated sequentially or in parallel.
+  Can be either `CGAL::Sequential_tag`, `CGAL::Parallel_if_available_tag`, or `CGAL::Parallel_tag`.
+  \tparam Functor must implement `void operator()(cell_descriptor cell)`.
+
+  \param f the functor called on every cell
+  */
+  template <typename ConcurrencyTag, typename Functor>
+  void for_each_cell(Functor& f) const;
+
+  /*!
+  Constructs the intersection - if it exists - between an edge and an isosurface.
+
+  \param p_0 the location of the first vertex of the edge
+  \param p_1 the location of the second vertex of the edge
+  \param val_0 the value at the first vertex of the edge
+  \param val_1 the value at the second vertex of the edge
+  \param isovalue the isovalue defining the isosurface with which we seek an intersection
+  \param p the intersection point, if it exists
+
+  \returns `true` if the intersection point exists, `false` otherwise.
+  */
+  bool construct_intersection(Point_3 p_0, Point_3 p_1,
+                              FT val_0, FT val_1,
+                              FT isovalue,
+                              Point_3& p) const;
+
+  /// @}
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingEdgeIntersectionOracle_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingEdgeIntersectionOracle_3.h
new file mode 100644
index 00000000000..c5177d2299f
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingEdgeIntersectionOracle_3.h
@@ -0,0 +1,44 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+\cgalRefines{DefaultConstructible, Assignable}
+
+The concept `IsosurfacingEdgeIntersectionOracle_3` describes the requirements for the edge-isosurface
+intersection oracle template parameter of the domain classes
+`CGAL::Isosurfacing::Marching_cubes_domain_3` and
+`CGAL::Isosurfacing::Dual_contouring_domain_3`.
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Isosurfacing::Dichotomy_edge_intersection}
+\cgalHasModels{CGAL::Isosurfacing::Linear_interpolation_edge_intersection}
+\cgalHasModelsEnd
+*/
+class IsosurfacingEdgeIntersectionOracle_3
+{
+public:
+  /*!
+   * \brief computes the intersection point between an edge and the isosurface.
+   *
+   * \tparam Domain must be a model of `IsosurfacingDomain_3`
+   *
+   * \param p_0 the location of the first vertex of the edge
+   * \param p_1 the location of the second vertex of the edge
+   * \param val_0 the value at the first vertex of the edge
+   * \param val_1 the value at the second vertex of the edge
+   * \param domain the isosurfacing domain
+   * \param isovalue the isovalue defining the isosurface with which we seek an intersection
+   * \param p the intersection point, if it exists
+   *
+   * \returns `true` if the intersection point exists, `false` otherwise.
+   */
+  template <typename Domain>
+  bool operator()(typename Domain::Geom_traits::Point_3 p_0,
+                  typename Domain::Geom_traits::Point_3 p_1,
+                  typename Domain::Geom_traits::FT val_0,
+                  typename Domain::Geom_traits::FT val_1,
+                  Domain domain,
+                  typename Domain::Geom_traits::FT isovalue,
+                  typename Domain::Geom_traits::Point_3& p) const;
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingGradientField_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingGradientField_3.h
new file mode 100644
index 00000000000..26369fac7fa
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingGradientField_3.h
@@ -0,0 +1,38 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+The concept `IsosurfacingGradientField_3` describes the set of requirements to be fulfilled
+by the gradient field template parameter of the domain class `CGAL::Isosurfacing::Dual_contouring_domain_3`.
+
+Gradient fields must be continuous and defined over the geometric span of the
+space partitioning data structure (also known as "partition") being used.
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Isosurfacing::Gradient_function_3}
+\cgalHasModels{CGAL::Isosurfacing::Finite_difference_gradient_3}
+\cgalHasModels{CGAL::Isosurfacing::Interpolated_discrete_gradients_3}
+\cgalHasModelsEnd
+
+\sa `IsosurfacingTraits_3`
+\sa `IsosurfacingValueField_3`
+*/
+class IsosurfacingGradientField_3
+{
+public:
+  /*!
+  * The 3D point type.
+  */
+  typedef unspecified_type Point_3;
+
+  /*!
+  * The 3D vector type.
+  */
+  typedef unspecified_type Vector_3;
+
+  /*!
+  returns the gradient at the point `p`.
+  */
+  Vector_3 operator()(Point_3 p) const;
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingInterpolationScheme_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingInterpolationScheme_3.h
new file mode 100644
index 00000000000..0b983312496
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingInterpolationScheme_3.h
@@ -0,0 +1,58 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+\cgalRefines{DefaultConstructible, Assignable}
+
+The concept `IsosurfacingInterpolationScheme_3` describes the set of requirements to be fulfilled
+by the interpolation scheme template parameter of the domain classes `CGAL::Isosurfacing::Interpolated_discrete_values_3` and `CGAL::Isosurfacing::Interpolated_discrete_gradients_3`.
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Isosurfacing::Trilinear_interpolation}
+\cgalHasModelsEnd
+*/
+class IsosurfacingInterpolationScheme_3
+{
+public:
+  /*!
+  * The geometric traits type.
+  * Must be a model of `IsosurfacingTraits_3`.
+  */
+  typedef unspecified_type Geom_traits;
+
+  /*!
+  * The scalar type.
+  */
+  typedef unspecified_type FT;
+
+  /*!
+  * The 3D point type.
+  */
+  typedef unspecified_type Point_3;
+
+  /*!
+  * The 3D vector type.
+  */
+  typedef unspecified_type Vector_3;
+
+  /*!
+  * \brief interpolates the value of the value field at the point `p` using values defined by `vr`
+  * over the grid `g`.
+  *
+  * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3`
+  * \tparam ValueRange must be a model of `RandomAccessRange` with `FT` as value type
+  */
+  template <typename Grid, typename ValueRange>
+  FT interpolated_value(Point_3 p, Grid g, ValueRange vr) const;
+
+  /*!
+   * \brief interpolates the gradient of the gradient field at the point `p`
+   *        using gradients defined by `gr` over the grid `g`.
+   *
+   * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3`
+   * \tparam GradientRange must be a model of `RandomAccessRange` with `Vector_3` as value type
+   */
+  template <typename Grid, typename GradientRange>
+  Vector_3 interpolated_gradient(Point_3 p, Grid g, GradientRange gr) const;
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingPartition_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingPartition_3.h
new file mode 100644
index 00000000000..2a56f46e72a
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingPartition_3.h
@@ -0,0 +1,34 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+The concept `IsosurfacingPartition_3` describes the set of requirements to be fulfilled
+by the partition template parameter of the domain classes `CGAL::Isosurfacing::Marching_cubes_domain_3`
+and `CGAL::Isosurfacing::Dual_contouring_domain_3`.
+
+A 3D partition is a space partitioning data structure that provides a discrete representation
+of a subset of 3D space.
+
+A partial specialization of `CGAL::Isosurfacing::partition_traits` must be provided for all models.
+This is similar to graph traits in \ref PkgBGL.
+
+\cgalHasModelsBegin
+\cgalHasModels{`CGAL::Isosurfacing::Cartesian_grid_3`}
+\cgalHasModels{`CGAL::Octree`}
+\cgalHasModelsEnd
+*/
+class IsosurfacingPartition_3
+{
+public:
+  /*!
+   * The geometric traits type.
+   * Must be a model of `IsosurfacingTraits_3`.
+  */
+  typedef unspecified_type Geom_traits;
+
+  /*!
+   * \returns the geometric traits.
+  */
+  Geom_traits geom_traits();
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingTraits_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingTraits_3.h
new file mode 100644
index 00000000000..d1aec7ee26c
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingTraits_3.h
@@ -0,0 +1,165 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+\cgalRefines{DefaultConstructible, Assignable}
+
+The concept `IsosurfacingTraits_3` describes the set of requirements to be
+fulfilled by the traits class of a model of `IsosurfacingDomain_3`.
+
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the concept `Kernel`}
+\cgalHasModelsEnd
+*/
+class IsosurfacingTraits_3
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+  The scalar type.
+  Must be a model of `FieldNumberType`.
+  */
+  typedef unspecified_type FT;
+
+  /*!
+  The 3D point type.
+  Must be a model of `Kernel::Point_3`.
+  */
+  typedef unspecified_type Point_3;
+
+  /*!
+  The 3D vector type.
+  Must be a model of `Kernel::Vector_3`.
+  */
+  typedef unspecified_type Vector_3;
+
+  /*!
+  The 3D cuboid type.
+  Must be a model of `Kernel::IsoCuboid_3`
+  */
+  typedef unspecified_type IsoCuboid_3;
+
+  /*!
+  A construction object that must provide the function operators:
+
+  `FT operator()(Point_3 p)`
+
+  and
+
+  `FT operator()(Vector_3 p)`
+
+  which return the \f$ x\f$-coordinate of the point and the vector, respectively.
+  */
+  typedef unspecified_type Compute_x_3;
+
+  /*!
+  A construction object that must provide the function operators:
+
+  `FT operator()(Point_3 p)`
+
+  and
+
+  `FT operator()(Vector_3 p)`
+
+  which return the \f$ y\f$-coordinate of the point and the vector, respectively.
+  */
+  typedef unspecified_type Compute_y_3;
+
+  /*!
+  A construction object that must provide the function operators:
+
+  `FT operator()(Point_3 p)`
+
+  and
+
+  `FT operator()(Vector_3 p)`
+
+  which return the \f$ z\f$-coordinate of the point and the vector, respectively.
+  */
+  typedef unspecified_type Compute_z_3;
+
+  /*!
+  A construction object that must provide the function operator:
+
+  `Point_3 operator()(FT x, FT y, FT z)`
+
+  which constructs a 3D point from its three coordinates.
+  */
+  typedef unspecified_type Construct_point_3;
+
+  /*!
+  A construction object that must provide the function operator:
+
+  `Vector_3 operator()(FT x, FT y, FT z)`
+
+  which constructs a 3D vector from its three coordinates.
+  */
+  typedef unspecified_type Construct_vector_3;
+
+  /*!
+  A construction object that must provide the function operator:
+
+  `IsoCuboid_3 operator()(Point_3 p, Point_3 q)`
+
+  which constructs an iso-oriented cuboid with diagonal opposite vertices `p` and `q`
+  such that `p` is the lexicographically smallest point in the cuboid.
+  */
+  typedef unspecified_type Construct_iso_cuboid_3;
+
+  /*!
+  A construction object that must provide the function operator:
+
+  `Point_3 operator()(IsoCuboid_3 c, int i)`
+
+  which returns the i-th vertex of an iso-cuboid `c`. See `Kernel::ConstructVertex_3`
+  for the order of vertices.
+  */
+  typedef unspecified_type Construct_vertex_3;
+
+  /// @}
+
+  /// \name Operations
+  /// The following functions give access to the predicate and construction objects:
+  /// @{
+
+  /*!
+
+  */
+  Compute_x_3 compute_x_3_object();
+
+  /*!
+
+  */
+  Compute_y_3 compute_y_3_object();
+
+  /*!
+
+  */
+  Compute_z_3 compute_z_3_object();
+
+  /*!
+
+  */
+  Construct_point_3 construct_point_3_object();
+
+  /*!
+
+  */
+  Construct_vector_3 construct_vector_3_object();
+
+  /*!
+
+  */
+  Construct_iso_cuboid_3 construct_iso_cuboid_3_object();
+
+  /*!
+
+  */
+  Construct_vertex_3 construct_vertex_3_object();
+
+  /// @}
+
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingValueField_3.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingValueField_3.h
new file mode 100644
index 00000000000..3b8bae76ddf
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/IsosurfacingValueField_3.h
@@ -0,0 +1,47 @@
+/*!
+\ingroup PkgIsosurfacing3Concepts
+
+\cgalConcept
+
+The concept `IsosurfacingValueField_3` describes the set of requirements to be fulfilled
+by the value field template parameter of the domain classes `CGAL::Isosurfacing::Marching_cubes_domain_3` and `CGAL::Isosurfacing::Dual_contouring_domain_3`.
+
+Value fields must be continuous and defined over the geometric span of the
+space partitioning data structure (also known as "partition") being used.
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Isosurfacing::Value_function_3}
+\cgalHasModels{CGAL::Isosurfacing::Interpolated_discrete_values_3}
+\cgalHasModelsEnd
+
+\sa `IsosurfacingTraits_3`
+\sa `IsosurfacingGradientField_3`
+*/
+class IsosurfacingValueField_3
+{
+public:
+  /*!
+  * The scalar type.
+  */
+  typedef unspecified_type FT;
+
+  /*!
+  * The 3D point type.
+  */
+  typedef unspecified_type Point_3;
+
+  /*!
+  * A descriptor that uniquely identifies a vertex (see `IsosurfacingPartition_3`).
+  */
+  typedef unspecified_type vertex_descriptor;
+
+  /*!
+  returns the value of the field at the point `p`.
+  */
+  FT operator()(Point_3 p);
+
+  /*!
+  returns the value of the field at the vertex `v`.
+  */
+  FT operator()(vertex_descriptor v);
+};
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Concepts/partition_traits.h b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/partition_traits.h
new file mode 100644
index 00000000000..b92956d848d
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Concepts/partition_traits.h
@@ -0,0 +1,126 @@
+namespace CGAL {
+namespace Isosurfacing {
+
+/*!
+ * \ingroup PkgIsosurfacing3Concepts
+ *
+ * \relates IsosurfacingPartition_3
+ *
+ * The class `partition_traits` is the API compatibility layer between a model of `IsosurfacingPartition_3`
+ * and the isosurfacing domain classes `CGAL::Isosurfacing::Marching_cubes_domain_3` and
+ * `CGAL::Isosurfacing::Dual_contouring_domain_3`.
+ *
+ * For each model of `IsosurfacingPartition_3`, a partial specialization of `partition_traits` must be provided,
+ * providing the types and functions listed below. Such a partial specialization is provided
+ * for `CGAL::Isosurfacing::Cartesian_grid_3`.
+ */
+template <typename IsosurfacingPartition_3>
+class partition_traits
+{
+public:
+  /*!
+   * A vertex descriptor corresponds to a unique vertex in an abstract partition instance.
+   */
+  typedef unspecified_type vertex_descriptor;
+
+  /*!
+   * An edge descriptor corresponds to a unique edge in an abstract partition instance.
+   */
+  typedef unspecified_type edge_descriptor;
+
+  /*!
+   * A cell descriptor corresponds to a unique edge in an abstract partition instance.
+   */
+  typedef unspecified_type cell_descriptor;
+
+  /*!
+   * A container for the two vertices of an edge.
+   * Must be a model of `RandomAccessContainer` whose `value_type` must be `vertex_descriptor`.
+   */
+  typedef unspecified_type Edge_vertices;
+
+  /*!
+   * A container for the cells incident to an edge.
+   * Must be a model of `ForwardRange` whose `value_type` must be `cell_descriptor`.
+   */
+  typedef unspecified_type Cells_incident_to_edge;
+
+  /*!
+   * A container for the vertices of a cell.
+   * Must be a model of `ForwardRange` whose `value_type` must be `vertex_descriptor`.
+   */
+  typedef unspecified_type Cell_vertices;
+
+  /*!
+   * A container for the edges of a cell.
+   * Must be a model of `ForwardRange` whose `value_type` must be `edge_descriptor`.
+   */
+  typedef unspecified_type Cell_edges;
+
+  /*!
+   * \returns the 3D location of the vertex `v`.
+   */
+  static Point_3 point(vertex_descriptor v, IsosurfacingPartition_3 partition);
+
+  /*!
+   * \returns the two vertices incident to the edge `e`.
+   */
+  static Edge_vertices incident_vertices(edge_descriptor e, IsosurfacingPartition_3 partition);
+
+  /*!
+   * \returns all the cells incident to the edge `e`, in a geometrically ordered manner around the edge.
+   */
+  static Cells_incident_to_edge incident_cells(edge_descriptor e, IsosurfacingPartition_3 partition);
+
+  /*!
+   * \returns all the vertices of the cell `c`.
+   */
+  static Cell_vertices cell_vertices(cell_descriptor c, IsosurfacingPartition_3 partition);
+
+  /*!
+   * \returns all the edges of the cell `c`.
+   */
+  static Cell_edges cell_edges(cell_descriptor c, IsosurfacingPartition_3 partition);
+
+  /*!
+   * iterates over all vertices, and calls the functor `f` on each one.
+   *
+   * \tparam ConcurrencyTag decides if the vertices are iterated sequentially or in parallel.
+   * Can be either `CGAL::Sequential_tag`, `CGAL::Parallel_if_available_tag`, or `CGAL::Parallel_tag`.
+   * \tparam Functor must implement `void operator()(vertex_descriptor vertex)`
+   *
+   * \param f the functor called on every vertex
+   * \param partition the partition whose vertices are being iterated over
+  */
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_vertex(Functor& f, IsosurfacingPartition_3 partition);
+
+  /*!
+   * iterates over all edges, and calls the functor `f` on each one.
+   *
+   * \tparam ConcurrencyTag decides if the edges are iterated sequentially or in parallel.
+   * Can be either `CGAL::Sequential_tag`, `CGAL::Parallel_if_available_tag`, or `CGAL::Parallel_tag`.
+   * \tparam Functor must implement `void operator()(edge_descriptor edge)`.
+   *
+   * \param f the functor called on every edge
+   * \param partition the partition whose edges are being iterated over
+   */
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_edge(Functor& f, IsosurfacingPartition_3 partition);
+
+  /*!
+   * iterates over all cells, and calls the functor `f` on each one.
+   *
+   * \tparam ConcurrencyTag decides if the cells are iterated sequentially or in parallel.
+   * Can be either `CGAL::Sequential_tag`, `CGAL::Parallel_if_available_tag`, or `CGAL::Parallel_tag`.
+   * \tparam Functor must implement `void operator()(cell_descriptor cell)`.
+   *
+   * \param f the functor called on every cell
+   * \param partition the partition whose cells are being iterated over
+   */
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_cell(Functor& f, IsosurfacingPartition_3 partition);
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Doxyfile.in b/Isosurfacing_3/doc/Isosurfacing_3/Doxyfile.in
new file mode 100644
index 00000000000..4f7982c68b0
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Doxyfile.in
@@ -0,0 +1,14 @@
+@INCLUDE = ${CGAL_DOC_PACKAGE_DEFAULTS}
+
+PROJECT_NAME = "CGAL ${CGAL_DOC_VERSION} - 3D Isosurfacing"
+
+HTML_EXTRA_FILES           =  ${CGAL_PACKAGE_DOC_DIR}/fig/isosurfacing_teaser.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC_cases.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC_DC.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC_DC_open.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/DC.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/isosurfacing_inrimage.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC_TMC.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC_octree.png \
+                              ${CGAL_PACKAGE_DOC_DIR}/fig/MC_DC_performance.png
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/Isosurfacing_3.txt b/Isosurfacing_3/doc/Isosurfacing_3/Isosurfacing_3.txt
new file mode 100644
index 00000000000..fa8f7b51115
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/Isosurfacing_3.txt
@@ -0,0 +1,370 @@
+namespace CGAL {
+/*!
+
+\mainpage User Manual
+\anchor Chapter_Isosurfacing3
+
+\cgalAutoToc
+\author Mael Rouxel-Labbé, Julian Stahl, Daniel Zint, and Pierre Alliez
+
+\cgalFigureAnchor{IsosurfacingTeaser}
+<center>
+<img src="isosurfacing_teaser.png" style="max-width:50%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingTeaser}
+Generating a surface from a 3D gray level image using Marching Cubes (3D input image from qim.dk)
+\cgalFigureCaptionEnd
+
+\section SecIsoSurfacingIntroduction Introduction
+
+Given a field of a scalar values, an isosurface is defined as the locus of points where the field
+has a given constant value; in other words, it is a level set.
+This constant value is referred to as the "isovalue", and, for well-behaved fields,
+the level set forms a surface.
+In the following, we shall refer to the the field of scalar values as the value field.
+"Isosurfacing", also known as "isosurface extraction" or "contouring", is the process of constructing
+the isosurface corresponding to a given value field and isovalue.
+%Isosurfacing is often needed for volume visualization and for the simulation of physical phenomena.
+
+This \cgal package provides methods to extract isosurfaces from 3D value fields.
+These contouring techniques rely on the partition of the 3D space and of the field to construct
+an approximate representation of the isosurface.
+The 3D value field can be described through various representations: an implicit function,
+an interpolated set of discrete sampling values, a 3D image, etc. (see \ref SecIsosurfacingExamples).
+The isovalue is user-defined.
+The output is a polygon soup, made either of triangles or quads depending on the method,
+and may consist of a single connected component, or multiple, disjoint components.
+Note that due to the inherent approximate nature of these discrete methods that only sample 3D value fields,
+parts of the "true" isosurface may be missing from the output, and the output may contain artifacts
+that are not present in the true isosurface.
+
+\section SecIsosurfacingMethods Isosurfacing Methods
+
+The scientific literature abounds with algorithms for extracting isosurfaces, each coming
+with different properties for the output and requirements for the input \cgalCite{cgal:dljjaw-sisp-15}.
+This package offers the following methods
+
+<ul>
+ <li>\ref SubSecMarchingCubes : a simple and efficient method that generates a triangle mesh, with almost no guarantees.</li>
+ <li>\ref SubSecTMC : an extension to Marching Cubes that provides additional guarantees for the output.</li>
+ <li>\ref SubSecDualContouring : a method that generates a polygon mesh, with a focus on sharp features recovery.</li>
+</ul>
+
+\subsection SubSecMarchingCubes Marching Cubes (MC)
+
+Marching Cubes (MC) \cgalCite{LC87} uses a volumetric grid, i.e., a 3D iso-cuboid partitioned into hexahedral cells.
+All cells of the grid are processed individually using values of the value field sampled at the grid corners.
+Each cell corner is assigned a sign (+/-) to indicate whether its value field value is above
+or below the user-defined isovalue.
+A vertex is created along each grid edge where a sign change occurs, i.e., where the edge intersects the isosurface.
+More specifically, the vertex location is computed using linear interpolation of
+the value field values evaluated at the cell corners forming the edge.
+These vertices are connected to form triangles within the cell, depending on the configuration
+of signs at the cell corners. \cgalFigureRef{IsosurfacingMCCases} illustrates the configurations in 2D.
+In 3D, there are no less than 33 configurations (not shown) \cgalCite{cgal:c-mcctci-95}.
+
+\cgalFigureAnchor{IsosurfacingMCCases}
+<center>
+<img src="MC_cases.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingMCCases}
+Examples of some configurations for 2D Marching Cubes.
+\cgalFigureCaptionEnd
+
+The implementation within \cgal is generic in the sense that it can process any grid-like data structure
+that consists of hexahedral cells. When the hexahedral grid is a conforming grid (meaning that the
+intersection of two hexahedral cells is a face, an edge, or a vertex), the Marching Cubes algorithm
+generates as output a surface triangle mesh that is almost always combinatorially 2-manifold,
+yet can still exhibit topological issues such as holes or non-conforming edges.
+
+If the mesh is 2-manifold and the isosurface does not intersect the domain boundary,
+then the output mesh is watertight. As the Marching Cubes algorithm uses linear interpolation
+of the sampled value field along the grid edges, it can miss details or components
+that are not captured by the sampling of the value field.
+
+Compared to other meshing approaches such as Delaunay refinement, Marching Cubes is substantially faster,
+but often tends to generate more triangle facets for an equivalent desired sizing field.
+In addition, the quality of the triangle facets is in general poor, with many needle or cap-shaped triangles.
+
+Furthermore, Marching Cubes does not preserve the sharp features present in the isovalue of the input value field (see \cgalFigureRef{IsosurfacingMCDC}).
+
+\subsection SubSecTMC Topologically Correct Marching Cubes (TMC)
+
+Topologically Correct Marching Cubes is an extension to the Marching Cubes algorithm
+which provides additional guarantees for the output \cgalCite{cgal:g-ctcmi-16}.
+More specifically, it generates as output a mesh that is homeomorphic to the trilinear interpolant of the input value field inside each cube. This means that the output mesh can accurately represent small complex features.
+For example, a tunnel of the isosurface within a single cell is topologically resolved.
+To achieve this, the algorithm can insert additional vertices within cells.
+Furthermore, the mesh is guaranteed to be 2-manifold and watertight, as long as the isosurface
+does not intersect the domain boundaries.
+
+\cgalFigureAnchor{IsosurfacingMCTMC}
+<center>
+<img src="MC_TMC.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingMCTMC}
+Marching Cubes vs Topologically Correct Marching Cubes.
+Some vertex values can represent complex surfaces within a single cell: on the left,
+the values at the vertices of the cell have been interpolated within the cell and correspond
+to a tunnel-like surface. This surface is not correctly recovered when applying the cases of
+the Marching Cubes algorithm to the cell: 2 independent disk-like sheets are created (middle).
+However, by inserting new vertices, TMC correctly captures the topology within a single cell (right).
+\cgalFigureCaptionEnd
+
+\subsection SubSecDualContouring Dual Contouring (DC)
+
+%Dual Contouring (DC) \cgalCite{cgal:jlsw-dchd-02} is a method that does not generate vertices
+on the grid edges, but within cells instead. A facet is created for each edge that intersects the isosurface
+by connecting the vertices of the incident cells. For a uniform hexahedral grid, this results
+in a quadrilateral surface mesh. %Dual Contouring can deal with any domain but guarantees
+neither a 2-manifold nor a watertight mesh. On the other hand, it generates fewer faces
+and higher quality faces than Marching Cubes, in general. Finally, its main advantage over Marching Cubes
+is its ability to recover sharp creases and corners.
+
+\cgalFigureAnchor{IsosurfacingMCDC}
+<center>
+<img src="MC_DC.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingMCDC}
+Comparison between a mesh of a CSG shape generated by Marching Cubes (left) and %Dual Contouring (right).
+\cgalFigureCaptionEnd
+
+In addition to the 3D value field, %Dual Contouring requires knowledge about the gradient of the value field.
+
+The \cgal implementation uses a vertex positioning strategy based on *Quadric Error Metrics* \cgalCite{gh-ssqem-97} :
+for a cell, the vertex location is computed by minimizing the error to the sum of the quadrics
+defined at each edge-isosurface intersection.
+Using this approach, the vertex may be located outside the cell, which is a desirable property
+to improve the odds of recovering sharp features, but it might also create self-intersections.
+Users can choose to constrain the vertex location inside the cell.
+
+By default, %Dual Contouring generates quads, but using edge-isosurface intersections,
+one can "star" these quads to generate four triangles. Triangulating the quads is the default behavior in \cgal,
+but this can be changed using a named parameter.
+
+\subsection SubSecIsosurfacingComparison Comparisons
+
+The following table summarizes the differences between the algorithms in terms of constraints
+over the input 3D domain, the facets of the output surface mesh, and the properties
+of the output surface mesh.
+
+<center>
+|  Algorithm        | Facets      | 2-Manifold | Watertight*   | Topologically Correct | Recovery of Sharp Features |
+| ----              | ----        | ----       | ----          | ----                  | ----                       |
+  MC                | Triangles   | no         | no            | no                    | no                         |
+  TMC               | Triangles   | yes        | yes           | yes                   | no                         |
+  DC                | Quads**    | no         | no            | no                    | yes (not guaranteed)       |
+
+(* assuming the isosurface does not exit the specified bounding box of the input 3D domain)
+
+(** which can be triangulated on-the-fly)
+</center>
+
+Note that the output mesh has boundaries when the isosurface intersects the domain boundaries,
+regardless of the method (see \cgalFigureRef{IsosurfacingOpen}).
+
+\cgalFigureAnchor{IsosurfacingOpen}
+<center>
+<img src="MC_DC_open.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingOpen}
+Outputs of Marching Cubes (left) and %Dual Contouring (right) for an implicit sphere
+of radius `1.1` and a domain of size `2x2x2`, both centered at the origin.
+Output meshes can have boundaries when the isosurface intersects the domain boundary.
+\cgalFigureCaptionEnd
+
+\section SecInterface Interface
+
+The following functions are the main entry points to the isosurfacing algorithms of this package:
+<ul>
+ <li>Marching Cubes</li>: `CGAL::Isosurfacing::marching_cubes()`, using the named parameter: `use_topologically_correct_marching_cubes` set to `false`;
+ <li>Topologically Correct Marching Cubes</li>: `CGAL::Isosurfacing::marching_cubes()`, using the named parameter: `use_topologically_correct_marching_cubes` set to `true`;
+ <li>%Dual Contouring</li>: `CGAL::Isosurfacing::dual_contouring()`.
+</ul>
+
+All these free functions share the same signature:
+
+\code{.cpp}
+template <typename ConcurrencyTag = CGAL::Sequential_tag,
+          typename Domain,
+          typename PointRange,
+          typename PolygonRange>
+void ...(const Domain& domain,
+         const typename Domain::FT isovalue,
+         PointRange& points,
+         PolygonRange& polygons,
+         ...);
+\endcode
+
+The input (space partition, value field, gradient field) is provided in the form of a `domain`,
+see \ref SubSecIsosurfacingDomains for a complete description.
+
+The `isovalue` scalar parameter is the value that defines the isosurface being approximated.
+
+The output discrete surface is provided in the form of a polygon soup, which is stored into
+two containers: `points` and `polygons`. Depending on the algorithm, the polygon soup may
+store either unorganized polygons with no relationship to one another (i.e., no connectivity is shared between them)
+or polygons sharing points (the same point in adjacent polygons will be the same point in the point range).
+
+All isosurfacing algorithms can run either sequentially in one thread or in parallel using multithreading.
+The template parameter `ConcurrencyTag` is used to specify how the algorithm is executed.
+To enable parallelism, \cgal must be linked with the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a> (see the CMakeLists.txt file in the examples folder).
+
+\subsection SubSecIsosurfacingDomains Domains
+
+A domain is an object that provides functions to access the partition of the 3D volume,
+the value field, and, optionally, the gradient field at a given point query.
+These requirements are described through two concepts: `IsosurfacingDomain_3` and `IsosurfacingDomainWithGradient_3`.
+
+Two domains, `CGAL::Isosurfacing::Marching_cubes_domain_3` and `CGAL::Isosurfacing::Dual_contouring_domain_3`,
+are provided as the respective default class models that fulfill the requirements of the concepts.
+Both these domain models have template parameters enabling the user to customize the domain:
+- <b>Partition:</b> this must be a class that describes the partition of the 3D volume into cells.
+                    The most basic example of such a class is `CGAL::Isosurfacing::Cartesian_grid_3`, but users
+                    can pass their own partition, provided it meets the requirements described
+                    by the concept `IsosurfacingPartition_3`.
+- <b>ValueField:</b> this must be a class that provides the 3D value field at the vertices of the partition.
+                     A few classes are provided, such as `CGAL::Isosurfacing::Value_function_3` and
+                     `CGAL::Isosurfacing::Interpolated_discrete_values_3`. Users can pass their own value class,
+                     provided it meets the requirements described by the concept `IsosurfacingValueField_3`.
+- <b>GradientField:</b> (`CGAL::Isosurfacing::Dual_contouring_domain_3` only) this must be a class that provides the gradient
+                                                                              of the value field at the vertices of the partition.
+                                                                              A few classes are provided by default, such as
+                                                                              `CGAL::Isosurfacing::Finite_difference_gradient_3` and
+                                                                              `CGAL::Isosurfacing::Interpolated_discrete_gradients_3`.
+                                                                              Users can pass their own gradient class,
+                                                                              provided it meets the requirements described
+                                                                              by the concept `IsosurfacingGradientField_3`.
+- <b>EdgeIntersectionOracle:</b> this must be a class that provides a function to compute the intersection
+                                 between an edge and the isosurface. The default is linear interpolation
+                                 for `CGAL::Isosurfacing::Marching_cubes_domain_3`, and a dichotomy
+                                 for `CGAL::Isosurfacing::Dual_contouring_domain_3`. This parameter should
+                                 be adjusted depending on how the value field is defined: there is for
+                                 example no point incorporating a dichotomy in %Dual Contouring if the value field is defined
+                                 through linear interpolation. Users can pass their own edge intersection
+                                 oracle, provided it meets the requirements described by the concept
+                                 `IsosurfacingEdgeIntersectionOracle_3`.
+
+<!-- comment this for now. MC and TMC timings are probably not good
+
+\section SecPerformance Performance
+
+Due to their cell-based nature, the isosurfacing algorithms are well-suited for parallel execution.
+
+\cgalFigureAnchor{IsosurfacingPerf}
+<center>
+<img src="MC_DC_performance.png" style="max-width:70%;"/>
+</center>
+
+-->
+
+\section SecIsosurfacingExamples Examples
+
+The first two examples are very basic examples for Marching Cubes and %Dual Contouring.
+Afterwards, the focus is shifted from the method to the type of input data, and examples
+run both methods on different types of input data.
+
+\subsection SubSecMCExample Marching Cubes
+
+The following example illustrates a basic run of the Marching Cubes algorithm, and in particular
+the free function to create a domain from a %Cartesian grid, and the named parameter
+that enables the user to switch from Marching Cubes to Topologically Correct Marching Cubes.
+The resulting triangle soup is converted to a triangle mesh, and is remeshed using
+the isotropic remeshing algorithm.
+
+\cgalExample{Isosurfacing_3/marching_cubes.cpp}
+
+\cgalFigureAnchor{IsosurfacingMC}
+<center>
+<img src="MC.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingMC}
+Results of the Marching Cubes algorithm, and the final result after remeshing.
+\cgalFigureCaptionEnd
+
+\subsection SubSecDCExample Dual Contouring
+
+The following example illustrates a basic run of the %Dual Contouring algorithm, and in particular
+the free function to create a domain from a %Cartesian grid, and the named parameters
+that enable (or disable) triangulation of the output, and to constrain the vertex location within the cell.
+
+\cgalExample{Isosurfacing_3/dual_contouring.cpp}
+
+\cgalFigureAnchor{IsosurfacingDC}
+<center>
+<img src="DC.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingDC}
+Results of the %Dual Contouring algorithm: untriangulated (left column) or triangulated (right column),
+unconstrained vertex location (top row) or constrained vertex location (bottom row).
+\cgalFigureCaptionEnd
+
+\subsection SubSecImplicitDataExample Implicit Data
+
+The following example shows the usage of Marching Cubes and %Dual Contouring algorithms to extract
+an isosurface. The domain is implicit and describes the unit sphere
+by the distance to its center (set to the origin) as an implicit 3D value field.
+
+\cgalExample{Isosurfacing_3/contouring_implicit_data.cpp}
+
+\subsection SubSecDiscreteDataExample Discrete Data
+
+In the following example, the input data is sampled at the vertices of a grid, and interpolated.
+
+\cgalExample{Isosurfacing_3/contouring_discrete_data.cpp}
+
+\subsection SubSecImageDataExample 3D Image
+
+The following example shows how to load data from an `Image_3`, and generates an isosurface
+from this voxel data.
+
+\cgalExample{Isosurfacing_3/contouring_inrimage.cpp}
+
+\cgalFigureAnchor{IsosurfacingDCEx}
+<center>
+<img src="isosurfacing_inrimage.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingDCEx}
+Results of the Topologically Correct Marching Cubes algorithm for different isovalues (1, 2, and 2.9)
+on the skull model.
+\cgalFigureCaptionEnd
+
+\subsection SubSecOffsetDataExample Offset Mesh
+
+The following example illustrates how to generate a mesh approximating a signed offset to an input
+closed surface mesh. The input mesh is stored into an `AABB_tree` data structure to provide fast
+distance queries. Via the `Side_of_triangle_mesh` functor, the sign of the distance field is made
+negative inside the mesh.
+
+\cgalExample{Isosurfacing_3/contouring_mesh_offset.cpp}
+
+\subsection SubSecContouringOctreeExample Contouring using Octrees
+
+The following example shows the use of an octree as discretization instead of a %Cartesian grid
+for both %Dual Contouring and Marching Cubes. Note that in this configuration, all methods
+lose guarantees, and cracks can easily appear in the surface for Marching Cubes if the octree
+is not adapted to the surface being extracted.
+
+\cgalExample{Isosurfacing_3/contouring_octree.cpp}
+
+\cgalFigureAnchor{IsosurfacingMCOctree}
+<center>
+<img src="MC_octree.png" style="max-width:70%;"/>
+</center>
+\cgalFigureCaptionBegin{IsosurfacingMCOctree}
+Running Marching Cubes with an octree: left, the octree (blue wireframe) has been applied arbitrary
+refinement in one eighth of the domain and the resulting mesh exhibits cracks (boundaries) at
+the regions where octree levels are discontinuous. Right, the octree was constructed to be dense
+around the isosurface, and the surface is manifold.
+\cgalFigureCaptionEnd
+
+\section SecIsosurfacingHistory Design and Implementation History
+
+The development of this package started during the 2022 Google Summer of Code, with the contribution
+of Julian Stahl, mentored by Daniel Zint and Pierre Alliez, providing a first implementation
+of Marching Cubes, Topologically Correct Marching Cubes, and %Dual Contouring. Marching Cubes tables
+were provided by Roberto Grosso (FAU Erlangen-Nürnberg). Mael Rouxel-Labbé worked on improving
+the initial %Dual Contouring implementation, and on the first complete version of the package.
+
+*/
+} /* namespace CGAL */
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/PackageDescription.txt b/Isosurfacing_3/doc/Isosurfacing_3/PackageDescription.txt
new file mode 100644
index 00000000000..c7df5e6b418
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/PackageDescription.txt
@@ -0,0 +1,101 @@
+/// \defgroup PkgIsosurfacing3Ref 3D Isosurfacing Reference
+/// \defgroup PkgIsosurfacing3Concepts Concepts
+/// \ingroup PkgIsosurfacing3Ref
+
+/// \defgroup IS_Partitions_grp Space Partitioning Data Structures
+/// \ingroup PkgIsosurfacing3Ref
+///
+/// This group encapsulates classes that represent a spatial discretization of space,
+/// which will be the scaffolding for the construction of the isosurface.
+
+/// \defgroup IS_Partitions_helpers_grp Space Partitioning Data Structures Helpers
+/// \ingroup IS_Partitions_grp
+
+/// \defgroup IS_Fields_helpers_grp Value and Gradient Fields Helpers
+/// \ingroup PkgIsosurfacing3Ref
+///
+/// The following classes and functions are parameters or template parameters of value and gradient fields.
+
+/// \defgroup IS_Fields_grp Value and Gradient Fields
+/// \ingroup PkgIsosurfacing3Ref
+///
+/// The following classes represent the data that defines the isosurface.
+
+/// \defgroup IS_Domains_grp Isosurfacing Domains
+/// \ingroup PkgIsosurfacing3Ref
+///
+/// This group encapsulates the classes that can be used to represent a complete domain (partition
+/// and fields), to be used by the isosurfacing methods of this package.
+
+/// \defgroup IS_Domain_helpers_grp Isosurfacing Domain Helpers
+/// \ingroup IS_Domains_grp
+
+/// \defgroup IS_Methods_grp Isosurfacing Methods
+/// \ingroup PkgIsosurfacing3Ref
+
+/// \defgroup IS_IO_functions_grp I/O Functions
+/// \ingroup PkgIsosurfacing3Ref
+
+/*!
+\addtogroup PkgIsosurfacing3Ref
+\cgalPkgDescriptionBegin{3D Isosurfacing,PkgIsosurfacing3}
+\cgalPkgPicture{isosurfacing3_ico.png}
+\cgalPkgSummaryBegin
+\cgalPkgAuthor{Mael Rouxel-Labbé, Julian Stahl, Daniel Zint, and Pierre Alliez}
+\cgalPkgDesc{This package implements several grid-based isosurfacing algorithms (Marching Cubes,
+its topologically correct variant, and Dual Contouring) that enable generating surface meshes
+from 3D value and gradient fields. The methods are generic with respect to the definition
+of the grid and the fields, and all methods offer parallel implementations.
+The output is a polygon soup (i.e., a container of 3D point coordinates and indexed faces).}
+\cgalPkgManuals{Chapter_Isosurfacing3,PkgIsosurfacing3Ref}
+\cgalPkgSummaryEnd
+\cgalPkgShortInfoBegin
+\cgalPkgSince{6.1}
+\cgalPkgBib{cgal:sz-mc}
+\cgalPkgLicense{\ref licensesGPL "GPL"}
+\cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}
+\cgalPkgShortInfoEnd
+\cgalPkgDescriptionEnd
+
+\cgalClassifedRefPages
+
+\cgalCRPSection{Concepts}
+- `IsosurfacingTraits_3`
+- `IsosurfacingPartition_3`
+- `IsosurfacingValueField_3`
+- `IsosurfacingGradientField_3`
+- `IsosurfacingInterpolationScheme_3`
+- `IsosurfacingEdgeIntersectionOracle_3`
+- `IsosurfacingDomain_3`
+- `IsosurfacingDomainWithGradient_3`
+
+\cgalCRPSection{Space Partitioning Data Structures}
+- `CGAL::Isosurfacing::Cartesian_grid_3`
+
+\cgalCRPSection{Value and Gradient Fields}
+- `CGAL::Isosurfacing::Value_function_3`
+- `CGAL::Isosurfacing::Gradient_function_3`
+- `CGAL::Isosurfacing::Finite_difference_gradient_3`
+- `CGAL::Isosurfacing::Interpolated_discrete_values_3`
+- `CGAL::Isosurfacing::Interpolated_discrete_gradients_3`
+- `CGAL::Isosurfacing::Trilinear_interpolation`
+
+\cgalCRPSection{Isosurfacing Domains Helpers}
+- `CGAL::Isosurfacing::Dichotomy_edge_intersection`
+- `CGAL::Isosurfacing::Linear_interpolation_edge_intersection`
+
+\cgalCRPSection{Isosurfacing Domains}
+- `CGAL::Isosurfacing::Marching_cubes_domain_3`
+- `CGAL::Isosurfacing::Dual_contouring_domain_3`
+- `CGAL::Isosurfacing::create_marching_cubes_domain_3()`
+- `CGAL::Isosurfacing::create_dual_contouring_domain_3()`
+
+\cgalCRPSection{Isosurfacing Methods}
+
+- `CGAL::Isosurfacing::marching_cubes()`
+- `CGAL::Isosurfacing::dual_contouring()`
+
+\cgalCRPSection{I/O}
+- `CGAL::Isosurfacing::IO::convert_image_to_grid()`
+- `CGAL::Isosurfacing::IO::convert_grid_to_image()`
+*/
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/dependencies b/Isosurfacing_3/doc/Isosurfacing_3/dependencies
new file mode 100644
index 00000000000..b42f8f536e2
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/dependencies
@@ -0,0 +1,11 @@
+Manual
+Kernel_23
+BGL
+STL_Extension
+Algebraic_foundations
+Circulator
+Stream_support
+AABB_tree
+Polygon_mesh_processing
+Mesh_3
+Orthtree
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/examples.txt b/Isosurfacing_3/doc/Isosurfacing_3/examples.txt
new file mode 100644
index 00000000000..aa0317f0d2e
--- /dev/null
+++ b/Isosurfacing_3/doc/Isosurfacing_3/examples.txt
@@ -0,0 +1,10 @@
+/*!
+\example Isosurfacing_3/contouring_discrete_data.cpp
+\example Isosurfacing_3/contouring_inrimage.cpp
+\example Isosurfacing_3/contouring_implicit_data.cpp
+\example Isosurfacing_3/contouring_mesh_offset.cpp
+\example Isosurfacing_3/contouring_vtk_image.cpp
+\example Isosurfacing_3/dual_contouring.cpp
+\example Isosurfacing_3/contouring_octree.cpp
+\example Isosurfacing_3/marching_cubes.cpp
+*/
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/DC.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/DC.png
new file mode 100644
index 00000000000..18b9d5f8f3c
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/DC.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC.png
new file mode 100644
index 00000000000..9f0a930c7c0
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC.png
new file mode 100644
index 00000000000..5801ca8d4d4
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC_open.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC_open.png
new file mode 100644
index 00000000000..2535321aee2
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC_open.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC_performance.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC_performance.png
new file mode 100644
index 00000000000..f80821866b5
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_DC_performance.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_TMC.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_TMC.png
new file mode 100644
index 00000000000..787c787600d
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_TMC.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_cases.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_cases.png
new file mode 100644
index 00000000000..e2569b16273
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_cases.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_octree.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_octree.png
new file mode 100644
index 00000000000..14ba7f2fc15
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/MC_octree.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing3_ico.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing3_ico.png
new file mode 100644
index 00000000000..80540bd0eab
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing3_ico.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing_inrimage.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing_inrimage.png
new file mode 100644
index 00000000000..be3b27a6047
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing_inrimage.png differ
diff --git a/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing_teaser.png b/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing_teaser.png
new file mode 100644
index 00000000000..8b73e79fa89
Binary files /dev/null and b/Isosurfacing_3/doc/Isosurfacing_3/fig/isosurfacing_teaser.png differ
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/CMakeLists.txt b/Isosurfacing_3/examples/Isosurfacing_3/CMakeLists.txt
new file mode 100644
index 00000000000..bd42e9ca7b2
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/CMakeLists.txt
@@ -0,0 +1,73 @@
+# Created by the script cgal_create_cmake_script
+# This is the CMake script for compiling a CGAL application.
+
+cmake_minimum_required(VERSION 3.1...3.23)
+project( Isosurfacing_3_Examples )
+
+find_package(CGAL REQUIRED COMPONENTS ImageIO)
+
+find_package(Eigen3 3.1.0 QUIET) #(3.1.0 or greater)
+include(CGAL_Eigen3_support)
+
+find_package(TBB QUIET)
+include(CGAL_TBB_support)
+
+find_package(VTK QUIET COMPONENTS vtkImagingGeneral vtkIOImage  vtkIOXML vtkIOMINC vtkIOLegacy NO_MODULE)
+if(VTK_FOUND)
+  message(STATUS "VTK was found")
+else()
+  message(STATUS "NOTICE: VTK was not found")
+endif()
+
+create_single_source_cgal_program("marching_cubes.cpp")
+
+# undocumented
+create_single_source_cgal_program("marching_cubes_strategies.cpp")
+
+if(TARGET CGAL::Eigen3_support)
+  create_single_source_cgal_program("dual_contouring.cpp")
+  create_single_source_cgal_program("contouring_discrete_data.cpp")
+  create_single_source_cgal_program("contouring_inrimage.cpp")
+  create_single_source_cgal_program("contouring_implicit_data.cpp")
+  create_single_source_cgal_program("contouring_mesh_offset.cpp")
+  create_single_source_cgal_program("contouring_octree.cpp")
+
+  target_link_libraries(dual_contouring PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_discrete_data PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_inrimage PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_implicit_data PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_mesh_offset PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(contouring_octree PRIVATE CGAL::Eigen3_support)
+
+  if(TARGET CGAL::TBB_support)
+    target_link_libraries(dual_contouring PRIVATE CGAL::TBB_support)
+    target_link_libraries(contouring_discrete_data PRIVATE CGAL::TBB_support)
+    target_link_libraries(contouring_inrimage PRIVATE CGAL::TBB_support)
+    target_link_libraries(contouring_implicit_data PRIVATE CGAL::TBB_support)
+    target_link_libraries(contouring_mesh_offset PRIVATE CGAL::TBB_support)
+    target_link_libraries(contouring_octree PRIVATE CGAL::TBB_support)
+  endif()
+else()
+  message(STATUS "NOTICE: Some examples use Eigen, and will not be compiled.")
+endif()
+
+if(TARGET CGAL::TBB_support)
+  target_link_libraries(marching_cubes PRIVATE CGAL::TBB_support)
+  target_link_libraries(marching_cubes_strategies PRIVATE CGAL::TBB_support)
+endif()
+
+if(TARGET CGAL::CGAL_ImageIO)
+  if(TARGET CGAL::Eigen3_support)
+    if(VTK_FOUND)
+      create_single_source_cgal_program("contouring_vtk_image.cpp")
+      target_link_libraries(contouring_vtk_image PRIVATE CGAL::Eigen3_support
+                                                         CGAL::CGAL_ImageIO
+                                                         ${VTK_LIBRARIES})
+      if(TARGET CGAL::TBB_support)
+        target_link_libraries(contouring_vtk_image PRIVATE CGAL::TBB_support)
+      endif() # TBB
+    endif() # VTK
+  endif() # Eigen
+else() # ImageIO
+  message(STATUS "NOTICE: Some examples need the CGAL_ImageIO library, and will not be compiled.")
+endif()
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/contouring_discrete_data.cpp b/Isosurfacing_3/examples/Isosurfacing_3/contouring_discrete_data.cpp
new file mode 100644
index 00000000000..af61c6a44c8
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/contouring_discrete_data.cpp
@@ -0,0 +1,129 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_gradients_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Interpolated_discrete_gradients_3<Grid>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+void run_marching_cubes(const Grid& grid,
+                        const FT isovalue)
+{
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values, IS::Linear_interpolation_edge_intersection>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes with isovalue = " << isovalue << std::endl;
+
+  // fill up values
+  Values values { grid };
+
+  for(std::size_t i=0; i<grid.xdim(); ++i) {
+    for(std::size_t j=0; j<grid.ydim(); ++j) {
+      for(std::size_t k=0; k<grid.zdim(); ++k)
+      {
+        const Point& p = grid.point(i,j,k);
+        const FT d = sqrt(CGAL::squared_distance(p, Point(CGAL::ORIGIN)));
+        values(i,j,k) = d;
+      }
+    }
+  }
+
+  Domain domain { grid, values };
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run marching cubes isosurfacing
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #triangles: " << triangles.size() << std::endl;
+  CGAL::IO::write_polygon_soup("marching_cubes_discrete.off", points, triangles);
+}
+
+void run_dual_contouring(const Grid& grid,
+                         const FT isovalue)
+{
+  using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients, IS::Linear_interpolation_edge_intersection>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring with isovalue = " << isovalue << std::endl;
+
+  // fill up values and gradients
+  Values values { grid };
+  Gradients gradients { grid };
+
+  for(std::size_t i=0; i<grid.xdim(); ++i) {
+    for(std::size_t j=0; j<grid.ydim(); ++j) {
+      for(std::size_t k=0; k<grid.zdim(); ++k)
+      {
+        const Point& p = grid.point(i,j,k);
+        const FT d = sqrt(CGAL::squared_distance(p, Point(CGAL::ORIGIN)));
+        values(i,j,k) = d;
+
+        if(d != 0)
+          gradients(i,j,k) = Vector(CGAL::ORIGIN, p) / d;
+        else
+          gradients(i,j,k) = CGAL::NULL_VECTOR;
+      }
+    }
+  }
+
+  // If the gradient was not known analytically, we could use:
+  // - Finite_difference_gradient_3 to use finite difference to compute it from values;
+  // - the function below to use finite difference _and_ store the values at the grid vertices
+  //     gradients.compute_discrete_gradients(values);
+
+  Domain domain { grid, values, gradients };
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run dual contouring isosurfacing
+  IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #triangles: " << triangles.size() << std::endl;
+  CGAL::IO::write_polygon_soup("dual_contouring_discrete.off", points, triangles);
+}
+
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.8;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox { -1., -1., -1., 1., 1., 1. };
+  Grid grid { bbox, CGAL::make_array<std::size_t>(30, 30, 30) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  run_marching_cubes(grid, isovalue);
+
+  run_dual_contouring(grid, isovalue);
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/contouring_implicit_data.cpp b/Isosurfacing_3/examples/Isosurfacing_3/contouring_implicit_data.cpp
new file mode 100644
index 00000000000..7175c1de27a
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/contouring_implicit_data.cpp
@@ -0,0 +1,136 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Gradient_function_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/Bbox_3.h>
+#include <CGAL/Real_timer.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <array>
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+// using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel, CGAL::Isosurfacing::Do_not_cache_vertex_locations>;
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel, CGAL::Isosurfacing::Cache_vertex_locations>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Gradient_function_3<Grid>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+// ---
+const FT alpha = 5.01;
+
+auto iwp_value = [](const Point& point)
+{
+  const FT x = alpha * (point.x() + FT(1.0)) * CGAL_PI;
+  const FT y = alpha * (point.y() + FT(1.0)) * CGAL_PI;
+  const FT z = alpha * (point.z() + FT(1.0)) * CGAL_PI;
+  return cos(x)*cos(y) + cos(y)*cos(z) + cos(z)*cos(x) - cos(x)*cos(y)*cos(z);  // isovalue = 0
+};
+
+auto iwp_gradient = [](const Point& point)
+{
+  const FT x = alpha * (point.x() + FT(1.0)) * CGAL_PI;
+  const FT y = alpha * (point.y() + FT(1.0)) * CGAL_PI;
+  const FT z = alpha * (point.z() + FT(1.0)) * CGAL_PI;
+
+  const FT gx = CGAL_PI * alpha * sin(x) * (cos(y) * (cos(z) - FT(1.0)) - cos(z));
+  const FT gy = CGAL_PI * alpha * sin(y) * (cos(x) * (cos(z) - FT(1.0)) - cos(z));
+  const FT gz = CGAL_PI * alpha * sin(z) * (cos(x) * (cos(y) - FT(1.0)) - cos(y));
+  return Vector(gx, gy, gz);
+};
+
+void run_marching_cubes(const Grid& grid,
+                        const FT isovalue)
+{
+  using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes with isovalue = " << isovalue << std::endl;
+
+  CGAL::Real_timer timer;
+  timer.start();
+
+  // fill up values
+  Values values { iwp_value, grid };
+  Domain domain { grid, values };
+
+  // output containers
+  Point_range points;
+  Polygon_range triangles;
+
+  // run Marching Cubes
+  CGAL::Isosurfacing::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  timer.stop();
+
+  std::cout << "Output #vertices (MC): " << points.size() << std::endl;
+  std::cout << "Output #triangles (MC): " << triangles.size() << std::endl;
+  std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+  CGAL::IO::write_polygon_soup("marching_cubes_implicit.off", points, triangles);
+}
+
+void run_dual_contouring(const Grid& grid,
+                         const FT isovalue)
+{
+  using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring with isovalue = " << isovalue << std::endl;
+
+  CGAL::Real_timer timer;
+  timer.start();
+
+  // fill up values and gradients
+  Values values { iwp_value, grid };
+  Gradients gradients { iwp_gradient, grid };
+  Domain domain { grid, values, gradients };
+
+  // output containers
+  Point_range points;
+  Polygon_range triangles;
+
+  // run Dual Contouring
+  CGAL::Isosurfacing::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                                       CGAL::parameters::do_not_triangulate_faces(true));
+
+  timer.stop();
+
+  std::cout << "Output #vertices (DC): " << points.size() << std::endl;
+  std::cout << "Output #triangles (DC): " << triangles.size() << std::endl;
+  std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+  CGAL::IO::write_polygon_soup("dual_contouring_implicit.off", points, triangles);
+}
+
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.;
+
+  const CGAL::Bbox_3 bbox{-1, -1, -1,  1, 1, 1};
+  const FT step = 0.02;
+  const Vector spacing { step, step, step };
+  Grid grid { bbox, spacing };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  run_marching_cubes(grid, isovalue);
+
+  run_dual_contouring(grid, isovalue);
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/contouring_inrimage.cpp b/Isosurfacing_3/examples/Isosurfacing_3/contouring_inrimage.cpp
new file mode 100644
index 00000000000..25588f00182
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/contouring_inrimage.cpp
@@ -0,0 +1,116 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/Image_3.h>
+
+#include <CGAL/Isosurfacing_3/IO/Image_3.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <iostream>
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+void run_marching_cubes(const Grid& grid,
+                        const FT isovalue,
+                        const Values& values)
+{
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values, IS::Linear_interpolation_edge_intersection>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes with isovalue = " << isovalue << std::endl;
+
+  // fill up values
+
+  // create a domain from the grid
+  Domain domain { grid, values };
+
+  // prepare collections for the output indexed soup
+  Point_range points;
+  Polygon_range triangles;
+
+  // execute marching cubes
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #triangles: " << triangles.size() << std::endl;
+
+  // save output indexed mesh to a file, in the OFF format
+  CGAL::IO::write_polygon_soup("marching_cubes_inrimage.off", points, triangles);
+}
+
+void run_dual_contouring(const Grid& grid,
+                         const FT isovalue,
+                         const Values& values)
+{
+  using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients, IS::Linear_interpolation_edge_intersection>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring with isovalue = " << isovalue << std::endl;
+
+  // fill up values and gradients
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01; // finite difference step
+  Gradients gradients { values, step };
+  Domain domain { grid, values, gradients };
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run dual contouring isosurfacing
+  IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #triangles: " << triangles.size() << std::endl;
+  CGAL::IO::write_polygon_soup("dual_contouring_inrimage.off", points, triangles);
+}
+
+int main(int argc, char* argv[])
+{
+  const std::string fname = (argc > 1) ? argv[1] : CGAL::data_file_path("images/skull_2.9.inr");
+  const FT isovalue = (argc > 2) ? std::stod(argv[2]) : - 2.9;
+
+  // load volumetric image from a file
+  CGAL::Image_3 image;
+  if(!image.read(fname))
+  {
+    std::cerr << "Error: Cannot read image file " << fname << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  // convert image to a Cartesian grid
+  Grid grid;
+  Values values { grid }; // 'values' keeps a reference to the grid
+  if(!IS::IO::convert_image_to_grid(image, grid, values))
+  {
+    std::cerr << "Error: Cannot convert image to Cartesian grid" << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  run_marching_cubes(grid, isovalue, values);
+
+  run_dual_contouring(grid, isovalue, values);
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/contouring_mesh_offset.cpp b/Isosurfacing_3/examples/Isosurfacing_3/contouring_mesh_offset.cpp
new file mode 100644
index 00000000000..1697ba357c1
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/contouring_mesh_offset.cpp
@@ -0,0 +1,177 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/AABB_face_graph_triangle_primitive.h>
+#include <CGAL/AABB_traits_3.h>
+#include <CGAL/AABB_tree.h>
+#include <CGAL/Bbox_3.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Side_of_triangle_mesh.h>
+
+#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <iostream>
+#include <string>
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Mesh = CGAL::Surface_mesh<Point>;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+struct Offset_oracle
+{
+  using Primitive = CGAL::AABB_face_graph_triangle_primitive<Mesh>;
+  using Traits = CGAL::AABB_traits_3<Kernel, Primitive>;
+  using Tree = CGAL::AABB_tree<Traits>;
+
+private:
+  const bool is_closed;
+  const Tree tree;
+  CGAL::Side_of_triangle_mesh<Mesh, Kernel> sotm;
+
+public:
+  Offset_oracle(const Mesh& mesh)
+    : is_closed(CGAL::is_closed(mesh)), tree(mesh.faces_begin(), mesh.faces_end(), mesh), sotm(mesh)
+  { }
+
+  FT distance(const Point& p) const
+  {
+    const Point cp = tree.closest_point(p);
+    FT d = sqrt((p - cp).squared_length());
+
+    if(is_closed && sotm(p) == (CGAL::ON_BOUNDED_SIDE))
+      d *= -1.0;
+
+    return d;
+  }
+};
+
+void run_marching_cubes(const Grid& grid,
+                         const FT offset_value,
+                         const Offset_oracle& offset_oracle)
+{
+  using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes with offset value = " << offset_value << std::endl;
+
+  // fill up values
+  auto mesh_distance = [&offset_oracle](const Point& p) { return offset_oracle.distance(p); };
+  Values values { mesh_distance, grid };
+  Domain domain { grid, values };
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run marching cubes
+  std::cout << "Running Marching Cubes with isovalue = " << offset_value << std::endl;
+  CGAL::Isosurfacing::marching_cubes<CGAL::Parallel_if_available_tag>(domain, offset_value, points, triangles);
+
+  std::cout << "Output #vertices (MC): " << points.size() << std::endl;
+  std::cout << "Output #triangles (MC): " << triangles.size() << std::endl;
+  CGAL::IO::write_polygon_soup("marching_cubes_offsets.off", points, triangles);
+}
+
+void run_dual_contouring(const Grid& grid,
+                         const FT offset_value,
+                         const Offset_oracle& offset_oracle)
+{
+  using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring with offset value = " << offset_value << std::endl;
+
+  // fill up values and gradients
+  auto mesh_distance = [&offset_oracle](const Point& p) { return offset_oracle.distance(p); };
+
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+
+  Values values { mesh_distance, grid };
+  Gradients gradients { values, step };
+  Domain domain { grid, values, gradients };
+
+  // output containers
+  Point_range points;
+  Polygon_range triangles;
+
+  // run dual contouring
+  std::cout << "Running Dual Contouring with isovalue = " << offset_value << std::endl;
+  CGAL::Isosurfacing::dual_contouring<CGAL::Parallel_if_available_tag>(
+                        domain, offset_value, points, triangles,
+                        CGAL::parameters::do_not_triangulate_faces(true));
+
+  std::cout << "Output #vertices (DC): " << points.size() << std::endl;
+  std::cout << "Output #triangles (DC): " << triangles.size() << std::endl;
+  CGAL::IO::write_polygon_soup("dual_contouring_mesh_offset.off", points, triangles);
+}
+
+int main(int argc, char** argv)
+{
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cross.off");
+  const FT offset_value = (argc > 2) ? std::stod(argv[2]) : 0.2;
+
+  if(offset_value < 0)
+  {
+    std::cerr << "Offset value must be positive" << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  Mesh mesh;
+  if(!CGAL::IO::read_polygon_mesh(filename, mesh) || is_empty(mesh))
+  {
+    std::cerr << "Could not read input mesh" << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  if(CGAL::is_closed(mesh))
+    std::cout << "Input mesh is closed - using signed distance offset" << std::endl;
+  else
+    std::cout << "Input mesh is not closed - using unsigned distance offset" << std::endl;
+
+  // construct loose bounding box from input mesh
+  CGAL::Bbox_3 bbox = CGAL::Polygon_mesh_processing::bbox(mesh);
+
+  const FT diag_length = sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                              CGAL::square(bbox.ymax() - bbox.ymin()) +
+                              CGAL::square(bbox.zmax() - bbox.zmin()));
+  const FT loose_offset = offset_value + 0.1 * diag_length;
+
+  Vector aabb_increase_vec = Vector(loose_offset, loose_offset, loose_offset);
+  bbox += (Point(bbox.xmax(), bbox.ymax(), bbox.zmax()) + aabb_increase_vec).bbox();
+  bbox += (Point(bbox.xmin(), bbox.ymin(), bbox.zmin()) - aabb_increase_vec).bbox();
+
+  const int nv = 15;
+
+  Grid grid { bbox, CGAL::make_array<std::size_t>(nv, nv, nv) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  Offset_oracle offset_oracle(mesh);
+
+  run_marching_cubes(grid, offset_value, offset_oracle);
+
+  run_dual_contouring(grid, offset_value, offset_oracle);
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/contouring_octree.cpp b/Isosurfacing_3/examples/Isosurfacing_3/contouring_octree.cpp
new file mode 100644
index 00000000000..f370c622fbe
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/contouring_octree.cpp
@@ -0,0 +1,288 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Gradient_function_3.h>
+#include <CGAL/Isosurfacing_3/Octree_partition.h>
+
+#include <CGAL/Bbox_3.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <cmath>
+#include <iostream>
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Vector = typename Kernel::Vector_3;
+using Point = typename Kernel::Point_3;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+using Octree = CGAL::Octree<Kernel, std::vector<Point> >;
+using Values = CGAL::Isosurfacing::Value_function_3<Octree>;
+using Gradients = CGAL::Isosurfacing::Gradient_function_3<Octree>;
+using MC_Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Octree, Values>;
+using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Octree, Values, Gradients>;
+
+namespace IS = CGAL::Isosurfacing;
+
+auto sphere_function = [](const Point& p) -> FT
+{
+  return std::sqrt(p.x()*p.x() + p.y()*p.y() + p.z()*p.z());
+};
+
+auto sphere_gradient = [](const Point& p) -> Vector
+{
+  const Vector g = p - CGAL::ORIGIN;
+  return g / std::sqrt(g.squared_length());
+};
+
+auto blobby_function = [](const Point& p) -> FT
+{
+  return std::exp(-1.5 * ((p.x() - 0.2) * (p.x() - 0.2) + (p.y() - 0.2) * (p.y() - 0.2) + (p.z() - 0.2) * (p.z() - 0.2))) +
+         std::exp(-1.5 * ((p.x() + 0.2) * (p.x() + 0.2) + (p.y() + 0.2) * (p.y() + 0.2) + (p.z() + 0.2) * (p.z() + 0.2))) +
+         std::exp(-1.5 * ((p.x() - 0.4) * (p.x() - 0.4) + (p.y() + 0.4) * (p.y() + 0.4) + (p.z() - 0.4) * (p.z() - 0.4))) +
+         std::exp(-6 * ((p.x() - 0.1) * (p.x() - 0.1) + (p.y() - 0.1) * (p.y() - 0.1))) +
+         std::exp(-6 * ((p.y() + 0.1) * (p.y() + 0.1) + (p.z() + 0.1) * (p.z() + 0.1))) +
+         std::exp(-6 * ((p.x() + 0.1) * (p.x() + 0.1) + (p.z() - 0.1) * (p.z() - 0.1))) -
+         0.3;
+};
+
+auto blobby_gradient = [](const Point& p) -> Vector
+{
+  const FT g1 = -3 * std::exp(-1.5 * ((p.x() - 0.2) * (p.x() - 0.2) + (p.y() - 0.2) * (p.y() - 0.2) + (p.z() - 0.2) * (p.z() - 0.2)));
+  const FT g2 = -3 * std::exp(-1.5 * ((p.x() + 0.2) * (p.x() + 0.2) + (p.y() + 0.2) * (p.y() + 0.2) + (p.z() + 0.2) * (p.z() + 0.2)));
+  const FT g3 = -3 * std::exp(-1.5 * ((p.x() - 0.4) * (p.x() - 0.4) + (p.y() + 0.4) * (p.y() + 0.4) + (p.z() - 0.4) * (p.z() - 0.4)));
+  const FT g4 = -12 * std::exp(-6 * ((p.x() - 0.1) * (p.x() - 0.1) + (p.y() - 0.1) * (p.y() - 0.1)));
+  const FT g5 = -12 * std::exp(-6 * ((p.y() + 0.1) * (p.y() + 0.1) + (p.z() + 0.1) * (p.z() + 0.1)));
+  const FT g6 = -12 * std::exp(-6 * ((p.x() + 0.1) * (p.x() + 0.1) + (p.z() - 0.1) * (p.z() - 0.1)));
+
+  return Vector(g1 * (p.x() - 0.2) + g2 * (p.x() + 0.2) + g3 * (p.x() - 0.4) + g4 * (p.x() - 0.1) + g6 * (p.x() + 0.1),
+                g1 * (p.y() - 0.2) + g2 * (p.y() + 0.2) + g3 * (p.y() + 0.4) + g4 * (p.y() - 0.1) + g5 * (p.y() + 0.1),
+                g1 * (p.z() - 0.2) + g2 * (p.z() + 0.2) + g3 * (p.z() - 0.4) + g5 * (p.z() + 0.1) + g6 * (p.z() - 0.1));
+};
+
+// This is a naive refinement that is adapted to the isosurface:
+// This refines:
+// - at the minimum till minimum depth
+// - at the maximum till maximum depth
+// - we split if the the isovalue goes through the voxel, i.e. if not all vertices of the cell
+//   are on the same side of the isosurface defined by a function
+// It's not a great refinement technique because the surface can enter and leave a cell
+// without involving the cell's vertex. In practice, that means a hole if at nearby adjacent
+// cells the voxels did get refined and registered the surface.
+struct Refine_around_isovalue
+{
+  std::size_t min_depth_;
+  std::size_t max_depth_;
+  std::function<FT(const Point&)> function_;
+  FT isovalue_;
+
+  Refine_around_isovalue(std::size_t min_depth,
+                         std::size_t max_depth,
+                         std::function<FT(const Point&)> function,
+                         FT isovalue)
+    : min_depth_(min_depth),
+      max_depth_(max_depth),
+      function_(function),
+      isovalue_(isovalue)
+  {}
+
+  bool operator()(const Octree::Node_index& ni, const Octree& octree) const
+  {
+    // Ensure minimum depth refinement
+    if (octree.depth(ni) < min_depth_)
+      return true;
+
+    // Stop refinement at maximum depth
+    if (octree.depth(ni) >= max_depth_)
+      return false;
+
+    // Get the bounding box of the node
+    auto bbox = octree.bbox(ni);
+
+    // Evaluate the function at the corners of the bounding box
+    std::array<FT, 8> corner_values;
+    int index = 0;
+    for (FT x : {bbox.xmin(), bbox.xmax()})
+      for (FT y : {bbox.ymin(), bbox.ymax()})
+        for (FT z : {bbox.zmin(), bbox.zmax()})
+          corner_values[index++] = function_(Point(x, y, z));
+
+    // Check if the function values cross the isovalue
+    bool has_positive = false, has_negative = false;
+    for (const auto& value : corner_values)
+    {
+      if (value > isovalue_)
+        has_positive = true;
+      if (value < isovalue_)
+        has_negative = true;
+      if (has_positive && has_negative)
+        return true; // Refine if the isosurface intersects the voxel
+    }
+
+    return false; // No refinement needed
+  }
+};
+
+// This is a refinement that is NOT adapted to the isosurface
+struct Refine_one_eighth
+{
+  std::size_t min_depth_;
+  std::size_t max_depth_;
+
+  std::size_t octree_dim_;
+
+  Refine_one_eighth(std::size_t min_depth,
+                    std::size_t max_depth)
+    : min_depth_(min_depth),
+      max_depth_(max_depth)
+  {
+    octree_dim_ = std::size_t(1) << max_depth_;
+  }
+
+  Octree::Global_coordinates uniform_coordinates(const Octree::Node_index& node_index, const Octree& octree) const
+  {
+    auto coords = octree.global_coordinates(node_index);
+    const std::size_t depth_factor = std::size_t(1) << (max_depth_ - octree.depth(node_index));
+    for(int i=0; i < 3; ++i)
+      coords[i] *= uint32_t(depth_factor);
+
+    return coords;
+  }
+
+  bool operator()(const Octree::Node_index& ni, const Octree& octree) const
+  {
+    if(octree.depth(ni) < min_depth_)
+      return true;
+
+    if(octree.depth(ni) == max_depth_)
+      return false;
+
+    auto leaf_coords = uniform_coordinates(ni, octree);
+
+    if(leaf_coords[0] >= octree_dim_ / 2)
+      return false;
+
+    if(leaf_coords[1] >= octree_dim_ / 2)
+      return false;
+
+    if(leaf_coords[2] >= octree_dim_ / 2)
+      return false;
+
+    return true;
+  }
+};
+
+template <typename Splitter>
+void run_DC_octree(const CGAL::Bbox_3 bbox,
+                   const Splitter& split_predicate,
+                   const std::function<FT(const Point&)> function,
+                   const std::function<Vector(const Point&)> gradient,
+                   const FT isovalue,
+                   const std::string& name)
+{
+  std::vector<Point> bbox_points { { bbox.xmin(), bbox.ymin(), bbox.zmin() },
+                                   { bbox.xmax(), bbox.ymax(), bbox.zmax() } };
+
+  Octree octree(bbox_points);
+  octree.refine(split_predicate);
+
+
+  auto leaf_range = octree.traverse(CGAL::Orthtrees::Leaves_traversal<Octree>(octree));
+  std::size_t leaf_counter = std::distance(leaf_range.begin(), leaf_range.end());
+
+  std::cout << "octree has " << leaf_counter << " leaves" << std::endl;
+
+  // fill up values and gradients
+  Values values { function, octree };
+  Gradients gradients { gradient, octree };
+  Domain domain { octree, values, gradients };
+
+  // output containers
+  Point_range points;
+  Polygon_range triangles;
+
+  std::cout << "Running Dual Contouring with isovalue = " << isovalue << std::endl;
+
+  // run Dual Contouring
+  IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                       CGAL::parameters::do_not_triangulate_faces(true)
+                                                                        .constrain_to_cell(false));
+
+  std::cout << "Output #vertices (DC): " << points.size() << std::endl;
+  std::cout << "Output #triangles (DC): " << triangles.size() << std::endl;
+
+  std::ofstream oo("octree_DC_" + name + ".polylines.txt");
+  oo.precision(17);
+  octree.dump_to_polylines(oo);
+
+  CGAL::IO::write_polygon_soup("DC_" + name + ".off", points, triangles);
+}
+
+template <typename Splitter>
+void run_MC_octree(const CGAL::Bbox_3 bbox,
+                   const Splitter& split_predicate,
+                   const std::function<FT(const Point&)> function,
+                   const FT isovalue,
+                   const std::string& name)
+{
+  std::vector<Point> bbox_points { { bbox.xmin(), bbox.ymin(), bbox.zmin() },
+  { bbox.xmax(), bbox.ymax(), bbox.zmax() } };
+
+  Octree octree(bbox_points);
+  octree.refine(split_predicate);
+
+  Values values { function, octree };
+
+  Point_range points;
+  Polygon_range triangles;
+  MC_Domain mcdomain { octree, values };
+
+  std::cout << "Running MC" << std::endl;
+
+  CGAL::Isosurfacing::marching_cubes<CGAL::Parallel_if_available_tag>(mcdomain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices (MC): " << points.size() << std::endl;
+  std::cout << "Output #triangles (MC): " << triangles.size() << std::endl;
+
+  std::ofstream oo("octree_MC_" + name + ".polylines.txt");
+  oo.precision(17);
+  octree.dump_to_polylines(oo);
+
+  CGAL::IO::write_polygon_soup("MC_" + name + ".off", points, triangles);
+}
+
+// Whether you are using MC, TMC, or DC, there is no guarantee for an octree:
+// it should behave well if your nodes are split with a uniform size around the surface,
+// but it is sure to produce cracks if you have varying depths around the isosurface.
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.3;
+
+  const CGAL::Bbox_3 bbox { -1., -1., -1.,  1., 1., 1. };
+
+  Refine_one_eighth one_eight_splitter(3, 5);
+  run_DC_octree(bbox, one_eight_splitter, sphere_function, sphere_gradient, isovalue, "one_eight");
+
+  // This is
+  Refine_around_isovalue isovalue_splitter(3, 5, sphere_function, isovalue);
+  run_DC_octree(bbox, isovalue_splitter, sphere_function, sphere_gradient, isovalue, "sphere_adapted");
+
+  Refine_around_isovalue isvalue_splitter_2(3, 5, blobby_function, isovalue);
+  run_DC_octree(bbox, isvalue_splitter_2, blobby_function, blobby_gradient, isovalue, "blobby_adapted");
+
+  // to illustrate cracks
+  run_MC_octree(bbox, isovalue_splitter, sphere_function, isovalue, "adapted");
+
+  run_MC_octree(bbox, one_eight_splitter, sphere_function, isovalue, "one_eight");
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/contouring_vtk_image.cpp b/Isosurfacing_3/examples/Isosurfacing_3/contouring_vtk_image.cpp
new file mode 100644
index 00000000000..f36c48e8aff
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/contouring_vtk_image.cpp
@@ -0,0 +1,145 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/Image_3.h>
+#include <CGAL/IO/read_vtk_image_data.h>
+#include <CGAL/Isosurfacing_3/IO/Image_3.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <vtkNew.h>
+#include <vtkImageData.h>
+#include <vtkMetaImageReader.h>
+#include <vtkXMLImageDataReader.h>
+#include <vtkTIFFReader.h>
+#include <vtkNrrdReader.h>
+#include <vtkMINCImageReader.h>
+
+#include <iostream>
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+void run_marching_cubes(const Grid& grid,
+                        const FT isovalue,
+                        const Values& values)
+{
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values, IS::Linear_interpolation_edge_intersection>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes with isovalue = " << isovalue << std::endl;
+
+  // fill up values
+
+  // create a domain from the grid
+  Domain domain { grid, values };
+
+  // prepare collections for the output indexed soup
+  Point_range points;
+  Polygon_range triangles;
+
+  // execute marching cubes
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #triangles: " << triangles.size() << std::endl;
+
+  // save output indexed mesh to a file, in the OFF format
+  CGAL::IO::write_polygon_soup("marching_cubes_vtk_image.off", points, triangles);
+}
+
+void run_dual_contouring(const Grid& grid,
+                         const FT isovalue,
+                         const Values& values)
+{
+  using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients, IS::Linear_interpolation_edge_intersection>;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring with isovalue = " << isovalue << std::endl;
+
+  // fill up values and gradients
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01; // finite difference step
+  Gradients gradients { values, step };
+  Domain domain { grid, values, gradients };
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run dual contouring isosurfacing
+  IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #triangles: " << triangles.size() << std::endl;
+  CGAL::IO::write_polygon_soup("dual_contouring_vtk_image.off", points, triangles);
+}
+
+template <typename VtkReader>
+void run(const char* filename,
+         const FT isovalue)
+{
+  vtkNew<VtkReader> reader;
+  reader->SetFileName(filename);
+  reader->Update();
+  CGAL::Image_3 image = CGAL::IO::read_vtk_image_data(reader->GetOutput());
+
+  // convert image to a Cartesian grid
+  Grid grid;
+  Values values { grid }; // 'values' keeps a reference to the grid
+  if(!IS::IO::convert_image_to_grid(image, grid, values))
+  {
+    std::cerr << "Error: Cannot convert image to Cartesian grid" << std::endl;
+    return;
+  }
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  run_marching_cubes(grid, isovalue, values);
+
+  run_dual_contouring(grid, isovalue, values);
+}
+
+int main(int argc, char* argv[])
+{
+  const std::string fname = (argc>1) ? argv[1] : CGAL::data_file_path("images/torus_gray_image.vti");
+
+  const char* filename = fname.c_str();
+  const FT isovalue = (argc > 2) ? std::stod(argv[2]) : 3;
+
+  const std::string ext = CGAL::IO::internal::get_file_extension(filename);
+  if(ext == "mhd" || ext == "mha")
+    run<vtkMetaImageReader>(filename, isovalue);
+  else if(ext == "vti")
+    run<vtkXMLImageDataReader>(filename, isovalue);
+  else if(ext == "tif")
+    run<vtkTIFFReader>(filename, isovalue);
+  else if(ext == "nrrd")
+    run<vtkNrrdReader>(filename, isovalue);
+  else if(ext == "mnc")
+    run<vtkMINCImageReader>(filename, isovalue);
+  else
+  {
+    std::cerr << "Error: Unsupported file format" << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/dual_contouring.cpp b/Isosurfacing_3/examples/Isosurfacing_3/dual_contouring.cpp
new file mode 100644
index 00000000000..df9f624efe0
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/dual_contouring.cpp
@@ -0,0 +1,99 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Gradient_function_3.h>
+
+#include <CGAL/Bbox_3.h>
+#include <CGAL/IO/polygon_mesh_io.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+
+#include <cmath>
+#include <iostream>
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Gradient_function_3<Grid>;
+using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+using Mesh = CGAL::Surface_mesh<Point>;
+
+// "Devil" - https://www-sop.inria.fr/galaad/surface/
+auto devil_value = [](const Point& point)
+{
+  const FT x = point.x(), y = point.y(), z = point.z();
+  return x*x*x*x + 2*x*x*z*z - 0.36*x*x - y*y*y*y + 0.25*y*y + z*z*z*z;
+};
+
+auto devil_gradient = [](const Point& point)
+{
+  const FT x = point.x(), y = point.y(), z = point.z();
+
+  const FT gx = 4*x*x*x + 4*x*z*z - 0.72*x;
+  const FT gy = -4*y*y*y + 0.5*y;
+  const FT gz = 4*x*x*z + 4*z*z*z;
+  Vector g(gx, gy, gz);
+  return g / std::sqrt(gx*gx + gy*gy + gz*gz);
+};
+
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0;
+  const FT box_c = (argc > 2) ? std::abs(std::stod(argv[2])) : 1.;
+  const std::size_t grid_n = (argc > 3) ? std::stoi(argv[3]) : 50;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox { -box_c, -box_c, -box_c, box_c, box_c, box_c };
+  Grid grid { bbox, CGAL::make_array<std::size_t>(grid_n, grid_n, grid_n) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  // fill up values & gradients
+  Values values { devil_value, grid };
+  Gradients gradients { devil_gradient, grid };
+
+  // Below is equivalent to:
+  //   Domain domain { grid, values, gradients };
+  Domain domain = CGAL::Isosurfacing::create_dual_contouring_domain_3(grid, values, gradients);
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run dual contouring isosurfacing
+  std::cout << "Running Dual Contouring with isovalue = " << isovalue << std::endl;
+  CGAL::Isosurfacing::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                                       CGAL::parameters::do_not_triangulate_faces(true)
+                                                                                        .constrain_to_cell(false));
+
+  std::cout << "Soup #vertices: " << points.size() << std::endl;
+  std::cout << "Soup #triangles: " << triangles.size() << std::endl;
+
+  if(!CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles)) {
+    std::cerr << "Warning: the soup is not a 2-manifold surface, non-manifoldness?..." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Create the mesh..." << std::endl;
+  Mesh mesh;
+  CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, mesh);
+
+  CGAL::IO::write_polygon_mesh("dual_contouring.off", mesh, CGAL::parameters::stream_precision(17));
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/marching_cubes.cpp b/Isosurfacing_3/examples/Isosurfacing_3/marching_cubes.cpp
new file mode 100644
index 00000000000..c8065ecaa1b
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/marching_cubes.cpp
@@ -0,0 +1,95 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/Bbox_3.h>
+#include <CGAL/IO/polygon_mesh_io.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/remesh.h>
+
+#include <cmath>
+#include <iostream>
+#include <vector>
+
+using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+using Mesh = CGAL::Surface_mesh<Point>;
+
+auto value_fn = [](const Point& p) -> FT
+{
+  const FT& x = p.x(), y = p.y(), z = p.z();
+
+  // "Klein Bottle" - https://www-sop.inria.fr/galaad/surface/
+  return -1-4*y*z*z*x*x-2*y+6*z*z*x*x*y*y-16*x*z+16*x*z*y*y+3*x*x+7*y*y+11*z*z-11*z*z*z*z+z*z*z*z*z*z-3*x*x*x*x-7*y*y*y*y+x*x*x*x*x*x+y*y*y*y*y*y-14*z*z*x*x-18*z*z*y*y+3*z*z*z*z*x*x+3*z*z*z*z*y*y-10*x*x*y*y-4*y*y*y*z*z+3*z*z*x*x*x*x+3*z*z*y*y*y*y+16*x*x*x*z+3*x*x*x*x*y*y+3*x*x*y*y*y*y+4*x*x*y-12*z*z*y-2*x*x*x*x*y-4*x*x*y*y*y-2*z*z*z*z*y+16*x*z*z*z+12*y*y*y-2*y*y*y*y*y-32*x*z*y;
+};
+
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.1;
+  const FT box_c = (argc > 2) ? std::abs(std::stod(argv[2])) : 5.;
+  const std::size_t grid_n = (argc > 3) ? std::stoi(argv[3]) : 50;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox { -box_c, -box_c, -box_c, box_c, box_c, box_c };
+  Grid grid { bbox, CGAL::make_array<std::size_t>(grid_n, grid_n, grid_n) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  // fill up values
+  Values values { value_fn, grid };
+
+  // Below is equivalent to:
+  //   Domain domain { grid, values };
+  Domain domain = CGAL::Isosurfacing::create_marching_cubes_domain_3(grid, values);
+
+  Point_range points;
+  Polygon_range triangles;
+
+  // run marching cubes isosurfacing
+  std::cout << "Running Marching Cubes with isovalue = " << isovalue << std::endl;
+  CGAL::Isosurfacing::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                                      CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+  std::cout << "Soup #vertices: " << points.size() << std::endl;
+  std::cout << "Soup #triangles: " << triangles.size() << std::endl;
+
+  if(!CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles)) {
+    std::cerr << "Warning: the soup is not a 2-manifold surface, non-manifoldness?..." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Convert the soup to a triangle mesh..." << std::endl;
+  Mesh mesh;
+  CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, mesh);
+
+  CGAL::IO::write_polygon_mesh("marching_cubes.off", mesh, CGAL::parameters::stream_precision(17));
+
+  // Let's remesh it to something nicer looking
+  std::cout << "Remeshing..." << std::endl;
+  const FT target_edge_length = box_c / 50;
+  CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(mesh), target_edge_length, mesh,
+                                                     CGAL::parameters::number_of_iterations(5)
+                                                                      .number_of_relaxation_steps(5));
+
+  CGAL::IO::write_polygon_mesh("marching_cubes-remeshed.off", mesh, CGAL::parameters::stream_precision(17));
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/examples/Isosurfacing_3/marching_cubes_strategies.cpp b/Isosurfacing_3/examples/Isosurfacing_3/marching_cubes_strategies.cpp
new file mode 100644
index 00000000000..aad37317e9f
--- /dev/null
+++ b/Isosurfacing_3/examples/Isosurfacing_3/marching_cubes_strategies.cpp
@@ -0,0 +1,91 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+
+#include <CGAL/Real_timer.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Domain = CGAL::Isosurfacing::Marching_cubes_domain_3<Grid, Values>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.8;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox { -1., -1., -1., 1., 1., 1. };
+  Grid grid { bbox, CGAL::make_array<std::size_t>(30, 30, 30) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  // fill up values
+  auto sphere_value_fn = [](const Point& p) -> FT
+  {
+    return sqrt(p.x()*p.x() + p.y()*p.y() + p.z()*p.z());
+  };
+
+  Values values { sphere_value_fn, grid };
+  Domain domain { grid, values };
+
+  // MC base version
+  {
+    Point_range points;
+    Polygon_range triangles;
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    // run marching cubes isosurfacing
+    std::cout << "Running Marching Cubes with isovalue = " << isovalue << std::endl;
+    CGAL::Isosurfacing::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                                        CGAL::parameters::use_topologically_correct_marching_cubes(false));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("marching_cubes.off", points, triangles);
+  }
+
+  // MC topologically correct version
+  {
+    Point_range points;
+    Polygon_range triangles;
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    // run marching cubes isosurfacing
+    std::cout << "Running Marching Cubes (TMC) with isovalue = " << isovalue << std::endl;
+    CGAL::Isosurfacing::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                                        CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("marching_cubes_TMC.off", points, triangles);
+  }
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Cartesian_grid_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Cartesian_grid_3.h
new file mode 100644
index 00000000000..b0a63c65de8
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Cartesian_grid_3.h
@@ -0,0 +1,409 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_CARTESIAN_GRID_3_H
+#define CGAL_ISOSURFACING_3_CARTESIAN_GRID_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/partition_traits_Cartesian_grid.h>
+#include <CGAL/Isosurfacing_3/IO/OBJ.h>
+
+#include <CGAL/assertions.h>
+#include <CGAL/boost/graph/named_params_helper.h>
+#include <CGAL/Named_function_parameters.h>
+
+#include <array>
+#include <type_traits>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Partitions_helpers_grp
+ *
+ * A policy to choose whether grid vertex locations should be cached, or recomputed at each access.
+ *
+ * \tparam Tag a tag that is either `Tag_true` (locations are cached) or `Tag_false` (locations are not cached).
+ */
+template <typename Tag>
+struct Grid_vertex_memory_policy : public Tag { };
+
+/**
+ * \ingroup IS_Partitions_helpers_grp
+ *
+ * A convenience alias for the policy that caches grid vertex locations.
+ */
+using Cache_vertex_locations = Grid_vertex_memory_policy<Tag_true>;
+
+/**
+ * \ingroup IS_Partitions_helpers_grp
+ *
+ * A convenience alias for the policy that does not cache grid vertex locations.
+ */
+using Do_not_cache_vertex_locations = Grid_vertex_memory_policy<Tag_false>;
+
+namespace internal {
+
+template <typename GeomTraits,
+          typename MemoryPolicy = Do_not_cache_vertex_locations>
+struct Cartesian_grid_location
+{
+  using Point_3 = typename GeomTraits::Point_3;
+  using Vector_3 = typename GeomTraits::Vector_3;
+  using Iso_cuboid_3 = typename GeomTraits::Iso_cuboid_3;
+
+  Cartesian_grid_location() { } // just for compilation
+
+  Cartesian_grid_location(const Iso_cuboid_3& /*span*/,
+                          const std::array<std::size_t, 3>& /*dims*/,
+                          const Vector_3& /*spacing*/)
+  { }
+
+  template <typename Grid>
+  Point_3 operator()(const std::size_t i,
+                     const std::size_t j,
+                     const std::size_t k,
+                     const Grid& g) const
+  {
+    typename GeomTraits::Compute_x_3 x_coord = g.geom_traits().compute_x_3_object();
+    typename GeomTraits::Compute_y_3 y_coord = g.geom_traits().compute_y_3_object();
+    typename GeomTraits::Compute_z_3 z_coord = g.geom_traits().compute_z_3_object();
+    typename GeomTraits::Construct_point_3 point = g.geom_traits().construct_point_3_object();
+    typename GeomTraits::Construct_vertex_3 vertex = g.geom_traits().construct_vertex_3_object();
+
+    const Point_3& min_p = vertex(g.span(), 0);
+    return point(x_coord(min_p) + typename GeomTraits::FT(i) * g.spacing()[0],
+                 y_coord(min_p) + typename GeomTraits::FT(j) * g.spacing()[1],
+                 z_coord(min_p) + typename GeomTraits::FT(k) * g.spacing()[2]);
+  }
+};
+
+template <typename GeomTraits>
+struct Cartesian_grid_location<GeomTraits, Cache_vertex_locations>
+{
+  using Point_3 = typename GeomTraits::Point_3;
+  using Vector_3 = typename GeomTraits::Vector_3;
+  using Iso_cuboid_3 = typename GeomTraits::Iso_cuboid_3;
+
+  std::vector<Point_3> m_points;
+
+  Cartesian_grid_location() { } // just for compilation
+
+  Cartesian_grid_location(const Iso_cuboid_3& span,
+                          const std::array<std::size_t, 3>& dims,
+                          const Vector_3& spacing)
+  {
+    m_points.reserve(dims[0] * dims[1] * dims[2]);
+    for(std::size_t k=0; k<dims[2]; ++k)
+      for(std::size_t j=0; j<dims[1]; ++j)
+        for(std::size_t i=0; i<dims[0]; ++i)
+          m_points.emplace_back((span.min)() + Vector_3(i * spacing[0], j * spacing[1], k * spacing[2]));
+  }
+
+  template <typename Grid>
+  const Point_3& operator()(const std::size_t i,
+                            const std::size_t j,
+                            const std::size_t k,
+                            const Grid& g) const
+  {
+    const std::size_t linear_index = g.linear_index(i, j, k);
+    CGAL_precondition(linear_index < m_points.size());
+    return m_points[linear_index];
+  }
+};
+
+} // namespace internal
+
+/**
+ * \ingroup IS_Partitions_grp
+ *
+ * \cgalModels{IsosurfacingPartition_3}
+ *
+ * \brief The class `Cartesian_grid_3` represents a 3D %Cartesian grid, that is the partition of
+ * an iso-cuboid into identical iso-cuboidal cells.
+ *
+ * The class `Cartesian_grid_3` is one of the possible space partitioning data structures
+ * that can be used along with value and gradient fields to make up a domain.
+ *
+ * \tparam GeomTraits must be a model of `IsosurfacingTraits_3`.
+ * \tparam MemoryPolicy whether the geometric locations of the grid vertices are stored or not.
+ *                      Possible values are `CGAL::Isosurfacing::Cache_vertex_locations` and `CGAL::Isosurfacing::Do_not_cache_vertex_locations`.
+ *
+ * \sa `CGAL::Isosurfacing::Marching_cubes_domain_3()`
+ * \sa `CGAL::Isosurfacing::Dual_contouring_domain_3()`
+ */
+template <typename GeomTraits,
+          typename MemoryPolicy = Do_not_cache_vertex_locations>
+class Cartesian_grid_3
+{
+public:
+  using Geom_traits = GeomTraits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+  using Iso_cuboid_3 = typename Geom_traits::Iso_cuboid_3;
+
+  using Positioner = internal::Cartesian_grid_location<GeomTraits, MemoryPolicy>;
+
+private:
+  Iso_cuboid_3 m_span;
+  std::array<std::size_t, 3> m_dims;
+  Vector_3 m_spacing;
+
+  Positioner m_positioner;
+  Geom_traits m_gt;
+
+private:
+  void initialize_spacing()
+  {
+    typename Geom_traits::Compute_x_3 x_coord = m_gt.compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = m_gt.compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = m_gt.compute_z_3_object();
+    typename Geom_traits::Construct_vector_3 vector = m_gt.construct_vector_3_object();
+    typename Geom_traits::Construct_vertex_3 vertex = m_gt.construct_vertex_3_object();
+
+    // calculate grid spacing
+    const Point_3& min_p = vertex(m_span, 0);
+    const Point_3& max_p = vertex(m_span, 7);
+    const FT x_span = x_coord(max_p) - x_coord(min_p);
+    const FT y_span = y_coord(max_p) - y_coord(min_p);
+    const FT z_span = z_coord(max_p) - z_coord(min_p);
+
+    const FT d_x = x_span / FT(m_dims[0] - 1);
+    const FT d_y = y_span / FT(m_dims[1] - 1);
+    const FT d_z = z_span / FT(m_dims[2] - 1);
+
+    m_spacing = vector(d_x, d_y, d_z);
+
+    m_positioner = Positioner { m_span, m_dims, m_spacing };
+  }
+
+  void initialize_dimensions()
+  {
+    typename Geom_traits::Compute_x_3 x_coord = m_gt.compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = m_gt.compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = m_gt.compute_z_3_object();
+    typename Geom_traits::Construct_vertex_3 vertex = m_gt.construct_vertex_3_object();
+
+    const Point_3& min_p = vertex(m_span, 0);
+    const Point_3& max_p = vertex(m_span, 7);
+    const FT x_span = x_coord(max_p) - x_coord(min_p);
+    const FT y_span = y_coord(max_p) - y_coord(min_p);
+    const FT z_span = z_coord(max_p) - z_coord(min_p);
+
+    m_dims[0] = static_cast<std::size_t>(std::ceil(CGAL::to_double(x_span / m_spacing[0]))) + 1;
+    m_dims[1] = static_cast<std::size_t>(std::ceil(CGAL::to_double(y_span / m_spacing[1]))) + 1;
+    m_dims[2] = static_cast<std::size_t>(std::ceil(CGAL::to_double(z_span / m_spacing[2]))) + 1;
+
+    m_positioner = Positioner { m_span, m_dims, m_spacing };
+  }
+
+public:
+  /*!
+   * \brief Default constructor
+   */
+  Cartesian_grid_3()
+    : m_span{Point_3{0, 0, 0}, Point_3{0, 0, 0}},
+      m_dims{2, 2, 2},
+      m_spacing{0, 0, 0},
+      m_gt{Geom_traits()}
+  { }
+
+  /**
+   * \brief creates a %Cartesian grid with `dimensions[0]*dimensions[1]*dimensions[2]` grid vertices.
+   *
+   * The grid covers the space described by the iso-cuboid `span`.
+   *
+   * \param span the geometric span of the grid
+   * \param dimensions the number of grid vertices in the `x`, `y`, and `z` directions
+   * \param gt the geometric traits
+   *
+   * \pre all dimensions are strictly positive.
+   */
+  Cartesian_grid_3(const Iso_cuboid_3& span,
+                   const std::array<std::size_t, 3>& dimensions,
+                   const Geom_traits& gt = Geom_traits())
+    : m_span{span},
+      m_dims{dimensions},
+      m_gt{gt}
+  {
+    initialize_spacing();
+  }
+
+  /**
+   * \brief creates a %Cartesian grid with `dimensions[0]*dimensions[1]*dimensions[2]` grid vertices.
+   *
+   * The grid covers the space described by the iso-cuboid span,
+   * itself described through two diagonal corners `p` and `q`.
+   *
+   * \param p the lexicographically smallest corner of the iso-cuboid
+   * \param q the lexicographically largest corner of the iso-cuboid
+   * \param dimensions the number of grid vertices in the `x`, `y`, and `z` directions
+   * \param gt the geometric traits
+   *
+   * \pre `p` is lexicographically strictly smaller than `q`
+   * \pre all dimensions are strictly positive.
+   */
+  Cartesian_grid_3(const Point_3& p, const Point_3& q,
+                   const std::array<std::size_t, 3>& dimensions,
+                   const Geom_traits& gt = Geom_traits())
+    : Cartesian_grid_3{Iso_cuboid_3{p, q}, dimensions, gt}
+  { }
+
+  /**
+   * \brief creates a %Cartesian grid using a prescribed grid step `spacing`.
+   *
+   * The grid covers the space described by the iso-cuboid `span`.
+   *
+   * \param span the geometric span of the grid
+   * \param spacing the dimension of the paving cell, in the `x`, `y`, and `z` directions
+   * \param gt the geometric traits
+   *
+   * \pre the diagonal of `span` has length a multiple of `spacing`
+   */
+  Cartesian_grid_3(const Iso_cuboid_3& span,
+                   const Vector_3& spacing,
+                   const Geom_traits& gt = Geom_traits())
+    : m_span{span},
+      m_spacing{spacing},
+      m_gt{gt}
+  {
+    initialize_dimensions();
+  }
+
+  /**
+   * \brief creates a %Cartesian grid using a prescribed grid step.
+   *
+   * The grid covers the space described by an iso-cuboid, itself described through two diagonal corners.
+   *
+   * \param p the lexicographically smallest corner of the iso-cuboid
+   * \param q the lexicographically largest corner of the iso-cuboid
+   * \param spacing the dimension of the paving cell, in the `x`, `y`, and `z` directions, respectively.
+   * \param gt the geometric traits
+   *
+   * \pre `p` is lexicographically strictly smaller than `q`
+   * \pre the diagonal of the iso-cuboid has length a multiple of `spacing`
+   */
+  Cartesian_grid_3(const Point_3& p, const Point_3& q,
+                   const Vector_3& spacing,
+                   const Geom_traits& gt = Geom_traits())
+    : Cartesian_grid_3{Iso_cuboid_3{p, q}, spacing, gt}
+  { }
+
+public:
+  /**
+   * returns the geometric traits class.
+   */
+  const Geom_traits& geom_traits() const
+  {
+    return m_gt;
+  }
+
+  /**
+   * returns an iso-cuboid representing the geometric span of the %Cartesian grid.
+   */
+  const Iso_cuboid_3& span() const { return m_span; }
+
+  /**
+   * returns the number of grid vertices in the `x` direction.
+   */
+  std::size_t xdim() const { return m_dims[0]; }
+
+  /**
+   * returns the number of grid vertices in the `y` direction.
+   */
+  std::size_t ydim() const { return m_dims[1]; }
+
+  /**
+   * returns the number of grid vertices in the `z` direction.
+   */
+  std::size_t zdim() const { return m_dims[2]; }
+
+  /**
+   * returns the spacing of the %Cartesian grid, that is a vector whose coordinates are
+   * the grid steps in the `x`, `y`, and `z` directions, respectively.
+   */
+  const Vector_3& spacing() const { return m_spacing; }
+
+public:
+  /**
+   * returns the index of a grid cell given its indices (i.e., `(k * y_dim + j) * x_dim + i`).
+  */
+  std::size_t linear_index(const std::size_t i,
+                           const std::size_t j,
+                           const std::size_t k) const
+  {
+    CGAL_precondition(i < m_dims[0] && j < m_dims[1] && k < m_dims[2]);
+    return (k * m_dims[1] + j) * m_dims[0] + i;
+  }
+
+public:
+  /**
+   * \brief returns the coordinates of the grid cell that contains a given point.
+   *
+   * For points on the boundary between two cells, the smaller index is returned.
+   *
+   * \param p the point to be located
+   *
+   * \pre `p` is inside the grid.
+   */
+  std::array<std::size_t, 3> index(const Point_3& p) const
+  {
+    typename Geom_traits::Compute_x_3 x_coord = m_gt.compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = m_gt.compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = m_gt.compute_z_3_object();
+    typename Geom_traits::Construct_vertex_3 vertex = m_gt.construct_vertex_3_object();
+
+    const Point_3& min_p = vertex(m_span, 0);
+    std::size_t i = std::size_t((x_coord(p) - x_coord(min_p)) / x_coord(m_spacing));
+    std::size_t j = std::size_t((y_coord(p) - y_coord(min_p)) / y_coord(m_spacing));
+    std::size_t k = std::size_t((z_coord(p) - z_coord(min_p)) / z_coord(m_spacing));
+
+    if(i == xdim() - 1)
+      --i;
+    if(j == ydim() - 1)
+      --j;
+    if(k == zdim() - 1)
+      --k;
+
+    return {i, j, k};
+  }
+
+  // Geometry
+public:
+  /**
+   * \brief returns the geometric location of the grid vertex described by its three indices.
+   *
+   * Depending on the value of the template parameter `MemoryPolicy`, locations might not be stored
+   * but calculated on-the-fly.
+   *
+   * \param i the index in the `x` direction
+   * \param j the index in the `y` direction
+   * \param k the index in the `z` direction
+   *
+   * \pre `i < xdim()` and `j < ydim()` and `k < zdim()`
+   *
+   * \returns a const reference or a newly constructed point, depending on the caching policy.
+   */
+  decltype(auto) /*Point_3*/ point(const std::size_t i,
+                                   const std::size_t j,
+                                   const std::size_t k) const
+  {
+    return m_positioner(i, j, k, *this);
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_CARTESIAN_GRID_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Dual_contouring_domain_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Dual_contouring_domain_3.h
new file mode 100644
index 00000000000..134fe0af050
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Dual_contouring_domain_3.h
@@ -0,0 +1,110 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_DUAL_CONTOURING_DOMAIN_3_H
+#define CGAL_ISOSURFACING_3_DUAL_CONTOURING_DOMAIN_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h>
+#include <CGAL/Isosurfacing_3/edge_intersection_oracles_3.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Domains_grp
+ *
+ * \cgalModels{IsosurfacingDomainWithGradient_3}
+ *
+ * \brief A domain that can be used as input in the %Dual Contouring algorithm.
+ *
+ * \details This class is essentially a wrapper around the different bricks provided by its
+ * template parameters: `Partition` provides the spatial partitioning, `ValueField` and `GradientField`
+ * the values and gradients that define the isosurface. The optional template parameter
+ * `EdgeIntersectionOracle` gives control over the method used to compute edge-isosurface intersection points.
+ *
+ * \tparam Partition must be a model of `IsosurfacingPartition_3`
+ * \tparam ValueField must be a model of `IsosurfacingValueField_3`
+ * \tparam GradientField must be a model of `IsosurfacingGradientField_3`
+ * \tparam EdgeIntersectionOracle must be a model of `IsosurfacingEdgeIntersectionOracle_3`
+ *
+ * \sa `CGAL::Isosurfacing::dual_contouring()`
+ * \sa `CGAL::Isosurfacing::Marching_cubes_domain_3()`
+ */
+template <typename Partition,
+          typename ValueField,
+          typename GradientField,
+          typename EdgeIntersectionOracle = Dichotomy_edge_intersection>
+class Dual_contouring_domain_3
+#ifndef DOXYGEN_RUNNING
+  : public internal::Isosurfacing_domain_3<Partition, ValueField, GradientField, EdgeIntersectionOracle>
+#endif
+{
+private:
+  using Base = internal::Isosurfacing_domain_3<Partition, ValueField, GradientField, EdgeIntersectionOracle>;
+
+public:
+  /**
+   * \brief constructs a domain that can be used with the %Dual Contouring algorithm.
+   *
+   * \param partition the space partitioning data structure
+   * \param values a continuous field of scalar values, defined over the geometric span of `partition`
+   * \param gradients a continuous field of normalized vectors, defined over the geometric span of `partition`
+   * \param intersection_oracle the oracle for edge-isosurface intersection computation
+   *
+   * \warning the domain class keeps a reference to the `partition`, `values` and `gradients` objects.
+   * As such, users must ensure that the lifetimes of these objects exceed that of the domain object.
+   */
+  Dual_contouring_domain_3(const Partition& partition,
+                           const ValueField& values,
+                           const GradientField& gradients,
+                           const EdgeIntersectionOracle& intersection_oracle = EdgeIntersectionOracle())
+    : Base(partition, values, gradients, intersection_oracle)
+  { }
+};
+
+/**
+ * \ingroup IS_Domains_grp
+ *
+ * \brief creates a new instance of a domain that can be used with the %Dual Contouring algorithm.
+ *
+ * \tparam Partition must be a model of `IsosurfacingPartition_3`
+ * \tparam ValueField must be a model of `IsosurfacingValueField_3`
+ * \tparam GradientField must be a model of `IsosurfacingGradientField_3`
+ * \tparam EdgeIntersectionOracle must be a model of `IsosurfacingEdgeIntersectionOracle_3`
+ *
+ * \param partition the space partitioning data structure
+ * \param values a continuous field of scalar values, defined over the geometric span of `partition`
+ * \param gradients a continuous field of normalized vectors, defined over the geometric span of `partition`
+ * \param intersection_oracle the oracle for edge-isosurface intersection computation
+ *
+ * \warning the domain class keeps a reference to the `partition`, `values` and `gradients` objects.
+ * As such, users must ensure that the lifetimes of these objects exceed that of the domain object.
+ */
+template <typename Partition,
+          typename ValueField,
+          typename GradientField,
+          typename EdgeIntersectionOracle = Dichotomy_edge_intersection>
+Dual_contouring_domain_3<Partition, ValueField, GradientField, EdgeIntersectionOracle>
+create_dual_contouring_domain_3(const Partition& partition,
+                                const ValueField& values,
+                                const GradientField& gradients,
+                                const EdgeIntersectionOracle& intersection_oracle = EdgeIntersectionOracle())
+{
+  return { partition, values, gradients, intersection_oracle };
+}
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_DUAL_CONTOURING_DOMAIN_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Finite_difference_gradient_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Finite_difference_gradient_3.h
new file mode 100644
index 00000000000..69e8a6e46a0
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Finite_difference_gradient_3.h
@@ -0,0 +1,115 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_FINITE_DIFFERENCE_GRADIENT_3_H
+#define CGAL_ISOSURFACING_3_FINITE_DIFFERENCE_GRADIENT_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/number_utils.h>
+
+#include <functional>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Fields_grp
+ *
+ * \cgalModels{IsosurfacingGradientField_3}
+ *
+ * \brief Class template for a gradient that is calculated using finite differences.
+ *
+ * \details This gradient function evaluates a value function at six points that are
+ *          a given distance `delta` away from the queried point along the %Cartesian axes.
+ *
+ * \tparam GeomTraits must be a model of `IsosurfacingTraits_3`.
+ */
+template <typename GeomTraits>
+class Finite_difference_gradient_3
+{
+public:
+  using Geom_traits = GeomTraits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+private:
+  const std::function<FT(const Point_3&)> m_function;
+  const FT m_delta, m_half_step_inv;
+
+  GeomTraits m_gt;
+
+public:
+  /**
+   * \brief creates a new instance of this gradient class.
+   *
+   * \tparam ValueFunction must be a model of `IsosurfacingValueField_3`.
+   *
+   * \param function the function giving the scalar value at each point
+   * \param delta the distance between samples for calculating the finite differences
+   * \param gt the geometric traits class
+   */
+  template <typename ValueFunction>
+  Finite_difference_gradient_3(const ValueFunction& function,
+                               const FT delta,
+                               const Geom_traits& gt = Geom_traits())
+    : m_function{function},
+      m_delta{delta},
+      m_half_step_inv{FT{1} / (FT{2} * m_delta)},
+      m_gt{gt}
+  { }
+
+  /**
+   * \brief returns the value the gradient at a point in 3D space.
+   *
+   * \param p the point at which the gradient is computed.
+   */
+  Vector_3 operator()(const Point_3& p) const
+  {
+    typename Geom_traits::Compute_x_3 x_coord = m_gt.compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = m_gt.compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = m_gt.compute_z_3_object();
+    typename Geom_traits::Construct_point_3 point = m_gt.construct_point_3_object();
+    typename Geom_traits::Construct_vector_3 vector = m_gt.construct_vector_3_object();
+
+    // compute the gradient by sampling the function with finite differences
+    // at six points with distance delta around the query point
+    const FT x = x_coord(p), y = y_coord(p), z = z_coord(p);
+
+    const Point_3 p0 = point(x + m_delta, y, z);
+    const Point_3 p1 = point(x - m_delta, y, z);
+    const Point_3 p2 = point(x, y + m_delta, z);
+    const Point_3 p3 = point(x, y - m_delta, z);
+    const Point_3 p4 = point(x, y, z + m_delta);
+    const Point_3 p5 = point(x, y, z - m_delta);
+
+    const FT gx = (m_function(p0) - m_function(p1)) * m_half_step_inv;
+    const FT gy = (m_function(p2) - m_function(p3)) * m_half_step_inv;
+    const FT gz = (m_function(p4) - m_function(p5)) * m_half_step_inv;
+
+    const FT n = CGAL::approximate_sqrt(CGAL::square(gx) + CGAL::square(gy) + CGAL::square(gz));
+
+    if(is_zero(n))
+    {
+      CGAL_warning(false && "interpolated gradient is the null vector!");
+      return vector(0,0,0);
+    }
+
+    return vector(gx / n, gy / n, gz / n);
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_FINITE_DIFFERENCE_GRADIENT_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Gradient_function_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Gradient_function_3.h
new file mode 100644
index 00000000000..cd501cc9440
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Gradient_function_3.h
@@ -0,0 +1,90 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_GRADIENT_FUNCTION_3_H
+#define CGAL_ISOSURFACING_3_GRADIENT_FUNCTION_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/partition_traits.h>
+
+#include <functional>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Fields_grp
+ *
+ * \cgalModels{IsosurfacingGradientField_3}
+ *
+ * \brief The class `Gradient_function_3` represents a field of vectors computed
+ * using a user-provided unary function.
+ *
+ * \tparam Partition must be a model of `IsosurfacingPartition_3`
+ *
+ * \sa `CGAL::Isosurfacing::Dual_contouring_domain_3`
+ */
+template <typename Partition>
+class Gradient_function_3
+{
+public:
+  using Geom_traits = typename Partition::Geom_traits;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using PT = partition_traits<Partition>;
+  using vertex_descriptor = typename PT::vertex_descriptor;
+
+private:
+  std::function<Vector_3(const Point_3&)> m_fn;
+  const Partition& m_partition;
+
+public:
+  /**
+   * \brief constructs a field of gradients using a gradient function and a partition.
+   *
+   * \tparam Function must provide the following function signature:
+   *                  `Vector_3 operator()(const %Point_3&) const`
+   *
+   * \param fn the function providing gradients
+   * \param partition the space partitioning data structure
+   */
+  template <typename Function>
+  Gradient_function_3(const Function& fn,
+                      const Partition& partition)
+    : m_fn{fn},
+      m_partition{partition}
+  { }
+
+public:
+  /**
+   * \brief returns the value of the function at the point `p`.
+   */
+  Vector_3 operator()(const Point_3& p) const
+  {
+    return m_fn(p);
+  }
+
+  /**
+   * \brief returns the value of the function at the vertex `v`.
+   */
+  const Vector_3& operator()(const vertex_descriptor& v) const
+  {
+    return this->operator()(PT::point(v, m_partition));
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_GRADIENT_FUNCTION_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/IO/Image_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/IO/Image_3.h
new file mode 100644
index 00000000000..a8d1a033a27
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/IO/Image_3.h
@@ -0,0 +1,160 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_IO_IMAGE_3_H
+#define CGAL_ISOSURFACING_3_IO_IMAGE_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+
+#include <CGAL/Image_3.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace IO {
+
+/**
+ * \ingroup IS_IO_functions_grp
+ *
+ * \brief extracts geometry and values from a `CGAL::Image_3`.
+ *
+ * The dimensions and geometric span are read from the image. The values stored
+ * in the image must be of type `Geom_traits::FT` or implicitly convertible to it.
+ *
+ * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>` whose `GeomTraits` is a model of `IsosurfacingTraits_3`
+ * \tparam Values must be `CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>`
+ *
+ * \param image the image providing the data
+ * \param grid the output grid
+ * \param values the output values
+ */
+// We need to have the API pass us an existing grid / values pair because the values
+// usually keep a reference to the grid.
+template <typename Grid, typename Values>
+bool convert_image_to_grid(const CGAL::Image_3& image,
+                           Grid& grid,
+                           Values& values)
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Iso_cuboid_3 = typename Geom_traits::Iso_cuboid_3;
+
+  typename Geom_traits::Construct_point_3 point = grid.geom_traits().construct_point_3_object();
+  typename Geom_traits::Construct_iso_cuboid_3 iso_cuboid = grid.geom_traits().construct_iso_cuboid_3_object();
+
+  // compute span
+  const FT max_x = image.tx() + (image.xdim() - 1) * image.vx();
+  const FT max_y = image.ty() + (image.ydim() - 1) * image.vy();
+  const FT max_z = image.tz() + (image.zdim() - 1) * image.vz();
+  Iso_cuboid_3 span = iso_cuboid(point(image.tx(), image.ty(), image.tz()),
+                                 point(max_x, max_y, max_z));
+
+  // get spacing
+  // std::array<FT, 3> spacing = make_array(image.vx(), image.vy(), image.vz());
+
+  grid = Grid { span, CGAL::make_array<std::size_t>(image.xdim(), image.ydim(), image.zdim()) };
+
+  // copy values
+  for(std::size_t x=0; x<image.xdim(); ++x)
+    for(std::size_t y=0; y<image.ydim(); ++y)
+      for(std::size_t z=0; z<image.zdim(); ++z)
+        values(x, y, z) = image.value(x, y, z);
+
+  return true;
+}
+
+/**
+ * \ingroup IS_IO_functions_grp
+ *
+ * \brief create a `CGAL::Image_3` from a grid and a field of values.
+ *
+ * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>` with `GeomTraits`
+ *              a model of `IsosurfacingTraits_3`
+ * \tparam Values must be `CGAL::Isosurfacing::Interpolated_discrete_values_3<Grid>`
+ *
+ * \param grid the space partitioning data structure
+ * \param values the field of values
+ */
+template <typename Grid, typename Values>
+CGAL::Image_3 convert_grid_to_image(const Grid& grid,
+                                    const Values& values)
+{
+  using Geom_traits = typename Grid::Geom_traits;
+
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+
+  const Geom_traits& gt = grid.geom_traits();
+  typename Geom_traits::Compute_x_3 x_coord = gt.compute_x_3_object();
+  typename Geom_traits::Compute_y_3 y_coord = gt.compute_y_3_object();
+  typename Geom_traits::Compute_z_3 z_coord = gt.compute_z_3_object();
+  typename Geom_traits::Construct_vertex_3 vertex = gt.construct_vertex_3_object();
+
+  // select number type
+  WORD_KIND wordkind;
+  if constexpr(std::is_floating_point_v<FT>)
+    wordkind = WK_FLOAT;
+  else
+    wordkind = WK_FIXED;
+
+  // select signed or unsigned
+  SIGN sign;
+  if constexpr(std::is_signed_v<FT>)
+    sign = SGN_SIGNED;
+  else
+    sign = SGN_UNSIGNED;
+
+  // get spacing
+  const double vx = CGAL::to_double(grid.spacing()[0]);
+  const double vy = CGAL::to_double(grid.spacing()[1]);
+  const double vz = CGAL::to_double(grid.spacing()[2]);
+
+  // create image
+  _image* im = _createImage(grid.xdim(), grid.ydim(), grid.zdim(),
+                            1,           // vectorial dimension
+                            vx, vy, vz,  // voxel size
+                            sizeof(FT),  // image word size in bytes
+                            wordkind,    // image word kind WK_FIXED, WK_FLOAT, WK_UNKNOWN
+                            sign);       // image word sign
+
+  // error handling
+  if(im == nullptr || im->data == nullptr)
+    throw std::bad_alloc();
+
+  // set min coordinates
+  const Point_3& min_p = vertex(grid.span(), 0);
+  im->tx = float(CGAL::to_double(x_coord(min_p)));
+  im->ty = float(CGAL::to_double(y_coord(min_p)));
+  im->tz = float(CGAL::to_double(z_coord(min_p)));
+
+  // copy data
+  FT* data = static_cast<FT*>(im->data); // @fixme what compatibility with non trivial FTs?
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        const std::size_t lid = grid.linear_index(x, y, z);
+        data[lid] = values(grid.point(lid));
+      }
+    }
+  }
+
+  return Image_3 { im, Image_3::OWN_THE_DATA };
+}
+
+} // namespace IO
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_IO_IMAGE_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/IO/OBJ.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/IO/OBJ.h
new file mode 100644
index 00000000000..1f4cde8dd7f
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/IO/OBJ.h
@@ -0,0 +1,101 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_IMAGE_3_H
+#define CGAL_ISOSURFACING_3_IMAGE_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+
+#include <CGAL/boost/graph/named_params_helper.h>
+#include <CGAL/IO/io.h>
+#include <CGAL/Named_function_parameters.h>
+
+#include <string>
+#include <fstream>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+template <typename GeomTraits, typename MemoryPolicy>
+class Cartesian_grid_3;
+
+namespace IO {
+
+template <typename GeomTraits, typename MemoryPolicy,
+          typename NamedParameters = parameters::Default_named_parameters>
+bool write_OBJ(std::ostream& out,
+               const Cartesian_grid_3<GeomTraits, MemoryPolicy>& grid,
+               const NamedParameters& np = parameters::default_values())
+{
+  using Point_3 = typename GeomTraits::Point_3;
+
+  typename GeomTraits::Compute_x_3 x_coord = grid.geom_traits().compute_x_3_object();
+  typename GeomTraits::Compute_y_3 y_coord = grid.geom_traits().compute_y_3_object();
+  typename GeomTraits::Compute_z_3 z_coord = grid.geom_traits().compute_z_3_object();
+  typename GeomTraits::Construct_vertex_3 vertex = grid.geom_traits().construct_vertex_3_object();
+
+  ::CGAL::IO::set_ascii_mode(out); // obj is ASCII only
+
+  set_stream_precision_from_NP(out, np);
+
+  if(out.fail())
+    return false;
+
+  // write vertices
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        const Point_3& p = vertex(grid.span(), 0);
+        const double x_coord_d = CGAL::to_double(x_coord(p) + x * grid.spacing()[0]);
+        const double y_coord_d = CGAL::to_double(y_coord(p) + y * grid.spacing()[1]);
+        const double z_coord_d = CGAL::to_double(z_coord(p) + z * grid.spacing()[2]);
+        out << "v " << x_coord_d << " " << y_coord_d << " " << z_coord_d << std::endl;
+      }
+    }
+  }
+
+  // write faces
+  for(std::size_t x=0; x<grid.xdim()-1; ++x) {
+    for(std::size_t y=0; y<grid.ydim()-1; ++y) {
+      for(std::size_t z=0; z<grid.zdim()-1; ++z)
+      {
+        const std::size_t v0 = (z * grid.ydim() + y) * grid.xdim() + x;
+        const std::size_t v1 = (z * grid.ydim() + y + 1) * grid.xdim() + x;
+        const std::size_t v2 = (z * grid.ydim() + y + 1) * grid.xdim() + x + 1;
+        const std::size_t v3 = (z * grid.ydim() + y) * grid.xdim() + x + 1;
+        out << "f " << v0+1 << " " << v1+1 << " " << v2+1 << " " << v3+1 << std::endl;
+      }
+    }
+  }
+
+  return out.good();
+}
+
+template <typename GeomTraits, typename MemoryPolicy,
+          typename NamedParameters = parameters::Default_named_parameters>
+bool write_OBJ(const std::string& fname,
+               const Cartesian_grid_3<GeomTraits, MemoryPolicy>& grid,
+               const NamedParameters& np = parameters::default_values())
+{
+  std::ofstream os(fname);
+  CGAL::IO::set_mode(os, CGAL::IO::ASCII);
+
+  return write_OBJ(os, grid, np);
+}
+
+} // namespace IO
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_IMAGE_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Interpolated_discrete_gradients_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Interpolated_discrete_gradients_3.h
new file mode 100644
index 00000000000..5fd406006ba
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Interpolated_discrete_gradients_3.h
@@ -0,0 +1,127 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERPOLATED_DISCRETE_GRADIENTS_3_H
+#define CGAL_ISOSURFACING_3_INTERPOLATED_DISCRETE_GRADIENTS_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/partition_traits.h>
+#include <CGAL/Isosurfacing_3/interpolation_schemes_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+
+#include <vector>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Fields_grp
+ *
+ * \cgalModels{IsosurfacingValueField_3}
+ *
+ * \brief Class template for a gradient field that is computed using discrete values and interpolation.
+ *
+ * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>`, with `GeomTraits` a model of `IsosurfacingTraits_3`
+ * \tparam InterpolationScheme must be a model of `IsosurfacingInterpolationScheme_3`
+ */
+template <typename Grid,
+          typename InterpolationScheme = Trilinear_interpolation<Grid> >
+class Interpolated_discrete_gradients_3
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using vertex_descriptor = typename partition_traits<Grid>::vertex_descriptor;
+
+private:
+  const Grid& m_grid;
+  const InterpolationScheme m_interpolation;
+
+  std::vector<Vector_3> m_gradients;
+
+public:
+  Interpolated_discrete_gradients_3(const Grid& grid,
+                                    const InterpolationScheme& interpolation = InterpolationScheme())
+    : m_grid{grid},
+      m_interpolation{interpolation}
+  {
+    // pre-allocate memory
+    const std::size_t nv = grid.xdim() * grid.ydim() * grid.zdim();
+    m_gradients.resize(nv);
+  }
+
+  /// computes (using finite difference) and stores gradients at all vertices of the grid.
+  /// \tparam ValueField must be a model of `IsosurfacingValueField_3`
+  /// \param values a field of values whose gradient are being computed
+  template <typename ValueField>
+  void compute_discrete_gradients(const ValueField& values)
+  {
+    const FT step = CGAL::approximate_sqrt(m_grid.spacing().squared_length()) * 0.01; // finite difference step
+    Finite_difference_gradient_3<Geom_traits> g(values, step);
+
+   for(std::size_t i=0; i<m_grid.xdim(); ++i)
+      for(std::size_t j=0; j<m_grid.ydim(); ++j)
+        for(std::size_t k=0; k<m_grid.zdim(); ++k)
+          m_gradients[m_grid.linear_index(i, j, k)] = g(m_grid.point(i,j,k));
+  }
+
+public:
+  /**
+   * \brief returns the gradient stored at the grid vertex described by its three indices.
+   *
+   * \note This function can be used to set the gradient at a grid vertex.
+   *
+   * \param i the index in the `x` direction
+   * \param j the index in the `y` direction
+   * \param k the index in the `z` direction
+   *
+   * \pre `i < xdim()` and `j < ydim()` and `k < zdim()`
+   */
+  Vector_3& operator()(const std::size_t i,
+                       const std::size_t j,
+                       const std::size_t k)
+  {
+    return m_gradients[m_grid.linear_index(i, j, k)];
+  }
+
+  /**
+   * \brief returns the gradient stored at the grid vertex described by a set of indices.
+   *
+   * \param i the index in the `x` direction
+   * \param j the index in the `y` direction
+   * \param k the index in the `z` direction
+   *
+   * \pre `i < xdim()` and `j < ydim()` and `k < zdim()`
+   */
+  const Vector_3& operator()(const std::size_t i,
+                             const std::size_t j,
+                             const std::size_t k) const
+  {
+    return m_gradients[m_grid.linear_index(i, j, k)];
+  }
+
+  /*!
+   * returns the gradient at a given point `p`.
+   */
+  Vector_3 operator()(const Point_3& p) const
+  {
+    return m_interpolation.interpolated_gradient(p, m_grid, m_gradients);
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERPOLATED_DISCRETE_GRADIENTS_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h
new file mode 100644
index 00000000000..e34909cec21
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h
@@ -0,0 +1,124 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERPOLATED_DISCRETE_VALUES_3_H
+#define CGAL_ISOSURFACING_3_INTERPOLATED_DISCRETE_VALUES_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/partition_traits.h>
+
+#include <CGAL/Isosurfacing_3/interpolation_schemes_3.h>
+
+#include <array>
+#include <vector>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Fields_grp
+ *
+ * \cgalModels{IsosurfacingValueField_3}
+ *
+ * \brief Class template for a field of values that are calculated using discrete values and interpolation.
+ *
+ * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>`, with `GeomTraits` a model of `IsosurfacingTraits_3`
+ * \tparam InterpolationScheme must be a model of `IsosurfacingInterpolationScheme_3`
+ */
+template <typename Grid,
+          typename InterpolationScheme = Trilinear_interpolation<Grid> >
+class Interpolated_discrete_values_3
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+
+  using vertex_descriptor = typename partition_traits<Grid>::vertex_descriptor;
+
+private:
+  const Grid& m_grid;
+  const InterpolationScheme m_interpolation;
+
+  std::vector<FT> m_values;
+
+public:
+  Interpolated_discrete_values_3(const Grid& grid,
+                                 const InterpolationScheme& interpolation = InterpolationScheme())
+    : m_grid{grid},
+      m_interpolation{interpolation}
+  {
+    // pre-allocate memory
+    const std::size_t nv = grid.xdim() * grid.ydim() * grid.zdim();
+    m_values.resize(nv);
+  }
+
+public:
+  /**
+   * \brief returns the scalar value stored at the grid vertex described by its three indices.
+   *
+   * \note This function can be used to set the value at a grid vertex.
+   *
+   * \param i the index in the `x` direction
+   * \param j the index in the `y` direction
+   * \param k the index in the `z` direction
+   *
+   * \pre `i < xdim()` and `j < ydim()` and `k < zdim()`
+   */
+  FT& operator()(const std::size_t i,
+                 const std::size_t j,
+                 const std::size_t k)
+  {
+    const std::size_t id = m_grid.linear_index(i, j, k);
+    if(id >= m_values.size())
+      m_values.resize(id + 1);
+    return m_values[id];
+  }
+
+  /**
+   * \brief returns the scalar value stored at the grid vertex described by its three indices.
+   *
+   * \param i the index in the `x` direction
+   * \param j the index in the `y` direction
+   * \param k the index in the `z` direction
+   *
+   * \pre `i < xdim()` and `j < ydim()` and `k < zdim()`
+   */
+  FT operator()(const std::size_t i,
+                const std::size_t j,
+                const std::size_t k) const
+  {
+    CGAL_precondition(i < m_grid.xdim() && j < m_grid.ydim() && k < m_grid.zdim());
+    return m_values[m_grid.linear_index(i, j, k)];
+  }
+
+  /*!
+   * returns the interpolated value at vertex `v`.
+   */
+  FT operator()(const vertex_descriptor& v) const
+  {
+    return this->operator()(v[0], v[1], v[2]);
+  }
+
+  /*!
+   * returns the interpolated value at point `p`.
+   */
+  FT operator()(const Point_3& p) const
+  {
+    return m_interpolation.interpolated_value(p, m_grid, m_values);
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERPOLATED_DISCRETE_VALUES_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Marching_cubes_domain_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Marching_cubes_domain_3.h
new file mode 100644
index 00000000000..11008340f41
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Marching_cubes_domain_3.h
@@ -0,0 +1,102 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_MARCHING_CUBES_DOMAIN_3_H
+#define CGAL_ISOSURFACING_3_MARCHING_CUBES_DOMAIN_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h>
+#include <CGAL/Isosurfacing_3/edge_intersection_oracles_3.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Domains_grp
+ *
+ * \cgalModels{IsosurfacingDomain_3}
+ *
+ * \brief A domain that can be used with the Marching Cubes algorithm.
+ *
+ * \details This class is essentially wrapper around the different bricks provided by its
+ * template parameters: `Partition` provides the spatial partitioning, `ValueField`
+ * the values that define the isosurface. The optional template parameter
+ * `EdgeIntersectionOracle` gives control over the method used to compute edge-isosurface intersection points.
+ *
+ * \tparam Partition must be a model of `IsosurfacingPartition_3`
+ * \tparam ValueField must be a model of `IsosurfacingValueField_3`
+ * \tparam EdgeIntersectionOracle must be a model of `IsosurfacingEdgeIntersectionOracle_3`
+ *
+ * \sa `CGAL::Isosurfacing::marching_cubes()`
+ * \sa `CGAL::Isosurfacing::Dual_contouring_domain_3`
+ */
+template <typename Partition,
+          typename ValueField,
+          typename EdgeIntersectionOracle = CGAL::Isosurfacing::Linear_interpolation_edge_intersection>
+class Marching_cubes_domain_3
+#ifndef DOXYGEN_RUNNING
+  : public internal::Isosurfacing_domain_3<Partition, ValueField, EdgeIntersectionOracle>
+#endif
+{
+private:
+  using Base = internal::Isosurfacing_domain_3<Partition, ValueField, EdgeIntersectionOracle>;
+
+public:
+  /**
+   * \brief constructs a domain that can be used with the Marching Cubes algorithm.
+   *
+   * \param partition the space partitioning data structure
+   * \param values a continuous field of scalar values, defined over the geometric span of `partition`
+   * \param intersection_oracle the oracle for edge-isosurface intersection computation
+   *
+   * \warning the domain class keeps a reference to the `partition`, `values` and `gradients` objects.
+   * As such, users must ensure that the lifetimes of these objects exceed that of the domain object.
+   */
+  Marching_cubes_domain_3(const Partition& partition,
+                          const ValueField& values,
+                          const EdgeIntersectionOracle& intersection_oracle = EdgeIntersectionOracle())
+    : Base(partition, values, intersection_oracle)
+  { }
+};
+
+/**
+ * \ingroup IS_Domains_grp
+ *
+ * \brief creates a new instance of a domain that can be used with the Marching Cubes algorithm.
+ *
+ * \tparam Partition must be a model of `IsosurfacingPartition_3`
+ * \tparam ValueField must be a model of `IsosurfacingValueField_3`
+ * \tparam EdgeIntersectionOracle must be a model of `IsosurfacingEdgeIntersectionOracle_3`
+ *
+ * \param partition the space partitioning data structure
+ * \param values a continuous field of scalar values, defined over the geometric span of `partition`
+ * \param intersection_oracle the oracle for edge-isosurface intersection computation
+ *
+ * \warning the domain class keeps a reference to the `partition`, `values` and `gradients` objects.
+ * As such, users must ensure that the lifetimes of these objects exceed that of the domain object.
+ */
+template <typename Partition,
+          typename ValueField,
+          typename EdgeIntersectionOracle = Linear_interpolation_edge_intersection>
+Marching_cubes_domain_3<Partition, ValueField, EdgeIntersectionOracle>
+create_marching_cubes_domain_3(const Partition& partition,
+                               const ValueField& values,
+                               const EdgeIntersectionOracle& intersection_oracle = EdgeIntersectionOracle())
+{
+  return { partition, values, intersection_oracle };
+}
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_MARCHING_CUBES_DOMAIN_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Octree_partition.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Octree_partition.h
new file mode 100644
index 00000000000..547704cbfe3
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Octree_partition.h
@@ -0,0 +1,21 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Sven Oesau
+
+#ifndef CGAL_ISOSURFACING_3_OCTREE_PARTITION_H
+#define CGAL_ISOSURFACING_3_OCTREE_PARTITION_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Octree.h>
+#include <CGAL/Isosurfacing_3/internal/Octree_domain_3.h>
+#include <CGAL/Isosurfacing_3/internal/partition_traits_Octree.h>
+
+#endif // CGAL_ISOSURFACING_3_OCTREE_PARTITION_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/Value_function_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Value_function_3.h
new file mode 100644
index 00000000000..f495aa7f98d
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/Value_function_3.h
@@ -0,0 +1,91 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_VALUE_FUNCTION_3_H
+#define CGAL_ISOSURFACING_3_VALUE_FUNCTION_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/partition_traits.h>
+
+#include <functional>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Fields_grp
+ *
+ * \cgalModels{IsosurfacingValueField_3}
+ *
+ * \brief The class `Value_function_3` represents a field of scalars computed
+ * using a user-provided unary function.
+ *
+ * \tparam Partition must be a model of `IsosurfacingPartition_3`
+ *
+ * \sa `CGAL::Isosurfacing::Marching_cubes_domain_3`
+ * \sa `CGAL::Isosurfacing::Dual_contouring_domain_3`
+ */
+template <typename Partition>
+class Value_function_3
+{
+public:
+  using Geom_traits = typename Partition::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+
+  using PT = partition_traits<Partition>;
+  using vertex_descriptor = typename PT::vertex_descriptor;
+
+private:
+  std::function<FT(const Point_3&)> m_fn;
+  const Partition& m_partition;
+
+public:
+  /**
+   * \brief constructs a field of values using a value function and a partition.
+   *
+   * \tparam Function must provide the following function signature:
+   *                  `FT operator()(const %Point_3&) const`
+   *
+   * \param fn the function providing values
+   * \param partition the space partitioning data structure
+   */
+  template <typename Function>
+  Value_function_3(const Function& fn,
+                   const Partition& partition)
+    : m_fn{fn},
+      m_partition{partition}
+  { }
+
+public:
+  /**
+   * \brief returns the value of the function at the point `p`.
+   */
+  FT operator()(const Point_3& p) const
+  {
+    return m_fn(p);
+  }
+
+  /**
+   * \brief returns the value of the function at the vertex `v`.
+   */
+  FT operator()(const vertex_descriptor& v) const
+  {
+    return this->operator()(PT::point(v, m_partition));
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_VALUE_FUNCTION_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/dual_contouring_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/dual_contouring_3.h
new file mode 100644
index 00000000000..ed907ab1e8d
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/dual_contouring_3.h
@@ -0,0 +1,97 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Daniel Zint
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_DUAL_CONTOURING_3_H
+#define CGAL_ISOSURFACING_3_DUAL_CONTOURING_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/dual_contouring_functors.h>
+
+#include <CGAL/tags.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Methods_grp
+ *
+ * \brief creates a polygon soup that discretizes an isosurface using the %Dual Contouring algorithm.
+ *
+ * \details The point placement strategy within each cell of the space partition is based on
+ * Quadric Error Metrics ("QEM", or "QEF" in %Dual Contouring-related works).
+ *
+ * \tparam ConcurrencyTag enables sequential versus parallel algorithm.
+ *                        Possible values are `Sequential_tag`, `Parallel_if_available_tag`, or `Parallel_tag`.
+ * \tparam Domain must be a model of `IsosurfacingDomainWithGradient_3`.
+ * \tparam PointRange must be a model of the concept `AssociativeContainer`
+ *                    whose value type can be constructed from the point type of the domain.
+ * \tparam PolygonRange must be a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
+ *                      whose value type is itself a model of the concepts `RandomAccessContainer`
+ *                      and `BackInsertionSequence` whose value type is `std::size_t`.
+ * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+ *
+ * \param domain the domain providing the spatial partition and the values and gradient data
+ * \param isovalue the value defining the isosurface
+ * \param points the points of the polygons in the output polygon soup
+ * \param polygons the faces of the output polygon soup. Each element in the vector describes a polygon
+ *                 (either quads or triangles, see the named parameter `do_not_triangulate_faces`)
+ *                  using the indices of the points in `points`.
+ * \param np optional \ref bgl_namedparameters "Named Parameters" described below
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{constrain_to_cell}
+ *     \cgalParamDescription{whether to constrain the vertex location to the geometrical space of its cell}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`false`}
+ *     \cgalParamExtra{Constraining the vertex to its dual cell guarantees that the resulting
+ *                     surface is without self-intersections (non-manifoldness aside). Oppositely,
+ *                     an unconstrained positioning strategy might produce better looking surfaces
+ *                     near sharp features (ridges, corners), at the cost of possible self-intersections.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{do_not_triangulate_faces}
+ *     \cgalParamDescription{If `true`, the output will contain quadrilaterals.
+ *                           If `false`, the output will contain triangles.}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`false` (faces are triangulated)}
+ *     \cgalParamExtra{Triangulating faces is done by inserting the intersection between an edge and
+ *                     the isosurface, and linking it to the dual points of the cells incident to the edge.
+ *                     If `constrain_to_cell` is set to `false`, triangulation faces can result in additional
+ *                     self-intersections. An alternative that has worse approximation but is less likely
+ *                     to produce self-intersections is to use the function
+ *                     `CGAL::Polygon_mesh_processing::triangulate_faces()`.}
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
+ *
+ * \sa `CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh()`
+ */
+template <typename ConcurrencyTag = CGAL::Sequential_tag,
+          typename Domain,
+          typename PointRange,
+          typename PolygonRange,
+          typename NamedParameters = parameters::Default_named_parameters>
+void dual_contouring(const Domain& domain,
+                     const typename Domain::Geom_traits::FT isovalue,
+                     PointRange& points,
+                     PolygonRange& polygons,
+                     const NamedParameters& np = parameters::default_values())
+{
+  internal::Dual_contourer<ConcurrencyTag, Domain, internal::DC_Strategy::QEM> contourer;
+  contourer(domain, isovalue, points, polygons, np);
+}
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_DUAL_CONTOURING_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/edge_intersection_oracles_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/edge_intersection_oracles_3.h
new file mode 100644
index 00000000000..5de1c3182eb
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/edge_intersection_oracles_3.h
@@ -0,0 +1,223 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_EDGE_INTERSECTION_ORACLES_3_H
+#define CGAL_ISOSURFACING_3_EDGE_INTERSECTION_ORACLES_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/assertions.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Domain_helpers_grp
+ *
+ * \cgalModels{IsosurfacingEdgeIntersectionOracle_3}
+ *
+ * \brief The class `Dichotomy_edge_intersection` uses a dichotomy to find the intersection point
+ * between an edge and the isosurface.
+ *
+ * This class is for example suitable to be used as the `EdgeIntersectionOracle` template
+ * parameter of isosurfacing domain classes when values are computed using an implicit function.
+ *
+ * \warning It is not optimal to use this class when values are interpolated from discrete values
+ * since the intersection can be computed analytically in this case.
+ *
+ * \sa `CGAL::Isosurfacing::Linear_interpolation_edge_intersection`
+ * \sa `CGAL::Isosurfacing::Marching_cubes_domain_3`
+ * \sa `CGAL::Isosurfacing::Dual_contouring_domain_3`
+ */
+struct Dichotomy_edge_intersection
+{
+  unsigned int m_max_iterations;
+  double m_relative_eps;
+
+public:
+  /*!
+  * Constructor, enabling setting up the two criteria which can stop the dichotomy: either a
+  * threshold on the value (i.e., the difference between the isovalue and the value at the current
+  * point is smaller than `relative_eps * isovalue`), or a maximum number of iterations.
+  */
+  Dichotomy_edge_intersection(unsigned int max_iterations = 10,
+                              double relative_eps = 1e-7)
+    : m_max_iterations(max_iterations),
+      m_relative_eps(relative_eps)
+  { }
+
+  /*!
+   * \brief computes the intersection point between an edge and the isosurface.
+   *
+   * The result (if it exists) is stored in `p`.
+   *
+   * \tparam Domain must be a model of `IsosurfacingDomain_3`
+   *
+   * \param p_0 the location of the first vertex of the edge
+   * \param p_1 the location of the second vertex of the edge
+   * \param val_0 the value at the first vertex of the edge
+   * \param val_1 the value at the second vertex of the edge
+   * \param domain the isosurfacing domain
+   * \param isovalue the isovalue defining the isosurface with which we seek an intersection
+   * \param p the intersection point, if it exists
+   *
+   * \return `true` if the intersection point exists, `false` otherwise
+   */
+  template <typename Domain> // == Isosurfacing_domain_3 or similar
+  bool operator()(const typename Domain::Geom_traits::Point_3& p_0,
+                  const typename Domain::Geom_traits::Point_3& p_1,
+                  const typename Domain::Geom_traits::FT val_0,
+                  const typename Domain::Geom_traits::FT val_1,
+                  const Domain& domain,
+                  const typename Domain::Geom_traits::FT isovalue,
+                  typename Domain::Geom_traits::Point_3& p) const
+  {
+    using Geom_traits = typename Domain::Geom_traits;
+    using FT = typename Geom_traits::FT;
+    using Point_3 = typename Geom_traits::Point_3;
+
+    typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+    typename Geom_traits::Construct_point_3 point = domain.geom_traits().construct_point_3_object();
+
+    const bool sl = (val_0 <= isovalue);
+    const bool sr = (val_1 <= isovalue);
+
+    if(sl == sr)
+      return false;
+
+    Point_3 pl = p_0;
+    Point_3 pr = p_1;
+
+    unsigned int dichotomy_iterations = m_max_iterations, iter = 0;
+    const FT eps = (std::max)(FT(m_relative_eps), std::abs(isovalue) * FT(m_relative_eps));
+    do
+    {
+      p = point((x_coord(pl) + x_coord(pr)) / FT(2),
+                (y_coord(pl) + y_coord(pr)) / FT(2),
+                (z_coord(pl) + z_coord(pr)) / FT(2));
+
+      const FT val_p = domain.value(p);
+      const bool sp = (val_p <= isovalue);
+
+      if(sl == sp)
+        pl = p;
+      else if(sp == sr)
+        pr = p;
+      else
+        break;
+
+      if(std::abs(val_p - isovalue) < eps)
+        return true;
+    }
+    while(++iter < dichotomy_iterations);
+
+
+    return true;
+  }
+};
+
+/**
+ * \ingroup IS_Domain_helpers_grp
+ *
+ * \cgalModels{IsosurfacingEdgeIntersectionOracle_3}
+ *
+ * \brief The class `Linear_interpolation_edge_intersection` uses linear interpolation
+ * to find the intersection point between an edge and the isosurface.
+ *
+ * This class is for example suitable when interpolated discrete values are being used.
+ *
+ * \sa `CGAL::Isosurfacing::Dichotomy_edge_intersection`
+ * \sa `CGAL::Isosurfacing::Marching_cubes_domain_3`
+ * \sa `CGAL::Isosurfacing::Dual_contouring_domain_3`
+ * \sa `CGAL::Isosurfacing::Interpolated_discrete_values_3`
+ */
+struct Linear_interpolation_edge_intersection
+{
+  /*!
+   * \brief computes the intersection point between an edge and the isosurface.
+   *
+   * \tparam Domain must be a model of `IsosurfacingDomain_3`
+   *
+   * \param p_0 the location of the first vertex of the edge
+   * \param p_1 the location of the second vertex of the edge
+   * \param val_0 the value at the first vertex of the edge
+   * \param val_1 the value at the second vertex of the edge
+   * \param domain the isosurfacing domain
+   * \param isovalue the isovalue defining the isosurface with which we seek an intersection
+   * \param p the intersection point, if it exists
+   *
+   * \return `true` if the intersection point exists, `false` otherwise
+   */
+  template <typename Domain>
+  bool operator()(const typename Domain::Geom_traits::Point_3& p_0,
+                  const typename Domain::Geom_traits::Point_3& p_1,
+                  const typename Domain::Geom_traits::FT val_0,
+                  const typename Domain::Geom_traits::FT val_1,
+                  const Domain& domain,
+                  const typename Domain::Geom_traits::FT isovalue,
+                  typename Domain::Geom_traits::Point_3& p) const
+  {
+    using Geom_traits = typename Domain::Geom_traits;
+    using FT = typename Geom_traits::FT;
+
+    typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+    typename Geom_traits::Construct_point_3 point = domain.geom_traits().construct_point_3_object();
+
+    if((val_0 <= isovalue) == (val_1 <= isovalue))
+      return false;
+
+    const FT den = val_0 - val_1;
+    const FT u = is_zero(den) ? 0.5 : (val_0 - isovalue) / den;
+    p = point((FT(1) - u) * x_coord(p_0) + u * x_coord(p_1),
+              (FT(1) - u) * y_coord(p_0) + u * y_coord(p_1),
+              (FT(1) - u) * z_coord(p_0) + u * z_coord(p_1));
+
+    return true;
+  }
+};
+
+#ifndef DOXYGEN_RUNNING
+/*
+ * \ingroup IS_Domain_helpers_grp
+ *
+ * \cgalModels{IsosurfacingEdgeIntersectionOracle_3}
+ *
+ * \brief The class `Ray_marching_edge_intersection` uses ray marching to find the intersection point
+ * between an edge and the isosurface.
+ *
+ * This class is suitable when the values stem from a signed distance function.
+ */
+//
+// @todo this is for the case where we know domain.value is an SDF
+// then we could do better than a dichotomy
+// see https://github.com/MaelRL/cgal/blob/AW3-Sharp_and_sparse-GF/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/offset_intersection.h
+struct Ray_marching_edge_intersection
+{
+  template <typename Domain> // == Isosurfacing_domain_3 or similar
+  bool operator()(const typename Domain::Geom_traits::Point_3& p_0,
+                  const typename Domain::Geom_traits::Point_3& p_1,
+                  const typename Domain::Geom_traits::FT val_0,
+                  const typename Domain::Geom_traits::FT val_1,
+                  const Domain& domain,
+                  const typename Domain::Geom_traits::FT isovalue,
+                  typename Domain::Geom_traits::Point_3& p) const;
+};
+#endif // DOXYGEN_RUNNING
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_EDGE_INTERSECTION_ORACLES_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Cell_type.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Cell_type.h
new file mode 100644
index 00000000000..5ee49b20960
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Cell_type.h
@@ -0,0 +1,34 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_DOMAIN_CELL_TYPE_H
+#define CGAL_ISOSURFACING_3_INTERNAL_DOMAIN_CELL_TYPE_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <limits>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+// Was supposed to check if an algorithm can handle a specific domain. Not used right now.
+using Cell_type = std::size_t;
+
+static constexpr Cell_type ANY_CELL = (std::numeric_limits<std::size_t>::max)();
+
+static constexpr Cell_type POLYHEDRAL_CELL = (std::size_t(1) << 0);
+static constexpr Cell_type TETRAHEDRAL_CELL = (std::size_t(1) << 1);
+static constexpr Cell_type CUBICAL_CELL = (std::size_t(1) << 2);
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_DOMAIN_CELL_TYPE_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h
new file mode 100644
index 00000000000..0f7d65f5491
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h
@@ -0,0 +1,175 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_ISOSURFACING_DOMAIN_3_H
+#define CGAL_ISOSURFACING_3_INTERNAL_ISOSURFACING_DOMAIN_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/Cell_type.h>
+#include <CGAL/Isosurfacing_3/internal/partition_traits.h>
+#include <CGAL/Isosurfacing_3/edge_intersection_oracles_3.h>
+
+#include <CGAL/tags.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+
+// This class is pretty much just the concatenation of the following classes:
+// - Partition: Space partitioning data structure, e.g. Cartesian grid, octree, ...
+// - Values: values over the 3D space
+// - Gradients: gradients over the 3D space
+// - Oracle: edge-isosurface intersection computation
+template <typename Partition,
+          typename ValueField,
+          typename GradientField,
+          typename IntersectionOracle = CGAL::Isosurfacing::Dichotomy_edge_intersection>
+class Isosurfacing_domain_3
+{
+public:
+  using Edge_intersection_oracle = IntersectionOracle;
+
+  using Geom_traits = typename Partition::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using PT = CGAL::Isosurfacing::partition_traits<Partition>;
+
+  using vertex_descriptor = typename PT::vertex_descriptor;
+  using edge_descriptor = typename PT::edge_descriptor;
+  using cell_descriptor = typename PT::cell_descriptor;
+
+  using Edge_vertices = typename PT::Edge_vertices;
+  using Cells_incident_to_edge = typename PT::Cells_incident_to_edge;
+  using Cell_vertices = typename PT::Cell_vertices;
+  using Cell_edges = typename PT::Cell_edges;
+
+  static constexpr Cell_type CELL_TYPE = PT::CELL_TYPE;
+  static constexpr std::size_t VERTICES_PER_CELL = PT::VERTICES_PER_CELL;
+  static constexpr std::size_t EDGES_PER_CELL = PT::EDGES_PER_CELL;
+
+private:
+  const Partition& m_partition;
+  const ValueField& m_values;
+  const GradientField& m_gradients;
+  const IntersectionOracle m_intersection_oracle;
+
+public:
+  Isosurfacing_domain_3(const Partition& partition,
+                        const ValueField& values,
+                        const GradientField& gradients,
+                        const IntersectionOracle& intersection_oracle = IntersectionOracle())
+    : m_partition{partition},
+      m_values{values},
+      m_gradients{gradients},
+      m_intersection_oracle{intersection_oracle}
+  { }
+
+  const Geom_traits& geom_traits() const
+  {
+    return m_partition.geom_traits();
+  }
+
+  const Edge_intersection_oracle& intersection_oracle() const
+  {
+    return m_intersection_oracle;
+  }
+
+public:
+  // The following functions are dispatching to the partition_traits' static functions.
+
+  // returns the location of vertex `v`
+  decltype(auto) /*Point_3*/ point(const vertex_descriptor& v) const
+  {
+    return PT::point(v, m_partition);
+  }
+
+  // returns the value of the function at vertex `v`
+  decltype(auto) /*FT*/ value(const vertex_descriptor& v) const
+  {
+    return m_values(v);
+  }
+
+  // returns the value of the function at point `p`
+  decltype(auto) /*FT*/ value(const Point_3& p) const
+  {
+    return m_values(p);
+  }
+
+  // returns the gradient at point `p`
+  decltype(auto) /*Vector_3*/ gradient(const Point_3& p) const
+  {
+    return m_gradients(p);
+  }
+
+  // returns a container with the two vertices incident to the edge `e`
+  decltype(auto) /*Edge_vertices*/ incident_vertices(const edge_descriptor& e) const
+  {
+    return PT::incident_vertices(e, m_partition);
+  }
+
+  // returns a container with all cells incident to the edge `e`
+  decltype(auto) /*Cells_incident_to_edge*/ incident_cells(const edge_descriptor& e) const
+  {
+    return PT::incident_cells(e, m_partition);
+  }
+
+  // returns a container with all vertices of the cell `c`
+  decltype(auto) /*Cell_vertices*/ cell_vertices(const cell_descriptor& c) const
+  {
+    return PT::cell_vertices(c, m_partition);
+  }
+
+  // returns a container with all edges of the cell `c`
+  decltype(auto) /*Cell_edges*/ cell_edges(const cell_descriptor& c) const
+  {
+    return PT::cell_edges(c, m_partition);
+  }
+
+  // iterates over all vertices `v`, calling `f(v)` on each of them
+  template <typename ConcurrencyTag = CGAL::Sequential_tag, typename Functor>
+  void for_each_vertex(Functor& f) const
+  {
+    PT::template for_each_vertex<ConcurrencyTag>(f, m_partition);
+  }
+
+  // iterates over all edges `e`, calling `f(e)` on each of them
+  template <typename ConcurrencyTag = CGAL::Sequential_tag, typename Functor>
+  void for_each_edge(Functor& f) const
+  {
+    PT::template for_each_edge<ConcurrencyTag>(f, m_partition);
+  }
+
+  // iterates over all cells `c`, calling `f(c)` on each of them
+  template <typename ConcurrencyTag = CGAL::Sequential_tag, typename Functor>
+  void for_each_cell(Functor& f) const
+  {
+    PT::template for_each_cell<ConcurrencyTag>(f, m_partition);
+  }
+
+  // finds the intersection of the isosurface with the edge `e` (if any)
+  bool construct_intersection(const Point_3& p_0, const Point_3& p_1,
+                              const FT val_0, const FT val_1,
+                              const FT isovalue,
+                              Point_3& p) const
+  {
+    return m_intersection_oracle(p_0, p_1, val_0, val_1, *this, isovalue, p);
+  }
+};
+
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_ISOSURFACING_DOMAIN_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Octree_domain_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Octree_domain_3.h
new file mode 100644
index 00000000000..f32394dea98
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/Octree_domain_3.h
@@ -0,0 +1,182 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_OCTREE_DOMAIN_3_H
+#define CGAL_ISOSURFACING_3_INTERNAL_OCTREE_DOMAIN_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+#include <CGAL/Isosurfacing_3/internal/Isosurfacing_domain_3.h>
+
+#include <CGAL/Octree.h>
+
+#include <CGAL/tags.h>
+#include <CGAL/Kernel_traits.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+
+// Specialization of the Isosurfacing_domain_3 for Orthtree
+template <typename ValueField,
+          typename GradientField,
+          typename IntersectionOracle>
+class Isosurfacing_domain_3<CGAL::Octree<typename Kernel_traits<typename ValueField::Point_3>::Kernel, std::vector<typename ValueField::Point_3> >, ValueField, GradientField, IntersectionOracle>
+{
+public:
+  using Edge_intersection_oracle = IntersectionOracle;
+
+  using Partition = CGAL::Octree<typename Kernel_traits<typename ValueField::Point_3>::Kernel, std::vector<typename ValueField::Point_3> >;
+
+  using Geom_traits = typename Partition::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using PT = CGAL::Isosurfacing::partition_traits<Partition>;
+
+  using vertex_descriptor = typename PT::vertex_descriptor;
+  using edge_descriptor = typename PT::edge_descriptor;
+  using cell_descriptor = typename PT::cell_descriptor;
+
+  using Edge_vertices = typename PT::Edge_vertices;
+  using Cells_incident_to_edge = typename PT::Cells_incident_to_edge;
+  using Cell_vertices = typename PT::Cell_vertices;
+  using Cell_edges = typename PT::Cell_edges;
+
+  static constexpr Cell_type CELL_TYPE = PT::CELL_TYPE;
+  static constexpr std::size_t VERTICES_PER_CELL = PT::VERTICES_PER_CELL;
+  static constexpr std::size_t EDGES_PER_CELL = PT::EDGES_PER_CELL;
+
+private:
+  const Partition& m_partition;
+  const ValueField& m_values;
+  const GradientField& m_gradients;
+  const IntersectionOracle m_intersection_oracle;
+  mutable std::vector<vertex_descriptor> m_leaf_vertices; // cache variable
+  mutable std::vector<edge_descriptor> m_leaf_edges; // cache variable
+  mutable std::vector<cell_descriptor> m_leaf_cells; // cache variable
+
+public:
+  Isosurfacing_domain_3(const Partition& partition,
+                        const ValueField& values,
+                        const GradientField& gradients,
+                        const IntersectionOracle& intersection_oracle = IntersectionOracle())
+    : m_partition{partition},
+      m_values{values},
+      m_gradients{gradients},
+      m_intersection_oracle{intersection_oracle}
+  { }
+
+  const Geom_traits& geom_traits() const
+  {
+    return m_partition.geom_traits();
+  }
+
+  const Edge_intersection_oracle& intersection_oracle() const
+  {
+    return m_intersection_oracle;
+  }
+
+public:
+  // The following functions are dispatching to the partition_traits' static functions.
+
+  // returns the location of vertex `v`
+  decltype(auto) /*Point_3*/ point(const vertex_descriptor& v) const
+  {
+    return PT::point(v, m_partition);
+  }
+
+  // returns the value of the function at vertex `v`
+  decltype(auto) /*FT*/ value(const vertex_descriptor& v) const
+  {
+    return m_values(v);
+  }
+
+  // returns the value of the function at point `p`
+  decltype(auto) /*FT*/ value(const Point_3& p) const
+  {
+    return m_values(p);
+  }
+
+  // returns the gradient at point `p`
+  decltype(auto) /*Vector_3*/ gradient(const Point_3& p) const
+  {
+    return m_gradients(p);
+  }
+
+  // returns a container with the two vertices incident to the edge `e`
+  decltype(auto) /*Edge_vertices*/ incident_vertices(const edge_descriptor& e) const
+  {
+    return PT::incident_vertices(e, m_partition);
+  }
+
+  // returns a container with all cells incident to the edge `e`
+  decltype(auto) /*Cells_incident_to_edge*/ incident_cells(const edge_descriptor& e) const
+  {
+    return PT::incident_cells(e, m_partition);
+  }
+
+  // returns a container with all vertices of the cell `c`
+  decltype(auto) /*Cell_vertices*/ cell_vertices(const cell_descriptor& c) const
+  {
+    return PT::cell_vertices(c, m_partition);
+  }
+
+  // returns a container with all edges of the cell `c`
+  decltype(auto) /*Cell_edges*/ cell_edges(const cell_descriptor& c) const
+  {
+    return PT::cell_edges(c, m_partition);
+  }
+
+  // iterates over all vertices `v`, calling `f(v)` on each of them
+  template <typename ConcurrencyTag = CGAL::Sequential_tag, typename Functor>
+  void for_each_vertex(Functor& f) const
+  {
+    if (m_leaf_vertices.empty())
+      PT::get_leaves(m_partition, m_leaf_cells, m_leaf_edges, m_leaf_vertices);
+
+    PT::template for_each_vertex<ConcurrencyTag>(f, m_leaf_vertices, m_partition);
+  }
+
+  // iterates over all edges `e`, calling `f(e)` on each of them
+  template <typename ConcurrencyTag = CGAL::Sequential_tag, typename Functor>
+  void for_each_edge(Functor& f) const
+  {
+    if (m_leaf_edges.empty())
+      PT::get_leaves(m_partition, m_leaf_cells, m_leaf_edges, m_leaf_vertices);
+    PT::template for_each_edge<ConcurrencyTag>(f, m_leaf_edges, m_partition);
+  }
+
+  // iterates over all cells `c`, calling `f(c)` on each of them
+  template <typename ConcurrencyTag = CGAL::Sequential_tag, typename Functor>
+  void for_each_cell(Functor& f) const
+  {
+    if (m_leaf_cells.empty())
+      PT::get_leaves(m_partition, m_leaf_cells, m_leaf_edges, m_leaf_vertices);
+    PT::template for_each_cell<ConcurrencyTag>(f, m_leaf_cells, m_partition);
+  }
+
+  // finds the intersection of the isosurface with the edge `e` (if any)
+  bool construct_intersection(const Point_3& p_0, const Point_3& p_1,
+                              const FT val_0, const FT val_1,
+                              const FT isovalue,
+                              Point_3& p) const
+  {
+    return m_intersection_oracle(p_0, p_1, val_0, val_1, *this, isovalue, p);
+  }
+};
+
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_OCTREE_DOMAIN_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/dual_contouring_functors.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/dual_contouring_functors.h
new file mode 100644
index 00000000000..a15703e75a5
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/dual_contouring_functors.h
@@ -0,0 +1,671 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Daniel Zint
+//                 Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_DUAL_CONTOURING_FUNCTORS_H
+#define CGAL_ISOSURFACING_3_INTERNAL_DUAL_CONTOURING_FUNCTORS_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/boost/graph/named_params_helper.h>
+#include <CGAL/Named_function_parameters.h>
+#include <CGAL/Container_helper.h>
+#include <CGAL/Origin.h>
+
+#ifdef CGAL_EIGEN3_ENABLED
+#include <CGAL/Eigen_matrix.h>
+#include <CGAL/Eigen_vector.h>
+
+#include <Eigen/SVD>
+#endif
+
+#ifdef CGAL_LINKED_WITH_TBB
+#if TBB_INTERFACE_VERSION < 12010 && !defined(TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS)
+#define CGAL_HAS_DEFINED_TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
+#define TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS 1
+#endif
+#include <tbb/concurrent_map.h>
+#include <tbb/parallel_for_each.h>
+#endif
+#include <iostream>
+#include <map>
+#include <mutex>
+#include <vector>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+
+template <typename Domain,
+          typename EdgeToPointIDMap,
+          typename PointRange,
+          typename GradientRange>
+bool cell_position_QEM(const typename Domain::cell_descriptor& c,
+                       const Domain& domain,
+                       const bool constrain_to_cell,
+                       const EdgeToPointIDMap& edge_to_point_id,
+                       const PointRange& edge_points,
+                       const GradientRange& edge_gradients,
+                       typename Domain::Geom_traits::Point_3& p)
+{
+  using Geom_traits = typename Domain::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using Eigen_vector_3 = Eigen_vector<FT, 3>;
+  using Eigen_matrix_3 = Eigen_matrix<FT, 3, 3>;
+  using Eigen_vector_x = Eigen_vector<FT>;
+  using Eigen_matrix_x = Eigen_matrix<FT>;
+
+  typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+  typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+  typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+  typename Geom_traits::Construct_point_3 point = domain.geom_traits().construct_point_3_object();
+
+  // compute edge intersections
+  std::vector<Point_3> cell_edge_intersections;
+  std::vector<Vector_3> cell_edge_intersection_normals;
+
+  for(const auto& edge : domain.cell_edges(c))
+  {
+    const auto it = edge_to_point_id.find(edge);
+    if(it == edge_to_point_id.end())
+      continue;
+
+    cell_edge_intersections.push_back(edge_points[it->second]);
+    cell_edge_intersection_normals.push_back(edge_gradients[it->second]);
+  }
+
+  const std::size_t en = cell_edge_intersections.size();
+  if(en == 0)
+    return false;
+
+#ifdef CGAL_ISOSURFACING_3_DC_FUNCTORS_DEBUG
+  std::cout << "Points and normals: " << std::endl;
+  for(std::size_t i=0; i<cell_edge_intersections.size(); ++i)
+  {
+    std::cout << x_coord(cell_edge_intersections[i]) << " "
+              << y_coord(cell_edge_intersections[i]) << " "
+              << z_coord(cell_edge_intersections[i]) << " "
+              << x_coord(cell_edge_intersections[i]) + x_coord(cell_edge_intersection_normals[i]) << " "
+              << y_coord(cell_edge_intersections[i]) + y_coord(cell_edge_intersection_normals[i]) << " "
+              << z_coord(cell_edge_intersections[i]) + z_coord(cell_edge_intersection_normals[i]) << std::endl;
+  }
+#endif
+
+  FT x_min, y_min, z_min, x_max, y_max, z_max;
+  x_min = y_min = z_min =   (std::numeric_limits<double>::max)();
+  x_max = y_max = z_max = - (std::numeric_limits<double>::max)();
+  FT x(0), y(0), z(0);
+
+  if(constrain_to_cell)
+  {
+    typename Domain::Cell_vertices vertices = domain.cell_vertices(c);
+    for(const auto& v : vertices)
+    {
+      const Point_3& cp = domain.point(v);
+      x_min = (std::min<FT>)(x_min, x_coord(cp));
+      y_min = (std::min<FT>)(y_min, y_coord(cp));
+      z_min = (std::min<FT>)(z_min, z_coord(cp));
+
+      x_max = (std::max<FT>)(x_max, x_coord(cp));
+      y_max = (std::max<FT>)(y_max, y_coord(cp));
+      z_max = (std::max<FT>)(z_max, z_coord(cp));
+    }
+  }
+
+  for(const auto& ep : cell_edge_intersections)
+  {
+    x += x_coord(ep);
+    y += y_coord(ep);
+    z += z_coord(ep);
+  }
+
+  Point_3 com = point(x / FT(en), y / FT(en), z / FT(en));
+
+#ifdef CGAL_ISOSURFACING_3_DC_FUNCTORS_DEBUG
+  std::cout << "cell: " << x_min << " " << y_min << " " << z_min << " " << x_max << " " << y_max << " " << z_max << std::endl;
+  std::cout << "COM: " << com << std::endl;
+#endif
+
+  // SVD QEM
+  Eigen_matrix_3 A;
+  A.setZero();
+  Eigen_vector_3 rhs;
+  rhs.setZero();
+  for(std::size_t i=0; i<cell_edge_intersections.size(); ++i)
+  {
+    Eigen_vector_3 n_k;
+    n_k.set(0, x_coord(cell_edge_intersection_normals[i]));
+    n_k.set(1, y_coord(cell_edge_intersection_normals[i]));
+    n_k.set(2, z_coord(cell_edge_intersection_normals[i]));
+
+    Eigen_vector_3 p_k;
+    p_k.set(0, x_coord(cell_edge_intersections[i]));
+    p_k.set(1, y_coord(cell_edge_intersections[i]));
+    p_k.set(2, z_coord(cell_edge_intersections[i]));
+
+    const FT d_k = n_k.transpose() * p_k;
+
+    // have to cast to cast to the underlying Eigen type because the type
+    // of 'n_k * n_k.transpose()' is Eigen::Product< ... > etc.,
+    // so the double conversion is not implicit
+    Eigen_matrix_3 A_k = typename Eigen_matrix_3::EigenType(n_k * n_k.transpose());
+    Eigen_vector_3 b_k;
+    b_k = d_k * n_k;
+    A += A_k;
+    rhs += b_k;
+  }
+
+  Eigen::JacobiSVD<typename Eigen_matrix_x::EigenType> svd(A, Eigen::ComputeThinU | Eigen::ComputeThinV);
+
+  // Ju's paper, "Dual Contouring of Hermite Data": 1e-1
+  // Lindstrom's paper, "Out-of-Core Simplification of Large Polygonal Models": 1e-3
+  svd.setThreshold(1e-3);
+
+  Eigen_vector_3 x_hat;
+  x_hat << x_coord(com), y_coord(com), z_coord(com);
+
+  // Lindstrom formula for QEM new position for singular matrices
+  Eigen_vector_x v_svd;
+  v_svd = x_hat + svd.solve(rhs - A * x_hat);
+
+  if(constrain_to_cell)
+  {
+    // @todo clamping back doesn't necessarily yield the optimal position within the cell
+    v_svd[0] = std::clamp<FT>(v_svd[0], x_min, x_max);
+    v_svd[1] = std::clamp<FT>(v_svd[1], y_min, y_max);
+    v_svd[2] = std::clamp<FT>(v_svd[2], z_min, z_max);
+  }
+
+  p = point(v_svd[0], v_svd[1], v_svd[2]);
+
+#ifdef CGAL_ISOSURFACING_3_DC_FUNCTORS_DEBUG
+  std::cout << "CGAL QEM POINT: " << v_svd[0] << " " << v_svd[1] << " " << v_svd[2] << std::endl;
+  std::cout << "CGAL clamped QEM POINT: " << p[0] << " " << p[1] << " " << p[2] << std::endl;
+  std::cout << "--" << std::endl;
+#endif
+
+  return true;
+}
+
+template <typename Domain,
+          typename EdgeToPointIDMap,
+          typename CellToPointIDMap,
+          typename PolygonRange>
+void generate_face(const typename Domain::edge_descriptor& e,
+                   const Domain& domain,
+                   const typename Domain::Geom_traits::FT isovalue,
+                   const bool do_not_triangulate_faces,
+                   const EdgeToPointIDMap& edge_to_point_id,
+                   const CellToPointIDMap& cell_to_point_id,
+                   std::mutex& mutex,
+                   PolygonRange& polygons)
+{
+  using FT = typename Domain::Geom_traits::FT;
+
+  using cell_descriptor = typename Domain::cell_descriptor;
+
+  const auto& vertices = domain.incident_vertices(e);
+
+  // @todo this check could be avoided for QEM: active edges are in `edge_to_point_id`
+  const FT val_0 = domain.value(vertices[0]);
+  const FT val_1 = domain.value(vertices[1]);
+  if((val_0 <= isovalue) == (val_1 <= isovalue))
+    return;
+
+  std::vector<std::size_t> vertex_ids;
+
+  const auto& icells = domain.incident_cells(e);
+  for(const cell_descriptor& c : icells)
+  {
+    auto it = cell_to_point_id.find(c);
+    if(it == cell_to_point_id.end())
+      continue;
+
+    vertex_ids.push_back(it->second);
+  }
+
+  if(vertex_ids.size() < 3)
+    return;
+
+  if(val_0 > val_1)
+    std::reverse(vertex_ids.begin(), vertex_ids.end());
+
+  // @todo? filter degenerate faces?
+
+  if(do_not_triangulate_faces)
+  {
+    std::lock_guard<std::mutex> lock(mutex);
+    polygons.emplace_back();
+    CGAL::internal::resize(polygons.back(), vertex_ids.size());
+    std::copy(vertex_ids.begin(), vertex_ids.end(), std::begin(polygons.back()));
+  }
+  else
+  {
+    auto it = edge_to_point_id.find(e);
+    if(it == edge_to_point_id.end())
+    {
+      CGAL_assertion(false);
+      return;
+    }
+    const std::size_t ei = it->second;
+
+    std::lock_guard<std::mutex> lock(mutex);
+    for(std::size_t i=0; i<vertex_ids.size(); ++i)
+      polygons.push_back({ei, vertex_ids[i], vertex_ids[(i + 1) % vertex_ids.size()]});
+  }
+}
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+namespace DC_Strategy {
+
+struct QEM {};
+struct Centroid_of_edge_intersections {};
+struct Cell_center {};
+
+} // namespace DC_Strategy
+
+template <typename ConcurrencyTag,
+          typename Domain,
+          typename Dual_contouring_strategy>
+class Dual_contourer;
+
+template <typename ConcurrencyTag,
+          typename Domain>
+class Dual_contourer<ConcurrencyTag, Domain, DC_Strategy::QEM>
+{
+  using Geom_traits = typename Domain::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using vertex_descriptor = typename Domain::vertex_descriptor;
+  using edge_descriptor = typename Domain::edge_descriptor;
+  using cell_descriptor = typename Domain::cell_descriptor;
+
+  std::mutex m_mutex;
+
+public:
+  template<typename PointRange, typename PolygonRange, typename NamedParameters>
+  void operator()(const Domain& domain,
+                  const FT isovalue,
+                  PointRange& points,
+                  PolygonRange& polygons,
+                  const NamedParameters& np = parameters::default_values())
+  {
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
+    // Otherwise the `edge_to_point_id` map might be messed up
+    CGAL_precondition(points.empty());
+    CGAL_precondition(polygons.empty());
+
+    const bool constrain_to_cell = choose_parameter(get_parameter(np, internal_np::constrain_to_cell), false);
+
+    const bool do_not_triangulate_faces =
+      choose_parameter(get_parameter(np, internal_np::do_not_triangulate_faces), false);
+
+    using Edge_to_point_ID_map = std::unordered_map<edge_descriptor, std::size_t>;
+    using Cell_to_point_ID_map = std::unordered_map<cell_descriptor, std::size_t>;
+
+    Edge_to_point_ID_map edge_to_point_id;
+    Cell_to_point_ID_map cell_to_point_id;
+
+    std::vector<Point_3> edge_points;
+    std::vector<Vector_3> edge_gradients;
+
+    // ---------------------------------------------------------------------------------------------
+    // construct the intersection of the surface at active edges
+    auto edge_positioner = [&](const edge_descriptor& e)
+    {
+      const auto& evs = domain.incident_vertices(e);
+      const vertex_descriptor& v0 = evs[0];
+      const vertex_descriptor& v1 = evs[1];
+      const Point_3& p0 = domain.point(v0);
+      const Point_3& p1 = domain.point(v1);
+      const FT val0 = domain.value(v0);
+      const FT val1 = domain.value(v1);
+
+      Point_3 p;
+      bool res = domain.construct_intersection(p0, p1, val0, val1, isovalue, p);
+      if(!res)
+        return;
+
+      const Vector_3 g = domain.gradient(p);
+
+      std::lock_guard<std::mutex> lock(m_mutex);
+      edge_to_point_id[e] = edge_points.size();
+      edge_points.push_back(p);
+      edge_gradients.push_back(g);
+    };
+    domain.template for_each_edge<ConcurrencyTag>(edge_positioner);
+
+#ifdef CGAL_ISOSURFACING_3_DC_FUNCTORS_DEBUG
+    typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+
+    std::ofstream out_active_edges("active_edges.polylines.cgal");
+    for(const auto& ei : edge_to_point_id)
+    {
+      const edge_descriptor& e = ei.first;
+      const auto& evs = domain.incident_vertices(e);
+      const vertex_descriptor& v0 = evs[0];
+      const vertex_descriptor& v1 = evs[1];
+      const Point_3& p0 = domain.point(v0);
+      const Point_3& p1 = domain.point(v1);
+
+      out_active_edges << "2 " << x_coord(p0) << " " << y_coord(p0) << " " << z_coord(p0) << " " << x_coord(p1) << " " << y_coord(p1) << " " << z_coord(p1) << std::endl;
+    }
+
+    std::ofstream out_edge_intersections("edge_intersections.polylines.cgal");
+    for(const auto& ei : edge_to_point_id)
+    {
+      const Point_3& p = edge_points.at(ei.second);
+      const Vector_3& g = edge_gradients.at(ei.second);
+
+      out_edge_intersections << "2 " << x_coord(p) << " " << y_coord(p) << " " << z_coord(p) << " " << x_coord(p) + x_coord(g) << " " << y_coord(p) + y_coord(g) << " " << z_coord(p) + z_coord(g) << std::endl;
+    }
+#endif
+
+    if(!do_not_triangulate_faces)
+      points.insert(points.end(), edge_points.begin(), edge_points.end());
+
+    // ---------------------------------------------------------------------------------------------
+    // create a vertex for each cell that has at least one active edge
+    auto cell_positioner = [&](const cell_descriptor& c)
+    {
+      Point_3 p;
+      if(cell_position_QEM(c, domain, constrain_to_cell, edge_to_point_id,
+                           edge_points, edge_gradients, p))
+      {
+        std::lock_guard<std::mutex> lock(m_mutex); // @todo useless if sequential
+        cell_to_point_id[c] = points.size();
+        points.push_back(p);
+
+#ifdef CGAL_ISOSURFACING_3_DC_FUNCTORS_DEBUG
+        static std::ofstream os("dual_to_sources.polylines.cgal");
+        for(const auto& edge : domain.cell_edges(c))
+        {
+          const auto it = edge_to_point_id.find(edge);
+          if(it == edge_to_point_id.end())
+            continue;
+          os << "2 " << edge_points.at(it->second) << " " << p << "\n";
+        }
+#endif
+      }
+    };
+    domain.template for_each_cell<ConcurrencyTag>(cell_positioner);
+
+    // ---------------------------------------------------------------------------------------------
+    // connect vertices around edges to form faces
+    auto face_generator = [&](const edge_descriptor& e)
+    {
+      generate_face(e, domain, isovalue, do_not_triangulate_faces,
+                    edge_to_point_id, cell_to_point_id, m_mutex, polygons);
+    };
+    domain.template for_each_edge<ConcurrencyTag>(face_generator);
+
+#ifdef CGAL_ISOSURFACING_3_DC_FUNCTORS_DEBUG
+    std::cout << points.size() << " points" << std::endl;
+    std::cout << polygons.size() << " polygons" << std::endl;
+#endif
+  }
+};
+
+template <typename ConcurrencyTag,
+          typename Domain>
+class Dual_contourer<ConcurrencyTag, Domain, DC_Strategy::Centroid_of_edge_intersections>
+{
+  using Geom_traits = typename Domain::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using vertex_descriptor = typename Domain::vertex_descriptor;
+  using edge_descriptor = typename Domain::edge_descriptor;
+  using cell_descriptor = typename Domain::cell_descriptor;
+
+  std::mutex m_mutex;
+
+public:
+  template<typename PointRange, typename PolygonRange, typename NamedParameters>
+  void operator()(const Domain& domain,
+                  const typename Geom_traits::FT isovalue,
+                  PointRange& points,
+                  PolygonRange& polygons,
+                  const NamedParameters& np = parameters::default_values())
+  {
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
+    // Otherwise the `edge_to_point_id` map might be messed up
+    CGAL_precondition(points.empty());
+    CGAL_precondition(polygons.empty());
+
+    bool do_not_triangulate_faces =
+      choose_parameter(get_parameter(np, internal_np::do_not_triangulate_faces), false);
+
+    using Edge_to_point_ID_map = std::unordered_map<edge_descriptor, std::size_t>;
+    using Cell_to_point_ID_map = std::unordered_map<cell_descriptor, std::size_t>;
+
+    Edge_to_point_ID_map edge_to_point_id;
+    Cell_to_point_ID_map cell_to_point_id;
+
+    std::vector<Point_3> edge_points;
+
+    // ---------------------------------------------------------------------------------------------
+    auto edge_positioner = [&](const edge_descriptor& e)
+    {
+      const auto& evs = domain.incident_vertices(e);
+      const vertex_descriptor& v0 = evs[0];
+      const vertex_descriptor& v1 = evs[1];
+      const Point_3& p0 = domain.point(v0);
+      const Point_3& p1 = domain.point(v1);
+      const FT val0 = domain.value(v0);
+      const FT val1 = domain.value(v1);
+
+      Point_3 p;
+      bool res = domain.construct_intersection(p0, p1, val0, val1, isovalue, p);
+      if(!res)
+        return;
+
+      std::lock_guard<std::mutex> lock(m_mutex);
+      edge_to_point_id[e] = edge_points.size();
+      edge_points.push_back(p);
+    };
+    domain.template for_each_edge<ConcurrencyTag>(edge_positioner);
+
+    if(!do_not_triangulate_faces)
+      points.insert(points.end(), edge_points.begin(), edge_points.end());
+
+    // ---------------------------------------------------------------------------------------------
+    auto cell_positioner = [&](const cell_descriptor& c)
+    {
+      typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+      typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+      typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+      typename Geom_traits::Construct_point_3 point = domain.geom_traits().construct_point_3_object();
+
+      // compute edge intersections
+      std::vector<Point_3> edge_intersections;
+      for(const edge_descriptor& e : domain.cell_edges(c))
+      {
+        const auto it = edge_to_point_id.find(e);
+        if(it == edge_to_point_id.end())
+          continue;
+
+        edge_intersections.push_back(edge_points[it->second]); // @todo could avoid copying
+      }
+
+      const std::size_t en = edge_intersections.size();
+      if(en == 0)
+        return;
+
+      FT x = 0, y = 0, z = 0;
+      for(const Point_3& p : edge_intersections)
+      {
+        x += x_coord(p);
+        y += y_coord(p);
+        z += z_coord(p);
+      }
+
+      const Point_3 p = point(x / FT(en), y / FT(en), z / FT(en));
+
+      std::lock_guard<std::mutex> lock(m_mutex);
+      cell_to_point_id[c] = points.size();
+      points.push_back(p);
+    };
+    domain.template for_each_cell<ConcurrencyTag>(cell_positioner);
+
+    // ---------------------------------------------------------------------------------------------
+    auto face_generator = [&](const edge_descriptor& e)
+    {
+      generate_face(e, domain, isovalue, do_not_triangulate_faces,
+                    edge_to_point_id, cell_to_point_id, m_mutex, polygons);
+    };
+    domain.template for_each_edge<ConcurrencyTag>(face_generator);
+  }
+};
+
+template <typename ConcurrencyTag,
+          typename Domain>
+class Dual_contourer<ConcurrencyTag, Domain, DC_Strategy::Cell_center>
+{
+  using Geom_traits = typename Domain::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using vertex_descriptor = typename Domain::vertex_descriptor;
+  using edge_descriptor = typename Domain::edge_descriptor;
+  using cell_descriptor = typename Domain::cell_descriptor;
+
+  std::mutex m_mutex;
+
+public:
+  template<typename PointRange, typename PolygonRange, typename NamedParameters>
+  void operator()(const Domain& domain,
+                  const FT isovalue,
+                  PointRange& points,
+                  PolygonRange& polygons,
+                  const NamedParameters& np = parameters::default_values())
+  {
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
+    // Otherwise the `edge_to_point_id` map might be messed up
+    CGAL_precondition(points.empty());
+    CGAL_precondition(polygons.empty());
+
+    bool do_not_triangulate_faces =
+      choose_parameter(get_parameter(np, internal_np::do_not_triangulate_faces), false);
+
+    using Edge_to_point_ID_map = std::unordered_map<edge_descriptor, std::size_t>;
+    using Cell_to_point_ID_map = std::unordered_map<cell_descriptor, std::size_t>;
+
+    Edge_to_point_ID_map edge_to_point_id;
+    Cell_to_point_ID_map cell_to_point_id;
+
+    std::vector<Point_3> edge_points;
+
+    // ---------------------------------------------------------------------------------------------
+    auto edge_positioner = [&](const edge_descriptor& e)
+    {
+      typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+      typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+      typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+      typename Geom_traits::Construct_point_3 point = domain.geom_traits().construct_point_3_object();
+
+      const auto& evs = domain.incident_vertices(e);
+      const vertex_descriptor& v0 = evs[0];
+      const vertex_descriptor& v1 = evs[1];
+
+      const FT val_0 = domain.value(v0);
+      const FT val_1 = domain.value(v1);
+      if((val_0 <= isovalue) == (val_1 <= isovalue))
+        return;
+
+      Point_3 p = point((x_coord(domain.point(v0)) + x_coord(domain.point(v1))) / FT(2),
+                        (y_coord(domain.point(v0)) + y_coord(domain.point(v1))) / FT(2),
+                        (z_coord(domain.point(v0)) + z_coord(domain.point(v1))) / FT(2));
+
+      std::lock_guard<std::mutex> lock(m_mutex);
+      edge_to_point_id[e] = edge_points.size();
+      edge_points.push_back(p);
+    };
+    domain.template for_each_edge<ConcurrencyTag>(edge_positioner);
+
+    if(!do_not_triangulate_faces)
+      points.insert(points.end(), edge_points.begin(), edge_points.end());
+
+    // ---------------------------------------------------------------------------------------------
+    auto cell_positioner = [&](const cell_descriptor& c)
+    {
+      typename Geom_traits::Compute_x_3 x_coord = domain.geom_traits().compute_x_3_object();
+      typename Geom_traits::Compute_y_3 y_coord = domain.geom_traits().compute_y_3_object();
+      typename Geom_traits::Compute_z_3 z_coord = domain.geom_traits().compute_z_3_object();
+      typename Geom_traits::Construct_point_3 point = domain.geom_traits().construct_point_3_object();
+
+      typename Domain::Cell_vertices vertices = domain.cell_vertices(c);
+      const std::size_t cn = vertices.size();
+
+      bool all_smaller = true;
+      bool all_greater = true;
+      for(const auto& v : vertices)
+      {
+        const bool b = (domain.value(v) <= isovalue);
+        all_smaller = all_smaller && b;
+        all_greater = all_greater && !b;
+      }
+
+      if(all_smaller || all_greater)
+        return;
+
+      FT x(0), y(0), z(0);
+      for(const auto& v : vertices)
+      {
+        const Point_3& cp = domain.point(v);
+        x += x_coord(cp);
+        y += y_coord(cp);
+        z += z_coord(cp);
+      }
+
+      // set point to cell center
+      Point_3 p = point(x / cn, y / cn, z / cn);
+
+      std::lock_guard<std::mutex> lock(m_mutex);
+      cell_to_point_id[c] = points.size();
+      points.push_back(p);
+    };
+    domain.template for_each_cell<ConcurrencyTag>(cell_positioner);
+
+    // ---------------------------------------------------------------------------------------------
+    auto face_generator = [&](const edge_descriptor& e)
+    {
+      generate_face(e, domain, isovalue, do_not_triangulate_faces,
+                    edge_to_point_id, cell_to_point_id, m_mutex, polygons);
+    };
+    domain.template for_each_edge<ConcurrencyTag>(face_generator);
+  }
+};
+
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_DUAL_CONTOURING_FUNCTORS_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h
new file mode 100644
index 00000000000..83d2276b0f7
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h
@@ -0,0 +1,164 @@
+// Copyright (c) 2024 INRIA Sophia-Antipolis (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+//  This file is only used by the testsuite and examples
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_IMPLICIT_SHAPES_HELPER_H
+#define CGAL_ISOSURFACING_3_INTERNAL_IMPLICIT_SHAPES_HELPER_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Simple_cartesian.h>  // quiet the CI in case this file gets compiled alone
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace Shapes {
+
+// Shapes are defined at isovalue 0
+
+// c is the center
+// r the radius
+template<typename K>
+typename K::FT
+sphere(const typename K::Point_3& c,
+       const typename K::FT r,
+       const typename K::Point_3& q)
+{
+  return CGAL::approximate_sqrt(CGAL::squared_distance(c, q)) - r;
+}
+
+template <typename K>
+typename K::FT
+box(const typename K::Point_3& b,
+    const typename K::Point_3& t,
+    const typename K::Point_3& q)
+{
+  typename K::Point_3 c = CGAL::midpoint(b, t);
+  typename K::Iso_cuboid_3 ic(b, t);
+  bool inside = ic.has_on_bounded_side(q);
+  typename K::FT d = 0;
+  if(inside)
+  {
+    d = (std::min)({CGAL::abs(q.x() - b.x()), CGAL::abs(q.x() - t.x()),
+                    CGAL::abs(q.y() - b.y()), CGAL::abs(q.y() - t.y()),
+                    CGAL::abs(q.z() - b.z()), CGAL::abs(q.z() - t.z())});
+  }
+  else
+  {
+    for(int i=0; i<3; ++i)
+      d += (CGAL::abs(q[i] - c[i]) > (c[i] - b[i]) ? CGAL::square(q[i] - c[i]) : 0);
+    d = CGAL::approximate_sqrt(d);
+  }
+
+  return inside ? - d : d;
+}
+
+// p is the center of the base disk
+// q is the center of the top disk
+template<typename K>
+typename K::FT
+infinite_cylinder(const typename K::Point_3& b,
+                  const typename K::Vector_3& n,
+                  const typename K::FT r,
+                  const typename K::Point_3& q)
+{
+  typename K::Plane_3 pl(b, n);
+  typename K::Point_3 pq = pl.projection(q);
+  return CGAL::approximate_sqrt(CGAL::squared_distance(pq, b)) - r;
+}
+
+// c is the center of the torus
+// n is the normal of the plane containing all centers of the tube
+// r is the small radius
+// R is the large radius
+template<typename K>
+typename K::FT
+torus(const typename K::Point_3& c,
+      const typename K::Vector_3& n,
+      const typename K::FT r,
+      const typename K::FT R,
+      const typename K::Point_3& q)
+{
+  typename K::Vector_3 w (c, q);
+  typename K::Plane_3 pl(c, n);
+  typename K::Point_3 pq = pl.projection(q);
+  typename K::FT d = CGAL::approximate_sqrt(CGAL::squared_distance(pq, c)) - R;
+  typename K::FT h = CGAL::abs(CGAL::scalar_product(w, n));
+
+  return CGAL::approximate_sqrt(CGAL::square(d) + CGAL::square(h)) - r;
+}
+
+template<typename K>
+typename K::FT
+torus_ridge(const typename K::Point_3& c,
+            const typename K::Vector_3& n,
+            const typename K::FT r,
+            const typename K::FT R,
+            const typename K::Point_3& q)
+{
+  typename K::Vector_3 w (c, q);
+  typename K::Plane_3 pl(c, n);
+  typename K::Point_3 pq = pl.projection(q);
+  typename K::FT d = CGAL::abs(CGAL::approximate_sqrt(CGAL::squared_distance(pq, c)) - R) - r;
+  return d + CGAL::squared_distance(q, pl);
+}
+
+template<typename K>
+typename K::FT
+inverted_torus(const typename K::Point_3& c,
+               const typename K::Vector_3& n,
+               const typename K::FT r,
+               const typename K::FT R,
+               const typename K::Point_3& q)
+{
+  typename K::Vector_3 w (c, q);
+  typename K::Plane_3 pl(c, n);
+  typename K::Point_3 pq = pl.projection(q);
+  typename K::FT d = CGAL::abs(CGAL::approximate_sqrt(CGAL::squared_distance(pq, c)) - R) - r;
+  return d - CGAL::squared_distance(q, pl);
+}
+
+/////////////////////////////////////////////////////////////////
+
+template <typename K, typename S1, typename S2>
+typename K::FT
+shape_union(const S1& s1, const S2& s2, const typename K::Point_3& q)
+{
+  return (std::min)(s1(q), s2(q));
+}
+
+template <typename K, typename S1, typename S2>
+typename K::FT
+shape_difference(const S1& s1, const S2& s2, const typename K::Point_3& q)
+{
+  return (std::max)(s1(q), -s2(q));
+}
+
+template <typename K, typename S1, typename S2>
+typename K::FT
+shape_intersection(const S1& s1, const S2& s2, const typename K::Point_3& q)
+{
+  return (std::max)(s1(q), s2(q));
+}
+
+template <typename K, typename S1, typename S2>
+typename K::FT
+shape_symmetric_difference(const S1& s1, const S2& s2, const typename K::Point_3& q)
+{
+  return (std::max)(-(std::min)(s1(q), s2(q)), (std::max)(s1(q), s2(q)));
+}
+
+
+} // namespace Shapes
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_IMPLICIT_SHAPES_HELPER_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/marching_cubes_functors.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/marching_cubes_functors.h
new file mode 100644
index 00000000000..448fbee6a34
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/marching_cubes_functors.h
@@ -0,0 +1,334 @@
+// Copyright (c) 2020 INRIA Sophia-Antipolis (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: ( GPL-3.0-or-later OR LicenseRef-Commercial ) AND MIT
+//
+// Author(s)     : Julian Stahl
+//
+// This file incorporates work covered by the following copyright and permission notice:
+//
+//     MIT License
+//
+//     Copyright (c) 2020 Roberto Grosso
+//
+//     Permission is hereby granted, free of charge, to any person obtaining a copy
+//     of this software and associated documentation files (the "Software"), to deal
+//     in the Software without restriction, including without limitation the rights
+//     to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//     copies of the Software, and to permit persons to whom the Software is
+//     furnished to do so, subject to the following conditions:
+//
+//     The above copyright notice and this permission notice shall be included in all
+//     copies or substantial portions of the Software.
+//
+//     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//     IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//     FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//     AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//     OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//     SOFTWARE.
+//
+//
+// The code below uses the version of
+// https://github.com/rogrosso/tmc available on 15th of September 2022.
+//
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_MARCHING_CUBES_FUNCTORS_H
+#define CGAL_ISOSURFACING_3_INTERNAL_MARCHING_CUBES_FUNCTORS_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/tables.h>
+
+#include <CGAL/assertions.h>
+#include <CGAL/Container_helper.h>
+
+#ifdef CGAL_LINKED_WITH_TBB
+#include <tbb/enumerable_thread_specific.h>
+#else
+#include <vector>
+#endif
+
+#include <array>
+#include <bitset>
+#include <unordered_map>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+
+// Interpolate linearly between two vertex locations v0, v1 with values d0 and d1 according to the isovalue
+template <typename GeomTraits>
+std::pair<typename GeomTraits::Point_3, typename GeomTraits::FT>
+vertex_interpolation(const typename GeomTraits::Point_3& p0,
+                     const typename GeomTraits::Point_3& p1,
+                     const typename GeomTraits::FT d0,
+                     const typename GeomTraits::FT d1,
+                     const typename GeomTraits::FT isovalue,
+                     const GeomTraits& gt)
+{
+  using FT = typename GeomTraits::FT;
+
+  typename GeomTraits::Compute_x_3 x_coord = gt.compute_x_3_object();
+  typename GeomTraits::Compute_y_3 y_coord = gt.compute_y_3_object();
+  typename GeomTraits::Compute_z_3 z_coord = gt.compute_z_3_object();
+  typename GeomTraits::Construct_point_3 point = gt.construct_point_3_object();
+
+  // @todo, technically we should be using the edge intersection oracle here, but there is a nuance
+  // between MC and DC on the handling of edges that have val0 = val1 = isovalue: in MC we assume
+  // the isosurface is in the middle, in DC we assume the isosurface is not intersecting the edge.
+  // In the oracle, we follow DC right now. Could put a Boolean parameter, but it's ugly.
+
+  const FT den = d1 - d0;
+  FT mu = is_zero(den) ? FT(1) / FT(2) : (isovalue - d0) / den;
+  mu = std::clamp<FT>(mu, FT(0), FT(1));
+
+  // linear interpolation
+  return { point((FT(1) - mu) * x_coord(p0) +  mu * x_coord(p1),
+                 (FT(1) - mu) * y_coord(p0) +  mu * y_coord(p1),
+                 (FT(1) - mu) * z_coord(p0) +  mu * z_coord(p1)), mu };
+}
+
+// retrieves the values of a cell and return the lookup index
+// if the cell is completely above or below the isovalue, corner points are not computed
+template <typename Domain,
+          typename Corners,
+          typename Values>
+std::size_t get_cell_corners(const Domain& domain,
+                             const typename Domain::cell_descriptor& cell,
+                             const typename Domain::Geom_traits::FT isovalue,
+                             Corners& corners,
+                             Values& values,
+                             bool isovalue_nudging)
+{
+  using vertex_descriptor = typename Domain::vertex_descriptor;
+
+  const auto& vertices = domain.cell_vertices(cell);
+
+  // collect function values and build index
+  std::size_t v_id = 0;
+  std::bitset<Domain::VERTICES_PER_CELL> index = 0;
+  static_assert(Domain::VERTICES_PER_CELL == 8);
+
+  for(const vertex_descriptor& v : vertices)
+  {
+    auto val = domain.value(v);
+
+    // Avoiding singular cases.
+    if (isovalue_nudging && abs(val - isovalue) < 0.00000001)
+        val = isovalue - 0.00000001;
+
+    values[v_id] = val;
+    if(values[v_id] >= isovalue)
+      index.set(v_id);
+
+    ++v_id;
+  }
+
+  if(index.all() || index.none()) // nothing is happening in this cell
+    return static_cast<std::size_t>(index.to_ullong());
+
+  v_id = 0;
+  for(const vertex_descriptor& v : vertices)
+    corners[v_id++] = domain.point(v);
+
+  return static_cast<std::size_t>(index.to_ullong());
+}
+
+// creates the vertices on the edges of one cell
+template <typename Corners,
+          typename Values,
+          typename Domain,
+          typename Vertices>
+void MC_construct_vertices(const typename Domain::cell_descriptor& cell,
+                           const std::size_t i_case,
+                           const Corners& corners,
+                           const Values& values,
+                           const typename Domain::Geom_traits::FT isovalue,
+                           const Domain& domain,
+                           Vertices& vertices)
+{
+  using Cell_edges = typename Domain::Cell_edges;
+  using edge_descriptor = typename Domain::edge_descriptor;
+
+  const Cell_edges& cell_edges = domain.cell_edges(cell);
+
+  // compute for this case the vertices
+  std::size_t flag = 1;
+  std::size_t e_id = 0;
+
+  for(const edge_descriptor& e : cell_edges)
+  {
+    CGAL_USE(e);
+
+    if(flag & Cube_table::intersected_edges[i_case])
+    {
+      // generate vertex here, do not care at this point if vertex already exists
+      const int v0 = Cube_table::edge_to_vertex[e_id][0];
+      const int v1 = Cube_table::edge_to_vertex[e_id][1];
+
+      vertices[e_id] = vertex_interpolation(corners[v0], corners[v1],
+                                            values[v0], values[v1],
+                                            isovalue, domain.geom_traits()).first;
+    }
+
+    flag <<= 1;
+    ++e_id;
+  }
+}
+
+// connects the vertices of one cell to form triangles
+template <typename Vertices,
+          typename TriangleList>
+void MC_construct_triangles(const std::size_t i_case,
+                            const Vertices& vertices,
+                            TriangleList& triangles)
+{
+  // construct triangles
+  for(int t=0; t<16; t+=3)
+  {
+    const std::size_t t_index = i_case * 16 + t;
+
+    // if(e_tris_list[t_index] == 0x7f)
+    if(Cube_table::triangle_cases[t_index] == -1)
+      break;
+
+    const int eg0 = Cube_table::triangle_cases[t_index + 0];
+    const int eg1 = Cube_table::triangle_cases[t_index + 1];
+    const int eg2 = Cube_table::triangle_cases[t_index + 2];
+
+    // insert new triangle in list
+#ifdef CGAL_LINKED_WITH_TBB
+    auto& tris = triangles.local();
+#else
+    auto& tris = triangles;
+#endif
+
+    tris.push_back({vertices[eg0], vertices[eg1], vertices[eg2]});
+  }
+}
+
+template <typename TriangleRange,
+          typename PointRange,
+          typename PolygonRange>
+void triangles_to_polygon_soup(const TriangleRange& triangles,
+                               PointRange& points,
+                               PolygonRange& polygons)
+{
+  using Point = typename PointRange::value_type;
+  using PointIndexMap = std::unordered_map<Point, std::size_t>;
+
+  PointIndexMap point_index_map;
+  std::size_t current_index = 0;
+
+#ifdef CGAL_LINKED_WITH_TBB
+  for(const auto& triangle_list : triangles)
+  {
+#else
+    const auto& triangle_list = triangles;
+#endif
+
+    for(const auto& triangle : triangle_list)
+    {
+      auto& polygon = polygons.emplace_back();
+      CGAL::internal::resize(polygon, 3);
+
+      for (int i=2; i>=0; --i)
+      {
+        const Point& p = triangle[i];
+
+        auto [it, inserted] = point_index_map.emplace(p, current_index);
+        if(inserted)
+        {
+          points.push_back(p);
+          ++current_index;
+        }
+        polygon[i] = it->second;
+      }
+    }
+
+#ifdef CGAL_LINKED_WITH_TBB
+  }
+#endif
+}
+
+// Marching Cubes implemented as a functor that runs on every cell of the grid
+template <typename Domain_>
+class Marching_cubes_3
+{
+public:
+  using Domain = Domain_;
+
+  using Geom_traits = typename Domain::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+
+  using cell_descriptor = typename Domain::cell_descriptor;
+
+#ifdef CGAL_LINKED_WITH_TBB
+  using Triangles = tbb::enumerable_thread_specific<std::vector<std::array<Point_3, 3>>>;
+#else
+  using Triangles = std::vector<std::array<Point_3, 3> >;
+#endif
+
+private:
+  const Domain& m_domain;
+  const FT m_isovalue;
+  const bool m_isovalue_nudging;
+
+  Triangles m_triangles;
+
+public:
+  // creates a Marching Cubes functor for a domain and isovalue
+  Marching_cubes_3(const Domain& domain,
+                   const FT isovalue,
+                   const bool isovalue_nudging = true)
+    : m_domain(domain),
+      m_isovalue(isovalue),
+      m_isovalue_nudging(isovalue_nudging)
+  { }
+
+  // returns the created triangle list
+  Triangles& triangles()
+  {
+    return m_triangles;
+  }
+
+public:
+  // computes one cell
+  void operator()(const cell_descriptor& cell)
+  {
+    CGAL_precondition(m_domain.cell_vertices(cell).size() == 8);
+    CGAL_precondition(m_domain.cell_edges(cell).size() == 12);
+
+    // @speed for SDFs, we could query at the center of the voxel an early exit
+
+    constexpr std::size_t vpc = Domain::VERTICES_PER_CELL;
+
+    std::array<FT, vpc> values;
+    std::array<Point_3, vpc> corners;
+    const std::size_t i_case = get_cell_corners(m_domain, cell, m_isovalue, corners, values, m_isovalue_nudging);
+
+    // skip empty / full cells
+    constexpr std::size_t ones = (1 << vpc) - 1;
+    if((i_case & ones) == ones || // all bits set
+       (i_case & ones) == 0) // no bits set
+      return;
+
+    std::array<Point_3, 12> vertices;
+    MC_construct_vertices(cell, i_case, corners, values, m_isovalue, m_domain, vertices);
+
+    MC_construct_triangles(i_case, vertices, m_triangles);
+  }
+};
+
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_MARCHING_CUBES_FUNCTORS_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits.h
new file mode 100644
index 00000000000..baff7a8e583
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits.h
@@ -0,0 +1,26 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_H
+#define CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+template <typename Partition>
+struct partition_traits;
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits_Cartesian_grid.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits_Cartesian_grid.h
new file mode 100644
index 00000000000..1b4bcf5be2d
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits_Cartesian_grid.h
@@ -0,0 +1,302 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_CARTESIAN_GRID_3_H
+#define CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_CARTESIAN_GRID_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/internal/Cell_type.h>
+#include <CGAL/Isosurfacing_3/internal/tables.h>
+
+#include <CGAL/tags.h>
+
+#ifdef CGAL_LINKED_WITH_TBB
+#include <tbb/parallel_for.h>
+#include <tbb/blocked_range3d.h>
+#endif // CGAL_LINKED_WITH_TBB
+
+#include <boost/functional/hash.hpp>
+
+#include <array>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+template <typename GeomTraits, typename MemoryPolicy>
+class Cartesian_grid_3;
+
+template <typename Partition>
+struct partition_traits;
+
+struct CG_Edge_descriptor : public std::array<std::size_t, 4> { };
+struct CG_Cell_descriptor : public std::array<std::size_t, 3> { };
+
+template <typename GeomTraits, typename MemoryPolicy>
+struct partition_traits<Cartesian_grid_3<GeomTraits, MemoryPolicy> >
+{
+  using Grid = Cartesian_grid_3<GeomTraits, MemoryPolicy>;
+
+  // identifies a vertex by its (i, j, k) indices
+  using vertex_descriptor = std::array<std::size_t, 3>;
+
+  // identifies an edge by its starting vertex (i, j, k) and the direction x -> 0, y -> 1, z -> 2
+  using edge_descriptor = CG_Edge_descriptor;
+
+  // identifies a cell by its corner vertex with the smallest (i, j, k) index
+  using cell_descriptor = CG_Cell_descriptor;
+
+  static constexpr Cell_type CELL_TYPE = CUBICAL_CELL;
+  static constexpr std::size_t VERTICES_PER_CELL = 8;
+  static constexpr std::size_t EDGES_PER_CELL = 12;
+
+  using Edge_vertices = std::array<vertex_descriptor, 2>;
+  using Cells_incident_to_edge = std::array<cell_descriptor, 4>;
+  using Cell_vertices = std::array<vertex_descriptor, VERTICES_PER_CELL>;
+  using Cell_edges = std::array<edge_descriptor, EDGES_PER_CELL>;
+
+  static decltype(auto) /*Point_3*/ point(const vertex_descriptor& v,
+                                          const Grid& g)
+  {
+    return g.point(v[0], v[1], v[2]);
+  }
+
+  // returns a container with the two vertices incident to edge e
+  static Edge_vertices incident_vertices(const edge_descriptor& e,
+                                         const Grid&)
+  {
+    Edge_vertices ev;
+    ev[0] = { e[0], e[1], e[2] };  // start vertex
+    ev[1] = { e[0], e[1], e[2] };  // end vertex
+    ev[1][e[3]] += 1;              // one position further in the direction of the edge
+    return ev;
+  }
+
+  // returns a container with all cells incident to edge e
+  static Cells_incident_to_edge incident_cells(const edge_descriptor& e,
+                                               const Grid&)
+  {
+    // lookup the neighbor cells relative to the edge
+    const int local = internal::Cube_table::edge_store_index[e[3]];
+    auto neighbors = internal::Cube_table::edge_to_voxel_neighbor[local];
+
+    Cells_incident_to_edge cite;
+    for(std::size_t i=0; i<cite.size(); ++i) {
+      for(std::size_t j=0; j<cite[i].size(); ++j)
+      {
+        // offset the relative indices by the edge position
+        cite[i][j] = e[j] + neighbors[i][j];
+      }
+    }
+
+    return cite;
+  }
+
+  // returns a container with all vertices of cell c
+  static Cell_vertices cell_vertices(const cell_descriptor& c,
+                                     const Grid&)
+  {
+    Cell_vertices cv;
+    for(std::size_t i=0; i<cv.size(); ++i) {
+      for(std::size_t j=0; j<c.size(); ++j)
+      {
+        // lookup the relative vertex indices and offset them by the cell position
+        cv[i][j] = c[j] + internal::Cube_table::local_vertex_location[i][j];
+      }
+    }
+
+    return cv;
+  }
+
+  // returns a container with all edges of cell c
+  static Cell_edges cell_edges(const cell_descriptor& c,
+                               const Grid&)
+  {
+    Cell_edges ce;
+    for(std::size_t i=0; i<ce.size(); ++i) {
+      for(std::size_t j=0; j<c.size(); ++j)
+      {
+        // lookup the relative edge indices and offset them by the cell position
+        ce[i][j] = c[j] + internal::Cube_table::global_edge_id[i][j];
+      }
+
+      // set the direction of the edge
+      ce[i][3] = internal::Cube_table::global_edge_id[i][3];
+    }
+
+    return ce;
+  }
+
+
+  // iterates sequentially over all vertices v calling f(v) on every one
+  template <typename Functor>
+  static void for_each_vertex(Functor& f,
+                              const Grid& g,
+                              const CGAL::Sequential_tag)
+  {
+    for(std::size_t i=0; i<g.xdim(); ++i)
+      for(std::size_t j=0; j<g.ydim(); ++j)
+        for(std::size_t k=0; k<g.zdim(); ++k)
+          f({i, j, k});
+  }
+
+  // iterates sequentially over all edges e calling f(e) on every one
+  template <typename Functor>
+  static void for_each_edge(Functor& f,
+                            const Grid& g,
+                            const CGAL::Sequential_tag)
+  {
+    for(std::size_t i=0; i<g.xdim()-1; ++i) {
+      for(std::size_t j=0; j<g.ydim()-1; ++j) {
+        for(std::size_t k=0; k<g.zdim()-1; ++k)
+        {
+          // all three edges starting at vertex (i, j, k)
+          f({{i, j, k, 0}});
+          f({{i, j, k, 1}});
+          f({{i, j, k, 2}});
+        }
+      }
+    }
+  }
+
+  // iterates sequentially over all cells c calling f(c) on every one
+  template <typename Functor>
+  static void for_each_cell(Functor& f,
+                            const Grid& g,
+                            const CGAL::Sequential_tag)
+  {
+    for(std::size_t i=0; i<g.xdim()-1; ++i)
+      for(std::size_t j=0; j<g.ydim()-1; ++j)
+        for(std::size_t k=0; k<g.zdim()-1; ++k)
+          f({{i, j, k}});
+  }
+
+#ifdef CGAL_LINKED_WITH_TBB
+  // iterates in parallel over all vertices v calling f(v) on every one
+  template <typename Functor>
+  static void for_each_vertex(Functor& f,
+                              const Grid& g,
+                              const CGAL::Parallel_tag)
+  {
+    const std::size_t sj = g.ydim();
+    const std::size_t sk = g.zdim();
+
+    // for now only parallelize outer loop
+    auto iterator = [&f, sj, sk](const tbb::blocked_range<std::size_t>& r)
+    {
+      for(std::size_t i=r.begin(); i!=r.end(); ++i)
+        for(std::size_t j=0; j<sj; ++j)
+          for(std::size_t k=0; k<sk; ++k)
+            f({i, j, k});
+    };
+
+    tbb::parallel_for(tbb::blocked_range<std::size_t>(0, g.xdim()), iterator);
+  }
+
+  // iterates in parallel over all edges e calling f(e) on every one
+  template <typename Functor>
+  static void for_each_edge(Functor& f,
+                            const Grid& g,
+                            const CGAL::Parallel_tag)
+  {
+    const std::size_t sj = g.ydim();
+    const std::size_t sk = g.zdim();
+
+    // for now only parallelize outer loop
+    auto iterator = [&f, sj, sk](const tbb::blocked_range<std::size_t>& r)
+    {
+      for(std::size_t i=r.begin(); i != r.end(); ++i) {
+        for(std::size_t j=0; j<sj-1; ++j) {
+          for(std::size_t k=0; k<sk-1; ++k)
+          {
+            f({i, j, k, 0});
+            f({i, j, k, 1});
+            f({i, j, k, 2});
+          }
+        }
+      }
+    };
+
+    tbb::parallel_for(tbb::blocked_range<std::size_t>(0, g.xdim() - 1), iterator);
+  }
+
+  // iterates in parallel over all cells c calling f(c) on every one
+  template <typename Functor>
+  static void for_each_cell(Functor& f,
+                            const Grid& g,
+                            const CGAL::Parallel_tag)
+  {
+    // for now only parallelize outer loop
+    auto iterator = [&f](const tbb::blocked_range3d<std::size_t>& r)
+    {
+      const std::size_t i_begin = r.pages().begin();
+      const std::size_t i_end = r.pages().end();
+      const std::size_t j_begin = r.rows().begin();
+      const std::size_t j_end = r.rows().end();
+      const std::size_t k_begin = r.cols().begin();
+      const std::size_t k_end = r.cols().end();
+
+      for(std::size_t i = i_begin; i != i_end; ++i)
+        for(std::size_t j = j_begin; j != j_end; ++j)
+          for(std::size_t k = k_begin; k != k_end; ++k)
+            f({i, j, k});
+    };
+
+    tbb::blocked_range3d<std::size_t> range(0, g.xdim() - 1, 0, g.ydim() - 1, 0, g.zdim() - 1);
+    tbb::parallel_for(range, iterator);
+  }
+#endif // CGAL_LINKED_WITH_TBB
+
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_vertex(Functor& f, const Grid& g) { return for_each_vertex(f, g, ConcurrencyTag{}); }
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_edge(Functor& f, const Grid& g) { return for_each_edge(f, g, ConcurrencyTag{}); }
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_cell(Functor& f, const Grid& g) { return for_each_cell(f, g, ConcurrencyTag{}); }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+namespace std {
+
+template <>
+struct hash<CGAL::Isosurfacing::CG_Edge_descriptor>
+{
+  std::size_t operator()(const CGAL::Isosurfacing::CG_Edge_descriptor& e) const
+  {
+    std::size_t seed = 0;
+    boost::hash_combine(seed, e[0]);
+    boost::hash_combine(seed, e[1]);
+    boost::hash_combine(seed, e[2]);
+    boost::hash_combine(seed, e[3]);
+    return seed;
+  }
+};
+
+template <>
+struct hash<CGAL::Isosurfacing::CG_Cell_descriptor>
+{
+  std::size_t operator()(const CGAL::Isosurfacing::CG_Cell_descriptor& e) const
+  {
+    std::size_t seed = 0;
+    boost::hash_combine(seed, e[0]);
+    boost::hash_combine(seed, e[1]);
+    boost::hash_combine(seed, e[2]);
+    return seed;
+  }
+};
+
+} // namespace std
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_CARTESIAN_GRID_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits_Octree.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits_Octree.h
new file mode 100644
index 00000000000..eccd3a247dd
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/partition_traits_Octree.h
@@ -0,0 +1,672 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+//                 Sven Oesau
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_OCTREE_H
+#define CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_OCTREE_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Octree.h>
+#include <CGAL/Orthtree/Traversals.h>
+#include <CGAL/Isosurfacing_3/internal/Cell_type.h>
+#include <CGAL/Isosurfacing_3/internal/tables.h>
+
+#include <CGAL/tags.h>
+#include <boost/functional/hash.hpp>
+#include <CGAL/Simple_cartesian.h>
+
+#ifdef CGAL_LINKED_WITH_TBB
+#include <tbb/parallel_for.h>
+#endif // CGAL_LINKED_WITH_TBB
+
+#include <array>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+
+// this is to be able to specialize std::hash
+struct OW_Edge_handle : public std::tuple<std::size_t, std::size_t>
+{
+  using std::tuple<std::size_t, std::size_t>::tuple; // inherit constructors
+};
+
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+namespace std {
+
+template <>
+struct hash<CGAL::Isosurfacing::internal::OW_Edge_handle>
+{
+  std::size_t operator()(const CGAL::Isosurfacing::internal::OW_Edge_handle& e) const
+  {
+    std::size_t seed = 0;
+    boost::hash_combine(seed, std::get<0>(e));
+    boost::hash_combine(seed, std::get<1>(e));
+    return seed;
+  }
+};
+
+} // namespace std
+
+namespace CGAL {
+namespace Isosurfacing {
+
+template <typename Partition>
+struct partition_traits;
+
+template<typename GeomTraits>
+struct partition_traits<CGAL::Octree<GeomTraits, std::vector<typename GeomTraits::Point_3> > >
+{
+  using Orthtree = CGAL::Octree<GeomTraits, std::vector<typename GeomTraits::Point_3> >;
+
+public:
+  using Geom_traits = GeomTraits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  using Node_index = typename Orthtree::Node_index;
+  using Uniform_coords = typename Orthtree::Global_coordinates;  // coordinates on max depth level
+
+  using vertex_descriptor = std::size_t;
+  using edge_descriptor = internal::OW_Edge_handle;
+  using cell_descriptor = std::size_t;
+
+  static constexpr Cell_type CELL_TYPE = CUBICAL_CELL;
+  static constexpr std::size_t VERTICES_PER_CELL = 8;
+  static constexpr std::size_t EDGES_PER_CELL = 12;
+
+  using Edge_vertices = std::array<vertex_descriptor, 2>;
+  using Cells_incident_to_edge = std::vector<cell_descriptor>;
+  using Cell_vertices = std::array<vertex_descriptor, 8>;
+  using Cell_edges = std::array<edge_descriptor, 12>;
+
+public:
+  static std::set<edge_descriptor> get_leaf_edges(const Orthtree& o)
+  {
+    std::set<edge_descriptor> leaf_edge_set;
+    std::size_t dim = std::size_t(1) << o.depth();
+    for (Node_index node_index : o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o)))
+    {
+      const Uniform_coords& coords_uniform = uniform_coordinates(node_index, o);
+
+      // write all leaf edges in a set
+      const Uniform_coords& coords_global = o.global_coordinates(node_index);
+      const std::size_t depth = o.depth(node_index);
+      const std::size_t df = std::size_t(1) << (o.depth() - depth);
+      for (const auto& edge_voxels : internal::Cube_table::edge_to_voxel_neighbor)
+      {
+        bool are_all_voxels_leafs = true;
+        for (const auto& node_ijk : edge_voxels)
+        {
+          const std::size_t x = coords_uniform[0] + df * node_ijk[0];
+          const std::size_t y = coords_uniform[1] + df * node_ijk[1];
+          const std::size_t z = coords_uniform[2] + df * node_ijk[2];
+          // check for overflow / ignore edges on boundary
+          if (x >= dim || y >= dim || z >= dim)
+          {
+            are_all_voxels_leafs = false;
+            break;
+          }
+
+          const Node_index n = get_node(x, y, z, o);
+          if (o.depth(n) > depth)
+          {
+            are_all_voxels_leafs = false;
+            break;
+          }
+        }
+
+        if (are_all_voxels_leafs)
+        {
+          // add to leaf edge set
+          std::size_t e_gl = e_glIndex(edge_voxels[0][3],
+                                       coords_global[0], coords_global[1], coords_global[2],
+                                       depth);
+          leaf_edge_set.insert({ e_gl, depth });
+        }
+      }
+    }
+
+    return leaf_edge_set;
+  }
+
+  static std::set<vertex_descriptor> get_leaf_vertices(const Orthtree& o)
+  {
+    std::set<vertex_descriptor> leaf_vertex_set;
+    for (Node_index node_index : o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o)))
+    {
+      const Uniform_coords& coords_uniform = uniform_coordinates(node_index, o);
+
+      // write all vertices edges in a set
+      const Uniform_coords& coords_global = o.global_coordinates(node_index);
+      const std::size_t depth = o.depth(node_index);
+      const std::size_t df = std::size_t(1) << (o.depth() - depth);
+
+      for (int i = 0; i < internal::Cube_table::N_VERTICES; ++i)
+      {
+        Uniform_coords v_coords = coords_global;
+        typename Orthtree::Local_coordinates local_coords(i);
+
+        for (int j = 0; j < 3; ++j)
+          v_coords[j] += std::size_t(local_coords[j]);
+
+        for (int j = 0; j < 3; ++j)
+          v_coords[j] *= static_cast<uint32_t>(df);
+
+        const std::size_t lex = lex_index(v_coords[0], v_coords[1], v_coords[2], o.depth());
+        leaf_vertex_set.insert(lex);
+      }
+    }
+
+    return leaf_vertex_set;
+  }
+
+  static void get_leaves(const Orthtree& o,
+                         std::vector<cell_descriptor>& cells,
+                         std::vector<edge_descriptor>& edges,
+                         std::vector<vertex_descriptor>& vertices)
+  {
+    std::set<edge_descriptor> leaf_edge_set;
+    std::set<vertex_descriptor> leaf_vertex_set;
+    std::size_t dim = std::size_t(1) << o.depth();
+    cells.clear();
+    for (Node_index node_index : o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o)))
+    {
+      const Uniform_coords& coords_uniform = uniform_coordinates(node_index, o);
+      cells.push_back(node_index);
+
+      // write all leaf edges in a set
+      const Uniform_coords& coords_global = o.global_coordinates(node_index);
+      const std::size_t depth = o.depth(node_index);
+      const std::size_t df = std::size_t(1) << (o.depth() - depth);
+
+      for (int i = 0; i < internal::Cube_table::N_VERTICES; ++i)
+      {
+        Uniform_coords v_coords = coords_global;
+        typename Orthtree::Local_coordinates local_coords(i);
+
+        for (int j = 0; j < 3; ++j)
+          v_coords[j] += std::size_t(local_coords[j]);
+
+        for (int j = 0; j < 3; ++j)
+          v_coords[j] *= static_cast<uint32_t>(df);
+
+        const std::size_t lex = lex_index(v_coords[0], v_coords[1], v_coords[2], o.depth());
+        leaf_vertex_set.insert(lex);
+      }
+
+      for (const auto& edge_voxels : internal::Cube_table::edge_to_voxel_neighbor)
+      {
+        bool are_all_voxels_leafs = true;
+        for (const auto& node_ijk : edge_voxels)
+        {
+          const std::size_t x = coords_uniform[0] + df * node_ijk[0];
+          const std::size_t y = coords_uniform[1] + df * node_ijk[1];
+          const std::size_t z = coords_uniform[2] + df * node_ijk[2];
+          // check for overflow / ignore edges on boundary
+          if (x >= dim || y >= dim || z >= dim)
+          {
+            are_all_voxels_leafs = false;
+            break;
+          }
+
+          const Node_index n = get_node(x, y, z, o);
+          if (o.depth(n) > depth)
+          {
+            are_all_voxels_leafs = false;
+            break;
+          }
+        }
+
+        if (are_all_voxels_leafs)
+        {
+          // add to leaf edge set
+          std::size_t e_gl = e_glIndex(edge_voxels[0][3],
+                                       coords_global[0], coords_global[1], coords_global[2],
+                                       depth);
+          leaf_edge_set.insert({ e_gl, depth });
+        }
+      }
+    }
+
+    edges.clear();
+    vertices.clear();
+
+    std::copy(leaf_edge_set.begin(), leaf_edge_set.end(), std::back_inserter(edges));
+    std::copy(leaf_vertex_set.begin(), leaf_vertex_set.end(), std::back_inserter(vertices));
+  }
+
+  static Point_3 point(const vertex_descriptor v,
+                       const Orthtree& o)
+  {
+    std::size_t dim_ = std::size_t(1) << o.depth();
+    const auto bbox = o.bbox(0);
+    FT hx_ = (bbox.xmax() - bbox.xmin()) / dim_;
+    std::size_t i, j, k;
+    std::tie(i, j, k) = ijk_index(v, o.depth());
+
+    const FT x0 = bbox.xmin() + i * hx_;
+    const FT y0 = bbox.ymin() + j * hx_;
+    const FT z0 = bbox.zmin() + k * hx_;
+
+    return { x0, y0, z0 };
+  }
+
+
+  static Edge_vertices incident_vertices(const edge_descriptor& e,
+                                         const Orthtree& o)
+  {
+    return edge_vertices(e, o);
+  }
+
+  static Cells_incident_to_edge incident_cells(const edge_descriptor& e_id,
+                                               const Orthtree& o)
+  {
+    namespace Tables = internal::Cube_table;
+
+    std::size_t e_global_id, depth;
+    std::tie(e_global_id, depth) = static_cast<const std::tuple<std::size_t, std::size_t>&>(e_id);
+    const std::size_t e_local_index = Tables::edge_store_index[e_global_id % 3];
+
+    const std::size_t max_depth = o.depth();
+    const std::size_t df = std::size_t(1) << (max_depth - depth);
+
+    const size_t v0_lex_index = e_global_id / 3;
+    std::size_t i, j, k;
+    std::tie(i, j, k) = ijk_index(v0_lex_index, depth);
+    i *= df;
+    j *= df;
+    k *= df;
+
+    const auto& voxel_neighbors = Tables::edge_to_voxel_neighbor[e_local_index];
+    Node_index n0 = get_node(i + voxel_neighbors[0][0], j + voxel_neighbors[0][1], k + voxel_neighbors[0][2], o);
+    Node_index n1 = get_node(i + voxel_neighbors[1][0], j + voxel_neighbors[1][1], k + voxel_neighbors[1][2], o);
+    Node_index n2 = get_node(i + voxel_neighbors[2][0], j + voxel_neighbors[2][1], k + voxel_neighbors[2][2], o);
+    Node_index n3 = get_node(i + voxel_neighbors[3][0], j + voxel_neighbors[3][1], k + voxel_neighbors[3][2], o);
+
+    const Uniform_coords n0_uniform_coords = uniform_coordinates(n0, o);
+    const Uniform_coords n1_uniform_coords = uniform_coordinates(n1, o);
+    const Uniform_coords n2_uniform_coords = uniform_coordinates(n2, o);
+    const Uniform_coords n3_uniform_coords = uniform_coordinates(n3, o);
+
+    std::size_t n0_lex = lex_index(n0_uniform_coords[0], n0_uniform_coords[1], n0_uniform_coords[2], max_depth);
+    std::size_t n1_lex = lex_index(n1_uniform_coords[0], n1_uniform_coords[1], n1_uniform_coords[2], max_depth);
+    std::size_t n2_lex = lex_index(n2_uniform_coords[0], n2_uniform_coords[1], n2_uniform_coords[2], max_depth);
+    std::size_t n3_lex = lex_index(n3_uniform_coords[0], n3_uniform_coords[1], n3_uniform_coords[2], max_depth);
+
+    Cells_incident_to_edge ics = { n0_lex, n1_lex, n2_lex, n3_lex };
+
+    // With an adaptative octree, there is no reason that all cells around an interesting edge
+    // have the same level. If there is such a jump, we have a duplicate to filter.
+    if (ics.front() == ics.back()) {
+      ics.pop_back(); // Remove the duplicate if the first and last are the same.
+    } else {
+      ics.erase(std::unique(ics.begin(), ics.end()), ics.end());
+    }
+
+    CGAL_postcondition(ics.size() >= 3);
+    CGAL_postcondition(std::set<std::size_t>(ics.begin(), ics.end()).size() == ics.size());
+
+    return ics;
+  }
+
+  static std::size_t depth(const cell_descriptor c,
+                           const Orthtree& o)
+  {
+    return o.depth(c);
+  }
+
+  static Cell_vertices cell_vertices(const cell_descriptor c,
+                                     const Orthtree& o)
+  {
+    std::size_t i, j, k;
+    std::tie(i, j, k) = ijk_index(c, o.depth());
+    Node_index node_index = get_node(i, j, k, o);
+    const std::size_t df = std::size_t(1) << (o.depth() - o.depth(node_index));
+
+    std::array<vertex_descriptor, 8> v;
+    for (int v_id = 0; v_id < internal::Cube_table::N_VERTICES; ++v_id)
+    {
+      const int* l = internal::Cube_table::local_vertex_location[v_id];
+      const std::size_t lex = lex_index(i + df * l[0], j + df * l[1], k + df * l[2], o.depth());
+      v[v_id] = lex;
+    }
+
+    return v;
+  }
+
+  static Cell_edges cell_edges(const cell_descriptor c,
+                               const Orthtree& o)
+  {
+    std::size_t i, j, k;
+    std::tie(i, j, k) = ijk_index(c, o.depth());
+    Node_index node_index = get_node(i, j, k, o);
+
+    const Uniform_coords& coords_global = o.global_coordinates(node_index);
+    const std::size_t depth = o.depth(node_index);
+
+    std::array<edge_descriptor, internal::Cube_table::N_EDGES> edges;
+    for (std::size_t e_id = 0; e_id < edges.size(); ++e_id)
+    {
+      const std::size_t e_gl = e_glIndex(e_id, coords_global[0], coords_global[1], coords_global[2], depth);
+      edges[e_id] = { e_gl, depth };
+    }
+
+    return edges;
+  }
+
+  template <typename Functor>
+  static void for_each_vertex(Functor& f,
+                              const Orthtree& o,
+                              const CGAL::Sequential_tag)
+  {
+    for(const vertex_descriptor v : get_leaf_vertices(o))
+      f(v);
+  }
+
+  template <typename Functor>
+  static void for_each_vertex(Functor& f,
+                              std::vector<vertex_descriptor>& vertices,
+                              const Orthtree&,
+                              const CGAL::Sequential_tag)
+  {
+    for (const vertex_descriptor v : vertices)
+      f(v);
+  }
+
+  template <typename Functor>
+  static void for_each_edge(Functor& f,
+                            const Orthtree& o,
+                            Sequential_tag)
+  {
+    for(const edge_descriptor& e : get_leaf_edges(o))
+      f(e);
+  }
+
+  template <typename Functor>
+  static void for_each_edge(Functor& f,
+                            std::vector<edge_descriptor>& edges,
+                            const Orthtree& o,
+                            Sequential_tag)
+  {
+    if (edges.empty()) {
+      std::set<edge_descriptor> edge_set = get_leaf_edges(o);
+      edges.assign(edge_set.begin(), edge_set.end());
+    }
+
+    for (const edge_descriptor& e : edges)
+      f(e);
+  }
+
+  template <typename Functor>
+  static void for_each_cell(Functor& f,
+                            const Orthtree& o,
+                            CGAL::Sequential_tag)
+  {
+    for (const cell_descriptor c : o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o))) {
+      const Uniform_coords uc = uniform_coordinates(c, o);
+      f(lex_index(uc[0], uc[1], uc[2], o.depth()));
+    }
+  }
+
+  template <typename Functor>
+  static void for_each_cell(Functor& f,
+                            std::vector<cell_descriptor>& cells,
+                            const Orthtree& o,
+                            CGAL::Sequential_tag)
+  {
+    if (cells.empty()) {
+      auto cell_range = o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o));
+      cells.assign(cell_range.begin(), cell_range.end());
+    }
+
+    for (const cell_descriptor c : cells) {
+      const Uniform_coords uc = uniform_coordinates(c, o);
+      f(lex_index(uc[0], uc[1], uc[2], o.depth()));
+    }
+  }
+
+#ifdef CGAL_LINKED_WITH_TBB
+  template <typename Functor>
+  static void for_each_vertex(Functor& f,
+                              const Orthtree& o,
+                              Parallel_tag)
+  {
+    auto edges = get_leaf_edges(o);
+
+    tbb::parallel_for_each(edges.begin(), edges.end(), f);
+  }
+
+  template <typename Functor>
+  static void for_each_vertex(Functor& f,
+                              std::vector<vertex_descriptor>& vertices,
+                              const Orthtree&,
+                              Parallel_tag)
+  {
+    auto iterator = [&](const tbb::blocked_range<std::size_t>& r)
+    {
+      for(std::size_t i = r.begin(); i != r.end(); ++i)
+        f(vertices[i]);
+    };
+
+    tbb::parallel_for(tbb::blocked_range<std::size_t>(0, vertices.size()), iterator);
+  }
+
+  template <typename Functor>
+  static void for_each_edge(Functor& f,
+                            const Orthtree& o,
+                            Parallel_tag)
+  {
+    std::set<edge_descriptor> edges = get_leaf_edges(o);
+
+    tbb::parallel_for_each(edges.begin(), edges.end(), f);
+  }
+
+  template <typename Functor>
+  static void for_each_edge(Functor& f,
+                            std::vector<edge_descriptor>& edges,
+                            const Orthtree& o,
+                            Parallel_tag)
+  {
+    if (edges.empty()) {
+      std::set<edge_descriptor> edge_set = get_leaf_edges(o);
+      edges.assign(edge_set.begin(), edge_set.end());
+    }
+
+    auto iterator = [&](const tbb::blocked_range<std::size_t>& r)
+      {
+        for (std::size_t i = r.begin(); i != r.end(); ++i)
+          f(edges[i]);
+      };
+
+    tbb::parallel_for(tbb::blocked_range<std::size_t>(0, edges.size()), iterator);
+  }
+
+  template <typename Functor>
+  static void for_each_cell(Functor& f,
+                            const Orthtree& o,
+                            Parallel_tag)
+  {
+    auto func = [&](const typename Orthtree::Node_index& n)
+    {
+      const Uniform_coords& uc = uniform_coordinates(n, o);
+      f(lex_index(uc[0], uc[1], uc[2], o.depth()));
+    };
+
+    const auto& cells = o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o));
+    tbb::parallel_for_each(cells.begin(), cells.end(), func);
+  }
+
+  template <typename Functor>
+  static void for_each_cell(Functor& f,
+                            std::vector<cell_descriptor>& cells,
+                            const Orthtree& o,
+                            Parallel_tag)
+  {
+    if (cells.empty()) {
+      auto cell_range = o.traverse(CGAL::Orthtrees::Leaves_traversal<Orthtree>(o));
+      cells.assign(cell_range.begin(), cell_range.end());
+    }
+
+    auto iterator = [&](const tbb::blocked_range<std::size_t>& r)
+      {
+        for (std::size_t i = r.begin(); i != r.end(); ++i) {
+          const Uniform_coords& uc = uniform_coordinates(cells[i], o);
+          f(lex_index(uc[0], uc[1], uc[2], o.depth()));
+        }
+      };
+
+    tbb::parallel_for(tbb::blocked_range<std::size_t>(0, cells.size()), iterator);
+  }
+#endif // CGAL_LINKED_WITH_TBB
+
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_vertex(Functor& f, const Orthtree& o)
+  { return for_each_vertex(f, o, ConcurrencyTag{}); }
+
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_edge(Functor& f, std::vector<edge_descriptor>& edges, const Orthtree& o)
+  { return for_each_edge(f, edges, o, ConcurrencyTag{}); }
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_edge(Functor& f, const Orthtree& o)
+  { return for_each_edge(f, o, ConcurrencyTag{}); }
+
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_cell(Functor& f, std::vector<cell_descriptor>& cells, const Orthtree& o)
+  { return for_each_cell(f, cells, o, ConcurrencyTag{}); }
+  template <typename ConcurrencyTag, typename Functor>
+  static void for_each_cell(Functor& f, const Orthtree& o)
+  { return for_each_cell(f, o, ConcurrencyTag{}); }
+
+private:
+  static Uniform_coords uniform_coordinates(Node_index node_index,
+                                            const Orthtree& o)
+  {
+    Uniform_coords coords = o.global_coordinates(node_index);
+    const std::size_t df = std::size_t(1) << (o.depth() - o.depth(node_index));
+    for (int i = 0; i < 3; ++i)
+      coords[i] *= static_cast<uint32_t>(df);
+
+    return coords;
+  }
+
+  static std::tuple<std::size_t, std::size_t, std::size_t> ijk_index(const std::size_t lex_index,
+                                                                     const std::size_t depth)
+  {
+    const std::size_t dim = (std::size_t(1) << depth) + 1;
+    return std::make_tuple(lex_index % dim, (lex_index / dim) % dim, lex_index / (dim * dim));
+  }
+
+  // computes unique edge global index.
+  // \param e local edge index
+  // \param i_idx i-index of cell
+  // \param j_idx j-index of cell
+  // \param k_idx k-index of cell
+  // \param depth of cell
+  static std::size_t e_glIndex(const std::size_t e,
+                               const std::size_t i_idx,
+                               const std::size_t j_idx,
+                               const std::size_t k_idx,
+                               const std::size_t depth)
+  {
+    const unsigned long long gei_pattern_ = 670526590282893600ull;
+    const size_t i = i_idx + (size_t)((gei_pattern_ >> 5 * e) & 1);        // global_edge_id[eg][0];
+    const size_t j = j_idx + (size_t)((gei_pattern_ >> (5 * e + 1)) & 1);  // global_edge_id[eg][1];
+    const size_t k = k_idx + (size_t)((gei_pattern_ >> (5 * e + 2)) & 1);  // global_edge_id[eg][2];
+    const size_t offs = (size_t)((gei_pattern_ >> (5 * e + 3)) & 3);
+
+    return (3 * lex_index(i, j, k, depth) + offs);
+  }
+
+  static std::size_t lex_index(const std::size_t i,
+                               const std::size_t j,
+                               const std::size_t k,
+                               const std::size_t depth)
+  {
+    std::size_t dim = (std::size_t(1) << depth) + 1;
+    return k * dim * dim + j * dim + i;
+  }
+
+  static std::array<vertex_descriptor, 2> edge_vertices(const edge_descriptor& e_id,
+                                                        const Orthtree& o)
+  {
+    namespace Tables = internal::Cube_table;
+
+    std::size_t e_global_id, depth, max_depth = o.depth();
+    std::tie(e_global_id, depth) = static_cast<const std::tuple<std::size_t, std::size_t>&>(e_id);
+    const std::size_t df = std::size_t(1) << (max_depth - depth);
+
+    const size_t v0_lex_index = e_global_id / 3;
+    std::size_t i0, j0, k0;
+    std::tie(i0, j0, k0) = ijk_index(v0_lex_index, depth);
+
+    // v1
+    const std::size_t e_local_index = Tables::edge_store_index[e_global_id % 3];
+    const int* v1_local = Tables::local_vertex_location[Tables::edge_to_vertex[e_local_index][1]];
+
+    const std::size_t i1 = i0 + v1_local[0];
+    const std::size_t j1 = j0 + v1_local[1];
+    const std::size_t k1 = k0 + v1_local[2];
+
+    const std::size_t v0 = lex_index(df * i0, df * j0, df * k0, max_depth);
+    const std::size_t v1 = lex_index(df * i1, df * j1, df * k1, max_depth);
+
+    return { v0, v1 };
+  }
+
+  static Node_index get_node(const std::size_t i,
+                             const std::size_t j,
+                             const std::size_t k,
+                             const Orthtree& o)
+  {
+    Node_index node_index = o.root();
+    const std::size_t x = i;
+    const std::size_t y = j;
+    const std::size_t z = k;
+
+    while (!o.is_leaf(node_index))
+    {
+      std::size_t dist_to_max = o.depth() - o.depth(node_index) - 1;
+      typename Orthtree::Local_coordinates loc;
+      if (x & (std::size_t(1) << dist_to_max))
+        loc[0] = true;
+
+      if (y & (std::size_t(1) << dist_to_max))
+        loc[1] = true;
+
+      if (z & (std::size_t(1) << dist_to_max))
+        loc[2] = true;
+
+      node_index = o.child(node_index, loc.to_ulong());
+    }
+
+    return node_index;
+  }
+
+  static Node_index get_node(const std::size_t lex_index,
+                             const Orthtree& o)
+  {
+    std::size_t i, j, k;
+    std::tie(i, j, k) = ijk_index(lex_index, o.depth());
+    return get_node(i, j, k, o);
+  }
+};
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_PARTITION_TRAITS_OCTREE_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/tables.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/tables.h
new file mode 100644
index 00000000000..9e2f4973b50
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/tables.h
@@ -0,0 +1,703 @@
+// Copyright (c) 2020 INRIA Sophia-Antipolis (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: ( GPL-3.0-or-later OR LicenseRef-Commercial ) AND MIT
+//
+// Author(s)     : Julian Stahl
+//
+// This file incorporates work covered by the following copyright and permission notice:
+//
+//     MIT License
+//
+//     Copyright (c) 2020 Roberto Grosso
+//
+//     Permission is hereby granted, free of charge, to any person obtaining a copy
+//     of this software and associated documentation files (the "Software"), to deal
+//     in the Software without restriction, including without limitation the rights
+//     to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//     copies of the Software, and to permit persons to whom the Software is
+//     furnished to do so, subject to the following conditions:
+//
+//     The above copyright notice and this permission notice shall be included in all
+//     copies or substantial portions of the Software.
+//
+//     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//     IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//     FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//     AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//     OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//     SOFTWARE.
+//
+//
+// The code below uses the version of
+// https://github.com/rogrosso/tmc available on 15th of September 2022.
+//
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_TABLES_H
+#define CGAL_ISOSURFACING_3_INTERNAL_TABLES_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+namespace Cube_table {
+/*
+ * Naming convention from "A parallel dual marching cubes approach
+ * to quad only surface reconstruction - Grosso & Zint"
+ *
+ *        ^ y
+ *        |
+ *       v2------e2------v3
+ *       /|             /|
+ *     e11|           e10|
+ *     /  e3          /  e1
+ *   v6------e6------v7  |
+ *    |   |          |   |
+ *    |  v0------e0--|---v1 --> x
+ *    e7 /           e5 /
+ *    | e8           | e9
+ *    |/             |/
+ *   v4------e4------v5
+ *   /
+ *  < z
+ */
+
+constexpr int N_VERTICES = 8;
+constexpr int N_EDGES = 12;
+
+// This table iterates around an edge of a voxel in positive direction, starting from the given voxel (0,0,0). The
+// iteration is described in coordinates relative to the given voxel. The last number is the local edge index.
+constexpr int edge_to_voxel_neighbor[N_EDGES][4][4] =
+{
+  {{0, 0, 0, 0}, {0, -1, 0, 2}, {0, -1, -1, 6}, {0, 0, -1, 4}},    // e0
+  {{0, 0, 0, 1}, {1, 0, 0, 3}, {1, 0, -1, 7}, {0, 0, -1, 5}},      // e1
+  {{0, 0, 0, 2}, {0, 0, -1, 6}, {0, 1, -1, 4}, {0, 1, 0, 0}},      // e2
+  {{0, 0, 0, 3}, {0, 0, -1, 7}, {-1, 0, -1, 5}, {-1, 0, 0, 1}},    // e3
+  {{0, 0, 0, 4}, {0, 0, 1, 0}, {0, -1, 1, 2}, {0, -1, 0, 6}},      // e4
+  {{0, 0, 0, 5}, {0, 0, 1, 1}, {1, 0, 1, 3}, {1, 0, 0, 7}},        // e5
+  {{0, 0, 0, 6}, {0, 1, 0, 4}, {0, 1, 1, 0}, {0, 0, 1, 2}},        // e6
+  {{0, 0, 0, 7}, {-1, 0, 0, 5}, {-1, 0, 1, 1}, {0, 0, 1, 3}},      // e7
+  {{0, 0, 0, 8}, {-1, 0, 0, 9}, {-1, -1, 0, 10}, {0, -1, 0, 11}},  // e8
+  {{0, 0, 0, 9}, {0, -1, 0, 10}, {1, -1, 0, 11}, {1, 0, 0, 8}},    // e9
+  {{0, 0, 0, 10}, {1, 0, 0, 11}, {1, 1, 0, 8}, {0, 1, 0, 9}},      // e10
+  {{0, 0, 0, 11}, {0, 1, 0, 8}, {-1, 1, 0, 9}, {-1, 0, 0, 10}}     // e11
+};
+
+/* The global edge index consists of the lexicographical index of the v0 vertex of a voxel, and an index that
+ * represents the axis. This table maps from the axis index to the local edge index: 0 = x-axis --> 0 1 = y-axis -->
+ * 3 2 = z-axis --> 8
+ */
+constexpr int edge_store_index[3] = {0, 3, 8};
+
+// The local vertex indices of an edge. The indices are sorted by axis direction.
+constexpr int edge_to_vertex[N_EDGES][2] =
+{
+  {0, 1},  // e0
+  {1, 3},  // e1
+  {2, 3},  // e2
+  {0, 2},  // e3
+  {4, 5},  // e4
+  {5, 7},  // e5
+  {6, 7},  // e6
+  {4, 6},  // e7
+  {0, 4},  // e8
+  {1, 5},  // e9
+  {3, 7},  // e10
+  {2, 6}   // e11
+};
+
+// The local vertex coordinates within a voxel.
+constexpr int local_vertex_location[N_VERTICES][3] =
+{
+  {0, 0, 0},  // v0
+  {1, 0, 0},  // v1
+  {0, 1, 0},  // v2
+  {1, 1, 0},  // v3
+  {0, 0, 1},  // v4
+  {1, 0, 1},  // v5
+  {0, 1, 1},  // v6
+  {1, 1, 1}   // v7
+};
+
+// Edges are uniquely characterized by the two end vertices, which have a unique vertex id
+// the end vertices of the edge are computed in the cell by giving the indices (i,j,k).
+// These indices are obtained from the cell index by adding 0 or 1 to i, j or k respectively
+// Example: edge 0: (i,j,k) - (i+1,j,k)
+//          edge 1: (i+1,j,k) - (i+1,j+1,k)
+// The first 3 indices are for the first vertex and the second 3 for the second vertex.
+// there are 12 edges, assign to each vertex three edges, the global edge numbering
+// consist of 3*global_vertex_id + edge_offset.
+constexpr int global_edge_id[][4] = {{0, 0, 0, 0}, {1, 0, 0, 1}, {0, 1, 0, 0}, {0, 0, 0, 1},
+                                     {0, 0, 1, 0}, {1, 0, 1, 1}, {0, 1, 1, 0}, {0, 0, 1, 1},
+                                     {0, 0, 0, 2}, {1, 0, 0, 2}, {1, 1, 0, 2}, {0, 1, 0, 2}};
+
+// probably a list without errors
+// indicates which edges has to be intersected
+constexpr int intersected_edges[256] =
+{
+  0,    265,  515,  778,  2060, 2309, 2575, 2822, 1030, 1295, 1541, 1804, 3082, 3331, 3593, 3840, 400,  153,  915,
+  666,  2460, 2197, 2975, 2710, 1430, 1183, 1941, 1692, 3482, 3219, 3993, 3728, 560,  825,  51,   314,  2620, 2869,
+  2111, 2358, 1590, 1855, 1077, 1340, 3642, 3891, 3129, 3376, 928,  681,  419,  170,  2988, 2725, 2479, 2214, 1958,
+  1711, 1445, 1196, 4010, 3747, 3497, 3232, 2240, 2505, 2755, 3018, 204,  453,  719,  966,  3270, 3535, 3781, 4044,
+  1226, 1475, 1737, 1984, 2384, 2137, 2899, 2650, 348,  85,   863,  598,  3414, 3167, 3925, 3676, 1370, 1107, 1881,
+  1616, 2800, 3065, 2291, 2554, 764,  1013, 255,  502,  3830, 4095, 3317, 3580, 1786, 2035, 1273, 1520, 2912, 2665,
+  2403, 2154, 876,  613,  367,  102,  3942, 3695, 3429, 3180, 1898, 1635, 1385, 1120, 1120, 1385, 1635, 1898, 3180,
+  3429, 3695, 3942, 102,  367,  613,  876,  2154, 2403, 2665, 2912, 1520, 1273, 2035, 1786, 3580, 3317, 4095, 3830,
+  502,  255,  1013, 764,  2554, 2291, 3065, 2800, 1616, 1881, 1107, 1370, 3676, 3925, 3167, 3414, 598,  863,  85,
+  348,  2650, 2899, 2137, 2384, 1984, 1737, 1475, 1226, 4044, 3781, 3535, 3270, 966,  719,  453,  204,  3018, 2755,
+  2505, 2240, 3232, 3497, 3747, 4010, 1196, 1445, 1711, 1958, 2214, 2479, 2725, 2988, 170,  419,  681,  928,  3376,
+  3129, 3891, 3642, 1340, 1077, 1855, 1590, 2358, 2111, 2869, 2620, 314,  51,   825,  560,  3728, 3993, 3219, 3482,
+  1692, 1941, 1183, 1430, 2710, 2975, 2197, 2460, 666,  915,  153,  400,  3840, 3593, 3331, 3082, 1804, 1541, 1295,
+  1030, 2822, 2575, 2309, 2060, 778,  515,  265,  0
+};
+
+// list of triangles for Marching Cubes case t, position at t*16 + tri
+constexpr int triangle_cases[4096] =
+{
+  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 0 <-> mc: 0, class rep: 0
+  0,  3,  8,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 1 <-> mc: 1, class rep: 1
+  0,  9,  1,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 2 <-> mc: 2, class rep: 1
+  1,  3,  8,  9,  1,  8,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 3 <-> mc: 3, class rep: 3
+  3,  2,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 4 <-> mc: 8, class rep: 1
+  0,  2,  11, 8,  0,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 5 <-> mc: 9, class rep: 3
+  1,  0,  9,  2,  11, 3,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 6 <-> mc: 10, class rep: 6
+  1,  2,  11, 1,  11, 9,  9,  11, 8,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 7 <-> mc: 11, class rep: 7
+  1,  10, 2,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 8 <-> mc: 4, class rep: 1
+  0,  3,  8,  1,  10, 2,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 9 <-> mc: 5, class rep: 6
+  9,  10, 2,  0,  9,  2,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 10 <-> mc: 6, class rep: 3
+  2,  3,  8,  2,  8,  10, 10, 8,  9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 11 <-> mc: 7, class rep: 7
+  3,  1,  10, 11, 3,  10, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 12 <-> mc: 12, class rep: 3
+  0,  1,  10, 0,  10, 8,  8,  10, 11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 13 <-> mc: 13, class rep: 7
+  3,  0,  9,  3,  9,  11, 11, 9,  10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 14 <-> mc: 14, class rep: 7
+  9,  10, 8,  10, 11, 8,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 15 <-> mc: 15, class rep: 15
+  4,  8,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 16 <-> mc: 16, class rep: 1
+  4,  0,  3,  7,  4,  3,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 17 <-> mc: 17, class rep: 3
+  0,  9,  1,  8,  7,  4,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 18 <-> mc: 18, class rep: 6
+  4,  9,  1,  4,  1,  7,  7,  1,  3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 19 <-> mc: 19, class rep: 7
+  8,  7,  4,  3,  2,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 20 <-> mc: 24, class rep: 6
+  11, 7,  4,  11, 4,  2,  2,  4,  0,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 21 <-> mc: 25, class rep: 7
+  9,  1,  0,  8,  7,  4,  2,  11, 3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 22 <-> mc: 26, class rep: 22
+  4,  11, 7,  9,  11, 4,  9,  2,  11, 9,  1,  2,  -1, -1, -1, -1,  // quitte: 23 <-> mc: 27, class rep: 23
+  1,  10, 2,  8,  7,  4,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 24 <-> mc: 20, class rep: 24
+  3,  7,  4,  3,  4,  0,  1,  10, 2,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 25 <-> mc: 21, class rep: 25
+  9,  10, 2,  9,  2,  0,  8,  7,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 26 <-> mc: 22, class rep: 25
+  2,  9,  10, 2,  7,  9,  2,  3,  7,  7,  4,  9,  -1, -1, -1, -1,  // quitte: 27 <-> mc: 23, class rep: 27
+  3,  1,  10, 3,  10, 11, 7,  4,  8,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 28 <-> mc: 28, class rep: 25
+  1,  10, 11, 1,  11, 4,  1,  4,  0,  7,  4,  11, -1, -1, -1, -1,  // quitte: 29 <-> mc: 29, class rep: 29
+  4,  8,  7,  9,  11, 0,  9,  10, 11, 11, 3,  0,  -1, -1, -1, -1,  // quitte: 30 <-> mc: 30, class rep: 30
+  4,  11, 7,  4,  9,  11, 9,  10, 11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 31 <-> mc: 31, class rep: 7
+  9,  4,  5,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 32 <-> mc: 32, class rep: 1
+  9,  4,  5,  0,  3,  8,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 33 <-> mc: 33, class rep: 6
+  0,  4,  5,  1,  0,  5,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 34 <-> mc: 34, class rep: 3
+  8,  4,  5,  8,  5,  3,  3,  5,  1,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 35 <-> mc: 35, class rep: 7
+  9,  4,  5,  2,  11, 3,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 36 <-> mc: 40, class rep: 24
+  0,  2,  11, 0,  11, 8,  4,  5,  9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 37 <-> mc: 41, class rep: 25
+  0,  4,  5,  0,  5,  1,  2,  11, 3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 38 <-> mc: 42, class rep: 25
+  2,  5,  1,  2,  8,  5,  2,  11, 8,  4,  5,  8,  -1, -1, -1, -1,  // quitte: 39 <-> mc: 43, class rep: 29
+  1,  10, 2,  9,  4,  5,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 40 <-> mc: 36, class rep: 6
+  3,  8,  0,  1,  10, 2,  4,  5,  9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 41 <-> mc: 37, class rep: 22
+  5,  10, 2,  5,  2,  4,  4,  2,  0,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 42 <-> mc: 38, class rep: 7
+  2,  5,  10, 3,  5,  2,  3,  4,  5,  3,  8,  4,  -1, -1, -1, -1,  // quitte: 43 <-> mc: 39, class rep: 23
+  10, 11, 3,  10, 3,  1,  9,  4,  5,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 44 <-> mc: 44, class rep: 25
+  4,  5,  9,  0,  1,  8,  8,  1,  10, 8,  10, 11, -1, -1, -1, -1,  // quitte: 45 <-> mc: 45, class rep: 30
+  5,  0,  4,  5,  11, 0,  5,  10, 11, 11, 3,  0,  -1, -1, -1, -1,  // quitte: 46 <-> mc: 46, class rep: 27
+  5,  8,  4,  5,  10, 8,  10, 11, 8,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 47 <-> mc: 47, class rep: 7
+  9,  8,  7,  5,  9,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 48 <-> mc: 48, class rep: 3
+  9,  0,  3,  9,  3,  5,  5,  3,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 49 <-> mc: 49, class rep: 7
+  0,  8,  7,  0,  7,  1,  1,  7,  5,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 50 <-> mc: 50, class rep: 7
+  1,  3,  5,  3,  7,  5,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 51 <-> mc: 51, class rep: 15
+  7,  5,  9,  7,  9,  8,  3,  2,  11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 52 <-> mc: 56, class rep: 25
+  9,  7,  5,  9,  2,  7,  9,  0,  2,  2,  11, 7,  -1, -1, -1, -1,  // quitte: 53 <-> mc: 57, class rep: 27
+  2,  11, 3,  0,  8,  1,  1,  8,  7,  1,  7,  5,  -1, -1, -1, -1,  // quitte: 54 <-> mc: 58, class rep: 30
+  11, 1,  2,  11, 7,  1,  7,  5,  1,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 55 <-> mc: 59, class rep: 7
+  9,  8,  7,  9,  7,  5,  10, 2,  1,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 56 <-> mc: 52, class rep: 25
+  10, 2,  1,  9,  0,  5,  5,  0,  3,  5,  3,  7,  -1, -1, -1, -1,  // quitte: 57 <-> mc: 53, class rep: 30
+  8,  2,  0,  8,  5,  2,  8,  7,  5,  10, 2,  5,  -1, -1, -1, -1,  // quitte: 58 <-> mc: 54, class rep: 29
+  2,  5,  10, 2,  3,  5,  3,  7,  5,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 59 <-> mc: 55, class rep: 7
+  9,  8,  5,  8,  7,  5,  10, 3,  1,  10, 11, 3,  -1, -1, -1, -1,  // quitte: 60 <-> mc: 60, class rep: 60
+  5,  0,  7,  5,  9,  0,  7,  0,  11, 1,  10, 0,  11, 0,  10, -1,  // quitte: 61 <-> mc: 61, class rep: 25
+  11, 0,  10, 11, 3,  0,  10, 0,  5,  8,  7,  0,  5,  0,  7,  -1,  // quitte: 62 <-> mc: 62, class rep: 25
+  11, 5,  10, 7,  5,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 63 <-> mc: 63, class rep: 3
+  7,  11, 6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 64 <-> mc: 128, class rep: 1
+  3,  8,  0,  11, 6,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 65 <-> mc: 129, class rep: 6
+  0,  9,  1,  11, 6,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 66 <-> mc: 130, class rep: 24
+  8,  9,  1,  8,  1,  3,  11, 6,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 67 <-> mc: 131, class rep: 25
+  7,  3,  2,  6,  7,  2,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 68 <-> mc: 136, class rep: 3
+  7,  8,  0,  7,  0,  6,  6,  0,  2,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 69 <-> mc: 137, class rep: 7
+  2,  6,  7,  2,  7,  3,  0,  9,  1,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 70 <-> mc: 138, class rep: 25
+  1,  2,  6,  1,  6,  8,  1,  8,  9,  8,  6,  7,  -1, -1, -1, -1,  // quitte: 71 <-> mc: 139, class rep: 27
+  10, 2,  1,  6,  7,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 72 <-> mc: 132, class rep: 6
+  1,  10, 2,  3,  8,  0,  6,  7,  11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 73 <-> mc: 133, class rep: 22
+  2,  0,  9,  2,  9,  10, 6,  7,  11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 74 <-> mc: 134, class rep: 25
+  6,  7,  11, 2,  3,  10, 10, 3,  8,  10, 8,  9,  -1, -1, -1, -1,  // quitte: 75 <-> mc: 135, class rep: 30
+  10, 6,  7,  10, 7,  1,  1,  7,  3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 76 <-> mc: 140, class rep: 7
+  10, 6,  7,  1,  10, 7,  1,  7,  8,  1,  8,  0,  -1, -1, -1, -1,  // quitte: 77 <-> mc: 141, class rep: 23
+  0,  7,  3,  0,  10, 7,  0,  9,  10, 6,  7,  10, -1, -1, -1, -1,  // quitte: 78 <-> mc: 142, class rep: 29
+  7,  10, 6,  7,  8,  10, 8,  9,  10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 79 <-> mc: 143, class rep: 7
+  6,  4,  8,  11, 6,  8,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 80 <-> mc: 144, class rep: 3
+  3,  11, 6,  3,  6,  0,  0,  6,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 81 <-> mc: 145, class rep: 7
+  8,  11, 6,  8,  6,  4,  9,  1,  0,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 82 <-> mc: 146, class rep: 25
+  9,  6,  4,  9,  3,  6,  9,  1,  3,  11, 6,  3,  -1, -1, -1, -1,  // quitte: 83 <-> mc: 147, class rep: 29
+  8,  3,  2,  8,  2,  4,  4,  2,  6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 84 <-> mc: 152, class rep: 7
+  0,  2,  4,  4,  2,  6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 85 <-> mc: 153, class rep: 15
+  1,  0,  9,  2,  4,  3,  2,  6,  4,  4,  8,  3,  -1, -1, -1, -1,  // quitte: 86 <-> mc: 154, class rep: 30
+  1,  4,  9,  1,  2,  4,  2,  6,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 87 <-> mc: 155, class rep: 7
+  6,  4,  8,  6,  8,  11, 2,  1,  10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 88 <-> mc: 148, class rep: 25
+  1,  10, 2,  3,  11, 0,  0,  11, 6,  0,  6,  4,  -1, -1, -1, -1,  // quitte: 89 <-> mc: 149, class rep: 30
+  4,  8,  11, 4,  11, 6,  0,  9,  2,  2,  9,  10, -1, -1, -1, -1,  // quitte: 90 <-> mc: 150, class rep: 60
+  10, 3,  9,  10, 2,  3,  9,  3,  4,  11, 6,  3,  4,  3,  6,  -1,  // quitte: 91 <-> mc: 151, class rep: 25
+  8,  3,  1,  8,  1,  6,  8,  6,  4,  6,  1,  10, -1, -1, -1, -1,  // quitte: 92 <-> mc: 156, class rep: 27
+  10, 0,  1,  10, 6,  0,  6,  4,  0,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 93 <-> mc: 157, class rep: 7
+  4,  3,  6,  4,  8,  3,  6,  3,  10, 0,  9,  3,  10, 3,  9,  -1,  // quitte: 94 <-> mc: 158, class rep: 25
+  10, 4,  9,  6,  4,  10, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 95 <-> mc: 159, class rep: 3
+  4,  5,  9,  7,  11, 6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 96 <-> mc: 160, class rep: 6
+  0,  3,  8,  4,  5,  9,  11, 6,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 97 <-> mc: 161, class rep: 22
+  5,  1,  0,  5,  0,  4,  7,  11, 6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 98 <-> mc: 162, class rep: 25
+  11, 6,  7,  8,  4,  3,  3,  4,  5,  3,  5,  1,  -1, -1, -1, -1,  // quitte: 99 <-> mc: 163, class rep: 30
+  7,  3,  2,  7,  2,  6,  5,  9,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 100 <-> mc: 168, class rep: 25
+  9,  4,  5,  0,  6,  8,  0,  2,  6,  6,  7,  8,  -1, -1, -1, -1,  // quitte: 101 <-> mc: 169, class rep: 30
+  3,  2,  6,  3,  6,  7,  1,  0,  5,  5,  0,  4,  -1, -1, -1, -1,  // quitte: 102 <-> mc: 170, class rep: 60
+  6,  8,  2,  6,  7,  8,  2,  8,  1,  4,  5,  8,  1,  8,  5,  -1,  // quitte: 103 <-> mc: 171, class rep: 25
+  9,  4,  5,  10, 2,  1,  7,  11, 6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 104 <-> mc: 164, class rep: 22
+  6,  7,  11, 1,  10, 2,  0,  3,  8,  4,  5,  9,  -1, -1, -1, -1,  // quitte: 105 <-> mc: 165, class rep: 105
+  7,  11, 6,  5,  10, 4,  4,  10, 2,  4,  2,  0,  -1, -1, -1, -1,  // quitte: 106 <-> mc: 166, class rep: 30
+  3,  8,  4,  3,  4,  5,  3,  5,  2,  10, 2,  5,  11, 6,  7,  -1,  // quitte: 107 <-> mc: 167, class rep: 22
+  9,  4,  5,  10, 6,  1,  1,  6,  7,  1,  7,  3,  -1, -1, -1, -1,  // quitte: 108 <-> mc: 172, class rep: 30
+  1,  10, 6,  1,  6,  7,  1,  7,  0,  8,  0,  7,  9,  4,  5,  -1,  // quitte: 109 <-> mc: 173, class rep: 22
+  4,  10, 0,  4,  5,  10, 0,  10, 3,  6,  7,  10, 3,  10, 7,  -1,  // quitte: 110 <-> mc: 174, class rep: 25
+  7,  10, 6,  7,  8,  10, 5,  10, 4,  4,  10, 8,  -1, -1, -1, -1,  // quitte: 111 <-> mc: 175, class rep: 6
+  6,  5,  9,  6,  9,  11, 11, 9,  8,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 112 <-> mc: 176, class rep: 7
+  3,  11, 6,  0,  3,  6,  0,  6,  5,  0,  5,  9,  -1, -1, -1, -1,  // quitte: 113 <-> mc: 177, class rep: 23
+  0,  8,  11, 0,  11, 5,  0,  5,  1,  5,  11, 6,  -1, -1, -1, -1,  // quitte: 114 <-> mc: 178, class rep: 27
+  6,  3,  11, 6,  5,  3,  5,  1,  3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 115 <-> mc: 179, class rep: 7
+  5,  9,  8,  5,  8,  2,  5,  2,  6,  3,  2,  8,  -1, -1, -1, -1,  // quitte: 116 <-> mc: 184, class rep: 29
+  9,  6,  5,  9,  0,  6,  0,  2,  6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 117 <-> mc: 185, class rep: 7
+  1,  8,  5,  1,  0,  8,  5,  8,  6,  3,  2,  8,  6,  8,  2,  -1,  // quitte: 118 <-> mc: 186, class rep: 25
+  1,  6,  5,  2,  6,  1,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 119 <-> mc: 187, class rep: 3
+  1,  10, 2,  9,  11, 5,  9,  8,  11, 11, 6,  5,  -1, -1, -1, -1,  // quitte: 120 <-> mc: 180, class rep: 30
+  0,  3,  11, 0,  11, 6,  0,  6,  9,  5,  9,  6,  1,  10, 2,  -1,  // quitte: 121 <-> mc: 181, class rep: 22
+  11, 5,  8,  11, 6,  5,  8,  5,  0,  10, 2,  5,  0,  5,  2,  -1,  // quitte: 122 <-> mc: 182, class rep: 25
+  6,  3,  11, 6,  5,  3,  2,  3,  10, 10, 3,  5,  -1, -1, -1, -1,  // quitte: 123 <-> mc: 183, class rep: 6
+  1,  6,  3,  1,  10, 6,  3,  6,  8,  5,  9,  6,  8,  6,  9,  -1,  // quitte: 124 <-> mc: 188, class rep: 25
+  10, 0,  1,  10, 6,  0,  9,  0,  5,  5,  0,  6,  -1, -1, -1, -1,  // quitte: 125 <-> mc: 189, class rep: 6
+  0,  8,  3,  5,  10, 6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 126 <-> mc: 190, class rep: 24
+  10, 6,  5,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 127 <-> mc: 191, class rep: 1
+  10, 5,  6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 128 <-> mc: 64, class rep: 1
+  0,  3,  8,  5,  6,  10, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 129 <-> mc: 65, class rep: 24
+  9,  1,  0,  5,  6,  10, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 130 <-> mc: 66, class rep: 6
+  1,  3,  8,  1,  8,  9,  5,  6,  10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 131 <-> mc: 67, class rep: 25
+  2,  11, 3,  10, 5,  6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 132 <-> mc: 72, class rep: 6
+  11, 8,  0,  11, 0,  2,  10, 5,  6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 133 <-> mc: 73, class rep: 25
+  0,  9,  1,  2,  11, 3,  5,  6,  10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 134 <-> mc: 74, class rep: 22
+  5,  6,  10, 1,  2,  9,  9,  2,  11, 9,  11, 8,  -1, -1, -1, -1,  // quitte: 135 <-> mc: 75, class rep: 30
+  1,  5,  6,  2,  1,  6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 136 <-> mc: 68, class rep: 3
+  1,  5,  6,  1,  6,  2,  3,  8,  0,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 137 <-> mc: 69, class rep: 25
+  9,  5,  6,  9,  6,  0,  0,  6,  2,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 138 <-> mc: 70, class rep: 7
+  5,  8,  9,  5,  2,  8,  5,  6,  2,  3,  8,  2,  -1, -1, -1, -1,  // quitte: 139 <-> mc: 71, class rep: 29
+  6,  11, 3,  6,  3,  5,  5,  3,  1,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 140 <-> mc: 76, class rep: 7
+  0,  11, 8,  0,  5,  11, 0,  1,  5,  5,  6,  11, -1, -1, -1, -1,  // quitte: 141 <-> mc: 77, class rep: 27
+  3,  6,  11, 0,  6,  3,  0,  5,  6,  0,  9,  5,  -1, -1, -1, -1,  // quitte: 142 <-> mc: 78, class rep: 23
+  6,  9,  5,  6,  11, 9,  11, 8,  9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 143 <-> mc: 79, class rep: 7
+  5,  6,  10, 4,  8,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 144 <-> mc: 80, class rep: 6
+  4,  0,  3,  4,  3,  7,  6,  10, 5,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 145 <-> mc: 81, class rep: 25
+  1,  0,  9,  5,  6,  10, 8,  7,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 146 <-> mc: 82, class rep: 22
+  10, 5,  6,  1,  7,  9,  1,  3,  7,  7,  4,  9,  -1, -1, -1, -1,  // quitte: 147 <-> mc: 83, class rep: 30
+  3,  2,  11, 7,  4,  8,  10, 5,  6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 148 <-> mc: 88, class rep: 22
+  5,  6,  10, 4,  2,  7,  4,  0,  2,  2,  11, 7,  -1, -1, -1, -1,  // quitte: 149 <-> mc: 89, class rep: 30
+  0,  9,  1,  4,  8,  7,  2,  11, 3,  5,  6,  10, -1, -1, -1, -1,  // quitte: 150 <-> mc: 90, class rep: 105
+  9,  1,  2,  9,  2,  11, 9,  11, 4,  7,  4,  11, 5,  6,  10, -1,  // quitte: 151 <-> mc: 91, class rep: 22
+  6,  2,  1,  6,  1,  5,  4,  8,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 152 <-> mc: 84, class rep: 25
+  1,  5,  2,  5,  6,  2,  3,  4,  0,  3,  7,  4,  -1, -1, -1, -1,  // quitte: 153 <-> mc: 85, class rep: 60
+  8,  7,  4,  9,  5,  0,  0,  5,  6,  0,  6,  2,  -1, -1, -1, -1,  // quitte: 154 <-> mc: 86, class rep: 30
+  7,  9,  3,  7,  4,  9,  3,  9,  2,  5,  6,  9,  2,  9,  6,  -1,  // quitte: 155 <-> mc: 87, class rep: 25
+  8,  7,  4,  3,  5,  11, 3,  1,  5,  5,  6,  11, -1, -1, -1, -1,  // quitte: 156 <-> mc: 92, class rep: 30
+  5,  11, 1,  5,  6,  11, 1,  11, 0,  7,  4,  11, 0,  11, 4,  -1,  // quitte: 157 <-> mc: 93, class rep: 25
+  0,  9,  5,  0,  5,  6,  0,  6,  3,  11, 3,  6,  8,  7,  4,  -1,  // quitte: 158 <-> mc: 94, class rep: 22
+  6,  9,  5,  6,  11, 9,  4,  9,  7,  7,  9,  11, -1, -1, -1, -1,  // quitte: 159 <-> mc: 95, class rep: 6
+  10, 9,  4,  6,  10, 4,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 160 <-> mc: 96, class rep: 3
+  4,  6,  10, 4,  10, 9,  0,  3,  8,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 161 <-> mc: 97, class rep: 25
+  10, 1,  0,  10, 0,  6,  6,  0,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 162 <-> mc: 98, class rep: 7
+  8,  1,  3,  8,  6,  1,  8,  4,  6,  6,  10, 1,  -1, -1, -1, -1,  // quitte: 163 <-> mc: 99, class rep: 27
+  10, 9,  4,  10, 4,  6,  11, 3,  2,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 164 <-> mc: 104, class rep: 25
+  0,  2,  8,  2,  11, 8,  4,  10, 9,  4,  6,  10, -1, -1, -1, -1,  // quitte: 165 <-> mc: 105, class rep: 60
+  3,  2,  11, 0,  6,  1,  0,  4,  6,  6,  10, 1,  -1, -1, -1, -1,  // quitte: 166 <-> mc: 106, class rep: 30
+  6,  1,  4,  6,  10, 1,  4,  1,  8,  2,  11, 1,  8,  1,  11, -1,  // quitte: 167 <-> mc: 107, class rep: 25
+  1,  9,  4,  1,  4,  2,  2,  4,  6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 168 <-> mc: 100, class rep: 7
+  3,  8,  0,  1,  9,  2,  2,  9,  4,  2,  4,  6,  -1, -1, -1, -1,  // quitte: 169 <-> mc: 101, class rep: 30
+  0,  4,  2,  4,  6,  2,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 170 <-> mc: 102, class rep: 15
+  8,  2,  3,  8,  4,  2,  4,  6,  2,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 171 <-> mc: 103, class rep: 7
+  9,  4,  6,  9,  6,  3,  9,  3,  1,  11, 3,  6,  -1, -1, -1, -1,  // quitte: 172 <-> mc: 108, class rep: 29
+  8,  1,  11, 8,  0,  1,  11, 1,  6,  9,  4,  1,  6,  1,  4,  -1,  // quitte: 173 <-> mc: 109, class rep: 25
+  3,  6,  11, 3,  0,  6,  0,  4,  6,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 174 <-> mc: 110, class rep: 7
+  6,  8,  4,  11, 8,  6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 175 <-> mc: 111, class rep: 3
+  7,  6,  10, 7,  10, 8,  8,  10, 9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 176 <-> mc: 112, class rep: 7
+  0,  3,  7,  0,  7,  10, 0,  10, 9,  6,  10, 7,  -1, -1, -1, -1,  // quitte: 177 <-> mc: 113, class rep: 29
+  10, 7,  6,  1,  7,  10, 1,  8,  7,  1,  0,  8,  -1, -1, -1, -1,  // quitte: 178 <-> mc: 114, class rep: 23
+  10, 7,  6,  10, 1,  7,  1,  3,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 179 <-> mc: 115, class rep: 7
+  2,  11, 3,  10, 8,  6,  10, 9,  8,  8,  7,  6,  -1, -1, -1, -1,  // quitte: 180 <-> mc: 120, class rep: 30
+  2,  7,  0,  2,  11, 7,  0,  7,  9,  6,  10, 7,  9,  7,  10, -1,  // quitte: 181 <-> mc: 121, class rep: 25
+  1,  0,  8,  1,  8,  7,  1,  7,  10, 6,  10, 7,  2,  11, 3,  -1,  // quitte: 182 <-> mc: 122, class rep: 22
+  11, 1,  2,  11, 7,  1,  10, 1,  6,  6,  1,  7,  -1, -1, -1, -1,  // quitte: 183 <-> mc: 123, class rep: 6
+  1,  6,  2,  1,  8,  6,  1,  9,  8,  8,  7,  6,  -1, -1, -1, -1,  // quitte: 184 <-> mc: 116, class rep: 27
+  2,  9,  6,  2,  1,  9,  6,  9,  7,  0,  3,  9,  7,  9,  3,  -1,  // quitte: 185 <-> mc: 117, class rep: 25
+  7,  0,  8,  7,  6,  0,  6,  2,  0,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 186 <-> mc: 118, class rep: 7
+  7,  2,  3,  6,  2,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 187 <-> mc: 119, class rep: 3
+  8,  6,  9,  8,  7,  6,  9,  6,  1,  11, 3,  6,  1,  6,  3,  -1,  // quitte: 188 <-> mc: 124, class rep: 25
+  0,  1,  9,  11, 7,  6,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 189 <-> mc: 125, class rep: 24
+  7,  0,  8,  7,  6,  0,  3,  0,  11, 11, 0,  6,  -1, -1, -1, -1,  // quitte: 190 <-> mc: 126, class rep: 6
+  7,  6,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 191 <-> mc: 127, class rep: 1
+  11, 10, 5,  7,  11, 5,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 192 <-> mc: 192, class rep: 3
+  11, 10, 5,  11, 5,  7,  8,  0,  3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 193 <-> mc: 193, class rep: 25
+  5,  7,  11, 5,  11, 10, 1,  0,  9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 194 <-> mc: 194, class rep: 25
+  10, 5,  7,  10, 7,  11, 9,  1,  8,  8,  1,  3,  -1, -1, -1, -1,  // quitte: 195 <-> mc: 195, class rep: 60
+  2,  10, 5,  2,  5,  3,  3,  5,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 196 <-> mc: 200, class rep: 7
+  8,  0,  2,  8,  2,  5,  8,  5,  7,  10, 5,  2,  -1, -1, -1, -1,  // quitte: 197 <-> mc: 201, class rep: 29
+  9,  1,  0,  5,  3,  10, 5,  7,  3,  3,  2,  10, -1, -1, -1, -1,  // quitte: 198 <-> mc: 202, class rep: 30
+  9,  2,  8,  9,  1,  2,  8,  2,  7,  10, 5,  2,  7,  2,  5,  -1,  // quitte: 199 <-> mc: 203, class rep: 25
+  11, 2,  1,  11, 1,  7,  7,  1,  5,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 200 <-> mc: 196, class rep: 7
+  0,  3,  8,  1,  7,  2,  1,  5,  7,  7,  11, 2,  -1, -1, -1, -1,  // quitte: 201 <-> mc: 197, class rep: 30
+  9,  5,  7,  9,  7,  2,  9,  2,  0,  2,  7,  11, -1, -1, -1, -1,  // quitte: 202 <-> mc: 198, class rep: 27
+  7,  2,  5,  7,  11, 2,  5,  2,  9,  3,  8,  2,  9,  2,  8,  -1,  // quitte: 203 <-> mc: 199, class rep: 25
+  1,  5,  3,  3,  5,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 204 <-> mc: 204, class rep: 15
+  0,  7,  8,  0,  1,  7,  1,  5,  7,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 205 <-> mc: 205, class rep: 7
+  9,  3,  0,  9,  5,  3,  5,  7,  3,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 206 <-> mc: 206, class rep: 7
+  9,  7,  8,  5,  7,  9,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 207 <-> mc: 207, class rep: 3
+  5,  4,  8,  5,  8,  10, 10, 8,  11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 208 <-> mc: 208, class rep: 7
+  5,  4,  0,  5,  0,  11, 5,  11, 10, 11, 0,  3,  -1, -1, -1, -1,  // quitte: 209 <-> mc: 209, class rep: 27
+  0,  9,  1,  8,  10, 4,  8,  11, 10, 10, 5,  4,  -1, -1, -1, -1,  // quitte: 210 <-> mc: 210, class rep: 30
+  10, 4,  11, 10, 5,  4,  11, 4,  3,  9,  1,  4,  3,  4,  1,  -1,  // quitte: 211 <-> mc: 211, class rep: 25
+  2,  10, 5,  3,  2,  5,  3,  5,  4,  3,  4,  8,  -1, -1, -1, -1,  // quitte: 212 <-> mc: 216, class rep: 23
+  5,  2,  10, 5,  4,  2,  4,  0,  2,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 213 <-> mc: 217, class rep: 7
+  3,  2,  10, 3,  10, 5,  3,  5,  8,  4,  8,  5,  0,  9,  1,  -1,  // quitte: 214 <-> mc: 218, class rep: 22
+  5,  2,  10, 5,  4,  2,  1,  2,  9,  9,  2,  4,  -1, -1, -1, -1,  // quitte: 215 <-> mc: 219, class rep: 6
+  2,  1,  5,  2,  5,  8,  2,  8,  11, 4,  8,  5,  -1, -1, -1, -1,  // quitte: 216 <-> mc: 212, class rep: 29
+  0,  11, 4,  0,  3,  11, 4,  11, 5,  2,  1,  11, 5,  11, 1,  -1,  // quitte: 217 <-> mc: 213, class rep: 25
+  0,  5,  2,  0,  9,  5,  2,  5,  11, 4,  8,  5,  11, 5,  8,  -1,  // quitte: 218 <-> mc: 214, class rep: 25
+  9,  5,  4,  2,  3,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 219 <-> mc: 215, class rep: 24
+  8,  5,  4,  8,  3,  5,  3,  1,  5,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 220 <-> mc: 220, class rep: 7
+  0,  5,  4,  1,  5,  0,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 221 <-> mc: 221, class rep: 3
+  8,  5,  4,  8,  3,  5,  9,  5,  0,  0,  5,  3,  -1, -1, -1, -1,  // quitte: 222 <-> mc: 222, class rep: 6
+  9,  5,  4,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 223 <-> mc: 223, class rep: 1
+  4,  7,  11, 4,  11, 9,  9,  11, 10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 224 <-> mc: 224, class rep: 7
+  0,  3,  8,  4,  7,  9,  9,  7,  11, 9,  11, 10, -1, -1, -1, -1,  // quitte: 225 <-> mc: 225, class rep: 30
+  1,  11, 10, 1,  4,  11, 1,  0,  4,  7,  11, 4,  -1, -1, -1, -1,  // quitte: 226 <-> mc: 226, class rep: 29
+  3,  4,  1,  3,  8,  4,  1,  4,  10, 7,  11, 4,  10, 4,  11, -1,  // quitte: 227 <-> mc: 227, class rep: 25
+  2,  10, 9,  2,  9,  7,  2,  7,  3,  7,  9,  4,  -1, -1, -1, -1,  // quitte: 228 <-> mc: 232, class rep: 27
+  9,  7,  10, 9,  4,  7,  10, 7,  2,  8,  0,  7,  2,  7,  0,  -1,  // quitte: 229 <-> mc: 233, class rep: 25
+  3,  10, 7,  3,  2,  10, 7,  10, 4,  1,  0,  10, 4,  10, 0,  -1,  // quitte: 230 <-> mc: 234, class rep: 25
+  1,  2,  10, 8,  4,  7,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 231 <-> mc: 235, class rep: 24
+  4,  7,  11, 9,  4,  11, 9,  11, 2,  9,  2,  1,  -1, -1, -1, -1,  // quitte: 232 <-> mc: 228, class rep: 23
+  9,  4,  7,  9,  7,  11, 9,  11, 1,  2,  1,  11, 0,  3,  8,  -1,  // quitte: 233 <-> mc: 229, class rep: 22
+  11, 4,  7,  11, 2,  4,  2,  0,  4,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 234 <-> mc: 230, class rep: 7
+  11, 4,  7,  11, 2,  4,  8,  4,  3,  3,  4,  2,  -1, -1, -1, -1,  // quitte: 235 <-> mc: 231, class rep: 6
+  4,  1,  9,  4,  7,  1,  7,  3,  1,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 236 <-> mc: 236, class rep: 7
+  4,  1,  9,  4,  7,  1,  0,  1,  8,  8,  1,  7,  -1, -1, -1, -1,  // quitte: 237 <-> mc: 237, class rep: 6
+  4,  3,  0,  7,  3,  4,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 238 <-> mc: 238, class rep: 3
+  4,  7,  8,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 239 <-> mc: 239, class rep: 1
+  9,  8,  10, 10, 8,  11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 240 <-> mc: 240, class rep: 15
+  3,  9,  0,  3,  11, 9,  11, 10, 9,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 241 <-> mc: 241, class rep: 7
+  0,  10, 1,  0,  8,  10, 8,  11, 10, -1, -1, -1, -1, -1, -1, -1,  // quitte: 242 <-> mc: 242, class rep: 7
+  3,  10, 1,  11, 10, 3,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 243 <-> mc: 243, class rep: 3
+  2,  8,  3,  2,  10, 8,  10, 9,  8,  -1, -1, -1, -1, -1, -1, -1,  // quitte: 244 <-> mc: 248, class rep: 7
+  9,  2,  10, 0,  2,  9,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 245 <-> mc: 249, class rep: 3
+  2,  8,  3,  2,  10, 8,  0,  8,  1,  1,  8,  10, -1, -1, -1, -1,  // quitte: 246 <-> mc: 250, class rep: 6
+  1,  2,  10, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 247 <-> mc: 251, class rep: 1
+  1,  11, 2,  1,  9,  11, 9,  8,  11, -1, -1, -1, -1, -1, -1, -1,  // quitte: 248 <-> mc: 244, class rep: 7
+  3,  9,  0,  3,  11, 9,  1,  9,  2,  2,  9,  11, -1, -1, -1, -1,  // quitte: 249 <-> mc: 245, class rep: 6
+  0,  11, 2,  8,  11, 0,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 250 <-> mc: 246, class rep: 3
+  3,  11, 2,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 251 <-> mc: 247, class rep: 1
+  1,  8,  3,  9,  8,  1,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 252 <-> mc: 252, class rep: 3
+  0,  1,  9,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 253 <-> mc: 253, class rep: 1
+  0,  8,  3,  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,  // quitte: 254 <-> mc: 254, class rep: 1
+  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1   // quitte: 255 <-> mc: 255, class rep: 0
+};
+
+// list of ambiguous cases
+constexpr int t_ambig[256] =
+{
+  0,    // quitte: 0 <-> mc: 0, class representative: 0
+  1,    // quitte: 1 <-> mc: 1, class representative: 1
+  2,    // quitte: 2 <-> mc: 2, class representative: 1
+  3,    // quitte: 3 <-> mc: 3, class representative: 3
+  4,    // quitte: 4 <-> mc: 8, class representative: 1
+  5,    // quitte: 5 <-> mc: 9, class representative: 3
+  105,  // quitte: 6 <-> mc: 10, class representative: 6
+  7,    // quitte: 7 <-> mc: 11, class representative: 7
+  8,    // quitte: 8 <-> mc: 4, class representative: 1
+  105,  // quitte: 9 <-> mc: 5, class representative: 6
+  10,   // quitte: 10 <-> mc: 6, class representative: 3
+  11,   // quitte: 11 <-> mc: 7, class representative: 7
+  12,   // quitte: 12 <-> mc: 12, class representative: 3
+  13,   // quitte: 13 <-> mc: 13, class representative: 7
+  14,   // quitte: 14 <-> mc: 14, class representative: 7
+  15,   // quitte: 15 <-> mc: 15, class representative: 15
+  16,   // quitte: 16 <-> mc: 16, class representative: 1
+  17,   // quitte: 17 <-> mc: 17, class representative: 3
+  105,  // quitte: 18 <-> mc: 18, class representative: 6
+  19,   // quitte: 19 <-> mc: 19, class representative: 7
+  105,  // quitte: 20 <-> mc: 24, class representative: 6
+  21,   // quitte: 21 <-> mc: 25, class representative: 7
+  105,  // quitte: 22 <-> mc: 26, class representative: 22
+  23,   // quitte: 23 <-> mc: 27, class representative: 23
+  105,  // quitte: 24 <-> mc: 20, class representative: 24
+  105,  // quitte: 25 <-> mc: 21, class representative: 25
+  105,  // quitte: 26 <-> mc: 22, class representative: 25
+  27,   // quitte: 27 <-> mc: 23, class representative: 27
+  105,  // quitte: 28 <-> mc: 28, class representative: 25
+  29,   // quitte: 29 <-> mc: 29, class representative: 29
+  105,  // quitte: 30 <-> mc: 30, class representative: 30
+  31,   // quitte: 31 <-> mc: 31, class representative: 7
+  32,   // quitte: 32 <-> mc: 32, class representative: 1
+  105,  // quitte: 33 <-> mc: 33, class representative: 6
+  34,   // quitte: 34 <-> mc: 34, class representative: 3
+  35,   // quitte: 35 <-> mc: 35, class representative: 7
+  105,  // quitte: 36 <-> mc: 40, class representative: 24
+  105,  // quitte: 37 <-> mc: 41, class representative: 25
+  105,  // quitte: 38 <-> mc: 42, class representative: 25
+  39,   // quitte: 39 <-> mc: 43, class representative: 29
+  105,  // quitte: 40 <-> mc: 36, class representative: 6
+  105,  // quitte: 41 <-> mc: 37, class representative: 22
+  42,   // quitte: 42 <-> mc: 38, class representative: 7
+  43,   // quitte: 43 <-> mc: 39, class representative: 23
+  105,  // quitte: 44 <-> mc: 44, class representative: 25
+  105,  // quitte: 45 <-> mc: 45, class representative: 30
+  46,   // quitte: 46 <-> mc: 46, class representative: 27
+  47,   // quitte: 47 <-> mc: 47, class representative: 7
+  48,   // quitte: 48 <-> mc: 48, class representative: 3
+  49,   // quitte: 49 <-> mc: 49, class representative: 7
+  50,   // quitte: 50 <-> mc: 50, class representative: 7
+  51,   // quitte: 51 <-> mc: 51, class representative: 15
+  105,  // quitte: 52 <-> mc: 56, class representative: 25
+  53,   // quitte: 53 <-> mc: 57, class representative: 27
+  105,  // quitte: 54 <-> mc: 58, class representative: 30
+  55,   // quitte: 55 <-> mc: 59, class representative: 7
+  105,  // quitte: 56 <-> mc: 52, class representative: 25
+  105,  // quitte: 57 <-> mc: 53, class representative: 30
+  58,   // quitte: 58 <-> mc: 54, class representative: 29
+  59,   // quitte: 59 <-> mc: 55, class representative: 7
+  105,  // quitte: 60 <-> mc: 60, class representative: 60
+  105,  // quitte: 61 <-> mc: 61, class representative: 25
+  105,  // quitte: 62 <-> mc: 62, class representative: 25
+  63,   // quitte: 63 <-> mc: 63, class representative: 3
+  64,   // quitte: 64 <-> mc: 128, class representative: 1
+  105,  // quitte: 65 <-> mc: 129, class representative: 6
+  105,  // quitte: 66 <-> mc: 130, class representative: 24
+  105,  // quitte: 67 <-> mc: 131, class representative: 25
+  68,   // quitte: 68 <-> mc: 136, class representative: 3
+  69,   // quitte: 69 <-> mc: 137, class representative: 7
+  105,  // quitte: 70 <-> mc: 138, class representative: 25
+  71,   // quitte: 71 <-> mc: 139, class representative: 27
+  105,  // quitte: 72 <-> mc: 132, class representative: 6
+  105,  // quitte: 73 <-> mc: 133, class representative: 22
+  105,  // quitte: 74 <-> mc: 134, class representative: 25
+  105,  // quitte: 75 <-> mc: 135, class representative: 30
+  76,   // quitte: 76 <-> mc: 140, class representative: 7
+  77,   // quitte: 77 <-> mc: 141, class representative: 23
+  78,   // quitte: 78 <-> mc: 142, class representative: 29
+  79,   // quitte: 79 <-> mc: 143, class representative: 7
+  80,   // quitte: 80 <-> mc: 144, class representative: 3
+  81,   // quitte: 81 <-> mc: 145, class representative: 7
+  105,  // quitte: 82 <-> mc: 146, class representative: 25
+  83,   // quitte: 83 <-> mc: 147, class representative: 29
+  84,   // quitte: 84 <-> mc: 152, class representative: 7
+  85,   // quitte: 85 <-> mc: 153, class representative: 15
+  105,  // quitte: 86 <-> mc: 154, class representative: 30
+  87,   // quitte: 87 <-> mc: 155, class representative: 7
+  105,  // quitte: 88 <-> mc: 148, class representative: 25
+  105,  // quitte: 89 <-> mc: 149, class representative: 30
+  105,  // quitte: 90 <-> mc: 150, class representative: 60
+  105,  // quitte: 91 <-> mc: 151, class representative: 25
+  92,   // quitte: 92 <-> mc: 156, class representative: 27
+  93,   // quitte: 93 <-> mc: 157, class representative: 7
+  105,  // quitte: 94 <-> mc: 158, class representative: 25
+  95,   // quitte: 95 <-> mc: 159, class representative: 3
+  105,  // quitte: 96 <-> mc: 160, class representative: 6
+  105,  // quitte: 97 <-> mc: 161, class representative: 22
+  105,  // quitte: 98 <-> mc: 162, class representative: 25
+  105,  // quitte: 99 <-> mc: 163, class representative: 30
+  105,  // quitte: 100 <-> mc: 168, class representative: 25
+  105,  // quitte: 101 <-> mc: 169, class representative: 30
+  105,  // quitte: 102 <-> mc: 170, class representative: 60
+  105,  // quitte: 103 <-> mc: 171, class representative: 25
+  105,  // quitte: 104 <-> mc: 164, class representative: 22
+  105,  // quitte: 105 <-> mc: 165, class representative: 105
+  105,  // quitte: 106 <-> mc: 166, class representative: 30
+  105,  // quitte: 107 <-> mc: 167, class representative: 22
+  105,  // quitte: 108 <-> mc: 172, class representative: 30
+  105,  // quitte: 109 <-> mc: 173, class representative: 22
+  105,  // quitte: 110 <-> mc: 174, class representative: 25
+  105,  // quitte: 111 <-> mc: 175, class representative: 6
+  112,  // quitte: 112 <-> mc: 176, class representative: 7
+  113,  // quitte: 113 <-> mc: 177, class representative: 23
+  114,  // quitte: 114 <-> mc: 178, class representative: 27
+  115,  // quitte: 115 <-> mc: 179, class representative: 7
+  116,  // quitte: 116 <-> mc: 184, class representative: 29
+  117,  // quitte: 117 <-> mc: 185, class representative: 7
+  105,  // quitte: 118 <-> mc: 186, class representative: 25
+  119,  // quitte: 119 <-> mc: 187, class representative: 3
+  105,  // quitte: 120 <-> mc: 180, class representative: 30
+  105,  // quitte: 121 <-> mc: 181, class representative: 22
+  105,  // quitte: 122 <-> mc: 182, class representative: 25
+  105,  // quitte: 123 <-> mc: 183, class representative: 6
+  105,  // quitte: 124 <-> mc: 188, class representative: 25
+  105,  // quitte: 125 <-> mc: 189, class representative: 6
+  105,  // quitte: 126 <-> mc: 190, class representative: 24
+  127,  // quitte: 127 <-> mc: 191, class representative: 1
+  128,  // quitte: 128 <-> mc: 64, class representative: 1
+  105,  // quitte: 129 <-> mc: 65, class representative: 24
+  105,  // quitte: 130 <-> mc: 66, class representative: 6
+  105,  // quitte: 131 <-> mc: 67, class representative: 25
+  105,  // quitte: 132 <-> mc: 72, class representative: 6
+  105,  // quitte: 133 <-> mc: 73, class representative: 25
+  105,  // quitte: 134 <-> mc: 74, class representative: 22
+  105,  // quitte: 135 <-> mc: 75, class representative: 30
+  136,  // quitte: 136 <-> mc: 68, class representative: 3
+  105,  // quitte: 137 <-> mc: 69, class representative: 25
+  138,  // quitte: 138 <-> mc: 70, class representative: 7
+  139,  // quitte: 139 <-> mc: 71, class representative: 29
+  140,  // quitte: 140 <-> mc: 76, class representative: 7
+  141,  // quitte: 141 <-> mc: 77, class representative: 27
+  142,  // quitte: 142 <-> mc: 78, class representative: 23
+  143,  // quitte: 143 <-> mc: 79, class representative: 7
+  105,  // quitte: 144 <-> mc: 80, class representative: 6
+  105,  // quitte: 145 <-> mc: 81, class representative: 25
+  105,  // quitte: 146 <-> mc: 82, class representative: 22
+  105,  // quitte: 147 <-> mc: 83, class representative: 30
+  105,  // quitte: 148 <-> mc: 88, class representative: 22
+  105,  // quitte: 149 <-> mc: 89, class representative: 30
+  105,  // quitte: 150 <-> mc: 90, class representative: 105
+  105,  // quitte: 151 <-> mc: 91, class representative: 22
+  105,  // quitte: 152 <-> mc: 84, class representative: 25
+  105,  // quitte: 153 <-> mc: 85, class representative: 60
+  105,  // quitte: 154 <-> mc: 86, class representative: 30
+  105,  // quitte: 155 <-> mc: 87, class representative: 25
+  105,  // quitte: 156 <-> mc: 92, class representative: 30
+  105,  // quitte: 157 <-> mc: 93, class representative: 25
+  105,  // quitte: 158 <-> mc: 94, class representative: 22
+  105,  // quitte: 159 <-> mc: 95, class representative: 6
+  160,  // quitte: 160 <-> mc: 96, class representative: 3
+  105,  // quitte: 161 <-> mc: 97, class representative: 25
+  162,  // quitte: 162 <-> mc: 98, class representative: 7
+  163,  // quitte: 163 <-> mc: 99, class representative: 27
+  105,  // quitte: 164 <-> mc: 104, class representative: 25
+  105,  // quitte: 165 <-> mc: 105, class representative: 60
+  105,  // quitte: 166 <-> mc: 106, class representative: 30
+  105,  // quitte: 167 <-> mc: 107, class representative: 25
+  168,  // quitte: 168 <-> mc: 100, class representative: 7
+  105,  // quitte: 169 <-> mc: 101, class representative: 30
+  170,  // quitte: 170 <-> mc: 102, class representative: 15
+  171,  // quitte: 171 <-> mc: 103, class representative: 7
+  172,  // quitte: 172 <-> mc: 108, class representative: 29
+  105,  // quitte: 173 <-> mc: 109, class representative: 25
+  174,  // quitte: 174 <-> mc: 110, class representative: 7
+  175,  // quitte: 175 <-> mc: 111, class representative: 3
+  176,  // quitte: 176 <-> mc: 112, class representative: 7
+  177,  // quitte: 177 <-> mc: 113, class representative: 29
+  178,  // quitte: 178 <-> mc: 114, class representative: 23
+  179,  // quitte: 179 <-> mc: 115, class representative: 7
+  105,  // quitte: 180 <-> mc: 120, class representative: 30
+  105,  // quitte: 181 <-> mc: 121, class representative: 25
+  105,  // quitte: 182 <-> mc: 122, class representative: 22
+  105,  // quitte: 183 <-> mc: 123, class representative: 6
+  184,  // quitte: 184 <-> mc: 116, class representative: 27
+  105,  // quitte: 185 <-> mc: 117, class representative: 25
+  186,  // quitte: 186 <-> mc: 118, class representative: 7
+  187,  // quitte: 187 <-> mc: 119, class representative: 3
+  105,  // quitte: 188 <-> mc: 124, class representative: 25
+  105,  // quitte: 189 <-> mc: 125, class representative: 24
+  105,  // quitte: 190 <-> mc: 126, class representative: 6
+  191,  // quitte: 191 <-> mc: 127, class representative: 1
+  192,  // quitte: 192 <-> mc: 192, class representative: 3
+  105,  // quitte: 193 <-> mc: 193, class representative: 25
+  105,  // quitte: 194 <-> mc: 194, class representative: 25
+  105,  // quitte: 195 <-> mc: 195, class representative: 60
+  196,  // quitte: 196 <-> mc: 200, class representative: 7
+  197,  // quitte: 197 <-> mc: 201, class representative: 29
+  105,  // quitte: 198 <-> mc: 202, class representative: 30
+  105,  // quitte: 199 <-> mc: 203, class representative: 25
+  200,  // quitte: 200 <-> mc: 196, class representative: 7
+  105,  // quitte: 201 <-> mc: 197, class representative: 30
+  202,  // quitte: 202 <-> mc: 198, class representative: 27
+  105,  // quitte: 203 <-> mc: 199, class representative: 25
+  204,  // quitte: 204 <-> mc: 204, class representative: 15
+  205,  // quitte: 205 <-> mc: 205, class representative: 7
+  206,  // quitte: 206 <-> mc: 206, class representative: 7
+  207,  // quitte: 207 <-> mc: 207, class representative: 3
+  208,  // quitte: 208 <-> mc: 208, class representative: 7
+  209,  // quitte: 209 <-> mc: 209, class representative: 27
+  105,  // quitte: 210 <-> mc: 210, class representative: 30
+  105,  // quitte: 211 <-> mc: 211, class representative: 25
+  212,  // quitte: 212 <-> mc: 216, class representative: 23
+  213,  // quitte: 213 <-> mc: 217, class representative: 7
+  105,  // quitte: 214 <-> mc: 218, class representative: 22
+  105,  // quitte: 215 <-> mc: 219, class representative: 6
+  216,  // quitte: 216 <-> mc: 212, class representative: 29
+  105,  // quitte: 217 <-> mc: 213, class representative: 25
+  105,  // quitte: 218 <-> mc: 214, class representative: 25
+  105,  // quitte: 219 <-> mc: 215, class representative: 24
+  220,  // quitte: 220 <-> mc: 220, class representative: 7
+  221,  // quitte: 221 <-> mc: 221, class representative: 3
+  105,  // quitte: 222 <-> mc: 222, class representative: 6
+  223,  // quitte: 223 <-> mc: 223, class representative: 1
+  224,  // quitte: 224 <-> mc: 224, class representative: 7
+  105,  // quitte: 225 <-> mc: 225, class representative: 30
+  226,  // quitte: 226 <-> mc: 226, class representative: 29
+  105,  // quitte: 227 <-> mc: 227, class representative: 25
+  228,  // quitte: 228 <-> mc: 232, class representative: 27
+  105,  // quitte: 229 <-> mc: 233, class representative: 25
+  105,  // quitte: 230 <-> mc: 234, class representative: 25
+  105,  // quitte: 231 <-> mc: 235, class representative: 24
+  232,  // quitte: 232 <-> mc: 228, class representative: 23
+  105,  // quitte: 233 <-> mc: 229, class representative: 22
+  234,  // quitte: 234 <-> mc: 230, class representative: 7
+  105,  // quitte: 235 <-> mc: 231, class representative: 6
+  236,  // quitte: 236 <-> mc: 236, class representative: 7
+  105,  // quitte: 237 <-> mc: 237, class representative: 6
+  238,  // quitte: 238 <-> mc: 238, class representative: 3
+  239,  // quitte: 239 <-> mc: 239, class representative: 1
+  240,  // quitte: 240 <-> mc: 240, class representative: 15
+  241,  // quitte: 241 <-> mc: 241, class representative: 7
+  242,  // quitte: 242 <-> mc: 242, class representative: 7
+  243,  // quitte: 243 <-> mc: 243, class representative: 3
+  244,  // quitte: 244 <-> mc: 248, class representative: 7
+  245,  // quitte: 245 <-> mc: 249, class representative: 3
+  105,  // quitte: 246 <-> mc: 250, class representative: 6
+  247,  // quitte: 247 <-> mc: 251, class representative: 1
+  248,  // quitte: 248 <-> mc: 244, class representative: 7
+  105,  // quitte: 249 <-> mc: 245, class representative: 6
+  250,  // quitte: 250 <-> mc: 246, class representative: 3
+  251,  // quitte: 251 <-> mc: 247, class representative: 1
+  252,  // quitte: 252 <-> mc: 252, class representative: 3
+  253,  // quitte: 253 <-> mc: 253, class representative: 1
+  254,  // quitte: 254 <-> mc: 254, class representative: 1
+  255   // quitte: 255 <-> mc: 255, class representative: 0
+};
+
+/* The asymptotic decider can be unstable if certain corner points have similar function values.
+*
+*/
+constexpr int asymptotic_remap[][11] = {
+  {0, 1, 2, 3, 4, 5, 6, 7, 0b0000, 0b0001, 0b0010}, // regular, 4th bit invert coordinates, 3th bit swap coordinates, first two bits axis of coordinates
+  {0, 2, 4, 6, 1, 3, 5, 7, 0b0110, 0b0100, 0b0001}, // rot 0-7
+  {0, 4, 1, 5, 2, 6, 3, 7, 0b0101, 0b0010, 0b0100}, // 2# rot 0-7
+  {3, 1, 7, 5, 2, 0, 6, 4, 0b1110, 0b1100, 0b0001}, // rot 1-6 (0, 3, 5) (2, 7, 4)
+  {5, 1, 4, 0, 7, 3, 6, 2, 0b1101, 0b0010, 0b1100}, // 2# rot 1-6
+  {3, 7, 2, 6, 1, 5, 0, 4, 0b1101, 0b1010, 0b0100}, // rot 2-5 (0, 3, 6) (1, 4, 7)
+  {6, 4, 2, 0, 7, 5, 3, 1, 0b0110, 0b1100, 0b1001}, // 2# rot 2-5 (0, 3, 6) (1, 4, 7)
+  {5, 7, 1, 3, 4, 6, 0, 2, 0b1110, 0b0100, 0b1001}, // rot 3-4 (1, 2, 7) (0, 5, 6)
+  {6, 2, 7, 3, 4, 0, 5, 1, 0b0101, 0b1010, 0b1100}, // 2# rot 3-4 (1, 2, 7) (0, 5, 6)
+  {7, 6, 5, 4, 3, 2, 1, 0, 0b1100, 0b1101, 0b1110} // mirrored regular
+};
+
+} // namespace Cube_table
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_TABLES_H
\ No newline at end of file
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/topologically_correct_marching_cubes_functors.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/topologically_correct_marching_cubes_functors.h
new file mode 100644
index 00000000000..1b6449edca3
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/internal/topologically_correct_marching_cubes_functors.h
@@ -0,0 +1,1249 @@
+// Copyright (c) 2020 INRIA Sophia-Antipolis (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: ( GPL-3.0-or-later OR LicenseRef-Commercial ) AND MIT
+//
+// Author(s)     : Julian Stahl
+//
+// This file incorporates work covered by the following copyright and permission notice:
+//
+//     MIT License
+//
+//     Copyright (c) 2020 Roberto Grosso
+//
+//     Permission is hereby granted, free of charge, to any person obtaining a copy
+//     of this software and associated documentation files (the "Software"), to deal
+//     in the Software without restriction, including without limitation the rights
+//     to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//     copies of the Software, and to permit persons to whom the Software is
+//     furnished to do so, subject to the following conditions:
+//
+//     The above copyright notice and this permission notice shall be included in all
+//     copies or substantial portions of the Software.
+//
+//     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//     IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//     FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//     AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//     OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//     SOFTWARE.
+//
+//
+// The code below uses the version of
+// https://github.com/rogrosso/tmc available on 15th of September 2022.
+//
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_TMC_FUNCTORS_H
+#define CGAL_ISOSURFACING_3_INTERNAL_TMC_FUNCTORS_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/marching_cubes_functors.h>
+#include <CGAL/Isosurfacing_3/internal/tables.h>
+#include <CGAL/number_utils.h>
+
+#ifdef CGAL_LINKED_WITH_TBB
+# include <tbb/concurrent_vector.h>
+# include <tbb/concurrent_hash_map.h>
+#endif
+
+#include <array>
+#include <cmath>
+
+namespace CGAL {
+namespace Isosurfacing {
+namespace internal {
+
+template <typename Domain_,
+          typename PointRange,
+          typename PolygonRange>
+class TMC_functor
+{
+private:
+  using Domain = Domain_;
+  using Point_range = PointRange;
+  using Polygon_range = PolygonRange;
+
+  using Geom_traits = typename Domain::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+
+  using edge_descriptor = typename Domain::edge_descriptor;
+  using cell_descriptor = typename Domain::cell_descriptor;
+
+  using Point_index = std::size_t;
+  using Edge_index = std::array<std::size_t, 4>;
+
+#ifdef CGAL_LINKED_WITH_TBB
+  using Triangles = tbb::enumerable_thread_specific<std::vector<std::array<Point_3, 3> > >;
+#else
+  using Triangles = std::vector<std::array<Point_3, 3> >;
+#endif
+
+private:
+  const Domain& m_domain;
+  FT m_isovalue;
+  bool m_isovalue_nudging;
+  bool m_constrain_to_cell;
+
+  Triangles m_triangles;
+
+public:
+  TMC_functor(const Domain& domain,
+              const FT isovalue,
+              const bool isovalue_nudging = true,
+              const bool constrain_to_cell = true)
+    : m_domain(domain),
+      m_isovalue(isovalue),
+      m_isovalue_nudging(isovalue_nudging),
+      m_constrain_to_cell(constrain_to_cell)
+  { }
+
+  // returns the created triangle list
+  Triangles& triangles()
+  {
+    return m_triangles;
+  }
+  void operator()(const cell_descriptor& cell) {
+    std::array<FT, 8> values;
+    std::array<Point_3, 8> corners;
+    const std::size_t i_case = get_cell_corners(m_domain, cell, m_isovalue, corners, values, m_isovalue_nudging);
+
+    // skip empty / full cells
+    constexpr std::size_t ones = (1 << 8) - 1;
+    if((i_case & ones) == ones || // all bits set
+       (i_case & ones) == 0) // no bits set
+      return;
+
+    // this is the only difference to the default Marching Cubes
+    const int tcm = Cube_table::t_ambig[i_case];
+    if(tcm == 105)
+    {
+      if(p_slice(cell, m_isovalue, corners, values, i_case))
+        return;
+#ifdef CGAL_ISOSURFACING_3_MC_FUNCTORS_DEBUG
+      else
+        std::cerr << "WARNING: the result might not be topologically correct" << std::endl;
+#endif
+    }
+
+    std::array<Point_3, 12> vertices;
+    MC_construct_vertices(cell, i_case, corners, values, m_isovalue, m_domain, vertices);
+
+    // construct triangles
+#ifdef CGAL_LINKED_WITH_TBB
+    auto& local_triangles = m_triangles.local();
+#else
+    auto& local_triangles = m_triangles;
+#endif
+    for(int t=0; t<16; t+=3)
+    {
+      const std::size_t t_index = i_case * 16 + t;
+
+      if(Cube_table::triangle_cases[t_index] == -1)
+        break;
+
+      const int eg0 = Cube_table::triangle_cases[t_index + 0];
+      const int eg1 = Cube_table::triangle_cases[t_index + 1];
+      const int eg2 = Cube_table::triangle_cases[t_index + 2];
+
+      local_triangles.push_back({vertices[eg2], vertices[eg1], vertices[eg0]});
+    }
+  }
+
+  // returns the created triangle list
+  template<typename PR, typename TR>
+  void to_triangle_soup(PR& points, TR& triangles) const
+  {
+#ifdef CGAL_LINKED_WITH_TBB
+    for(const auto& triangle_list : m_triangles)
+    {
+#else
+      const auto& triangle_list = m_triangles;
+#endif
+      for(const auto& triangle : triangle_list)
+      {
+        const std::size_t id = points.size();
+
+        points.push_back(triangle[0]);
+        points.push_back(triangle[1]);
+        points.push_back(triangle[2]);
+
+        triangles.push_back({id + 2, id + 1, id + 0});
+
+        CGAL_assertion(triangles.back().size() == 3);
+      }
+#ifdef CGAL_LINKED_WITH_TBB
+    }
+#endif
+  }
+
+private:
+  Edge_index compute_edge_index(const cell_descriptor& cell, int edge)
+  {
+    // edge is in 0 - 11
+
+    // there are 12 edges, assign to each vertex three edges, the global edge numbering
+    // consists of 3*global_vertex_id + edge_offset.
+    const unsigned long long gei_pattern_ = 670526590282893600ull;
+
+    // the edge global index is given by the vertex global index + the edge offset
+    const std::size_t shift = 5 * edge;
+    const std::size_t ix = cell[0] + ((gei_pattern_ >> shift) & 1);        // global_edge_id[edge][0];
+    const std::size_t iy = cell[1] + ((gei_pattern_ >> (shift + 1)) & 1);  // global_edge_id[edge][1];
+    const std::size_t iz = cell[2] + ((gei_pattern_ >> (shift + 2)) & 1);  // global_edge_id[edge][2];
+    const std::size_t off_val =      ((gei_pattern_ >> (shift + 3)) & 3);
+
+    return { ix, iy, iz, off_val };
+  }
+
+  void add_triangle(const Point_3& p0,
+                    const Point_3& p1,
+                    const Point_3& p2)
+  {
+#ifdef CGAL_LINKED_WITH_TBB
+    auto& local_triangles = m_triangles.local();
+    local_triangles.push_back({p0, p1, p2});
+#else
+    m_triangles.push_back({p0, p1, p2});
+#endif
+  }
+
+  void face_intersections(const std::array<FT, 8>& values, const std::size_t idx, const FT i0, FT& a, FT& b, FT& c, FT& d) {
+    const int *remap = internal::Cube_table::asymptotic_remap[idx];
+
+    a = (values[remap[1]] - values[remap[0]]) * (values[remap[6]] - values[remap[7]]) + (values[remap[2]] - values[remap[3]]) * (values[remap[4]] - values[remap[5]]);
+    b = (i0 - values[remap[0]]) * (-values[remap[6]] + values[remap[7]] + values[remap[4]] - values[remap[5]]) +
+      (values[remap[0]] - values[remap[1]]) * (values[remap[6]] - values[remap[4]]) -
+      (i0 - values[remap[4]]) * (-values[remap[2]] + values[remap[3]] + values[remap[0]] - values[remap[1]]) -
+      (values[remap[4]] - values[remap[5]]) * (values[remap[2]] - values[remap[0]]);
+    c = (i0 - values[remap[0]]) * (values[remap[6]] - values[remap[4]]) - (i0 - values[remap[4]]) * (values[remap[2]] - values[remap[0]]);
+
+    d = b * b - FT(4) * a * c;
+  }
+
+  bool calc_coordinates(const std::array<FT, 8>& values, const std::size_t idx, const FT i0, const FT a, const FT b, const FT d, const std::vector<bool> &f_flag, unsigned char &q_sol, FT ui[2], FT vi[2], FT wi[2]) {
+    const int* remap = internal::Cube_table::asymptotic_remap[idx];
+    FT d2 = sqrt(CGAL::to_double(d));
+
+    // compute u-coord of solutions
+    ui[0] = (-b - d2) / (FT(2) * a);
+    ui[1] = (-b + d2) / (FT(2) * a);
+
+    // compute v-coord of solutions
+    FT g1 = values[remap[0]] * (FT(1) - ui[0]) + values[remap[1]] * ui[0];
+    FT g2 = values[remap[2]] * (FT(1) - ui[0]) + values[remap[3]] * ui[0];
+    vi[0] = (i0 - g1) / (g2 - g1);
+
+    g1 = values[remap[0]] * (FT(1) - ui[1]) + values[remap[1]] * ui[1];
+    g2 = values[remap[2]] * (FT(1) - ui[1]) + values[remap[3]] * ui[1];
+    vi[1] = (i0 - g1) / (g2 - g1);
+
+    // compute w-coordinates of solutions
+    g1 = values[remap[0]] * (FT(1) - ui[0]) + values[remap[1]] * ui[0];
+    g2 = values[remap[4]] * (FT(1) - ui[0]) + values[remap[5]] * ui[0];
+    wi[0] = (i0 - g1) / (g2 - g1);
+
+    g1 = values[remap[0]] * (FT(1) - ui[1]) + values[remap[1]] * ui[1];
+    g2 = values[remap[4]] * (FT(1) - ui[1]) + values[remap[5]] * ui[1];
+    wi[1] = (i0 - g1) / (g2 - g1);
+
+    if (((remap[8] & 0b0011) != 0b0000) || ((remap[9] & 0b0011) != 0b0001) || ((remap[10] & 0b0011) != 0b0010)) {
+      FT tmp[3][2] = { { ui[0], ui[1] }, { vi[0], vi[1] }, { wi[0], wi[1] } };
+
+      ui[0] = tmp[remap[8] & 0b0011][0];
+      ui[1] = tmp[remap[8] & 0b0011][1];
+      vi[0] = tmp[remap[9] & 0b0011][0];
+      vi[1] = tmp[remap[9] & 0b0011][1];
+      wi[0] = tmp[remap[10] & 0b0011][0];
+      wi[1] = tmp[remap[10] & 0b0011][1];
+    }
+
+    if (remap[8] & 0b1000) {
+      ui[0] = 1 - ui[0];
+      ui[1] = 1 - ui[1];
+    }
+
+    if (remap[8] & 0b0100)
+      std::swap(ui[0], ui[1]);
+
+    if (remap[9] & 0b1000) {
+      vi[0] = 1 - vi[0];
+      vi[1] = 1 - vi[1];
+    }
+
+    if (remap[9] & 0b0100)
+      std::swap(vi[0], vi[1]);
+
+    if (remap[10] & 0b1000) {
+      wi[0] = 1 - wi[0];
+      wi[1] = 1 - wi[1];
+    }
+
+    if (remap[10] & 0b0100)
+      std::swap(wi[0], wi[1]);
+
+    if (std::isnan(CGAL::to_double(vi[0])) || std::isinf(CGAL::to_double(vi[0])))
+      vi[0] = FT(-1);
+    if (std::isnan(CGAL::to_double(vi[1])) || std::isinf(CGAL::to_double(vi[1])))
+      vi[1] = FT(-1);
+
+    if (std::isnan(CGAL::to_double(wi[0])) || std::isinf(CGAL::to_double(wi[0])))
+      wi[0] = FT(-1);
+    if (std::isnan(CGAL::to_double(wi[1])) || std::isinf(CGAL::to_double(wi[1])))
+      wi[1] = FT(-1);
+
+    // correct values for roots of quadratic equations
+    // in case the asymptotic decider has failed
+    if (f_flag[0]) {  // face 1, w = 0;
+      if (wi[0] < wi[1])
+        wi[0] = FT(0);
+      else
+        wi[1] = FT(0);
+    }
+
+    if (f_flag[1]) {  // face 2, w = 1
+      if (wi[0] > wi[1])
+        wi[1] = FT(1);
+      else
+        wi[1] = FT(1);
+    }
+
+    if (f_flag[2]) {  // face 3, v = 0
+      if (vi[0] < vi[1])
+        vi[0] = FT(0);
+      else
+        vi[1] = FT(0);
+    }
+
+    if (f_flag[3]) {  // face 4, v = 1
+      if (vi[0] > vi[1])
+        vi[0] = FT(1);
+      else
+        vi[1] = FT(1);
+    }
+
+    if (f_flag[4]) {  // face 5, u = 0
+      if (ui[0] < ui[1])
+        ui[0] = FT(0);
+      else
+        ui[1] = FT(0);
+    }
+
+    if (f_flag[5]) {  // face 6, u = 1
+      if (ui[0] > ui[1])
+        ui[0] = FT(1);
+      else
+        ui[1] = FT(1);
+    }
+
+    // check solution intervals
+    if (FT(0) < ui[0] && ui[0] < FT(1))
+      q_sol |= 1;
+
+    if (0 < ui[1] && ui[1] < 1)
+      q_sol |= 2;
+
+    if (0 < vi[0] && vi[0] < 1)
+      q_sol |= 4;
+
+    if (0 < vi[1] && vi[1] < 1)
+      q_sol |= 8;
+
+    if (0 < wi[0] && wi[0] < 1)
+      q_sol |= 16;
+
+    if (0 < wi[1] && wi[1] < 1)
+      q_sol |= 32;
+
+    return true;
+  }
+
+  bool p_slice(const cell_descriptor& /*cell*/,
+               const FT i0,
+               const std::array<Point_3, 8>& corners,
+               std::array<FT, 8>& values,
+               const std::size_t i_case)
+  {
+    typename Geom_traits::Compute_x_3 x_coord = m_domain.geom_traits().compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = m_domain.geom_traits().compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = m_domain.geom_traits().compute_z_3_object();
+    typename Geom_traits::Construct_point_3 point = m_domain.geom_traits().construct_point_3_object();
+
+    // code edge end vertices for each of the 12 edges
+    const unsigned char l_edges_[12] = {16, 49, 50, 32, 84, 117, 118, 100, 64, 81, 115, 98};
+    auto get_edge_vertex = [](const int e, unsigned int& v0, unsigned int& v1, const unsigned char l_edges_[12])
+    {
+      v0 = (unsigned int)(l_edges_[e] & 0xF);
+      v1 = (unsigned int)(l_edges_[e] >> 4) & 0xF;
+    };
+
+    // A hexahedron has twelve edges, save the intersection of the isosurface with the edge
+    std::array<Point_3, 12> vertices;
+
+    // save local coordinate along the edge of intersection point
+    std::vector<FT> ecoord(12, FT(0));
+
+    // collect vertices
+    unsigned short flag{1};
+    for(int eg = 0; eg < 12; ++eg)
+    {
+      if(flag & Cube_table::intersected_edges[i_case])
+      {
+        // generate vertex here
+        unsigned int v0, v1;
+        get_edge_vertex(eg, v0, v1, l_edges_);
+
+        std::tie(vertices[eg], ecoord[eg]) = vertex_interpolation(corners[v0], corners[v1],
+                                                                  values[v0], values[v1],
+                                                                  i0, m_domain.geom_traits());
+      }
+
+      // next edge
+      flag <<= 1;
+    }
+
+    // compute oriented contours
+    //
+    // A contour consists of segments at the faces connecting the intersection of the
+    // isosurface with the edges. For each edge, we store the edge to which the segment
+    // is outgoing and the edge from which the segment in coming. Therefore, a contour
+    // can be reconstructed by connecting the edges in the direction of the outgoing.
+    // The contour is oriented in such a way that the positive vertices are outside.
+    // 1. build segments
+    // 2. connect segments
+    // build up segments
+    // set segments map
+    unsigned char segm_[12] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF};
+    auto set_segm = [](const int e, const int pos, const int val, unsigned char segm_[12])
+    {
+      if(pos == 0)
+      {
+        segm_[e] &= 0xF0;
+        segm_[e] |= (unsigned char)val & 0xF;
+      }
+       else if(pos == 1)
+       {
+        segm_[e] &= 0xF;
+        segm_[e] |= val << 4;
+      }
+    };
+
+    auto get_segm = [](const int e, const int pos, unsigned char segm_[12]) -> int
+    {
+      if(pos == 0)
+        return int(segm_[e] & 0xF);
+      else
+        return int((segm_[e] >> 4) & 0xF);
+    };
+
+    auto is_segm_set = [](const int e, unsigned char segm_[12]) { return (segm_[e] != 0xFF); };
+    auto unset_segm = [](const int e, unsigned char segm_[12]) { segm_[e] = 0xFF; };
+
+    // In order to compute oriented segments, the hexahedron must be flattened.
+    // The inside of the faces of the hexahedron must be all on the same
+    // side of the flattened hexahedron. This requires changing the order of
+    // the edges when reading from the faces
+    // code edges at face
+    // unsigned short face_e_[6] = { 12816, 30292, 33936, 46754, 34739, 38305 };
+    std::array<unsigned short, 6> e_face_{{291, 18277, 18696, 10859, 33719, 38305}};
+
+    // code vertices at face
+    // unsigned short face_v_[6] = { 12816, 30292, 21520, 30258, 25632, 30001 };
+    std::array<unsigned short, 6> v_face_{{12576, 25717, 5380, 29538, 8292, 30001}};
+
+    // reading edge from face
+    auto get_face_e = [e_face_](const int f, const int e) { return ((e_face_[f] >> (4 * e)) & 0xF); };
+    auto get_face_v = [v_face_](const int f, const int e) { return ((v_face_[f] >> (4 * e)) & 0xF); };
+
+    // compute oriented segments using the isoline scheme at the faces
+    const unsigned int BIT_1 = 1;
+    const unsigned int BIT_2 = 2;
+    const unsigned int BIT_3 = 4;
+    const unsigned int BIT_4 = 8;
+    auto asymptotic_decider = [](const FT f0, const FT f1, const FT f2, const FT f3) -> FT
+    {
+      return (f0 * f3 - f1 * f2) / (f0 + f3 - f1 - f2);
+    };
+
+    std::vector<bool> f_flag(6, false);
+    for(int f=0; f<6; ++f)
+    {
+      // classify face
+      unsigned int f_case = 0;
+      unsigned int v0 = get_face_v(f, 0);
+      unsigned int v1 = get_face_v(f, 1);
+      unsigned int v2 = get_face_v(f, 2);
+      unsigned int v3 = get_face_v(f, 3);
+      unsigned int e0 = get_face_e(f, 0);
+      unsigned int e1 = get_face_e(f, 1);
+      unsigned int e2 = get_face_e(f, 2);
+      unsigned int e3 = get_face_e(f, 3);
+      FT f0 = values[v0];
+      FT f1 = values[v1];
+      FT f2 = values[v2];
+      FT f3 = values[v3];
+      if(f0 >= i0) f_case |= BIT_1;
+      if(f1 >= i0) f_case |= BIT_2;
+      if(f2 >= i0) f_case |= BIT_3;
+      if(f3 >= i0) f_case |= BIT_4;
+
+      switch (f_case)
+      {
+        case 1:
+          set_segm(e0, 0, e3, segm_);
+          set_segm(e3, 1, e0, segm_);
+        break;
+        case 2:
+          set_segm(e1, 0, e0, segm_);
+          set_segm(e0, 1, e1, segm_);
+        break;
+        case 3:
+          set_segm(e1, 0, e3, segm_);
+          set_segm(e3, 1, e1, segm_);
+        break;
+        case 4:
+          set_segm(e3, 0, e2, segm_);
+          set_segm(e2, 1, e3, segm_);
+        break;
+        case 5:
+          set_segm(e0, 0, e2, segm_);
+          set_segm(e2, 1, e0, segm_);
+        break;
+        case 6:
+        {
+          const FT val = asymptotic_decider(f0, f1, f2, f3);
+          if(val > i0)
+          {
+            set_segm(e3, 0, e0, segm_);
+            set_segm(e0, 1, e3, segm_);
+            set_segm(e1, 0, e2, segm_);
+            set_segm(e2, 1, e1, segm_);
+          }
+          else if(val < i0)
+          {
+            set_segm(e1, 0, e0, segm_);
+            set_segm(e0, 1, e1, segm_);
+            set_segm(e3, 0, e2, segm_);
+            set_segm(e2, 1, e3, segm_);
+          }
+          else
+          {
+            f_flag[f] = true;
+            // singular case val == i0, there are no asymptotes
+            // check if there is a reasonable triangulation of the face
+            const unsigned short e_flag = 0x218;
+            const unsigned short bit_1 = 0x1;
+            const unsigned short bit_2 = 0x2;
+            FT ec0 = ecoord[e0];
+            FT ec1 = ecoord[e1];
+            FT ec2 = ecoord[e2];
+            FT ec3 = ecoord[e3];
+
+            if((e_flag >> (f * 2)) & bit_1)
+            {
+              ec0 = FT(1) - ec0;
+              ec2 = FT(1) - ec2;
+            }
+
+            if((e_flag >> (f * 2)) & bit_2)
+            {
+              ec1 = FT(1) - ec1;
+              ec3 = FT(1) - ec3;
+            }
+
+            if(ec1 < ec3 && ec0 > ec2)
+            {
+              set_segm(e1, 0, e0, segm_);
+              set_segm(e0, 1, e1, segm_);
+              set_segm(e3, 0, e2, segm_);
+              set_segm(e2, 1, e3, segm_);
+            }
+            else if(ec1 > ec3 && ec0 < ec2)
+            {
+              set_segm(e3, 0, e0, segm_);
+              set_segm(e0, 1, e3, segm_);
+              set_segm(e1, 0, e2, segm_);
+              set_segm(e2, 1, e1, segm_);
+            }
+            else
+            {
+              // std::cerr << "ERROR: can't correctly triangulate cell's face\n";
+              return false;
+            }
+          }
+        }
+        break;
+        case 7:
+          set_segm(e1, 0, e2, segm_);
+          set_segm(e2, 1, e1, segm_);
+        break;
+        case 8:
+          set_segm(e2, 0, e1, segm_);
+          set_segm(e1, 1, e2, segm_);
+        break;
+        case 9:
+        {
+          const FT val = asymptotic_decider(f0, f1, f2, f3);
+          if(val > i0)
+          {
+            set_segm(e0, 0, e1, segm_);
+            set_segm(e1, 1, e0, segm_);
+            set_segm(e2, 0, e3, segm_);
+            set_segm(e3, 1, e2, segm_);
+          }
+          else if(val < i0)
+          {
+            set_segm(e0, 0, e3, segm_);
+            set_segm(e3, 1, e0, segm_);
+            set_segm(e2, 0, e1, segm_);
+            set_segm(e1, 1, e2, segm_);
+          }
+          else
+          {
+            f_flag[f] = true;
+            // singular case val == i0, there are no asymptotes
+            // check if there is a reasonable triangulation of the face
+            const unsigned short e_flag = 0x218;
+            const unsigned short bit_1 = 0x1;
+            const unsigned short bit_2 = 0x2;
+            FT ec0 = ecoord[e0];
+            FT ec1 = ecoord[e1];
+            FT ec2 = ecoord[e2];
+            FT ec3 = ecoord[e3];
+
+            if((e_flag >> (f * 2)) & bit_1)
+            {
+              ec0 = FT(1) - ec0;
+              ec2 = FT(1) - ec2;
+            }
+
+            if((e_flag >> (f * 2)) & bit_2)
+            {
+              ec1 = FT(1) - ec1;
+              ec3 = FT(1) - ec3;
+            }
+
+            if(ec1 < ec3 && ec0 > ec2)
+            {
+              set_segm(e0, 0, e1, segm_);
+              set_segm(e1, 1, e0, segm_);
+              set_segm(e2, 0, e3, segm_);
+              set_segm(e3, 1, e2, segm_);
+            }
+            else if(ec1 > ec3 && ec0 < ec2)
+            {
+              set_segm(e0, 0, e3, segm_);
+              set_segm(e3, 1, e0, segm_);
+              set_segm(e2, 0, e1, segm_);
+              set_segm(e1, 1, e2, segm_);
+            }
+             else
+            {
+              // std::cerr << "ERROR: can't correctly triangulate cell's face\n";
+              return false;
+            }
+          }
+        }
+        break;
+        case 10:
+          set_segm(e2, 0, e0, segm_);
+          set_segm(e0, 1, e2, segm_);
+        break;
+        case 11:
+          set_segm(e2, 0, e3, segm_);
+          set_segm(e3, 1, e2, segm_);
+        break;
+        case 12:
+          set_segm(e3, 0, e1, segm_);
+          set_segm(e1, 1, e3, segm_);
+        break;
+        case 13:
+          set_segm(e0, 0, e1, segm_);
+          set_segm(e1, 1, e0, segm_);
+        break;
+        case 14:
+          set_segm(e3, 0, e0, segm_);
+          set_segm(e0, 1, e3, segm_);
+        break;
+        default:
+        break;
+      }
+    }
+
+    // connect oriented segments into oriented contours
+    //
+    // closed contours are coded in 64 bit unsigned long long
+    // 1) Each entry has 4 bits
+    // 2) The first 4 entries are reserved for the size of the contours
+    // 3) The next 12 entries are the indices of the edges constituting the contorus
+    //    The indices are numbers from 0 to 12
+    unsigned long long c_ = 0xFFFFFFFFFFFF0000;
+
+    // in the 4 first bits store size of contours
+    auto get_cnt_size = [](const int cnt, unsigned long long& c_) -> size_t
+    {
+      return size_t((c_ & (0xF << 4 * cnt)) >> 4 * cnt);
+    };
+
+    auto set_cnt_size = [](const int cnt, const int size, unsigned long long& c_)
+    {
+      // unset contour size
+      c_ &= ~(0xF << 4 * cnt);
+      c_ |= (size << 4 * cnt);
+    };
+
+    // set corresponding edge
+    auto set_c = [](const int cnt, const int pos, const int val, unsigned long long& c_)
+    {
+      const unsigned int mask[4] = {0x0, 0xF, 0xFF, 0xFFF};
+      const unsigned int c_sz = c_ & mask[cnt];
+      const unsigned int e = 16 + 4 * ((c_sz & 0xF) + ((c_sz & 0xF0) >> 4) + ((c_sz & 0xF00) >> 8) + pos);
+      c_ &= ~(((unsigned long long)0xF) << e);
+      c_ |= (((unsigned long long)val) << e);
+    };
+
+    // read edge from contour
+    auto get_c = [](const int cnt, const int pos, unsigned long long c_) -> int
+    {
+      const unsigned int mask[4] = {0x0, 0xF, 0xFF, 0xFFF};
+      const unsigned int c_sz = (unsigned int)(c_ & mask[cnt]);
+      const unsigned int e = 16 + 4 * ((c_sz & 0xF) + ((c_sz & 0xF0) >> 4) + ((c_sz & 0xF00) >> 8) + pos);
+      return int((c_ >> e) & 0xF);
+    };
+
+    // connect oriented contours
+    unsigned int cnt_ = 0;
+    for(unsigned int e=0; e<12; ++e)
+    {
+      if(is_segm_set(e, segm_))
+      {
+        unsigned int eTo = get_segm(e, 0, segm_);
+        unsigned int eIn = get_segm(e, 1, segm_);
+        unsigned int eStart = e;
+        unsigned int pos = 0;
+        set_c(cnt_, pos, eStart, c_);
+
+        while(eTo != eStart)
+        {
+          pos = pos + 1;
+          set_c(cnt_, pos, eTo, c_);
+          eIn = eTo;
+          eTo = get_segm(eIn, 0, segm_);
+          unset_segm(eIn, segm_);
+        }
+
+        // set contour length
+        set_cnt_size(cnt_, pos + 1, c_);
+
+        // update number of contours
+        cnt_ = cnt_ + 1;
+      }
+    }
+
+    // counts the number of set bits
+    auto numberOfSetBits = [](const unsigned char n)
+      {
+        // C or C++: use uint32_t
+        unsigned int b = (unsigned int)(n);
+        b = b - ((b >> 1) & 0x55555555);
+        b = (b & 0x33333333) + ((b >> 2) & 0x33333333);
+        return (((b + (b >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
+      };
+
+    // compute the number of solutions to the quadratic equation for a given face
+    auto nrQSolFace = [](const unsigned int f, const unsigned char n)
+      {
+        unsigned int nr = 0;
+        switch (f)
+        {
+        case 0:
+          if ((n & 0x5) == 0x5) nr = nr + 1;
+          if ((n & 0xA) == 0xA) nr = nr + 1;
+          break;
+        case 1:
+          if ((n & 0x11) == 0x11) nr = nr + 1;
+          if ((n & 0x22) == 0x22) nr = nr + 1;
+          break;
+        case 2:
+          if ((n & 0x18) == 0x18) nr = nr + 1;
+          if ((n & 0x24) == 0x24) nr = nr + 1;
+          break;
+        }
+        return nr;
+      };
+
+    // compute intersection of opposite faces
+    //
+    // It is sufficient to compute a pair of solutions for one face
+    // The other solutions are obtained by evaluating the equations
+    // for the common variable
+
+    FT ui[2]{};
+    FT vi[2]{};
+    FT wi[2]{};
+    unsigned char q_sol = 0;
+
+    FT a, b, c, d;
+    std::size_t idx = 0;
+    unsigned char nr_u, nr_v, nr_w, nr_t;
+    for (; idx < 10; idx++) {
+      face_intersections(values, idx, i0, a, b, c, d);
+
+      if (!calc_coordinates(values, idx, i0, a, b, d, f_flag, q_sol, ui, vi, wi))
+        continue;
+
+      bool ui_invalid = !std::isfinite(CGAL::to_double(ui[0])) || !std::isfinite(CGAL::to_double(ui[1]));
+
+      nr_u = nrQSolFace(0, q_sol);
+      nr_v = nrQSolFace(1, q_sol);
+      nr_w = nrQSolFace(2, q_sol);
+      nr_t = (nr_u + nr_v + nr_w);
+
+      if (get_cnt_size(0, c_) == 7 && (ui_invalid || nr_t == nr_u || nr_t == nr_v || nr_t == nr_w))
+        continue;
+
+      if (ui_invalid && q_sol != 0) {
+        if (!(nr_t == nr_u || nr_t == nr_v || nr_t == nr_w))
+          continue;
+
+        if (numberOfSetBits(q_sol) == 6)
+          continue;
+      }
+
+      break;
+    }
+
+    // triangulate contours
+    //
+    // if all bits are set, then there are three pairs of nontrivial solutions
+    // to the quadratic equations. In this case, there is a tunnel or a contour
+    // with 12 vertices. If there are three contours, then there is a tunnel and
+    // one of the contours with only three vertices is not part of it.
+    if(numberOfSetBits(q_sol) == 6)
+    {
+      // there are at most three contours
+      // Possible cases:
+      //  1) a single contour with 12 vertices
+      //  2) two contours which build a tunnel
+      //  3) three contours, one has only 3 vertices and does not belong to the tunnel
+
+      // construct the six vertices of the inner hexagon
+      FT hvt[6][3];
+      hvt[0][0] = ui[0];
+      hvt[0][1] = vi[0];
+      hvt[0][2] = wi[0];
+      hvt[1][0] = ui[0];
+      hvt[1][1] = vi[0];
+      hvt[1][2] = wi[1];
+      hvt[2][0] = ui[1];
+      hvt[2][1] = vi[0];
+      hvt[2][2] = wi[1];
+      hvt[3][0] = ui[1];
+      hvt[3][1] = vi[1];
+      hvt[3][2] = wi[1];
+      hvt[4][0] = ui[1];
+      hvt[4][1] = vi[1];
+      hvt[4][2] = wi[0];
+      hvt[5][0] = ui[0];
+      hvt[5][1] = vi[1];
+      hvt[5][2] = wi[0];
+
+      // construct vertices at intersections with the edges
+      auto e_vert = [&ecoord](const int e, const int i) -> FT
+      {
+        const unsigned int l_coord[3]{1324855, 5299420, 16733440};
+        const unsigned char flag = (l_coord[i] >> (2 * e)) & 3;
+        if(flag == 3)
+          return ecoord[e];
+        else
+          return FT(flag);
+      };
+
+      // if there are three contours, then there is a tunnel and one
+      // of the contours is not part of it.
+      unsigned char _not_tunnel = 0xF;
+      if(cnt_ == 3)
+      {
+        // loop over the contours
+        // triangulate the contour which is not part of
+        // the tunnel
+        const FT uc_min = (ui[0] < ui[1]) ? ui[0] : ui[1];
+        const FT uc_max = (ui[0] < ui[1]) ? ui[1] : ui[0];
+        for(int t=0; t < (int)cnt_; ++t)
+        {
+          if(get_cnt_size(t, c_) == 3)
+          {
+            FT umin(2);
+            FT umax(-2);
+            const unsigned int e0 = get_c(t, 0, c_);
+            const unsigned int e1 = get_c(t, 1, c_);
+            const unsigned int e2 = get_c(t, 2, c_);
+            const FT u_e0 = e_vert(e0, 0);
+            const FT u_e1 = e_vert(e1, 0);
+            const FT u_e2 = e_vert(e2, 0);
+            umin = (u_e0 < umin) ? u_e0 : umin;
+            umin = (u_e1 < umin) ? u_e1 : umin;
+            umin = (u_e2 < umin) ? u_e2 : umin;
+            umax = (u_e0 > umax) ? u_e0 : umax;
+            umax = (u_e1 > umax) ? u_e1 : umax;
+            umax = (u_e2 > umax) ? u_e1 : umax;
+            if(uc_min > umax || uc_max < umin)
+            {
+              // this contour is not part of the tunnel
+              _not_tunnel = t;
+
+              add_triangle(vertices[e0], vertices[e1], vertices[e2]);
+            }
+          }
+        }
+      }
+
+      // compute vertices of inner hexagon, save new vertices in list and compute and keep
+      // global vertices index to build triangle connectivity later on.
+      std::array<Point_3, 6> tg_idx;
+      for(int i=0; i<6; ++i)
+      {
+        FT u = hvt[i][0];
+        FT v = hvt[i][1];
+        FT w = hvt[i][2];
+
+        if (m_constrain_to_cell) {
+          u = u < 0.05 ? 0.05 : (u > 0.95 ? 0.95 : u);
+          v = v < 0.05 ? 0.05 : (v > 0.95 ? 0.95 : v);
+          w = w < 0.05 ? 0.05 : (w > 0.95 ? 0.95 : w);
+        }
+
+        const FT px = (FT(1) - w) * ((FT(1) - v) * (x_coord(corners[0]) + u * (x_coord(corners[1]) - x_coord(corners[0]))) +
+                                               v * (x_coord(corners[2]) + u * (x_coord(corners[3]) - x_coord(corners[2])))) +
+                                w * ((FT(1) - v) * (x_coord(corners[4]) + u * (x_coord(corners[5]) - x_coord(corners[4]))) +
+                                               v * (x_coord(corners[6]) + u * (x_coord(corners[7]) - x_coord(corners[6]))));
+        const FT py = (FT(1) - w) * ((FT(1) - v) * (y_coord(corners[0]) + u * (y_coord(corners[1]) - y_coord(corners[0]))) +
+                                               v * (y_coord(corners[2]) + u * (y_coord(corners[3]) - y_coord(corners[2])))) +
+                                w * ((FT(1) - v) * (y_coord(corners[4]) + u * (y_coord(corners[5]) - y_coord(corners[4]))) +
+                                               v * (y_coord(corners[6]) + u * (y_coord(corners[7]) - y_coord(corners[6]))));
+        const FT pz = (FT(1) - w) * ((FT(1) - v) * (z_coord(corners[0]) + u * (z_coord(corners[1]) - z_coord(corners[0]))) +
+                                               v * (z_coord(corners[2]) + u * (z_coord(corners[3]) - z_coord(corners[2])))) +
+                                w * ((FT(1) - v) * (z_coord(corners[4]) + u * (z_coord(corners[5]) - z_coord(corners[4]))) +
+                                               v * (z_coord(corners[6]) + u * (z_coord(corners[7]) - z_coord(corners[6]))));
+
+        tg_idx[i] = point(px, py, pz);
+      }
+
+      // triangulate contours with inner hexagon
+      unsigned char tcon_[12];
+      for(int i=0; i<(int)cnt_; ++i)
+      {
+        if(_not_tunnel != i)
+        {
+          // contour belongs to tunnel
+          const int cnt_sz = int(get_cnt_size(i, c_));
+          for(int r=0; r<cnt_sz; ++r)
+          {
+            unsigned int index = -1;
+            FT dist = (std::numeric_limits<double>::max)();
+            unsigned int ci = get_c(i, r, c_);
+            const FT u_edge = e_vert(ci, 0);
+            const FT v_edge = e_vert(ci, 1);
+            const FT w_edge = e_vert(ci, 2);
+            for(int s=0; s<6; ++s)
+            {
+              const FT uval = u_edge - hvt[s][0];
+              const FT vval = v_edge - hvt[s][1];
+              const FT wval = w_edge - hvt[s][2];
+              FT val = uval * uval + vval * vval + wval * wval;
+              if(dist > val)
+              {
+                index = s;
+                dist = val;
+              }
+            }
+
+            tcon_[ci] = (unsigned char)(index);
+          }
+
+          // correspondence between vertices found
+          // create triangles
+          // needs some functions
+          auto distanceRingIntsModulo = [](const int d1, const int d2)
+          {
+            const int r = (d1 - d2) < 0 ? d2 - d1 : d1 - d2;
+            return (r > 2 ? 6 - r : r);
+          };
+
+          auto midpointRingIntModulo = [](const int d1, const int d2)
+          {
+            const int dmax = (d1 > d2) ? d1 : d2;
+            const int dmin = (d1 < d2) ? d1 : d2;
+            return ((dmax + 2) % 6 == dmin) ? (dmax + 1) % 6 : (dmax + dmin) / 2;
+          };
+
+          for(int r=0; r<cnt_sz; ++r)
+          {
+            const unsigned int tid1 = get_c(i, r, c_);
+            const unsigned int tid2 = get_c(i, ((r + 1) % cnt_sz), c_);
+            const unsigned int cid1 = tcon_[tid1];
+            const unsigned int cid2 = tcon_[tid2];
+
+            // compute index distance
+            const int dst = distanceRingIntsModulo(cid1, cid2);
+            switch(dst)
+            {
+              case 0:
+                add_triangle(vertices[tid1], vertices[tid2], tg_idx[cid1]);
+              break;
+              case 1:
+              {
+                // measure diagonals
+                // triangulate along shortest diagonal
+                FT u_edge = e_vert(tid1, 0);
+                FT v_edge = e_vert(tid1, 1);
+                FT w_edge = e_vert(tid1, 2);
+                const FT l1 = (u_edge - hvt[cid2][0]) * (u_edge - hvt[cid2][0]) +
+                              (v_edge - hvt[cid2][1]) * (v_edge - hvt[cid2][1]) +
+                              (w_edge - hvt[cid2][2]) * (w_edge - hvt[cid2][2]);
+                u_edge = e_vert(tid2, 0);
+                v_edge = e_vert(tid2, 1);
+                w_edge = e_vert(tid2, 2);
+                const FT l2 = (u_edge - hvt[cid1][0]) * (u_edge - hvt[cid1][0]) +
+                              (v_edge - hvt[cid1][1]) * (v_edge - hvt[cid1][1]) +
+                              (w_edge - hvt[cid1][2]) * (w_edge - hvt[cid1][2]);
+
+                if(l1 < l2)
+                {
+                  add_triangle(vertices[tid1], vertices[tid2], tg_idx[cid2]);
+                  add_triangle(vertices[tid1], tg_idx[cid2], tg_idx[cid1]);
+                }
+                else
+                {
+                  add_triangle(vertices[tid1], vertices[tid2], tg_idx[cid1]);
+                  add_triangle(vertices[tid2], tg_idx[cid2], tg_idx[cid1]);
+                }
+              }
+              break;
+              case 2:
+              {
+                const int cidm = midpointRingIntModulo(cid1, cid2);
+
+                add_triangle(vertices[tid1], vertices[tid2], tg_idx[cidm]);
+                add_triangle(vertices[tid1], tg_idx[cidm], tg_idx[cid1]);
+                add_triangle(vertices[tid2], tg_idx[cid2], tg_idx[cidm]);
+              }
+              break;
+            } // switch
+          } // for loop over the vertices of the contour
+        } // if(_not_tunnel)
+      } // for loop over contours
+
+      if(cnt_ == 1)
+      {
+        // there is a single contour
+        // triangulate and close inner hexagon
+        // triangle must have the correct orientation
+        // use asymptotic_decider() to see if positive vertices
+        // are separated, in this case orientation must be changed
+        const bool s_ = (asymptotic_decider(values[0], values[1], values[2], values[3]) <= i0);
+        const bool of_ = (wi[1] < wi[0]) ? s_ : !s_;
+
+        if(!of_)
+        {
+          add_triangle(tg_idx[0], tg_idx[2], tg_idx[1]);
+          add_triangle(tg_idx[2], tg_idx[4], tg_idx[3]);
+          add_triangle(tg_idx[0], tg_idx[5], tg_idx[4]);
+          add_triangle(tg_idx[0], tg_idx[4], tg_idx[2]);
+        }
+        else
+        {
+          add_triangle(tg_idx[0], tg_idx[1], tg_idx[2]);
+          add_triangle(tg_idx[2], tg_idx[3], tg_idx[4]);
+          add_triangle(tg_idx[0], tg_idx[4], tg_idx[5]);
+          add_triangle(tg_idx[0], tg_idx[2], tg_idx[4]);
+        }
+      }
+    }
+    else
+    {
+      // there is no tunnel
+      // handle case with no saddle point as simple polygons with 3, 4, 5 or six vertices
+      const unsigned char nr_u{(unsigned char)nrQSolFace(0, q_sol)};
+      const unsigned char nr_v{(unsigned char)nrQSolFace(1, q_sol)};
+      const unsigned char nr_w{(unsigned char)nrQSolFace(2, q_sol)};
+      const unsigned char nr_t{(unsigned char)(nr_u + nr_v + nr_w)};
+      if(nr_t == nr_u || nr_t == nr_v || nr_t == nr_w)
+      {
+        // loop over all contours
+        for(int i=0; i<(int)cnt_; ++i)
+        {
+          switch (get_cnt_size(i, c_))
+          {
+            case 3:
+            {
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 1, c_)],
+                           vertices[get_c(i, 2, c_)]);
+            }
+            break;
+            case 4:
+            {
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 1, c_)],
+                           vertices[get_c(i, 2, c_)]);
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 2, c_)],
+                           vertices[get_c(i, 3, c_)]);
+            }
+            break;
+            case 5:
+            {
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 1, c_)],
+                           vertices[get_c(i, 2, c_)]);
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 2, c_)],
+                           vertices[get_c(i, 3, c_)]);
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 3, c_)],
+                           vertices[get_c(i, 4, c_)]);
+            }
+            break;
+            case 6:
+            {
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 1, c_)],
+                           vertices[get_c(i, 3, c_)]);
+              add_triangle(vertices[get_c(i, 1, c_)], vertices[get_c(i, 2, c_)],
+                           vertices[get_c(i, 3, c_)]);
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 3, c_)],
+                           vertices[get_c(i, 4, c_)]);
+              add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 4, c_)],
+                           vertices[get_c(i, 5, c_)]);
+            }
+            break;
+            default:
+              std::cout << "Contour size " << get_cnt_size(i, c_) << " not supported\n";
+              break;
+          } // switch over size of contour
+        } // loop over contorus
+      }
+      else // there are no saddle points
+      {
+        // there are saddle points
+        // fc1 = fs(1, 1)*fs(2, 1) + fs(1, 2)*fs(2, 2);
+        // fc2 = fs(1, 1)*fs(3, 1) + fs(1, 2)*fs(3, 2);
+        // fc3 = fs(2, 1)*fs(3, 2) + fs(2, 2)*fs(3, 1);
+        using uchar = unsigned char;  // @todo
+
+        unsigned char fs[3][2]{{(uchar)(q_sol & 1), (uchar)((q_sol >> 1) & 1)},
+                               {(uchar)((q_sol >> 2) & 1), (uchar)((q_sol >> 3) & 1)},
+                               {(uchar)((q_sol >> 4) & 1), (uchar)((q_sol >> 5) & 1)}};
+
+        const unsigned char fc1 = fs[0][0] * fs[1][0] + fs[0][1] * fs[1][1];
+        const unsigned char fc2 = fs[0][0] * fs[2][0] + fs[0][1] * fs[2][1];
+        const unsigned char fc3 = fs[1][0] * fs[2][1] + fs[1][1] * fs[2][0];
+        const unsigned char c_faces = fc1 + fc2 + fc3;
+        FT ucoord{};
+        FT vcoord{};
+        FT wcoord{};
+        switch(c_faces)
+        {
+          case 2:
+          {
+            if(fc1 == 0)
+            {
+              ucoord = fs[0][0] * ui[0] + fs[0][1] * ui[1];
+              vcoord = fs[1][0] * vi[0] + fs[1][1] * vi[1];
+              wcoord = fs[1][0] * wi[1] + fs[1][1] * wi[0];
+            }
+            else if(fc2 == 0)
+            {
+              ucoord = fs[0][0] * ui[0] + fs[0][1] * ui[1];
+              vcoord = fs[0][0] * vi[0] + fs[0][1] * vi[1];
+              wcoord = fs[0][0] * wi[1] + fs[0][1] * wi[0];
+            }
+            else if(fc3 == 0)
+            {
+              ucoord = fs[1][0] * ui[0] + fs[1][1] * ui[1];
+              vcoord = fs[1][0] * vi[0] + fs[1][1] * vi[1];
+              wcoord = fs[1][0] * wi[0] + fs[1][1] * wi[1];
+            }
+          }
+          break;
+          case 3:
+          {
+            ucoord = (fs[0][0] * ui[0] + fs[0][1] * ui[1]) / (fs[0][0] + fs[0][1]);
+            vcoord = (fs[1][0] * vi[0] + fs[1][1] * vi[1]) / (fs[1][0] + fs[1][1]);
+            wcoord = (fs[2][0] * wi[0] + fs[2][1] * wi[1]) / (fs[2][0] + fs[2][1]);
+          }
+          break;
+          case 4:
+          {
+            const unsigned char nr_u = fs[0][0] + fs[0][1];
+            const unsigned char nr_v = fs[1][0] + fs[1][1];
+            const unsigned char nr_w = fs[2][0] + fs[2][1];
+            if(nr_w == 1)
+            {
+              ucoord = fs[2][0] * ui[0] + fs[2][1] * ui[1];
+              vcoord = fs[2][1] * vi[0] + fs[2][0] * vi[1];
+              wcoord = fs[2][0] * wi[0] + fs[2][1] * wi[1];
+            }
+            else if(nr_v == 1)
+            {
+              ucoord = fs[1][0] * ui[0] + fs[1][1] * ui[1];
+              vcoord = fs[1][0] * vi[0] + fs[1][1] * vi[1];
+              wcoord = fs[1][1] * wi[0] + fs[1][0] * wi[1];
+            }
+            else if(nr_u == 1)
+            {
+              ucoord = fs[0][0] * ui[0] + fs[0][1] * ui[1];
+              vcoord = fs[0][0] * vi[0] + fs[0][1] * vi[1];
+              wcoord = fs[0][0] * wi[0] + fs[0][1] * wi[1];
+            }
+          }
+          break;
+        } // switch(c_faces)
+
+        if (m_constrain_to_cell) {
+          ucoord = ucoord < 0.05 ? 0.05 : (ucoord > 0.95 ? 0.95 : ucoord);
+          vcoord = vcoord < 0.05 ? 0.05 : (vcoord > 0.95 ? 0.95 : vcoord);
+          wcoord = wcoord < 0.05 ? 0.05 : (wcoord > 0.95 ? 0.95 : wcoord);
+        }
+
+        // create inner vertex
+        const FT px = (FT(1) - wcoord) * ((FT(1) - vcoord) * (x_coord(corners[0]) + ucoord * (x_coord(corners[1]) - x_coord(corners[0]))) +
+                                                    vcoord * (x_coord(corners[2]) + ucoord * (x_coord(corners[3]) - x_coord(corners[2])))) +
+                                wcoord * ((FT(1) - vcoord) * (x_coord(corners[4]) + ucoord * (x_coord(corners[5]) - x_coord(corners[4]))) +
+                                                    vcoord * (x_coord(corners[6]) + ucoord * (x_coord(corners[7]) - x_coord(corners[6]))));
+        const FT py = (FT(1) - wcoord) * ((FT(1) - vcoord) * (y_coord(corners[0]) + ucoord * (y_coord(corners[1]) - y_coord(corners[0]))) +
+                                                    vcoord * (y_coord(corners[2]) + ucoord * (y_coord(corners[3]) - y_coord(corners[2])))) +
+                                wcoord * ((FT(1) - vcoord) * (y_coord(corners[4]) + ucoord * (y_coord(corners[5]) - y_coord(corners[4]))) +
+                                                    vcoord * (y_coord(corners[6]) + ucoord * (y_coord(corners[7]) - y_coord(corners[6]))));
+        const FT pz = (FT(1) - wcoord) * ((FT(1) - vcoord) * (z_coord(corners[0]) + ucoord * (z_coord(corners[1]) - z_coord(corners[0]))) +
+                                                    vcoord * (z_coord(corners[2]) + ucoord * (z_coord(corners[3]) - z_coord(corners[2])))) +
+                                wcoord * ((FT(1) - vcoord) * (z_coord(corners[4]) + ucoord * (z_coord(corners[5]) - z_coord(corners[4]))) +
+                                                    vcoord * (z_coord(corners[6]) + ucoord * (z_coord(corners[7]) - z_coord(corners[6]))));
+
+        // loop over the contours
+        for(int i=0; i<int(cnt_); ++i)
+        {
+          const unsigned char cnt_sz = (unsigned char)get_cnt_size(i, c_);
+          if(cnt_sz == 3)
+          {
+            add_triangle(vertices[get_c(i, 0, c_)], vertices[get_c(i, 1, c_)], vertices[get_c(i, 2, c_)]);
+          }
+          else
+          {
+            for(int t=0; t<cnt_sz; ++t)
+              add_triangle(vertices[get_c(i, t, c_)],
+                           vertices[get_c(i, (t + 1) % cnt_sz, c_)],
+                           point(px, py, pz));
+          }
+        }
+      }
+    }
+    return true;
+  }
+};
+
+} // namespace internal
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_TMC_FUNCTORS_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/interpolation_schemes_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/interpolation_schemes_3.h
new file mode 100644
index 00000000000..9be0f723843
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/interpolation_schemes_3.h
@@ -0,0 +1,241 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_INTERNAL_INTERPOLATION_SCHEMES_3_H
+#define CGAL_ISOSURFACING_3_INTERNAL_INTERPOLATION_SCHEMES_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/number_utils.h>
+#include <CGAL/enum.h>
+
+#include <array>
+#include <vector>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/*!
+ * \ingroup IS_Fields_helpers_grp
+ *
+ * \cgalModels{IsosurfacingInterpolationScheme_3}
+ *
+ * The class `Trilinear_interpolation` is the standard interpolation scheme
+ * to define continuous fields of scalar values and gradients from data defined
+ * only at the vertices of a %Cartesian grid.
+ *
+ * \tparam Grid must be `CGAL::Isosurfacing::Cartesian_grid_3<GeomTraits>`, with `GeomTraits`
+ *              a model of `IsosurfacingTraits_3`
+ */
+template <typename Grid>
+class Trilinear_interpolation
+{
+public:
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+  using Iso_cuboid_3 = typename Geom_traits::Iso_cuboid_3;
+
+public:
+  /*!
+   * \brief interpolates the values at a given point using trilinear interpolation.
+   *
+   * \param p the point at which values are interpolated
+   * \param g the grid
+   * \param values the continuous field of scalar values, defined over the geometric span of `g`
+   */
+  FT interpolated_value(const Point_3& p,
+                        const Grid& g,
+                        const std::vector<FT>& values) const
+{
+    typename Geom_traits::Compute_x_3 x_coord = g.geom_traits().compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = g.geom_traits().compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = g.geom_traits().compute_z_3_object();
+    typename Geom_traits::Construct_vertex_3 vertex = g.geom_traits().construct_vertex_3_object();
+
+    // trilinear interpolation of stored values
+    const Iso_cuboid_3& span = g.span();
+    const Vector_3& spacing = g.spacing();
+
+    // calculate min index including border case
+    const Point_3& min_p = vertex(span, 0);
+    std::size_t i = std::size_t(CGAL::to_double((x_coord(p) - x_coord(min_p)) / x_coord(spacing)));
+    std::size_t j = std::size_t(CGAL::to_double((y_coord(p) - y_coord(min_p)) / y_coord(spacing)));
+    std::size_t k = std::size_t(CGAL::to_double((z_coord(p) - z_coord(min_p)) / z_coord(spacing)));
+
+    if(i == g.xdim() - 1)
+      --i;
+    if(j == g.ydim() - 1)
+      --j;
+    if(k == g.zdim() - 1)
+      --k;
+
+    // calculate coordinates of min index
+    const FT min_x = x_coord(min_p) + FT(i) * spacing[0];
+    const FT min_y = y_coord(min_p) + FT(j) * spacing[1];
+    const FT min_z = z_coord(min_p) + FT(k) * spacing[2];
+
+    // interpolation factors between 0 and 1
+    const FT f_i = std::clamp<FT>((x_coord(p) - min_x) / spacing[0], 0, 1);
+    const FT f_j = std::clamp<FT>((y_coord(p) - min_y) / spacing[1], 0, 1);
+    const FT f_k = std::clamp<FT>((z_coord(p) - min_z) / spacing[2], 0, 1);
+
+    // read the value at all 8 corner points
+    const FT g000 = values[g.linear_index(i + 0, j + 0, k + 0)];
+    const FT g001 = values[g.linear_index(i + 0, j + 0, k + 1)];
+    const FT g010 = values[g.linear_index(i + 0, j + 1, k + 0)];
+    const FT g011 = values[g.linear_index(i + 0, j + 1, k + 1)];
+    const FT g100 = values[g.linear_index(i + 1, j + 0, k + 0)];
+    const FT g101 = values[g.linear_index(i + 1, j + 0, k + 1)];
+    const FT g110 = values[g.linear_index(i + 1, j + 1, k + 0)];
+    const FT g111 = values[g.linear_index(i + 1, j + 1, k + 1)];
+
+    // interpolate along all axes by weighting the corner points
+    const FT lambda000 = (FT(1) - f_i) * (FT(1) - f_j) * (FT(1) - f_k);
+    const FT lambda001 = (FT(1) - f_i) * (FT(1) - f_j) * f_k;
+    const FT lambda010 = (FT(1) - f_i) * f_j * (FT(1) - f_k);
+    const FT lambda011 = (FT(1) - f_i) * f_j * f_k;
+    const FT lambda100 = f_i * (FT(1) - f_j) * (FT(1) - f_k);
+    const FT lambda101 = f_i * (FT(1) - f_j) * f_k;
+    const FT lambda110 = f_i * f_j * (FT(1) - f_k);
+    const FT lambda111 = f_i * f_j * f_k;
+
+    // add weighted corners
+    return g000 * lambda000 + g001 * lambda001 +
+           g010 * lambda010 + g011 * lambda011 +
+           g100 * lambda100 + g101 * lambda101 +
+           g110 * lambda110 + g111 * lambda111;
+  }
+
+  /*!
+   * \brief interpolates the gradients at a given point using trilinear interpolation.
+   *
+   * \param p the point at which to interpolate the gradients
+   * \param g the grid
+   * \param gradients the continuous field of vector values, defined over the geometric span of `g`
+   */
+  Vector_3 interpolated_gradient(const Point_3& p,
+                                 const Grid& g,
+                                 const std::vector<Vector_3>& gradients) const
+  {
+    typename Geom_traits::Compute_x_3 x_coord = g.geom_traits().compute_x_3_object();
+    typename Geom_traits::Compute_y_3 y_coord = g.geom_traits().compute_y_3_object();
+    typename Geom_traits::Compute_z_3 z_coord = g.geom_traits().compute_z_3_object();
+    typename Geom_traits::Construct_vector_3 vector = g.geom_traits().construct_vector_3_object();
+    typename Geom_traits::Construct_vertex_3 vertex = g.geom_traits().construct_vertex_3_object();
+
+    // trilinear interpolation of stored gradients
+    const Iso_cuboid_3& span = g.span();
+    const Vector_3& spacing = g.spacing();
+
+    // calculate min index including border case
+    const Point_3& min_p = vertex(span, 0);
+    std::size_t i = static_cast<std::size_t>((x_coord(p) - x_coord(min_p)) / x_coord(spacing));
+    std::size_t j = static_cast<std::size_t>((y_coord(p) - y_coord(min_p)) / y_coord(spacing));
+    std::size_t k = static_cast<std::size_t>((z_coord(p) - z_coord(min_p)) / z_coord(spacing));
+
+    if(i == g.xdim() - 1) // dim is the point number
+      --i;
+    if(j == g.ydim() - 1)
+      --j;
+    if(k == g.zdim() - 1)
+      --k;
+
+    // calculate coordinates of min index
+    const FT min_x = i * spacing[0] + x_coord(min_p);
+    const FT min_y = j * spacing[1] + y_coord(min_p);
+    const FT min_z = k * spacing[2] + z_coord(min_p);
+
+    // interpolation factors between 0 and 1
+    const FT f_i = std::clamp<FT>((x_coord(p) - min_x) / spacing[0], 0, 1);
+    const FT f_j = std::clamp<FT>((y_coord(p) - min_y) / spacing[1], 0, 1);
+    const FT f_k = std::clamp<FT>((z_coord(p) - min_z) / spacing[2], 0, 1);
+
+    // read the value at all 8 corner points
+    const Vector_3& g000 = gradients[g.linear_index(i + 0, j + 0, k + 0)];
+    const Vector_3& g001 = gradients[g.linear_index(i + 0, j + 0, k + 1)];
+    const Vector_3& g010 = gradients[g.linear_index(i + 0, j + 1, k + 0)];
+    const Vector_3& g011 = gradients[g.linear_index(i + 0, j + 1, k + 1)];
+    const Vector_3& g100 = gradients[g.linear_index(i + 1, j + 0, k + 0)];
+    const Vector_3& g101 = gradients[g.linear_index(i + 1, j + 0, k + 1)];
+    const Vector_3& g110 = gradients[g.linear_index(i + 1, j + 1, k + 0)];
+    const Vector_3& g111 = gradients[g.linear_index(i + 1, j + 1, k + 1)];
+
+    // interpolate along all axes by weighting the corner points
+    const FT lambda000 = (FT(1) - f_i) * (FT(1) - f_j) * (FT(1) - f_k);
+    const FT lambda001 = (FT(1) - f_i) * (FT(1) - f_j) * f_k;
+    const FT lambda010 = (FT(1) - f_i) * f_j * (FT(1) - f_k);
+    const FT lambda011 = (FT(1) - f_i) * f_j * f_k;
+    const FT lambda100 = f_i * (FT(1) - f_j) * (FT(1) - f_k);
+    const FT lambda101 = f_i * (FT(1) - f_j) * f_k;
+    const FT lambda110 = f_i * f_j * (FT(1) - f_k);
+    const FT lambda111 = f_i * f_j * f_k;
+
+    // add weighted corners
+    return vector(x_coord(g000) * lambda000 + x_coord(g001) * lambda001 +
+                  x_coord(g010) * lambda010 + x_coord(g011) * lambda011 +
+                  x_coord(g100) * lambda100 + x_coord(g101) * lambda101 +
+                  x_coord(g110) * lambda110 + x_coord(g111) * lambda111,
+                  y_coord(g000) * lambda000 + y_coord(g001) * lambda001 +
+                  y_coord(g010) * lambda010 + y_coord(g011) * lambda011 +
+                  y_coord(g100) * lambda100 + y_coord(g101) * lambda101 +
+                  y_coord(g110) * lambda110 + y_coord(g111) * lambda111,
+                  z_coord(g000) * lambda000 + z_coord(g001) * lambda001 +
+                  z_coord(g010) * lambda010 + z_coord(g011) * lambda011 +
+                  z_coord(g100) * lambda100 + z_coord(g101) * lambda101 +
+                  z_coord(g110) * lambda110 + z_coord(g111) * lambda111);
+  }
+};
+
+#ifndef DOXYGEN_RUNNING
+// [undocumented]
+//
+// \ingroup IS_Fields_helpers_grp
+//
+// This can be used for example when we have implicit functions for data (values & gradients),
+// but use an interpolated values field as to store data.
+template <typename Grid>
+class Function_evaluation
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+  using Point_3 = typename Geom_traits::Point_3;
+  using Vector_3 = typename Geom_traits::Vector_3;
+
+  std::function<FT(const Point_3&)> m_value_fn;
+  std::function<Vector_3(const Point_3&)> m_gradient_fn;
+
+public:
+  template <typename ValueFunction, typename GradientFunction>
+  Function_evaluation(const ValueFunction& value_fn,
+                      const GradientFunction& gradient_fn = [](const Point_3&) -> Vector_3 { return CGAL::NULL_VECTOR; })
+    : m_value_fn{value_fn},
+      m_gradient_fn{gradient_fn}
+  { }
+
+public:
+  FT interpolated_value(const Point_3& p, const Grid&, const std::vector<FT>&) const
+  {
+    return m_value_fn(p);
+  }
+
+  Vector_3 interpolated_gradient(const Point_3& p, const Grid&, const std::vector<Vector_3>&) const
+  {
+    return m_gradient_fn(p);
+  }
+};
+#endif
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_INTERNAL_INTERPOLATION_SCHEMES_3_H
diff --git a/Isosurfacing_3/include/CGAL/Isosurfacing_3/marching_cubes_3.h b/Isosurfacing_3/include/CGAL/Isosurfacing_3/marching_cubes_3.h
new file mode 100644
index 00000000000..4ca6d4f49ff
--- /dev/null
+++ b/Isosurfacing_3/include/CGAL/Isosurfacing_3/marching_cubes_3.h
@@ -0,0 +1,111 @@
+// Copyright (c) 2022-2024 INRIA Sophia-Antipolis (France), GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Julian Stahl
+//                 Mael Rouxel-Labbé
+
+#ifndef CGAL_ISOSURFACING_3_MARCHING_CUBES_3_H
+#define CGAL_ISOSURFACING_3_MARCHING_CUBES_3_H
+
+#include <CGAL/license/Isosurfacing_3.h>
+
+#include <CGAL/Isosurfacing_3/internal/marching_cubes_functors.h>
+#include <CGAL/Isosurfacing_3/internal/topologically_correct_marching_cubes_functors.h>
+
+#include <CGAL/Named_function_parameters.h>
+#include <CGAL/tags.h>
+
+namespace CGAL {
+namespace Isosurfacing {
+
+/**
+ * \ingroup IS_Methods_grp
+ *
+ * \brief creates a triangle soup that represents an isosurface generated by the Marching Cubes algorithm.
+ *
+ * \tparam ConcurrencyTag enables sequential versus parallel algorithm.
+ *                        Possible values are `Sequential_tag`, `Parallel_if_available_tag`, or `Parallel_tag`.
+ * \tparam Domain must be a model of `IsosurfacingDomain_3`.
+ * \tparam PointRange must be a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
+ *                    whose value type can be constructed from the point type of the domain.
+ * \tparam TriangleRange must be a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
+ *                      whose value type is itself a model of the concepts `RandomAccessContainer`
+ *                      and `BackInsertionSequence` whose value type is `std::size_t`.
+ * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+ *
+ * \param domain the domain providing the spatial partition and the data
+ * \param isovalue the value defining the isosurface
+ * \param points the points of the triangles in the output triangle soup
+ * \param triangles the faces of the output triangle soup. Each element in the vector describes a triangle using the indices of the points in `points`.
+ * \param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{use_topologically_correct_marching_cubes}
+ *     \cgalParamDescription{whether the topologically correct variant of Marching Cubes \cgalCite{cgal:g-ctcmi-16} should be used, or the base version \cgalCite{cgal:c-mcctci-95}.}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`true`}
+ *   \cgalParamNEnd
+ *
+ * \cond SKIP_IN_MANUAL
+ *   \cgalParamNBegin{isovalue_nudging}
+ *     \cgalParamDescription{snapping of function value at corner points to an epsilon below the isovalue if the function value is within an epsilon range around the isovalue}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`true`}
+ *     \cgalParamExtra{Snapping the function value at corner points prevents singular cases. The geometry is changed only in case of the function value being within a small epsilon range. The potential change is small. }
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{constrain_to_cell}
+ *     \cgalParamDescription{whether to exclude the cell boundary from the interior vertex placement. }
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`true`}
+ *     \cgalParamExtra{Prevents degenerate or duplicate triangles.}
+ *   \cgalParamNEnd
+ * \endcond
+ *
+ * \cgalNamedParamsEnd
+ *
+ * \sa `CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh()`
+ */
+template <typename ConcurrencyTag = CGAL::Sequential_tag,
+          typename Domain,
+          typename PointRange,
+          typename TriangleRange,
+          typename NamedParameters = parameters::Default_named_parameters>
+void marching_cubes(const Domain& domain,
+                    const typename Domain::Geom_traits::FT isovalue,
+                    PointRange& points,
+                    TriangleRange& triangles,
+                    const NamedParameters& np = parameters::default_values())
+{
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+
+  const bool use_tmc = choose_parameter(get_parameter(np, internal_np::use_topologically_correct_marching_cubes), true);
+  const bool isovalue_nudging = choose_parameter(get_parameter(np, internal_np::isovalue_nudging), true);
+  const bool constrain_to_cell = choose_parameter(get_parameter(np, internal_np::constrain_to_cell), true);
+
+  if(use_tmc)
+  {
+    internal::TMC_functor<Domain, PointRange, TriangleRange> functor(domain, isovalue, isovalue_nudging, constrain_to_cell);
+    domain.template for_each_cell<ConcurrencyTag>(functor);
+    internal::triangles_to_polygon_soup(functor.triangles(), points, triangles);
+  }
+  else
+  {
+    // run marching cubes
+    internal::Marching_cubes_3<Domain> functor(domain, isovalue, isovalue_nudging);
+    domain.template for_each_cell<ConcurrencyTag>(functor);
+    internal::triangles_to_polygon_soup(functor.triangles(), points, triangles);
+  }
+}
+
+} // namespace Isosurfacing
+} // namespace CGAL
+
+#endif // CGAL_ISOSURFACING_3_MARCHING_CUBES_3_H
diff --git a/Isosurfacing_3/package_info/Isosurfacing_3/copyright b/Isosurfacing_3/package_info/Isosurfacing_3/copyright
new file mode 100644
index 00000000000..830b3a6f2be
--- /dev/null
+++ b/Isosurfacing_3/package_info/Isosurfacing_3/copyright
@@ -0,0 +1,2 @@
+Inria Sophia-Antipolis (France)
+GeometryFactory
diff --git a/Isosurfacing_3/package_info/Isosurfacing_3/dependencies b/Isosurfacing_3/package_info/Isosurfacing_3/dependencies
new file mode 100644
index 00000000000..64e88168233
--- /dev/null
+++ b/Isosurfacing_3/package_info/Isosurfacing_3/dependencies
@@ -0,0 +1,21 @@
+Algebraic_foundations
+BGL
+CGAL_ImageIO
+Cartesian_kernel
+Circulator
+Distance_2
+Distance_3
+Installation
+Intersections_2
+Intersections_3
+Interval_support
+Isosurfacing_3
+Kernel_23
+Modular_arithmetic
+Number_types
+Orthtree
+Profiling_tools
+Property_map
+STL_Extension
+Solver_interface
+Stream_support
diff --git a/Isosurfacing_3/package_info/Isosurfacing_3/description.txt b/Isosurfacing_3/package_info/Isosurfacing_3/description.txt
new file mode 100644
index 00000000000..aa18e64751a
--- /dev/null
+++ b/Isosurfacing_3/package_info/Isosurfacing_3/description.txt
@@ -0,0 +1 @@
+The 3D Isosurfacing package provides several isosurfacing algorithms (marching cubes, dual contouring) to generate triangle and quadrangle surface meshes from an input 3D domain and a user-defined isovalue.
\ No newline at end of file
diff --git a/Isosurfacing_3/package_info/Isosurfacing_3/license.txt b/Isosurfacing_3/package_info/Isosurfacing_3/license.txt
new file mode 100644
index 00000000000..23559ebbbaf
--- /dev/null
+++ b/Isosurfacing_3/package_info/Isosurfacing_3/license.txt
@@ -0,0 +1,2 @@
+GPL (v3 or later)
+GPL (v3 or later) AND MIT/X11 (BSD like)
diff --git a/Isosurfacing_3/package_info/Isosurfacing_3/long_description.txt b/Isosurfacing_3/package_info/Isosurfacing_3/long_description.txt
new file mode 100644
index 00000000000..feb2f41e98e
--- /dev/null
+++ b/Isosurfacing_3/package_info/Isosurfacing_3/long_description.txt
@@ -0,0 +1,5 @@
+This component takes a 3D domain as input and a user-specified isovalue, and generates a surface mesh
+approximating the specified isovalue. The meshing algorithm can be selected among two isosurfacing algorithms:
+marching cubes and dual contouring. Two variants of the marching cubes algorithm are offererd:
+with or without topological guarantees. The domain can be created from an explicit grid,
+an implicit grid or a volumetric image.
diff --git a/Isosurfacing_3/package_info/Isosurfacing_3/maintainer b/Isosurfacing_3/package_info/Isosurfacing_3/maintainer
new file mode 100644
index 00000000000..c2585469932
--- /dev/null
+++ b/Isosurfacing_3/package_info/Isosurfacing_3/maintainer
@@ -0,0 +1 @@
+Pierre Alliez <pierre.alliez@inria.fr>
diff --git a/Isosurfacing_3/test/Isosurfacing_3/CMakeLists.txt b/Isosurfacing_3/test/Isosurfacing_3/CMakeLists.txt
new file mode 100644
index 00000000000..c1d821264e6
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/CMakeLists.txt
@@ -0,0 +1,50 @@
+cmake_minimum_required(VERSION 3.1...3.23)
+
+project(Isosurfacing_3_Tests)
+
+find_package(CGAL REQUIRED)
+
+find_package(Eigen3 3.1.0 QUIET) #(3.1.0 or greater)
+include(CGAL_Eigen3_support)
+
+find_package(TBB QUIET)
+include(CGAL_TBB_support)
+
+create_single_source_cgal_program("test_marching_cubes.cpp")
+create_single_source_cgal_program("test_tmc_topology.cpp")
+#create_single_source_cgal_program("verifier.cpp")
+create_single_source_cgal_program("test_tmc_csg.cpp")
+
+if(TARGET CGAL::Eigen3_support)
+  create_single_source_cgal_program("test_isosurfacing_concepts.cpp")
+  create_single_source_cgal_program("test_dual_contouring.cpp")
+
+  target_link_libraries(test_isosurfacing_concepts PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(test_dual_contouring PRIVATE CGAL::Eigen3_support)
+
+  if(TARGET CGAL::TBB_support)
+    target_link_libraries(test_isosurfacing_concepts PRIVATE CGAL::Eigen3_support)
+    target_link_libraries(test_dual_contouring PRIVATE CGAL::TBB_support)
+  endif()
+
+  #examples to be moved in example when reading to be documented
+  create_single_source_cgal_program("dual_contouring_strategies.cpp")
+  create_single_source_cgal_program("dual_contouring_intersection_oracles.cpp")
+
+  target_link_libraries(dual_contouring_strategies PRIVATE CGAL::Eigen3_support)
+  target_link_libraries(dual_contouring_intersection_oracles PRIVATE CGAL::Eigen3_support)
+
+  if(TARGET CGAL::TBB_support)
+    target_link_libraries(dual_contouring_strategies PRIVATE CGAL::TBB_support)
+    target_link_libraries(dual_contouring_intersection_oracles PRIVATE CGAL::TBB_support)
+  endif()
+
+else()
+  message(STATUS "NOTICE: tests require the Eigen library, and will not be compiled.")
+endif()
+
+if(TARGET CGAL::TBB_support)
+  target_link_libraries(test_marching_cubes PRIVATE CGAL::TBB_support)
+  target_link_libraries(test_tmc_topology PRIVATE CGAL::TBB_support)
+  #target_link_libraries(verifier PRIVATE CGAL::TBB_support)
+endif()
diff --git a/Isosurfacing_3/test/Isosurfacing_3/dual_contouring_intersection_oracles.cpp b/Isosurfacing_3/test/Isosurfacing_3/dual_contouring_intersection_oracles.cpp
new file mode 100644
index 00000000000..2861d651a55
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/dual_contouring_intersection_oracles.cpp
@@ -0,0 +1,113 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h>
+
+#include <CGAL/Real_timer.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+auto implicit_function = [](const Point& q) -> FT
+{
+  auto cyl = [](const Point& q) { return IS::Shapes::infinite_cylinder<Kernel>(Point(0,0,0), Vector(0,0,1), 0.5, q); };
+  auto cube = [](const Point& q) { return IS::Shapes::box<Kernel>(Point(-0.5,-0.5,-0.5), Point(0.5,0.5,0.5), q); };
+  auto cyl_and_cube = [&](const Point& q) { return IS::Shapes::shape_union<Kernel>(cyl, cube, q); };
+
+  auto sphere = [](const Point& q) { return IS::Shapes::sphere<Kernel>(Point(0,0,0.5), 0.75, q); };
+  return IS::Shapes::shape_difference<Kernel>(cyl_and_cube, sphere, q);
+};
+
+// The example shows that this is a bad choice to use a linear interpolant
+// because the implicit function gives much more information than just using the values at grid vertices.
+// @todo implement the SDF interpolant and show that it's as good as the dichotomy, but faster
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.;
+  std::cout << "Isovalue: " << isovalue << std::endl;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox = {-2., -2., -2., 2., 2., 2.};
+  Grid grid { bbox, CGAL::make_array<std::size_t>(50, 50, 50) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+
+  // fill up values and gradients
+  Values values { implicit_function, grid };
+  Gradients gradients { values, step };
+
+  const bool triangulate_faces = false;
+
+  // Compute edge intersections with dichotomy
+  {
+    using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients, IS::Dichotomy_edge_intersection>;
+    Domain domain { grid, values, gradients };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Dichotomy)" << std::endl;
+    IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                         CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring-dichotomy_oracle.off", points, triangles);
+  }
+
+  // Compute edge intersections with linear interpolation
+  {
+    using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients, IS::Linear_interpolation_edge_intersection>;
+    Domain domain { grid, values, gradients };
+
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Linear Interpolation)" << std::endl;
+    IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles,
+                                                         CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring-linear_oracle.off", points, triangles);
+  }
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/dual_contouring_strategies.cpp b/Isosurfacing_3/test/Isosurfacing_3/dual_contouring_strategies.cpp
new file mode 100644
index 00000000000..58e91a8271c
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/dual_contouring_strategies.cpp
@@ -0,0 +1,156 @@
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h>
+
+#include <CGAL/Real_timer.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <vector>
+
+using Kernel = CGAL::Simple_cartesian<double>;
+using FT = typename Kernel::FT;
+using Point = typename Kernel::Point_3;
+using Vector = typename Kernel::Vector_3;
+
+using Grid = CGAL::Isosurfacing::Cartesian_grid_3<Kernel>;
+using Values = CGAL::Isosurfacing::Value_function_3<Grid>;
+using Gradients = CGAL::Isosurfacing::Finite_difference_gradient_3<Kernel>;
+using Domain = CGAL::Isosurfacing::Dual_contouring_domain_3<Grid, Values, Gradients>;
+
+using Point_range = std::vector<Point>;
+using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+namespace IS = CGAL::Isosurfacing;
+
+auto implicit_function = [](const Point& q) -> FT
+{
+  auto cyl = [](const Point& q) { return IS::Shapes::infinite_cylinder<Kernel>(Point(0,0,0), Vector(0,0,1), 0.5, q); };
+  auto cube = [](const Point& q) { return IS::Shapes::box<Kernel>(Point(-0.5,-0.5,-0.5), Point(0.5,0.5,0.5), q); };
+  auto cyl_and_cube = [&](const Point& q) { return IS::Shapes::shape_union<Kernel>(cyl, cube, q); };
+
+  auto sphere = [](const Point& q) { return IS::Shapes::sphere<Kernel>(Point(0,0,0.5), 0.75, q); };
+  return IS::Shapes::shape_difference<Kernel>(cyl_and_cube, sphere, q);
+};
+
+int main(int argc, char** argv)
+{
+  const FT isovalue = (argc > 1) ? std::stod(argv[1]) : 0.;
+  std::cout << "Isovalue: " << isovalue << std::endl;
+
+  // create bounding box and grid
+  const CGAL::Bbox_3 bbox = {-2., -2., -2., 2., 2., 2.};
+  Grid grid { bbox, CGAL::make_array<std::size_t>(50, 50, 50) };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+
+  // fill up values and gradients
+  Values values { implicit_function, grid };
+  Gradients gradients { values, step };
+  Domain domain { grid, values, gradients };
+
+  const bool triangulate_faces = false;
+
+  // unconstrained QEM Placement strategy (default)
+  {
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (QEM - unconstrained)" << std::endl;
+    IS::internal::Dual_contourer<CGAL::Parallel_if_available_tag, Domain,
+                                 IS::internal::DC_Strategy::QEM> contourer;
+    contourer(domain, isovalue, points, triangles,
+              CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_QEM-unconstrained.off", points, triangles);
+  }
+
+  // constrained QEM Placement strategy
+  {
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (QEM - constrained)" << std::endl;
+    IS::internal::Dual_contourer<CGAL::Parallel_if_available_tag, Domain,
+                                 IS::internal::DC_Strategy::QEM> contourer;
+    contourer(domain, isovalue, points, triangles,
+              CGAL::parameters::do_not_triangulate_faces(!triangulate_faces)
+                               .constrain_to_cell(true));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_QEM-constrained.off", points, triangles);
+  }
+
+
+  // Centroid of Edge Intersections strategy
+  {
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Centroid of Edge Intersections)" << std::endl;
+    IS::internal::Dual_contourer<CGAL::Sequential_tag, Domain,
+                                 IS::internal::DC_Strategy::Centroid_of_edge_intersections> contourer;
+    contourer(domain, isovalue, points, triangles,
+              CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_CEI.off", points, triangles);
+  }
+
+  // Cell Center strategy
+  {
+    CGAL::Real_timer timer;
+    timer.start();
+
+    Point_range points;
+    Polygon_range triangles;
+
+    std::cout << "--- Dual Contouring (Cell Center)" << std::endl;
+    IS::internal::Dual_contourer<CGAL::Sequential_tag, Domain,
+                                 IS::internal::DC_Strategy::Cell_center> contourer;
+    contourer(domain, isovalue, points, triangles,
+              CGAL::parameters::do_not_triangulate_faces(!triangulate_faces));
+
+    timer.stop();
+
+    std::cout << "Output #vertices: " << points.size() << std::endl;
+    std::cout << "Output #triangles: " << triangles.size() << std::endl;
+    std::cout << "Elapsed time: " << timer.time() << " seconds" << std::endl;
+    CGAL::IO::write_polygon_soup("dual_contouring_CC.off", points, triangles);
+  }
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/test_dual_contouring.cpp b/Isosurfacing_3/test/Isosurfacing_3/test_dual_contouring.cpp
new file mode 100644
index 00000000000..5c717d122be
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/test_dual_contouring.cpp
@@ -0,0 +1,304 @@
+#include "test_util.h"
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h>
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+#include <CGAL/Isosurfacing_3/Dual_contouring_domain_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/IO/Image_3.h>
+
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
+#include <CGAL/Image_3.h>
+#include <CGAL/boost/graph/IO/OFF.h>
+#include <CGAL/Random.h>
+
+#include <array>
+#include <deque>
+#include <iostream>
+#include <functional>
+
+namespace IS = CGAL::Isosurfacing;
+
+template <typename K>
+void test_implicit_shape(std::function<typename K::FT(const typename K::Point_3&)> implicit_function)
+{
+  using FT = typename K::FT;
+  using Point = typename K::Point_3;
+  using Vector = typename K::Vector_3;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Value_function_3<Grid>;
+  using Gradients = IS::Finite_difference_gradient_3<K>;
+  using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::array<std::size_t, 4> >;
+
+  const CGAL::Bbox_3 bbox = {-2., -2., -2., 2., 2., 2.};
+  const Vector spacing { 0.05, 0.05, 0.05 };
+  const FT isovalue = 0;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring (Implicit function) with isovalue = " << isovalue << std::endl;
+  std::cout << "Kernel: " << typeid(K).name() << std::endl;
+
+  Grid grid { bbox, spacing };
+  Values values { implicit_function, grid };
+  Gradients gradients { values, 0.01 * spacing[0] };
+  Domain domain { grid, values, gradients };
+
+  Point_range points;
+  Polygon_range polygons;
+  IS::dual_contouring<CGAL::Parallel_if_available_tag>(domain, isovalue, points, polygons, CGAL::parameters::do_not_triangulate_faces(true));
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #polygons: " << polygons.size() << std::endl;
+
+  std::cout << "Checking emptiness..." << std::endl;
+  assert(points.size() && polygons.size());
+  std::cout << "Checking for duplicate points..." << std::endl;
+  assert(!has_duplicate_points(points, polygons));
+  std::cout << "Checking for duplicate polygons..." << std::endl;
+  assert(!has_duplicate_polygons(points, polygons));
+  std::cout << "Checking for isolated vertices..." << std::endl;
+  assert(!has_isolated_vertices(points, polygons));
+  std::cout << "Checking if the soup is a mesh..." << std::endl;
+  assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(polygons));
+
+  std::cout << "Create the mesh..." << std::endl;
+  Mesh mesh;
+  CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, polygons, mesh);
+
+  std::cout << "Triangulate the mesh..." << std::endl;
+  CGAL::Polygon_mesh_processing::triangulate_faces(mesh);
+
+  std::cout << "Write the polygon mesh..." << std::endl;
+  CGAL::IO::write_polygon_mesh("DC_implicit_function.off", mesh, CGAL::parameters::stream_precision(17));
+
+  std::cout << "Check manifoldness..." << std::endl;
+  assert(is_manifold(mesh));
+
+  std::cout << "Check for degenerate faces..." << std::endl;
+  assert(!has_degenerate_faces(mesh));
+
+  const FT computed_volume = CGAL::Polygon_mesh_processing::volume(mesh);
+  std::cout << "Computed Volume: " << computed_volume << std::endl;
+
+  // Brute force estimation of the volume
+  std::cout << "Estimating volume using Monte Carlo..." << std::endl;
+  const std::size_t num_samples = 1000000;
+  CGAL::Random rng(0);
+
+  std::size_t inside_count = 0;
+  for (std::size_t i = 0; i < num_samples; ++i) {
+    Point sample(rng.get_double(bbox.xmin(), bbox.xmax()),
+                 rng.get_double(bbox.ymin(), bbox.ymax()),
+                 rng.get_double(bbox.zmin(), bbox.zmax()));
+    if (implicit_function(sample) <= isovalue) {
+      ++inside_count;
+    }
+  }
+
+  const FT bbox_volume = (bbox.xmax() - bbox.xmin()) * (bbox.ymax() - bbox.ymin()) * (bbox.zmax() - bbox.zmin());
+  const FT monte_carlo_volume = bbox_volume * static_cast<FT>(inside_count) / static_cast<FT>(num_samples);
+
+  std::cout << "Monte Carlo Estimated Volume: " << monte_carlo_volume << std::endl;
+
+  // Compare computed volume with Monte Carlo estimation
+  const FT tolerance = 1e-2 * bbox_volume;
+  assert(CGAL::abs(computed_volume - monte_carlo_volume) < tolerance);
+  std::cout << "Volume check passed!" << std::endl;
+}
+
+template <typename K>
+void test_box()
+{
+  auto box_function = [](const typename K::Point_3& q) {
+    return IS::Shapes::box<K>(typename K::Point_3(-1, -1, -1), typename K::Point_3(1, 1, 1), q);
+  };
+  test_implicit_shape<K>(box_function);
+}
+
+template <typename K>
+void test_union_of_boxes()
+{
+  auto union_of_boxes_function = [](const typename K::Point_3& q) {
+    auto box_1 = [](const typename K::Point_3& q) {
+      return IS::Shapes::box<K>(typename K::Point_3(0, 0, 0), typename K::Point_3(1, 1, 1), q);
+    };
+    auto box_2 = [](const typename K::Point_3& q) {
+      return IS::Shapes::box<K>(typename K::Point_3(0.5, 0.5, 0.5), typename K::Point_3(1.5, 1.5, 1.5), q);
+    };
+    return IS::Shapes::shape_union<K>(box_1, box_2, q);
+  };
+  test_implicit_shape<K>(union_of_boxes_function);
+}
+
+template <typename K>
+void test_union_of_boxes_minus_sphere()
+{
+  auto b1_b2_ms1_function = [](const typename K::Point_3& q) {
+    auto box_1 = [](const typename K::Point_3& q) {
+      return IS::Shapes::box<K>(typename K::Point_3(0, 0, 0), typename K::Point_3(1, 1, 1), q);
+    };
+    auto box_2 = [](const typename K::Point_3& q) {
+      return IS::Shapes::box<K>(typename K::Point_3(0.5, 0.5, 0.5), typename K::Point_3(1.5, 1.5, 1.5), q);
+    };
+    auto b1_and_b2 = [&](const typename K::Point_3& q) {
+      return IS::Shapes::shape_union<K>(box_1, box_2, q);
+    };
+    auto s1 = [](const typename K::Point_3& q) {
+      return IS::Shapes::sphere<K>(typename K::Point_3(0, 0, 0.5), 1, q);
+    };
+    return IS::Shapes::shape_difference<K>(b1_and_b2, s1, q);
+  };
+  test_implicit_shape<K>(b1_b2_ms1_function);
+}
+
+template <typename K>
+void test_union_of_spheres()
+{
+  auto union_of_spheres_function = [](const typename K::Point_3& q) {
+    auto sphere_1 = [](const typename K::Point_3& q) {
+      return IS::Shapes::sphere<K>(typename K::Point_3(0, 0, 0), 1, q);
+    };
+    auto sphere_2 = [](const typename K::Point_3& q) {
+      return IS::Shapes::sphere<K>(typename K::Point_3(0, 0, 0.5), 1, q);
+    };
+    return IS::Shapes::shape_union<K>(sphere_1, sphere_2, q);
+  };
+  test_implicit_shape<K>(union_of_spheres_function);
+}
+
+template <typename K>
+void test_torus()
+{
+  auto torus_function = [](const typename K::Point_3& q) {
+    return IS::Shapes::torus<K>(typename K::Point_3(0, 0, 0), typename K::Vector_3(0, 0, 1), 0.25, 1, q);
+  };
+  test_implicit_shape<K>(torus_function);
+}
+
+// template <typename K>
+// void test_infinite_cylinder()
+// {
+//   auto cylinder_function = [](const typename K::Point_3& q) {
+//     return IS::Shapes::infinite_cylinder<K>(typename K::Point_3(0, 0, 0), typename K::Vector_3(1, 1, 1), 1, q);
+//   };
+//   test_implicit_shape<K>(cylinder_function);
+// }
+
+// template <typename K>
+// void test_cylinder_and_cube_minus_sphere()
+// {
+//   auto cyl_cube_function = [](const typename K::Point_3& q) {
+//     auto cyl = [](const typename K::Point_3& q) {
+//       return IS::Shapes::infinite_cylinder<K>(typename K::Point_3(0, 0, 0), typename K::Vector_3(0, 0, 1), 0.5, q);
+//     };
+//     auto cube = [](const typename K::Point_3& q) {
+//       return IS::Shapes::box<K>(typename K::Point_3(-0.5, -0.5, -0.5), typename K::Point_3(0.5, 0.5, 0.5), q);
+//     };
+//     auto cyl_and_cube = [&](const typename K::Point_3& q) {
+//       return IS::Shapes::shape_union<K>(cyl, cube, q);
+//     };
+//     auto sphere = [](const typename K::Point_3& q) {
+//       return IS::Shapes::sphere<K>(typename K::Point_3(0, 0, 0.5), 1, q);
+//     };
+//     return IS::Shapes::shape_difference<K>(cyl_and_cube, sphere, q);
+//   };
+//   test_implicit_shape<K>(cyl_cube_function);
+// }
+
+template <typename K>
+void test_implicit_shapes()
+{
+  test_box<K>();
+  test_union_of_boxes<K>();
+  test_union_of_boxes_minus_sphere<K>();
+  test_union_of_spheres<K>();
+  test_torus<K>();
+}
+
+template <typename K>
+void test_image()
+{
+  using FT = typename K::FT;
+  using Point = typename K::Point_3;
+
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Gradients = IS::Finite_difference_gradient_3<K>;
+  using Domain = IS::Dual_contouring_domain_3<Grid, Values, Gradients>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+  const std::string fname = CGAL::data_file_path("images/skull_2.9.inr");
+  const FT isovalue = 2.9;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring (Image) with isovalue = " << isovalue << std::endl;
+  std::cout << "Kernel: " << typeid(K).name() << std::endl;
+
+  CGAL::Image_3 image;
+  if(!image.read(fname))
+  {
+    std::cerr << "Error: Cannot read file " << fname << std::endl;
+    assert(false);
+    return;
+  }
+
+  // convert image to a Cartesian grid
+  Grid grid;
+  Values values { grid }; // 'values' keeps a reference to the grid
+  if(!IS::IO::convert_image_to_grid(image, grid, values))
+  {
+    std::cerr << "Error: Cannot convert image to Cartesian grid" << std::endl;
+    assert(false);
+    return;
+  }
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  const FT step = CGAL::approximate_sqrt(grid.spacing().squared_length()) * 0.01;
+
+  // fill up values and gradients
+  Gradients gradients { values, step };
+  Domain domain { grid, values, gradients };
+
+  // run dual contouring isosurfacing
+  Point_range points;
+  Polygon_range polygons;
+  IS::dual_contouring(domain, isovalue, points, polygons, CGAL::parameters::do_not_triangulate_faces(true));
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #polygons: " << polygons.size() << std::endl;
+
+  assert(points.size() && polygons.size());
+  assert(!has_duplicate_points(points, polygons));
+  assert(!has_duplicate_polygons(points, polygons));
+  assert(!has_isolated_vertices(points, polygons));
+}
+
+int main(int, char**)
+{
+  test_implicit_shapes<CGAL::Simple_cartesian<double>>();
+  test_image<CGAL::Simple_cartesian<double>>();
+
+  test_implicit_shapes<CGAL::Exact_predicates_inexact_constructions_kernel>();
+  test_image<CGAL::Exact_predicates_inexact_constructions_kernel>();
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/test_isosurfacing_concepts.cpp b/Isosurfacing_3/test/Isosurfacing_3/test_isosurfacing_concepts.cpp
new file mode 100644
index 00000000000..a9094351ad1
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/test_isosurfacing_concepts.cpp
@@ -0,0 +1,144 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/dual_contouring_3.h>
+
+#include <CGAL/assertions.h>
+#include <CGAL/Origin.h>
+
+#include <array>
+#include <vector>
+
+namespace IS = CGAL::Isosurfacing;
+
+template <typename K>
+struct Traits
+{
+  using FT = typename K::FT;
+  using Point_3 = typename K::Point_3;
+  using Vector_3 = typename K::Vector_3;
+  using Iso_cuboid_3 = typename K::Iso_cuboid_3;
+
+  struct Compute_x_3
+  {
+    FT operator()(const Point_3&) const { return 0; }
+    FT operator()(const Vector_3&) const { return 0; }
+  };
+
+  struct Compute_y_3
+  {
+    FT operator()(const Point_3&) const { return 0; }
+    FT operator()(const Vector_3&) const { return 0; }
+  };
+
+  struct Compute_z_3
+  {
+    FT operator()(const Point_3&) const { return 0; }
+    FT operator()(const Vector_3&) const { return 0; }
+  };
+
+  struct Construct_point_3
+  {
+    Point_3 operator()(FT, FT, FT) const { return CGAL::ORIGIN; }
+  };
+
+  struct Construct_vector_3
+  {
+    Vector_3 operator()(FT, FT, FT) const { return CGAL::NULL_VECTOR; }
+  };
+
+  struct Construct_iso_cuboid_3
+  {
+    Iso_cuboid_3 operator()(FT, FT, FT, FT, FT, FT) const { return Iso_cuboid_3(); }
+  };
+
+  struct Construct_vertex_3
+  {
+    Point_3 operator()(const Iso_cuboid_3&, int) const { return CGAL::ORIGIN; }
+  };
+
+  Compute_x_3 compute_x_3_object() { return Compute_x_3(); }
+  Compute_y_3 compute_y_3_object() { return Compute_y_3();}
+  Compute_z_3 compute_z_3_object() { return Compute_z_3(); }
+  Construct_point_3 construct_point_3_object() { return Construct_point_3();}
+  Construct_vector_3 construct_vector_3_object() { return Construct_vector_3(); }
+  Construct_iso_cuboid_3 construct_iso_cuboid_3_object() { return Construct_iso_cuboid_3(); }
+  Construct_vertex_3 construct_vertex_3_object() { return Construct_vertex_3(); }
+};
+
+template <typename K>
+struct MC_Domain
+{
+  typedef Traits<K> Geom_traits;
+  typedef typename Geom_traits::FT FT;
+  typedef typename Geom_traits::Point_3 Point_3;
+  typedef std::size_t vertex_descriptor;
+  typedef std::size_t edge_descriptor;
+  typedef std::size_t cell_descriptor;
+  typedef std::vector<std::size_t> Edge_vertices;
+  typedef std::vector<std::size_t> Cells_incident_to_edge;
+  typedef std::vector<std::size_t> Cell_vertices;
+  typedef std::vector<std::size_t> Cell_edges;
+
+  Geom_traits geom_traits() const { return Geom_traits(); }
+
+  Point_3 point(const vertex_descriptor& /*v*/) const { return CGAL::ORIGIN; }
+
+  FT value(const Point_3& /*p*/) const { return 0; }
+  FT value(const vertex_descriptor& /*v*/) const { return 0; }
+
+  Edge_vertices incident_vertices(const edge_descriptor& /*e*/) const { return {}; }
+  Cells_incident_to_edge incident_cells(const edge_descriptor& /*e*/) const { return {}; }
+  Cell_vertices cell_vertices(const cell_descriptor& /*c*/) const { return {}; }
+  Cell_edges cell_edges(const cell_descriptor& /*c*/) const { return {}; }
+
+  template <typename ConcurrencyTag, typename Functor>
+  void for_each_vertex(Functor& /*f*/) const { }
+  template <typename ConcurrencyTag, typename Functor>
+  void for_each_edge(Functor& /*f*/) const { }
+  template <typename ConcurrencyTag, typename Functor>
+  void for_each_cell(Functor& /*f*/) const { }
+
+  bool construct_intersection(const Point_3&, const Point_3& /*p_1*/,
+                              const FT /*v_0*/, const FT /*v_1*/,
+                              const FT /*isovalue*/,
+                              Point_3& /*intersection*/) const { return false; }
+};
+
+template <typename K>
+struct DC_Domain
+  : public MC_Domain<K>
+{
+  typedef Traits<K> Geom_traits;
+  typedef typename Geom_traits::Point_3 Point_3;
+  typedef typename Geom_traits::Vector_3 Vector_3;
+
+  Vector_3 gradient(const Point_3& /*p*/) const { return CGAL::NULL_VECTOR; }
+};
+
+template <typename K>
+void test()
+{
+  using Point_3 = typename K::Point_3;
+
+  MC_Domain<K> mc_domain;
+  DC_Domain<K> dc_domain;
+
+  std::vector<Point_3> points;
+  std::vector<std::vector<std::size_t> > faces;
+
+  IS::marching_cubes(mc_domain, 0, points, faces);
+
+  IS::dual_contouring(dc_domain, 0, points, faces);
+}
+
+int main(int, char**)
+{
+  test<CGAL::Simple_cartesian<double> >();
+  test<CGAL::Exact_predicates_inexact_constructions_kernel>();
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/test_marching_cubes.cpp b/Isosurfacing_3/test/Isosurfacing_3/test_marching_cubes.cpp
new file mode 100644
index 00000000000..309c8cf7c8d
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/test_marching_cubes.cpp
@@ -0,0 +1,155 @@
+#include "test_util.h"
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
+
+#include <iostream>
+#include <string>
+
+using K = CGAL::Simple_cartesian<double>;
+using FT = typename K::FT;
+using Point = typename K::Point_3;
+using Vector = typename K::Vector_3;
+
+using Point_range = std::vector<Point>;
+using Triangle_range = std::vector<std::array<std::size_t, 3> >;
+
+using Mesh = CGAL::Surface_mesh<Point>;
+
+#define CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+
+namespace IS = CGAL::Isosurfacing;
+
+struct Sphere_function
+{
+  FT operator()(const Point& p) const
+  {
+    return sqrt(p.x()*p.x() + p.y()*p.y() + p.z()*p.z());
+  }
+};
+
+void test_implicit_sphere()
+{
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Value_function_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  const CGAL::Bbox_3 bbox {-1., -1., -1., 1., 1., 1.};
+  const Vector spacing { 0.1, 0.1, 0.1 };
+  const FT isovalue = 0.8;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes (Implicit sphere) with isovalue = " << isovalue << std::endl;
+  std::cout << "Kernel: " << typeid(K).name() << std::endl;
+
+  Grid grid { bbox, spacing };
+  Values values { Sphere_function(), grid };
+  Domain domain { grid, values };
+
+  Point_range points;
+  Triangle_range triangles;
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #polygons: " << triangles.size() << std::endl;
+
+#ifdef CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+  CGAL::IO::write_polygon_soup("MC_implicit_sphere.off", points, triangles);
+#endif
+
+  assert(points.size() && triangles.size());
+  assert(!has_duplicate_points(points, triangles));
+  assert(!has_duplicate_polygons(points, triangles));
+  assert(!has_isolated_vertices(points, triangles));
+
+  assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles));
+  Mesh m;
+  CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, m);
+
+  assert(is_manifold(m));
+  assert(!has_degenerate_faces(m));
+}
+
+void test_grid_sphere(const std::size_t n)
+{
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  const CGAL::Bbox_3 bbox = {-1., -1., -1., 1., 1., 1.};
+  const Vector spacing(2. / (n - 1), 2. / (2 * (n - 1)), 2. / (3*(n - 1)));
+  const FT isovalue = 0.777;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Marching Cubes (Implicit sphere) with n = " << n << std::endl;
+  std::cout << "Kernel: " << typeid(K).name() << std::endl;
+
+  Grid grid { bbox, spacing };
+
+  std::cout << "Span: " << grid.span() << std::endl;
+  std::cout << "Cell dimensions: " << grid.spacing()[0] << " " << grid.spacing()[1] << " " << grid.spacing()[2] << std::endl;
+  std::cout << "Cell #: " << grid.xdim() << ", " << grid.ydim() << ", " << grid.zdim() << std::endl;
+
+  Values values { grid };
+  Sphere_function sphere_function;
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        const Point pos(x * spacing.x() + bbox.xmin(),
+                        y * spacing.y() + bbox.ymin(),
+                        z * spacing.z() + bbox.zmin());
+
+        values(x, y, z) = sphere_function(pos);
+      }
+    }
+  }
+
+  Domain domain { grid, values };
+
+  Point_range points;
+  Triangle_range triangles;
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, triangles);
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #polygons: " << triangles.size() << std::endl;
+
+#ifdef CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+  const std::string test_name = "test_grid_sphere(" + std::to_string(n) + ")";
+  CGAL::IO::write_polygon_soup(test_name + ".off", points, triangles);
+#endif
+
+  assert(!has_duplicate_points(points, triangles));
+  assert(!has_duplicate_polygons(points, triangles));
+  assert(!has_isolated_vertices(points, triangles));
+
+  assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles));
+  Mesh m;
+  CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, m);
+
+  assert(is_manifold(m));
+  assert(!has_degenerate_faces(m));
+}
+
+int main(int, char**)
+{
+  test_implicit_sphere();
+  test_grid_sphere(2);
+  test_grid_sphere(3);
+  test_grid_sphere(10);
+  test_grid_sphere(50);
+  test_grid_sphere(100);
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/test_tmc_csg.cpp b/Isosurfacing_3/test/Isosurfacing_3/test_tmc_csg.cpp
new file mode 100644
index 00000000000..07af88abbf1
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/test_tmc_csg.cpp
@@ -0,0 +1,90 @@
+#include "test_util.h"
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h>
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Finite_difference_gradient_3.h>
+#include <CGAL/Isosurfacing_3/IO/Image_3.h>
+
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
+#include <CGAL/Image_3.h>
+#include <CGAL/boost/graph/IO/OFF.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <array>
+#include <deque>
+#include <iostream>
+
+namespace IS = CGAL::Isosurfacing;
+
+template <typename K>
+void test_cube()
+{
+  using FT = typename K::FT;
+  using Point = typename K::Point_3;
+  using Vector = typename K::Vector_3;
+
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Value_function_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+  auto implicit_function = [](const Point& q) -> FT
+  {
+  // ---
+    auto b1 = [](const Point& q) { return IS::Shapes::box<K>(Point(-1,-1,-1), Point(1,1,1), q); };
+    auto s1 = [](const Point& q) { return IS::Shapes::sphere<K>(Point(0,0,0), 1, q); };
+    auto cyl1 = [](const Point& q) { return IS::Shapes::infinite_cylinder<K>(Point(0,0,0), Vector(0,0,1), 0.5, q); };
+    auto cyl2 = [](const Point& q) { return IS::Shapes::infinite_cylinder<K>(Point(0,0,0), Vector(0,1,0), 0.5, q); };
+    auto cyl3 = [](const Point& q) { return IS::Shapes::infinite_cylinder<K>(Point(0,0,0), Vector(1,0,0), 0.5, q); };
+
+    auto b1_is1 = [&](const Point& q) { return IS::Shapes::shape_intersection<K>(b1, s1, q); };
+    auto cyl1_cyl2 = [&](const Point& q) { return IS::Shapes::shape_union<K>(cyl1, cyl2, q); };
+    auto cyl1_cyl2_cyl3 = [&](const Point& q) { return IS::Shapes::shape_union<K>(cyl1_cyl2, cyl3, q); };
+
+    auto b1_ms1_mcyl1_mcyl2 = [&](const Point& q) { return IS::Shapes::shape_difference<K>(b1_is1, cyl1_cyl2_cyl3, q); };
+
+    return b1_ms1_mcyl1_mcyl2(q);
+  };
+
+  const CGAL::Bbox_3 bbox = {-2., -2., -2., 2., 2., 2.};
+  const Vector spacing { 0.05, 0.05, 0.05 };
+  const FT isovalue = 0;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running Dual Contouring (Implicit function) with isovalue = " << isovalue << std::endl;
+  std::cout << "Kernel: " << typeid(K).name() << std::endl;
+
+  Grid grid { bbox, spacing };
+  Values values {implicit_function , grid };
+  Domain domain { grid, values };
+
+  Point_range points;
+  Polygon_range polygons;
+  IS::marching_cubes<CGAL::Sequential_tag>(domain, isovalue, points, polygons, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #polygons: " << polygons.size() << std::endl;
+
+  CGAL::IO::write_OFF("MC.off", points, polygons, CGAL::parameters::stream_precision(17));
+}
+
+int main(int, char**)
+{
+  test_cube<CGAL::Simple_cartesian<double> >();
+  test_cube<CGAL::Exact_predicates_inexact_constructions_kernel>();
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/test_tmc_topology.cpp b/Isosurfacing_3/test/Isosurfacing_3/test_tmc_topology.cpp
new file mode 100644
index 00000000000..88a7f5126fb
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/test_tmc_topology.cpp
@@ -0,0 +1,868 @@
+#include "test_util.h"
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/Isosurfacing_3/internal/implicit_shapes_helper.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/border.h>
+#include <CGAL/Polygon_mesh_processing/connected_components.h>
+
+#include <CGAL/Random.h>
+
+#include <cassert>
+#include <iostream>
+#include <unordered_map>
+#include <unordered_set>
+
+#define CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+
+namespace IS = CGAL::Isosurfacing;
+
+template <typename Grid>
+bool check_closed_not_empty(const Grid& grid,
+                            const IS::Interpolated_discrete_values_3<Grid>& values,
+                            const typename Grid::Geom_traits::FT iso = 0)
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+
+  FT boundary_min = std::numeric_limits<FT>::max();
+  FT total_min = std::numeric_limits<FT>::max();
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        total_min = (std::min)(total_min, values(x, y, z));
+        if (x == 0 || y == 0 || z == 0 || x == grid.xdim() - 1 || y == grid.ydim() - 1 || z == grid.zdim() - 1)
+          boundary_min = (std::min)(boundary_min, values(x, y, z));
+      }
+    }
+  }
+
+  // empty cell
+  if (total_min > iso)
+  {
+    return false;
+  }
+
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        const bool is_boundary = x == 0 || y == 0 || z == 0 || x == grid.xdim() - 1 || y == grid.ydim() - 1 || z == grid.zdim() - 1;
+
+        // closed field
+        if (!is_boundary && boundary_min - values(x, y, z) < 1e-6)
+          return false;
+      }
+    }
+  }
+  return true;
+}
+
+template <typename Grid>
+bool check_iso_vertices(const Grid& grid,
+                        const IS::Interpolated_discrete_values_3<Grid>& values,
+                        const typename Grid::Geom_traits::FT iso = 0)
+{
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        if (std::abs(values(x, y, z)) < iso + 1e-6)
+          return true;
+      }
+    }
+  }
+  return false;
+}
+
+template <typename Grid>
+bool check_iso_edges(const Grid& grid,
+                     const IS::Interpolated_discrete_values_3<Grid>& values,
+                     const typename Grid::Geom_traits::FT iso = 0)
+{
+  for(std::size_t x=0; x<grid.xdim(); ++x) {
+    for(std::size_t y=0; y<grid.ydim(); ++y) {
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+      {
+        if (x < grid.xdim() - 1 && std::abs(values(x, y, z)) < iso + 1e-6 && std::abs(values(x + 1, y, z)) < iso + 1e-6)
+          return true;
+        if (y < grid.ydim() - 1 && std::abs(values(x, y, z)) < iso + 1e-6 && std::abs(values(x, y + 1, z)) < iso + 1e-6)
+          return true;
+        if (z < grid.zdim() - 1 && std::abs(values(x, y, z)) < iso + 1e-6 && std::abs(values(x, y, z + 1)) < iso + 1e-6)
+          return true;
+      }
+    }
+  }
+  return false;
+}
+
+template <typename Grid>
+void to_grid(const Grid& grid,
+             IS::Interpolated_discrete_values_3<Grid>& values,
+             const std::array<typename Grid::Geom_traits::FT, 8>& center_values)
+{
+  assert(grid.xdim() == 2);
+  assert(grid.ydim() == 2);
+  assert(grid.zdim() == 2);
+
+  values(0, 0, 0) = center_values[0];
+  values(0, 0, 1) = center_values[1];
+  values(0, 1, 0) = center_values[2];
+  values(0, 1, 1) = center_values[3];
+  values(1, 0, 0) = center_values[4];
+  values(1, 0, 1) = center_values[5];
+  values(1, 1, 0) = center_values[6];
+  values(1, 1, 1) = center_values[7];
+}
+
+template <typename Grid>
+void embed_in_positive_grid(const Grid& grid,
+                            IS::Interpolated_discrete_values_3<Grid>& values,
+                            const std::array<typename Grid::Geom_traits::FT, 8>& center_values)
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using FT = typename Geom_traits::FT;
+
+  assert(grid.xdim() == 4);
+  assert(grid.ydim() == 4);
+  assert(grid.zdim() == 4);
+
+  CGAL::Random rand;
+
+  FT min = (std::numeric_limits<FT>::max)();
+  FT max = std::numeric_limits<FT>::lowest();
+  for (const FT v : center_values)
+  {
+    min = (std::min)(min, v);
+    max = (std::max)(max, v);
+  }
+  max += 1e-3;
+
+  for(std::size_t x=0; x<grid.xdim(); ++x)
+    for(std::size_t y=0; y<grid.ydim(); ++y)
+      for(std::size_t z=0; z<grid.zdim(); ++z)
+        values(x, y, z) = rand.uniform_real<FT>(max, 2 * max - min);
+
+  values(1, 1, 1) = center_values[0];
+  values(1, 1, 2) = center_values[1];
+  values(1, 2, 1) = center_values[2];
+  values(1, 2, 2) = center_values[3];
+  values(2, 1, 1) = center_values[4];
+  values(2, 1, 2) = center_values[5];
+  values(2, 2, 1) = center_values[6];
+  values(2, 2, 2) = center_values[7];
+}
+
+enum class AmbiguousCase
+{
+  CONTOUR_6_VTS,
+  CONTOUR_7_VTS_CONFIG_A,
+  CONTOUR_7_VTS_CONFIG_B,
+  CONTOUR_8_VTS_CONFIG_A,
+  CONTOUR_8_VTS_CONFIG_B,
+  CONTOUR_9_VTS_CONFIG_A,
+  MC_4_TUNNEL,
+  MC_7_TUNNEL,
+  MC_10_TUNNEL,
+  MC_12_TUNNEL,
+  MC_13_TUNNEL,
+  MC_13_12_VTS_CONFIG_A,
+  MC_13_12_VTS_CONFIG_B,
+  MC_13_SIMPLE
+};
+
+template <typename FT>
+FT generate_predefined_inner_ambiguity(const AmbiguousCase topology_case,
+                                       std::array<FT, 8>& values)
+{
+  FT iso;
+
+  switch (topology_case) {
+    case AmbiguousCase::CONTOUR_6_VTS:
+      values = {-0.960492426392903, 0.793207329559554, 0.916735525189067, -0.422761282626275, -0.934993247757551, -0.850129305868777, -0.0367116785741896, -0.656740699156587};
+      iso = 0.0387;
+      break;
+    case AmbiguousCase::CONTOUR_7_VTS_CONFIG_A:
+      values = {10.2967816247556, 9.45145192686147, 9.54753711271687, 10.6482067822841, 9.81494966341055, 9.31168538578250, 9.80950580411527, 10.7451536262220};
+      iso = 9.8588;
+      break;
+    case AmbiguousCase::CONTOUR_7_VTS_CONFIG_B:
+      values = {9.9998593195995547, 9.9993381282115549, 9.9979160205452544, 9.9986053863704142, 9.9999374908631235, 9.999424800002032, 9.9983922749132219, 9.999579324965488};
+      iso = 9.9994608191478135;
+      break;
+    case AmbiguousCase::CONTOUR_8_VTS_CONFIG_A:
+      values = {0.454797708726920, 0.801330575352402, 0.649991492712356, -0.973974554763863,  -0.134171007607162,  -0.0844698148589140, -0.826313795402046, 0.433391503783462};
+      iso = 0.0097;
+      break;
+    case AmbiguousCase::CONTOUR_8_VTS_CONFIG_B:
+      values = {9.9985934885536665, 9.9998695572230147, 9.9999045831713928, 9.999316745478131, 9.9986117521866866, 9.9998754368055813, 9.9999031760062458, 9.9992041920402936};
+      iso = 9.99946;
+      break;
+    case AmbiguousCase::CONTOUR_9_VTS_CONFIG_A:
+      values = {-15.6504952739285, 2.90290077342601, 24.5454566157887, -24.5274127623786, 21.6741877710053, -4.49696327433901, -19.7891575872492, -15.5588482753161};
+      iso = -1.8061;
+      break;
+    case AmbiguousCase::MC_4_TUNNEL:
+      values = {-7.70146936482581, -3.21868369245987, -5.44023748418735, 15.6051950593180, 12.7611835388515, -4.46952393442309, -11.7240576326183, -9.23038948829007};
+      iso = -1.7660;
+      break;
+    case AmbiguousCase::MC_7_TUNNEL:
+      values = {-3.42744283804455, 0.621278122151001, 4.48110777981235, -1.95551129669134, 2.30448107596369, -1.04182240925489, -3.51087814405650, -6.44976786808517};
+      iso = -0.6;
+      break;
+    case AmbiguousCase::MC_10_TUNNEL:
+      values = {-0.100000000000000, -6.11000000000000, 2, 10.2000000000000, 10.8000000000000, 1.80000000000000, -8.20000000000000, -0.180000000000000};
+      iso = 1.10918;
+      break;
+    case AmbiguousCase::MC_12_TUNNEL:
+      values = {-3.37811990337124, 0.473258332744286, 2.54344310345736, 7.87658724379480, 4.38700713005133, -1.49950251870885, -4.21025867362045, -1.00233824192217};
+      iso = 0.0708;
+      break;
+    case AmbiguousCase::MC_13_TUNNEL:
+      values = {2.74742516087490, -3.39187542578189, -12.5297639669456, 0.431517989649243, -6.92460546400188, 2.52228314017858, 14.6950568276448, -10.0732624062474};
+      iso = -1.3064;
+      break;
+    case AmbiguousCase::MC_13_12_VTS_CONFIG_A:
+      values = {0.546912886195662, -0.421103532406922, -0.643375084081520, 0.855507421818445, -0.260686312588506, 0.206413666735986, 0.237274227130530, -0.183297728364877};
+      iso = 0.0293;
+      break;
+    case AmbiguousCase::MC_13_12_VTS_CONFIG_B:
+      values = {1069, 843, 950, 1133, 958, 1029, 1198, 946};
+      iso = 1007.4;
+      break;
+    case AmbiguousCase::MC_13_SIMPLE:
+      values = {0.520482995461163, -0.839814387388296, -0.467491517013617, 0.937814095887345, -0.825777099007084, 0.506695544835103, 0.345318915961394, -0.861107217966913};
+      iso = 0.0293;
+      break;
+    default:
+      assert(false);
+  }
+  return iso;
+}
+
+enum class SingularCase
+{
+  SIMPLE,
+  DOUBLE,
+  TRIPLE,
+  TUNNEL_OPEN,
+  TUNNEL,
+  TUNNEL_DOUBLE
+};
+
+template <typename FT>
+FT generate_predefined_singular(const SingularCase topology_case,
+                                std::array<FT, 8>& values)
+{
+  FT iso;
+  bool invert;
+
+  switch (topology_case) {
+    case SingularCase::SIMPLE:
+      values = {-1, 1, -1, -1, -1, -1, -1, 1};
+      iso = 0;
+      invert = false;
+      break;
+    case SingularCase::DOUBLE:
+      values = {-1, -1, -0.5, 0.5, -2, 1, 0.5, -0.5};
+      iso = 0;
+      invert = false;
+      break;
+    case SingularCase::TRIPLE:
+      values = {-1, 1, -1, -1, 1, -1, -1, 1};
+      iso = 0;
+      invert = false;
+      break;
+    case SingularCase::TUNNEL_OPEN:
+      values = {-0.5, 0.5, -0.4, 0.46, 0.5, -0.5, 0.71, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case SingularCase::TUNNEL:
+      values = {-0.5, 0.5, -0.33, 0.46, 0.5, -0.5, 0.71, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case SingularCase::TUNNEL_DOUBLE:
+      values = {-1.2, -0.6, 1.2, 0.9, 9.7, 0.6, -9.7, -0.9};
+      iso = 0;
+      invert = false;
+      break;
+    default:
+      assert(false);
+  }
+
+  for (FT& v : values)
+  {
+    if (invert)
+      v = 2 * iso - v;
+  }
+
+  return iso;
+}
+
+enum class IsoEdgeCase
+{
+  SIMPLE,
+  SEPARATED,
+  SINGULAR,
+  DOUBLE_SINGULAR_SIMPLE,
+  DOUBLE_SINGULAR,
+  DOUBLE_SINGULAR_SPLIT,
+  WEDGE,
+  WEDGE_SINGULAR,
+  EDGE_TUNNEL
+};
+
+template <typename FT>
+FT generate_predefined_iso_edge(const IsoEdgeCase topology_case,
+                                std::array<FT, 8>& values)
+{
+  FT iso;
+  bool invert;
+
+  switch (topology_case) {
+    case IsoEdgeCase::SIMPLE:
+      values = {0, 0, -0.4, -0.3, 0.7, 0.5, -0.71, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::SEPARATED:
+      values = {0, 0, 0.4, 0.3, 0.7, 0.5, -0.71, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::SINGULAR:
+      values = {0, 0, 0.4, 0.3, -0.7, 0.5, -0.71, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::DOUBLE_SINGULAR_SIMPLE:
+      values = {0, 0, -0.8, 0.3, -0.7, 0.5, -0.2, 0.1};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::DOUBLE_SINGULAR:
+      values = {0, 0, -0.2, 0.3, -0.7, 0.5, -0.2, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::DOUBLE_SINGULAR_SPLIT:
+      values = {0, 0, 0.2, -0.3, -0.7, 0.5, -0.2, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::WEDGE:
+      values = {0, 0, -0.4, -0.3, 0, 0.5, -0.2, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::WEDGE_SINGULAR:
+      values = {0, 0, 0.2, 0.3, 0, 0.5, -0.2, -0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case IsoEdgeCase::EDGE_TUNNEL:
+      values = {0.3, 0.4, 0.7, -0.4, -0.7, 0, 0.4, 0};
+      iso = 0;
+      invert = false;
+      break;
+    default:
+      assert(false);
+  }
+
+  for (FT& v : values)
+  {
+    if (invert)
+      v = 2 * iso - v;
+  }
+
+  return iso;
+}
+
+enum class PlaneCase
+{
+  SIMPLE,
+  INTERSECTING,
+  PLANE_TUBES,
+  CROSS,
+};
+
+template <typename FT>
+FT generate_predefined_plane(const PlaneCase topology_case,
+                             std::array<FT, 8>& values)
+{
+  FT iso;
+  bool invert;
+
+  switch (topology_case) {
+    case PlaneCase::SIMPLE:
+      values = {0, 0, 0, 0, 0.7, 0.5, 0.71, 0.92};
+      iso = 0;
+      invert = false;
+      break;
+    case PlaneCase::INTERSECTING:
+      values = {-12, -91, 12, 91, 97, 9, -97, -9};
+      iso = 0;
+      invert = false;
+      break;
+    case PlaneCase::PLANE_TUBES:
+      values = {-0.5, 0, 0.4, 0, 0.5, 0, -0.5, 0};
+      iso = 0;
+      invert = false;
+      break;
+    case PlaneCase::CROSS:
+      values = {1, -1, -1, 1, -1, 1, 1, -1};
+      iso = 0;
+      invert = false;
+      break;
+    default:
+      assert(false);
+  }
+
+  for (FT& v : values)
+  {
+    if (invert)
+      v = 2 * iso - v;
+  }
+
+  return iso;
+}
+
+// export meshes to compare tmc and mc to the high resolution trilinear interpolation
+template<typename KERNEL>
+void compare_tmc_mc_trilinear(const std::array<typename KERNEL::FT, 8>& case_values,
+                              typename KERNEL::FT iso)
+{
+  using K = KERNEL;
+
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+  using Point = typename K::Point_3;
+
+  using Point_range = std::vector<Point>;
+  using Triangle_range = std::vector<std::vector<std::size_t> >;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+
+  Grid grid { Point{-1., -1., -1.}, Point{1., 1., 1.}, std::array<std::size_t, 3>{2, 2, 2} };
+  Values values { grid };
+  Domain domain { grid, values };
+
+  write_debug_grid(domain, "debug_grid_2x2.off");
+
+  to_grid(grid, values, case_values);
+
+  {
+    Grid grid_high_res { Point{-1., -1., -1.}, Point{1., 1., 1.}, std::array<std::size_t, 3>{51, 51, 51} };
+    IS::Value_function_3<Grid> values_high_res { values, grid_high_res };
+    IS::Marching_cubes_domain_3<Grid, IS::Value_function_3<Grid>> domain_high_res { grid_high_res, values_high_res };
+
+    Point_range points_high_res;
+    Triangle_range triangles_high_res;
+    IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain_high_res, iso, points_high_res, triangles_high_res, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+#ifdef CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+    CGAL::IO::write_polygon_soup("trilinear.off", points_high_res, triangles_high_res);
+#endif
+
+    assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles_high_res));
+    Mesh m;
+    CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points_high_res, triangles_high_res, m);
+
+    std::cout << "components: " << connected_components(m) << std::endl;
+    std::cout << "euler: " << euler_characteristic(m) << std::endl;
+    std::cout << "boundaries: " << boundary_components(m) << std::endl;
+  }
+
+  {
+    Point_range points_mc;
+    Triangle_range triangles_mc;
+    IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, iso, points_mc, triangles_mc, CGAL::parameters::use_topologically_correct_marching_cubes(false));
+
+#ifdef CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+    CGAL::IO::write_polygon_soup("mc.off", points_mc, triangles_mc);
+#endif
+  }
+
+  Point_range points;
+  Triangle_range triangles;
+  IS::marching_cubes<CGAL::Sequential_tag>(domain, iso, points, triangles, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+#ifdef CGAL_TESTSUITE_ISOSURFACING_OUTPUT
+  CGAL::IO::write_polygon_soup("tmc.off", points, triangles);
+#endif
+}
+
+// check if the mesh created by tmc has the expected topological properties
+template<typename KERNEL>
+void assert_tmc(const std::array<typename KERNEL::FT, 8>& case_values,
+                typename KERNEL::FT iso,
+                std::size_t components,
+                int euler,
+                std::size_t boundaries)
+{
+  using K = KERNEL;
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+  using Point = typename K::Point_3;
+  using Mesh = CGAL::Surface_mesh<Point>;
+  using Point_range = std::vector<Point>;
+  using Triangle_range = std::vector<std::vector<std::size_t> >;
+
+  {
+    Grid grid { Point{-1., -1., -1.}, Point{1., 1., 1.}, std::array<std::size_t, 3>{2, 2, 2} };
+    Values values { grid };
+    Domain domain { grid, values };
+
+    to_grid(grid, values, case_values);
+
+    Point_range points;
+    Triangle_range triangles;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain, iso, points, triangles, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+    assert(points.size() && triangles.size());
+    assert(!has_duplicate_points(points, triangles));
+    assert(!has_duplicate_polygons(points, triangles));
+    assert(!has_isolated_vertices(points, triangles));
+
+    assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles));
+    Mesh m;
+    CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, m);
+
+    assert(connected_components(m) == components);
+    assert(euler_characteristic(m) == euler);
+    assert(boundary_components(m) == boundaries);
+  }
+
+  {
+    Grid grid_closed { Point{-1., -1., -1.}, Point{1., 1., 1.}, std::array<std::size_t, 3>{4, 4, 4} };
+    Values values_closed { grid_closed };
+    Domain domain_closed { grid_closed, values_closed };
+
+    embed_in_positive_grid(grid_closed, values_closed, case_values);
+
+    Point_range points;
+    Triangle_range triangles;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain_closed, iso, points, triangles, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+    assert(points.size() && triangles.size());
+    assert(!has_duplicate_points(points, triangles));
+    assert(!has_duplicate_polygons(points, triangles));
+    assert(!has_isolated_vertices(points, triangles));
+
+    assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles));
+    Mesh m;
+    CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, m);
+
+    assert(!has_degenerate_faces(m));
+    assert(is_manifold(m));
+    assert(is_watertight(m));
+  }
+}
+
+template <typename K>
+void test_cube()
+{
+  using FT = typename K::FT;
+  using Point = typename K::Point_3;
+  using Vector = typename K::Vector_3;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Value_function_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+
+  auto implicit_function = [](const Point& q) -> FT
+  {
+  // ---
+    auto b1 = [](const Point& q) { return IS::Shapes::box<K>(Point(-1,-1,-1), Point(1,1,1), q); };
+    auto s1 = [](const Point& q) { return IS::Shapes::sphere<K>(Point(0,0,0), 1, q); };
+    auto cyl1 = [](const Point& q) { return IS::Shapes::infinite_cylinder<K>(Point(0,0,0), Vector(0,0,1), 0.5, q); };
+    auto cyl2 = [](const Point& q) { return IS::Shapes::infinite_cylinder<K>(Point(0,0,0), Vector(0,1,0), 0.5, q); };
+    auto cyl3 = [](const Point& q) { return IS::Shapes::infinite_cylinder<K>(Point(0,0,0), Vector(1,0,0), 0.5, q); };
+
+    auto b1_is1 = [&](const Point& q) { return IS::Shapes::shape_intersection<K>(b1, s1, q); };
+    auto cyl1_cyl2 = [&](const Point& q) { return IS::Shapes::shape_union<K>(cyl1, cyl2, q); };
+    auto cyl1_cyl2_cyl3 = [&](const Point& q) { return IS::Shapes::shape_union<K>(cyl1_cyl2, cyl3, q); };
+
+    auto b1_ms1_mcyl1_mcyl2 = [&](const Point& q) { return IS::Shapes::shape_difference<K>(b1_is1, cyl1_cyl2_cyl3, q); };
+
+    return b1_ms1_mcyl1_mcyl2(q);
+  };
+
+  const CGAL::Bbox_3 bbox = {-2., -2., -2., 2., 2., 2.};
+  const Vector spacing { 0.05, 0.05, 0.05 };
+  const FT isovalue = 0;
+
+  std::cout << "\n ---- " << std::endl;
+  std::cout << "Running TMC (Implicit function) with isovalue = " << isovalue << std::endl;
+  std::cout << "Kernel: " << typeid(K).name() << std::endl;
+
+  Grid grid { bbox, spacing };
+  Values values {implicit_function , grid };
+  Domain domain { grid, values };
+
+  Mesh debug_grid;
+  auto debug_grid_creator = [&](const typename Domain::cell_descriptor& c)
+    {
+      std::vector<typename Mesh::Vertex_index> cell_vertices;
+      for (const auto& v : domain.cell_vertices(c)) {
+        cell_vertices.push_back(debug_grid.add_vertex(domain.point(v)));
+      }
+      debug_grid.add_face(cell_vertices[6], cell_vertices[2], cell_vertices[0], cell_vertices[4]);
+      debug_grid.add_face(cell_vertices[1], cell_vertices[3], cell_vertices[7], cell_vertices[5]);
+      debug_grid.add_face(cell_vertices[0], cell_vertices[1], cell_vertices[5], cell_vertices[4]);
+      debug_grid.add_face(cell_vertices[6], cell_vertices[7], cell_vertices[3], cell_vertices[2]);
+      debug_grid.add_face(cell_vertices[2], cell_vertices[3], cell_vertices[1], cell_vertices[0]);
+      debug_grid.add_face(cell_vertices[4], cell_vertices[5], cell_vertices[7], cell_vertices[6]);
+    };
+    domain.template for_each_cell<CGAL::Sequential_tag>(debug_grid_creator);
+  CGAL::IO::write_OFF("debug_grid.off", debug_grid);
+
+  Point_range points;
+  Polygon_range polygons;
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain, isovalue, points, polygons, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+  std::cout << "Output #vertices: " << points.size() << std::endl;
+  std::cout << "Output #polygons: " << polygons.size() << std::endl;
+
+  CGAL::IO::write_polygon_soup("test_cube.off", points, polygons, CGAL::parameters::stream_precision(17));
+}
+
+template<typename KERNEL>
+void test_all_ambiguous_cases()
+{
+  using FT = typename KERNEL::FT;
+
+  std::cout << "Testing ambiguous cases..." << std::endl;
+
+  std::array<FT, 8> case_values;
+  FT iso;
+
+  std::cout << "\tTesting case 'CONTOUR_6_VTS'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::CONTOUR_6_VTS, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'CONTOUR_7_VTS_CONFIG_A'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::CONTOUR_7_VTS_CONFIG_A, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'CONTOUR_7_VTS_CONFIG_B'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::CONTOUR_7_VTS_CONFIG_B, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'CONTOUR_8_VTS_CONFIG_A'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::CONTOUR_8_VTS_CONFIG_A, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'CONTOUR_8_VTS_CONFIG_B'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::CONTOUR_8_VTS_CONFIG_B, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'CONTOUR_9_VTS_CONFIG_A'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::CONTOUR_9_VTS_CONFIG_A, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'MC_4_TUNNEL'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_4_TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 0, 2);
+
+  std::cout << "\tTesting case 'MC_7_TUNNEL'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_7_TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 0, 2);
+
+  std::cout << "\tTesting case 'MC_10_TUNNEL'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_10_TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 0, 2);
+
+  std::cout << "\tTesting case 'MC_12_TUNNEL'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_12_TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 0, 2);
+
+  std::cout << "\tTesting case 'MC_13_TUNNEL'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_13_TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 2, 1, 3);
+
+  std::cout << "\tTesting case 'MC_13_12_VTS_CONFIG_A'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_13_12_VTS_CONFIG_A, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'MC_13_12_VTS_CONFIG_B'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_13_12_VTS_CONFIG_B, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'MC_13_SIMPLE'..." << std::endl;
+  iso = generate_predefined_inner_ambiguity(AmbiguousCase::MC_13_SIMPLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 3, 3, 3);
+}
+
+template<typename KERNEL>
+void test_all_singular_cases()
+{
+  using FT = typename KERNEL::FT;
+
+  std::cout << "Testing singular cases..." << std::endl;
+
+  std::array<FT, 8> case_values;
+  FT iso;
+
+  std::cout << "\tTesting case 'SIMPLE'..." << std::endl;
+  iso = generate_predefined_singular(SingularCase::SIMPLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+
+  std::cout << "\tTesting case 'DOUBLE'..." << std::endl;
+  iso = generate_predefined_singular(SingularCase::DOUBLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+
+  std::cout << "\tTesting case 'TRIPLE'..." << std::endl;
+  iso = generate_predefined_singular(SingularCase::TRIPLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+
+  std::cout << "\tTesting case 'TUNNEL_OPEN'..." << std::endl;
+  iso = generate_predefined_singular(SingularCase::TUNNEL_OPEN, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+
+  std::cout << "\tTesting case 'TUNNEL'..." << std::endl;
+  iso = generate_predefined_singular(SingularCase::TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+
+  std::cout << "\tTesting case 'TUNNEL_DOUBLE'..." << std::endl;
+  iso = generate_predefined_singular(SingularCase::TUNNEL_DOUBLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+}
+
+template<typename KERNEL>
+void test_all_iso_edge_cases()
+{
+  using FT = typename KERNEL::FT;
+
+  std::cout << "Testing iso edge cases..." << std::endl;
+
+  std::array<FT, 8> case_values;
+  FT iso;
+
+  std::cout << "\tTesting case 'SIMPLE'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::SIMPLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'SEPARATED'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::SEPARATED, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+
+  std::cout << "\tTesting case 'SINGULAR'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::SINGULAR, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'DOUBLE_SINGULAR_SIMPLE'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::DOUBLE_SINGULAR_SIMPLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'DOUBLE_SINGULAR'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::DOUBLE_SINGULAR, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'DOUBLE_SINGULAR_SPLIT'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::DOUBLE_SINGULAR_SPLIT, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 2, 2, 2);
+
+  std::cout << "\tTesting case 'WEDGE'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::WEDGE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+
+  std::cout << "\tTesting case 'WEDGE_SINGULAR'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::WEDGE_SINGULAR, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'EDGE_TUNNEL'..." << std::endl;
+  iso = generate_predefined_iso_edge(IsoEdgeCase::EDGE_TUNNEL, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+}
+
+// this category includes cases that are almost always non-manifold
+template<typename KERNEL>
+void test_all_plane_cases()
+{
+  using FT = typename KERNEL::FT;
+
+  std::cout << "Testing plane cases..." << std::endl;
+
+  std::array<FT, 8> case_values;
+  FT iso;
+
+  std::cout << "\tTesting case 'SIMPLE'..." << std::endl;
+  iso = generate_predefined_plane(PlaneCase::SIMPLE, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 1, 1, 1);
+
+  std::cout << "\tTesting case 'INTERSECTING'..." << std::endl;
+  iso = generate_predefined_plane(PlaneCase::INTERSECTING, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 2, 2, 2);
+
+  std::cout << "\tTesting case 'PLANE_TUBES'..." << std::endl;
+  iso = generate_predefined_plane(PlaneCase::PLANE_TUBES, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 2, 2, 2);
+
+  std::cout << "\tTesting case 'CROSS'..." << std::endl;
+  iso = generate_predefined_plane(PlaneCase::CROSS, case_values);
+  compare_tmc_mc_trilinear<KERNEL>(case_values, iso);
+  assert_tmc<KERNEL>(case_values, iso, 4, 4, 4);
+}
+
+int main(int, char**)
+{
+  using K = CGAL::Simple_cartesian<double>;
+
+  test_all_ambiguous_cases<K>();
+  test_all_singular_cases<K>();
+  test_all_iso_edge_cases<K>();
+  test_all_plane_cases<K>();
+
+  // this is the example, where the issue was originally discovered
+  test_cube<K>();
+
+  std::cout << "Done" << std::endl;
+  return EXIT_SUCCESS;
+}
diff --git a/Isosurfacing_3/test/Isosurfacing_3/test_util.h b/Isosurfacing_3/test/Isosurfacing_3/test_util.h
new file mode 100644
index 00000000000..c35f9705ef3
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/test_util.h
@@ -0,0 +1,137 @@
+#ifndef CGAL_ISOSURFACING_TEST_UTIL_H
+#define CGAL_ISOSURFACING_TEST_UTIL_H
+
+#include <CGAL/Polygon_mesh_processing/distance.h>
+#include <CGAL/Polygon_mesh_processing/manifoldness.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/repair.h>
+#include <CGAL/Polygon_mesh_processing/repair_degeneracies.h>
+#include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Named_function_parameters.h>
+#include <CGAL/boost/graph/named_params_helper.h>
+
+#include <cassert>
+#include <iostream>
+
+template <typename PointRange, typename PolygonRange>
+bool has_duplicate_points(PointRange points, PolygonRange polygons) // intentional copies
+{
+  return CGAL::Polygon_mesh_processing::merge_duplicate_points_in_polygon_soup(points, polygons) != 0;
+}
+
+template <typename PointRange, typename PolygonRange>
+bool has_duplicate_polygons(PointRange points, PolygonRange polygons)
+{
+  return CGAL::Polygon_mesh_processing::merge_duplicate_polygons_in_polygon_soup(points, polygons) != 0;
+}
+
+template <typename PointRange, typename PolygonRange>
+bool has_isolated_vertices(PointRange points, PolygonRange polygons)
+{
+  return CGAL::Polygon_mesh_processing::remove_isolated_points_in_polygon_soup(points, polygons) != 0;
+}
+
+template <typename PolygonMesh>
+bool is_manifold(PolygonMesh& pmesh)
+{
+  return CGAL::Polygon_mesh_processing::duplicate_non_manifold_vertices(pmesh, CGAL::parameters::dry_run(true)) == 0;
+}
+
+template <typename PolygonMesh>
+bool is_self_intersecting(const PolygonMesh& pmesh) {
+  return CGAL::Polygon_mesh_processing::does_self_intersect(pmesh);
+}
+
+template <typename PolygonMesh>
+bool is_watertight(PolygonMesh& pmesh) {
+  const bool manifold = is_manifold(pmesh);
+  const bool closed = is_closed(pmesh);
+  const bool self_intersecting = is_self_intersecting(pmesh);
+  return manifold && closed && !self_intersecting;
+}
+
+template <typename PolygonMesh>
+bool has_degenerate_faces(PolygonMesh& pmesh)
+{
+  std::set<typename boost::graph_traits<PolygonMesh>::face_descriptor> dfs;
+  CGAL::Polygon_mesh_processing::degenerate_faces(pmesh, std::inserter(dfs, dfs.begin()));
+  return !dfs.empty();
+}
+
+template <typename PolygonMesh>
+std::size_t connected_components(PolygonMesh& mesh)
+{
+  using face_descriptor = typename boost::graph_traits<PolygonMesh>::face_descriptor;
+
+  auto fccmap = mesh.template add_property_map<face_descriptor, std::size_t>("f:CC").first;
+
+  return CGAL::Polygon_mesh_processing::connected_components(mesh, fccmap);
+}
+
+template <typename PolygonMesh>
+int euler_characteristic(const PolygonMesh& mesh)
+{
+  return mesh.number_of_vertices() - mesh.number_of_edges() + mesh.number_of_faces();
+}
+
+template <typename PolygonMesh>
+std::size_t boundary_components(const PolygonMesh& mesh)
+{
+  using halfedge_descriptor = typename boost::graph_traits<PolygonMesh>::halfedge_descriptor;
+  std::vector<halfedge_descriptor> border_cycles;
+
+  CGAL::Polygon_mesh_processing::extract_boundary_cycles(mesh, std::back_inserter(border_cycles));
+
+  return border_cycles.size();
+}
+
+template <typename PolygonMesh>
+int betti_0(PolygonMesh& mesh) {
+    return connected_components(mesh);
+}
+
+template <typename PolygonMesh>
+int betti_2(PolygonMesh& mesh) {
+    return connected_components(mesh); // only for closed surfaces
+}
+
+template <typename PolygonMesh>
+int betti_1(PolygonMesh& mesh) {
+    return betti_0(mesh) + betti_2(mesh) - euler_characteristic(mesh);
+}
+
+// template <typename PolygonMesh>
+// bool check_mesh_distance(const PolygonMesh& m0, const PolygonMesh& m1)
+// {
+//   auto dist = CGAL::Polygon_mesh_processing::approximate_Hausdorff_distance<CGAL::Sequential_tag>(
+//     m0, m1, CGAL::parameters::number_of_points_per_area_unit(4000));
+//   std::cout << dist << std::endl;
+//   return true;
+// }
+
+template<typename Domain>
+void write_debug_grid(const Domain& domain, const std::string& filename) {
+  using Point = typename Domain::Geom_traits::Point_3;
+  using Mesh = CGAL::Surface_mesh<Point>;
+
+  Mesh debug_grid;
+  auto debug_grid_creator = [&](const typename Domain::cell_descriptor& c)
+  {
+    std::vector<typename Mesh::Vertex_index> cell_vertices;
+    for (const auto& v : domain.cell_vertices(c)) {
+      cell_vertices.push_back(debug_grid.add_vertex(domain.point(v)));
+    }
+    debug_grid.add_face(cell_vertices[6], cell_vertices[2], cell_vertices[0], cell_vertices[4]);
+    debug_grid.add_face(cell_vertices[1], cell_vertices[3], cell_vertices[7], cell_vertices[5]);
+    debug_grid.add_face(cell_vertices[0], cell_vertices[1], cell_vertices[5], cell_vertices[4]);
+    debug_grid.add_face(cell_vertices[6], cell_vertices[7], cell_vertices[3], cell_vertices[2]);
+    debug_grid.add_face(cell_vertices[2], cell_vertices[3], cell_vertices[1], cell_vertices[0]);
+    debug_grid.add_face(cell_vertices[4], cell_vertices[5], cell_vertices[7], cell_vertices[6]);
+  };
+  domain.template for_each_cell<CGAL::Sequential_tag>(debug_grid_creator);
+  CGAL::IO::write_OFF(filename, debug_grid);
+}
+
+#endif // CGAL_ISOSURFACING_TEST_UTIL_H
diff --git a/Isosurfacing_3/test/Isosurfacing_3/verifier.cpp b/Isosurfacing_3/test/Isosurfacing_3/verifier.cpp
new file mode 100644
index 00000000000..568423ab927
--- /dev/null
+++ b/Isosurfacing_3/test/Isosurfacing_3/verifier.cpp
@@ -0,0 +1,245 @@
+#include "test_util.h"
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Isosurfacing_3/Cartesian_grid_3.h>
+#include <CGAL/Isosurfacing_3/marching_cubes_3.h>
+#include <CGAL/Isosurfacing_3/Marching_cubes_domain_3.h>
+#include <CGAL/Isosurfacing_3/Interpolated_discrete_values_3.h>
+#include <CGAL/Isosurfacing_3/Value_function_3.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+/*
+Verifier for topological correctness
+Based on: Topology Verification for Isosurface Extraction, Tiago Etiene
+Data sets: [Marching Cubes cases] [Randomly generated grids] from http://liscustodio.github.io/C_MC33/
+*/
+
+namespace IS = CGAL::Isosurfacing;
+
+template <typename Grid, typename Values>
+void read_iso_volume(const std::string& filename, Grid& grid, Values& values)
+{
+  using Geom_traits = typename Grid::Geom_traits;
+  using Iso_cuboid_3 = typename Geom_traits::Iso_cuboid_3;
+  typename Geom_traits::Construct_point_3 point = grid.geom_traits().construct_point_3_object();
+  typename Geom_traits::Construct_iso_cuboid_3 iso_cuboid = grid.geom_traits().construct_iso_cuboid_3_object();
+
+  std::ifstream file(filename, std::ios::binary);
+  if (!file.is_open()) {
+      throw std::runtime_error("Cannot open file: " + filename);
+  }
+
+  // Read the three dimensions
+  int nx, ny, nz;
+  file.read(reinterpret_cast<char*>(&nx), sizeof(int));
+  file.read(reinterpret_cast<char*>(&ny), sizeof(int));
+  file.read(reinterpret_cast<char*>(&nz), sizeof(int));
+
+  // Read the bounding box
+  // (xmin, xmax, ymin, ymax, zmin, zmax)
+  std::array<float, 6> bbox;
+  for (int i = 0; i < 6; ++i) {
+    file.read(reinterpret_cast<char*>(&bbox[i]), sizeof(float));
+  }
+
+  Iso_cuboid_3 span = iso_cuboid(point(bbox[0], bbox[2], bbox[4]),
+                                 point(bbox[1], bbox[3], bbox[5]));
+  grid = Grid { span, CGAL::make_array<std::size_t>(nx, ny, nz) };
+
+  // Calculate total number of data points
+  const std::size_t total_points = nx * ny * nz;
+
+  // Read the volume data (32-bit floats)
+  std::vector<float> volume_data(total_points);
+  for (std::size_t i = 0; i < total_points; ++i) {
+    file.read(reinterpret_cast<char*>(&volume_data[i]), sizeof(float));
+    //std::cout << volume_data[i] << std::endl;
+  }
+
+  for(int x=0; x<nx; ++x)
+    for(int y=0; y<ny; ++y)
+      for(int z=0; z<nz; ++z)
+        values(x, y, z) = volume_data[x + y * nx + z * nx * ny];
+
+  file.close();
+}
+
+int read_euler(const std::string& filename) {
+  std::ifstream file(filename);
+  if (!file.is_open()) {
+      throw std::runtime_error("Cannot open file: " + filename);
+  }
+  int euler;
+  file >> euler;
+  return euler;
+}
+
+std::array<int, 2> read_betti(const std::string& filename) {
+  std::ifstream file(filename);
+  if (!file.is_open()) {
+      throw std::runtime_error("Cannot open file: " + filename);
+  }
+  int b0, b1;
+  file >> b0;
+  file >> b1;
+  return {b0, b1};
+}
+
+template <typename K>
+void verify_euler() {
+  using Point = typename K::Point_3;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+
+  std::cout << "  == Verify Euler ==" << std::endl;
+
+  const std::size_t num_tests = 10000;
+
+  for (std::size_t i = 0; i < num_tests; i++) {
+    Grid grid;
+    Values values { grid };
+    Domain domain { grid, values };
+
+    std::string filename = "/path/to/data/MarchingCubes_cases/Grids/" + std::to_string(i) + "-scalar_field.iso";
+
+    std::cout << "Verify " << filename << "..." << std::endl;
+
+    read_iso_volume(filename, grid, values);
+
+    Point_range points;
+    Polygon_range triangles;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain, 0, points, triangles, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+    CGAL::IO::write_polygon_soup("last_result.off", points, triangles);
+
+    assert(points.size() && triangles.size());
+    assert(!has_duplicate_points(points, triangles));
+    assert(!has_duplicate_polygons(points, triangles));
+    assert(!has_isolated_vertices(points, triangles));
+
+    assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles));
+    Mesh m;
+    CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, m);
+
+    const int euler = euler_characteristic(m);
+    const int solution = read_euler("/path/to/data/MarchingCubes_cases/Grid_invariants/" + std::to_string(i) + "-euler_number.txt");
+
+    if (euler != solution)
+      std::cout << "error in test " << i << ": euler " << euler << " != " << solution << std::endl;
+  }
+}
+
+template <typename K>
+void verify_betti()
+{
+  using Point = typename K::Point_3;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+  using Mesh = CGAL::Surface_mesh<Point>;
+
+  std::cout << "  == Verify Betti ==" << std::endl;
+
+  const std::size_t num_tests = 10000;
+
+  for (std::size_t i = 0; i < num_tests; i++) {
+
+    Grid grid;
+    Values values { grid };
+    Domain domain { grid, values };
+
+    std::string filename = "/path/to/data/Closed_Surfaces/Grids/" + std::to_string(i) + "-scalar_field.iso";
+
+    std::cout << "Verify " << filename << "..." << std::endl;
+
+    read_iso_volume(filename, grid, values);
+
+    Point_range points;
+    Polygon_range triangles;
+    IS::marching_cubes<CGAL::Sequential_tag>(domain, 0, points, triangles, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+    CGAL::IO::write_polygon_soup("last_result.off", points, triangles);
+
+    assert(points.size() && triangles.size());
+    assert(!has_duplicate_points(points, triangles));
+    assert(!has_duplicate_polygons(points, triangles));
+    assert(!has_isolated_vertices(points, triangles));
+
+    assert(CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(triangles));
+    Mesh m;
+    CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, triangles, m);
+
+    const int b0 = betti_0(m);
+    const int b1 = betti_1(m);
+    const auto solution = read_betti("/path/to/data/Closed_Surfaces/InvariantsGrid/" + std::to_string(i) + "-invariant_grid.txt");
+
+    if (b0 != solution[0])
+      std::cout << "error in test " << i << ": b0 " << b0 << " != " << solution[0] << std::endl;
+    if (b1 != (solution[1] * 2))
+      std::cout << "error in test " << i << ": b1 " << b1 << " != " << solution[1] << std::endl;
+
+  }
+}
+
+template <typename K>
+void compare_to_reference(const std::string& filename)
+{
+  using Point = typename K::Point_3;
+
+  using Grid = IS::Cartesian_grid_3<K>;
+  using Values = IS::Interpolated_discrete_values_3<Grid>;
+  using Domain = IS::Marching_cubes_domain_3<Grid, Values>;
+
+  using Point_range = std::vector<Point>;
+  using Polygon_range = std::vector<std::vector<std::size_t> >;
+
+  Grid grid;
+  Values values { grid };
+  Domain domain { grid, values };
+
+  read_iso_volume(filename, grid, values);
+
+  Point_range points;
+  Polygon_range triangles;
+  IS::marching_cubes<CGAL::Sequential_tag>(domain, 0, points, triangles, CGAL::parameters::use_topologically_correct_marching_cubes(true).isovalue_nudging(true).constrain_to_cell(true));
+
+  CGAL::IO::write_polygon_soup("verify_tmc_orig.off", points, triangles, CGAL::parameters::stream_precision(17));
+
+  Grid grid_high_res { grid.span().min(), grid.span().max(), std::array<std::size_t, 3>{151, 151, 151} };
+  IS::Value_function_3<Grid> values_high_res { values, grid_high_res };
+  IS::Marching_cubes_domain_3<Grid, IS::Value_function_3<Grid>> domain_high_res { grid_high_res, values_high_res };
+
+  Point_range points_high_res;
+  Polygon_range triangles_high_res;
+  IS::marching_cubes<CGAL::Parallel_if_available_tag>(domain_high_res, 0, points_high_res, triangles_high_res, CGAL::parameters::use_topologically_correct_marching_cubes(true));
+
+  CGAL::IO::write_polygon_soup("verify_reference.off", points_high_res, triangles_high_res);
+
+  //write_debug_grid(domain, "verify_cell.off");
+}
+
+int main(int, char**)
+{
+  using K = CGAL::Simple_cartesian<double>;
+
+  verify_euler<K>();
+  verify_betti<K>();
+  //compare_to_reference<K>("/path/to/data/MarchingCubes_cases/Grids/" + std::to_string(100) + "-scalar_field.iso");
+  // compare_to_reference<K>("/path/to/data/Closed_Surfaces/Grids/" + std::to_string(0) + "-scalar_field.iso");
+}
\ No newline at end of file
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h b/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
index c2606d52cac..6ca223f77c6 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
@@ -99,7 +99,7 @@ Test for inequality.
 bool operator!=(const Iso_cuboid_3<Kernel> &c2) const;
 
 /*!
-returns the i'th vertex modulo 8 of `c`.
+returns the i-th vertex modulo 8 of `c`.
 starting with the lower left vertex.
 \cgalEpicExact
 */
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
index 602cdc2386e..4876de76514 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
@@ -95,7 +95,7 @@ Test for inequality.
 bool operator!=(const Iso_rectangle_2<Kernel> &r2) const;
 
 /*!
-returns the i'th vertex modulo 4 of `r` in counterclockwise order,
+returns the i-th vertex modulo 4 of `r` in counterclockwise order,
 starting with the lower left vertex.
 \cgalEpicExact
 */
@@ -144,7 +144,7 @@ returns the \f$ y\f$ coordinate of upper right vertex of `r`.
 Kernel::FT ymax() const;
 
 /*!
-returns the `i`'th %Cartesian coordinate of the
+returns the `i`-th %Cartesian coordinate of the
 lower left vertex of `r`.
 \pre `0 <= i <= 1`.
 
@@ -153,7 +153,7 @@ lower left vertex of `r`.
 Kernel::FT min_coord(int i) const;
 
 /*!
-returns the `i`'th %Cartesian coordinate of the
+returns the `i`-th %Cartesian coordinate of the
 upper right vertex of `r`.
 \pre `0 <= i <= 1`.
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
index a0a6315a867..4af9a71a2b2 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
@@ -163,13 +163,13 @@ Kernel::FT y() const;
 /// @{
 
 /*!
-returns the i'th homogeneous coordinate of `p`.
+returns the i-th homogeneous coordinate of `p`.
 \pre `0 <= i <= 2`.
 */
 Kernel::RT homogeneous(int i) const;
 
 /*!
-returns the i'th %Cartesian coordinate of `p`.
+returns the i-th %Cartesian coordinate of `p`.
 \pre `0 <= i <= 1`.
 
 \cgalEpicExact
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Point_3.h b/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
index d22c3589164..e0ec7c20c3d 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
@@ -160,13 +160,13 @@ Kernel::FT z() const;
 /// @{
 
 /*!
-returns the i'th homogeneous coordinate of `p`.
+returns the i-th homogeneous coordinate of `p`.
 \pre `0 <= i <= 3`.
 */
 Kernel::RT homogeneous(int i) const;
 
 /*!
-returns the i'th %Cartesian coordinate of `p`.
+returns the i-th %Cartesian coordinate of `p`.
 \pre `0 <= i <= 2`.
 
 \cgalEpicExact
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
index 4b28f7dd1bd..055ec11736f 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
@@ -72,7 +72,7 @@ typedef Line_3<K> Line_2;
 /// constructors required to build the dual Voronoi diagram. The
 /// functors operate on the 2D projection of their arguments. They
 /// come with preconditions that projections of the arguments are
-/// non-degenerate, eg. a line segment does not project on a single
+/// non-degenerate, e.g. a line segment does not project on a single
 /// point, two points do not project on the same point, etc. In the
 /// following, we specify the choice of the `z`-coordinate in case a
 /// new point is constructed.
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
index eee115731e1..c8f8aef1806 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
@@ -54,7 +54,7 @@ Test for inequality.
 bool operator!=(const Tetrahedron_3<Kernel> &t2) const;
 
 /*!
-returns the i'th vertex modulo 4 of `t`.
+returns the i-th vertex modulo 4 of `t`.
 \cgalEpicExact
 */
 Point_3<Kernel> vertex(int i) const;
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
index 11a9c516269..08ec687bb82 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
@@ -49,7 +49,7 @@ Test for inequality.
 bool operator!=(const Triangle_2<Kernel> &t2) const;
 
 /*!
-returns the i'th vertex modulo 3 of `t`.
+returns the i-th vertex modulo 3 of `t`.
 \cgalEpicExact
 */
 Point_2<Kernel> vertex(int i) const;
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h b/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
index 4efcfac0752..00755f7cc20 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
@@ -44,7 +44,7 @@ Test for inequality.
 bool operator!=(const Triangle_3<Kernel> &t2) const;
 
 /*!
-returns the i'th vertex modulo 3 of `t`.
+returns the i-th vertex modulo 3 of `t`.
 \cgalEpicExact
 */
 Point_3<Kernel> vertex(int i) const;
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
index 5f77fcd9c84..8a2236104b0 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
@@ -128,13 +128,13 @@ Kernel::FT y() const;
 
 
 /*!
-returns the i'th homogeneous coordinate of `v`.
+returns the i-th homogeneous coordinate of `v`.
 \pre `0 <= i <= 2`.
 */
 Kernel::RT homogeneous(int i) const;
 
 /*!
-returns the i'th %Cartesian coordinate of `v`.
+returns the i-th %Cartesian coordinate of `v`.
 \pre `0 <= i <= 1`.
 
 \cgalEpicExact
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
index 84c61818845..a4566f5b6bb 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
@@ -141,13 +141,13 @@ Kernel::FT z() const;
 /// @{
 
 /*!
-returns the i'th homogeneous coordinate of `v`.
+returns the i-th homogeneous coordinate of `v`.
 \pre `0 <= i <= 3`.
 */
 Kernel::RT homogeneous(int i) const;
 
 /*!
-returns the i'th %Cartesian coordinate of `v`.
+returns the i-th %Cartesian coordinate of `v`.
 \pre  `0 <= i <= 2`
 
 \cgalEpicExact
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
index f06e42222d3..6cd66c28188 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
@@ -153,13 +153,13 @@ public:
   /// @{
 
   /*!
-  returns the i'th homogeneous coordinate of `p`.
+  returns the i-th homogeneous coordinate of `p`.
   \pre  `0 <= i <= 2`
   */
   Kernel::RT homogeneous(int i) const;
 
   /*!
-  returns the i'th %Cartesian coordinate of `p`.
+  returns the i-th %Cartesian coordinate of `p`.
   \pre  `0 <= i <= 1`
 
   \cgalEpicExact
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
index 8a442b9fb8f..b97f9d48fcf 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
@@ -165,13 +165,13 @@ public:
   /// @{
 
   /*!
-  returns the i'th homogeneous coordinate of `p`.
+  returns the i-th homogeneous coordinate of `p`.
   \pre  `0 <= i <= 3`
   */
   Kernel::RT homogeneous(int i) const;
 
   /*!
-  returns the i'th %Cartesian coordinate of `p`.
+  returns the i-th %Cartesian coordinate of `p`.
   \pre  `0 <= i <= 2`
 
   \cgalEpicExact
diff --git a/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h
index f367f26df4c..b651fa7fa3c 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h
@@ -4009,7 +4009,7 @@ public:
 
 
   /*!
-    returns an iterator on the 0'th %Cartesian coordinate of `p`.
+    returns an iterator on the zeroth %Cartesian coordinate of `p`.
   */
   Kernel::Cartesian_const_iterator_2 operator()(const Kernel::Point_2
                                                 &p);
@@ -4021,7 +4021,7 @@ public:
                                                 &p, int);
 
   /*!
-    returns an iterator on the 0'th %Cartesian coordinate of `v`.
+    returns an iterator on the zeroth %Cartesian coordinate of `v`.
   */
   Kernel::Cartesian_const_iterator_2 operator()(const Kernel::Vector_2
                                                 &v);
@@ -4054,7 +4054,7 @@ public:
   /// @{
 
   /*!
-    returns an iterator on the 0'th %Cartesian coordinate of `p`.
+    returns an iterator on the zeroth %Cartesian coordinate of `p`.
   */
   Kernel::Cartesian_const_iterator_3 operator()(const Kernel::Point_3
                                                 &p);
@@ -4066,7 +4066,7 @@ public:
                                                 &p, int);
 
   /*!
-    returns an iterator on the 0'th %Cartesian coordinate of `v`.
+    returns an iterator on the zeroth %Cartesian coordinate of `v`.
   */
   Kernel::Cartesian_const_iterator_3 operator()(const Kernel::Vector_3
                                                 &v);
@@ -4338,7 +4338,7 @@ public:
     Kernel::Vector_3 const& n);
 
   /*!
-    introduces a variable of type `Kernel::Point_3`.
+    introduces a variable of type `Kernel::Circle_3`.
     It is initialized to the circle passing through the three points.
     \pre The three points are not collinear.
   */
@@ -7074,7 +7074,7 @@ public:
   /*!
     introduces a null vector.
   */
-  Kernel::Vector_2 operator()(const Null_vector &NULL_VECTOR);
+  Kernel::Vector_2 operator()(const CGAL::Null_vector &v);
 
   /// @}
 
@@ -7133,7 +7133,7 @@ public:
   /*!
     introduces a null vector.
   */
-  Kernel::Vector_3 operator()(const Null_vector &NULL_VECTOR);
+  Kernel::Vector_3 operator()(const CGAL::Null_vector &v);
 
 
   /// @}
@@ -7168,7 +7168,7 @@ public:
                              &s, int i);
 
   /*!
-    returns the i'th vertex of
+    returns the i-th vertex of
     `r` in counterclockwise order, starting with the lower left
     vertex. The parameter `i` is taken modulo 4.
   */
@@ -7176,7 +7176,7 @@ public:
                              Kernel::Iso_rectangle_2 &r, int i);
 
   /*!
-    returns the i'th vertex of `t`. The parameter
+    returns the i-th vertex of `t`. The parameter
     `i` is taken modulo 3.
   */
   Kernel::Point_2 operator()(const Kernel::Triangle_2
@@ -7190,9 +7190,6 @@ public:
   \ingroup PkgKernel23ConceptsFunctionObjects
 \cgalConcept
 
-\image html IsoCuboid.png
-\image latex IsoCuboid.png
-
 \cgalRefines{AdaptableBinaryFunction}
 
 \sa `CGAL::Iso_cuboid_3<Kernel>`
@@ -7217,23 +7214,25 @@ public:
                              &s, int i);
 
   /*!
-    returns the i'th vertex of
+    returns the i-th vertex of
     `c`, as indicated in the figure below. The parameter `i` is
     taken modulo 8.
 
+    \image html IsoCuboid.png
+    \image latex IsoCuboid.png
   */
   Kernel::Point_3 operator()(const
                              Kernel::Iso_cuboid_3 &c, int i);
 
   /*!
-    returns the i'th vertex of `t`. The parameter
+    returns the i-th vertex of `t`. The parameter
     `i` is taken modulo 3.
   */
   Kernel::Point_3 operator()(const Kernel::Triangle_3
                              &t, int i);
 
   /*!
-    returns the i'th vertex of
+    returns the i-th vertex of
     `t`. The parameter `i` is taken modulo 4.
   */
   Kernel::Point_3 operator()(const
@@ -7600,7 +7599,7 @@ public:
     and also for `Type1` and `Type2` of respective types
 
     - `Kernel::Triangle_3` and `Kernel::Tetrahedron_3`
-    - `Kernel::Plane_3` and `Kernel::Sphere_3` (or the contrary)
+    - `Kernel::Plane_3` and `Kernel::Sphere_3`
     - `Kernel::Sphere_3` and `Kernel::Sphere_3`.
 
   */
diff --git a/Kernel_23/examples/Kernel_23/MyConstruct_point_2.h b/Kernel_23/examples/Kernel_23/MyConstruct_point_2.h
index 962bdd88742..8e9407486d3 100644
--- a/Kernel_23/examples/Kernel_23/MyConstruct_point_2.h
+++ b/Kernel_23/examples/Kernel_23/MyConstruct_point_2.h
@@ -8,9 +8,8 @@ class MyConstruct_point_2
   typedef typename K::Point_2    Point_2;
   typedef typename K::Line_2     Line_2;
   typedef typename Point_2::Rep  Rep;
-public:
-  typedef Point_2                result_type;
 
+public:
   // Note : the CGAL::Return_base_tag is really internal CGAL stuff.
   // Unfortunately it is needed for optimizing away copy-constructions,
   // due to current lack of delegating constructors in the C++ standard.
diff --git a/Kernel_23/examples/Kernel_23/intersection_visitor.cpp b/Kernel_23/examples/Kernel_23/intersection_visitor.cpp
index 61d0dbba7e2..417363ecbdb 100644
--- a/Kernel_23/examples/Kernel_23/intersection_visitor.cpp
+++ b/Kernel_23/examples/Kernel_23/intersection_visitor.cpp
@@ -8,8 +8,6 @@ typedef K::Line_2 Line_2;
 typedef K::Intersect_2 Intersect_2;
 
 struct Intersection_visitor {
-  typedef void result_type;
-
   void operator()(const Point_2& p) const
   {
     std::cout << p << std::endl;
diff --git a/Kernel_23/include/CGAL/Circle_2.h b/Kernel_23/include/CGAL/Circle_2.h
index b6020ff7528..e21b2ea62a6 100644
--- a/Kernel_23/include/CGAL/Circle_2.h
+++ b/Kernel_23/include/CGAL/Circle_2.h
@@ -102,7 +102,8 @@ public:
     return R().compute_squared_radius_2_object()(*this);
   }
 
-  Orientation orientation() const
+  typename R::Orientation
+  orientation() const
   {
     // This make_certain(), the uncertain orientation of circles, the orientation
     // of circles, are all yucky.
@@ -177,18 +178,6 @@ public:
     return R().construct_bbox_2_object()(*this);
   }
 
-  typename R::Boolean
-  operator==(const Circle_2 &c) const
-  {
-    return R().equal_2_object()(*this, c);
-  }
-
-  typename R::Boolean
-  operator!=(const Circle_2 &c) const
-  {
-    return !(*this == c);
-  }
-
   Circle_2 transform(const Aff_transformation_2 &t) const
   {
     return t.transform(*this);
diff --git a/Kernel_23/include/CGAL/Circle_3.h b/Kernel_23/include/CGAL/Circle_3.h
index b23e651e9fc..0b103f3a864 100644
--- a/Kernel_23/include/CGAL/Circle_3.h
+++ b/Kernel_23/include/CGAL/Circle_3.h
@@ -101,14 +101,14 @@ public:
     return typename R::Construct_sphere_3()(*this);
   }
 
-  Point_3 center() const
+  decltype(auto) center() const
   {
-    return typename R::Construct_sphere_3()(*this).center();
+    return diametral_sphere().center();
   }
 
-  FT squared_radius() const
+  decltype(auto) squared_radius() const
   {
-    return typename R::Construct_sphere_3()(*this).squared_radius();
+    return diametral_sphere().squared_radius();
   }
 
   decltype(auto)
@@ -122,7 +122,7 @@ public:
     return typename R::Construct_bbox_3()(*this);
   }
 
-  FT area_divided_by_pi() const
+  decltype(auto) area_divided_by_pi() const
   {
     return typename R::Compute_area_divided_by_pi_3()(*this);
   }
@@ -152,16 +152,7 @@ public:
 
 template < typename R >
 inline
-bool
-operator==(const Circle_3<R> &p,
-           const Circle_3<R> &q)
-{
-  return R().equal_3_object()(p, q);
-}
-
-template < typename R >
-inline
-bool
+typename R::Boolean
 operator!=(const Circle_3<R> &p,
            const Circle_3<R> &q)
 {
diff --git a/Kernel_23/include/CGAL/Direction_2.h b/Kernel_23/include/CGAL/Direction_2.h
index 407d4e31ed1..d7be7b4d409 100644
--- a/Kernel_23/include/CGAL/Direction_2.h
+++ b/Kernel_23/include/CGAL/Direction_2.h
@@ -156,18 +156,6 @@ public:
     return this->vector();
   }
 
-  typename R::Boolean
-  operator==(const Direction_2& d) const
-  {
-    return R().equal_2_object()(*this, d);
-  }
-
-  typename R::Boolean
-  operator!=(const Direction_2& d) const
-  {
-    return !(*this == d);
-  }
-
   Direction_2 transform(const Aff_transformation_2 &t) const
   {
     return t.transform(*this);
diff --git a/Kernel_23/include/CGAL/Is_a_predicate.h b/Kernel_23/include/CGAL/Is_a_predicate.h
deleted file mode 100644
index 4f23fa9c4e3..00000000000
--- a/Kernel_23/include/CGAL/Is_a_predicate.h
+++ /dev/null
@@ -1,66 +0,0 @@
-// Copyright (c) 2002
-// Utrecht University (The Netherlands),
-// ETH Zurich (Switzerland),
-// INRIA Sophia-Antipolis (France),
-// Max-Planck-Institute Saarbruecken (Germany),
-// and Tel-Aviv University (Israel).  All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org)
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s)     : Sylvain Pion
-
-#ifndef CGAL_IS_A_PREDICATE_H
-#define CGAL_IS_A_PREDICATE_H
-
-// How to determine if a kernel functor is a predicate or a construction.
-
-#include <CGAL/basic.h>
-#include <CGAL/enum.h>
-
-namespace CGAL {
-
-namespace internal {
-
-// By default it's a construction
-template <typename Return_type>
-struct Return_type_of_predicate {
-    typedef CGAL::Tag_false type;
-};
-
-// Specializations for predicates
-template <>
-struct Return_type_of_predicate<bool> {
-    typedef CGAL::Tag_true type;
-};
-
-template <>
-struct Return_type_of_predicate<CGAL::Sign> {
-    typedef CGAL::Tag_true type;
-};
-
-template <>
-struct Return_type_of_predicate<CGAL::Bounded_side> {
-    typedef CGAL::Tag_true type;
-};
-
-template <>
-struct Return_type_of_predicate<CGAL::Angle> {
-    typedef CGAL::Tag_true type;
-};
-
-} // namespace internal
-
-template <typename Functor>
-struct Is_a_predicate {
-  typedef typename internal::Return_type_of_predicate<
-                   typename Functor::result_type>::type type;
-};
-
-} //namespace CGAL
-
-#endif // CGAL_IS_A_PREDICATE_H
diff --git a/Kernel_23/include/CGAL/Iso_cuboid_3.h b/Kernel_23/include/CGAL/Iso_cuboid_3.h
index d279426727f..6fab726dccb 100644
--- a/Kernel_23/include/CGAL/Iso_cuboid_3.h
+++ b/Kernel_23/include/CGAL/Iso_cuboid_3.h
@@ -29,6 +29,8 @@ namespace CGAL {
 template <class R_>
 class Iso_cuboid_3 : public R_::Kernel_base::Iso_cuboid_3
 {
+  typedef typename R_::Boolean            Boolean;
+  typedef typename R_::Bounded_side       Bounded_side;
   typedef typename R_::RT                 RT;
   typedef typename R_::FT                 FT;
   typedef typename R_::Point_3            Point_3;
@@ -173,25 +175,25 @@ public:
        return zmax();
   }
 
-  bool
+  typename R::Boolean
   has_on_bounded_side(const Point_3 &p) const
   {
     return R().has_on_bounded_side_3_object()(*this,p);
   }
 
-  bool
+  Boolean
   has_on_unbounded_side(const Point_3 &p) const
   {
     return R().has_on_unbounded_side_3_object()(*this,p);
   }
 
-  bool
+  Boolean
   has_on_boundary(const Point_3 &p) const
   {
     return R().has_on_boundary_3_object()(*this,p);
   }
 
-  bool
+  Boolean
   has_on(const Point_3 &p) const
   {
     return has_on_boundary(p);
@@ -203,7 +205,7 @@ public:
     return R().bounded_side_3_object()(*this,p);
   }
 
-  bool
+  Boolean
   is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
diff --git a/Kernel_23/include/CGAL/Iso_rectangle_2.h b/Kernel_23/include/CGAL/Iso_rectangle_2.h
index 7d3dc5a4709..226388bd5a8 100644
--- a/Kernel_23/include/CGAL/Iso_rectangle_2.h
+++ b/Kernel_23/include/CGAL/Iso_rectangle_2.h
@@ -27,6 +27,8 @@ namespace CGAL {
 template <class R_>
 class Iso_rectangle_2 : public R_::Kernel_base::Iso_rectangle_2
 {
+  typedef typename R_::Boolean               Boolean;
+  typedef typename R_::Bounded_side          Bounded_side;
   typedef typename R_::RT                    RT;
   typedef typename R_::FT                    FT;
   typedef typename R_::Point_2               Point_2;
@@ -94,19 +96,6 @@ public:
     return R().construct_max_vertex_2_object()(*this);
   }
 
-  bool
-  operator==(const Iso_rectangle_2 &i) const
-  {
-    return R().equal_2_object()(*this, i);
-  }
-
-  bool
-  operator!=(const Iso_rectangle_2 &i) const
-  {
-    return ! (*this == i);
-  }
-
-
   decltype(auto)
   vertex(int i) const
   {
@@ -169,22 +158,19 @@ public:
     return R().compute_area_2_object()(*this);
   }
 
-
-  bool
+  Boolean
   has_on_boundary(const Point_2 &p) const
   {
     return R().has_on_boundary_2_object()(*this,p);
   }
 
-
-  bool
+  Boolean
   has_on_bounded_side(const Point_2 &p) const
   {
     return R().has_on_bounded_side_2_object()(*this,p);
   }
 
-
-  bool
+  Boolean
   has_on_unbounded_side(const Point_2 &p) const
   {
     return R().has_on_unbounded_side_2_object()(*this,p);
@@ -196,8 +182,7 @@ public:
     return R().bounded_side_2_object()(*this,p);
   }
 
-
-  bool
+  Boolean
   is_degenerate() const
   {
     return R().is_degenerate_2_object()(*this);
diff --git a/Kernel_23/include/CGAL/Kernel/Type_mapper.h b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
index bdb2785889e..6be3487b3f4 100644
--- a/Kernel_23/include/CGAL/Kernel/Type_mapper.h
+++ b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
@@ -19,62 +19,25 @@
 
 #include <CGAL/basic.h>
 
-#include <vector>
-
-#include <boost/mpl/transform.hpp>
-#include <boost/mpl/remove.hpp>
-
-#include <optional>
-#include <variant>
-
-#include <boost/preprocessor/facilities/expand.hpp>
-#include <boost/preprocessor/repetition/repeat_from_to.hpp>
-#include <boost/preprocessor/repetition/repeat.hpp>
-#include <boost/preprocessor/repetition/enum_params.hpp>
-#include <boost/preprocessor/repetition/enum_binary_params.hpp>
-#include <boost/preprocessor/repetition/enum.hpp>
-
 namespace CGAL {
 
+template < typename T, typename K1, typename K2 >
+struct Type_mapper;
+
 namespace internal {
 
-// the default implementation is required to catch the odd one-out
-// object like Bbox
-template<typename T, typename K1, typename K2 >
+template < typename T, typename K1, typename K2, typename = void > // last tparam is for SFINAE
 struct Type_mapper_impl {
   typedef T type;
 };
 
-template < typename T, typename K1, typename K2 >
-struct Type_mapper_impl<std::vector< T >, K1, K2 > {
-  typedef std::vector< typename Type_mapper_impl<T, K1, K2>::type > type;
+template < typename K1, typename K2>
+struct Type_mapper_impl<K1, K1, K2> {
+  typedef K2 type;
 };
 
-template < typename T, typename K1, typename K2 >
-struct Type_mapper_impl<std::optional<T>, K1, K2 > {
-  typedef std::optional< typename Type_mapper_impl<T, K1, K2>::type > type;
-};
-
-
-/// The following code is equivalent to the one commented in CODE_TAG
-/// except that with this one, the variant is really variant<A,B,C> and not
-/// a internal obfuscated type
-#define CGAL_TYPEMAP_TYPEDEFS(z, n, t) typedef typename Type_mapper_impl< t##n, K1, K2 >::type A##n;
-
-#define CGAL_VARIANT_TYPEMAP(z, n, d) \
-template< typename K1, typename K2, BOOST_PP_ENUM_PARAMS(n, class T) >            \
-struct Type_mapper_impl<std::variant<BOOST_PP_ENUM_PARAMS(n, T)>, K1, K2> {                    \
-  BOOST_PP_REPEAT(n, CGAL_TYPEMAP_TYPEDEFS, T)                            \
-  typedef std::variant<BOOST_PP_ENUM_PARAMS(n, A)> type; \
-};
-
-BOOST_PP_REPEAT_FROM_TO(1, 10, CGAL_VARIANT_TYPEMAP, _)
-
-#undef CGAL_TYPEMAP_TYPEDEFS
-#undef CGAL_VARIANT_TYPEMAP
-
-// Then we specialize for all kernel objects.
-// More details on why it is like that are here: https://github.com/CGAL/cgal/pull/4878#discussion_r459986501
+// 'Rep' gets a weird partial specialization because of Return_base_tag shenanigans.
+// See https://github.com/CGAL/cgal/issues/3035#issuecomment-428721414
 #define CGAL_Kernel_obj(X) \
   template < typename K1, typename K2 > \
   struct Type_mapper_impl < typename K1::X, K1, K2 > \
@@ -89,20 +52,28 @@ template < typename K1, typename K2 >
 struct Type_mapper_impl < typename K1::FT, K1, K2 >
 { typedef typename K2::FT type; };
 
+// This matches about anything and recursively calls Type_mapper on the template parameters
+// until reaching the other cases (kernel objects, K1, FT)
+template <template <typename...> class T, typename... Params, typename K1, typename K2>
+struct Type_mapper_impl<T<Params...>, K1, K2,
+                        std::enable_if_t<
+#define CGAL_Kernel_obj(X) !std::is_same<T<Params...>, typename K1::X::Rep>::value && \
+                           !std::is_same<T<Params...>, typename K1::X>::value &&
+#include <CGAL/Kernel/interface_macros.h>
+                           !std::is_same<T<Params...>, K1>::value && // Matches K1 directly
+                           !std::is_same<T<Params...>, typename K1::FT>::value // Matches K1::FT
+                        >> {
+  typedef T<typename Type_mapper<Params, K1, K2>::type...> type;
+};
+
 } // internal
 
-// This is a tool to obtain the K2::Point_2 from K1 and K1::Point_2.
-// Similarly for other kernel types.
-
-// TODO : add more specializations ?  Use a different mechanism ?
-
+// This is a tool to obtain e.g. K2::Point_2 from K1 and K1::Point_2.
 template < typename T, typename K1, typename K2 >
-struct Type_mapper :
-    internal::Type_mapper_impl< std::remove_cv_t<
-                                  std::remove_reference_t< T >
-                                  >, K1, K2 >
+struct Type_mapper
+  : internal::Type_mapper_impl<CGAL::cpp20::remove_cvref_t<T>, K1, K2 >
 { };
 
-} //namespace CGAL
+} // namespace CGAL
 
 #endif // CGAL_KERNEL_TYPE_MAPPER_H
diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index c932ea5acfe..b71470a6262 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -22,8 +22,6 @@
 
 #include <CGAL/tags.h>
 #include <CGAL/Origin.h>
-#include <CGAL/Bbox_2.h>
-#include <CGAL/Bbox_3.h>
 #include <CGAL/squared_distance_2.h>
 #include <CGAL/squared_distance_3.h>
 #include <CGAL/intersection_2.h>
@@ -45,9 +43,7 @@ namespace CommonKernelFunctors {
     typedef typename K::Vector_3 Vector_3;
 
   public:
-    typedef int result_type;
-
-    result_type operator()(const Vector_3& vec) const
+    int operator()(const Vector_3& vec) const
     {
       if(certainly_not(is_zero(vec.hx()))){
         return 0;
@@ -73,6 +69,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Are_ordered_along_line_2
   {
+    typedef typename K::Boolean     Boolean;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Collinear_2 Collinear_2;
     typedef typename K::Collinear_are_ordered_along_line_2
@@ -80,16 +77,15 @@ namespace CommonKernelFunctors {
 
     Collinear_2 c;
     Collinear_are_ordered_along_line_2 cao;
-  public:
-    typedef typename K::Boolean     result_type;
 
+  public:
     Are_ordered_along_line_2() {}
     Are_ordered_along_line_2(const Collinear_2& c_,
                              const Collinear_are_ordered_along_line_2& cao_)
       : c(c_), cao(cao_)
     {}
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     { return c(p, q, r) && cao(p, q, r); }
   };
@@ -97,6 +93,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Are_ordered_along_line_3
   {
+    typedef typename K::Boolean     Boolean;
     typedef typename K::Point_3     Point_3;
     typedef typename K::Collinear_3 Collinear_3;
     typedef typename K::Collinear_are_ordered_along_line_3
@@ -104,16 +101,15 @@ namespace CommonKernelFunctors {
 
     Collinear_3 c;
     Collinear_are_ordered_along_line_3 cao;
-  public:
-    typedef typename K::Boolean     result_type;
 
+  public:
     Are_ordered_along_line_3() {}
     Are_ordered_along_line_3(const Collinear_3& c_,
                              const Collinear_are_ordered_along_line_3& cao_)
       : c(c_), cao(cao_)
     {}
 
-    result_type
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     { return c(p, q, r) && cao(p, q, r); }
   };
@@ -121,6 +117,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Are_strictly_ordered_along_line_2
   {
+    typedef typename K::Boolean     Boolean;
     typedef typename K::Point_2     Point_2;
     typedef typename K::Collinear_2 Collinear_2;
     typedef typename K::Collinear_are_strictly_ordered_along_line_2
@@ -128,9 +125,8 @@ namespace CommonKernelFunctors {
 
     Collinear_2 c;
     Collinear_are_strictly_ordered_along_line_2 cao;
-  public:
-    typedef typename K::Boolean     result_type;
 
+  public:
     Are_strictly_ordered_along_line_2() {}
     Are_strictly_ordered_along_line_2(
                                       const Collinear_2& c_,
@@ -138,7 +134,7 @@ namespace CommonKernelFunctors {
       : c(c_), cao(cao_)
     {}
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     { return c(p, q, r) && cao(p, q, r); }
   };
@@ -146,6 +142,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Are_strictly_ordered_along_line_3
   {
+    typedef typename K::Boolean     Boolean;
     typedef typename K::Point_3     Point_3;
     typedef typename K::Collinear_3 Collinear_3;
     typedef typename K::Collinear_are_strictly_ordered_along_line_3
@@ -153,31 +150,27 @@ namespace CommonKernelFunctors {
 
     Collinear_3 c;
     Collinear_are_strictly_ordered_along_line_3 cao;
-  public:
-    typedef typename K::Boolean     result_type;
 
+  public:
     Are_strictly_ordered_along_line_3() {}
-    Are_strictly_ordered_along_line_3(
-                                      const Collinear_3& c_,
+    Are_strictly_ordered_along_line_3(const Collinear_3& c_,
                                       const Collinear_are_strictly_ordered_along_line_3& cao_)
       : c(c_), cao(cao_)
     {}
 
-    result_type
+    Boolean
     operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
     { return c(p, q, r) && cao(p, q, r); }
-  };
+  };;
 
   template <typename K>
   class Assign_2
   {
     typedef typename K::Object_2  Object_2;
-  public:
-    //typedef typename K::Boolean   result_type;
-    typedef bool                  result_type;
 
+  public:
     template <class T>
-    result_type
+    bool
     operator()(T& t, const Object_2& o) const
     { return assign(t, o); }
   };
@@ -186,12 +179,10 @@ namespace CommonKernelFunctors {
   class Assign_3
   {
     typedef typename K::Object_3        Object_3;
-  public:
-    //typedef typename K::Boolean         result_type;
-    typedef bool                        result_type;
 
+  public:
     template <class T>
-    result_type
+    bool
     operator()(T& t, const Object_3& o) const
     { return assign(t, o); }
   };
@@ -199,13 +190,13 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compare_angle_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
     typedef typename K::Vector_3           Vector_3;
     typedef typename K::FT                 FT;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Vector_3& ba1, const Vector_3& bc1,
                const Vector_3& ba2, const Vector_3& bc2) const
     {
@@ -238,7 +229,7 @@ namespace CommonKernelFunctors {
       }
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& a1, const Point_3& b1, const Point_3& c1,
                const Point_3& a2, const Point_3& b2, const Point_3& c2) const
     {
@@ -252,7 +243,7 @@ namespace CommonKernelFunctors {
       return this->operator()(ba1, bc1, ba2, bc2);
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& a, const Point_3& b, const Point_3& c,
                const FT& cosine) const
     {
@@ -289,13 +280,13 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compare_dihedral_angle_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::Point_3            Point_3;
     typedef typename K::Vector_3           Vector_3;
     typedef typename K::FT                 FT;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type
+  public:
+    Comparison_result
     operator()(const Point_3& a1, const Point_3& b1,
                const Point_3& c1, const Point_3& d1,
                const Point_3& a2, const Point_3& b2,
@@ -311,7 +302,7 @@ namespace CommonKernelFunctors {
       return this->operator()(ab1, ac1, ad1, ab2, ac2, ad2);
     }
 
-    result_type
+    Comparison_result
     operator()(const Point_3& a1, const Point_3& b1,
                const Point_3& c1, const Point_3& d1,
                const FT& cosine) const
@@ -323,10 +314,9 @@ namespace CommonKernelFunctors {
       return this->operator()(ab1, ac1, ad1, cosine);
     }
 
-    result_type
+    Comparison_result
     operator()(const Vector_3& ab1, const Vector_3& ac1, const Vector_3& ad1,
-               const FT& cosine)
-      const
+               const FT& cosine) const
     {
       typedef typename K::FT                                 FT;
       typedef typename K::Construct_cross_product_vector_3   Cross_product;
@@ -365,7 +355,7 @@ namespace CommonKernelFunctors {
         }
     }
 
-    result_type
+    Comparison_result
     operator()(const Vector_3& ab1, const Vector_3& ac1, const Vector_3& ad1,
                const Vector_3& ab2, const Vector_3& ac2, const Vector_3& ad2)
       const
@@ -425,8 +415,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3                           Point_3;
     typedef typename K::Comparison_result                 Comparison_result;
 
-    typedef Comparison_result                             result_type;
-
     Comparison_result operator()(const Point_3 & p,
                                  const Weighted_point_3 & q,
                                  const Weighted_point_3 & r) const
@@ -445,8 +433,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3                        Point_3;
     typedef typename K::FT                             FT;
 
-    typedef Point_3                                    result_type;
-
     Point_3 operator()(const Weighted_point_3 & p,
                        const Weighted_point_3 & q,
                        const Weighted_point_3 & r,
@@ -487,10 +473,10 @@ namespace CommonKernelFunctors {
   template < class K >
   class Power_side_of_bounded_power_circle_2
   {
-  public:
+    typedef typename K::Bounded_side                   Bounded_side;
     typedef typename K::Weighted_point_2               Weighted_point_2;
-    typedef Bounded_side                               result_type;
 
+  public:
     Bounded_side operator()(const Weighted_point_2& p,
                             const Weighted_point_2& q,
                             const Weighted_point_2& r,
@@ -501,10 +487,11 @@ namespace CommonKernelFunctors {
       typename K::Construct_point_2 wp2p = traits.construct_point_2_object();
       typename K::Power_side_of_oriented_power_circle_2 power_test =
         traits.power_side_of_oriented_power_circle_2_object();
+
       typename K::Orientation o = orientation(wp2p(p),wp2p(q),wp2p(r));
       typename K::Oriented_side os = power_test(p,q,r,t);
-
       CGAL_assertion(o != COPLANAR);
+
       return enum_cast<Bounded_side>(o * os);
     }
 
@@ -534,11 +521,10 @@ namespace CommonKernelFunctors {
   class Power_side_of_bounded_power_sphere_3
   {
   public:
+    typedef typename K::Bounded_side                   Bounded_side;
     typedef typename K::Weighted_point_3               Weighted_point_3;
     typedef typename K::Sign                           Sign;
 
-    typedef Bounded_side                               result_type;
-
     Bounded_side operator()(const Weighted_point_3 & p,
                             const Weighted_point_3 & q,
                             const Weighted_point_3 & r,
@@ -595,10 +581,8 @@ namespace CommonKernelFunctors {
   class Power_side_of_oriented_power_sphere_3
   {
   public:
-    typedef typename K::Weighted_point_3                  Weighted_point_3;
     typedef typename K::Oriented_side                     Oriented_side;
-
-    typedef Oriented_side                                 result_type;
+    typedef typename K::Weighted_point_3                  Weighted_point_3;
 
     Oriented_side operator()(const Weighted_point_3 & p,
                              const Weighted_point_3 & q,
@@ -660,11 +644,9 @@ namespace CommonKernelFunctors {
   {
   public:
     typedef typename K::Weighted_point_2               Weighted_point_2;
-    typedef typename K::FT                             Weight;
 
-    typedef const Weight&     result_type;
-
-    const Weight& operator()(const Weighted_point_2 & p) const
+    decltype(auto)
+    operator()(const Weighted_point_2 & p) const
     {
       return p.rep().weight();
     }
@@ -675,11 +657,9 @@ namespace CommonKernelFunctors {
   {
   public:
     typedef typename K::Weighted_point_3               Weighted_point_3;
-    typedef typename K::FT                             Weight;
 
-    typedef const Weight&                              result_type;
-
-    const Weight& operator()(const Weighted_point_3 & p) const
+    decltype(auto)
+    operator()(const Weighted_point_3 & p) const
     {
       return p.rep().weight();
     }
@@ -692,8 +672,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Weighted_point_2               Weighted_point_2;
     typedef typename K::FT                             FT;
 
-    typedef FT                                         result_type;
-
     FT operator()(const Weighted_point_2 & p,
                   const Weighted_point_2 & q) const
     {
@@ -709,8 +687,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Weighted_point_3               Weighted_point_3;
     typedef typename K::FT                             FT;
 
-    typedef FT                                         result_type;
-
     FT operator()(const Weighted_point_3 & p,
                   const Weighted_point_3 & q) const
     {
@@ -726,8 +702,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Weighted_point_2               Weighted_point_2;
     typedef typename K::FT                             FT;
 
-    typedef FT                                         result_type;
-
     FT operator()(const Weighted_point_2& p,
                   const Weighted_point_2& q,
                   const Weighted_point_2& r) const
@@ -757,8 +731,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Weighted_point_3               Weighted_point_3;
     typedef typename K::FT                             FT;
 
-    typedef FT                                         result_type;
-
     FT operator()(const Weighted_point_3 & p,
                   const Weighted_point_3 & q,
                   const Weighted_point_3 & r,
@@ -801,13 +773,11 @@ namespace CommonKernelFunctors {
     typedef typename K::Weighted_point_3                  Weighted_point_3;
     typedef typename K::FT                                FT;
 
-    typedef FT                                            result_type;
-
-    result_type operator()(const Weighted_point_3 & p,
-                           const Weighted_point_3 & q,
-                           const Weighted_point_3 & r,
-                           const Weighted_point_3 & s,
-                           const Weighted_point_3 & t) const
+    FT operator()(const Weighted_point_3 & p,
+                  const Weighted_point_3 & q,
+                  const Weighted_point_3 & r,
+                  const Weighted_point_3 & s,
+                  const Weighted_point_3 & t) const
     {
       return power_distance_to_power_sphereC3 (p.x(),p.y(),p.z(),FT(p.weight()),
                                                q.x(),q.y(),q.z(),FT(q.weight()),
@@ -825,9 +795,7 @@ namespace CommonKernelFunctors {
     typedef typename K::Comparison_result                 Comparison_result;
     typedef typename K::FT                                FT;
 
-    typedef Comparison_result                             result_type;
-
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const Weighted_point_3 & p,
                const Weighted_point_3 & q,
                const Weighted_point_3 & r,
@@ -842,7 +810,7 @@ namespace CommonKernelFunctors {
                            w);
     }
 
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const Weighted_point_3 & p,
                const Weighted_point_3 & q,
                const Weighted_point_3 & r,
@@ -855,7 +823,7 @@ namespace CommonKernelFunctors {
                            w);
     }
 
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const Weighted_point_3 & p,
                const Weighted_point_3 & q,
                const FT& w) const
@@ -866,8 +834,8 @@ namespace CommonKernelFunctors {
                            w);
     }
 
-    result_type operator()(const Weighted_point_3 & p,
-                           const FT& w) const
+    Comparison_result operator()(const Weighted_point_3 & p,
+                                 const FT& w) const
     {
       return CGAL::compare(-p.weight(), w);
     }
@@ -876,12 +844,12 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compare_slope_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::FT                 FT;
     typedef typename K::Point_3 Point_3;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
-    result_type operator()(const Point_3& p, const Point_3& q, const Point_3& r, const Point_3& s) const
+  public:
+    Comparison_result operator()(const Point_3& p, const Point_3& q, const Point_3& r, const Point_3& s) const
     {
       Comparison_result sign_pq = CGAL::compare(q.z(),p.z());
       Comparison_result sign_rs = CGAL::compare(s.z(),r.z());
@@ -906,19 +874,19 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compare_squared_distance_2
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::FT                 FT;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
+  public:
     template <class T1, class T2>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const FT& d2) const
     {
       return CGAL::compare(internal::squared_distance(p, q, K()), d2);
     }
 
     template <class T1, class T2, class T3, class T4>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
     {
       return CGAL::compare(internal::squared_distance(p, q, K()),
@@ -929,19 +897,19 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compare_squared_distance_3
   {
+    typedef typename K::Comparison_result  Comparison_result;
     typedef typename K::FT                 FT;
-  public:
-    typedef typename K::Comparison_result  result_type;
 
+  public:
     template <class T1, class T2>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const FT& d2) const
     {
       return internal::compare_squared_distance(p, q, K(), d2);
     }
 
     template <class T1, class T2, class T3, class T4>
-    Needs_FT<result_type>
+    Needs_FT<Comparison_result>
     operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
     {
       return internal::compare_squared_distance(p, q, K(), internal::squared_distance(r, s, K()));
@@ -951,14 +919,12 @@ namespace CommonKernelFunctors {
  template <typename K>
  class Compute_approximate_angle_3
  {
+   typedef typename K::FT       FT;
    typedef typename K::Point_3 Point_3;
    typedef typename K::Vector_3 Vector_3;
 
  public:
-   typedef typename K::FT       result_type;
-
-    result_type
-    operator()(const Vector_3& u, const Vector_3& v) const
+   FT operator()(const Vector_3& u, const Vector_3& v) const
    {
      K k;
      typename K::Compute_scalar_product_3 scalar_product =
@@ -976,7 +942,7 @@ namespace CommonKernelFunctors {
    }
 
 
-   result_type
+   FT
    operator()(const Point_3& p, const Point_3& q, const Point_3& r) const
    {
      K k;
@@ -992,11 +958,11 @@ namespace CommonKernelFunctors {
  template <typename K>
  class Compute_approximate_dihedral_angle_3
  {
+   typedef typename K::FT       FT;
     typedef typename K::Point_3 Point_3;
- public:
-   typedef typename K::FT       result_type;
 
-    result_type
+ public:
+    FT
     operator()(const Point_3& a, const Point_3& b, const Point_3& c,  const Point_3& d) const
    {
      K k;
@@ -1062,8 +1028,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3           Point_3;
     typedef typename K::Triangle_3        Triangle_3;
   public:
-    typedef FT               result_type;
-
     FT
     operator()( const Triangle_3& t ) const
     {
@@ -1081,10 +1045,8 @@ namespace CommonKernelFunctors {
   class Compute_squared_distance_2
   {
     typedef typename K::FT   FT;
-  public:
-    typedef FT               result_type;
 
-    // There are 25 combinations, we use a template.
+  public:
     template <class T1, class T2>
     FT
     operator()( const T1& t1, const T2& t2) const
@@ -1096,10 +1058,8 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::FT        FT;
     typedef typename K::Point_3   Point_3;
-  public:
-    typedef FT               result_type;
 
-    // There are 25 combinations, we use a template.
+  public:
     template <class T1, class T2>
     FT
     operator()( const T1& t1, const T2& t2) const
@@ -1121,8 +1081,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Segment_2   Segment_2;
     typedef typename K::Vector_2    Vector_2;
   public:
-    typedef FT               result_type;
-
     FT
     operator()( const Vector_2& v) const
     { return CGAL_NTS square(K().compute_x_2_object()(v)) +
@@ -1140,8 +1098,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Segment_3   Segment_3;
     typedef typename K::Vector_3    Vector_3;
   public:
-    typedef FT               result_type;
-
     FT
     operator()( const Vector_3& v) const
     { return v.rep().squared_length(); }
@@ -1154,13 +1110,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_a_2
   {
-    typedef typename K::RT             RT;
     typedef typename K::Line_2         Line_2;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Line_2& l) const
     {
       return l.rep().a();
@@ -1170,13 +1123,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_a_3
   {
-    typedef typename K::RT             RT;
     typedef typename K::Plane_3        Plane_3;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Plane_3& l) const
     {
       return l.rep().a();
@@ -1187,13 +1137,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_b_2
   {
-    typedef typename K::RT             RT;
     typedef typename K::Line_2         Line_2;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Line_2& l) const
     {
       return l.rep().b();
@@ -1203,13 +1150,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_b_3
   {
-    typedef typename K::RT             RT;
     typedef typename K::Plane_3        Plane_3;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Plane_3& l) const
     {
       return l.rep().b();
@@ -1220,13 +1164,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_c_2
   {
-    typedef typename K::RT             RT;
     typedef typename K::Line_2         Line_2;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Line_2& l) const
     {
       return l.rep().c();
@@ -1236,13 +1177,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_c_3
   {
-    typedef typename K::RT             RT;
     typedef typename K::Plane_3        Plane_3;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Plane_3& l) const
     {
       return l.rep().c();
@@ -1252,13 +1190,10 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_d_3
   {
-    typedef typename K::RT             RT;
     typedef typename K::Plane_3        Plane_3;
 
   public:
-    typedef RT               result_type;
-
-    const RT&
+    decltype(auto)
     operator()(const Plane_3& l) const
     {
       return l.rep().d();
@@ -1273,8 +1208,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_2         Line_2;
 
   public:
-    typedef FT               result_type;
-
     FT
     operator()(const Line_2& l, const FT& y) const
     {
@@ -1291,8 +1224,6 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_2         Line_2;
 
   public:
-    typedef FT               result_type;
-
     FT
     operator()(const Line_2& l, const FT& x) const
     {
@@ -1311,8 +1242,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_rectangle_2& r) const
     {
@@ -1329,8 +1258,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_cuboid_3& r) const
     {
@@ -1347,8 +1274,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_rectangle_2& r) const
     {
@@ -1365,8 +1290,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_cuboid_3& r) const
     {
@@ -1383,8 +1306,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_rectangle_2& r) const
     {
@@ -1401,8 +1322,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_cuboid_3& r) const
     {
@@ -1419,8 +1338,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_rectangle_2& r) const
     {
@@ -1437,8 +1354,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_cuboid_3& r) const
     {
@@ -1455,8 +1370,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_cuboid_3& r) const
     {
@@ -1473,8 +1386,6 @@ namespace CommonKernelFunctors {
     //typedef typename K::Cartesian_coordinate_type  Cartesian_coordinate_type;
 
   public:
-    typedef FT               result_type;
-
     Cartesian_coordinate_type
     operator()(const Iso_cuboid_3& r) const
     {
@@ -1489,9 +1400,7 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_2         Point_2;
 
   public:
-    typedef FT               result_type;
-
-    result_type
+    FT
     operator()(const Point_2& p,
                const Point_2& q) const
     {
@@ -1507,9 +1416,7 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3         Point_3;
 
   public:
-    typedef FT               result_type;
-
-    result_type
+    FT
     operator()(const Point_3& p,
                const Point_3& q) const
     {
@@ -1524,10 +1431,9 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Point_2   Point_2;
     typedef typename K::Circle_2  Circle_2;
-  public:
-    typedef const Point_2&         result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Circle_2& c) const
     { return c.rep().center(); }
   };
@@ -1538,14 +1444,13 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3   Point_3;
     typedef typename K::Sphere_3  Sphere_3;
     typedef typename K::Circle_3  Circle_3;
-  public:
-    typedef const Point_3&          result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Sphere_3& s) const
     { return s.rep().center(); }
 
-    result_type
+    decltype(auto)
     operator()(const Circle_3& c) const
     { return c.rep().center(); }
 
@@ -1558,9 +1463,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_2     Point_2;
     typedef typename K::Circle_2    Circle_2;
     typedef typename Circle_2::Rep  Rep;
-  public:
-    typedef Circle_2         result_type;
 
+  public:
     Rep // Circle_2
     operator()( Return_base_tag,
                 const Point_2& center, const FT& squared_radius,
@@ -1678,8 +1582,6 @@ namespace CommonKernelFunctors {
     typedef typename Circle_3::Rep    Rep;
 
   public:
-    typedef Circle_3                  result_type;
-
     Rep
     operator() (Return_base_tag, const Point_3& p,
                 const FT& sr, const Plane_3& plane) const
@@ -1762,9 +1664,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3       Point_3;
     typedef typename K::Iso_cuboid_3  Iso_cuboid_3;
     typedef typename Iso_cuboid_3::Rep  Rep;
-  public:
-    typedef Iso_cuboid_3      result_type;
 
+  public:
     Rep // Iso_cuboid_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q, int) const
     { return Rep(p, q, 0); }
@@ -1823,9 +1724,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_3 Line;
     typedef typename K::Point_3 Point;
     typename K::Construct_line_3 construct_line;
-  public:
-    typedef Point result_type;
 
+  public:
     Point
     operator()(const Point& l11, const Point& l12,
                const Point& l21, const Point& l22) const
@@ -1844,17 +1744,15 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Construct_max_vertex_2
   {
-    typedef typename K::Point_2          Point_2;
     typedef typename K::Segment_2        Segment_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
-  public:
-    typedef const Point_2&               result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Iso_rectangle_2& r) const
     { return (r.rep().max)(); }
 
-    result_type
+    decltype(auto)
     operator()(const Segment_2& s) const
     { return (s.max)(); }
   };
@@ -1863,37 +1761,31 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Construct_min_vertex_2
   {
-    typedef typename K::Point_2          Point_2;
     typedef typename K::Segment_2        Segment_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
-  public:
-    typedef const Point_2&               result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Iso_rectangle_2& r) const
     { return (r.rep().min)(); }
 
-    result_type
+    decltype(auto)
     operator()(const Segment_2& s) const
     { return (s.min)(); }
   };
 
-
-
   template <typename K>
   class Construct_max_vertex_3
   {
-    typedef typename K::Point_3          Point_3;
     typedef typename K::Segment_3        Segment_3;
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
-  public:
-    typedef const Point_3&           result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Iso_cuboid_3& r) const
     { return (r.rep().max)(); }
 
-    result_type
+    decltype(auto)
     operator()(const Segment_3& s) const
     { return (s.rep().max)(); }
   };
@@ -1901,17 +1793,15 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Construct_min_vertex_3
   {
-    typedef typename K::Point_3          Point_3;
     typedef typename K::Segment_3        Segment_3;
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
-  public:
-    typedef const Point_3&               result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Iso_cuboid_3& r) const
     { return (r.rep().min)(); }
 
-    result_type
+    decltype(auto)
     operator()(const Segment_3& s) const
     { return (s.rep().min)(); }
   };
@@ -1921,9 +1811,8 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Point_3          Point_3;
     typedef typename K::Vector_3         Vector_3;
-  public:
-    typedef Vector_3           result_type;
 
+  public:
     Vector_3
     operator()(const Point_3& p,const Point_3& q, const Point_3& r) const
     {
@@ -1937,9 +1826,8 @@ namespace CommonKernelFunctors {
   class Construct_object_2
   {
     typedef typename K::Object_2   Object_2;
-  public:
-    typedef Object_2         result_type;
 
+  public:
     template <class Cls>
     Object_2
     operator()( const Cls& c) const
@@ -1950,9 +1838,8 @@ namespace CommonKernelFunctors {
   class Construct_object_3
   {
     typedef typename K::Object_3   Object_3;
-  public:
-    typedef Object_3         result_type;
 
+  public:
     template <class Cls>
     Object_3
     operator()( const Cls& c) const
@@ -1963,9 +1850,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_circle_2
   {
     typedef typename K::Circle_2   Circle_2;
-  public:
-    typedef Circle_2         result_type;
 
+  public:
     Circle_2
     operator()( const Circle_2& c) const
     { return c.opposite(); }
@@ -1976,9 +1862,8 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Direction_2    Direction_2;
     typedef typename Direction_2::Rep  Rep;
-  public:
-    typedef Direction_2      result_type;
 
+  public:
     Direction_2
     operator()( const Direction_2& d) const
     {  return Rep(-d.dx(), -d.dy()); }
@@ -1989,9 +1874,8 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Direction_3    Direction_3;
     typedef typename Direction_3::Rep  Rep;
-  public:
-    typedef Direction_3      result_type;
 
+  public:
     Direction_3
     operator()( const Direction_3& d) const
     {  return Rep(-d.dx(), -d.dy(), -d.dz()); }
@@ -2001,9 +1885,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_line_2
   {
     typedef typename K::Line_2   Line_2;
-  public:
-    typedef Line_2           result_type;
 
+  public:
     Line_2
     operator()( const Line_2& l) const
     { return Line_2( -l.a(), -l.b(), -l.c()); }
@@ -2013,9 +1896,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_line_3
   {
     typedef typename K::Line_3   Line_3;
-  public:
-    typedef Line_3           result_type;
 
+  public:
     Line_3
     operator()( const Line_3& l) const
     { return l.rep().opposite(); }
@@ -2025,9 +1907,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_plane_3
   {
     typedef typename K::Plane_3   Plane_3;
-  public:
-    typedef Plane_3          result_type;
 
+  public:
     Plane_3
     operator()( const Plane_3& p) const
     { return p.rep().opposite(); }
@@ -2037,9 +1918,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_ray_2
   {
     typedef typename K::Ray_2   Ray_2;
-  public:
-    typedef Ray_2            result_type;
 
+  public:
     Ray_2
     operator()( const Ray_2& r) const
     { return r.opposite(); }
@@ -2049,9 +1929,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_ray_3
   {
     typedef typename K::Ray_3   Ray_3;
-  public:
-    typedef Ray_3            result_type;
 
+  public:
     Ray_3
     operator()( const Ray_3& r) const
     { return r.opposite(); }
@@ -2061,9 +1940,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_segment_2
   {
     typedef typename K::Segment_2  Segment_2;
-  public:
-    typedef Segment_2        result_type;
 
+  public:
     Segment_2
     operator()( const Segment_2& s) const
     { return Segment_2(s.target(), s.source()); }
@@ -2073,9 +1951,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_segment_3
   {
     typedef typename K::Segment_3  Segment_3;
-  public:
-    typedef Segment_3        result_type;
 
+  public:
     Segment_3
     operator()( const Segment_3& s) const
     { return s.rep().opposite(); }
@@ -2085,9 +1962,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_sphere_3
   {
     typedef typename K::Sphere_3   Sphere_3;
-  public:
-    typedef Sphere_3         result_type;
 
+  public:
     Sphere_3
     operator()( const Sphere_3& s) const
     { return s.rep().opposite(); }
@@ -2097,9 +1973,8 @@ namespace CommonKernelFunctors {
   class Construct_opposite_triangle_2
   {
     typedef typename K::Triangle_2  Triangle_2;
-  public:
-    typedef Triangle_2       result_type;
 
+  public:
     Triangle_2
     operator()( const Triangle_2& t) const
     { return Triangle_2(t.vertex(0), t.vertex(2), t.vertex(1));}
@@ -2111,9 +1986,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_3    Line_3;
     typedef typename K::Point_3   Point_3;
     typedef typename K::Plane_3   Plane_3;
-  public:
-    typedef Line_3           result_type;
 
+  public:
     Line_3
     operator()( const Plane_3& pl, const Point_3& p) const
     { return pl.rep().perpendicular_line(p); }
@@ -2125,9 +1999,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_3    Line_3;
     typedef typename K::Point_3   Point_3;
     typedef typename K::Plane_3   Plane_3;
-  public:
-    typedef Plane_3          result_type;
 
+  public:
     Plane_3
     operator()( const Line_3& l, const Point_3& p) const
     { return l.rep().perpendicular_plane(p); }
@@ -2146,9 +2019,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Plane_3      Plane_3;
     typedef typename K::Circle_3     Circle_3;
     typedef typename Plane_3::Rep    Rep;
-  public:
-    typedef Plane_3          result_type;
 
+  public:
     Rep // Plane_3
     operator()(Return_base_tag, const RT& a, const RT& b, const RT& c, const RT& d) const
     { return Rep(a, b, c, d); }
@@ -2185,7 +2057,7 @@ namespace CommonKernelFunctors {
     operator()(Return_base_tag, const Segment_3& s, const Point_3& p) const
     { return Rep(s, p); }
 
-    Rep // Plane_3
+    decltype(auto)
     operator()(Return_base_tag, const Circle_3 & c) const
     { return c.rep().supporting_plane(); }
 
@@ -2217,10 +2089,9 @@ namespace CommonKernelFunctors {
     operator()(const Segment_3& s, const Point_3& p) const
     { return this->operator()(Return_base_tag(), s, p); }
 
-    Plane_3
+    decltype(auto)
     operator()(const Circle_3 & c) const
     { return this->operator()(Return_base_tag(), c); }
-
   };
 
   template <typename K>
@@ -2231,9 +2102,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3 Point;
     typename K::Construct_plane_3 construct_plane;
     typename K::Construct_line_3 construct_line;
-  public:
-    typedef Point result_type;
 
+  public:
     Point
     operator()(const Point& p1, const Point& p2, const Point& p3,
                const Point& l1, const Point& l2) const
@@ -2267,10 +2137,10 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Plane_3 Plane;
     typedef typename K::Point_3 Point;
-    typename K::Construct_plane_3 construct_plane;
-  public:
-    typedef Point result_type;
 
+    typename K::Construct_plane_3 construct_plane;
+
+  public:
     Point
     operator()(const Point& p1, const Point& q1, const Point& r1,
                const Point& p2, const Point& q2, const Point& r2,
@@ -2303,10 +2173,10 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Segment_3 Segment;
     typedef typename K::Point_3 Point;
-    typename K::Construct_segment_3 construct_segment;
-  public:
-    typedef Point result_type;
 
+    typename K::Construct_segment_3 construct_segment;
+
+  public:
     Point
     operator()(const Point& p1, const Point& q1,
                const Point& p2, const Point& q2) const
@@ -2335,11 +2205,12 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Compute_alpha_for_coplanar_triangle_intersection_3
   {
+    typedef typename K::FT FT;
     typedef typename K::Point_3 Point_3;
     typedef typename K::Vector_3 Vector_3;
+
   public:
-    typedef typename K::FT  result_type;
-    result_type
+    FT
     operator()(const Point_3& p1, const Point_3& p2,       // segment 1
                const Point_3& p3, const Point_3& p4) const // segment 2
     {
@@ -2371,9 +2242,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Segment_2  Segment_2;
     typedef typename K::Line_2     Line_2;
     typedef typename K::Ray_2      Ray_2;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()( const Line_2& l, const FT i) const
     { return l.point(i); }
@@ -2396,10 +2266,9 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_3     Line_3;
     typedef typename K::Ray_3      Ray_3;
     typedef typename K::Plane_3    Plane_3;
-  public:
-    typedef Point_3          result_type;
 
-    const Point_3&
+  public:
+    decltype(auto)
     operator()( const Line_3& l) const
     { return l.rep().point(); }
 
@@ -2415,7 +2284,7 @@ namespace CommonKernelFunctors {
     operator()( const Ray_3& r, const FT i) const
     { return r.rep().point(i); }
 
-    Point_3
+    decltype(auto)
     operator()( const Plane_3& p) const
     { return p.rep().point(); }
   };
@@ -2426,9 +2295,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_2    Point_2;
     typedef typename K::Point_3    Point_3;
     typedef typename K::Plane_3    Plane_3;
-  public:
-    typedef Point_2          result_type;
 
+  public:
     Point_2
     operator()( const Plane_3& h, const Point_3& p) const
     {  return h.rep().to_2d(p); }
@@ -2443,9 +2311,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_2       Line_2;
     typedef typename K::Ray_2        Ray_2;
     typedef typename Ray_2::Rep   Rep;
-  public:
-    typedef Ray_2            result_type;
 
+  public:
     Rep // Ray_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q) const
     {  return Rep(p, q); }
@@ -2489,9 +2356,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Line_3       Line_3;
     typedef typename K::Ray_3        Ray_3;
     typedef typename Ray_3::Rep      Rep;
-  public:
-    typedef Ray_3            result_type;
 
+  public:
     Rep // Ray_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q) const
     {  return Rep(p, q); }
@@ -2532,9 +2398,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Segment_2  Segment_2;
     typedef typename Segment_2::Rep  Rep;
     typedef typename K::Point_2    Point_2;
-  public:
-    typedef Segment_2        result_type;
 
+  public:
     Rep // Segment_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q) const
     {  return Rep(p, q); }
@@ -2550,9 +2415,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Segment_3  Segment_3;
     typedef typename K::Point_3    Point_3;
     typedef typename Segment_3::Rep  Rep;
-  public:
-    typedef Segment_3        result_type;
 
+  public:
     Rep // Segment_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q) const
     {  return Rep(p, q); }
@@ -2562,23 +2426,18 @@ namespace CommonKernelFunctors {
     { return this->operator()(Return_base_tag(), p, q); }
   };
 
-
-
-
   template <typename K>
   class Construct_source_2
   {
     typedef typename K::Segment_2  Segment_2;
     typedef typename K::Ray_2      Ray_2;
-    typedef typename K::Point_2    Point_2;
-  public:
-    typedef const Point_2&                result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Segment_2& s) const
     {  return s.rep().source(); }
 
-    result_type
+    decltype(auto)
     operator()(const Ray_2& r) const
     {  return r.rep().source(); }
   };
@@ -2588,15 +2447,13 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Segment_3  Segment_3;
     typedef typename K::Ray_3      Ray_3;
-    typedef typename K::Point_3    Point_3;
-  public:
-    typedef const Point_3&         result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Segment_3& s) const
     {  return s.rep().source(); }
 
-    result_type
+    decltype(auto)
     operator()(const Ray_3& r) const
     {  return r.rep().source(); }
   };
@@ -2606,11 +2463,9 @@ namespace CommonKernelFunctors {
   class Construct_target_2
   {
     typedef typename K::Segment_2  Segment_2;
-    typedef typename K::Point_2    Point_2;
-  public:
-    typedef const Point_2&         result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Segment_2& s) const
     {  return s.rep().target(); }
   };
@@ -2619,11 +2474,9 @@ namespace CommonKernelFunctors {
   class Construct_target_3
   {
     typedef typename K::Segment_3  Segment_3;
-    typedef typename K::Point_3    Point_3;
-  public:
-    typedef const Point_3&         result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Segment_3& s) const
     {  return s.rep().target(); }
   };
@@ -2632,11 +2485,9 @@ namespace CommonKernelFunctors {
   class Construct_second_point_2
   {
     typedef typename K::Ray_2    Ray_2;
-    typedef typename K::Point_2  Point_2;
-  public:
-    typedef const Point_2&       result_type;
 
-    result_type
+  public:
+    decltype(auto)
     operator()(const Ray_2& r) const
     {  return r.rep().second_point(); }
   };
@@ -2645,11 +2496,9 @@ namespace CommonKernelFunctors {
   class Construct_second_point_3
   {
     typedef typename K::Ray_3    Ray_3;
-    typedef typename K::Point_3  Point_3;
-  public:
-    typedef Point_3              result_type;
 
-    result_type // const result_type& // Homogeneous...
+  public:
+    decltype(auto)
     operator()(const Ray_3& r) const
     {  return r.rep().second_point(); }
   };
@@ -2662,9 +2511,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Sphere_3   Sphere_3;
     typedef typename K::Circle_3   Circle_3;
     typedef typename Sphere_3::Rep Rep;
-  public:
-    typedef Sphere_3               result_type;
 
+  public:
     Rep // Sphere_3
     operator()(Return_base_tag, const Point_3& center, const FT& squared_radius,
                 Orientation orientation = COUNTERCLOCKWISE) const
@@ -2690,7 +2538,7 @@ namespace CommonKernelFunctors {
                 Orientation orientation = COUNTERCLOCKWISE) const
     {  return Rep(center, orientation); }
 
-    Rep
+    decltype(auto)
     operator() (Return_base_tag, const Circle_3 & c) const
     { return c.rep().diametral_sphere(); }
 
@@ -2719,10 +2567,9 @@ namespace CommonKernelFunctors {
                 Orientation orientation = COUNTERCLOCKWISE) const
     { return this->operator()(Return_base_tag(), center, orientation); }
 
-    Sphere_3
+    decltype(auto)
     operator() (const Circle_3 & c) const
     { return this->operator()(Return_base_tag(), c); }
-
   };
 
   template <typename K>
@@ -2730,10 +2577,9 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Triangle_3  Triangle_3;
     typedef typename K::Plane_3     Plane_3;
-  public:
-    typedef Plane_3          result_type;
 
-    Plane_3
+  public:
+    decltype(auto)
     operator()( const Triangle_3& t) const
     { return t.rep().supporting_plane(); }
 
@@ -2745,9 +2591,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Tetrahedron_3   Tetrahedron_3;
     typedef typename K::Point_3         Point_3;
     typedef typename Tetrahedron_3::Rep Rep;
-  public:
-    typedef Tetrahedron_3    result_type;
 
+  public:
     Rep // Tetrahedron_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
@@ -2765,9 +2610,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Triangle_2   Triangle_2;
     typedef typename Triangle_2::Rep  Rep;
     typedef typename K::Point_2      Point_2;
-  public:
-    typedef Triangle_2       result_type;
 
+  public:
     Rep // Triangle_2
     operator()(Return_base_tag, const Point_2& p, const Point_2& q, const Point_2& r) const
     { return Rep(p, q, r); }
@@ -2783,9 +2627,8 @@ namespace CommonKernelFunctors {
     typedef typename K::Triangle_3   Triangle_3;
     typedef typename K::Point_3      Point_3;
     typedef typename Triangle_3::Rep Rep;
-  public:
-    typedef Triangle_3       result_type;
 
+  public:
     Rep // Triangle_3
     operator()(Return_base_tag, const Point_3& p, const Point_3& q, const Point_3& r) const
     { return Rep(p, q, r); }
@@ -2800,9 +2643,8 @@ namespace CommonKernelFunctors {
   {
     typedef typename K::Point_3          Point_3;
     typedef typename K::Vector_3         Vector_3;
-  public:
-    typedef Vector_3           result_type;
 
+  public:
     Vector_3
     operator()(const Point_3& p,const Point_3& q, const Point_3& r) const
     {
@@ -2821,21 +2663,21 @@ namespace CommonKernelFunctors {
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
     typedef typename K::Triangle_3       Triangle_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
-  public:
 
-    const Point_3&
+  public:
+    decltype(auto)
     operator()( const Segment_3& s, int i) const
     { return s.rep().vertex(i); }
 
-    const Point_3&
+    decltype(auto)
     operator()( const Triangle_3& t, int i) const
     { return t.rep().vertex(i); }
 
-    Point_3
+    decltype(auto)
     operator()( const Iso_cuboid_3& r, int i) const
       { return r.rep().vertex(i); }
 
-    const Point_3&
+    decltype(auto)
     operator()( const Tetrahedron_3& t, int i) const
     { return t.rep().vertex(i); }
   };
@@ -2849,8 +2691,6 @@ namespace CommonKernelFunctors {
     Cartesian_const_iterator_2;
 
   public:
-    typedef Cartesian_const_iterator_2 result_type;
-
     Cartesian_const_iterator_2
     operator()( const Point_2& p) const
     {
@@ -2885,8 +2725,6 @@ namespace CommonKernelFunctors {
     Cartesian_const_iterator_3;
 
   public:
-    typedef Cartesian_const_iterator_3 result_type;
-
     Cartesian_const_iterator_3
     operator()( const Point_3& p) const
     {
@@ -3404,16 +3242,17 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Coplanar_3
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_3       Point_3;
     typedef typename K::Orientation_3 Orientation_3;
-    Orientation_3 o;
-  public:
-    typedef typename K::Boolean       result_type;
 
+    Orientation_3 o;
+
+  public:
     Coplanar_3() {}
     Coplanar_3(const Orientation_3& o_) : o(o_) {}
 
-    result_type
+    Boolean
     operator()( const Point_3& p, const Point_3& q,
                 const Point_3& r, const Point_3& s) const
     {
@@ -3424,11 +3263,11 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Counterclockwise_in_between_2
   {
+    typedef typename K::Boolean      Boolean;
     typedef typename K::Direction_2  Direction_2;
-  public:
-    typedef typename K::Boolean      result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Direction_2& p, const Direction_2& q,
                 const Direction_2& r) const
     {
@@ -3442,12 +3281,12 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Do_intersect_2
   {
-  public:
-    typedef typename K::Boolean     result_type;
+    typedef typename K::Boolean     Boolean;
 
+ public:
     // Needs_FT because Line/Line (and variations) as well as Circle_2/X compute intersections
     template <class T1, class T2>
-    Needs_FT<result_type>
+    Needs_FT<Boolean>
     operator()(const T1& t1, const T2& t2) const
     { return { Intersections::internal::do_intersect(t1, t2, K())}; }
   };
@@ -3455,17 +3294,18 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Do_intersect_3
   {
-  public:
-    typedef typename K::Boolean     result_type;
+    typedef typename K::Boolean     Boolean;
 
+  public:
     template <class T1, class T2>
-    result_type
+    Boolean
     operator()(const T1& t1, const T2& t2) const
     { return Intersections::internal::do_intersect(t1, t2, K()); }
 
-    result_type operator()(const typename K::Plane_3& pl1,
-                           const typename K::Plane_3& pl2,
-                           const typename K::Plane_3& pl3) const
+    Boolean
+    operator()(const typename K::Plane_3& pl1,
+               const typename K::Plane_3& pl2,
+               const typename K::Plane_3& pl3) const
     {
       return Intersections::internal::do_intersect(pl1, pl2, pl3, K());
     }
@@ -3474,6 +3314,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Equal_2
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_2       Point_2;
     typedef typename K::Vector_2      Vector_2;
     typedef typename K::Direction_2   Direction_2;
@@ -3485,51 +3326,49 @@ namespace CommonKernelFunctors {
     typedef typename K::Circle_2      Circle_2;
 
   public:
-    typedef typename K::Boolean       result_type;
-
-    result_type
+    Boolean
     operator()(const Point_2 &p, const Point_2 &q) const
     {
       return p.rep() == q.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Vector_2 &v1, const Vector_2 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Vector_2 &v, const Null_vector &n) const
     {
       return v.rep() == n;
     }
 
-    result_type
+    Boolean
     operator()(const Direction_2 &d1, const Direction_2 &d2) const
     {
       return d1.rep() == d2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Segment_2 &s1, const Segment_2 &s2) const
     {
       return s1.source() == s2.source() && s1.target() == s2.target();
     }
 
-    result_type
+    Boolean
     operator()(const Line_2 &l1, const Line_2 &l2) const
     {
       return l1.rep() == l2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Ray_2& r1, const Ray_2& r2) const
     {
       return r1.source() == r2.source() && r1.direction() == r2.direction();
     }
 
-    result_type
+    Boolean
     operator()(const Circle_2& c1, const Circle_2& c2) const
     {
       return c1.center() == c2.center() &&
@@ -3537,7 +3376,7 @@ namespace CommonKernelFunctors {
         c1.orientation() == c2.orientation();
     }
 
-    result_type
+    Boolean
     operator()(const Triangle_2& t1, const Triangle_2& t2) const
     {
       int i;
@@ -3549,7 +3388,7 @@ namespace CommonKernelFunctors {
                    && t1.vertex(2) == t2.vertex(i+2);
     }
 
-    result_type
+    Boolean
     operator()(const Iso_rectangle_2& i1, const Iso_rectangle_2& i2) const
     {
       return CGAL_AND((i1.min)() == (i2.min)(), (i1.max)() == (i2.max)());
@@ -3559,6 +3398,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Equal_3
   {
+    typedef typename K::Boolean       Boolean;
     typedef typename K::Point_3       Point_3;
     typedef typename K::Vector_3      Vector_3;
     typedef typename K::Direction_3   Direction_3;
@@ -3573,82 +3413,79 @@ namespace CommonKernelFunctors {
     typedef typename K::Circle_3      Circle_3;
 
   public:
-    typedef typename K::Boolean       result_type;
-
-    // Point_3 is special case since the global operator== would recurse.
-    result_type
+    Boolean
     operator()(const Point_3 &p, const Point_3 &q) const
     {
-      return CGAL_AND_3(p.x() == q.x(), p.y() == q.y(), p.z() == q.z());
+      return p.rep() == q.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Plane_3 &v1, const Plane_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Iso_cuboid_3 &v1, const Iso_cuboid_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Sphere_3 &v1, const Sphere_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Tetrahedron_3 &v1, const Tetrahedron_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Triangle_3 &v1, const Triangle_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Ray_3 &v1, const Ray_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Line_3 &v1, const Line_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Direction_3 &v1, const Direction_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Segment_3 &v1, const Segment_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Vector_3 &v1, const Vector_3 &v2) const
     {
       return v1.rep() == v2.rep();
     }
 
-    result_type
+    Boolean
     operator()(const Vector_3 &v, const Null_vector &n) const
     {
       return v.rep() == n;
     }
 
-    result_type
+    Boolean
     operator()(const Circle_3 &v1, const Circle_3 &v2) const
     {
       return v1.rep() == v2.rep();
@@ -3658,22 +3495,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_boundary_2
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_2          Point_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Circle_2         Circle_2;
     typedef typename K::Triangle_2       Triangle_2;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Circle_2& c, const Point_2& p) const
     { return c.has_on_boundary(p); }
 
-    result_type
+    Boolean
     operator()( const Triangle_2& t, const Point_2& p) const
     { return t.has_on_boundary(p); }
 
-    result_type
+    Boolean
     operator()( const Iso_rectangle_2& r, const Point_2& p) const
     { return K().bounded_side_2_object()(r,p) == ON_BOUNDARY; }
   };
@@ -3681,23 +3518,23 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_boundary_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
     typedef typename K::Sphere_3         Sphere_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
     typedef typename K::Plane_3          Plane_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.rep().has_on_boundary(p); }
 
-    result_type
+    Boolean
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     { return t.rep().has_on_boundary(p); }
 
-    result_type
+    Boolean
     operator()( const Iso_cuboid_3& c, const Point_3& p) const
     { return c.rep().has_on_boundary(p); }
 
@@ -3706,22 +3543,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_bounded_side_2
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_2          Point_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Circle_2         Circle_2;
     typedef typename K::Triangle_2       Triangle_2;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Circle_2& c, const Point_2& p) const
     { return c.has_on_bounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Triangle_2& t, const Point_2& p) const
     { return t.has_on_bounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Iso_rectangle_2& r, const Point_2& p) const
     { return K().bounded_side_2_object()(r,p) == ON_BOUNDED_SIDE; }
   };
@@ -3729,27 +3566,27 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_bounded_side_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
     typedef typename K::Sphere_3         Sphere_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
     typedef typename K::Circle_3         Circle_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.has_on_bounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     { return t.rep().has_on_bounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Iso_cuboid_3& c, const Point_3& p) const
     { return c.rep().has_on_bounded_side(p); }
 
-    result_type
+    Boolean
     operator()(const Circle_3& c, const Point_3& p) const
     {
       CGAL_kernel_precondition(
@@ -3759,7 +3596,7 @@ namespace CommonKernelFunctors {
     }
 
     // returns true iff the line segment ab is inside the union of the bounded sides of s1 and s2.
-    Needs_FT<result_type>
+    Needs_FT<Boolean>
     operator()(const Sphere_3& s1, const Sphere_3& s2,
                const Point_3& a, const Point_3& b) const
     {
@@ -3798,22 +3635,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_negative_side_2
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_2          Point_2;
     typedef typename K::Line_2           Line_2;
     typedef typename K::Circle_2         Circle_2;
     typedef typename K::Triangle_2       Triangle_2;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Circle_2& c, const Point_2& p) const
     { return c.has_on_negative_side(p); }
 
-    result_type
+    Boolean
     operator()( const Triangle_2& t, const Point_2& p) const
     { return t.has_on_negative_side(p); }
 
-    result_type
+    Boolean
     operator()( const Line_2& l, const Point_2& p) const
     { return l.has_on_negative_side(p); }
   };
@@ -3821,22 +3658,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_negative_side_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Plane_3          Plane_3;
     typedef typename K::Sphere_3         Sphere_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.has_on_negative_side(p); }
 
-    result_type
+    Boolean
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     { return t.rep().has_on_negative_side(p); }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl, const Point_3& p) const
     { return pl.rep().has_on_negative_side(p); }
   };
@@ -3844,22 +3681,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_positive_side_2
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_2          Point_2;
     typedef typename K::Line_2           Line_2;
     typedef typename K::Circle_2         Circle_2;
     typedef typename K::Triangle_2       Triangle_2;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Circle_2& c, const Point_2& p) const
     { return c.has_on_positive_side(p); }
 
-    result_type
+    Boolean
     operator()( const Triangle_2& t, const Point_2& p) const
     { return t.has_on_positive_side(p); }
 
-    result_type
+    Boolean
     operator()( const Line_2& l, const Point_2& p) const
     { return l.has_on_positive_side(p); }
   };
@@ -3867,22 +3704,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_positive_side_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Plane_3          Plane_3;
     typedef typename K::Sphere_3         Sphere_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.has_on_positive_side(p); }
 
-    result_type
+    Boolean
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     { return t.rep().has_on_positive_side(p); }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl, const Point_3& p) const
     { return pl.rep().has_on_positive_side(p); }
   };
@@ -3890,22 +3727,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_unbounded_side_2
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_2          Point_2;
     typedef typename K::Iso_rectangle_2  Iso_rectangle_2;
     typedef typename K::Circle_2         Circle_2;
     typedef typename K::Triangle_2       Triangle_2;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Circle_2& c, const Point_2& p) const
     { return c.has_on_unbounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Triangle_2& t, const Point_2& p) const
     { return t.has_on_unbounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Iso_rectangle_2& r, const Point_2& p) const
     {
       return K().bounded_side_2_object()(r,p)== ON_UNBOUNDED_SIDE;
@@ -3916,27 +3753,27 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_unbounded_side_3
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_3          Point_3;
     typedef typename K::Iso_cuboid_3     Iso_cuboid_3;
     typedef typename K::Sphere_3         Sphere_3;
     typedef typename K::Circle_3         Circle_3;
     typedef typename K::Tetrahedron_3    Tetrahedron_3;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.has_on_unbounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     { return t.rep().has_on_unbounded_side(p); }
 
-    result_type
+    Boolean
     operator()( const Iso_cuboid_3& c, const Point_3& p) const
     { return c.rep().has_on_unbounded_side(p); }
 
-    result_type
+    Boolean
     operator()(const Circle_3& c, const Point_3& p) const
     {
       CGAL_kernel_precondition(
@@ -3949,22 +3786,22 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Has_on_2
   {
+    typedef typename K::Boolean          Boolean;
     typedef typename K::Point_2          Point_2;
     typedef typename K::Line_2           Line_2;
     typedef typename K::Ray_2            Ray_2;
     typedef typename K::Segment_2        Segment_2;
-  public:
-    typedef typename K::Boolean          result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Line_2& l, const Point_2& p) const
     { return l.has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Ray_2& r, const Point_2& p) const
     { return r.has_on(p); }
 
-    result_type
+    Boolean
     operator()( const Segment_2& s, const Point_2& p) const
     { return s.has_on(p); }
   };
@@ -3973,8 +3810,6 @@ namespace CommonKernelFunctors {
   class Intersect_2
   {
   public:
-
-    // 25 possibilities, so I keep the template.
     template <class T1, class T2>
     typename CGAL::Intersection_traits<K,T1,T2>::result_type
     operator()(const T1& t1, const T2& t2) const
@@ -3985,9 +3820,8 @@ namespace CommonKernelFunctors {
   class Intersect_3
   {
     typedef typename K::Plane_3     Plane_3;
-  public:
 
-    // n possibilities, so I keep the template.
+  public:
     template <class T1, class T2>
     typename CGAL::Intersection_traits<K,T1,T2>::result_type
     operator()(const T1& t1, const T2& t2) const
@@ -4029,6 +3863,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Is_degenerate_2
   {
+    typedef typename K::Boolean           Boolean;
     typedef typename K::Circle_2          Circle_2;
     typedef typename K::Iso_rectangle_2   Iso_rectangle_2;
     typedef typename K::Line_2            Line_2;
@@ -4036,34 +3871,33 @@ namespace CommonKernelFunctors {
     typedef typename K::Segment_2         Segment_2;
     typedef typename K::Triangle_2        Triangle_2;
     typedef typename K::Circle_3          Circle_3;
-  public:
-    typedef typename K::Boolean           result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Circle_2& c) const
     { return c.is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Iso_rectangle_2& r) const
     { return (r.xmin() == r.xmax()) || (r.ymin() == r.ymax()); }
 
-    result_type
+    Boolean
     operator()( const Line_2& l) const
     { return CGAL_NTS is_zero(l.a())  && CGAL_NTS is_zero(l.b()); }
 
-    result_type
+    Boolean
     operator()( const Ray_2& r) const
     { return r.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Segment_2& s) const
     { return s.source() == s.target(); }
 
-    result_type
+    Boolean
     operator()( const Triangle_2& t) const
     { return t.is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Circle_3& c) const
     { return c.rep().is_degenerate(); }
   };
@@ -4071,6 +3905,7 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Is_degenerate_3
   {
+    typedef typename K::Boolean           Boolean;
     typedef typename K::Iso_cuboid_3      Iso_cuboid_3;
     typedef typename K::Line_3            Line_3;
     typedef typename K::Circle_3          Circle_3;
@@ -4080,42 +3915,41 @@ namespace CommonKernelFunctors {
     typedef typename K::Sphere_3          Sphere_3;
     typedef typename K::Triangle_3        Triangle_3;
     typedef typename K::Tetrahedron_3     Tetrahedron_3;
-  public:
-    typedef typename K::Boolean           result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Iso_cuboid_3& c) const
     { return c.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Line_3& l) const
     { return l.rep().is_degenerate();  }
 
-    result_type
+    Boolean
     operator()( const Plane_3& pl) const
     { return pl.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Ray_3& r) const
     { return r.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Segment_3& s) const
     { return s.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Sphere_3& s) const
     { return s.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Triangle_3& t) const
     { return t.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Tetrahedron_3& t) const
     { return t.rep().is_degenerate(); }
 
-    result_type
+    Boolean
     operator()( const Circle_3& t) const
     { return t.rep().is_degenerate(); }
 
@@ -4124,21 +3958,21 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Is_horizontal_2
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Line_2    Line_2;
     typedef typename K::Segment_2 Segment_2;
     typedef typename K::Ray_2     Ray_2;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Line_2& l) const
     { return CGAL_NTS is_zero(l.a()); }
 
-    result_type
+    Boolean
     operator()( const Segment_2& s) const
     { return s.is_horizontal(); }
 
-    result_type
+    Boolean
     operator()( const Ray_2& r) const
     { return r.is_horizontal(); }
   };
@@ -4146,21 +3980,21 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Is_vertical_2
   {
+    typedef typename K::Boolean   Boolean;
     typedef typename K::Line_2    Line_2;
     typedef typename K::Segment_2 Segment_2;
     typedef typename K::Ray_2     Ray_2;
-  public:
-    typedef typename K::Boolean   result_type;
 
-    result_type
+  public:
+    Boolean
     operator()( const Line_2& l) const
     { return CGAL_NTS is_zero(l.b()); }
 
-    result_type
+    Boolean
     operator()( const Segment_2& s) const
     { return s.is_vertical(); }
 
-    result_type
+    Boolean
     operator()( const Ray_2& r) const
     { return r.is_vertical(); }
   };
@@ -4168,16 +4002,17 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Left_turn_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Orientation_2  Orientation_2;
-    Orientation_2 o;
-  public:
-    typedef typename K::Boolean        result_type;
 
+    Orientation_2 o;
+
+  public:
     Left_turn_2() {}
     Left_turn_2(const Orientation_2& o_) : o(o_) {}
 
-    result_type
+    Boolean
     operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     { return o(p, q, r) == LEFT_TURN; }
   };
@@ -4185,22 +4020,23 @@ namespace CommonKernelFunctors {
   template <typename K>
   class Less_rotate_ccw_2
   {
+    typedef typename K::Boolean        Boolean;
     typedef typename K::Point_2        Point_2;
     typedef typename K::Orientation_2  Orientation_2;
     typedef typename K::Collinear_are_ordered_along_line_2
+
     Collinear_are_ordered_along_line_2;
     Orientation_2 o;
     Collinear_are_ordered_along_line_2 co;
-  public:
-    typedef typename K::Boolean        result_type;
 
+  public:
     Less_rotate_ccw_2() {}
     Less_rotate_ccw_2(const Orientation_2& o_,
                       const Collinear_are_ordered_along_line_2& co_)
       : o(o_), co(co_)
     {}
 
-    result_type
+    Boolean
     operator()(const Point_2& r, const Point_2& p, const Point_2& q) const
     {
       typename K::Orientation ori = o(r, p, q);
@@ -4227,23 +4063,23 @@ namespace CommonKernelFunctors {
     typedef typename K::Plane_3        Plane_3;
     typedef typename K::Sphere_3       Sphere_3;
   public:
-    typedef typename K::Oriented_side  result_type;
+    typedef typename K::Oriented_side  Oriented_side;
 
-    result_type
+    Oriented_side
     operator()( const Sphere_3& s, const Point_3& p) const
     { return s.rep().oriented_side(p); }
 
-    result_type
+    Oriented_side
     operator()( const Plane_3& pl, const Point_3& p) const
     { return pl.rep().oriented_side(p); }
 
-    result_type
+    Oriented_side
     operator()( const Point_3& plane_pt, const Vector_3& plane_normal, const Point_3& query) const
     {
       return typename K::Construct_plane_3()(plane_pt, plane_normal).rep().oriented_side(query);
     }
 
-    result_type
+    Oriented_side
     operator()( const Tetrahedron_3& t, const Point_3& p) const
     { return t.rep().oriented_side(p); }
   };
@@ -4257,9 +4093,7 @@ public:
   typedef typename K::Point_2                  Point_2;
   typedef typename K::FT                       FT;
 
-  typedef Point_2       result_type;
-
-  result_type operator() (const Weighted_point_2 & p,
+  Point_2 operator() (const Weighted_point_2 & p,
                           const Weighted_point_2 & q,
                           const Weighted_point_2 & r) const
   {
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions.h b/Kernel_23/include/CGAL/Kernel/global_functions.h
index 560ad35ccb5..017c935be56 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions.h
@@ -28,7 +28,7 @@ namespace CGAL {
 
 template <class T1, class T2, class T3>
 inline
-Comparison_result
+typename Kernel_traits<T1>::Kernel::Comparison_result
 compare_distance(const T1 &o1,
                  const T2 &o2,
                  const T3 &o3)
@@ -39,7 +39,7 @@ compare_distance(const T1 &o1,
 
 template <class T1, class T2, class T3, class T4>
 inline
-Comparison_result
+typename Kernel_traits<T1>::Kernel::Comparison_result
 compare_distance(const T1 &o1,
                  const T2 &o2,
                  const T3 &o3,
@@ -51,7 +51,7 @@ compare_distance(const T1 &o1,
 
 template <typename O>
 inline
-bool
+typename Kernel_traits<O>::Kernel::Boolean
 parallel(const O &o1, const O &o2)
 {
   typedef typename Kernel_traits<O>::Kernel K;
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions_2.h b/Kernel_23/include/CGAL/Kernel/global_functions_2.h
index ad67bff1041..e90685d7b0d 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions_2.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions_2.h
@@ -28,23 +28,9 @@
 
 namespace CGAL {
 
-template < class K >
-typename K::Boolean
-operator==(const Point_2<K> &p, const Origin& o)
-{
-  return p == Point_2<K>(o);
-}
-
-template < class K >
-typename K::Boolean
-operator!=(const Point_2<K> &p, const Origin& o)
-{
-  return p != Point_2<K>(o);
-}
-
 template < class K >
 inline
-Angle
+typename K::Angle
 angle(const Vector_2<K> &u,
       const Vector_2<K> &v)
 {
@@ -53,7 +39,7 @@ angle(const Vector_2<K> &u,
 
 template < class K >
 inline
-Angle
+typename K::Angle
 angle(const Point_2<K> &p,
       const Point_2<K> &q,
       const Point_2<K> &r)
@@ -63,7 +49,7 @@ angle(const Point_2<K> &p,
 
 template < class K >
 inline
-Angle
+typename K::Angle
 angle(const Point_2<K> &p,
       const Point_2<K> &q,
       const Point_2<K> &r,
@@ -764,7 +750,9 @@ midpoint(const Point_2<K> &p, const Point_2<K> &q)
 }
 
 template < class K >
-inline typename K::Point_2 midpoint(const Segment_2<K> &s)
+inline
+typename K::Point_2
+midpoint(const Segment_2<K> &s)
 {
   return internal::midpoint(s, K());
 }
@@ -787,6 +775,264 @@ min_vertex(const Iso_rectangle_2<K> &ir)
 
 // FIXME TODO : What do we do with the operators ?
 // They have no counter part with the kernel argument...
+template < class K >
+inline
+typename K::Boolean
+operator==(const Point_2<K>& p, const Point_2<K>& q)
+{ return K().equal_2_object()(p, q); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Point_2<K>& p, const Point_2<K>& q)
+{ return ! (p == q); }
+
+template < class K >
+typename K::Boolean
+operator==(const Point_2<K> &p, const Origin& o)
+{
+  return p == Point_2<K>(o);
+}
+
+template < class K >
+typename K::Boolean
+operator==(const Origin& o, const Point_2<K> &p)
+{
+  return (p == o);
+}
+
+template < class K >
+typename K::Boolean
+operator!=(const Point_2<K> &p, const Origin& o)
+{
+  return ! (p == o);
+}
+
+template < class K >
+typename K::Boolean
+operator!=(const Origin& o, const Point_2<K> &p)
+{
+  return ! (p == o);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Origin& o, const Weighted_point_2<K>& p)
+{ return p == o; }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Origin& o, const Weighted_point_2<K>& p)
+{ return p != o; }
+
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Point_2<K>& bp, const Weighted_point_2<K>& p)
+{ return bp == p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Point_2<K>& bp, const Weighted_point_2<K>& p)
+{ return bp != p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Weighted_point_2<K>& p, const Point_2<K>& bp)
+{ return bp == p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Weighted_point_2<K>& p, const Point_2<K>& bp)
+{ return bp != p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Weighted_point_2<K>& p, const Weighted_point_2<K>& p2)
+{ return p.point() == p2.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Weighted_point_2<K>& p, const Weighted_point_2<K>& p2)
+{ return p.point() != p2.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Vector_2<K>& v, const Vector_2<K>& w)
+{ return K().equal_2_object()(v, w); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Vector_2<K>& v, const Vector_2<K>& w)
+{ return ! (v == w); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Vector_2<K>& v, const Null_vector& n)
+{
+  return K().equal_2_object()(v, n);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Null_vector& n, const Vector_2<K>& v)
+{
+  return v == n;
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Vector_2<K>& v, const Null_vector& n)
+{
+  return ! (v == n);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Null_vector& n, const Vector_2<K>& v)
+{
+  return ! (v == n);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Circle_2<K>& p, const Circle_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Circle_2<K>& p, const Circle_2<K>& q)
+{
+  return ! (p == q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Direction_2<K>& p, const Direction_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Direction_2<K>& p, const Direction_2<K>& q)
+{
+  return ! (p == q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Iso_rectangle_2<K>& p, const Iso_rectangle_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Iso_rectangle_2<K>& p, const Iso_rectangle_2<K>& q)
+{
+  return ! (p == q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Line_2<K>& p, const Line_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Line_2<K>& p, const Line_2<K>& q)
+{
+  return ! (p == q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Ray_2<K>& p, const Ray_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Ray_2<K>& p, const Ray_2<K>& q)
+{
+  return ! (p == q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Segment_2<K>& p, const Segment_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Segment_2<K>& p, const Segment_2<K>& q)
+{
+  return ! (p == q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Triangle_2<K>& p, const Triangle_2<K>& q)
+{
+  return K().equal_2_object()(p, q);
+}
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Triangle_2<K>& p, const Triangle_2<K>& q)
+{
+  return ! (p == q);
+}
+
+
+template < class K >
+inline
+typename K::Boolean
+operator<(const Point_2<K>& p, const Point_2<K>& q)
+{ return K().less_xy_2_object()(p, q); }
+
+template < class K >
+inline
+typename K::Boolean
+operator<(const Weighted_point_2<K>& p, const Weighted_point_2<K>& q)
+{ return p.point() < q.point(); }
+
 template < class K >
 inline
 typename K::Boolean
@@ -811,24 +1057,6 @@ typename K::Boolean
 operator<=(const Direction_2<K>& d1, const Direction_2<K>& d2)
 { return compare_angle_with_x_axis(d1, d2) != LARGER; }
 
-template < class K >
-inline
-typename K::Boolean
-operator==(const Point_2<K>& p, const Point_2<K>& q)
-{ return K().equal_2_object()(p, q); }
-
-template < class K >
-inline
-typename K::Boolean
-operator!=(const Point_2<K>& p, const Point_2<K>& q)
-{ return ! (p == q); }
-
-template < class K >
-inline
-typename K::Boolean
-operator<(const Point_2<K>& p, const Point_2<K>& q)
-{ return K().less_xy_2_object()(p, q); }
-
 template < class K >
 inline
 typename K::Boolean
@@ -847,18 +1075,6 @@ typename K::Boolean
 operator>=(const Point_2<K>& p, const Point_2<K>& q)
 { return ! K().less_xy_2_object()(p, q); }
 
-template < class K >
-inline
-typename K::Boolean
-operator==(const Vector_2<K>& v, const Vector_2<K>& w)
-{ return K().equal_2_object()(v, w); }
-
-template < class K >
-inline
-typename K::Boolean
-operator!=(const Vector_2<K>& v, const Vector_2<K>& w)
-{ return ! (v == w); }
-
 template < class K >
 inline
 typename K::Vector_2
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions_3.h b/Kernel_23/include/CGAL/Kernel/global_functions_3.h
index b660dd84f05..4a2ef5d6b19 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions_3.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions_3.h
@@ -28,7 +28,7 @@ namespace CGAL {
 
 template <typename K>
 inline
-Angle
+typename K::Angle
 angle(const Vector_3<K> &u, const Vector_3<K> &v)
 {
   return internal::angle(u, v, K());
@@ -36,7 +36,7 @@ angle(const Vector_3<K> &u, const Vector_3<K> &v)
 
 template <typename K>
 inline
-Angle
+typename K::Angle
 angle(const Point_3<K> &p, const Point_3<K> &q, const Point_3<K> &r)
 {
   return internal::angle(p, q, r, K());
@@ -44,7 +44,7 @@ angle(const Point_3<K> &p, const Point_3<K> &q, const Point_3<K> &r)
 
 template <typename K>
 inline
-Angle
+typename K::Angle
 angle(const Point_3<K> &p, const Point_3<K> &q,
       const Point_3<K> &r, const Point_3<K> &s)
 {
@@ -53,7 +53,7 @@ angle(const Point_3<K> &p, const Point_3<K> &q,
 
 template <typename K>
 inline
-Angle
+typename K::Angle
 angle(const Point_3<K> &p, const Point_3<K> &q,
       const Point_3<K> &r, const Vector_3<K> &v)
 {
@@ -206,7 +206,7 @@ bisector(const Plane_3<K> &h1, const Plane_3<K> &h2)
 
 template < class K >
 inline
-Point_3<K>
+typename K::Point_3
 centroid(const Point_3<K> &p, const Point_3<K> &q,
          const Point_3<K> &r, const Point_3<K> &s)
 {
@@ -215,7 +215,7 @@ centroid(const Point_3<K> &p, const Point_3<K> &q,
 
 template < class K >
 inline
-Point_3<K>
+typename K::Point_3
 centroid(const Point_3<K> &p, const Point_3<K> &q, const Point_3<K> &r)
 {
   return internal::centroid(p, q, r, K());
@@ -223,7 +223,7 @@ centroid(const Point_3<K> &p, const Point_3<K> &q, const Point_3<K> &r)
 
 template < class K >
 inline
-Point_3<K>
+typename K::Point_3
 centroid(const Tetrahedron_3<K> &t)
 {
   return internal::centroid(t, K());
@@ -231,7 +231,7 @@ centroid(const Tetrahedron_3<K> &t)
 
 template < class K >
 inline
-Point_3<K>
+typename K::Point_3
 centroid(const Triangle_3<K> &t)
 {
   return internal::centroid(t, K());
@@ -804,12 +804,80 @@ typename K::Boolean
 operator==(const Point_3<K>& p, const Origin& o)
 { return K().equal_3_object()(p, Point_3<K>(o)); }
 
+template < class K >
+inline
+typename K::Boolean
+operator==(const Origin& o, const Point_3<K>& p)
+{ return p == o; }
+
 template < class K >
 inline
 typename K::Boolean
 operator!=(const Point_3<K>& p, const Origin& o)
 { return ! (p == o); }
 
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Origin& o, const Point_3<K>& p)
+{ return ! (p == o); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Origin& o, const Weighted_point_3<K>& p)
+{ return p == o; }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Origin& o, const Weighted_point_3<K>& p)
+{ return p != o; }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Point_3<K>& bp, const Weighted_point_3<K>& p)
+{ return bp == p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Point_3<K>& bp, const Weighted_point_3<K>& p)
+{ return bp != p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Weighted_point_3<K>& p, const Point_3<K>& bp)
+{ return bp == p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Weighted_point_3<K>& p, const Point_3<K>& bp)
+{ return bp != p.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Weighted_point_3<K>& p, const Weighted_point_3<K>& p2)
+{ return p.point() == p2.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Weighted_point_3<K>& p, const Weighted_point_3<K>& p2)
+{ return p.point() != p2.point(); }
+
+template < class K >
+inline
+typename K::Boolean
+operator==(const Circle_3<K>& p, const Circle_3<K>& q)
+{
+  return K().equal_3_object()(p, q);
+}
+
 template < class K >
 inline
 typename K::Boolean
@@ -939,8 +1007,20 @@ operator==(const Vector_3<K>& p, const Null_vector& o)
 template < class K >
 inline
 typename K::Boolean
-operator!=(const Vector_3<K>& p, const Null_vector& o)
-{ return ! (p == o); }
+operator==(const Null_vector& o, const Vector_3<K>& v)
+{ return (v == o); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Vector_3<K>& v, const Null_vector& o)
+{ return ! (v == o); }
+
+template < class K >
+inline
+typename K::Boolean
+operator!=(const Null_vector& o, const Vector_3<K>& v)
+{ return ! (v == o); }
 
 
 template < class K >
@@ -967,6 +1047,12 @@ typename K::Boolean
 operator>=(const Point_3<K>& p, const Point_3<K>& q)
 { return ! K().less_xyz_3_object()(p, q); }
 
+template < class K >
+inline
+typename K::Boolean
+operator<(const Weighted_point_3<K>& p, const Weighted_point_3<K>& q)
+{ return p.point() < q.point(); }
+
 template < class K >
 inline
 typename K::Vector_3
diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
index bc691bf27d7..1fd5bdce59f 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
@@ -91,9 +91,11 @@ template <class R,int dim>
 class Construct_bbox_projected_2 {
 public:
   typedef typename R::Point_3     Point;
-  typedef Bbox_2 result_type;
 
-  Bbox_2 operator()(const Point& p) const { typename R::Construct_bbox_3 bb;  return Projector<R, dim>::bbox(bb(p)); }
+  Bbox_2 operator()(const Point& p) const {
+    typename R::Construct_bbox_3 bb;
+    return Projector<R, dim>::bbox(bb(p));
+  }
 };
 
 template <class R,int dim>
@@ -177,39 +179,43 @@ public:
 template <class R,int dim>
 class Side_of_bounded_circle_projected_3
 {
+  typedef typename R::Bounded_side Bounded_side;
+  typedef typename R::Point_3      Point;
+
 public:
-  typedef typename R::Point_3     Point;
   typename R::FT x(const Point &p) const { return Projector<R,dim>::x(p); }
   typename R::FT y(const Point &p) const { return Projector<R,dim>::y(p); }
 
-
   typename R::Point_2 project(const Point& p) const
   {
     return typename R::Point_2(x(p),y(p));
   }
-  CGAL::Bounded_side operator() (const Point &p,
-                                  const Point &q,
-                                  const Point &r,
-                                  const Point &s) const
-    {
-      return CGAL::side_of_bounded_circle(project(p),project(q),project(r),project(s) );
-    }
 
-    CGAL::Bounded_side operator() (const Point &p,
-                                  const Point &q,
-                                  const Point &r) const
-    {
-      return CGAL::side_of_bounded_circle(project(p),project(q),project(r));
-    }
+  Bounded_side operator()(const Point &p,
+                          const Point &q,
+                          const Point &r,
+                          const Point &s) const
+  {
+    return CGAL::side_of_bounded_circle(project(p),project(q),project(r),project(s) );
+  }
+
+  Bounded_side operator()(const Point &p,
+                          const Point &q,
+                          const Point &r) const
+  {
+    return CGAL::side_of_bounded_circle(project(p),project(q),project(r));
+  }
 };
 
 template <class R,int dim>
 class Compare_distance_projected_3
 {
 public:
+  typedef typename R::Comparison_result Comparison_result;
   typedef typename R::Point_3   Point_3;
   typedef typename R::Point_2   Point_2;
   typedef typename R::FT        RT;
+
   typename R::FT x(const Point_3 &p) const { return Projector<R,dim>::x(p); }
   typename R::FT y(const Point_3 &p) const { return Projector<R,dim>::y(p); }
 
@@ -255,22 +261,23 @@ template <class R, int dim>
 class Compare_signed_distance_to_line_projected_3
 {
 public:
+  typedef typename R::Comparison_result Comparison_result;
   typedef typename R::Point_3   Point_3;
   typedef typename R::Point_2   Point_2;
   typedef typename R::FT        RT;
+
   typename R::FT x(const Point_3 &p) const { return Projector<R,dim>::x(p); }
   typename R::FT y(const Point_3 &p) const { return Projector<R,dim>::y(p); }
-  typedef typename R::Comparison_result result_type;
 
   Point_2 project(const Point_3& p) const
   {
     return Point_2(x(p),y(p));
   }
 
-  result_type operator()(const Point_3& p,
-                         const Point_3& q,
-                         const Point_3& r,
-                         const Point_3& s) const
+  Comparison_result operator()(const Point_3& p,
+                               const Point_3& q,
+                               const Point_3& r,
+                               const Point_3& s) const
   {
     return typename R::Compare_signed_distance_to_line_2()
       (  project(p), project(q), project(r), project(s) );
@@ -281,22 +288,23 @@ template <class R, int dim>
 class Less_signed_distance_to_line_projected_3
 {
 public:
+  typedef typename R::Boolean   Boolean;
   typedef typename R::Point_3   Point_3;
   typedef typename R::Point_2   Point_2;
   typedef typename R::FT        RT;
+
   typename R::FT x(const Point_3 &p) const { return Projector<R,dim>::x(p); }
   typename R::FT y(const Point_3 &p) const { return Projector<R,dim>::y(p); }
-  typedef typename R::Boolean result_type;
 
   Point_2 project(const Point_3& p) const
   {
     return Point_2(x(p),y(p));
   }
 
-  result_type operator()(const Point_3& p,
-                         const Point_3& q,
-                         const Point_3& r,
-                         const Point_3& s) const
+  Boolean operator()(const Point_3& p,
+                     const Point_3& q,
+                     const Point_3& r,
+                     const Point_3& s) const
   {
     return typename R::Less_signed_distance_to_line_2()
       (  project(p), project(q), project(r), project(s) );
@@ -314,6 +322,7 @@ public:
   typedef typename R::Segment_3 Segment_3;
   typedef typename R::Segment_2 Segment_2;
   typedef typename R::FT        RT;
+
   typename R::FT x(const Point_3 &p) const { return Projector<R,dim>::x(p); }
   typename R::FT y(const Point_3 &p) const { return Projector<R,dim>::y(p); }
 
@@ -598,8 +607,6 @@ class Compute_squared_length_projected_3
   typedef typename R::Vector_3    Vector_3;
   typedef typename R::FT          FT;
 
-  typedef FT result_type;
-
   FT x(const Vector_3 &v) const { return Projector<R,dim>::x(v); }
   FT y(const Vector_3 &v) const { return Projector<R,dim>::y(v); }
 
@@ -634,6 +641,7 @@ template <class R, int dim>
 class Compare_power_distance_projected_3
 {
 public:
+  typedef typename R::Comparison_result         Comparison_result;
   typedef typename R::Point_2                   Point_2;
   typedef typename R::Weighted_point_2          Weighted_point_2;
   typedef typename R::Point_3                   Point_3;
@@ -815,6 +823,7 @@ template <class R, int dim>
 class Power_side_of_bounded_power_circle_projected_3
 {
 public:
+  typedef typename R::Bounded_side              Bounded_side;
   typedef typename R::Point_2                   Point_2;
   typedef typename R::Weighted_point_2          Weighted_point_2;
   typedef typename R::Point_3                   Point_3;
@@ -830,24 +839,24 @@ public:
     return Weighted_point_2(Point_2(x(p), y(p)), wp.weight());
   }
 
-  CGAL::Bounded_side operator()(const Weighted_point_3 &wp,
-                                const Weighted_point_3 &wq,
-                                const Weighted_point_3 &wr,
-                                const Weighted_point_3 &ws) const
+  Bounded_side operator()(const Weighted_point_3 &wp,
+                          const Weighted_point_3 &wq,
+                          const Weighted_point_3 &wr,
+                          const Weighted_point_3 &ws) const
   {
     return CGAL::power_side_of_bounded_power_circle(project(wp), project(wq),
                                                     project(wr), project(ws));
   }
 
-  CGAL::Bounded_side operator()(const Weighted_point_3 &wp,
-                                const Weighted_point_3 &wq,
-                                const Weighted_point_3 &wr) const
+  Bounded_side operator()(const Weighted_point_3 &wp,
+                          const Weighted_point_3 &wq,
+                          const Weighted_point_3 &wr) const
   {
     return CGAL::power_side_of_bounded_power_circle(project(wp), project(wq), project(wr));
   }
 
-  CGAL::Bounded_side operator()(const Weighted_point_3 &wp,
-                                const Weighted_point_3 &wq) const
+  Bounded_side operator()(const Weighted_point_3 &wp,
+                          const Weighted_point_3 &wq) const
   {
     return CGAL::power_side_of_bounded_power_circle(project(wp), project(wq));
   }
@@ -974,8 +983,10 @@ public:
   typedef typename Rp::Compare_xyz_3                          Compare_xy_2;
 
   struct Less_xy_2 {
-    typedef typename R::Boolean result_type;
-    bool operator()(const Point_2& p, const Point_2& q) const
+    typedef typename R::Comparison_result Comparison_result;
+    typedef typename R::Boolean Boolean;
+
+    Boolean operator()(const Point_2& p, const Point_2& q) const
     {
       Compare_x_2 cx;
       Comparison_result crx = cx(p,q);
@@ -988,8 +999,8 @@ public:
 
 
   struct Less_yx_2 {
-    typedef typename R::Boolean result_type;
-    bool operator()(const Point_2& p, const Point_2& q) const
+    typedef typename R::Boolean Boolean;
+    Boolean operator()(const Point_2& p, const Point_2& q) const
     {
       Compare_y_2 cy;
       Comparison_result cry = cy(p,q);
@@ -1001,8 +1012,8 @@ public:
   };
 
   struct Equal_2 {
-    typedef typename R::Boolean result_type;
-    bool operator()(const Point_2& p, const Point_2& q) const
+    typedef typename R::Boolean Boolean;
+    Boolean operator()(const Point_2& p, const Point_2& q) const
     {
 
       Equal_x_2 eqx;
@@ -1012,8 +1023,8 @@ public:
   };
 
   struct Left_turn_2 {
-    typedef typename R::Boolean result_type;
-    bool operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
+    typedef typename R::Boolean Boolean;
+    Boolean operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
 
       Orientation_2 ori;
@@ -1022,7 +1033,7 @@ public:
   };
 
   struct Collinear_2 {
-    typedef typename R::Boolean result_type;
+    typedef typename R::Boolean Boolean;
     bool operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
     {
       Orientation_2 ori;
diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
index e179fecc677..731499c6d8b 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
@@ -34,7 +34,6 @@ class Projected_orientation_with_normal_3
   typedef typename Traits::Vector_3 Vector_3;
 public:
   typedef typename K::Orientation Orientation;
-  typedef Orientation result_type;
 
   Projected_orientation_with_normal_3(const Vector_3& normal_)
     : normal(normal_)
@@ -69,7 +68,6 @@ class Projected_side_of_oriented_circle_with_normal_3
 
 public:
   typedef typename K::Oriented_side Oriented_side;
-  typedef Oriented_side result_type;
 
   Projected_side_of_oriented_circle_with_normal_3(const Vector_3& normal_)
     : normal(normal_)
@@ -307,6 +305,7 @@ template <class Traits>
 class Less_along_axis
 {
   // private members
+  typedef typename Traits::Boolean Boolean;
   typedef typename Traits::Vector_3 Vector_3;
   typedef typename Traits::Point_2 Point;
   Vector_3 base;
@@ -317,9 +316,7 @@ public:
     CGAL_TIME_PROFILER("Construct Less_along_axis")
   }
 
-  typedef bool result_type;
-
-  bool operator() (const Point &p, const Point &q) const {
+  Boolean operator() (const Point &p, const Point &q) const {
     return base * (p - q) < 0;
   }
 }; // end class Less_along_axis
@@ -328,6 +325,7 @@ template <class Traits>
 class Compare_along_axis
 {
   // private members
+  typedef typename Traits::Comparison_result Comparison_result;
   typedef typename Traits::Vector_3 Vector_3;
   typedef typename Traits::Point_2 Point;
   Vector_3 base;
@@ -338,8 +336,6 @@ public:
     CGAL_TIME_PROFILER("Construct Compare_along_axis")
   }
 
-  typedef Comparison_result result_type;
-
   Comparison_result operator() (const Point &p, const Point &q) const {
     return compare(base * (p - q), 0);
   }
@@ -349,9 +345,13 @@ template <class Traits>
 class Less_xy_along_axis
 {
   // private members
+  typedef typename Traits::Comparison_result Comparison_result;
+  typedef typename Traits::Boolean Boolean;
   typedef typename Traits::Vector_3 Vector_3;
   typedef typename Traits::Point_2 Point;
+
   Vector_3 base1, base2;
+
 public:
   Less_xy_along_axis(const Vector_3& base1, const Vector_3& base2) : base1(base1), base2(base2)
   {
@@ -359,9 +359,7 @@ public:
     CGAL_TIME_PROFILER("Construct Less_xy_along_axis")
   }
 
-  typedef bool result_type;
-
-  bool operator() (const Point &p, const Point &q) const {
+  Boolean operator() (const Point &p, const Point &q) const {
 
     Compare_along_axis<Traits> cx(base1);
     Comparison_result crx = cx(p, q);
@@ -372,6 +370,34 @@ public:
   }
 }; // end class Less_xy_along_axis
 
+template <class Traits>
+class Compare_xy_along_axis
+{
+  // private members
+  typedef typename Traits::Comparison_result Comparison_result;
+  typedef typename Traits::Vector_3 Vector_3;
+  typedef typename Traits::Point_2 Point;
+  Vector_3 base1, base2;
+
+public:
+  Compare_xy_along_axis(const Vector_3& base1, const Vector_3& base2) : base1(base1), base2(base2)
+  {
+    CGAL_PROFILER("Construct Compare_xy_along_axis")
+    CGAL_TIME_PROFILER("Construct Compare_xy_along_axis")
+  }
+
+  Comparison_result operator()(const Point& p, const Point& q) const
+  {
+    Compare_along_axis<Traits> cx(base1);
+    Comparison_result crx = cx(p, q);
+    if (crx != EQUAL) {
+      return crx;
+    }
+    Compare_along_axis<Traits> cy(base2);
+    return cy(p, q);
+  }
+}; // end class Compare_xy_along_axis
+
 } // end namespace TriangulationProjectionTraitsCartesianFunctors
 
 
@@ -418,6 +444,15 @@ public:
   }
 
   typedef Kernel K;
+
+  typedef typename K::Boolean                                Boolean;
+  typedef typename K::Sign                                   Sign;
+  typedef typename K::Comparison_result                      Comparison_result;
+  typedef typename K::Orientation                            Orientation;
+  typedef typename K::Oriented_side                          Oriented_side;
+  typedef typename K::Bounded_side                           Bounded_side;
+  typedef typename K::Angle                                  Angle;
+
   typedef typename K::FT          FT;
   typedef typename K::Point_3     Point_2;
   typedef typename K::Segment_3   Segment_2;
@@ -426,12 +461,13 @@ public:
   typedef typename K::Line_3      Line_2;
 
   typedef typename K::Angle_3                                Angle_2;
-  typedef typename K::Compare_xyz_3                          Compare_xy_2;
 
   typedef TriangulationProjectionTraitsCartesianFunctors::
     Compare_along_axis<Self>                                 Compare_x_2;
   typedef TriangulationProjectionTraitsCartesianFunctors::
     Compare_along_axis<Self>                                 Compare_y_2;
+  typedef TriangulationProjectionTraitsCartesianFunctors::
+    Compare_xy_along_axis<Self>                              Compare_xy_2;
 
   typedef TriangulationProjectionTraitsCartesianFunctors::
     Less_along_axis<Self>                                    Less_x_2;
@@ -498,6 +534,12 @@ public:
     return Compare_y_2(this->base2());
   }
 
+  Compare_xy_2
+  compare_xy_2_object() const
+  {
+    return Compare_xy_2(this->base1(), this->base2());
+  }
+
   Orientation_2
   orientation_2_object() const
   {
@@ -525,9 +567,6 @@ public:
   Angle_2  angle_2_object() const
     {return Angle_2();}
 
-  Compare_xy_2  compare_xy_2_object() const
-    {return Compare_xy_2();}
-
   Construct_point_2  construct_point_2_object() const
     {return Construct_point_2();}
 
diff --git a/Kernel_23/include/CGAL/Line_2.h b/Kernel_23/include/CGAL/Line_2.h
index 33406d119a5..3e099bc27e8 100644
--- a/Kernel_23/include/CGAL/Line_2.h
+++ b/Kernel_23/include/CGAL/Line_2.h
@@ -223,19 +223,6 @@ public:
   {
     return R().construct_point_2_object()(*this,i);
   }
-
-  typename R::Boolean
-  operator==(const Line_2 &l) const
-  {
-    return R().equal_2_object()(*this, l);
-  }
-
-  typename R::Boolean
-  operator!=(const Line_2 &l) const
-  {
-    return !(*this == l);
-  }
-
 };
 
 
diff --git a/Kernel_23/include/CGAL/Line_3.h b/Kernel_23/include/CGAL/Line_3.h
index ebfb32c7972..83da91599ce 100644
--- a/Kernel_23/include/CGAL/Line_3.h
+++ b/Kernel_23/include/CGAL/Line_3.h
@@ -28,6 +28,7 @@ namespace CGAL {
 template <class R_>
 class Line_3 : public R_::Kernel_base::Line_3
 {
+  typedef typename R_::Boolean               Boolean;
   typedef typename R_::FT                    FT;
   typedef typename R_::Point_3               Point_3;
   typedef typename R_::Ray_3                 Ray_3;
@@ -98,7 +99,7 @@ public:
     return R().construct_direction_3_object()(*this);
   }
 
-  bool has_on(const Point_3 &p) const
+  Boolean has_on(const Point_3 &p) const
   {
     return R().has_on_3_object()(*this, p);
     //return has_on_boundary(p);
@@ -129,11 +130,10 @@ public:
     return R().construct_projected_point_3_object()(*this, p);
   }
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
   }
-
 };
 
 template < class R >
diff --git a/Kernel_23/include/CGAL/Plane_3.h b/Kernel_23/include/CGAL/Plane_3.h
index b391b4388d2..aba2e0e17b8 100644
--- a/Kernel_23/include/CGAL/Plane_3.h
+++ b/Kernel_23/include/CGAL/Plane_3.h
@@ -29,6 +29,8 @@ namespace CGAL {
 template <class R_>
 class Plane_3 : public R_::Kernel_base::Plane_3
 {
+  typedef typename R_::Boolean               Boolean;
+  typedef typename R_::Oriented_side         Oriented_side;
   typedef typename R_::RT                    RT;
   typedef typename R_::Point_2               Point_2;
   typedef typename R_::Point_3               Point_3;
@@ -140,17 +142,17 @@ public:
     return R().compute_d_3_object()(*this);
   }
 
-  bool has_on(const Point_3 &p) const
+  Boolean has_on(const Point_3 &p) const
   {
     return R().has_on_3_object()(*this, p);
   }
 
-  bool has_on(const Circle_3 &c) const
+  Boolean has_on(const Circle_3 &c) const
   {
     return R().has_on_3_object()(*this, c);
   }
 
-  bool has_on(const Line_3 &l) const
+  Boolean has_on(const Line_3 &l) const
   {
     return R().has_on_3_object()(*this, l);
   }
@@ -204,33 +206,32 @@ public:
     return R().oriented_side_3_object()(*this, p);
   }
 
-  bool has_on_positive_side(const Point_3 &p) const
+  Boolean has_on_positive_side(const Point_3 &p) const
   {
     return R().has_on_positive_side_3_object()(*this, p);
   }
 
-  bool has_on_negative_side(const Point_3 &p) const
+  Boolean has_on_negative_side(const Point_3 &p) const
   {
     return R().has_on_negative_side_3_object()(*this, p);
   }
 
 /*
-  bool         has_on(const Point_3 &p) const
+  Boolean has_on(const Point_3 &p) const
   {
     return oriented_side(p) == ON_ORIENTED_BOUNDARY;
   }
-  bool         has_on(const Line_3 &l) const
+  Boolean has_on(const Line_3 &l) const
   {
     return has_on(l.point())
        &&  has_on(l.point() + l.direction().to_vector());
   }
 */
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
   }
-
 };
 
 
diff --git a/Kernel_23/include/CGAL/Point_3.h b/Kernel_23/include/CGAL/Point_3.h
index 219aabe0292..da46f8f4480 100644
--- a/Kernel_23/include/CGAL/Point_3.h
+++ b/Kernel_23/include/CGAL/Point_3.h
@@ -203,19 +203,6 @@ public:
 
 };
 
-template <class R>
-inline
-bool
-operator==(const Origin& o, const Point_3<R>& p)
-{ return p == o; }
-
-template <class R>
-inline
-bool
-operator!=(const Origin& o, const Point_3<R>& p)
-{ return p != o; }
-
-
 template <class R >
 std::ostream&
 insert(std::ostream& os, const Point_3<R>& p,const Cartesian_tag&)
diff --git a/Kernel_23/include/CGAL/Ray_2.h b/Kernel_23/include/CGAL/Ray_2.h
index 626730bbc86..198a3f747c8 100644
--- a/Kernel_23/include/CGAL/Ray_2.h
+++ b/Kernel_23/include/CGAL/Ray_2.h
@@ -31,6 +31,7 @@ namespace CGAL {
 template <class R_>
 class Ray_2 : public R_::Kernel_base::Ray_2
 {
+  typedef typename R_::Boolean               Boolean;
   typedef typename R_::RT                    RT;
   typedef typename R_::FT                    FT;
   typedef typename R_::Point_2               Point_2;
@@ -117,17 +118,17 @@ public:
     return source();
   }
 
-  bool is_horizontal() const
+  Boolean is_horizontal() const
   {
     return R().equal_y_2_object()(source(), second_point());
   }
 
-  bool is_vertical() const
+  Boolean is_vertical() const
   {
     return R().equal_x_2_object()(source(), second_point());
   }
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_2_object()(*this);
   }
@@ -148,7 +149,7 @@ public:
     return construct_vector(source(), second_point());
   }
 
-  bool
+  Boolean
   has_on(const Point_2 &p) const
   {
     typename R::Construct_vector_2  construct_vector;
@@ -157,9 +158,7 @@ public:
            Direction_2(construct_vector( source(), p)) == direction() );
   }
 
-
-
-  bool
+  Boolean
   collinear_has_on(const Point_2 &p) const
   {
     return R().collinear_has_on_2_object()(*this, p);
@@ -177,18 +176,6 @@ public:
     return R().construct_line_2_object()(source(), second_point());
   }
 
-  bool
-  operator==(const Ray_2& r) const
-  {
-    return R().equal_2_object()(*this, r);
-  }
-
-  bool
-  operator!=(const Ray_2& r) const
-  {
-    return !(*this == r);
-  }
-
   Ray_2
   transform(const Aff_transformation_2 &t) const
   {
diff --git a/Kernel_23/include/CGAL/Ray_3.h b/Kernel_23/include/CGAL/Ray_3.h
index b415af7ad01..46e08490b1b 100644
--- a/Kernel_23/include/CGAL/Ray_3.h
+++ b/Kernel_23/include/CGAL/Ray_3.h
@@ -28,6 +28,7 @@ namespace CGAL {
 template <class R_>
 class Ray_3 : public R_::Kernel_base::Ray_3
 {
+  typedef typename R_::Boolean               Boolean;
   typedef typename R_::FT                    FT;
   typedef typename R_::Point_3               Point_3;
   typedef typename R_::Direction_3           Direction_3;
@@ -96,8 +97,8 @@ public:
   Line_3      supporting_line() const;
   Ray_3       opposite() const;
 
-  bool        is_degenerate() const;
-  bool        collinear_has_on(const Point_3 &p) const;
+  Boolean is_degenerate() const;
+  Boolean collinear_has_on(const Point_3 &p) const;
 */
 
   decltype(auto)
@@ -124,7 +125,7 @@ public:
     return source();
   }
 
-  bool has_on(const Point_3 &p) const
+  Boolean has_on(const Point_3 &p) const
   {
     return R().has_on_3_object()(*this, p);
   }
@@ -156,7 +157,7 @@ public:
     return R().construct_line_3_object()(source(), second_point());
   }
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
   }
diff --git a/Kernel_23/include/CGAL/Segment_2.h b/Kernel_23/include/CGAL/Segment_2.h
index d5d89246f3b..25cd78cd15a 100644
--- a/Kernel_23/include/CGAL/Segment_2.h
+++ b/Kernel_23/include/CGAL/Segment_2.h
@@ -30,6 +30,7 @@ namespace CGAL {
 template <class R_>
 class Segment_2 : public R_::Kernel_base::Segment_2
 {
+  typedef typename R_::Boolean                Boolean;
   typedef typename R_::RT                     RT;
   typedef typename R_::FT                     FT;
   typedef typename R_::Point_2                Point_2;
@@ -121,32 +122,19 @@ public:
   operator[](int i) const
   { return vertex(i); }
 
-  bool        is_horizontal() const;
-  bool        is_vertical() const;
-  bool        has_on(const Point_2 &p) const;
-  bool        collinear_has_on(const Point_2 &p) const;
+  Boolean is_horizontal() const;
+  Boolean is_vertical() const;
+  Boolean has_on(const Point_2 &p) const;
+  Boolean collinear_has_on(const Point_2 &p) const;
   FT          squared_length() const;
 
-  bool        is_degenerate() const;
+  Boolean is_degenerate() const;
 
   Bbox_2      bbox() const
   {
     return R().construct_bbox_2_object()(*this);
   }
 
-  bool
-  operator==(const Segment_2 &s) const
-  {
-    return R().equal_2_object()(*this, s);
-  }
-
-  bool
-  operator!=(const Segment_2 &s) const
-  {
-    return !(*this == s);
-  }
-
-
   Direction_2
   direction() const
   {
@@ -184,7 +172,7 @@ public:
 
 template < class R_ >
 CGAL_KERNEL_INLINE
-bool
+typename R_::Boolean
 Segment_2<R_>::is_horizontal() const
 {
   return R_().equal_y_2_object()(source(), target());
@@ -193,7 +181,7 @@ Segment_2<R_>::is_horizontal() const
 
 template < class R_ >
 CGAL_KERNEL_INLINE
-bool
+typename R_::Boolean
 Segment_2<R_>::is_vertical() const
 {
   return R_().equal_x_2_object()(source(), target());
@@ -202,7 +190,7 @@ Segment_2<R_>::is_vertical() const
 
 template < class R_ >
 CGAL_KERNEL_INLINE
-bool
+typename R_::Boolean
 Segment_2<R_>::
 has_on(const typename R_::Point_2 &p) const
 {
@@ -211,10 +199,9 @@ has_on(const typename R_::Point_2 &p) const
                                                target());
 }
 
-
 template < class R_ >
 inline
-bool
+typename R_::Boolean
 Segment_2<R_>::
 collinear_has_on(const typename R_::Point_2 &p) const
 {
@@ -222,7 +209,6 @@ collinear_has_on(const typename R_::Point_2 &p) const
                (*this, p);
 }
 
-
 template < class R_ >
 CGAL_KERNEL_INLINE
 typename Segment_2<R_>::FT
@@ -231,17 +217,14 @@ Segment_2<R_>::squared_length() const
  return R_().compute_squared_length_2_object()(*this);
 }
 
-
 template < class R_ >
 inline
-bool
+typename R_::Boolean
 Segment_2<R_>::is_degenerate() const
 {
   return R().is_degenerate_2_object()(*this);
 }
 
-
-
 template < class R >
 std::ostream &
 operator<<(std::ostream &os, const Segment_2<R> &s)
diff --git a/Kernel_23/include/CGAL/Segment_3.h b/Kernel_23/include/CGAL/Segment_3.h
index 61e02d657db..950577fe1c1 100644
--- a/Kernel_23/include/CGAL/Segment_3.h
+++ b/Kernel_23/include/CGAL/Segment_3.h
@@ -29,6 +29,7 @@ namespace CGAL {
 template <class R_>
 class Segment_3 : public R_::Kernel_base::Segment_3
 {
+  typedef typename R_::Boolean               Boolean;
   typedef typename R_::RT                    RT;
   typedef typename R_::FT                    FT;
   typedef typename R_::Point_3               Point_3;
@@ -134,7 +135,7 @@ public:
     return R().construct_vector_3_object()(*this);
   }
 
-  bool has_on(const Point_3 &p) const
+  Boolean has_on(const Point_3 &p) const
   {
     return R().has_on_3_object()(*this, p);
   }
@@ -149,7 +150,7 @@ public:
     return R().construct_direction_3_object()(*this);
   }
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
   }
diff --git a/Kernel_23/include/CGAL/Sphere_3.h b/Kernel_23/include/CGAL/Sphere_3.h
index b0a7c271e24..d8cc392d04e 100644
--- a/Kernel_23/include/CGAL/Sphere_3.h
+++ b/Kernel_23/include/CGAL/Sphere_3.h
@@ -96,7 +96,7 @@ public:
     return R().construct_center_3_object()(*this);
   }
 
-  FT
+  decltype(auto)
   squared_radius() const
   {
     return R().compute_squared_radius_3_object()(*this);
diff --git a/Kernel_23/include/CGAL/Tetrahedron_3.h b/Kernel_23/include/CGAL/Tetrahedron_3.h
index 549680d2554..3fc6539d316 100644
--- a/Kernel_23/include/CGAL/Tetrahedron_3.h
+++ b/Kernel_23/include/CGAL/Tetrahedron_3.h
@@ -29,7 +29,11 @@ namespace CGAL {
 template <class R_>
 class Tetrahedron_3 : public R_::Kernel_base::Tetrahedron_3
 {
-  typedef typename R_::Point_3             Point_3;
+  typedef typename R_::Boolean               Boolean;
+  typedef typename R_::Bounded_side          Bounded_side;
+  typedef typename R_::Orientation           Orientation;
+  typedef typename R_::Oriented_side         Oriented_side;
+  typedef typename R_::Point_3               Point_3;
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Tetrahedron_3                      Self;
@@ -86,8 +90,7 @@ public:
     return vertex(i);
   }
 
-  bool
-  is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
   }
@@ -107,27 +110,27 @@ public:
     return R().oriented_side_3_object()(*this, p);
   }
 
-  bool has_on_positive_side(const Point_3 &p) const
+  Boolean has_on_positive_side(const Point_3 &p) const
   {
     return R().has_on_positive_side_3_object()(*this, p);
   }
 
-  bool has_on_negative_side(const Point_3 &p) const
+  Boolean has_on_negative_side(const Point_3 &p) const
   {
     return R().has_on_negative_side_3_object()(*this, p);
   }
 
-  bool has_on_boundary(const Point_3 &p) const
+  Boolean has_on_boundary(const Point_3 &p) const
   {
     return R().has_on_boundary_3_object()(*this, p);
   }
 
-  bool has_on_bounded_side(const Point_3 &p) const
+  Boolean has_on_bounded_side(const Point_3 &p) const
   {
     return R().has_on_bounded_side_3_object()(*this, p);
   }
 
-  bool has_on_unbounded_side(const Point_3 &p) const
+  Boolean has_on_unbounded_side(const Point_3 &p) const
   {
     return R().has_on_unbounded_side_3_object()(*this, p);
   }
diff --git a/Kernel_23/include/CGAL/Triangle_2.h b/Kernel_23/include/CGAL/Triangle_2.h
index 8deabe91f6e..2b6f8346bc2 100644
--- a/Kernel_23/include/CGAL/Triangle_2.h
+++ b/Kernel_23/include/CGAL/Triangle_2.h
@@ -89,18 +89,6 @@ public:
     return R().oriented_side_2_object()(*this,p);
   }
 
-  typename R::Boolean
-  operator==(const Triangle_2 &t) const
-  {
-    return R().equal_2_object()(*this,t);
-  }
-
-  typename R::Boolean
-  operator!=(const Triangle_2 &t) const
-  {
-    return !(*this == t);
-  }
-
   decltype(auto)
   vertex(int i) const
   {
diff --git a/Kernel_23/include/CGAL/Triangle_3.h b/Kernel_23/include/CGAL/Triangle_3.h
index 19bbd8064ec..fcf40332e6e 100644
--- a/Kernel_23/include/CGAL/Triangle_3.h
+++ b/Kernel_23/include/CGAL/Triangle_3.h
@@ -29,6 +29,7 @@ namespace CGAL {
 template <class R_>
 class Triangle_3 : public R_::Kernel_base::Triangle_3
 {
+  typedef typename R_::Boolean               Boolean;
   typedef typename R_::RT                    RT;
   typedef typename R_::FT                    FT;
   typedef typename R_::Point_3               Point_3;
@@ -77,12 +78,11 @@ public:
     return R().construct_supporting_plane_3_object()(*this);
   }
 
-  bool has_on(const Point_3 &p) const
+  Boolean has_on(const Point_3 &p) const
   {
     return R().has_on_3_object()(*this, p);
   }
 
-
   decltype(auto)
   vertex(int i) const
   {
@@ -95,7 +95,7 @@ public:
     return vertex(i);
   }
 
-  bool is_degenerate() const
+  Boolean is_degenerate() const
   {
     return R().is_degenerate_3_object()(*this);
   }
diff --git a/Kernel_23/include/CGAL/Vector_2.h b/Kernel_23/include/CGAL/Vector_2.h
index c1bcfe45f31..41bfd5ef1dc 100644
--- a/Kernel_23/include/CGAL/Vector_2.h
+++ b/Kernel_23/include/CGAL/Vector_2.h
@@ -254,43 +254,8 @@ public:
   {
     return t.transform(*this);
   }
-
 };
 
-
-template < class R >
-inline
-bool
-operator==(const Vector_2<R> &v, const Null_vector &n)
-{
-  return R().equal_2_object()(v, n);
-}
-
-template < class R >
-inline
-bool
-operator==(const Null_vector &n, const Vector_2<R> &v)
-{
-  return v == n;
-}
-
-template < class R >
-inline
-bool
-operator!=(const Vector_2<R> &v, const Null_vector &n)
-{
-  return !(v == n);
-}
-
-template < class R >
-inline
-bool
-operator!=(const Null_vector &n, const Vector_2<R> &v)
-{
-  return !(v == n);
-}
-
-
 template <class R >
 std::ostream&
 insert(std::ostream& os, const Vector_2<R>& v, const Cartesian_tag&)
diff --git a/Kernel_23/include/CGAL/Weighted_point_2.h b/Kernel_23/include/CGAL/Weighted_point_2.h
index 32ca07df153..1adcc48e906 100644
--- a/Kernel_23/include/CGAL/Weighted_point_2.h
+++ b/Kernel_23/include/CGAL/Weighted_point_2.h
@@ -177,63 +177,6 @@ public:
 
 };
 
-template <class R>
-inline
-bool
-operator==(const Origin& o, const Weighted_point_2<R>& p)
-{ return p == o; }
-
-template <class R>
-inline
-bool
-operator!=(const Origin& o, const Weighted_point_2<R>& p)
-{ return p != o; }
-
-
-template <class R>
-inline
-bool
-operator==(const Point_2<R>& bp, const Weighted_point_2<R>& p)
-{ return bp == p.point(); }
-
-template <class R>
-inline
-bool
-operator!=(const Point_2<R>& bp, const Weighted_point_2<R>& p)
-{ return bp != p.point(); }
-
-template <class R>
-inline
-bool
-operator==(const Weighted_point_2<R>& p, const Point_2<R>& bp)
-{ return bp == p.point(); }
-
-template <class R>
-inline
-bool
-operator!=(const Weighted_point_2<R>& p, const Point_2<R>& bp)
-{ return bp != p.point(); }
-
-template <class R>
-inline
-bool
-operator==(const Weighted_point_2<R>& p, const Weighted_point_2<R>& p2)
-{ return p.point() == p2.point(); }
-
-template <class R>
-inline
-bool
-operator!=(const Weighted_point_2<R>& p, const Weighted_point_2<R>& p2)
-{ return p.point() != p2.point(); }
-
-
-template <class R>
-inline
-bool
-operator<(const Weighted_point_2<R>& p, const Weighted_point_2<R>& q)
-{ return p.point() < q.point(); }
-
-
 template <class R >
 std::ostream&
 insert(std::ostream& os, const Weighted_point_2<R>& p,const Cartesian_tag&)
diff --git a/Kernel_23/include/CGAL/Weighted_point_3.h b/Kernel_23/include/CGAL/Weighted_point_3.h
index 28e8f9489a5..cf978bdf49c 100644
--- a/Kernel_23/include/CGAL/Weighted_point_3.h
+++ b/Kernel_23/include/CGAL/Weighted_point_3.h
@@ -193,62 +193,6 @@ public:
 
 };
 
-template <class R>
-inline
-bool
-operator==(const Origin& o, const Weighted_point_3<R>& p)
-{ return p == o; }
-
-template <class R>
-inline
-bool
-operator!=(const Origin& o, const Weighted_point_3<R>& p)
-{ return p != o; }
-
-template <class R>
-inline
-bool
-operator==(const Point_3<R>& bp, const Weighted_point_3<R>& p)
-{ return bp == p.point(); }
-
-template <class R>
-inline
-bool
-operator!=(const Point_3<R>& bp, const Weighted_point_3<R>& p)
-{ return bp != p.point(); }
-
-template <class R>
-inline
-bool
-operator==(const Weighted_point_3<R>& p, const Point_3<R>& bp)
-{ return bp == p.point(); }
-
-template <class R>
-inline
-bool
-operator!=(const Weighted_point_3<R>& p, const Point_3<R>& bp)
-{ return bp != p.point(); }
-
-template <class R>
-inline
-bool
-operator==(const Weighted_point_3<R>& p, const Weighted_point_3<R>& p2)
-{ return p.point() == p2.point(); }
-
-template <class R>
-inline
-bool
-operator!=(const Weighted_point_3<R>& p, const Weighted_point_3<R>& p2)
-{ return p.point() != p2.point(); }
-
-
-template <class R>
-inline
-bool
-operator<(const Weighted_point_3<R>& p, const Weighted_point_3<R>& q)
-{ return p.point() < q.point(); }
-
-
 template <class R >
 std::ostream&
 insert(std::ostream& os, const Weighted_point_3<R>& p,const Cartesian_tag&)
diff --git a/Kernel_23/include/CGAL/enum.h b/Kernel_23/include/CGAL/enum.h
index a27ff99662d..679759041e1 100644
--- a/Kernel_23/include/CGAL/enum.h
+++ b/Kernel_23/include/CGAL/enum.h
@@ -21,8 +21,6 @@
 #include <CGAL/Kernel/Same_uncertainty.h>
 #include <CGAL/Origin.h>
 
-// If you add/change one type here, please update Is_a_predicate.h as well.
-
 namespace CGAL {
 
 enum  Sign
diff --git a/Kernel_23/include/CGAL/predicates/sign_of_determinant.h b/Kernel_23/include/CGAL/predicates/sign_of_determinant.h
index bdb7fd1425a..5543772cfb3 100644
--- a/Kernel_23/include/CGAL/predicates/sign_of_determinant.h
+++ b/Kernel_23/include/CGAL/predicates/sign_of_determinant.h
@@ -30,6 +30,7 @@ typename Sgn<RT>::result_type
 sign_of_determinant( const RT& a00,  const RT& a01,
                         const RT& a10,  const RT& a11)
 {
+  typedef typename Sgn<RT>::result_type Sign;
   return enum_cast<Sign>(CGAL_NTS compare( a00*a11, a10*a01));
 }
 
diff --git a/Kernel_23/test/Kernel_23/Exact_predicates_exact_constructions_kernel.cpp b/Kernel_23/test/Kernel_23/Exact_predicates_exact_constructions_kernel.cpp
index b3ed4921e7a..7f197eb54a2 100644
--- a/Kernel_23/test/Kernel_23/Exact_predicates_exact_constructions_kernel.cpp
+++ b/Kernel_23/test/Kernel_23/Exact_predicates_exact_constructions_kernel.cpp
@@ -7,18 +7,76 @@
 #endif
 #include <CGAL/use.h>
 
-int main(){
+#include "CGAL/_test_cls_kernel.h"
+#define TEST_FILENAME "Test-Cartesian-IO.out"
+#include "CGAL/_test_io.h"
+#include "CGAL/_test_2.h"
+#include "CGAL/_test_3.h"
 
-  typedef CGAL::Exact_predicates_exact_constructions_kernel               EPEK;
-  CGAL_USE_TYPE(EPEK);
+#include "CGAL/_test_new_2.h"
+#include "CGAL/_test_new_3.h"
+
+#include "CGAL/_test_fct_points_implicit_sphere.h"
+#include "CGAL/_test_orientation_and_bounded_side.h"
+#include "CGAL/_test_fct_constructions_2.h"
+#include "CGAL/_test_fct_constructions_3.h"
+#include "CGAL/_test_fct_point_3.h"
+#include "CGAL/_test_fct_coplanar_3.h"
+#include "CGAL/_test_cls_iso_cuboid_3.h"
+#include "CGAL/_test_angle.h"
+#include "CGAL/_test_cls_circle_3.h"
+
+#include "CGAL/_test_mf_plane_3_to_2d.h"
+
+template <typename K>
+void test()
+{
+  CGAL_USE_TYPE(K);
+
+  std::cout << "Testing nested types with:" << typeid(K).name() << std::endl;
+  _test_kernel( K() );
+
+  std::cout << "Testing IO with:" << typeid(K).name() << std::endl;
+  _test_io( K() );
+
+  std::cout << "Testing 2d with:" << typeid(K).name() << std::endl;
+  _test_2( K() );
+
+  std::cout << "Testing 3d with:" << typeid(K).name() << std::endl;
+  _test_3( K() );
+  _test_cls_circle_3( K() );
+
+  std::cout << "Testing new 2d with:" << typeid(K).name() << std::endl;
+  test_new_2( K() );
+  _test_cls_new_2( K() );
+
+  std::cout << "Testing new 3d with:" << typeid(K).name() << std::endl;
+  test_new_3( K() );
+
+  std::cout << "Testing new parts with:" << typeid(K).name() << std::endl;
+  _test_orientation_and_bounded_side( K() );
+  _test_fct_points_implicit_sphere( K() );
+  _test_fct_constructions_2( K() );
+  _test_fct_constructions_3( K() );
+  _test_fct_point_3( K() );
+  _test_fct_coplanar_3( K() );
+  _test_cls_iso_cuboid_3( K() );
+  _test_angle( K() );
+
+  std::cout << "Testing 3d-2d with:" << typeid(K).name() << std::endl;
+  _test_mf_plane_3_to_2d( K() );
+
+  std::cout << "All tests done" << std::endl;
+}
+
+int main()
+{
+  test<CGAL::Exact_predicates_exact_constructions_kernel>();
 
 #if defined(CGAL_USE_CORE) || defined(CGAL_USE_LEDA)
-  typedef CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt     EPEKS;
-  typedef CGAL::Exact_predicates_exact_constructions_kernel_with_kth_root EPEKK;
-  typedef CGAL::Exact_predicates_exact_constructions_kernel_with_root_of  EPEKR;
-  CGAL_USE_TYPE(EPEKS);
-  CGAL_USE_TYPE(EPEKK);
-  CGAL_USE_TYPE(EPEKR);
+  test<CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt>();
+  test<CGAL::Exact_predicates_exact_constructions_kernel_with_kth_root>();
+  test<CGAL::Exact_predicates_exact_constructions_kernel_with_root_of>();
 #endif
 
   return 0;
diff --git a/Kernel_23/test/Kernel_23/Filtered_cartesian.cpp b/Kernel_23/test/Kernel_23/Filtered_cartesian.cpp
index 4ba63964050..0315ea3ea2f 100644
--- a/Kernel_23/test/Kernel_23/Filtered_cartesian.cpp
+++ b/Kernel_23/test/Kernel_23/Filtered_cartesian.cpp
@@ -47,6 +47,7 @@
 #include "CGAL/_test_fct_coplanar_3.h"
 #include "CGAL/_test_cls_iso_cuboid_3.h"
 #include "CGAL/_test_angle.h"
+#include "CGAL/_test_cls_circle_3.h"
 
 #include "CGAL/_test_mf_plane_3_to_2d.h"
 
@@ -59,6 +60,9 @@ main()
   typedef CGAL::Cartesian<double>                               Clsdb;
   typedef CGAL::Filtered_kernel<Clsdb>                          Clsd;
 
+  std::cout << "Testing IO with F_k<Cartesian<double>>:" << std::endl;
+  _test_io( Clsd() );
+
   // typedef CGAL::Cartesian<CGAL::Quotient<Precise_integer> >     Clsb;
   // typedef CGAL::Cartesian<CGAL::Quotient<CGAL::MP_Float> >      Clsb;
   // typedef CGAL::Filtered_kernel<Clsb>                           Cls;
@@ -69,11 +73,11 @@ main()
    // "Testing with Filtered_kernel<Cartesian<Quotient<MP_Float>>>:"
    "Testing with Exact_predicates_exact_constructions_kernel:"
             << std::endl;
-  std::cout << "Testing IO with F_k<Cartesian<double>>:" << std::endl;
-  _test_io( Clsd() );
+
 
   std::cout << "Testing with Epeck:\n";
   test<Cls>();
+
   std::cout << "Testing with Double_precision_epick:\n";
   test<CGAL::Double_precision_epick>();
 
@@ -81,8 +85,10 @@ main()
 #    pragma warning(push)
 #    pragma warning(disable: 4244)
 #  endif
+
   std::cout << "Testing with Simple_precision_epick:\n";
   test<CGAL::Single_precision_epick>();
+
 #  if defined(BOOST_MSVC)
 #    pragma warning(pop)
 #  endif
@@ -92,6 +98,9 @@ main()
 
 template <typename Cls>
 void test() {
+  std::cout << "Testing IO :" << std::endl;
+  _test_io( Cls() );
+
   std::cout << "Testing 2d :";
   std::cout << std::endl;
   _test_2( Cls() );
@@ -99,14 +108,17 @@ void test() {
   std::cout << "Testing 3d :";
   std::cout << std::endl;
   _test_3( Cls() );
+  _test_cls_circle_3( Cls() );
 
   std::cout << "Testing new 2d :";
   std::cout << std::endl;
   test_new_2( Cls() );
+  _test_cls_new_2( Cls() );
 
   std::cout << "Testing new 3d :";
   std::cout << std::endl;
   test_new_3( Cls() );
+  _test_cls_circle_3( Cls() );
 
   std::cout << "Testing new parts :";
   std::cout << std::endl;
@@ -122,4 +134,6 @@ void test() {
   std::cout << "Testing 3d-2d :";
   std::cout << std::endl;
   _test_mf_plane_3_to_2d( Cls() );
+
+  std::cout << "Done Testing " << typeid(Cls).name() << std::endl;
 }
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_approx_equal.h b/Kernel_23/test/Kernel_23/include/CGAL/_approx_equal.h
index 3cae842a0cd..ee29e1fc07d 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_approx_equal.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_approx_equal.h
@@ -1,5 +1,6 @@
 #ifndef CGAL_TESTSUITE_APPROX_EQUAL_H
 #define CGAL_TESTSUITE_APPROX_EQUAL_H
+
 #include <boost/math/special_functions/next.hpp>
 
 namespace CGAL {
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_3.h
index 8ba7b49a981..449c5ed4f09 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_3.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_3.h
@@ -17,8 +17,11 @@
 #ifndef CGAL__TEST_CLS_CIRCLE_3_H
 #define CGAL__TEST_CLS_CIRCLE_3_H
 
+#include "_approx_equal.h"
+
 #include <CGAL/Bbox_2.h>
 #include <CGAL/Random.h>
+
 #include <cassert>
 
 // Some predicates and constructions tests related to the class Circle_3 are done here
@@ -33,9 +36,11 @@ void _test_bounding_box_construct(const K &k)
   typedef typename K::Plane_3                          Plane_3;
   typedef typename K::Sphere_3                         Sphere_3;
   typedef typename K::Circle_3                         Circle_3;
+  typedef typename K::Construct_bbox_3                 Construct_bbox_3;
   typedef typename K::Construct_circle_3               Construct_circle_3;
   typedef CGAL::Bbox_3                                 Bbox_3;
 
+  Construct_bbox_3 bbox = k.construct_bbox_3_object();
   Construct_circle_3 theConstruct_circle_3 = k.construct_circle_3_object();
 
   std::cout << "Testing the bbox of Circle_3..." << std::endl;
@@ -44,7 +49,7 @@ void _test_bounding_box_construct(const K &k)
   Circle_3 c;
 
   c = theConstruct_circle_3(Point_3(0,0,0), 1, Plane_3(1, 0, 0, 0));
-  b = c.bbox();
+  b = bbox(c);
   assert(b.xmin() <= 0.001);
   assert(b.xmax() >= -0.001);
   assert(b.ymin() <= -0.999);
@@ -53,7 +58,7 @@ void _test_bounding_box_construct(const K &k)
   assert(b.zmax() >= 0.999);
 
   c = theConstruct_circle_3(Sphere_3(Point_3(0,0,0), 1), Plane_3(1, 0, 0, -FT(1)/FT(2)));
-  b = c.bbox();
+  b = bbox(c);
   assert(b.xmin() <= 0.501);
   assert(b.xmax() >= 0.499);
   assert(b.ymin() <= (-std::sqrt(0.5)+0.001));
@@ -72,10 +77,14 @@ void _test_circle_construct(const K &k) {
   typedef typename K::Sphere_3                         Sphere_3;
   typedef typename K::Equal_3                          Equal_3;
   typedef typename K::Construct_circle_3               Construct_circle_3;
+  typedef typename K::Construct_center_3               Construct_center_3;
   typedef typename K::Compute_squared_distance_3       Compute_squared_distance_3;
 
+  const bool nonexact = std::is_floating_point<FT>::value;
+
   Equal_3 theEqual_3 = k.equal_3_object();
   Construct_circle_3 theConstruct_circle_3 = k.construct_circle_3_object();
+  Construct_center_3 center = k.construct_center_3_object();
   Compute_squared_distance_3 squared_distance = k.compute_squared_distance_3_object();
 
   CGAL::Random generatorOfgenerator;
@@ -117,48 +126,53 @@ void _test_circle_construct(const K &k) {
     const FT sqr = FT(r);
     const Point_3 p = Point_3(x,y,z);
     Circle_3 circle = theConstruct_circle_3(p,sqr,plane);
-
     assert(circle.supporting_plane().a() == a);
     assert(circle.supporting_plane().b() == b);
     assert(circle.supporting_plane().c() == c);
     assert(circle.supporting_plane().d() == d);
-    assert(circle.center().x() == x);
-    assert(circle.center().y() == y);
-    assert(circle.center().z() == z);
+    const Point_3 ctr = center(circle);
+    assert(ctr.x() == x);
+    assert(ctr.y() == y);
+    assert(ctr.z() == z);
     assert(circle.squared_radius() == sqr);
     Circle_3 circle2 = theConstruct_circle_3(p,sqr,plane2);
     Circle_3 circle3 = theConstruct_circle_3(p,sqr,Vector_3(a,b,c));
     assert(theEqual_3(circle,circle2));
-    assert(theEqual_3(circle,circle3));
 
-                Plane_3 pus(circle2);
-                Sphere_3 sus(circle3);
-                assert(pus == circle2.supporting_plane());
-                assert(sus == circle3.diametral_sphere());
+    if(CGAL::is_zero(a*x+b*y*c*z+d)) { // for EPICK
+      assert(theEqual_3(circle,circle3));
+    }
+
+    Plane_3 pus(circle2);
+    Sphere_3 sus(circle3);
+    assert(pus == circle2.supporting_plane());
+    assert(sus == circle3.diametral_sphere());
   }
 
   Point_3 p1, p2, p3;
   p1 = Point_3(1,0,0);
   p2 = Point_3(0,1,0);
-  p3 = Point_3(0,0,1);
-        Circle_3 c = theConstruct_circle_3(p1, p2, p3);
-        FT r1 = squared_distance(c.center(), p1);
-        FT r2 = squared_distance(c.center(), p2);
-        FT r3 = squared_distance(c.center(), p3);
-        assert(r1 == r2);
-        assert(r2 == r3);
-        assert(r3 == c.squared_radius());
+  p3 = Point_3(-1,0,0);
+  Circle_3 c = theConstruct_circle_3(p1, p2, p3);
+  FT r1 = squared_distance(center(c), p1);
+  FT r2 = squared_distance(center(c), p2);
+  FT r3 = squared_distance(center(c), p3);
+  assert(CGAL::testsuite::approx_equal<FT>(r1,r2));
+  assert(CGAL::testsuite::approx_equal<FT>(r2,r3));
+  assert(CGAL::testsuite::approx_equal<FT>(r3,c.squared_radius()));
 
-        p1 = Point_3(1.3,0.2,0.1);
-  p2 = Point_3(0.57,1.23,3.0);
-  p3 = Point_3(9,1.2,1.3);
-        c = theConstruct_circle_3(p1, p2, p3);
-        r1 = squared_distance(c.center(), p1);
-        r2 = squared_distance(c.center(), p2);
-        r3 = squared_distance(c.center(), p3);
-        assert(r1 == r2);
-        assert(r2 == r3);
-        assert(r3 == c.squared_radius());
+  if (!nonexact) {
+    p1 = Point_3(1.3,0.2,0.1);
+    p2 = Point_3(0.57,1.23,3.0);
+    p3 = Point_3(9,1.2,1.3);
+    c = theConstruct_circle_3(p1, p2, p3);
+    r1 = squared_distance(center(c), p1);
+    r2 = squared_distance(center(c), p2);
+    r3 = squared_distance(center(c), p3);
+    assert(CGAL::testsuite::approx_equal<FT>(r1,r2));
+    assert(CGAL::testsuite::approx_equal<FT>(r2,r3));
+    assert(CGAL::testsuite::approx_equal<FT>(r3,c.squared_radius()));
+  }
 
   // No need to test the constructors based on intersection
   // _test_intersect_construct will test it
@@ -176,6 +190,8 @@ void _test_construct_radical_plane(const K &k) {
   typedef typename K::Construct_sphere_3               Construct_sphere_3;
   typedef typename K::Construct_radical_plane_3        Construct_radical_plane_3;
 
+  const bool nonexact = std::is_floating_point<FT>::value;
+
   Intersect_3 theIntersect_3 = k.intersect_3_object();
   Construct_sphere_3 theConstruct_sphere_3 = k.construct_sphere_3_object();
   Construct_radical_plane_3 theConstruct_radical_plane_3 = k.construct_radical_plane_3_object();
@@ -212,13 +228,18 @@ void _test_construct_radical_plane(const K &k) {
           else if((d2 == (r+1)*(r+1)) || (d2 == (r-1)*(r-1))) {
             Point_3 interp;
             assert(assign(interp, intersection_1));
-            assert(theHas_on_3(p, interp));
+
+            if(!nonexact) {
+              assert(theHas_on_3(p, interp));
+            }
           }
           // 1 Intersection Circle
           else {
             Circle_3 circle1;
             assert(assign(circle1, intersection_1));
-            assert(theHas_on_3(p, circle1));
+            if(!nonexact) {
+              assert(theHas_on_3(p, circle1));
+            }
           }
         }
       }
@@ -369,7 +390,7 @@ void _test_bounded_side(const K &k) {
     }
   }
 
-  // we dont need to test bounded_side(Circle, Circular_arc_point) because
+  // we don't need to test bounded_side(Circle, Circular_arc_point) because
   // bounded_side(Circle, Circular_arc_point) = bounded_side(Sphere, Circular_arc_point) +
   //         has_on_3(supporting_plane, circular_arc_point) which has already been tested
   std::cout << "Testing bounded_side(Circle, Point)..." << std::endl;
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_new_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_new_2.h
index 1ffde6486f2..6e0ff29f648 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_new_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_circle_new_2.h
@@ -20,7 +20,7 @@
 
 template <class R>
 bool
-_test_cls_circle_new_2(const R& )
+_test_cls_circle_new_2(const R& r)
 {
  std::cout << "Testing class Circle_2";
 
@@ -33,9 +33,11 @@ _test_cls_circle_new_2(const R& )
  typedef typename  R::Circle_2 Circle_2;
  typedef typename  R::Aff_transformation_2 Aff_transformation_2;
 
- typename R::Construct_vector_2 construct_vector;
- typename R::Construct_point_2 construct_point;
- typename R::Construct_translated_point_2 construct_translated_point;
+ const bool nonexact = std::is_floating_point<FT>::value;
+
+ typename R::Construct_vector_2 construct_vector = r.construct_vector_2_object();
+ typename R::Construct_point_2 construct_point = r.construct_point_2_object();
+ typename R::Construct_translated_point_2 construct_translated_point = r.construct_translated_point_2_object();
 
  typename R::Circle_2  ic;
  Circle_2 c0; // af: CGAL::Circle_2<R> c0;
@@ -130,6 +132,11 @@ _test_cls_circle_new_2(const R& )
 
  std::cout << '.';
 
+ if(nonexact) {
+   std::cout << "done" << std::endl;
+   return true;
+ }
+
  Aff_transformation_2
           rotate1(CGAL::ROTATION,Direction_2(n11,n13),-n2,n12),
           rotate2(CGAL::ROTATION,Direction_2(-n8, n9),-n2,n12),
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
index 27141b2fb6d..f8f45974fb7 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
@@ -86,11 +86,8 @@ _test_cls_point_2(const R& )
 
  assert( p0 == CGAL::ORIGIN);
  assert( p1 != CGAL::ORIGIN );
- // Doesn't work; Point_2::operator== can't be used :(
-#ifdef ENHANCED
  assert( CGAL::ORIGIN == p0 );
  assert( CGAL::ORIGIN != p1 );
-#endif
 
  assert( p3.hx() == n1 );   // don't replace p3
  assert( p3.hy() == n2 );
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
index b2e003eedfe..355bb577342 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
@@ -86,11 +86,8 @@ _test_cls_point_3(const R& )
 
  assert( p0 == CGAL::ORIGIN);
  assert( p1 != CGAL::ORIGIN);
- // Doesn't work; Point_2::operator== can't be used :(
-#ifdef ENHANCED
  assert( CGAL::ORIGIN == p0 );
  assert( CGAL::ORIGIN != p1 );
-#endif // ENHANCED
 
  assert( p3.hx() == n1 );   // don't replace p3
  assert( p3.hy() == n2 );
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_weighted_point_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_weighted_point_2.h
index f43e41ce597..2b53241f0f8 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_weighted_point_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_weighted_point_2.h
@@ -152,8 +152,6 @@ _test_fct_weighted_point_2(const R& )
   assert( CGAL::squared_radius_smallest_orthogonal_circle(wp3, wp8) == RT(1) );
   assert( CGAL::squared_radius_smallest_orthogonal_circle(wp1_b, wp3_b) == RT(-3));
 
-  std::cout << CGAL::weighted_circumcenter(wp_00, wp_10, wp_01) << std::endl;
-
   using CGAL::testsuite::approx_equal;
   assert( approx_equal(CGAL::squared_radius_smallest_orthogonal_circle(wp1, wp3, wp5),
                        CGAL::squared_radius(p1, p3, p5)) );
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h b/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
index 9ae8ff346fd..69f98bcdcc4 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
@@ -70,7 +70,7 @@ Point_d(double x0, double x1, ...);
 template<typename ForwardIterator>
 Point_d(ForwardIterator first, ForwardIterator end);
 
-/*! returns the i'th coordinate of a point.
+/*! returns the i-th coordinate of a point.
     \pre `i` is non-negative and less than the dimension. */
 double operator[](int i)const;
 
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h b/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
index b5e67064e9b..b8ae4ea6acf 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
@@ -59,7 +59,7 @@ Point_d(double x0, double x1, ...);
 template<typename InputIterator>
 Point_d(InputIterator first, InputIterator end);
 
-/*! returns the i'th coordinate of a point.
+/*! returns the i-th coordinate of a point.
     \pre `i` is non-negative and less than the dimension. */
 double operator[](int i)const;
 
diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h
index b2585622b90..95997df7ae7 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h
@@ -16,7 +16,7 @@ public:
 /// @{
 
 /*!
-returns an iterator on the 0'th %Cartesian coordinate of `p`.
+returns an iterator on the zeroth %Cartesian coordinate of `p`.
 */
 Kernel_d::Cartesian_const_iterator_d operator()(const Kernel_d::Point_d
 &p);
diff --git a/Lab/demo/Lab/Plugins/IO/OM_io_plugin.cpp b/Lab/demo/Lab/Plugins/IO/OM_io_plugin.cpp
index ab81338bf06..c31787bd55b 100644
--- a/Lab/demo/Lab/Plugins/IO/OM_io_plugin.cpp
+++ b/Lab/demo/Lab/Plugins/IO/OM_io_plugin.cpp
@@ -124,6 +124,8 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene){
       res << item;
       if(!selection_item->isEmpty())
         res << selection_item;
+      else
+        delete selection_item;
       return res;
     }
   }
diff --git a/Lab/demo/Lab/Plugins/PMP/ACVD_remeshing_dialog.ui b/Lab/demo/Lab/Plugins/PMP/ACVD_remeshing_dialog.ui
new file mode 100644
index 00000000000..8c119c36ba6
--- /dev/null
+++ b/Lab/demo/Lab/Plugins/PMP/ACVD_remeshing_dialog.ui
@@ -0,0 +1,128 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<ui version="4.0">
+ <class>ACVDDialog</class>
+ <widget class="QDialog" name="ACVDDialog">
+  <property name="geometry">
+   <rect>
+    <x>0</x>
+    <y>0</y>
+    <width>400</width>
+    <height>241</height>
+   </rect>
+  </property>
+  <property name="windowTitle">
+   <string>ACVD Remeshing</string>
+  </property>
+  <layout class="QVBoxLayout" name="verticalLayout">
+   <item>
+    <widget class="QLabel" name="label_3">
+     <property name="text">
+      <string>Target number of Vertices (Clusters):</string>
+     </property>
+    </widget>
+   </item>
+   <item>
+    <widget class="DoubleEdit" name="nb_clusters_spin_box">
+     <property name="value" stdset="0">
+      <number>100</number>
+     </property>
+    </widget>
+   </item>
+   <item>
+    <widget class="QLabel" name="label_2">
+     <property name="text">
+      <string>Cluster Metric:</string>
+     </property>
+    </widget>
+   </item>
+   <item>
+    <widget class="QRadioButton" name="IsotropicClustering">
+     <property name="text">
+      <string>Isotropic Clustering</string>
+     </property>
+     <property name="checked">
+      <bool>true</bool>
+     </property>
+     <attribute name="buttonGroup">
+      <string notr="true">buttonGroup</string>
+     </attribute>
+    </widget>
+   </item>
+   <item>
+    <widget class="QRadioButton" name="QEMClustering">
+     <property name="text">
+      <string>QEM Clustering</string>
+     </property>
+     <attribute name="buttonGroup">
+      <string notr="true">buttonGroup</string>
+     </attribute>
+    </widget>
+   </item>
+   <item>
+    <widget class="QRadioButton" name="AnisotropicClustering">
+     <property name="text">
+      <string>Anisotropic Clustering</string>
+     </property>
+     <attribute name="buttonGroup">
+      <string notr="true">buttonGroup</string>
+     </attribute>
+    </widget>
+   </item>
+   <item>
+    <widget class="QDialogButtonBox" name="buttonBox">
+     <property name="orientation">
+      <enum>Qt::Horizontal</enum>
+     </property>
+     <property name="standardButtons">
+      <set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
+     </property>
+    </widget>
+   </item>
+  </layout>
+ </widget>
+ <customwidgets>
+  <customwidget>
+   <class>DoubleEdit</class>
+   <extends>QLineEdit</extends>
+   <header>CGAL_double_edit.h</header>
+  </customwidget>
+ </customwidgets>
+ <resources/>
+ <connections>
+  <connection>
+   <sender>buttonBox</sender>
+   <signal>accepted()</signal>
+   <receiver>ACVDDialog</receiver>
+   <slot>accept()</slot>
+   <hints>
+    <hint type="sourcelabel">
+     <x>248</x>
+     <y>254</y>
+    </hint>
+    <hint type="destinationlabel">
+     <x>157</x>
+     <y>274</y>
+    </hint>
+   </hints>
+  </connection>
+  <connection>
+   <sender>buttonBox</sender>
+   <signal>rejected()</signal>
+   <receiver>ACVDDialog</receiver>
+   <slot>reject()</slot>
+   <hints>
+    <hint type="sourcelabel">
+     <x>316</x>
+     <y>260</y>
+    </hint>
+    <hint type="destinationlabel">
+     <x>286</x>
+     <y>274</y>
+    </hint>
+   </hints>
+  </connection>
+ </connections>
+ <buttongroups>
+  <buttongroup name="buttonGroup"/>
+ </buttongroups>
+</ui>
diff --git a/Lab/demo/Lab/Plugins/PMP/ACVD_remeshing_plugin.cpp b/Lab/demo/Lab/Plugins/PMP/ACVD_remeshing_plugin.cpp
new file mode 100644
index 00000000000..719586c710f
--- /dev/null
+++ b/Lab/demo/Lab/Plugins/PMP/ACVD_remeshing_plugin.cpp
@@ -0,0 +1,124 @@
+#include <QtCore/qglobal.h>
+
+#include "Messages_interface.h"
+#include <CGAL/Three/CGAL_Lab_plugin_helper.h>
+#include <CGAL/Three/Three.h>
+#include "Scene_polyhedron_selection_item.h"
+#include "ui_ACVD_remeshing_dialog.h"
+
+#include "SMesh_type.h"
+typedef Scene_surface_mesh_item Scene_facegraph_item;
+
+#include <CGAL/iterator.h>
+#include <CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h>
+
+#include <QElapsedTimer>
+#include <QRadioButton>
+#include <QCheckBox>
+#include <QAction>
+#include <QMainWindow>
+#include <QApplication>
+#include <QDockWidget>
+#include <QEvent>
+#include <QKeyEvent>
+#include <QMouseEvent>
+#include <QFileDialog>
+
+#include <vector>
+#include <algorithm>
+#include <queue>
+
+typedef Scene_facegraph_item::Face_graph FaceGraph;
+
+using namespace CGAL::Three;
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+class CGAL_Lab_acvd_remeshing_plugin :
+  public QObject,
+  public CGAL_Lab_plugin_helper
+{
+  Q_OBJECT
+  Q_INTERFACES(CGAL::Three::CGAL_Lab_plugin_interface)
+  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0" FILE "acvd_remeshing_plugin.json")
+public:
+  bool applicable(QAction*) const {
+    return qobject_cast<Scene_facegraph_item*>(scene->item(scene->mainSelectionIndex()));
+  }
+  void print_message(QString message) { CGAL::Three::Three::information(message);}
+  QList<QAction*> actions() const { return QList<QAction*>() << actionACVD; }
+
+
+  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*) {
+    mw = mainWindow;
+    scene = scene_interface;
+    actionACVD = new QAction(tr(
+                                "ACVD Remeshing"
+                                ), mw);
+    //actionACVD->setProperty("subMenuName", "");
+    if (actionACVD)
+      connect(actionACVD, SIGNAL(triggered()), this, SLOT(acvd_action()));
+  }
+
+public Q_SLOTS:
+  void acvd_action() {
+
+    // Create dialog box
+    QDialog dialog(mw);
+    ui.setupUi(&dialog);
+
+    ui.nb_clusters_spin_box->setMinimum(10);
+    ui.nb_clusters_spin_box->setMaximum(1000000);
+    // get number of vertices of the mesh
+    Scene_facegraph_item* item = getSelectedItem<Scene_facegraph_item>();
+    if(!item) { return; }
+    // set default number of clusters to 5% of the number of vertices
+    ui.nb_clusters_spin_box->setValue((std::max)(item->face_graph()->number_of_faces() / 20, (unsigned int)10));
+
+    int i = dialog.exec();
+    if (i == QDialog::Rejected)
+    {
+      std::cout << "Remeshing aborted" << std::endl;
+      return;
+    }
+
+
+    Face_graph* graph = item->face_graph();
+    if(!graph) return;
+    QElapsedTimer time;
+    time.start();
+    CGAL::Three::Three::information("ACVD Remeshing...");
+
+
+    QApplication::setOverrideCursor(Qt::WaitCursor);
+    FaceGraph remeshed = *graph;
+
+    // TODO add post-processing
+
+    if (ui.IsotropicClustering->isChecked())
+      PMP::approximated_centroidal_Voronoi_diagram_remeshing(remeshed, ui.nb_clusters_spin_box->value());
+    else if (ui.QEMClustering->isChecked())
+      PMP::approximated_centroidal_Voronoi_diagram_remeshing(remeshed, ui.nb_clusters_spin_box->value(), CGAL::parameters::use_qem_based_energy(true));
+    else
+      PMP::approximated_centroidal_Voronoi_diagram_remeshing(remeshed, ui.nb_clusters_spin_box->value(), CGAL::parameters::gradation_factor(0.8));
+
+    // update the scene
+    CGAL::Three::Three::information(QString("ok (%1 ms)").arg(time.elapsed()));
+    QApplication::restoreOverrideCursor();
+    item->invalidateOpenGLBuffers();
+
+    // add the simplified mesh to the scene
+    Scene_facegraph_item* remeshed_item = new Scene_facegraph_item(remeshed);
+    remeshed_item->setName(QString(item->name() + "_simplified"));
+    scene->addItem(remeshed_item);
+    remeshed_item->invalidateOpenGLBuffers();
+    scene->itemChanged(remeshed_item);
+    item->setVisible(false);
+  }
+
+private:
+  QAction* actionACVD;
+  Ui::ACVDDialog ui;
+}; // end CGAL_Lab_acvd_remeshing_plugin
+
+
+#include "ACVD_remeshing_plugin.moc"
diff --git a/Lab/demo/Lab/Plugins/PMP/CMakeLists.txt b/Lab/demo/Lab/Plugins/PMP/CMakeLists.txt
index 806a7e7bf15..d953147df3d 100644
--- a/Lab/demo/Lab/Plugins/PMP/CMakeLists.txt
+++ b/Lab/demo/Lab/Plugins/PMP/CMakeLists.txt
@@ -29,6 +29,10 @@ target_link_libraries(extrude_plugin PRIVATE scene_surface_mesh_item
 
 if(TARGET CGAL::Eigen3_support)
   if("${Eigen3_VERSION}" VERSION_GREATER "3.1.90")
+    qt6_wrap_ui( acvd_remeshingUI_FILES ACVD_remeshing_dialog.ui)
+    cgal_lab_plugin(acvd_remeshing_plugin ACVD_remeshing_plugin ${acvd_remeshingUI_FILES} KEYWORDS PMP)
+    target_link_libraries(acvd_remeshing_plugin PUBLIC scene_surface_mesh_item scene_points_with_normal_item scene_polygon_soup_item CGAL::Eigen3_support)
+
     qt6_wrap_ui( hole_fillingUI_FILES Hole_filling_widget.ui)
     cgal_lab_plugin(hole_filling_plugin Hole_filling_plugin ${hole_fillingUI_FILES} KEYWORDS PMP)
     target_link_libraries(hole_filling_plugin PRIVATE scene_surface_mesh_item scene_polylines_item scene_selection_item CGAL::Eigen3_support)
diff --git a/Lab/demo/Lab/Plugins/PMP/Polyhedron_slicer_plugin.cpp b/Lab/demo/Lab/Plugins/PMP/Polyhedron_slicer_plugin.cpp
index 59033b835bf..ba4590807ef 100644
--- a/Lab/demo/Lab/Plugins/PMP/Polyhedron_slicer_plugin.cpp
+++ b/Lab/demo/Lab/Plugins/PMP/Polyhedron_slicer_plugin.cpp
@@ -187,7 +187,7 @@ bool CGAL_Lab_polyhedron_slicer_plugin::on_Update_plane_button_clicked() {
   { print_message("Error: center coordinates not convertible to double."); return false; }
 
   // set center
-  bool oldState = mf->blockSignals(true); // dont let it signal, it will invoke plane_manipulated_frame_modified otherwise
+  bool oldState = mf->blockSignals(true); // don't let it signal, it will invoke plane_manipulated_frame_modified otherwise
   mf->setPosition(center_x, center_y, center_z);
   mf->blockSignals(oldState);
 
@@ -206,7 +206,7 @@ bool CGAL_Lab_polyhedron_slicer_plugin::on_Update_plane_button_clicked() {
   CGAL::qglviewer::Quaternion orientation_from_bases;
   orientation_from_bases.setFromRotatedBasis(base_1, base_2, other);
 
-  oldState = mf->blockSignals(true); // dont let it signal, it will invoke plane_manipulated_frame_modified otherwise
+  oldState = mf->blockSignals(true); // don't let it signal, it will invoke plane_manipulated_frame_modified otherwise
   mf->setOrientation(orientation_from_bases);
   mf->blockSignals(oldState);
 
diff --git a/Lab/demo/Lab/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp b/Lab/demo/Lab/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
index 8ec139d0558..63f0e0ad034 100644
--- a/Lab/demo/Lab/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
+++ b/Lab/demo/Lab/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
@@ -37,14 +37,17 @@ public:
       messages = m;
       scene = scene_interface;
       QAction *actionLoop = new QAction("Loop", mw);
+      QAction *actionUpsample = new QAction("Upsample", mw);
       QAction *actionCatmullClark = new QAction("Catmull Clark", mw);
       QAction *actionSqrt3 = new QAction("Sqrt3", mw);
       QAction *actionDooSabin = new QAction("Doo Sabin", mw);
       actionLoop->setObjectName("actionLoop");
+      actionUpsample->setObjectName("actionUpsample");
       actionCatmullClark->setObjectName("actionCatmullClark");
       actionSqrt3->setObjectName("actionSqrt3");
       actionDooSabin->setObjectName("actionDooSabin");
       _actions << actionLoop
+               << actionUpsample
                << actionCatmullClark
                << actionSqrt3
                << actionDooSabin;
@@ -60,6 +63,7 @@ public:
 
 public Q_SLOTS:
   void on_actionLoop_triggered();
+  void on_actionUpsample_triggered();
   void on_actionCatmullClark_triggered();
   void on_actionSqrt3_triggered();
   void on_actionDooSabin_triggered();
@@ -69,6 +73,8 @@ private :
   template<class FaceGraphItem>
   void apply_loop(FaceGraphItem* item, int nb_steps);
   template<class FaceGraphItem>
+  void apply_upsample(FaceGraphItem* item, int nb_steps);
+  template<class FaceGraphItem>
   void apply_catmullclark(FaceGraphItem* item, int nb_steps);
   template<class FaceGraphItem>
   void apply_sqrt3(FaceGraphItem* item, int nb_steps);
@@ -92,6 +98,29 @@ void CGAL_Lab_subdivision_methods_plugin::apply_loop(FaceGraphItem* item, int nb
   scene->itemChanged(item);
 }
 
+template<class FaceGraphItem>
+void CGAL_Lab_subdivision_methods_plugin::apply_upsample(FaceGraphItem* item, int nb_steps)
+{
+  typename FaceGraphItem::Face_graph* graph = item->face_graph();
+  if(!graph) return;
+  QElapsedTimer time;
+  time.start();
+  CGAL::Three::Three::information("Upsample subdivision...");
+  QApplication::setOverrideCursor(Qt::WaitCursor);
+
+  if (is_triangle_mesh(*graph))
+    CGAL::Subdivision_method_3::Loop_subdivision(*graph, params::number_of_iterations(nb_steps)
+                                                                .do_not_modify_geometry(true));
+  else
+    CGAL::Subdivision_method_3::CatmullClark_subdivision(*graph, params::number_of_iterations(nb_steps)
+                                                                        .do_not_modify_geometry(true));
+
+  CGAL::Three::Three::information(QString("ok (%1 ms)").arg(time.elapsed()));
+  QApplication::restoreOverrideCursor();
+  item->invalidateOpenGLBuffers();
+  scene->itemChanged(item);
+}
+
 void CGAL_Lab_subdivision_methods_plugin::on_actionLoop_triggered()
 {
   CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
@@ -111,6 +140,25 @@ void CGAL_Lab_subdivision_methods_plugin::on_actionLoop_triggered()
   apply_loop(sm_item, nb_steps);
 }
 
+void CGAL_Lab_subdivision_methods_plugin::on_actionUpsample_triggered()
+{
+  CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
+  Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+  if(!sm_item)
+    return;
+
+  bool ok = true;
+  int nb_steps = QInputDialog::getInt(mw,
+                                      QString("Number of Iterations"),
+                                      QString("Choose number of iterations"),
+                                      1 /* value */, 1 /* min */, (std::numeric_limits<int>::max)() /* max */, 1 /*step*/,
+                                      &ok);
+  if(!ok)
+    return;
+
+  apply_upsample(sm_item, nb_steps);
+}
+
 template<class FaceGraphItem>
 void CGAL_Lab_subdivision_methods_plugin::apply_catmullclark(FaceGraphItem* item, int nb_steps)
 {
diff --git a/Lab/demo/Lab/Scene.cpp b/Lab/demo/Lab/Scene.cpp
index c48aa8b3c07..98c4d36e868 100644
--- a/Lab/demo/Lab/Scene.cpp
+++ b/Lab/demo/Lab/Scene.cpp
@@ -1164,7 +1164,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
     return true;
 }
 
-//todo : if a group is selected, don't treat it's children.
+//todo : if a group is selected, don't treat its children.
 bool Scene::sort_lists(QVector<QList<int> >&sorted_lists, bool up)
 {
   QVector<int> group_found;
diff --git a/Lab/demo/Lab/Scene_polyhedron_selection_item.cpp b/Lab/demo/Lab/Scene_polyhedron_selection_item.cpp
index a00454c375b..40f055a46fc 100644
--- a/Lab/demo/Lab/Scene_polyhedron_selection_item.cpp
+++ b/Lab/demo/Lab/Scene_polyhedron_selection_item.cpp
@@ -5,7 +5,6 @@
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Polygon_mesh_processing/repair.h>
 #include <CGAL/Polygon_mesh_processing/shape_predicates.h>
-#include <boost/graph/dijkstra_shortest_paths.hpp>
 #include <CGAL/boost/graph/helpers.h>
 #include <CGAL/property_map.h>
 #include <CGAL/Handle_hash_function.h>
@@ -31,6 +30,7 @@
 #include "triangulate_primitive.h"
 #include <CGAL/boost/graph/Face_filtered_graph.h>
 #include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/boost/graph/dijkstra_shortest_path.h>
 #include <CGAL/boost/graph/properties.h>
 
 using namespace CGAL::Three;
@@ -1503,103 +1503,31 @@ void Scene_polyhedron_selection_item::emitTempInstruct()
   Q_EMIT updateInstructions(QString("<font color='black'>%1</font>").arg(d->m_temp_instructs));
 }
 
-/// An exception used while catching a throw that stops Dijkstra's algorithm
-/// once the shortest path to a target has been found.
-class Dijkstra_end_exception : public std::exception
-{
-  const char* what() const throw ()
-  {
-    return "Dijkstra shortest path: reached the target vertex.";
-  }
-};
-
-/// Visitor to stop Dijkstra's algorithm once the given target turns 'BLACK',
-/// that is when the target has been examined through all its incident edges and
-/// the shortest path is thus known.
-class Stop_at_target_Dijkstra_visitor : boost::default_dijkstra_visitor
-{
-  fg_vertex_descriptor destination_vd;
-
-public:
-  Stop_at_target_Dijkstra_visitor(fg_vertex_descriptor destination_vd)
-    : destination_vd(destination_vd)
-  { }
-
-  void initialize_vertex(const fg_vertex_descriptor& /*s*/, const Face_graph& /*mesh*/) const { }
-  void examine_vertex(const fg_vertex_descriptor& /*s*/, const Face_graph& /*mesh*/) const { }
-  void examine_edge(const fg_edge_descriptor& /*e*/, const Face_graph& /*mesh*/) const { }
-  void edge_relaxed(const fg_edge_descriptor& /*e*/, const Face_graph& /*mesh*/) const { }
-  void discover_vertex(const fg_vertex_descriptor& /*s*/, const Face_graph& /*mesh*/) const { }
-  void edge_not_relaxed(const fg_edge_descriptor& /*e*/, const Face_graph& /*mesh*/) const { }
-  void finish_vertex(const fg_vertex_descriptor &vd, const Face_graph& /* mesh*/) const
-  {
-    if(vd == destination_vd)
-      throw Dijkstra_end_exception();
-  }
-};
 
 void Scene_polyhedron_selection_item_priv::computeAndDisplayPath()
 {
+  const auto& mesh = *item->polyhedron();
+  std::vector<fg_halfedge_descriptor> path_halfedges;
+  for(auto it = constrained_vertices.begin(); it!=constrained_vertices.end()-1; ++it)
+  {
+    fg_vertex_descriptor t(*it), s(*(it+1));
+
+    CGAL::dijkstra_shortest_path(s, t, mesh,
+      std::back_inserter(path_halfedges));
+  }
+
   item->temp_selected_edges.clear();
   path.clear();
 
-  typedef std::unordered_map<fg_vertex_descriptor, fg_vertex_descriptor>     Pred_umap;
-  typedef boost::associative_property_map<Pred_umap>                     Pred_pmap;
-
-  Pred_umap predecessor;
-  Pred_pmap pred_pmap(predecessor);
-
-  vertex_on_path vop;
-  QList<fg_vertex_descriptor>::iterator it;
-  for(it = constrained_vertices.begin(); it!=constrained_vertices.end()-1; ++it)
-  {
-    fg_vertex_descriptor t(*it), s(*(it+1));
-    Stop_at_target_Dijkstra_visitor vis(t);
-
-    try
-    {
-      boost::dijkstra_shortest_paths(*item->polyhedron(), s,
-                                     boost::predecessor_map(pred_pmap).visitor(vis));
-    }
-    catch (const std::exception& e)
-    {
-      std::cout << e.what() << std::endl;
-    }
-
-    // Walk back from target to source and collect vertices along the way
-    do
-    {
-      vop.vertex = t;
-      if(constrained_vertices.contains(t))
-      {
-        vop.is_constrained = true;
-      }
-      else
-        vop.is_constrained = false;
-      path.append(vop);
-      t = get(pred_pmap, t);
-    }
-    while(t != s);
-  }
-
-  // Add the last vertex
-  vop.vertex = constrained_vertices.last();
-  vop.is_constrained = true;
-  path.append(vop);
-
   // Display path
   double path_length = 0;
-  QList<vertex_on_path>::iterator path_it;
-  for(path_it = path.begin(); path_it!=path.end()-1; ++path_it)
+  VPmap vpm = get(CGAL::vertex_point, mesh);
+  for(auto h : path_halfedges)
   {
-    std::pair<fg_halfedge_descriptor, bool> h = halfedge((path_it+1)->vertex,path_it->vertex,*item->polyhedron());
-    if(h.second)
-    {
-      VPmap vpm = get(CGAL::vertex_point,*polyhedron());
-      Point p1(get(vpm, (path_it+1)->vertex)), p2(get(vpm, path_it->vertex));
-          path_length += CGAL::sqrt(Vector(p1,p2).squared_length());
-      item->temp_selected_edges.insert(edge(h.first, *item->polyhedron()));
-    }
+    const Point& p1 = get(vpm, target(h, mesh));
+    const Point& p2 = get(vpm, source(h, mesh));
+    path_length += CGAL::approximate_sqrt(CGAL::squared_distance(p1, p2));
+    item->temp_selected_edges.insert(edge(h, *item->polyhedron()));
   }
   item->printMessage(QString("New path length: %1").arg(path_length));
 }
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
index 295b1c8ba2b..6315897ba22 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
@@ -1031,14 +1031,14 @@ public: //---------------------------------------------- low-level connectivity
     }
 
 
-    /// returns the \c i'th halfedge of edge \c e. \c i has to be 0 or 1.
+    /// returns the \c i-th halfedge of edge \c e. \c i has to be 0 or 1.
     Halfedge halfedge(Edge e, unsigned int i) const
     {
         assert(i<=1);
         return Halfedge((e.idx() << 1) + i);
     }
 
-    /// returns the \c i'th vertex of edge \c e. \c i has to be 0 or 1.
+    /// returns the \c i-th vertex of edge \c e. \c i has to be 0 or 1.
     Vertex vertex(Edge e, unsigned int i) const
     {
         assert(i<=1);
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h
index 21aa768dbfb..0d20266d85b 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h
@@ -122,14 +122,14 @@ public:
         return data_;
     }
 
-    /// get i'th element read-write
+    /// get i-th element read-write
     Scalar& operator[](unsigned int i)
     {
         assert(i<N);
         return data_[i];
     }
 
-    /// get i'th element read-only
+    /// get i-th element read-only
     const Scalar operator[](unsigned int i) const
     {
         assert(i<N);
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/properties.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/properties.h
index f7a2a085149..3e0adeba63c 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/properties.h
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/properties.h
@@ -128,14 +128,14 @@ public:
         return &data_[0];
     }
 
-    /// Access the i'th element. No range check is performed!
+    /// Access the i-th element. No range check is performed!
     reference operator[](int _idx)
     {
         assert( size_t(_idx) < data_.size() );
         return data_[_idx];
     }
 
-    /// Const access to the i'th element. No range check is performed!
+    /// Const access to the i-th element. No range check is performed!
     const_reference operator[](int _idx) const
     {
         assert( size_t(_idx) < data_.size());
diff --git a/Mesh_2/doc/Mesh_2/Mesh_2.txt b/Mesh_2/doc/Mesh_2/Mesh_2.txt
index 7d31bb1fc85..ee95dd99fb5 100644
--- a/Mesh_2/doc/Mesh_2/Mesh_2.txt
+++ b/Mesh_2/doc/Mesh_2/Mesh_2.txt
@@ -262,8 +262,8 @@ of their Voronoi cells, and updating the Delaunay connectivity of the triangulat
 The center of mass is computed with respect to a sizing function that was designed to
 preserve the local density of points in the mesh generated by Delaunay refinement.
 
-See Figure \cgalFigureRef{Lloydfigure} for a mesh generated by `refine_Delaunay_mesh_2()` and optimized
-with `lloyd_optimize_mesh_2()`. Figure \cgalFigureRef{LloydHistogramfigure}
+See \cgalFigureRef{Lloydfigure} for a mesh generated by `refine_Delaunay_mesh_2()` and optimized
+with `lloyd_optimize_mesh_2()`. \cgalFigureRef{LloydHistogramfigure}
 shows the histogram of angles inside these meshes.
 
 \cgalFigureBegin{Lloydfigure,lloyd.png}
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h
index 7e2d912b890..90f6cd944a4 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h
@@ -250,7 +250,7 @@ unspecified_type no_features();
  * enables the meshing algorithm
  * to mesh the input surface only and not take the volume into account.
  *
- * When this option is enabled, the ouput mesh has no cells in the 3D complex,
+ * When this option is enabled, the output mesh has no cells in the 3D complex,
  * only facets, edges and vertices.
  * Full-3D optimization steps such as mesh perturbation and mesh exudation are automatically disabled.
  *
diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
index 9178befc0db..848d4608ebb 100644
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -1359,7 +1359,7 @@ We provide below speed-up charts generated using the parallel version of the mes
 The machine used is a PC running Windows 7 64-bits with two 6-core Intel Xeon CPU X5660 clocked at 2.80 GHz
 with 32GB of RAM. The program has been compiled with Microsoft Visual C++ 2012 in Release mode.
 
-Figure \cgalFigureRef{figure_refinement_speedup} shows mesh refinement speed-up, and figure \cgalFigureRef{figure_lloyd_speedup}
+\cgalFigureRef{figure_refinement_speedup} shows mesh refinement speed-up, and \cgalFigureRef{figure_lloyd_speedup}
 shows Lloyd optimization speed-up. ODT optimization exhibits similar speed-up.
 
 \cgalFigureBegin{figure_refinement_speedup,refinement_speedup.png}
diff --git a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
index b0de017c924..f920e3e9d4c 100644
--- a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
@@ -3756,7 +3756,7 @@ fill_modified_vertices(InputIterator cells_begin,
                        OutputIterator out) const
 {
   Vertex_set already_inserted_vertices;
-  // Dont insert vertex in out
+  // Don't insert vertex in out
   already_inserted_vertices.insert(vertex);
 
   for ( InputIterator it = cells_begin ; it != cells_end ; ++it )
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index 72bc54181d1..20dc7dab196 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -1697,7 +1697,7 @@ compute_facet_properties(const Facet& facet,
 #ifdef CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
       // In the following, std::get<2>(intersect) == 0 is a way to
       // test "intersect == Intersection()" (aka empty intersection), but
-      // the later does not work.
+      // the latter does not work.
       Surface_patch surface =
         (dimension(intersect) == 0) ? Surface_patch() :
         Surface_patch(
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt b/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
index e8007276ac5..58b446a31a8 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
@@ -235,7 +235,7 @@ The program below computes the Minkowski sum of two polygons that are
 read from an input file. In this case the sum may contain holes. The
 Minkowski sum, for example, of the polygons described in the default
 input file `room_star.dat` is not simple and contains four holes,
-as illustrated in Figure \cgalFigureRef{mink_figsum_holes}.
+as illustrated in \cgalFigureRef{mink_figsum_holes}.
 
 \cgalExample{Minkowski_sum_2/sum_with_holes.cpp}
 
@@ -503,7 +503,7 @@ template to compute Boolean set operations more efficiently, we apply a
 simple approximation scheme such that each irrational line segment is
 approximated by two rational segments.
 
-Consider the example depicted in Figure \cgalFigureRef{mink_figapprox_offset},
+Consider the example depicted in \cgalFigureRef{mink_figapprox_offset},
 where the exact offset edge \f$ o_1 o_2\f$ is obtained by shifting the
 polygon edge \f$ p_1 p_2\f$ by a vector of length \f$ r\f$ that forms an
 angle \f$ \phi\f$ with the \f$ x\f$-axis. We select two points
@@ -669,7 +669,7 @@ of the offset approximation for degenerate polygons such as line segments. This
 enhancement was developed by Efi Fogel, who also developed a new decomposition
 strategy, which can handle polygons with holes, essentially enabling the
 computation of Minkowski sum of two polygons with holes using the decomposition
-approach. The later was introduced with release 4.6. Ron Wein, Efi Fogel,
+approach. The latter was introduced with release 4.6. Ron Wein, Efi Fogel,
 Ophir Setter, Andreas Fabri, and Laurent Rineau helped maintaining the package
 applying bug fixes and other improvements. In particular, Andreas Fabri and
 Laurent Rineau helped tracing and solving several bugs in the approximated
diff --git a/Minkowski_sum_2/include/CGAL/Small_side_angle_bisector_decomposition_2.h b/Minkowski_sum_2/include/CGAL/Small_side_angle_bisector_decomposition_2.h
index 088de66e7c1..3de15958c19 100644
--- a/Minkowski_sum_2/include/CGAL/Small_side_angle_bisector_decomposition_2.h
+++ b/Minkowski_sum_2/include/CGAL/Small_side_angle_bisector_decomposition_2.h
@@ -443,7 +443,7 @@ private:
       vec[k].is_reflex = (f_orientation(*prev, *curr, *next) == RIGHT_TURN);
 
       // Set the number of reflex vertices from the beginning of the vector
-      // until the k'th (including itself).
+      // until the k-th (including itself).
       if (vec[k].is_reflex) ++reflex_count;
 
       vec[k].reflex_count = reflex_count;
diff --git a/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h b/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h
index 241cc65ae43..d131a15eba9 100644
--- a/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h
+++ b/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h
@@ -41,7 +41,9 @@ Sphere_segment_rep() :
 Sphere_segment_rep(const Point& p1, const Point& p2,
                    bool shorter_arc=true) :
   ps_(p1), pt_(p2),
-  c_(CGAL::ORIGIN,R_().construct_orthogonal_vector_3_object()(CGAL::ORIGIN,p1,p2))
+  c_(CGAL::ORIGIN, R_().construct_orthogonal_vector_3_object()(CGAL::ORIGIN,
+                                                               static_cast<const Point_3&>(p1),
+                                                               static_cast<const Point_3&>(p2)))
 { // warning stays as reminder that one gets an arbitrary plane equation
   // in this degenerate case
   CGAL_warning(p1 != p2.antipode());
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
index a89d2da9b1e..cd870c938e6 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
@@ -23,6 +23,8 @@ namespace CGAL {
 namespace SFA { // static filter adapter
 // Note that this would be quite a bit simpler without stateful kernels
 template <class Base_,class R_> struct Adapter_2 {
+        typedef typename Get_type<R_, Orientation_tag>::type Orientation;
+        typedef typename Get_type<R_, Oriented_side_tag>::type Oriented_side;
         typedef typename Get_type<R_, Point_tag>::type        Point;
         typedef typename Get_functor<R_, Compute_point_cartesian_coordinate_tag>::type CC;
         typedef typename Get_functor<Base_, Orientation_of_points_tag>::type Orientation_base;
@@ -84,6 +86,8 @@ template <class Base_,class R_> struct Side_of_oriented_sphere_2 : private Store
 };
 
 template <class Base_,class R_> struct Adapter_3 {
+        typedef typename Get_type<R_, Orientation_tag>::type Orientation;
+        typedef typename Get_type<R_, Oriented_side_tag>::type Oriented_side;
         typedef typename Get_type<R_, Point_tag>::type Point;
         typedef typename Get_functor<R_, Compute_point_cartesian_coordinate_tag>::type CC;
         typedef typename Get_functor<Base_, Orientation_of_points_tag>::type Orientation_base;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Types/Weighted_point.h b/NewKernel_d/include/CGAL/NewKernel_d/Types/Weighted_point.h
index 6e970a5f13a..9d051646871 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Types/Weighted_point.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Types/Weighted_point.h
@@ -272,7 +272,7 @@ template<class R_> struct Power_side_of_bounded_power_circumsphere : private Sto
           typename Get_functor<R_, Power_distance_tag>::type pd(this->kernel());
 
           // ON_UNBOUNDED_SIDE = -1
-          return enum_cast<Bounded_side>(-CGAL::sign(pd(pc(f, e), p0)));
+          return enum_cast<result_type>(-CGAL::sign(pd(pc(f, e), p0)));
         }
 };
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/function_objects_cartesian.h b/NewKernel_d/include/CGAL/NewKernel_d/function_objects_cartesian.h
index 1cfaaa4893b..2e627719060 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/function_objects_cartesian.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/function_objects_cartesian.h
@@ -787,7 +787,7 @@ template<class R_> struct Side_of_bounded_circumsphere : private Store_kernel<R_
           typename Get_functor<R_, Construct_circumcenter_tag>::type cc(this->kernel());
           typename Get_functor<R_, Compare_distance_tag>::type cd(this->kernel());
 
-          return enum_cast<Bounded_side>(cd(cc(f, e), *f, p0));
+          return enum_cast<result_type>(cd(cc(f, e), *f, p0));
         }
 };
 }
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/fitness_function.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/fitness_function.h
index 2eab0c64061..696ebf615a9 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/fitness_function.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/fitness_function.h
@@ -39,7 +39,7 @@ compute_fitness(const typename Traits::Matrix& R, // rotation matrix
   CGAL_assertion(points.size() >= 3);
 
   FT xmin, ymin, zmin, xmax, ymax, zmax;
-  //cast from double to float looses data, so cast with {} is not allowed
+  //cast from double to float loses data, so cast with {} is not allowed
   //cast from double to exact types also works
   xmin = ymin = zmin = FT((std::numeric_limits<double>::max)());
   xmax = ymax = zmax = FT(std::numeric_limits<double>::lowest());
@@ -83,7 +83,7 @@ compute_fitness_if_smaller(const typename Traits::Matrix& R, // rotation matrix
   CGAL_assertion(points.size() >= 3);
 
   FT xmin, ymin, zmin, xmax, ymax, zmax;
-  //cast from double to float looses data, so cast with {} is not allowed
+  //cast from double to float loses data, so cast with {} is not allowed
   //cast from double to exact types also works
   xmin = ymin = zmin = FT((std::numeric_limits<double>::max)());
   xmax = ymax = zmax = FT(std::numeric_limits<double>::lowest());
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
index ae450d781e8..cdcbe384173 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
@@ -104,7 +104,7 @@ compute_2D_deviation(const PointRange& points,
   if(theta > 0.25 * CGAL_PI) // @todo is there a point to this
     theta = 0.5 * CGAL_PI - theta;
 
-  //cast from double to float looses data, so cast with {} is not allowed
+  //cast from double to float loses data, so cast with {} is not allowed
   //cast from double to exact types also works
   return std::make_pair(pol.area(), FT(theta));
 }
@@ -125,7 +125,7 @@ void optimize_along_OBB_axes(typename Traits::Matrix& rot,
   rotated_points.reserve(points.size());
 
   FT xmin, ymin, zmin, xmax, ymax, zmax;
-  //cast from double to float looses data, so cast with {} is not allowed
+  //cast from double to float loses data, so cast with {} is not allowed
   //cast from double to exact types also works
   xmin = ymin = zmin = FT((std::numeric_limits<double>::max)());
   xmax = ymax = zmax = FT(std::numeric_limits<double>::lowest());
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/population.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/population.h
index 8223f7afed5..7ed14357ef2 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/population.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/population.h
@@ -121,7 +121,7 @@ public:
   Vertex& get_best_vertex()
   {
     std::size_t simplex_id = static_cast<std::size_t>(-1), vertex_id = static_cast<std::size_t>(-1);
-    //cast from double to float looses data, so cast with {} is not allowed
+    //cast from double to float loses data, so cast with {} is not allowed
     //cast from double to exact types also works
     FT best_fitness = FT((std::numeric_limits<double>::max)());
     for(std::size_t i=0, ps=m_simplices.size(); i<ps; ++i)
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
index c867c190814..b10853d5c8e 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
@@ -36,6 +36,7 @@
 #include <CGAL/Real_timer.h>
 #endif
 
+#include <boost/range/has_range_iterator.hpp>
 #include <boost/iterator/transform_iterator.hpp>
 #include <boost/range/value_type.hpp>
 
diff --git a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
index b8d09a2dbfd..910f799c365 100644
--- a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
+++ b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
@@ -234,7 +234,7 @@ public:
   /*!
           If `sample_size == 0`, the simplification is performed using an exhaustive priority queue.
           If `sample_size` is strictly positive the simplification is performed using a
-          multiple choice approach, ie, a best-choice selection in a random sample of
+          multiple choice approach, i.e., a best-choice selection in a random sample of
           edge collapse operators, of size `sample_size`. A typical value for the sample
           size is 15, but this value must be enlarged when targeting a very coarse simplification.
           \param sample_size If `sample_size != 0`, the size of the random sample replaces the priority queue.
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
index 64e84572cea..280f00c99a8 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
@@ -17,6 +17,11 @@ public:
 
   using Node_index = unspecified_type; ///< Index type of the orthtree to be traversed
 
+  /*!
+    \brief constructible from the orthtree it is meant to be used with.
+   */
+  OrthtreeTraversal(const Orthtree& o) const;
+
   /*!
     \brief returns the first node of the traversal.
    */
diff --git a/Orthtree/doc/Orthtree/Orthtree.txt b/Orthtree/doc/Orthtree/Orthtree.txt
index 38d979f1aed..4ec94d69583 100644
--- a/Orthtree/doc/Orthtree/Orthtree.txt
+++ b/Orthtree/doc/Orthtree/Orthtree.txt
@@ -193,7 +193,7 @@ The following example shows how to define a custom traversal that only traverses
 
 \subsection Section_Orthtree_Cmp_Trav Comparison of Traversals
 
-Figure \cgalFigureRef{Orthtree_traversal_fig} shows in which order
+\cgalFigureRef{Orthtree_traversal_fig} shows in which order
 nodes are visited depending on the traversal method used.
 
 \cgalFigureBegin{Orthtree_traversal_fig, quadtree_traversal.png}
diff --git a/Orthtree/include/CGAL/Orthtree.h b/Orthtree/include/CGAL/Orthtree.h
index 6850afbf472..fa58081f0c3 100644
--- a/Orthtree/include/CGAL/Orthtree.h
+++ b/Orthtree/include/CGAL/Orthtree.h
@@ -132,6 +132,7 @@ public:
 #endif
   static constexpr int dimension = Traits::dimension; ///< Dimension of the tree
   using Kernel = typename Traits::Kernel; ///< Kernel type.
+  using Geom_traits = Kernel;
   using FT = typename Traits::FT; ///< Number type.
   using Point = typename Traits::Point_d; ///< Point type.
   using Bbox = typename Traits::Bbox_d; ///< Bounding box type.
@@ -215,6 +216,7 @@ private: // data members :
   using Property_array = typename Properties::Experimental::Property_container<Node_index>::template Array<T>;
 
   Traits m_traits; /* the tree traits */
+  Kernel m_kernel;
 
   Node_property_container m_node_properties;
   Orthtree_impl::Node_data_wrapper<Traits, has_data> m_node_contents;
@@ -460,6 +462,11 @@ public:
    */
   const Traits& traits() const { return m_traits; }
 
+  const Kernel& geom_traits() const
+  {
+    return m_kernel;
+  }
+
   /*!
     \brief provides access to the root node, and by
     extension the rest of the tree.
@@ -516,11 +523,11 @@ public:
   compute_cartesian_coordinate(std::uint32_t gc, std::size_t depth, int ci) const
   {
     CGAL_assertion(depth <= m_side_per_depth.size());
-    // an odd coordinate will be first compute at the current depth,
+    // an odd coordinate will be first computed at the current depth,
     // while an even coordinate has already been computed at a previous depth.
     // So while the coordinate is even, we decrease the depth to end up of the first
     // non-even coordinate to compute it (with particular case for bbox limits).
-    // Note that is depth becomes too large, we might end up with incorrect coordinates
+    // Note that if the depth becomes too large, we might end up with incorrect coordinates
     // due to rounding errors.
     if (gc == (1u << depth)) return (m_bbox.max)()[ci]; // gc == 2^node_depth
     if (gc == 0) return (m_bbox.min)()[ci];
@@ -927,7 +934,7 @@ public:
     \return the index of the specified descendant node
    */
   template <typename... Indices>
-  Node_index descendant(Node_index node, Indices... indices) {
+  Node_index descendant(Node_index node, Indices... indices) const {
     return recursive_descendant(node, indices...);
   }
 
@@ -941,7 +948,7 @@ public:
     \return the index of the specified node
    */
   template <typename... Indices>
-  Node_index node(Indices... indices) {
+  Node_index node(Indices... indices) const {
     return descendant(root(), indices...);
   }
 
@@ -1262,10 +1269,10 @@ public:
 
 private: // functions :
 
-  Node_index recursive_descendant(Node_index node, std::size_t i) { return child(node, i); }
+  Node_index recursive_descendant(Node_index node, std::size_t i) const { return child(node, i); }
 
   template <typename... Indices>
-  Node_index recursive_descendant(Node_index node, std::size_t i, Indices... remaining_indices) {
+  Node_index recursive_descendant(Node_index node, std::size_t i, Indices... remaining_indices) const {
     return recursive_descendant(child(node, i), remaining_indices...);
   }
 
@@ -1402,15 +1409,8 @@ private: // functions :
 public:
 
   /// \cond SKIP_IN_MANUAL
-  void dump_to_polylines(std::ostream& os) const {
-    for (const auto n: traverse<Orthtrees::Preorder_traversal>())
-      if (is_leaf(n)) {
-        Bbox box = bbox(n);
-        dump_box_to_polylines(box, os);
-      }
-  }
-
-  void dump_box_to_polylines(const Bbox_2& box, std::ostream& os) const {
+  template <class K>
+  void dump_box_to_polylines(const Iso_rectangle_2<K>& box, std::ostream& os) const {
     // dump in 3D for visualization
     os << "5 "
        << box.xmin() << " " << box.ymin() << " 0 "
@@ -1420,7 +1420,8 @@ public:
        << box.xmin() << " " << box.ymin() << " 0" << std::endl;
   }
 
-  void dump_box_to_polylines(const Bbox_3& box, std::ostream& os) const {
+  template <class K>
+  void dump_box_to_polylines(const Iso_cuboid_3<K>& box, std::ostream& os) const {
     // Back face
     os << "5 "
        << box.xmin() << " " << box.ymin() << " " << box.zmin() << " "
@@ -1452,6 +1453,14 @@ public:
        << box.xmax() << " " << box.ymax() << " " << box.zmax() << std::endl;
   }
 
+  void dump_to_polylines(std::ostream& os) const {
+    for (Node_index n: traverse(Orthtrees::Preorder_traversal<Self>(*this)))
+      if (is_leaf(n)) {
+        Bbox box = bbox(n);
+        dump_box_to_polylines(box, os);
+      }
+  }
+
   std::string to_string(Node_index node) {
     std::stringstream stream;
     internal::print_orthtree_node(stream, node, *this);
diff --git a/Partition_2/include/CGAL/Partition_traits_2.h b/Partition_2/include/CGAL/Partition_traits_2.h
index 6baf74e8b4a..389e64bcf33 100644
--- a/Partition_2/include/CGAL/Partition_traits_2.h
+++ b/Partition_2/include/CGAL/Partition_traits_2.h
@@ -74,11 +74,11 @@ public:
 
     const PointPropertyMap& ppmap;
 
-    typename BaseFct::result_type operator()(const Arg_type& p, const Arg_type& q) const {
+    decltype(auto) operator()(const Arg_type& p, const Arg_type& q) const {
       return static_cast<const BaseFct*>(this)->operator()(get(ppmap,p),get(ppmap,q));
     }
 
-    typename BaseFct::result_type operator()(const Arg_type& p, const Arg_type& q, const Arg_type& r) const {
+    decltype(auto) operator()(const Arg_type& p, const Arg_type& q, const Arg_type& r) const {
       return static_cast<const BaseFct*>(this)->operator()(get(ppmap,p),get(ppmap,q),get(ppmap,r));
     }
   };
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Functor_with_offset_points_adaptor_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Functor_with_offset_points_adaptor_2.h
index 7cff0fd5f76..d14518d7da4 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Functor_with_offset_points_adaptor_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Functor_with_offset_points_adaptor_2.h
@@ -29,7 +29,6 @@ class Functor_with_offset_points_adaptor_2
   typedef typename Kernel::Construct_point_2    Construct_point_2;
 
 public:
-  typedef typename Functor::result_type         result_type;
 
   Functor_with_offset_points_adaptor_2(const Functor& functor,
                                        const Construct_point_2& cp)
@@ -39,24 +38,24 @@ public:
   // gives access to function calls without offset
   using Functor::operator();
 
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Offset& o0, const Offset& o1) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Offset& o0, const Offset& o1) const {
     return operator()(cp(p0,o0), cp(p1,o1));
   }
-  result_type operator()(const Point& p0, const Point& p1, const Point& p2,
-                         const Offset& o0, const Offset& o1, const Offset& o2) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1, const Point& p2,
+                            const Offset& o0, const Offset& o1, const Offset& o2) const {
     return operator()(cp(p0,o0), cp(p1,o1), cp(p2,o2));
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3,
-                         const Offset& o0, const Offset& o1,
-                         const Offset& o2, const Offset& o3) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2, const Offset& o3) const {
     return operator()(cp(p0,o0), cp(p1,o1), cp(p2,o2), cp(p3,o3));
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3, const Point& p4,
-                         const Offset& o0, const Offset& o1, const Offset& o2,
-                         const Offset& o3, const Offset& o4) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3, const Point& p4,
+                            const Offset& o0, const Offset& o1, const Offset& o2,
+                            const Offset& o3, const Offset& o4) const {
     return operator()(cp(p0,o0), cp(p1,o1), cp(p2,o2), cp(p3,o3), cp(p4,o4));
   }
 
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_orientation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_orientation_2.h
index 255f72b4e63..75fdaf59853 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_orientation_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_orientation_2.h
@@ -92,12 +92,12 @@ public:
   typedef typename Kernel::Iso_rectangle_2        Iso_rectangle_2;
   typedef typename Kernel::Periodic_2_offset_2    Offset_2;
 
+  typedef typename Kernel:: Orientation            Orientation;
+
 public:
   const Iso_rectangle_2 * const _dom;
 
 public:
-  typedef typename Base::result_type  result_type;
-
   Periodic_2_orientation_2(const Iso_rectangle_2 * const dom,
                            const Base& o2b)
     : Base(o2b), _dom(dom)
@@ -106,7 +106,7 @@ public:
   using Base::operator();
 
   /// Normal static orientation test, copied from Orientation_2
-  result_type operator()(const Point_2 &p, const Point_2 &q, const Point_2 &r) const
+  Orientation operator()(const Point_2 &p, const Point_2 &q, const Point_2 &r) const
   {
     CGAL_PROFILER("Periodic_2_orientation_2 calls");
 
@@ -161,7 +161,7 @@ public:
 
 
   /// Static orientation test with offsets
-  result_type operator()(const Point_2 &p, const Point_2 &q, const Point_2 &r,
+  Orientation operator()(const Point_2 &p, const Point_2 &q, const Point_2 &r,
                          const Offset_2 &o_p, const Offset_2 &o_q, const Offset_2 &o_r) const
   {
 
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_side_of_oriented_circle_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_side_of_oriented_circle_2.h
index 996db9f975a..8484871d9e3 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_side_of_oriented_circle_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2/internal/Static_filters/Periodic_2_side_of_oriented_circle_2.h
@@ -45,8 +45,6 @@ private:
   const Iso_rectangle_2 * _dom;
 
 public:
-  typedef typename Base::result_type  result_type;
-
   Periodic_2_side_of_oriented_circle_2(const Iso_rectangle_2 * dom,
                                        const Base& socb)
     : Base(socb), _dom(dom)
diff --git a/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp b/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp
index 2d86e6a59d0..8e72bc854a7 100644
--- a/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp
+++ b/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp
@@ -55,7 +55,7 @@ public:
 
   return_type operator()(const Point_3& p) const
   {
-    const Point_3 cp = P3T3::internal::robust_canonicalize_point(p, m_gt);
+    const Point_3 cp = P3T3::internal::construct_canonical_point(p, m_gt);
     CGAL::Bounded_side res = m_sotm(cp);
     return ((res == ON_BOUNDED_SIDE) ? 1 : 2); // set a region to '0' if it is not to be meshed
   }
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
index bfb4b4e8716..040bfd7fff9 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
@@ -41,7 +41,7 @@ public:
 
   /// Operator ()
   return_type operator()(const Point_3& p) const {
-    return f_(P3T3::internal::robust_canonicalize_point(p, gt_));
+    return f_(P3T3::internal::construct_canonical_point(p, gt_));
   }
 
 private:
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_triangulation_3.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_triangulation_3.h
index 6d8201c773d..387e4125566 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_triangulation_3.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_triangulation_3.h
@@ -193,14 +193,14 @@ public:
 
   Bare_point canonicalize_point(const Bare_point& p) const
   {
-    return P3T3::internal::robust_canonicalize_point(p, geom_traits());
+    return P3T3::internal::construct_canonical_point(p, geom_traits());
   }
 
   // @fixme it might be dangerous to call robust_canonicalize() without also changing
   // <p, offset> = construct_periodic_point(p) (lack of consistency in the result)
   Weighted_point canonicalize_point(const Weighted_point& p) const
   {
-    return P3T3::internal::robust_canonicalize_point(p, geom_traits());
+    return P3T3::internal::construct_canonical_point(p, geom_traits());
   }
 
   // 1-cover, so we can take a const&
@@ -430,9 +430,8 @@ public:
     typename Geom_traits::Compute_squared_distance_3 compute_sd =
       geom_traits().compute_squared_distance_3_object();
 
-    bool used_exact = false;
-    std::pair<Bare_point, Offset> pp_p = P3T3::internal::construct_periodic_point(p, used_exact, geom_traits());
-    std::pair<Bare_point, Offset> pp_q = P3T3::internal::construct_periodic_point(q, used_exact, geom_traits());
+    std::pair<Bare_point, Offset> pp_p = P3T3::internal::construct_periodic_point(p, geom_traits());
+    std::pair<Bare_point, Offset> pp_q = P3T3::internal::construct_periodic_point(q, geom_traits());
 
     Offset min_off;
 
@@ -474,8 +473,7 @@ public:
     typename Geom_traits::Construct_point_3 cp =
       geom_traits().construct_point_3_object();
 
-    bool used_exact = false;
-    std::pair<Bare_point, Offset> pp_q = P3T3::internal::construct_periodic_point(q, used_exact, geom_traits());
+    std::pair<Bare_point, Offset> pp_q = P3T3::internal::construct_periodic_point(q, geom_traits());
 
     Offset min_off;
     Offset null_offset(0,0,0);
@@ -550,10 +548,9 @@ public:
       geom_traits().compare_power_distance_3_object();
 
     // Compute the offsets that would bring p, q, and r into the canonical domain
-    bool used_exact = false;
-    std::pair<Bare_point, Offset> pp_p = P3T3::internal::construct_periodic_point(p, used_exact, geom_traits());
-    std::pair<Bare_point, Offset> pp_q = P3T3::internal::construct_periodic_point(cp(q), used_exact, geom_traits());
-    std::pair<Bare_point, Offset> pp_r = P3T3::internal::construct_periodic_point(cp(r), used_exact, geom_traits());
+    std::pair<Bare_point, Offset> pp_p = P3T3::internal::construct_periodic_point(p, geom_traits());
+    std::pair<Bare_point, Offset> pp_q = P3T3::internal::construct_periodic_point(cp(q), geom_traits());
+    std::pair<Bare_point, Offset> pp_r = P3T3::internal::construct_periodic_point(cp(r), geom_traits());
 
     // To compare pp(p, q) to pp(p, r), we first need to know the best offsets that minimize these distances
     auto get_offset_minimizing_power_product = [&](const Weighted_point& wp,
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
index e950cd7e4cf..957b73bec46 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
@@ -765,22 +765,15 @@ public:
   }
 
   // same as the base construct_periodic_point(), but for weighted points
-  Periodic_weighted_point construct_periodic_weighted_point(const Weighted_point& p,
-                                                            bool& had_to_use_exact) const
+  Periodic_weighted_point construct_periodic_weighted_point(const Weighted_point& p) const
   {
     const Bare_point& bp = geom_traits().construct_point_3_object()(p);
-    const Periodic_bare_point pbp = Tr_Base::construct_periodic_point(bp, had_to_use_exact);
+    const Periodic_bare_point pbp = Tr_Base::construct_periodic_point(bp);
     return std::make_pair(geom_traits().construct_weighted_point_3_object()(
                             pbp.first, p.weight()),
                           pbp.second);
   }
 
-  Periodic_weighted_point construct_periodic_weighted_point(const Weighted_point& p) const
-  {
-    bool useless = false;
-    return construct_periodic_weighted_point(p, useless);
-  }
-
 public:
   /** @name Geometric access functions */
   // The following functions change the position of a vertex.
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
index 516c3e7434d..6c9c319c71e 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
@@ -870,18 +870,11 @@ public:
     return construct_point(pp.first, pp.second);
   }
 
-  Periodic_point_3 construct_periodic_point(const Point_3& p,
-                                            bool& had_to_use_exact) const
+  Periodic_point_3 construct_periodic_point(const Point_3& p) const
   {
     // The function is a different file to be able to be used where there is
     // no triangulation (namely, the domains of Periodic_3_mesh_3).
-    return ::CGAL::P3T3::internal::construct_periodic_point(p, had_to_use_exact, geom_traits());
-  }
-
-  Periodic_point_3 construct_periodic_point(const Point_3& p) const
-  {
-    bool useless = false;
-    return construct_periodic_point(p, useless);
+    return ::CGAL::P3T3::internal::construct_periodic_point(p, geom_traits());
   }
 
   // ---------------------------------------------------------------------------
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_points_adaptor_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_points_adaptor_3.h
index 0edd5d23426..f813e6e7345 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_points_adaptor_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_points_adaptor_3.h
@@ -34,8 +34,6 @@ class Functor_with_offset_points_adaptor_3
   typedef typename Kernel::Construct_point_3    Construct_point_3;
 
 public:
-  typedef typename Functor::result_type         result_type;
-
   Functor_with_offset_points_adaptor_3(const Functor& functor,
                                        const Construct_point_3& cp)
     : Functor_(functor), cp(cp)
@@ -44,24 +42,24 @@ public:
   // gives access to function calls without offset
   using Functor::operator();
 
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Offset& o0, const Offset& o1) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Offset& o0, const Offset& o1) const {
     return operator()(cp(p0,o0), cp(p1,o1));
   }
-  result_type operator()(const Point& p0, const Point& p1, const Point& p2,
-                         const Offset& o0, const Offset& o1, const Offset& o2) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1, const Point& p2,
+                            const Offset& o0, const Offset& o1, const Offset& o2) const {
     return operator()(cp(p0,o0), cp(p1,o1), cp(p2,o2));
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3,
-                         const Offset& o0, const Offset& o1,
-                         const Offset& o2, const Offset& o3) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2, const Offset& o3) const {
     return operator()(cp(p0,o0), cp(p1,o1), cp(p2,o2), cp(p3,o3));
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3, const Point& p4,
-                         const Offset& o0, const Offset& o1, const Offset& o2,
-                         const Offset& o3, const Offset& o4) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3, const Point& p4,
+                            const Offset& o0, const Offset& o1, const Offset& o2,
+                            const Offset& o3, const Offset& o4) const {
     return operator()(cp(p0,o0), cp(p1,o1), cp(p2,o2), cp(p3,o3), cp(p4,o4));
   }
 
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_weighted_points_adaptor_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_weighted_points_adaptor_3.h
index 19b9e657f48..91838f0f4b6 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_weighted_points_adaptor_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Functor_with_offset_weighted_points_adaptor_3.h
@@ -42,8 +42,6 @@ class Functor_with_offset_weighted_points_adaptor_3
   typedef typename Kernel::Construct_weighted_point_3       Construct_weighted_point_3;
 
 public:
-  typedef typename Functor::result_type                     result_type;
-
   Functor_with_offset_weighted_points_adaptor_3(const Functor_& functor,
                                                 const Construct_point_3& cp,
                                                 const Construct_weighted_point_3& wp)
@@ -53,76 +51,76 @@ public:
   // gives access to calls with Point_3 arguments and without offset
   using Base::operator();
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Offset& o0, const Offset& o1) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Offset& o0, const Offset& o1) const {
     return operator()(wp(p0, o0), wp(p1, o1));
   }
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2,
-                          const Offset& o0, const Offset& o1,
-                          const Offset& o2) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2) const {
     return operator()(wp(p0, o0), wp(p1, o1), wp(p2, o2));
   }
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2, const Weighted_point_3& p3,
-                          const Offset& o0, const Offset& o1,
-                          const Offset& o2, const Offset& o3) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2, const Weighted_point_3& p3,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2, const Offset& o3) const {
     return operator()(wp(p0, o0), wp(p1, o1), wp(p2, o2), wp(p3, o3));
   }
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2, const Weighted_point_3& p3,
-                          const Weighted_point_3& p4,
-                          const Offset& o0, const Offset& o1,
-                          const Offset& o2, const Offset& o3,
-                          const Offset& o4) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2, const Weighted_point_3& p3,
+                            const Weighted_point_3& p4,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2, const Offset& o3,
+                            const Offset& o4) const {
     return operator()(wp(p0, o0), wp(p1, o1), wp(p2, o2), wp(p3, o3), wp(p4, o4));
   }
 
   // for `Compare_power_distance_3`
-  result_type operator() (const Point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2,
-                          const Offset& o0, const Offset& o1,
-                          const Offset& o2) const {
+  decltype(auto) operator()(const Point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2) const {
     return operator()(this->cp(p0, o0), wp(p1, o1), wp(p2, o2));
   }
 
   // for `Compare_weighted_squared_radius_3`
-  result_type operator() (const Weighted_point_3& p0, const Offset& o0,
-                          const FT w) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Offset& o0,
+                            const FT w) const {
     return operator()(wp(p0, o0), w);
   }
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Offset& o0, const Offset& o1,
-                          const FT w) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Offset& o0, const Offset& o1,
+                            const FT w) const {
     return operator()(wp(p0, o0), wp(p1, o1), w);
   }
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2,
-                          const Offset& o0, const Offset& o1,
-                          const Offset& o2,
-                          const FT w) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2,
+                            const FT w) const {
     return operator()(wp(p0, o0), wp(p1, o1), wp(p2, o2), w);
   }
 
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2, const Weighted_point_3& p3,
-                          const Offset& o0, const Offset& o1,
-                          const Offset& o2, const Offset& o3,
-                          const FT w) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2, const Weighted_point_3& p3,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2, const Offset& o3,
+                            const FT w) const {
     return operator()(wp(p0, o0), wp(p1, o1), wp(p2, o2), wp(p3, o3), w);
   }
 
   // for robust circumcenter_3
-  result_type operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
-                         const Weighted_point_3& p2, const Weighted_point_3& p3,
-                         const Offset& o0, const Offset& o1,
-                         const Offset& o2, const Offset& o3,
-                         bool b) const {
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2, const Weighted_point_3& p3,
+                            const Offset& o0, const Offset& o1,
+                            const Offset& o2, const Offset& o3,
+                            bool b) const {
     return operator()(wp(p0, o0), wp(p1, o1), wp(p2, o2), wp(p3, o3), b);
   }
 
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_Delaunay_triangulation_remove_traits_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_Delaunay_triangulation_remove_traits_3.h
index 128cb4038d0..667ae76bc43 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_Delaunay_triangulation_remove_traits_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_Delaunay_triangulation_remove_traits_3.h
@@ -39,14 +39,6 @@ public:
 
   using Base::operator();
 
-  template<typename F>
-  struct result : Base::template result<F> {};
-
-  template<typename F>
-  struct result<F(Point_3)> {
-    typedef const Point_3& type;
-  };
-
   const Point_3& operator()(const Point_3& p) const { return p; }
 };
 
@@ -61,29 +53,27 @@ class Functor_with_point_offset_pair_adaptor
   typedef typename Traits::Point_3       Point;
 
 public:
-  typedef typename Functor::result_type result_type;
-
   Functor_with_point_offset_pair_adaptor(const Functor & functor) : Functor_(functor) { }
 
 public:
   using Functor::operator();
 
-  result_type operator()(const Point& p0, const Point& p1) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1) const {
     return operator()(p0.first, p1.first,
                       p0.second, p1.second);
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2) const {
     return operator()(p0.first, p1.first, p2.first,
                       p0.second, p1.second, p2.second);
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3) const {
     return operator()(p0.first, p1.first, p2.first, p3.first,
                       p0.second, p1.second, p2.second, p3.second);
   }
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3, const Point& p4) const {
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3, const Point& p4) const {
     return operator()(p0.first, p1.first, p2.first, p3.first, p4.first,
                       p0.second, p1.second, p2.second, p3.second, p4.second);
   }
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_filtered_traits_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_filtered_traits_3.h
index ff8038bdab9..0d4a3b6768f 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_filtered_traits_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_filtered_traits_3.h
@@ -105,6 +105,18 @@ public:
             Offset_converter_3<C2E>,
             Offset_converter_3<C2F> >  Compare_weighted_squared_radius_3;
 
+  typedef Filtered_predicate<
+            typename Exact_traits::Compare_squared_distance_3,
+            typename Filtering_traits::Compare_squared_distance_3,
+            Offset_converter_3<C2E>,
+            Offset_converter_3<C2F> >  Compare_squared_distance_3;
+
+  typedef Filtered_predicate<
+            typename Exact_traits::Power_side_of_bounded_power_sphere_3,
+            typename Filtering_traits::Power_side_of_bounded_power_sphere_3,
+            Offset_converter_3<C2E>,
+            Offset_converter_3<C2F> >  Power_side_of_bounded_power_sphere_3;
+
   Coplanar_orientation_3 coplanar_orientation_3_object() const
   {
     typename Exact_traits::Coplanar_orientation_3 pe = regular_traits_e.coplanar_orientation_3_object();
@@ -137,6 +149,22 @@ public:
     return Compare_weighted_squared_radius_3(pe, pf);
   }
 
+  Compare_squared_distance_3 compare_squared_distance_3_object() const
+  {
+    typename Exact_traits::Compare_squared_distance_3 pe = regular_traits_e.compare_squared_distance_3_object();
+    typename Filtering_traits::Compare_squared_distance_3 pf = regular_traits_f.compare_squared_distance_3_object();
+
+    return Compare_squared_distance_3(pe, pf);
+  }
+
+  Power_side_of_bounded_power_sphere_3 power_side_of_bounded_power_sphere_3_object() const
+  {
+    typename Exact_traits::Power_side_of_bounded_power_sphere_3 pe = regular_traits_e.power_side_of_bounded_power_sphere_3_object();
+    typename Filtering_traits::Power_side_of_bounded_power_sphere_3 pf = regular_traits_f.power_side_of_bounded_power_sphere_3_object();
+
+    return Power_side_of_bounded_power_sphere_3(pe, pf);
+  }
+
 protected:
   Exact_traits regular_traits_e;
   Filtering_traits regular_traits_f;
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_remove_traits_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_remove_traits_3.h
index 41fdaa532c0..daaf6425672 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_remove_traits_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_remove_traits_3.h
@@ -49,14 +49,6 @@ public:
 
   using Base::operator(); // for K::Weighted_point_3 to Point_3
 
-  template<typename F>
-  struct result : Base::template result<F> {};
-
-  template<typename F>
-  struct result<F(Weighted_point_3)> {
-    typedef Point_3 type;
-  };
-
   Point_3 operator()(const Weighted_point_3& wp) const {
     return std::make_pair(operator()(wp.first), wp.second /* offset */);
   }
@@ -75,8 +67,6 @@ class Functor_with_weighted_point_offset_pair_adaptor
   typedef typename Traits::Weighted_point_3       Weighted_point_3;
 
 public:
-  typedef typename Functor::result_type result_type;
-
   Functor_with_weighted_point_offset_pair_adaptor (const Functor & functor)
     : Functor_(functor)
   { }
@@ -84,54 +74,54 @@ public:
 public:
   using Functor::operator();
 
-  result_type operator() (const Point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2) const
+  decltype(auto) operator()(const Point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2) const
   {
     return operator()(p0.first, p1.first, p2.first,
                       p0.second, p1.second, p2.second);
   }
 
   // bare points
-  result_type operator()(const Point_3& p0, const Point_3& p1) const {
+  decltype(auto) operator()(const Point_3& p0, const Point_3& p1) const {
     return operator()(p0.first, p1.first,
                       p0.second, p1.second);
   }
-  result_type operator()(const Point_3& p0, const Point_3& p1,
-                         const Point_3& p2) const {
+  decltype(auto) operator()(const Point_3& p0, const Point_3& p1,
+                            const Point_3& p2) const {
     return operator()(p0.first, p1.first, p2.first,
                       p0.second, p1.second, p2.second);
   }
-  result_type operator()(const Point_3& p0, const Point_3& p1,
-                         const Point_3& p2, const Point_3& p3) const {
+  decltype(auto) operator()(const Point_3& p0, const Point_3& p1,
+                            const Point_3& p2, const Point_3& p3) const {
     return operator()(p0.first, p1.first, p2.first, p3.first,
                       p0.second, p1.second, p2.second, p3.second);
   }
-  result_type operator()(const Point_3& p0, const Point_3& p1,
-                         const Point_3& p2, const Point_3& p3, const Point_3& p4) const {
+  decltype(auto) operator()(const Point_3& p0, const Point_3& p1,
+                            const Point_3& p2, const Point_3& p3, const Point_3& p4) const {
     return operator()(p0.first, p1.first, p2.first, p3.first, p4.first,
                       p0.second, p1.second, p2.second, p3.second, p4.second);
   }
 
   // weighted points
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1) const
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1) const
   {
     return operator()(p0.first, p1.first, p0.second, p1.second);
   }
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2) const
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2) const
   {
     return operator()(p0.first, p1.first, p2.first,
                       p0.second, p1.second, p2.second);
   }
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2, const Weighted_point_3& p3) const
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2, const Weighted_point_3& p3) const
   {
     return operator()(p0.first, p1.first, p2.first, p3.first,
                       p0.second, p1.second, p2.second, p3.second);
   }
-  result_type operator() (const Weighted_point_3& p0, const Weighted_point_3& p1,
-                          const Weighted_point_3& p2, const Weighted_point_3& p3,
-                          const Weighted_point_3& p4) const
+  decltype(auto) operator()(const Weighted_point_3& p0, const Weighted_point_3& p1,
+                            const Weighted_point_3& p2, const Weighted_point_3& p3,
+                            const Weighted_point_3& p4) const
   {
     return operator()(p0.first, p1.first, p2.first, p3.first, p4.first,
                       p0.second, p1.second, p2.second, p3.second, p4.second);
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_filtered_traits_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_filtered_traits_3.h
index 0254bf652b9..964f6024cb1 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_filtered_traits_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_filtered_traits_3.h
@@ -52,7 +52,7 @@ struct Offset_converter_3
 
   using Base::operator();
 
-  Target_off
+  const Target_off&
   operator()(const Source_off &off) const
   {
     return off;
@@ -106,6 +106,24 @@ public:
     traits_f.set_domain(C2F()(domain));
   }
 
+  typedef Filtered_predicate<
+            typename Exact_traits::Compare_x_3,
+            typename Filtering_traits::Compare_x_3,
+            Offset_converter_3<C2E>,
+            Offset_converter_3<C2F> >  Compare_x_3;
+
+  typedef Filtered_predicate<
+            typename Exact_traits::Compare_y_3,
+            typename Filtering_traits::Compare_y_3,
+            Offset_converter_3<C2E>,
+            Offset_converter_3<C2F> >  Compare_y_3;
+
+  typedef Filtered_predicate<
+            typename Exact_traits::Compare_z_3,
+            typename Filtering_traits::Compare_z_3,
+            Offset_converter_3<C2E>,
+            Offset_converter_3<C2F> >  Compare_z_3;
+
   typedef Filtered_predicate<
             typename Exact_traits::Compare_xyz_3,
             typename Filtering_traits::Compare_xyz_3,
@@ -118,6 +136,30 @@ public:
             Offset_converter_3<C2E>,
             Offset_converter_3<C2F> >  Orientation_3;
 
+  Compare_x_3 compare_x_3_object() const
+  {
+    typename Exact_traits::Compare_x_3 pe = traits_e.compare_x_3_object();
+    typename Filtering_traits::Compare_x_3 pf = traits_f.compare_x_3_object();
+
+    return Compare_x_3(pe, pf);
+  }
+
+  Compare_y_3 compare_y_3_object() const
+  {
+    typename Exact_traits::Compare_y_3 pe = traits_e.compare_y_3_object();
+    typename Filtering_traits::Compare_y_3 pf = traits_f.compare_y_3_object();
+
+    return Compare_y_3(pe, pf);
+  }
+
+  Compare_z_3 compare_z_3_object() const
+  {
+    typename Exact_traits::Compare_z_3 pe = traits_e.compare_z_3_object();
+    typename Filtering_traits::Compare_z_3 pf = traits_f.compare_z_3_object();
+
+    return Compare_z_3(pe, pf);
+  }
+
   Compare_xyz_3 compare_xyz_3_object() const
   {
     typename Exact_traits::Compare_xyz_3 pe = traits_e.compare_xyz_3_object();
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_orientation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_orientation_3.h
index 9b19c03f511..f858558c45f 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_orientation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_orientation_3.h
@@ -42,12 +42,12 @@ public:
   typedef typename K::Sphere_3               Sphere_3;
   typedef typename K::Periodic_3_offset_3    Offset;
 
+  typedef typename K::Orientation            Orientation;
+
 public:
   const Iso_cuboid_3 * const _dom;
 
 public:
- typedef typename Base::result_type  result_type;
-
  Periodic_3_orientation_3(const Iso_cuboid_3 * const dom,
                           const Orientation_3_base& o3b)
    : Base(o3b), _dom(dom)
@@ -55,7 +55,7 @@ public:
 
   using Base::operator();
 
-  result_type
+  Orientation
   operator()(const Point_3 &p, const Point_3 &q,
              const Point_3 &r, const Point_3 &s) const
   {
@@ -157,7 +157,7 @@ public:
       return Base::operator()(p, q, r, s);
   }
 
-  result_type
+  Orientation
   operator()(const Point_3 &p, const Point_3 &q,
              const Point_3 &r, const Point_3 &s,
              const Offset &o_p, const Offset &o_q,
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_side_of_oriented_sphere_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_side_of_oriented_sphere_3.h
index 992e60d1ee0..9c0eae4b8de 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_side_of_oriented_sphere_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_side_of_oriented_sphere_3.h
@@ -42,9 +42,6 @@ public:
   typedef typename K::Iso_cuboid_3                      Iso_cuboid_3;
   typedef typename K::Periodic_3_offset_3               Offset;
 
-public:
-  typedef typename Base::result_type  result_type;
-
 private:
   const Iso_cuboid_3 * _dom;
 
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/canonicalize_helper.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/canonicalize_helper.h
index 78e304e2949..712bc53d050 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/canonicalize_helper.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/canonicalize_helper.h
@@ -18,7 +18,7 @@
 // Although 'canoncalize_point()' is used by Periodic_3_mesh_3, this file is here
 // (in Periodic_3_triangulation_3) because of 'construct_periodic_point()',
 // which is a function used in P3T3.h and also needed by 'canonicalize_point()'.
-// However, P3M3 needs 'canoncalize_point()' without having access to a triangulation
+// However, P3M3 needs 'canonicalize_point()' without having access to a triangulation
 // and to avoid duplicating it, the function is here.
 
 // Geom_traits must be a model of the concept 'P3T3Traits' for 'construct_periodic_point()'.
@@ -44,7 +44,6 @@ namespace internal {
 template <typename Gt_>
 std::pair<typename Gt_::Point_3, typename Gt_::Periodic_3_offset_3>
 construct_periodic_point(const typename Gt_::Point_3& p,
-                         bool& encountered_issue,
                          const Gt_& gt)
 {
   typedef Gt_                                                  Geom_traits;
@@ -52,13 +51,13 @@ construct_periodic_point(const typename Gt_::Point_3& p,
   typedef typename Geom_traits::Periodic_3_offset_3            Offset;
   typedef typename Geom_traits::Iso_cuboid_3                   Iso_cuboid;
 
-  const Iso_cuboid& domain = gt.get_domain();
-
-  // Use these rather than Construct_point_3 to avoid construction inaccuracies
+  // this assumes exact predicates, otherwise we could be looping
   typename Geom_traits::Compare_x_3 cmp_x3 = gt.compare_x_3_object();
   typename Geom_traits::Compare_y_3 cmp_y3 = gt.compare_y_3_object();
   typename Geom_traits::Compare_z_3 cmp_z3 = gt.compare_z_3_object();
 
+  const Iso_cuboid& domain = gt.get_domain();
+
   // Check if p lies within the domain. If not, translate.
   if(!(p.x() < domain.xmin()) && p.x() < domain.xmax() &&
      !(p.y() < domain.ymin()) && p.y() < domain.ymax() &&
@@ -67,109 +66,46 @@ construct_periodic_point(const typename Gt_::Point_3& p,
     return std::make_pair(p, Offset());
   }
 
-  // Numerical approximations might create inconsistencies between the constructions
-  // and the comparisons. For example in a cubic domain of size 2:
-  // 1. initial point: P(2+1e-17, 0, 0)
-  // 2. the function computes an offset(1, 0, 0),
-  // 3. P + (-1, 0, 0) * domain_size constructs Q(-1e-17, 0, 0) // numerical approximation
-  // 4. the function computes an offset of (-1, 0, 0)
-  // 5. Q + (1, 0, 0) * domain_size constructs (2+1e-17, 0, 0) (that is P)
-  // And the function is looping...
-  //
-  // If this is happening the 'Last_change' enum will break this infinite
-  // loop and return the wrong point and the 'encountered_issue' bool will be
-  // set to 'true'. An exact version of this function is then be called.
-
-  enum Last_change
-  {
-    NO_LAST_CHANGE,
-    INCREASED_X, DECREASED_X, INCREASED_Y, DECREASED_Y, INCREASED_Z, DECREASED_Z
-  };
-
-  Last_change lc = NO_LAST_CHANGE;
-  bool in = false;
+  Point domain_m(domain.xmin(), domain.ymin(), domain.zmin());
+  Point domain_M(domain.xmax(), domain.ymax(), domain.zmax());
 
   Offset transl(0, 0, 0);
   const Offset null_off(0, 0, 0);
 
-  Point domain_m(domain.xmin(), domain.ymin(), domain.zmin());
-  Point domain_M(domain.xmax(), domain.ymax(), domain.zmax());
-
-  while(!in)
+  for(;;)
   {
     if(cmp_x3(p, domain_m, transl, null_off) == SMALLER)
-    {
-      if(lc == DECREASED_X) // stuck in a loop
-        break;
-
-      lc = INCREASED_X;
       transl.x() += 1;
-    }
     else if(cmp_y3(p, domain_m, transl, null_off) == SMALLER)
-    {
-      if(lc == DECREASED_Y) // stuck in a loop
-        break;
-
-      lc = INCREASED_Y;
       transl.y() += 1;
-    }
     else if(cmp_z3(p, domain_m, transl, null_off) == SMALLER)
-    {
-      if(lc == DECREASED_Z) // stuck in a loop
-        break;
-
-      lc = INCREASED_Z;
       transl.z() += 1;
-    }
     else if(!(cmp_x3(p, domain_M, transl, null_off) == SMALLER))
-    {
-      if(lc == INCREASED_X) // stuck in a loop
-        break;
-
-      lc = DECREASED_X;
       transl.x() -= 1;
-    }
     else if(!(cmp_y3(p, domain_M, transl, null_off) == SMALLER))
-    {
-      if(lc == INCREASED_Y) // stuck in a loop
-        break;
-
-      lc = DECREASED_Y;
       transl.y() -= 1;
-    }
     else if(!(cmp_z3(p, domain_M, transl, null_off) == SMALLER))
-    {
-      if(lc == INCREASED_Z) // stuck in a loop
-        break;
-
-      lc = DECREASED_Z;
       transl.z() -= 1;
-    }
     else
-    {
-      in = true;
-    }
+      break;
   }
 
   std::pair<Point, Offset> pp(p, transl);
 
-  if(cmp_x3(p, domain_m, transl, null_off) == SMALLER || // < min
-     cmp_y3(p, domain_m, transl, null_off) == SMALLER ||
-     cmp_z3(p, domain_m, transl, null_off) == SMALLER ||
-     !(cmp_x3(p, domain_M, transl, null_off) == SMALLER) || // >= max
-     !(cmp_y3(p, domain_M, transl, null_off) == SMALLER) ||
-     !(cmp_z3(p, domain_M, transl, null_off) == SMALLER))
-  {
-    encountered_issue = true;
-  }
+  CGAL_postcondition(!(cmp_x3(p, domain_m, transl, null_off) == SMALLER) &&
+                     !(cmp_y3(p, domain_m, transl, null_off) == SMALLER) &&
+                     !(cmp_z3(p, domain_m, transl, null_off) == SMALLER) &&
+                       cmp_x3(p, domain_M, transl, null_off) == SMALLER &&
+                       cmp_y3(p, domain_M, transl, null_off) == SMALLER &&
+                       cmp_z3(p, domain_M, transl, null_off) == SMALLER);
 
   return pp;
 }
 
 template <typename Gt_>
 typename Gt_::Point_3
-constrain_to_canonical_domain(const typename Gt_::Point_3& p,
-                              const Gt_& gt)
+clamp_to_canonical_domain(const typename Gt_::Point_3& p,
+                          const Gt_& gt)
 {
   typedef Gt_                                         Geom_traits;
   typedef typename Geom_traits::FT                    FT;
@@ -196,31 +132,115 @@ constrain_to_canonical_domain(const typename Gt_::Point_3& p,
 /// instance of the same bare point that lives inside the base domain
 template <typename Gt_>
 typename Gt_::Point_3
-robust_canonicalize_point(const typename Gt_::Point_3& p,
+construct_canonical_point(const typename Gt_::Point_3& p,
                           const Gt_& gt)
 {
-  typedef Gt_                                         Geom_traits;
-  typedef typename Geom_traits::Point_3               Bare_point;
-  typedef typename Geom_traits::Periodic_3_offset_3   Offset;
-  typedef typename Geom_traits::Iso_cuboid_3          Iso_cuboid;
+  typedef Gt_                                                  Geom_traits;
+  typedef typename Geom_traits::Periodic_3_offset_3            Offset;
+  typedef typename Geom_traits::Iso_cuboid_3                   Iso_cuboid;
+
+  const Iso_cuboid& domain = gt.get_domain();
+
+  // Check if p lies within the domain. If not, translate.
+  if(!(p.x() < domain.xmin()) && p.x() < domain.xmax() &&
+     !(p.y() < domain.ymin()) && p.y() < domain.ymax() &&
+     !(p.z() < domain.zmin()) && p.z() < domain.zmax())
+  {
+    return p;
+  }
 
   typename Geom_traits::Construct_point_3 cp = gt.construct_point_3_object();
 
-  const Iso_cuboid& domain = gt.get_domain();
-  if(p.x() >= domain.xmin() && p.x() < domain.xmax() &&
-     p.y() >= domain.ymin() && p.y() < domain.ymax() &&
-     p.z() >= domain.zmin() && p.z() < domain.zmax())
-    return p;
+  // Numerical approximations might create inconsistencies between the constructions
+  // and the comparisons. For example in a cubic domain of size 2:
+  // 1. initial point: P(2+1e-17, 0, 0)
+  // 2. the function computes an offset(1, 0, 0),
+  // 3. P + (-1, 0, 0) * domain_size constructs Q(-1e-17, 0, 0) // numerical approximation
+  // 4. the function computes an offset of (-1, 0, 0)
+  // 5. Q + (1, 0, 0) * domain_size constructs (2+1e-17, 0, 0) (that is P)
+  // And the function is looping...
+  //
+  // If this is happening the 'Last_change' enum will break this infinite loop,
+  // and the function will snap the point to the domain.
 
-  bool encountered_issue = false;
-  std::pair<Bare_point, Offset> pbp = construct_periodic_point(p, encountered_issue, gt);
-  Bare_point canonical_p = cp(pbp.first /*point*/, pbp.second /*offset*/);
-
-  if(encountered_issue)
+  enum Last_change
   {
-    // If we encountered an issue, there's no guarantee that the double construction gives a point
-    // in the domain (even if we computed it exactly beforehand). So, forcefully put it into the domain.
-    canonical_p = constrain_to_canonical_domain(canonical_p, gt);
+    NO_LAST_CHANGE,
+    INCREASED_X, DECREASED_X, INCREASED_Y, DECREASED_Y, INCREASED_Z, DECREASED_Z
+  };
+
+  Last_change lc = NO_LAST_CHANGE;
+
+  Offset transl(0, 0, 0);
+  Point_3 canonical_p = p;
+
+  for(;;)
+  {
+    // Here we actually construct because we are interested in the constructed point,
+    // numerical errors or not. If we used predicates, we could have an inconsistency
+    // at the end with the predicates saying "inside" but the constructed point
+    // being outside.
+    canonical_p = cp(p, transl);
+
+    if(canonical_p.x() < domain.xmin())
+    {
+      if(lc == DECREASED_X) // stuck in a loop
+        break;
+
+      lc = INCREASED_X;
+      transl.x() += 1;
+    }
+    else if(canonical_p.y() < domain.xmin())
+    {
+      if(lc == DECREASED_Y) // stuck in a loop
+        break;
+
+      lc = INCREASED_Y;
+      transl.y() += 1;
+    }
+    else if(canonical_p.z() < domain.xmin())
+    {
+      if(lc == DECREASED_Z) // stuck in a loop
+        break;
+
+      lc = INCREASED_Z;
+      transl.z() += 1;
+    }
+    else if(canonical_p.x() >= domain.xmax())
+    {
+      if(lc == INCREASED_X) // stuck in a loop
+        break;
+
+      lc = DECREASED_X;
+      transl.x() -= 1;
+    }
+    else if(canonical_p.y() >= domain.ymax())
+    {
+      if(lc == INCREASED_Y) // stuck in a loop
+        break;
+
+      lc = DECREASED_Y;
+      transl.y() -= 1;
+    }
+    else if(canonical_p.z() >= domain.zmax())
+    {
+      if(lc == INCREASED_Z) // stuck in a loop
+        break;
+
+      lc = DECREASED_Z;
+      transl.z() -= 1;
+    }
+    else
+    {
+      break;
+    }
+  }
+
+  if(canonical_p.x() < domain.xmin() || canonical_p.x() >= domain.xmax() ||
+     canonical_p.y() < domain.ymin() || canonical_p.y() >= domain.ymax() ||
+     canonical_p.z() < domain.zmin() || canonical_p.z() >= domain.zmax())
+  {
+    canonical_p = clamp_to_canonical_domain(canonical_p, gt);
   }
 
   CGAL_postcondition( !(canonical_p.x() < domain.xmin()) && (canonical_p.x() < domain.xmax()));
@@ -234,7 +254,7 @@ robust_canonicalize_point(const typename Gt_::Point_3& p,
 /// instance of the same weighted point that lives inside the base domain
 template <typename Gt_>
 typename Gt_::Weighted_point_3
-robust_canonicalize_point(const typename Gt_::Weighted_point_3& wp,
+construct_canonical_point(const typename Gt_::Weighted_point_3& wp,
                           const Gt_& gt)
 {
   typedef Gt_                                         Geom_traits;
@@ -252,7 +272,7 @@ robust_canonicalize_point(const typename Gt_::Weighted_point_3& wp,
   typename Geom_traits::Construct_weighted_point_3 cwp = gt.construct_weighted_point_3_object();
 
   const Bare_point& bp = cp(wp);
-  Bare_point canonical_point = robust_canonicalize_point(bp, gt);
+  Bare_point canonical_point = construct_canonical_point(bp, gt);
 
   return cwp(canonical_point, cw(wp));
 }
diff --git a/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h
index b5d08b90ec6..5894ff7302a 100644
--- a/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h
+++ b/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h
@@ -31,7 +31,7 @@ _test_cls_periodic_3_triangulation_3(const PeriodicTriangulation &,
                                      const char* covering_test_filename,
                                      bool ex = false,
                                      bool hom = false,
-                                     bool test_input_ouput = true)
+                                     bool test_input_output = true)
 {
   typedef PeriodicTriangulation                  P3T3;
 
@@ -633,7 +633,7 @@ _test_cls_periodic_3_triangulation_3(const PeriodicTriangulation &,
 
 
   // There are problems with the IO of exact number types in binary mode.
-  if(test_input_ouput)
+  if(test_input_output)
   {
     std::cout << "I/O" << std::endl;
     std::cout << "  ASCII" << std::endl;
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Periodic_4_hyperbolic_triangulation_2.txt b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Periodic_4_hyperbolic_triangulation_2.txt
index f5bdc8e3990..60389129c57 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Periodic_4_hyperbolic_triangulation_2.txt
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Periodic_4_hyperbolic_triangulation_2.txt
@@ -17,9 +17,7 @@ namespace CGAL {
 
 
 
-This package enables the computation of Delaunay triangulations of the Bolza
-surface, which is the most symmetric surface of genus 2. The Bolza surface is
-a hyperbolic closed compact orientable surface.
+This package enables the computation of Delaunay triangulations of the Bolza surface, which is the most symmetric surface of genus 2. The Bolza surface is a hyperbolic closed compact orientable surface. For triangulations on general hyperbolic surfaces, we refer to the package \ref Chapter_Hyperbolic_Surface_Triangulations "2D Triangulations on Hyperbolic Surfaces".
 
 A triangulation of the Bolza surface can be seen as a periodic
 triangulation of the hyperbolic plane.
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/dependencies b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/dependencies
index 65f3104fa12..54ced5da1df 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/dependencies
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/dependencies
@@ -11,4 +11,5 @@ Circular_kernel_2
 Triangulation
 Hyperbolic_triangulation_2
 Number_types
-Periodic_2_triangulation_2
\ No newline at end of file
+Periodic_2_triangulation_2
+Triangulation_on_hyperbolic_surface_2
diff --git a/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h b/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
index 9c89cc574d0..0abb4fbabb5 100644
--- a/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
@@ -48,45 +48,43 @@ class Hyperbolic_traits_with_translations_2_adaptor
   typedef typename Kernel::Construct_hyperbolic_point_2   Construct_hyperbolic_point_2;
 
 public:
-  typedef typename Predicate::result_type                 result_type;
-
   using Predicate::operator();
 
   Hyperbolic_traits_with_translations_2_adaptor(const Predicate_ pred = Predicate_()) : Predicate_(pred) {}
 
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Hyperbolic_translation& o0, const Hyperbolic_translation& o1) const
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Hyperbolic_translation& o0, const Hyperbolic_translation& o1) const
   {
     return operator()(pp(p0, o0), pp(p1, o1));
   }
 
-  result_type operator()(const Point& p0, const Point& p1, const Point& p2,
-                         const Hyperbolic_translation& o0, const Hyperbolic_translation& o1, const Hyperbolic_translation& o2) const
+  decltype(auto) operator()(const Point& p0, const Point& p1, const Point& p2,
+                            const Hyperbolic_translation& o0, const Hyperbolic_translation& o1, const Hyperbolic_translation& o2) const
   {
     return operator()(pp(p0, o0), pp(p1, o1), pp(p2, o2));
   }
 
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3,
-                         const Hyperbolic_translation& o0, const Hyperbolic_translation& o1,
-                         const Hyperbolic_translation& o2, const Hyperbolic_translation& o3) const
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3,
+                            const Hyperbolic_translation& o0, const Hyperbolic_translation& o1,
+                            const Hyperbolic_translation& o2, const Hyperbolic_translation& o3) const
   {
     return operator()(pp(p0, o0), pp(p1, o1), pp(p2, o2), pp(p3, o3));
   }
 
   // Added for Side_of_hyperbolic_triangle_2
   template <typename T>
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3, T& t) const
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3, T& t) const
   {
     return operator()(p0, p1, p2, p3, t);
   }
 
   template <typename T>
-  result_type operator()(const Point& p0, const Point& p1,
-                         const Point& p2, const Point& p3,
-                         const Hyperbolic_translation& o0, const Hyperbolic_translation& o1,
-                         const Hyperbolic_translation& o2, const Hyperbolic_translation& o3, T& t) const
+  decltype(auto) operator()(const Point& p0, const Point& p1,
+                            const Point& p2, const Point& p3,
+                            const Hyperbolic_translation& o0, const Hyperbolic_translation& o1,
+                            const Hyperbolic_translation& o2, const Hyperbolic_translation& o3, T& t) const
   {
     return operator()(pp(p0, o0), pp(p1, o1), pp(p2, o2), pp(p3, o3), t);
   }
@@ -109,8 +107,6 @@ private:
   typedef typename Kernel::Hyperbolic_translation         Hyperbolic_translation;
 
 public:
-  typedef Point                                           result_type;
-
   using Construct_point_base::operator();
 
   Periodic_4_construct_hyperbolic_point_2() { }
@@ -165,14 +161,13 @@ class Compute_approximate_hyperbolic_diameter
     typedef typename Traits:: Euclidean_line_2     Euclidean_line_2;
     typedef typename Traits::Circle_2              Circle_2;
     typedef typename Traits::Hyperbolic_point_2    Hyperbolic_point_2;
-  public:
-    typedef double result_type;
 
+  public:
     Compute_approximate_hyperbolic_diameter(const Traits& gt = Traits()) : _gt(gt) {}
 
-    result_type operator()(const Hyperbolic_point_2& p1,
-                           const Hyperbolic_point_2& p2,
-                           const Hyperbolic_point_2& p3)
+    double operator()(const Hyperbolic_point_2& p1,
+                      const Hyperbolic_point_2& p2,
+                      const Hyperbolic_point_2& p3)
     {
 
       Circle_2 c = _gt.construct_circle_2_object()(p1, p2, p3);
@@ -443,8 +438,6 @@ class Compute_approximate_hyperbolic_diameter
   public:
     Construct_inexact_hyperbolic_circumcenter_2(const Traits& gt = Traits()) : _gt(gt) {}
 
-    typedef Hyperbolic_Voronoi_point_2                      result_type;
-
     Hyperbolic_Voronoi_point_2 operator()(const Hyperbolic_point_2& p,
                                           const Hyperbolic_point_2& q,
                                           const Hyperbolic_point_2& r)
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
index c7693fd9bd0..a217e6ca5b1 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
@@ -46,7 +46,7 @@ public:
   void before_edge_split(halfedge_descriptor h, const Triangle_mesh& tm);
   /// called when a new split is done. The target of `hnew` is a new split vertex. There is only one call per edge.
   void edge_split(halfedge_descriptor hnew, const Triangle_mesh& tm);
-  /// called when the split of the halfedge `h` passed at the later call to `before_edge_split()` is finished.
+  /// called when the split of the halfedge `h` passed at the latter call to `before_edge_split()` is finished.
   void after_edge_split();
   ///  called when a new edge has been added to triangulate a face. The face triangulated is `f_split`
   ///  in the last call to `before_subface_creations(f_split, tm)`. There is only one call per edge.
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 50f198e8317..bf12fdb0cd1 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -79,7 +79,7 @@
 \cgalPkgPicture{hole_filling_ico.png}
 
 \cgalPkgSummaryBegin
-\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz}
+\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, Sébastien Valette, and Ilker %O. Yaz}
 \cgalPkgDesc{This package provides a collection of methods and classes for polygon mesh processing,
 ranging from basic operations on simplices, to complex geometry processing algorithms such as
 Boolean operations, remeshing, repairing, collision and intersection detection, and more.}
@@ -127,6 +127,7 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - \link PMP_meshing_grp `CGAL::Polygon_mesh_processing::isotropic_remeshing()` \endlink
 - \link PMP_meshing_grp `CGAL::Polygon_mesh_processing::surface_Delaunay_remeshing()` \endlink
 - \link PMP_meshing_grp `CGAL::Polygon_mesh_processing::split_long_edges()` \endlink
+- `CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing()`
 - `CGAL::Polygon_mesh_processing::extrude_mesh()`
 - `CGAL::Polygon_mesh_processing::smooth_mesh()` (deprecated)
 - `CGAL::Polygon_mesh_processing::angle_and_area_smoothing()`
@@ -134,6 +135,7 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::smooth_shape()`
 - `CGAL::Polygon_mesh_processing::random_perturbation()`
 
+
 \cgalCRPSection{Sizing Fields}
 - `CGAL::Polygon_mesh_processing::Uniform_sizing_field`
 - `CGAL::Polygon_mesh_processing::Adaptive_sizing_field`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index c4bf5a424fc..fdced7275a8 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -4,7 +4,7 @@ namespace CGAL {
 \anchor Chapter_PolygonMeshProcessing
 
 \cgalAutoToc
-\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz
+\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, Sébastien Valette, and Ilker %O. Yaz
 
 \image html neptun_head.jpg
 \image latex neptun_head.jpg
@@ -107,7 +107,7 @@ maximizes the minimum angle of all the angles of the triangles in the triangulat
 
 \subsubsection Remeshing
 
-\paragraph Local Isotropic Incremental Remeshing
+\paragraph isorem Local Isotropic Incremental Remeshing
 The incremental triangle-based isotropic remeshing algorithm introduced by Botsch et al
  \cgalCite{botsch2004remeshing}, \cgalCite{botsch2010PMP} is implemented in this package.
 This algorithm incrementally performs simple operations such as edge splits, edge collapses,
@@ -125,7 +125,7 @@ provided: a uniform and a curvature-adaptive sizing field. With `CGAL::Polygon_m
 all triangle edges are targeted to have equal lengths. With `CGAL::Polygon_mesh_processing::Adaptive_sizing_field`, triangle edge lengths depend on the local curvature --
 shorter edges appear in regions with a higher curvature and vice versa. The outline of the adaptive sizing
 field algorithm is available in \cgalCite{dunyach2013curvRemesh}. The distinction between uniform and adaptive
-sizing fields is depicted in figure \cgalFigureRef{uniform_and_adaptive}.
+sizing fields is depicted in \cgalFigureRef{uniform_and_adaptive}.
 
 As the number of iterations increases, the mesh tends to be smoother and closer to the target edge length.
 
@@ -148,7 +148,7 @@ Sizing fields in isotropic remeshing.
 (b) Curvature-based adaptive sizing field.
 \cgalFigureEnd
 
-\paragraph Delaunay-Based Surface Remeshing
+\paragraph mesh3rem Delaunay-Based Surface Remeshing
 The mesh generation algorithm implemented in the \ref PkgMesh3 package can be used to remesh a given triangulated surface mesh.
 The algorithm, based on Delaunay refinement of a restricted Delaunay triangulation,
 generates a triangle surface mesh that provably has the required properties on simplices size,
@@ -167,7 +167,29 @@ An example of how to remesh a given triangulated surface mesh with the Delaunay
 algorithm while preserving the detected sharp edges
 is given in \ref Polygon_mesh_processing/delaunay_remeshing_example.cpp
 
-\paragraph Decimate Remeshing of (Almost) Planar Patches
+\paragraph acvdrem Approximated Discrete Centroidal Voronoi Diagram (ACVD) Remeshing
+This remeshing algorithm uses clustering on polygonal meshes as to approximate a Centroidal Voronoi Diagram construction.
+It is inspired by the method presented in \cgalCite{cgal:vc-acvdupmc-04} and further developed in \cgalCite{cgal:audette2011approach} and \cgalCite{cgal:vcp-grtmmdvd-08}.
+The algorithm is similar to Lloyd's algorithm (or k-means) where random input vertices are picked to initialize clusters of vertices, which are then grown to minimize a particular energy, until convergence.
+Upon convergence, output vertices are computed from the vertices of each cluster.
+The function `CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing()` takes as input a triangle mesh and
+an expected number of output vertices, and updates the mesh with the remeshed version.
+Note that the final vertex count may exceed the input parameter if the input mesh is not closed,
+or if the specified vertex budget was insufficient to generate a manifold mesh.
+In this case, the uniformity of the output triangles may be affected.
+Note that there is no guarantee that the output mesh will have the same topology as the input. For example, if
+a small handle is entirely contained in a cluster then this handle will not be part of the output.
+If the input mesh contains sharp features or corners, it is possible to use quadric error metrics to either
+move output vertices (fast but can produce bad looking triangles), of to use quadric error metrics directly into the energy formulation of each cluster (slower but produces better quality triangles).
+Additionally, adaptive remeshing based on surface curvature is possible.
+
+
+\cgalFigureBegin{acvd_remeshing, acvd_remeshing.png}
+ACVD remeshing.
+From left to right: Input; with default parameters; using adaptative option; using QEM based energy.
+\cgalFigureEnd
+
+\paragraph decimate Remeshing of (Almost) Planar Patches
 When many triangles are used to describe a planar region of a model, one might wish to simplify the mesh
 in this region to use few elements, or even a single large polygonal face when the region makes up a simply connected patch.
 This can be achieved using the function `CGAL::Polygon_mesh_processing::remesh_planar_patches()`.
@@ -602,7 +624,7 @@ reports all pairs of intersecting triangles.
 \subsubsection SIExample Self Intersections Example
 
 The following example illustrates the detection of self intersection in the `pig.off` mesh.
-The detected self-intersection is illustrated on Figure \cgalFigureRef{SelfIntersections}.
+The detected self-intersection is illustrated on \cgalFigureRef{SelfIntersections}.
 
 \cgalExample{Polygon_mesh_processing/self_intersections_example.cpp}
 
@@ -1450,5 +1472,11 @@ used as a reference during the project.
 
 The curvature-based sizing field version of isotropic remeshing was added by Ivan Pađen during GSoC 2023, under the supervision of Sébastien Loriot and Jane Tournois.
 
+The implementation of the ACVD Remeshing method was initiated by Hossam Saeed during GSoC 2023, under
+supervision of Sébastien Valette and Sébastien Loriot, who later finalized the work.
+The implementation is based on \cgalCite{cgal:vcp-grtmmdvd-08}. and
+preceeding work. <a href="https://www.creatis.insa-lyon.fr/~valette/public/project/acvd/">ACVD's implementation</a> was also
+used as a reference during the project.
+
 */
 } /* namespace CGAL */
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index dba765d7f6a..f2005fa8b4f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -50,6 +50,7 @@
 \example Polygon_mesh_processing/cc_compatible_orientations.cpp
 \example Polygon_mesh_processing/remesh_planar_patches.cpp
 \example Polygon_mesh_processing/remesh_almost_planar_patches.cpp
+\example Polygon_mesh_processing/acvd_remeshing_example.cpp
 \example Polygon_mesh_processing/sample_example.cpp
 \example Polygon_mesh_processing/soup_autorefinement.cpp
 */
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/acvd_remeshing.png b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/acvd_remeshing.png
new file mode 100644
index 00000000000..058ad05dd5e
Binary files /dev/null and b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/acvd_remeshing.png differ
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index cbeb71cb6b9..f5035cd158c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -62,6 +62,8 @@ create_single_source_cgal_program("soup_autorefinement.cpp")
 find_package(Eigen3 3.2.0 QUIET) #(requires 3.2.0 or greater)
 include(CGAL_Eigen3_support)
 if(TARGET CGAL::Eigen3_support)
+  create_single_source_cgal_program("acvd_remeshing_example.cpp")
+  target_link_libraries(acvd_remeshing_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("hole_filling_example.cpp")
   target_link_libraries(hole_filling_example PRIVATE CGAL::Eigen3_support)
   create_single_source_cgal_program("hole_filling_example_SM.cpp")
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/acvd_remeshing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/acvd_remeshing_example.cpp
new file mode 100644
index 00000000000..d6e7122e99e
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/acvd_remeshing_example.cpp
@@ -0,0 +1,73 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <iostream>
+#include <filesystem>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
+typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Mesh;
+
+namespace params = CGAL::parameters;
+
+int main(int argc, char* argv[])
+{
+  Mesh smesh;
+  std::cout << "Seed : " << CGAL::get_default_random().get_seed() << std::endl;
+
+  const std::string filename = (argc > 1) ?
+    argv[1] :
+    CGAL::data_file_path("meshes/fandisk.off");
+
+  const std::string stem = std::filesystem::path(filename).stem().string();
+  const std::string extension = std::filesystem::path(filename).extension().string();
+
+  const int nb_clusters = (argc > 2) ? atoi(argv[2]) : 3000;
+  const std::string nbc = std::to_string(nb_clusters);
+
+  if (!CGAL::IO::read_polygon_mesh(filename, smesh))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  ///// Uniform Isotropic ACVD
+  std::cout << "Uniform Isotropic ACVD ...." << std::endl;
+  Mesh acvd_mesh = smesh;
+  PMP::approximated_centroidal_Voronoi_diagram_remeshing(acvd_mesh, nb_clusters);
+  CGAL::IO::write_polygon_mesh(stem+"_acvd_"+nbc+extension, acvd_mesh);
+
+  std::cout << "Completed" << std::endl;
+
+
+  //// With Post-Processing QEM Optimization
+  std::cout << "Uniform Isotropic ACVD with QEM optimization ...." << std::endl;
+
+  Mesh acvd_mesh_qem_pp = smesh;
+  PMP::approximated_centroidal_Voronoi_diagram_remeshing(acvd_mesh_qem_pp, nb_clusters, params::use_postprocessing_qem(true));
+  CGAL::IO::write_polygon_mesh( stem +"_acvd_qem-pp_"+nbc+extension, acvd_mesh_qem_pp);
+
+  std::cout << "Completed" << std::endl;
+
+  // With QEM Energy Minimization
+  std::cout << "Uniform QEM ACVD ...." << std::endl;
+  Mesh acvd_mesh_qem = smesh;
+  PMP::approximated_centroidal_Voronoi_diagram_remeshing(acvd_mesh_qem, nb_clusters, params::use_qem_based_energy(true));
+  CGAL::IO::write_polygon_mesh(stem +"_acvd_qem_"+ std::to_string(nb_clusters) + extension, acvd_mesh_qem);
+
+  /// Adaptive Isotropic ACVD
+  std::cout << "Adaptive Isotropic ACVD ...." << std::endl;
+  const double gradation_factor = 2;
+  Mesh adaptive_acvd_mesh = smesh;
+  PMP::approximated_centroidal_Voronoi_diagram_remeshing(adaptive_acvd_mesh, nb_clusters, params::gradation_factor(gradation_factor));
+
+  CGAL::IO::write_polygon_mesh(stem +"_acvd_adaptative_"+ std::to_string(nb_clusters) + extension, adaptive_acvd_mesh);
+
+  std::cout << "Completed" << std::endl;
+
+  return 0;
+}
+
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h
new file mode 100644
index 00000000000..064d84fd5d8
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h
@@ -0,0 +1,1420 @@
+// Copyright (c) 2023-2025 GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Hossam Saeed, Sébastien Valette, and Sébastien Loriot
+//
+
+#ifndef CGAL_PMP_ACVD_REMESHING_H
+#define CGAL_PMP_ACVD_REMESHING_H
+
+#include <CGAL/license/Polygon_mesh_processing/acvd.h>
+
+#ifndef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
+#endif
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/border.h>
+#ifdef CGAL_DEBUG_ACVD
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/IO/Color.h>
+#endif
+
+#include <CGAL/assertions.h>
+#include <CGAL/boost/graph/named_params_helper.h>
+#include <CGAL/Named_function_parameters.h>
+#include <CGAL/property_map.h>
+#include <CGAL/Random.h>
+#include <CGAL/determinant.h>
+#include <CGAL/subdivision_method_3.h>
+#include <CGAL/utility.h>
+
+#include <Eigen/Dense>
+#include <Eigen/Eigenvalues>
+
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/graph/connected_components.hpp>
+
+#include <array>
+#include <algorithm>
+#include <fstream>
+#include <iostream>
+#include <numeric>
+#include <queue>
+#include <set>
+#include <stdexcept>
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+// Early convergence ratio which is used for the first two minimization steps.
+// The final convergence is carried out entirely i.e. convergence is reached only when no more optimization can be performed.
+#define CGAL_TO_QEM_MODIFICATION_THRESHOLD 1e-3
+
+// Used to clamp curvature values:
+//  - regions with zero curvature (although this is not really a degenerate case....)
+//  - regions with too high computed curvature (sometimes due to numerical issues in curvature computation)
+// Clamping happens this way ;
+//  -The average weight weight_avg is computed
+//      weights higher than CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD * weight_avg are set to this value
+//      weights lower than 1/( CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD * weight_avg ) are set to this value
+#define CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD 10000
+
+namespace CGAL {
+namespace Polygon_mesh_processing {
+namespace internal {
+
+#ifdef CGAL_DEBUG_ACVD
+template <class TriangleMesh, class ClusterMap>
+void dump_mesh_with_cluster_colors(TriangleMesh tmesh, ClusterMap cluster_map, std::string fname)
+{
+  std::vector<CGAL::IO::Color> palette {{ CGAL::IO::red(),
+                                          CGAL::IO::green(),
+                                          CGAL::IO::blue(),
+                                          CGAL::IO::purple(),
+                                          CGAL::IO::orange(),
+                                          CGAL::IO::deep_blue(),
+                                          CGAL::IO::yellow(),
+                                          CGAL::IO::violet(),
+                                          CGAL::IO::gray(),
+                                          CGAL::IO::white() }};
+
+  auto vcm = get(CGAL::dynamic_vertex_property_t<CGAL::IO::Color>(), tmesh);
+
+  for (auto v : vertices(tmesh))
+  {
+    int cluster_id=get(cluster_map, v);
+    if (cluster_id!=-1)
+      put(vcm, v, palette[ cluster_id % palette.size() ]);
+    else
+      put(vcm, v, CGAL::IO::black());
+  }
+
+  std::ofstream out(fname);
+  CGAL::IO::write_PLY(out, tmesh, CGAL::parameters::use_binary_mode(false)
+                                                   .stream_precision(17)
+                                                   .vertex_color_map(vcm));
+
+}
+#endif // CGAL_DEBUG_ACVD
+
+template <typename GT>
+void compute_qem_face(const typename GT::Vector_3& p1, const typename GT::Vector_3& p2, const typename GT::Vector_3& p3,
+                      Eigen::Matrix<typename GT::FT, 4, 4>& quadric,
+                      const GT& gt)
+{
+  auto cross_product = gt.construct_cross_product_vector_3_object();
+
+  typename GT::Vector_3 crossX1X2 = cross_product(p1, p2);
+  typename GT::Vector_3 crossX2X3 = cross_product(p2, p3);
+  typename GT::Vector_3 crossX3X1 = cross_product(p3, p1);
+  typename GT::FT determinantABC = CGAL::determinant(p1, p2, p3);
+
+  typename GT::FT n[4] = {
+    crossX1X2.x() + crossX2X3.x() + crossX3X1.x(),
+    crossX1X2.y() + crossX2X3.y() + crossX3X1.y(),
+    crossX1X2.z() + crossX2X3.z() + crossX3X1.z(),
+    -determinantABC
+  };
+
+  for (int i = 0; i < 4; ++i)
+    for (int j = 0; j < 4; ++j)
+      quadric(i, j) = n[i] * n[j];
+}
+
+template <typename GT>
+typename GT::Vector_3 compute_displacement(const Eigen::Matrix<typename GT::FT, 4, 4>& quadric,
+                                           const typename GT::Point_3& p,
+                                           int& rank_deficiency)
+{
+  using Matrix3d = Eigen::Matrix<typename GT::FT, 3, 3>;
+
+  int max_nb_of_singular_values_used = 3;
+  Matrix3d A;
+  A(0, 0) = quadric(0, 0);
+  A(0, 1) = A(1, 0) = quadric(0, 1);
+  A(0, 2) = A(2, 0) = quadric(0, 2);
+  A(1, 1) = quadric(1, 1);
+  A(1, 2) = A(2, 1) = quadric(1, 2);
+  A(2, 2) = quadric(2, 2);
+
+  Matrix3d U, V;
+  typename GT::Vector_3 w;
+  Eigen::JacobiSVD<Matrix3d> svd(A, Eigen::ComputeFullU | Eigen::ComputeFullV);
+  U = svd.matrixU();
+  V = svd.matrixV();
+  auto w_temp = svd.singularValues();
+  w = typename GT::Vector_3(w_temp(0), w_temp(1), w_temp(2));
+
+  // compute all eigen values absolute values
+  typename GT::FT AbsolutesEigenValues[3];
+  typename GT::FT maxW = -1.0;
+  for (int j = 0; j < 3; ++j)
+  {
+    typename GT::FT AbsoluteEigenValue = fabs(w[j]);
+    AbsolutesEigenValues[j] = AbsoluteEigenValue;
+    if (AbsoluteEigenValue > maxW)
+      maxW = AbsoluteEigenValue;
+  }
+  typename GT::FT invmaxW = 1.0 / maxW;
+
+  Matrix3d tempMatrix, tempMatrix2;
+
+  for (int i = 0; i < 3; ++i)
+  {
+    typename GT::FT LocalMaxW = -1;
+    int IndexMax = -1;
+
+    // find the remaining eigenvalue with highest absolute value
+    for (int j = 0; j < 3; ++j)
+    {
+      if (LocalMaxW < AbsolutesEigenValues[j])
+      {
+        LocalMaxW = AbsolutesEigenValues[j];
+        IndexMax = j;
+      }
+    }
+
+    if ((AbsolutesEigenValues[IndexMax] * invmaxW > 1e-3) &&
+        (max_nb_of_singular_values_used > 0))
+    {
+      // If this is true, then w[i] != 0, so this division is ok.
+      double Inv = 1.0 / w[IndexMax];
+      tempMatrix(IndexMax, 0) = U(0, IndexMax) * Inv;
+      tempMatrix(IndexMax, 1) = U(1, IndexMax) * Inv;
+      tempMatrix(IndexMax, 2) = U(2, IndexMax) * Inv;
+    }
+    else
+    {
+      tempMatrix(IndexMax, 0) = 0;
+      tempMatrix(IndexMax, 1) = 0;
+      tempMatrix(IndexMax, 2) = 0;
+      ++rank_deficiency;
+    }
+
+    // set the eigenvalu to -2 to remove it from subsequent tests
+    AbsolutesEigenValues[IndexMax] = -2;
+    --max_nb_of_singular_values_used;
+  }
+
+  tempMatrix2 = V * tempMatrix;
+  Eigen::Matrix<typename GT::FT, 3, 1> p_temp, b;
+  b << -quadric(0, 3), -quadric(1, 3), -quadric(2, 3);
+  p_temp << p.x(), p.y(), p.z();
+  Eigen::Matrix<typename GT::FT, 3, 1> displacement_temp = tempMatrix2 * (b - A * p_temp);
+  typename GT::Vector_3 displacement = { displacement_temp(0), displacement_temp(1), displacement_temp(2) };
+  return displacement;
+}
+
+template <typename GT>
+void compute_representative_point(const Eigen::Matrix<typename GT::FT, 4, 4>& quadric,
+                                  typename GT::Point_3& p,
+                                  int& rank_deficiency)
+{
+  // average point
+  typename GT::Vector_3 displacement = compute_displacement<GT>(quadric, p, rank_deficiency);
+  p = p + displacement;
+}
+
+template <typename GT>
+struct QEMClusterData
+{
+  typename GT::Vector_3 site_sum;
+  typename GT::FT weight_sum;
+  Eigen::Matrix<typename GT::FT, 4, 4> quadric_sum;
+  typename GT::Vector_3 representative_point_;
+  typename GT::FT energy;
+  bool modified = true;
+  int last_modification_iteration = 0;
+  size_t nb_vertices = 0;
+
+  QEMClusterData() :
+    site_sum(0, 0, 0),
+    weight_sum(0),
+    representative_point_(0, 0, 0),
+    energy(0)
+  {
+    quadric_sum.setZero();
+  }
+
+  void add_vertex(const typename GT::Vector_3& vertex_position,
+                  const typename GT::FT weight,
+                  const Eigen::Matrix<typename GT::FT, 4, 4>& quadric)
+  {
+    this->site_sum += vertex_position * weight;
+    this->weight_sum += weight;
+    this->quadric_sum += quadric;
+    ++this->nb_vertices;
+    this->modified = true;
+  }
+
+  void add_vertex(const typename GT::Point_3& vertex_position,
+                  const typename GT::FT weight,
+                  const Eigen::Matrix<typename GT::FT, 4, 4>& quadric)
+  {
+    add_vertex(vertex_position - ORIGIN, weight, quadric);
+  }
+
+  void remove_vertex(const typename GT::Vector_3& vertex_position,
+                     const typename GT::FT weight,
+                     const Eigen::Matrix<typename GT::FT, 4, 4>& quadric)
+  {
+    this->site_sum -= vertex_position * weight;
+    this->weight_sum -= weight;
+    this->quadric_sum -= quadric;
+    this->nb_vertices--;
+    this->modified=true;
+  }
+
+  void compute_representative(bool qem)
+  {
+    if (this->weight_sum > 0)
+    {
+      if (qem)
+      {
+        int rank_deficiency = 0;
+        typename GT::Point_3 point =  CGAL::ORIGIN + (this->site_sum / this->weight_sum);
+        compute_representative_point<GT>(this->quadric_sum, point, rank_deficiency);
+        this->representative_point_ = { point.x(), point.y(), point.z() };
+      }
+      else
+      {
+        this->representative_point_ = (this->site_sum) / this->weight_sum;
+      }
+    }
+  }
+
+  typename GT::FT compute_energy(bool qem)
+  {
+    if (modified)
+    {
+      if (qem)
+      {
+        compute_representative(qem);
+        auto dot_product = GT().compute_scalar_product_3_object();
+
+        this->energy = (this->representative_point_).squared_length() * this->weight_sum
+                       - 2 * dot_product(this->representative_point_, this->site_sum);
+      }
+      else
+      {
+        this->energy = - (this->site_sum).squared_length() / this->weight_sum;
+      }
+    }
+    return this->energy;
+  }
+
+  typename GT::Point_3 representative_point(bool qem)
+  {
+    if (modified)
+      compute_representative(qem);
+    return ORIGIN + representative_point_;
+  }
+};
+
+#ifndef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+template <class TriangleMesh, class VPCDM, class NamedParameters>
+void upsample_subdivision_property(TriangleMesh& tmesh,
+                                   VPCDM vpcd_map,
+                                   const NamedParameters& np)
+{
+  using GT = typename GetGeomTraits<TriangleMesh, NamedParameters>::type;
+  using vertex_descriptor = typename boost::graph_traits<TriangleMesh>::vertex_descriptor;
+  using halfedge_descriptor = typename boost::graph_traits<TriangleMesh>::halfedge_descriptor;
+
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+  using parameters::is_default_parameter;
+
+  using VPM = typename CGAL::GetVertexPointMap<TriangleMesh, NamedParameters>::type;
+  VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
+                         get_property_map(CGAL::vertex_point, tmesh));
+
+  // unordered_set of old vertices
+  std::unordered_set<vertex_descriptor> old_vertices;
+
+  unsigned int step = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);
+  Linear_mask_3<TriangleMesh,VPM> mask(&tmesh, vpm);
+
+  for (unsigned int i = 0; i < step; ++i)
+  {
+    for (vertex_descriptor vd : vertices(tmesh))
+      old_vertices.insert(vd);
+
+    Subdivision_method_3::internal::PTQ_1step(tmesh, vpm, mask);
+    // interpolate curvature values
+    for (vertex_descriptor vd : vertices(tmesh))
+    {
+      if (old_vertices.find(vd) == old_vertices.end())
+      {
+        Principal_curvatures_and_directions<GT> pcd;
+        pcd.min_curvature = 0;
+        pcd.max_curvature = 0;
+        pcd.min_direction = NULL_VECTOR;
+        pcd.max_direction = NULL_VECTOR;
+        for (halfedge_descriptor hd : halfedges_around_target(vd, tmesh))
+        {
+          vertex_descriptor v1 = source(hd, tmesh);
+          if (old_vertices.find(v1) != old_vertices.end())
+          {
+            Principal_curvatures_and_directions<GT> pcd1 = get(vpcd_map, v1);
+            pcd.min_curvature += pcd1.min_curvature;
+            pcd.max_curvature += pcd1.max_curvature;
+            pcd.min_direction += pcd1.min_direction;
+            pcd.max_direction += pcd1.max_direction;
+          }
+        }
+        pcd.min_curvature = pcd.min_curvature / 2;
+        pcd.max_curvature = pcd.max_curvature / 2;
+        pcd.min_direction = pcd.min_direction / sqrt(pcd.min_direction.squared_length());
+        pcd.max_direction = pcd.max_direction / sqrt(pcd.max_direction.squared_length());
+        put(vpcd_map, vd, pcd);
+      }
+    }
+  }
+}
+#endif
+
+template <typename TriangleMesh,
+          typename NamedParameters = parameters::Default_named_parameters>
+std::pair<std::vector<typename GetGeomTraits<TriangleMesh, NamedParameters>::type::Point_3>,
+          std::vector<std::array<std::size_t, 3> > >
+acvd_impl(TriangleMesh& tmesh,
+          int nb_clusters,
+          const NamedParameters& np = parameters::default_values())
+{
+  using GT = typename GetGeomTraits<TriangleMesh, NamedParameters>::type;
+  using FT = typename GT::FT;
+  using Point_3 = typename GT::Point_3;
+  using Vector_3 = typename GT::Vector_3;
+
+  using Matrix4x4 = typename Eigen::Matrix<FT, 4, 4>;
+
+  using Vertex_position_map = typename GetVertexPointMap<TriangleMesh, NamedParameters>::type;
+
+  using halfedge_descriptor = typename boost::graph_traits<TriangleMesh>::halfedge_descriptor;
+  using edge_descriptor = typename boost::graph_traits<TriangleMesh>::edge_descriptor;
+  using vertex_descriptor = typename boost::graph_traits<TriangleMesh>::vertex_descriptor;
+  using face_descriptor = typename boost::graph_traits<TriangleMesh>::face_descriptor;
+
+  using VertexClusterMap = typename boost::property_map<TriangleMesh, CGAL::dynamic_vertex_property_t<int> >::type;
+  using VertexVisitedMap = typename boost::property_map<TriangleMesh, CGAL::dynamic_vertex_property_t<bool> >::type;
+  using VertexWeightMap = typename boost::property_map<TriangleMesh, CGAL::dynamic_vertex_property_t<FT> >::type;
+  using VertexQuadricMap = typename boost::property_map<TriangleMesh, CGAL::dynamic_vertex_property_t<Matrix4x4> >::type;
+
+#ifndef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+  using Default_principal_map = typename boost::property_map<TriangleMesh, CGAL::dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>> >::type;
+  using Vertex_principal_curvatures_and_directions_map =
+    typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
+                                                 NamedParameters, Default_principal_map>::type ;
+#endif
+
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+  using parameters::is_default_parameter;
+
+  GT gt = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
+  Vertex_position_map vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+                                             get_property_map(CGAL::vertex_point, tmesh));
+
+  // get curvature related parameters
+#ifdef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+  static_assert(is_default_parameter<NamedParameters, internal_np::gradation_factor_t>::value, "gradation_factor option is disabled");
+#endif
+  const FT gradation_factor = choose_parameter(get_parameter(np, internal_np::gradation_factor), 0);
+
+  // using QEM ?
+  bool use_postprocessing_qem = choose_parameter(get_parameter(np, internal_np::use_postprocessing_qem), false);
+  const bool use_qem_based_energy = choose_parameter(get_parameter(np, internal_np::use_qem_based_energy), false);
+  if (use_qem_based_energy)
+    use_postprocessing_qem = false;
+
+#ifndef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+  Vertex_principal_curvatures_and_directions_map vpcd_map;
+
+  // if adaptive clustering
+  if (gradation_factor > 0)
+  {
+    if constexpr (is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_map_t>::value)
+    {
+      vpcd_map = get(CGAL::dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), tmesh);
+      interpolated_corrected_curvatures(tmesh, parameters::vertex_principal_curvatures_and_directions_map(vpcd_map)
+                                                          .vertex_point_map(vpm).geom_traits(gt));
+    }
+    else
+      vpcd_map = get_parameter(np, internal_np::vertex_principal_curvatures_and_directions_map);
+  }
+#endif
+
+  CGAL_precondition(CGAL::is_triangle_mesh(tmesh));
+
+  const double vertex_count_ratio = choose_parameter(get_parameter(np, internal_np::vertex_count_ratio), 0.1);
+  // TODO: (possible optimization to save memory) if qem is not used use std::conditionnal to store and compute less things in QEMClusterData
+  // TODO: (possible optimization to save memort) use a std::array to store quadrics and assemble the Eigen matric only at the end
+
+  std::size_t nb_vertices = vertices(tmesh).size();
+
+  // For remeshing, we might need to subdivide the mesh before clustering
+  // This should always hold: nb_clusters <= nb_vertices * vertex_count_ratio
+  // So do the following until the condition is met
+  if (gradation_factor == 0 && nb_clusters > nb_vertices * vertex_count_ratio)
+  {
+    std::vector<FT> lengths;
+    lengths.reserve(num_edges(tmesh));
+    FT cum = 0;
+    int nbe = 0;
+    for (edge_descriptor e : edges(tmesh))
+    {
+      lengths.push_back(edge_length(halfedge(e, tmesh), tmesh, parameters::vertex_point_map(vpm).geom_traits(gt)));
+      cum += lengths.back();
+      ++nbe;
+    }
+    FT threshold = 3. * cum / nbe;
+
+    std::vector<edge_descriptor> to_split;
+    int ei = -1;
+    for (edge_descriptor e : edges(tmesh))
+    {
+      FT l = lengths[++ei];
+      if (l >= threshold)
+      {
+        to_split.emplace_back(e);
+      }
+    }
+
+    auto el = [&gt, &vpm, &tmesh](halfedge_descriptor h)
+    {
+      return edge_length(h, tmesh, parameters::vertex_point_map(vpm).geom_traits(gt));
+    };
+
+    while (!to_split.empty())
+    {
+      std::vector<edge_descriptor> to_split_new;
+      to_split_new.reserve(3*to_split.size()); // upper bound
+      for (edge_descriptor e : to_split)
+      {
+        halfedge_descriptor h = halfedge(e, tmesh);
+        Point_3 s = get(vpm, source(h,tmesh));
+        Point_3 t = get(vpm, target(h,tmesh));
+
+        // the new halfedge hnew pointing to the inserted vertex.
+        // The new halfedge is followed by the old halfedge, i.e., next(hnew,g) == h.
+        halfedge_descriptor hnew = Euler::split_edge(h, tmesh);
+
+        put(vpm, target(hnew, tmesh), midpoint(s,t));
+        for (halfedge_descriptor hhh : {hnew, opposite(h, tmesh)})
+        {
+          if (!is_border(hhh, tmesh))
+          {
+            halfedge_descriptor hf = Euler::split_face(hhh, next(next(hhh, tmesh), tmesh), tmesh);
+            if (el(hf) >= threshold)
+              to_split_new.emplace_back(edge(hf,tmesh));
+          }
+        }
+        if (el(hnew) >= threshold)
+        {
+          to_split_new.push_back(edge(h, tmesh));
+          to_split_new.push_back(edge(hnew, tmesh));
+        }
+      }
+      to_split.swap(to_split_new);
+    }
+    nb_vertices = vertices(tmesh).size();
+  }
+
+  while (nb_clusters > nb_vertices * vertex_count_ratio)
+  {
+    FT curr_factor = nb_clusters / (nb_vertices * vertex_count_ratio);
+    int subdivide_steps = (std::max)((int)ceil(log(curr_factor) / log(4)), 0);
+
+    if (subdivide_steps > 0)
+    {
+      if (gradation_factor == 0) // no adaptive clustering
+      {
+        Subdivision_method_3::Loop_subdivision(tmesh, CGAL::parameters::number_of_iterations(subdivide_steps)
+                                                                       .do_not_modify_geometry(true)
+                                                                       .vertex_point_map(vpm)
+                                                                       .geom_traits(gt));
+      }
+#ifndef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+      else // adaptive clustering
+      {
+        upsample_subdivision_property(tmesh, vpcd_map,
+                                      CGAL::parameters::number_of_iterations(subdivide_steps)
+                                                       .vertex_principal_curvatures_and_directions_map(vpcd_map)
+                                                       .vertex_point_map(vpm)
+                                                       .geom_traits(gt));
+      }
+#endif
+      vpm = get_property_map(CGAL::vertex_point, tmesh);
+      nb_vertices = vertices(tmesh).size();
+    }
+  }
+
+  // creating needed property maps
+  VertexClusterMap vertex_cluster_pmap = get(CGAL::dynamic_vertex_property_t<int>(), tmesh, -1);
+  VertexWeightMap vertex_weight_pmap = get(CGAL::dynamic_vertex_property_t<FT>(), tmesh, FT(0));
+  Matrix4x4 zero_mat;
+  zero_mat.setZero();
+  VertexQuadricMap vertex_quadric_pmap = get(CGAL::dynamic_vertex_property_t<Matrix4x4>(), tmesh, zero_mat);
+
+  std::vector<QEMClusterData<GT>> clusters(nb_clusters);
+  std::queue<halfedge_descriptor> clusters_edges_active;
+  std::queue<halfedge_descriptor> clusters_edges_new;
+
+  // compute vertex weights (dual area), and quadrics
+  FT weight_avg = 0;
+  for (face_descriptor fd : faces(tmesh))
+  {
+    FT weight = abs(face_area(fd, tmesh, parameters::vertex_point_map(vpm)
+                                                    .geom_traits(gt))) / 3;
+
+    // get points of the face
+    halfedge_descriptor hd = halfedge(fd, tmesh);
+    Point_3 pi = get(vpm, source(hd, tmesh));
+    Vector_3 vp1(pi.x(), pi.y(), pi.z());
+    hd = next(hd, tmesh);
+    Point_3 pj = get(vpm, source(hd, tmesh));
+    Vector_3 vp2(pj.x(), pj.y(), pj.z());
+    hd = next(hd, tmesh);
+    Point_3 pk = get(vpm, source(hd, tmesh));
+    Vector_3 vp3 = pk - ORIGIN;
+
+    // compute quadric for the face
+    Matrix4x4 face_quadric;
+    if (use_qem_based_energy)
+      compute_qem_face<GT>(vp1, vp2, vp3, face_quadric, gt);
+
+    for (vertex_descriptor vd : vertices_around_face(halfedge(fd, tmesh), tmesh))
+    {
+      FT vertex_weight = get(vertex_weight_pmap, vd);
+
+      if (gradation_factor == 0) // no adaptive clustering
+        vertex_weight += weight;
+#ifndef CGAL_ACVD_DOES_NOT_USE_INTERPOLATED_CORRECTED_CURVATURES
+      else // adaptive clustering
+      {
+        FT k1 = get(vpcd_map, vd).min_curvature;
+        FT k2 = get(vpcd_map, vd).max_curvature;
+        FT k_sq = (k1 * k1 + k2 * k2);
+        vertex_weight += weight * pow(k_sq, gradation_factor / 2.0);  // /2.0 because k_sq is squared
+      }
+#endif
+      weight_avg += vertex_weight;
+      put(vertex_weight_pmap, vd, vertex_weight);
+
+      if (use_qem_based_energy)
+      {
+        Matrix4x4 vertex_quadric = get(vertex_quadric_pmap, vd);
+        vertex_quadric += face_quadric;
+        put(vertex_quadric_pmap, vd, vertex_quadric);
+      }
+    }
+  }
+  weight_avg /= nb_vertices;
+
+  // clamp the weights up and below by a ratio (like 10,000) * avg_weights
+  for (vertex_descriptor vd : vertices(tmesh))
+  {
+    FT vertex_weight = get(vertex_weight_pmap, vd);
+    if (vertex_weight > CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD * weight_avg)
+      put(vertex_weight_pmap, vd, CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD * weight_avg);
+    else if (vertex_weight < 1.0 / CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD * weight_avg)
+      put(vertex_weight_pmap, vd, 1.0 / CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD * weight_avg);
+  }
+
+  Random rnd = is_default_parameter<NamedParameters, internal_np::random_seed_t>::value
+             ? get_default_random()
+             : CGAL::Random(choose_parameter(get_parameter(np, internal_np::random_seed),0));
+
+  // randomly initialize clusters
+  //TODO: (possible optimization) use std::lower_bound with vertex_weight_pmap for better sampling
+  static constexpr bool is_rand_access =
+    std::is_same_v<typename std::iterator_traits<decltype(vertices(tmesh).begin())>::iterator_category,
+                   std::random_access_iterator_tag>;
+
+  std::vector<vertex_descriptor> cluster_vertices;
+  cluster_vertices.reserve(nb_clusters);
+  if constexpr (is_rand_access)
+  {
+    for (int ci = 0; ci < nb_clusters; ++ci)
+    {
+      int vi;
+      vertex_descriptor vd;
+      do {
+        vi = rnd.get_int(0, nb_vertices);
+        vd = *std::next(vertices(tmesh).begin(), vi);
+      } while (get(vertex_cluster_pmap, vd) != -1);
+
+      cluster_vertices.push_back(vd);
+      put(vertex_cluster_pmap, vd, ci);
+    }
+  }
+  else
+  {
+    std::vector<vertex_descriptor> verts;
+    verts.reserve(num_vertices(tmesh));
+    verts.assign(vertices(tmesh).begin(), vertices(tmesh).end());
+
+    for (int ci = 0; ci < nb_clusters; ++ci)
+    {
+      vertex_descriptor vd;
+      do {
+          vd = verts[rnd.get_int(0, nb_vertices)];
+      } while (get(vertex_cluster_pmap, vd) != -1);
+
+      cluster_vertices.push_back(vd);
+      put(vertex_cluster_pmap, vd, ci);
+    }
+  }
+
+  for (int ci = 0; ci < nb_clusters; ++ci)
+  {
+    vertex_descriptor vd=cluster_vertices[ci];
+    Point_3 vp = get(vpm, vd);
+    Vector_3 vpv = vp - ORIGIN;
+    clusters[ci].add_vertex(vpv, get(vertex_weight_pmap, vd), get(vertex_quadric_pmap, vd));
+
+    for (halfedge_descriptor hd : halfedges_around_source(vd, tmesh))
+      clusters_edges_active.push(hd);
+  }
+
+  // the energy minimization loop (clustering loop)
+  int nb_modifications = 0;
+  int nb_disconnected = 0;
+
+  // Turned on once nb_modifications < nb_vertices * CGAL_TO_QEM_MODIFICATION_THRESHOLD
+  bool qem_energy_minimization = false;
+  int nb_loops = 0;
+
+  QEMClusterData<GT> cluster1_v1_to_c2, cluster2_v1_to_c2, cluster1_v2_to_c1, cluster2_v2_to_c1;
+  std::vector<bool> frozen_clusters(nb_clusters, false);
+  do
+  {
+    do
+    {
+      // reset cluster data
+      for (int ci=0; ci<nb_clusters; ++ci)
+        if (!frozen_clusters[ci])
+          clusters[ci] = QEMClusterData<GT>();
+
+      for (vertex_descriptor v : vertices(tmesh))
+      {
+        FT v_weight = get(vertex_weight_pmap, v);
+        Matrix4x4 v_qem = get(vertex_quadric_pmap, v);
+        int cluster_id = get(vertex_cluster_pmap, v );
+        if (cluster_id != -1 && !frozen_clusters[cluster_id])
+          clusters[cluster_id].add_vertex(get(vpm, v), v_weight, v_qem);
+      }
+
+      CGAL_assertion_code(for (int ci=0; ci<nb_clusters; ++ci))
+      CGAL_assertion(clusters[ci].nb_vertices != 0);
+
+      int nb_iterations = -1;
+      nb_disconnected = 0;
+
+      auto edge_seen = get(CGAL::dynamic_edge_property_t<int>(), tmesh, -1);
+      do
+      {
+        ++nb_iterations;
+        nb_modifications = 0;
+
+        while (!clusters_edges_active.empty())
+        {
+          halfedge_descriptor hi = clusters_edges_active.front();
+          clusters_edges_active.pop();
+
+          if (get(edge_seen, edge(hi, tmesh)) == nb_iterations)
+            continue;
+          put(edge_seen, edge(hi, tmesh), nb_iterations);
+
+          vertex_descriptor v1 = source(hi, tmesh);
+          vertex_descriptor v2 = target(hi, tmesh);
+
+          // add all halfedges around v1 except hi to the queue
+          auto push_vertex_edge_ring_to_queue = [&](vertex_descriptor v)
+          {
+            for (halfedge_descriptor hd : halfedges_around_source(v, tmesh))
+              clusters_edges_new.push(hd);
+          };
+
+          int c1 = get(vertex_cluster_pmap, v1);
+          int c2 = get(vertex_cluster_pmap, v2);
+
+          if ((c1 != -1 && frozen_clusters[c1]) || (c2 != -1 && frozen_clusters[c2]))
+          {
+            clusters_edges_new.push(hi);
+            continue;
+          }
+
+          if (c1 == c2)
+            continue;
+
+          if (c1 == -1)
+          {
+            // expand cluster c2 (add v1 to c2)
+            put(vertex_cluster_pmap, v1, c2);
+            Point_3 vp1 = get(vpm, v1);
+            Vector_3 vpv(vp1.x(), vp1.y(), vp1.z());
+            clusters[c2].add_vertex(vpv, get(vertex_weight_pmap, v1), get(vertex_quadric_pmap, v1));
+            clusters[c2].last_modification_iteration = nb_iterations;
+            push_vertex_edge_ring_to_queue(v1);
+            ++nb_modifications;
+          }
+          else if (c2 == -1)
+          {
+            // expand cluster c1 (add v2 to c1)
+            put(vertex_cluster_pmap, v2, c1);
+            Point_3 vp2 = get(vpm, v2);
+            Vector_3 vpv(vp2.x(), vp2.y(), vp2.z());
+            clusters[c1].add_vertex(vpv, get(vertex_weight_pmap, v2), get(vertex_quadric_pmap, v2));
+            clusters[c1].last_modification_iteration = nb_iterations;
+            push_vertex_edge_ring_to_queue(v2);
+            ++nb_modifications;
+          }
+          else
+          {
+            if ( ( clusters[ c1 ].last_modification_iteration < nb_iterations - 1 ) &&
+                 ( clusters[ c2 ].last_modification_iteration < nb_iterations - 1 ) )
+            {
+              clusters_edges_new.push(hi);
+              continue;
+            }
+
+            // topological test to avoid creating disconnected clusters
+            auto is_topologically_valid_merge = [&](halfedge_descriptor hv, int cluster_id)
+            {
+              CGAL_assertion(get(vertex_cluster_pmap,target(hv, tmesh)) == cluster_id);
+
+              halfedge_descriptor h = hv;
+              bool in_cluster = false;
+              int nb_cc_cluster = 0;
+              do
+              {
+                h = next(h, tmesh);
+
+                int ci = get(vertex_cluster_pmap, target(h,tmesh));
+                if (in_cluster)
+                {
+                  if (ci != cluster_id)
+                    in_cluster=false;
+                }
+                else
+                {
+                  if (ci == cluster_id)
+                  {
+                    in_cluster = true;
+                    if (++nb_cc_cluster > 1)
+                      return false;
+                  }
+                }
+                h = opposite(h, tmesh);
+              }
+              while(h != hv);
+
+              return true;
+            };
+
+            // compare the energy of the 3 cases
+            Point_3 vp1 = get(vpm, v1);
+            Vector_3 vpv1(vp1.x(), vp1.y(), vp1.z());
+            Point_3 vp2 = get(vpm, v2);
+            Vector_3 vpv2(vp2.x(), vp2.y(), vp2.z());
+            FT v1_weight = get(vertex_weight_pmap, v1);
+            FT v2_weight = get(vertex_weight_pmap, v2);
+            Matrix4x4 v1_qem = get (vertex_quadric_pmap, v1);
+            Matrix4x4 v2_qem = get (vertex_quadric_pmap, v2);
+
+            cluster1_v2_to_c1 = clusters[c1];
+            cluster2_v2_to_c1 = clusters[c2];
+            cluster1_v1_to_c2 = clusters[c1];
+            cluster2_v1_to_c2 = clusters[c2];
+            cluster1_v2_to_c1.last_modification_iteration = nb_iterations;
+            cluster2_v2_to_c1.last_modification_iteration = nb_iterations;
+            cluster1_v1_to_c2.last_modification_iteration = nb_iterations;
+            cluster2_v1_to_c2.last_modification_iteration = nb_iterations;
+
+            FT e_no_change = clusters[c1].compute_energy(qem_energy_minimization) +
+                             clusters[c2].compute_energy(qem_energy_minimization);
+            FT e_v1_to_c2 = (std::numeric_limits< double >::max)();
+            FT e_v2_to_c1 = (std::numeric_limits< double >::max)();
+
+            if ( ( clusters[ c1 ].nb_vertices > 1 ) &&
+                 ( !qem_energy_minimization || nb_loops < 2 ||
+                   is_topologically_valid_merge(opposite(hi, tmesh), c1) ) )
+            {
+              cluster1_v1_to_c2.remove_vertex(vpv1, v1_weight, v1_qem);
+              cluster2_v1_to_c2.add_vertex(vpv1, v1_weight, v1_qem);
+              e_v1_to_c2 = cluster1_v1_to_c2.compute_energy(qem_energy_minimization) +
+                           cluster2_v1_to_c2.compute_energy(qem_energy_minimization);
+            }
+
+            if ( ( clusters[ c2 ].nb_vertices > 1 ) &&
+                 ( !qem_energy_minimization || nb_loops < 2 ||
+                   is_topologically_valid_merge(hi, c2) ) )
+            {
+              cluster1_v2_to_c1.add_vertex(vpv2, v2_weight, v2_qem);
+              cluster2_v2_to_c1.remove_vertex(vpv2, v2_weight, v2_qem);
+              e_v2_to_c1 = cluster1_v2_to_c1.compute_energy(qem_energy_minimization) +
+                           cluster2_v2_to_c1.compute_energy(qem_energy_minimization);
+            }
+
+
+            if (e_v2_to_c1 < e_no_change && e_v2_to_c1 < e_v1_to_c2)
+            {
+              // move v2 to c1
+              put(vertex_cluster_pmap, v2, c1);
+              clusters[c1] = cluster1_v2_to_c1;
+              clusters[c2] = cluster2_v2_to_c1;
+              push_vertex_edge_ring_to_queue(v2);
+              ++nb_modifications;
+            }
+            else if (e_v1_to_c2 < e_no_change) // > 2 as 1 vertex was added to c1
+            {
+              // move v1 to c2
+              put(vertex_cluster_pmap, v1, c2);
+              clusters[c1] = cluster1_v1_to_c2;
+              clusters[c2] = cluster2_v1_to_c2;
+              push_vertex_edge_ring_to_queue(v1);
+              ++nb_modifications;
+            }
+            else
+            {
+              // no change
+              clusters_edges_new.push(hi);
+            }
+          }
+        }
+#ifdef CGAL_DEBUG_ACVD
+        std::cout << "# Modifications: " << nb_modifications << "\n";
+#endif
+
+        clusters_edges_active.swap(clusters_edges_new);
+        if (use_qem_based_energy &&
+            nb_modifications < nb_vertices * CGAL_TO_QEM_MODIFICATION_THRESHOLD &&
+            nb_loops < 2)
+        {
+          qem_energy_minimization = true;
+          break;
+        }
+
+      } while (nb_modifications > 0);
+
+      // Disconnected clusters handling
+      // the goal is to delete clusters with multiple connected components and only keep the largest connected component of each cluster
+      // For each cluster, do a BFS from a vertex in the cluster
+
+      std::vector<std::vector<std::vector<vertex_descriptor>>> cluster_components(nb_clusters);
+      std::queue<vertex_descriptor> vertex_queue;
+
+      // loop over vertices to compute cluster components
+      VertexVisitedMap vertex_visited_pmap = get(CGAL::dynamic_vertex_property_t<bool>(), tmesh, false);
+      for (vertex_descriptor vd : vertices(tmesh))
+      {
+        if (get(vertex_visited_pmap, vd))
+          continue;
+
+        int c = get(vertex_cluster_pmap, vd);
+        if (c != -1)
+        {
+          cluster_components[c].emplace_back();
+
+          vertex_queue.push(vd);
+          put(vertex_visited_pmap, vd, true);
+          while (!vertex_queue.empty())
+          {
+            vertex_descriptor v = vertex_queue.front();
+            vertex_queue.pop();
+            cluster_components[c].back().push_back(v);
+
+            for (halfedge_descriptor hd : halfedges_around_source(v, tmesh))
+            {
+              vertex_descriptor v2 = target(hd, tmesh);
+              int c2 = get(vertex_cluster_pmap, v2);
+              if (c2 == c && !get(vertex_visited_pmap, v2))
+              {
+                vertex_queue.push(v2);
+                put(vertex_visited_pmap, v2, true);
+              }
+            }
+          }
+        }
+      }
+
+      // loop over clusters to delete disconnected components except the largest one
+      for (int c = 0; c < nb_clusters; ++c)
+      {
+        if (cluster_components[c].size() <= 1)
+          continue; // only one component, no need to do anything
+
+        ++nb_disconnected;
+        std::size_t max_component_size = 0;
+        std::size_t max_component_index = -1;
+        for (std::size_t component_i = 0; component_i < cluster_components[c].size(); ++component_i)
+        {
+          if (cluster_components[c][component_i].size() > max_component_size)
+          {
+            max_component_size = cluster_components[c][component_i].size();
+            max_component_index = component_i;
+          }
+        }
+
+        // set cluster to -1 for all components except the largest one
+        for (std::size_t component_i = 0; component_i < cluster_components[c].size(); ++component_i)
+        {
+          if (component_i != max_component_index)
+          {
+            for (vertex_descriptor vd : cluster_components[c][component_i])
+            {
+              put(vertex_cluster_pmap, vd, -1);
+              // remove vd from cluster c
+              Point_3 vp = get(vpm, vd);
+              Vector_3 vpv(vp.x(), vp.y(), vp.z());
+              clusters[c].remove_vertex(vpv, get(vertex_weight_pmap, vd), get(vertex_quadric_pmap, vd));
+              // add all halfedges around v except hi to the queue
+              for (halfedge_descriptor hd : halfedges_around_source(vd, tmesh))
+              {
+                // add hd to the queue if its target is not in the same cluster
+                vertex_descriptor v2 = target(hd, tmesh);
+                int c2 = get(vertex_cluster_pmap, v2);
+                if (c2 != c)
+                  clusters_edges_active.push(hd);
+              }
+            }
+          }
+        }
+      }
+
+#ifdef CGAL_DEBUG_ACVD
+      std::cout << "# nb_disconnected: " << nb_disconnected << "\n";
+#endif
+      ++nb_loops;
+
+    } while (nb_disconnected > 0 || nb_loops < 3 );
+
+    // Construct new Mesh
+    std::vector<Point_3> points;
+    points.reserve(clusters.size());
+    std::vector<std::array<std::size_t, 3>> polygons;
+    polygons.reserve(2*clusters.size()-2); // upper bound
+
+    std::vector<std::size_t> valid_cluster_map(nb_clusters, -1);
+    for (int i = 0; i < nb_clusters; ++i)
+    {
+      CGAL_assertion(clusters[i].weight_sum > 0);
+      valid_cluster_map[i] = points.size();
+      points.push_back(clusters[i].representative_point(qem_energy_minimization));
+    }
+
+    if (use_postprocessing_qem)
+    {
+      // create a point for each cluster
+      std::vector<Eigen::Matrix<FT, 4, 4>> cluster_quadrics(clusters.size());
+
+      // initialize quadrics
+      for (int i = 0; i < nb_clusters; ++i)
+        cluster_quadrics[i].setZero();
+
+      for (face_descriptor fd : faces(tmesh))
+      {
+        std::array<Vector_3,3> vecs;
+        std::array<int,3> cids;
+        int i=0;
+        // get Vs for fd
+        // compute qem from Vs->"vector_3"s
+        // add to the 3 indices of the cluster
+        halfedge_descriptor hd = halfedge(fd, tmesh);
+        do {
+          vertex_descriptor vd = target(hd, tmesh);
+          cids[i]=get(vertex_cluster_pmap, vd);
+          if (cids[i]==-1)
+            break;
+          const Point_3& p_i=get(vpm, vd);
+          vecs[i++]=p_i - ORIGIN;
+          hd = next(hd, tmesh);
+        } while (hd != halfedge(fd, tmesh));
+
+        if (i!=3)
+          continue;
+
+        Eigen::Matrix<FT, 4, 4> q;
+        compute_qem_face(vecs[0], vecs[1], vecs[2], q, gt);
+        cluster_quadrics[cids[0]] += q;
+        cluster_quadrics[cids[1]] += q;
+        cluster_quadrics[cids[2]] += q;
+      }
+
+      int valid_index = 0;
+
+      for (int i = 0; i < nb_clusters; ++i)
+      {
+        if (clusters[i].weight_sum > 0)
+        {
+          int rank_deficiency = 0;
+          compute_representative_point<GT>(cluster_quadrics[i], points[valid_index], rank_deficiency);
+          ++valid_index;
+        }
+      }
+    }
+
+    // extract boundary cycles
+    std::vector<halfedge_descriptor> border_hedges;
+    extract_boundary_cycles(tmesh, std::back_inserter(border_hedges));
+
+    // loop over boundary loops
+    for (halfedge_descriptor hd : border_hedges)
+    {
+      halfedge_descriptor hd1 = hd;
+
+      int cb_first = -1;
+
+      do
+      {
+        // 1- get the target and source vertices vt, vs
+        // 2- if the target and source vertices are in different clusters, create a new vertex vb between them vb = (vt + vs) / 2
+        // 3- make a new face with the new vertex vb and the centers of the clusters of vt and vs
+        // 4- also make a new face with vb, the next vb, and the center of the cluster of vt
+
+        vertex_descriptor vt = target(hd1, tmesh);
+        vertex_descriptor vs = source(hd1, tmesh);
+
+        int ct = get(vertex_cluster_pmap, vt);
+        int cs = get(vertex_cluster_pmap, vs);
+
+        if (ct != cs)
+        {
+          Point_3 vt_p = get(vpm, vt);
+          Point_3 vs_p = get(vpm, vs);
+          Vector_3 vt_v(vt_p.x(), vt_p.y(), vt_p.z());
+          Vector_3 vs_v(vs_p.x(), vs_p.y(), vs_p.z());
+
+          Vector_3 vb_v = (vt_v + vs_v) / 2;
+          Point_3 vb_p(vb_v.x(), vb_v.y(), vb_v.z());
+
+          points.push_back(vb_p);
+
+          std::size_t cb = points.size() - 1;
+
+          if (cb_first == -1)
+            cb_first = cb;
+
+          std::size_t ct_mapped = valid_cluster_map[ct], cs_mapped = valid_cluster_map[cs];
+
+          if (ct_mapped != std::size_t(-1) && cs_mapped != std::size_t(-1))
+          {
+            std::array<std::size_t, 3> polygon = {ct_mapped, cb, cs_mapped};
+            polygons.push_back(polygon);
+
+            // after the loop, the last cb+1 should be modified to the first cb
+            polygon = {cb, ct_mapped, cb + 1};
+            polygons.push_back(polygon);
+          }
+        }
+        hd1 = next(hd1, tmesh);
+      } while (hd1 != hd);
+      polygons[polygons.size() - 1][2] = cb_first;
+    }
+
+    // create a triangle for each face with all vertices in 3 different clusters
+    for (face_descriptor fd : faces(tmesh))
+    {
+      halfedge_descriptor hd1 = halfedge(fd, tmesh);
+      vertex_descriptor v1 = source(hd1, tmesh);
+      halfedge_descriptor hd2 = next(hd1, tmesh);
+      vertex_descriptor v2 = source(hd2, tmesh);
+      halfedge_descriptor hd3 = next(hd2, tmesh);
+      vertex_descriptor v3 = source(hd3, tmesh);
+
+      int c1 = get(vertex_cluster_pmap, v1);
+      int c2 = get(vertex_cluster_pmap, v2);
+      int c3 = get(vertex_cluster_pmap, v3);
+
+      if (c1 != c2 && c1 != c3 && c2 != c3)
+      {
+        std::size_t c1_mapped = valid_cluster_map[c1], c2_mapped = valid_cluster_map[c2], c3_mapped = valid_cluster_map[c3];
+        if (c1_mapped !=  std::size_t(-1) && c2_mapped !=  std::size_t(-1) && c3_mapped !=  std::size_t(-1))
+        {
+          std::array<std::size_t,3> polygon = {c1_mapped, c2_mapped, c3_mapped};
+          polygons.push_back(polygon);
+        }
+      }
+    }
+
+#ifdef CGAL_DEBUG_ACVD
+    static int kkk = -1;
+    CGAL::IO::write_polygon_soup("/tmp/soup_" + std::to_string(++kkk) + ".off", points, polygons);
+    dump_mesh_with_cluster_colors(tmesh, vertex_cluster_pmap, "/tmp/cluster_" + std::to_string(kkk) + ".ply");
+#endif
+
+    // detect non-manifold edges in the output
+    std::vector<std::unordered_map<std::size_t, std::size_t> > edge_map(points.size());
+    for (const std::array<std::size_t, 3> & p : polygons)
+    {
+      for (int i=0; i<3; ++i)
+      {
+        std::pair<std::size_t, std::size_t> edge = make_sorted_pair(p[i], p[(i+1)%3]);
+        edge_map[edge.first].emplace(edge.second,0).first->second+=1;
+      }
+    }
+
+    std::vector<std::size_t> nm_clusters;
+    for (std::size_t i=0; i<points.size(); ++i)
+    {
+      for (const auto& [j, size] : edge_map[i] )
+      {
+        if (size > 2)
+        {
+#ifdef CGAL_DEBUG_ACVD
+          std::cout << "non-manifold edge : " << i << " " << j << "\n";
+#endif
+          nm_clusters.push_back(i);
+          nm_clusters.push_back(j);
+        }
+      }
+    }
+
+
+    // detect isolated graph edges
+    for (edge_descriptor ed : edges(tmesh))
+    {
+      int c1 = get(vertex_cluster_pmap, source(ed, tmesh));
+      int c2 = get(vertex_cluster_pmap, target(ed, tmesh));
+#ifdef CGAL_DEBUG_ACVD
+      if (c1 == -1 || c2 == -1)
+        throw std::runtime_error("non assigned vertex");
+#endif
+
+      if (c1 == c2)
+        continue;
+      if (c2 < c1)
+        std::swap(c1, c2);
+
+      if (edge_map[c1].emplace(c2,0).second)
+      {
+#ifdef CGAL_DEBUG_ACVD
+        std::cout << "isolated edge " << c1 << " " << c2 << "\n";
+        std::cout << "   " << kkk << " " <<  points[c1] << " " << points[c2] << "\n";
+#endif
+        nm_clusters.push_back(c1);
+        nm_clusters.push_back(c2);
+      }
+    }
+
+    std::sort(nm_clusters.begin(), nm_clusters.end());
+    nm_clusters.erase(std::unique(nm_clusters.begin(), nm_clusters.end()), nm_clusters.end());
+
+    // detect non-manifold vertices
+    std::vector< std::vector< std::pair<std::size_t, std::size_t> > > link_edges(points.size());
+    for (const std::array<std::size_t, 3>& p : polygons)
+    {
+      for (int i=0; i<3; ++i)
+        link_edges[p[i]].emplace_back(p[(i+1)%3], p[(i+2)%3]);
+    }
+
+    using Graph = boost::adjacency_list <boost::vecS, boost::vecS, boost::undirectedS>;
+    for (std::size_t i=0; i< points.size(); ++i)
+    {
+      if (std::binary_search(nm_clusters.begin(), nm_clusters.end(), i)) continue;
+      std::vector<Graph::vertex_descriptor> descriptors(points.size(), Graph::null_vertex());
+
+      Graph graph;
+      for (const auto& p : link_edges[i])
+      {
+        if (descriptors[p.first] == Graph::null_vertex())
+          descriptors[p.first] = add_vertex(graph);
+        if (descriptors[p.second] == Graph::null_vertex())
+          descriptors[p.second] = add_vertex(graph);
+        add_edge(descriptors[p.first], descriptors[p.second], graph);
+      }
+
+      // TODO: (possible optimisation) add an id to vertices in Graph and use a random acccess pmap
+      std::map<typename Graph::vertex_descriptor, int> the_map;
+
+      if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
+      {
+#ifdef CGAL_DEBUG_ACVD
+        std::cout << "non-manifold vertex " << i << "\n";
+#endif
+        nm_clusters.push_back(i);
+      }
+    }
+
+    if (nm_clusters.empty())
+    {
+      // dump_mesh_with_cluster_colors(tmesh, vertex_cluster_pmap, "/tmp/debug.ply");
+      // CGAL::IO::write_polygon_soup("/tmp/soup.off", points, polygons);
+
+      return std::make_pair(points, polygons);
+    }
+
+    std::vector<std::size_t> one_ring;
+    for (std::size_t nmi : nm_clusters)
+    {
+      for (const auto& [n, s] : edge_map[nmi] )
+        one_ring.push_back(n);
+    }
+
+    std::set<std::size_t> nm_clusters_picked; // TODO: (possible optimization) use cluster data instead of the set
+
+    for (vertex_descriptor v : vertices(tmesh))
+    {
+      int c = get(vertex_cluster_pmap, v);
+      if (std::binary_search(nm_clusters.begin(), nm_clusters.end(), c))
+      {
+        if (!nm_clusters_picked.insert(c).second)
+          continue;
+
+        if (clusters[c].nb_vertices == 1)
+          continue;
+
+        put(vertex_cluster_pmap, v, clusters.size());
+        CGAL_assertion(get(vertex_cluster_pmap, v) == (int) clusters.size());
+        clusters.emplace_back();
+      }
+
+      if (nm_clusters_picked.size() == nm_clusters.size())
+        break;
+    }
+
+    frozen_clusters = std::vector<bool>(nb_clusters, true);
+    for (std::size_t nmi : nm_clusters)
+      frozen_clusters[nmi] = false;
+    for (std::size_t nmi : one_ring)
+      frozen_clusters[nmi] = false;
+
+    nb_clusters = clusters.size();
+    frozen_clusters.resize(nb_clusters, false);
+    nb_loops = 0;
+    qem_energy_minimization = false;
+
+  } while(true);
+}
+
+
+} // namespace internal
+
+/**
+* \ingroup PkgPolygonMeshProcessingRef
+*
+* performs Approximated Centroidal Voronoi Diagram (ACVD) remeshing on a triangle mesh. The remeshing is either uniform or adaptative.
+* Note that there is no guarantee that the output mesh will have the same topology as the input.
+* See \ref acvdrem for more details on the algorithm. This function requires the \eigen library.
+*
+* @tparam TriangleMesh a model of `FaceListGraph` and `MutableFaceGraph`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @param tmesh triangle mesh to be remeshed
+* @param nb_vertices lower bound on the target number of vertices in the output mesh.
+*                    The requested number of vertices in the output will be respected except if the input mesh is not closed
+*                    (extra vertices will be used on the boundary), or if the number of points is too low
+*                    and no manifold mesh can be produced with that budget of points (extra points are added to get a manifold output).
+* @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below.
+*        `GT` stands for the type of the traits object provided to the named parameter `geom_traits()`.
+*
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
+*     \cgalParamDescription{a property map associating principal curvatures and directions to the vertices of `tmesh`, used for adaptive clustering.}
+*     \cgalParamType{a class model of `ReadWritePropertyMap` with
+*                    `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
+*                    as key type and `Principal_curvatures_and_directions<GT>` as value type.}
+*     \cgalParamDefault{If this parameter is omitted, but `gradation_factor` is provided, an internal property map
+*                       will be created and curvature values will be computed using the function `interpolated_corrected_curvatures()`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{gradation_factor}
+*     \cgalParamDescription{a factor used to gradate the weights of the vertices based on their curvature values.
+*                           The larger the value is, the more the curvature will impact the distribution of output vertices
+*                           on the surface. The original paper recommends the value `1.5`.}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{0}
+*     \cgalParamExtra{If this parameter is omitted, no adaptive clustering will be performed.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{use_postprocessing_qem}
+*     \cgalParamDescription{indicates if a projection step using quadric error metric should be applied to cluster centers at the end of the minimization,
+*                           in order for example to recover sharp features.
+*                           This is a fast method but can result in badly shaped triangles and even self-intersections.}
+*     \cgalParamType{Boolean}
+*     \cgalParamDefault{false}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{use_qem_based_energy}
+*     \cgalParamDescription{indicates if quadric error metric should be applied during the minimization algorithm in order for example to recover sharp features.
+*                           This is slower than using `use_postprocessing_qem(true)`, but it is more accurate.}
+*     \cgalParamType{Boolean}
+*     \cgalParamDefault{false}
+*     \cgalParamExtra{If this parameter is `true` then `use_postprocessing_qem` will be automatically set to `false`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_count_ratio}
+*     \cgalParamDescription{a ratio used to control the subdivision of the input mesh in case it does not have enough vertices compared to `nb_vertices`.
+*                           More precisely, the number of vertices of the input mesh should at least be the ratio times `nb_vertices`.
+*                           If not, the mesh will first be subdivided until the aforementioned criterium is met.}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{0.1}
+*     \cgalParamExtra{A value between 0.1 and 0.01 is recommended, the smaller the better the approximation will be, but it will increase the runtime.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_point_map}
+*       \cgalParamDescription{a property map associating points to the vertices of `tmesh`.}
+*       \cgalParamType{a class model of `ReadWritePropertyMap` with
+*                      `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
+*                      as key type and `GT::Point_3` as value type.}
+*       \cgalParamDefault{`boost::get(CGAL::vertex_point, tmesh)`.}
+*       \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                       `CGAL::vertex_point_t` must be available in `TriangleMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*      \cgalParamDescription{an instance of a geometric traits class.}
+*      \cgalParamType{a class model of `Kernel`, with `GT::FT` being either `float` or `double`.}
+*      \cgalParamDefault{a \cgal Kernel deduced from the vertex point type, using `CGAL::Kernel_traits`.}
+*      \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{random_seed}
+*     \cgalParamDescription{a value to seed the random number generator}
+*     \cgalParamType{unsigned int}
+*     \cgalParamDefault{a value generated with `std::time()`}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @return `true` if `nb_vertices` was sufficiently large for remeshing the input, and `false` if more points were used
+*
+*/
+template <typename TriangleMesh,
+          typename NamedParameters = parameters::Default_named_parameters>
+bool approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh& tmesh,
+                                                       std::size_t nb_vertices,
+                                                       const NamedParameters& np = parameters::default_values())
+{
+  auto ps = internal::acvd_impl(tmesh, nb_vertices, np);
+  CGAL_assertion(is_polygon_soup_a_polygon_mesh(ps.second));
+
+  auto vpm = parameters::choose_parameter(
+                parameters::get_parameter(np, CGAL::vertex_point),
+                get_property_map(CGAL::vertex_point, tmesh));
+
+  remove_all_elements(tmesh);
+  polygon_soup_to_polygon_mesh(ps.first, ps.second, tmesh, parameters::vertex_point_map(vpm));
+  return ps.first.size() == nb_vertices;
+}
+
+} // namespace Polygon_mesh_processing
+} // namespace CGAL
+
+#undef CGAL_WEIGHT_CLAMP_RATIO_THRESHOLD
+#undef CGAL_TO_QEM_MODIFICATION_THRESHOLD
+
+#endif // CGAL_PMP_ACVD_REMESHING_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index e30043961d2..d671018305e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -622,7 +622,7 @@ void interpolated_corrected_curvatures_one_vertex(
   using parameters::get_parameter;
   using parameters::is_default_parameter;
 
-  Vertex_position_map vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+  Vertex_position_map vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
     get_const_property_map(CGAL::vertex_point, pmesh));
 
   Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
@@ -773,7 +773,7 @@ private:
     using parameters::get_parameter;
     using parameters::is_default_parameter;
 
-    vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+    vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
       get_const_property_map(CGAL::vertex_point, pmesh));
 
     vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index c047eeb407e..e0ab99d02bb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -28,6 +28,7 @@
 #include <CGAL/Polygon_mesh_processing/connected_components.h>
 #include <CGAL/Side_of_triangle_mesh.h>
 
+#include <boost/range/has_range_iterator.hpp>
 #include <boost/iterator/function_output_iterator.hpp>
 
 #include <exception>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_polygon_soup.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_polygon_soup.h
index bca94855450..59eb6a87559 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_polygon_soup.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_polygon_soup.h
@@ -48,29 +48,6 @@ namespace Polygon_mesh_processing {
 
 namespace internal {
 
-template <typename PointRange, typename PolygonRange>
-struct Polygon_types
-{
-  typedef typename boost::range_value<PointRange>::type                             Point_3;
-  typedef typename boost::range_value<PolygonRange>::type                           Polygon_3;
-
-  typedef typename boost::range_iterator<Polygon_3>::type                           V_ID_iterator;
-  typedef typename std::iterator_traits<V_ID_iterator>::value_type                  V_ID;
-  typedef typename std::vector<Polygon_3>::size_type                                P_ID;
-};
-
-template <typename PointRange, typename PolygonRange, typename NamedParameters>
-struct GetPolygonGeomTraits
-{
-  typedef typename internal_np::Lookup_named_param_def <
-                     internal_np::geom_traits_t,
-                     NamedParameters,
-                     typename CGAL::Kernel_traits<
-                       typename internal::Polygon_types<
-                         PointRange, PolygonRange>::Point_3 >::type
-                   > ::type                                                         type;
-};
-
 template <typename Stream, typename Polygon>
 void print_polygon(Stream& out, const Polygon& polygon)
 {
@@ -171,8 +148,8 @@ std::size_t simplify_polygons_in_polygon_soup(PointRange& points,
                                               PolygonRange& polygons,
                                               const Traits& traits = Traits())
 {
-  typedef typename Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
-  typedef typename Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   std::size_t simplified_polygons_n = 0;
 
@@ -216,9 +193,9 @@ std::size_t split_pinched_polygons_in_polygon_soup(PointRange& points,
                                                    PolygonRange& polygons,
                                                    const Traits& traits = Traits())
 {
-  typedef typename Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
-  typedef typename Polygon_types<PointRange, PolygonRange>::Point_3     Point_3;
-  typedef typename Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Point_3     Point_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   typedef typename Traits::Less_xyz_3                                   Less_xyz_3;
 
@@ -353,7 +330,7 @@ std::size_t remove_invalid_polygons_in_array_polygon_soup(PointRange& points,
                                                           PolygonRange& polygons,
                                                           const Traits& traits = Traits())
 {
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   std::vector<std::size_t> to_remove;
   const std::size_t ini_polygons_size = polygons.size();
@@ -418,8 +395,8 @@ template <typename PointRange, typename PolygonRange>
 std::size_t remove_isolated_points_in_polygon_soup(PointRange& points,
                                                    PolygonRange& polygons)
 {
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   if(points.empty())
     return 0;
@@ -537,14 +514,14 @@ std::size_t merge_duplicate_points_in_polygon_soup(PointRange& points,
                                                    PolygonRange& polygons,
                                                    const NamedParameters& np = parameters::default_values())
 {
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::Point_3     Point_3;
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Point_3     Point_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   using parameters::get_parameter;
   using parameters::choose_parameter;
 
-  typedef typename internal::GetPolygonGeomTraits<PointRange, PolygonRange, NamedParameters>::type Traits;
+  typedef typename GetPolygonGeomTraits<PointRange, PolygonRange, NamedParameters>::type Traits;
   Traits traits = choose_parameter<Traits>(get_parameter(np, internal_np::geom_traits));
 
   typedef typename Traits::Less_xyz_3                                             Less_xyz_3;
@@ -727,7 +704,7 @@ template <typename PointRange, typename PolygonRange>
 struct Polygon_hash
 {
   typedef std::size_t                                                             result_type;
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   Polygon_hash(const PointRange& points, const PolygonRange& canonical_polygons)
     : points(points), canonical_polygons(canonical_polygons)
@@ -754,7 +731,7 @@ template <typename PointRange, typename PolygonRange, typename Reversed_markers,
 struct Polygon_equality_tester
 {
   typedef bool                                                                    result_type;
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3   Polygon_3;
 
   Polygon_equality_tester(const PointRange& points,
                           const PolygonRange& canonical_polygons,
@@ -846,7 +823,7 @@ DuplicateOutputIterator collect_duplicate_polygons(const PointRange& points,
                                                    const Traits& traits = Traits(),
                                                    const bool same_orientation = false)
 {
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::P_ID        P_ID;
 
   typedef internal::Polygon_hash<PointRange, PolygonRange>                        Hasher;
   typedef boost::dynamic_bitset<>                                                 Reversed_markers;
@@ -951,7 +928,7 @@ std::size_t merge_duplicate_polygons_in_polygon_soup(const PointRange& points,
   using parameters::get_parameter;
   using parameters::choose_parameter;
 
-  typedef typename internal::Polygon_types<PointRange, PolygonRange>::P_ID                         P_ID;
+  typedef typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::P_ID                         P_ID;
 
   const bool erase_all_duplicates = choose_parameter(get_parameter(np, internal_np::erase_all_duplicates), false);
   const bool same_orientation = choose_parameter(get_parameter(np, internal_np::require_same_orientation), false);
@@ -961,7 +938,7 @@ std::size_t merge_duplicate_polygons_in_polygon_soup(const PointRange& points,
   std::cout << "Erase all duplicate polygons: " << std::boolalpha << erase_all_duplicates << std::endl;
 #endif
 
-  typedef typename internal::GetPolygonGeomTraits<PointRange, PolygonRange, NamedParameters>::type Traits;
+  typedef typename GetPolygonGeomTraits<PointRange, PolygonRange, NamedParameters>::type Traits;
   Traits traits = choose_parameter<Traits>(get_parameter(np, internal_np::geom_traits));
 
   std::deque<std::vector<P_ID> > all_duplicate_polygons;
@@ -1045,7 +1022,7 @@ std::size_t merge_duplicate_polygons_in_polygon_soup(const PointRange& points,
 namespace internal {
 
 template <typename PointRange, typename PolygonRange,
-          typename Polygon = typename Polygon_types<PointRange, PolygonRange>::Polygon_3>
+          typename Polygon = typename CGAL::internal::Polygon_types<PointRange, PolygonRange>::Polygon_3>
 struct Polygon_soup_fixer
 {
   template <typename NamedParameters>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 145d5a24135..a1604092424 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -112,7 +112,7 @@ struct Allow_all_moves{
 *   \cgalParamNBegin{allow_move_functor}
 *     \cgalParamDescription{A function object used to determinate if a vertex move should be allowed or not}
 *     \cgalParamType{Unary functor that provides `bool operator()(vertex_descriptor v, Point_3 src, Point_3 tgt)` returning `true`
-*                    if the vertex `v` can be moved from `src` to `tgt`; `Point_3` being the value type of the vertex point map }
+*                    if the vertex `v` can be moved from `src` to `tgt`; `%Point_3` being the value type of the vertex point map }
 *     \cgalParamDefault{If not provided, all moves are allowed.}
 *   \cgalParamNEnd
 *
diff --git a/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h b/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h
index 34bbb55a79e..897d8bc9feb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h
+++ b/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h
@@ -176,7 +176,7 @@ private:
     std::array<Point_3,3> triangle;
     std::array<ePoint_3,3> etriangle;
     ePlane_3 eplane;
-    std::array<eLine_3,3> elines;  // the i'th line is opposite to vertex i
+    std::array<eLine_3,3> elines;  // the i-th line is opposite to vertex i
     ePoint_3 n; // triangle[0] offsetted by the triangle normal
   };
 
@@ -995,7 +995,7 @@ private:
       return 0;
     }
     if (o1 * o2 * o3 == 0){
-      return 2; // means we dont know
+      return 2; // means we don't know
     }
     return 1;
   }
@@ -1233,7 +1233,7 @@ private:
             }
             // this was for a fast float check
             if (inter == 2)
-              { //we dont know if point exist or if inside of triangle
+              { //we don't know if point exist or if inside of triangle
                 cut[cutp[i]] = true;
                 cut[cutp[j]] = true;
                 continue;
diff --git a/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h b/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h
index 85f9f4c8f60..4c2c98c12bf 100644
--- a/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h
@@ -141,7 +141,6 @@ public:
 #endif
   {
     CGAL_assertion(CGAL::is_triangle_mesh(tmesh));
-    CGAL_assertion(CGAL::is_closed(tmesh));
     box = Polygon_mesh_processing::bbox(tmesh, parameters::vertex_point_map(vpmap));
   }
 
@@ -171,6 +170,7 @@ public:
                         const GeomTraits& gt = GeomTraits())
   : ray_functor(gt.construct_ray_3_object())
   , vector_functor(gt.construct_vector_3_object())
+  , tm_ptr(nullptr)
   , own_tree(false)
 #ifdef CGAL_HAS_THREADS
   , atomic_tree_ptr(&tree)
@@ -182,9 +182,9 @@ public:
   }
 
   /**
-  * Constructor moving an instance of Side_of_triangle_mesh to a new memory
+  * Constructor moving an instance of `Side_of_triangle_mesh` to a new memory
   * location with minimal memory copy.
-  * @param other The instance to be moved
+  * @param other the instance to be moved
   */
   Side_of_triangle_mesh(Side_of_triangle_mesh&& other)
   {
@@ -202,10 +202,10 @@ public:
 
 public:
   /**
-  * Assign operator moving an instance of Side_of_triangle_mesh to this
+  * Assign operator moving an instance of `Side_of_triangle_mesh` to this
   * location with minimal memory copy.
-  * @param other The instance to be moved
-  * @return A reference to this
+  * @param other the instance to be moved
+  * @return a reference to `this`
   */
   Side_of_triangle_mesh& operator=(Side_of_triangle_mesh&& other)
   {
@@ -233,6 +233,8 @@ public:
    */
   Bounded_side operator()(const Point& point) const
   {
+    CGAL_assertion(tm_ptr == nullptr || CGAL::is_closed(*tm_ptr));
+
     if(point.x() < box.xmin()
        || point.x() > box.xmax()
        || point.y() < box.ymin()
@@ -276,6 +278,8 @@ public:
   template <class K2>
   Bounded_side operator()(const typename K2::Point_3& point, const K2& k2) const
   {
+    CGAL_assertion(tm_ptr == nullptr || CGAL::is_closed(*tm_ptr));
+
     if(point.x() < box.xmin()
        || point.x() > box.xmax()
        || point.y() < box.ymin()
diff --git a/Polygon_mesh_processing/package_info/Polygon_mesh_processing/dependencies b/Polygon_mesh_processing/package_info/Polygon_mesh_processing/dependencies
index f44718e3c9b..31ee94b381a 100644
--- a/Polygon_mesh_processing/package_info/Polygon_mesh_processing/dependencies
+++ b/Polygon_mesh_processing/package_info/Polygon_mesh_processing/dependencies
@@ -31,6 +31,7 @@ Solver_interface
 Spatial_searching
 Spatial_sorting
 Stream_support
+Subdivision_method_3
 TDS_2
 TDS_3
 Triangulation_2
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index eac5a4a6697..08e022aeba8 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -91,6 +91,9 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(test_decimation_of_planar_patches PRIVATE CGAL::Eigen3_support)
   create_single_source_cgal_program("remeshing_quality_test.cpp" )
   target_link_libraries(remeshing_quality_test PRIVATE CGAL::Eigen3_support)
+  create_single_source_cgal_program("test_acvd.cpp" )
+  target_link_libraries(test_acvd PRIVATE CGAL::Eigen3_support)
+
 else()
   message(STATUS "NOTICE: Tests that use the Eigen library will not be compiled.")
 endif()
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_acvd.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_acvd.cpp
new file mode 100644
index 00000000000..bb461c31b9d
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_acvd.cpp
@@ -0,0 +1,65 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polyhedron_3.h>
+
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/subdivision_method_3.h>
+
+#include <iostream>
+#include <filesystem>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Surface_mesh = CGAL::Surface_mesh<K::Point_3>;
+using Polyhedron = CGAL::Polyhedron_3<K>;
+
+namespace params = CGAL::parameters;
+
+template <class Mesh>
+void run_test(std::string fname, std::size_t genus, bool subdiv)
+{
+  Mesh mesh;
+  CGAL::IO::read_polygon_mesh(fname, mesh);
+
+  PMP::triangulate_faces(mesh);
+  if (subdiv)
+    CGAL::Subdivision_method_3::Loop_subdivision(mesh, params::number_of_iterations(5));
+
+  Mesh ref=mesh;
+  CGAL::Bbox_3 bb_ref = PMP::bbox(ref);
+
+  PMP::approximated_centroidal_Voronoi_diagram_remeshing(mesh, 1000);
+
+  CGAL::Bbox_3 bb = PMP::bbox(ref);
+
+  assert(-(vertices(mesh).size()-edges(mesh).size()+faces(mesh).size()-2)/2==genus);
+  assert(vertices(mesh).size()>=1000);
+
+  double dx = bb.xmax()-bb.xmin(),
+         dy = bb.ymax()-bb.ymin(),
+         dz = bb.zmax()-bb.zmin();
+
+  assert(std::abs(bb.xmax()-bb_ref.xmax()) < 0.01 * dx);
+  assert(std::abs(bb.ymax()-bb_ref.ymax()) < 0.01 * dy);
+  assert(std::abs(bb.zmax()-bb_ref.zmax()) < 0.01 * dz);
+
+  PMP::approximated_centroidal_Voronoi_diagram_remeshing(mesh, 4);
+  assert(-(vertices(mesh).size()-edges(mesh).size()+faces(mesh).size()-2)/2==genus);
+}
+
+int main()
+{
+  run_test<Surface_mesh>(CGAL::data_file_path("meshes/tetrahedron.off"), 0, true);
+  run_test<Surface_mesh>(CGAL::data_file_path("meshes/tetrahedron.off"), 0, false);
+  run_test<Polyhedron>(CGAL::data_file_path("meshes/torus_quad.off"), 1, true);
+  run_test<Polyhedron>(CGAL::data_file_path("meshes/torus_quad.off"), 1, false);
+  run_test<Surface_mesh>(CGAL::data_file_path("meshes/double-torus-example.off"), 2, true);
+  run_test<Surface_mesh>(CGAL::data_file_path("meshes/double-torus-example.off"), 2, false);
+
+  return 0;
+}
+
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp
index 5b87e5dff42..e80dfe8951a 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp
@@ -241,11 +241,11 @@ void test_triangulate_refine_and_fair_hole(const std::string file_name) {
 }
 
 template <class Polyhedron>
-void test_ouput_iterators_triangulate_hole(const std::string file_name) {
+void test_output_iterators_triangulate_hole(const std::string file_name) {
   typedef typename boost::graph_traits<Polyhedron>::halfedge_descriptor Halfedge_handle;
   typedef typename boost::graph_traits<Polyhedron>::face_descriptor Facet_handle;
 
-  std::cout << "test_ouput_iterators_triangulate_hole:" << std::endl;
+  std::cout << "test_output_iterators_triangulate_hole:" << std::endl;
   std::cout << "  File: "<< file_name  << std::endl;
 
   Polyhedron poly, poly_2;
@@ -273,11 +273,11 @@ void test_ouput_iterators_triangulate_hole(const std::string file_name) {
 }
 
 template <class Polyhedron>
-void test_ouput_iterators_triangulate_and_refine_hole(const std::string file_name) {
+void test_output_iterators_triangulate_and_refine_hole(const std::string file_name) {
   typedef typename boost::graph_traits<Polyhedron>::halfedge_descriptor Halfedge_handle;
   typedef typename boost::graph_traits<Polyhedron>::face_descriptor Facet_handle;
   typedef typename boost::graph_traits<Polyhedron>::vertex_descriptor        Vertex_handle;
-  std::cout << "test_ouput_iterators_triangulate_and_refine_hole:" << std::endl;
+  std::cout << "test_output_iterators_triangulate_and_refine_hole:" << std::endl;
   std::cout << "  File: "<< file_name  << std::endl;
 
   Polyhedron poly, poly_2;
@@ -403,8 +403,8 @@ typedef CGAL::Surface_mesh<typename Kernel::Point_3> Polyhedron;
     test_triangulate_hole<Polyhedron>(it->c_str());
     test_triangulate_and_refine_hole<Polyhedron>(it->c_str());
     test_triangulate_refine_and_fair_hole<Polyhedron>(it->c_str());
-    test_ouput_iterators_triangulate_and_refine_hole<Polyhedron>(it->c_str());
-    test_ouput_iterators_triangulate_hole<Polyhedron>(it->c_str());
+    test_output_iterators_triangulate_and_refine_hole<Polyhedron>(it->c_str());
+    test_output_iterators_triangulate_hole<Polyhedron>(it->c_str());
     test_triangulate_hole_weight<Polyhedron>(it->c_str(), 0);
     std::cout << std::endl;
   }
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp
index d2c69c01591..39d36a4f29c 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp
@@ -248,8 +248,8 @@ void test_triangulate_refine_and_fair_hole(const std::string file_name, bool use
   std::cout << "  Done!" << std::endl;
 }
 
-void test_ouput_iterators_triangulate_hole(const std::string file_name, bool use_cdt) {
-  std::cout << "test_ouput_iterators_triangulate_hole:" << std::endl;
+void test_output_iterators_triangulate_hole(const std::string file_name, bool use_cdt) {
+  std::cout << "test_output_iterators_triangulate_hole:" << std::endl;
   std::cout << "  File: "<< file_name  << std::endl;
 
   Polyhedron poly, poly_2;
@@ -280,8 +280,8 @@ void test_ouput_iterators_triangulate_hole(const std::string file_name, bool use
   std::cout << "  Done!" << std::endl;
 }
 
-void test_ouput_iterators_triangulate_and_refine_hole(const std::string file_name, bool use_cdt) {
-  std::cout << "test_ouput_iterators_triangulate_and_refine_hole:" << std::endl;
+void test_output_iterators_triangulate_and_refine_hole(const std::string file_name, bool use_cdt) {
+  std::cout << "test_output_iterators_triangulate_and_refine_hole:" << std::endl;
   std::cout << "  File: "<< file_name  << std::endl;
 
   Polyhedron poly, poly_2;
@@ -407,10 +407,10 @@ int main()
     test_triangulate_and_refine_hole(it->c_str(), false);
     test_triangulate_refine_and_fair_hole(it->c_str(), true);
     test_triangulate_refine_and_fair_hole(it->c_str(), false);
-    test_ouput_iterators_triangulate_and_refine_hole(it->c_str(), true);
-    test_ouput_iterators_triangulate_and_refine_hole(it->c_str(), false);
-    test_ouput_iterators_triangulate_hole(it->c_str(), true);
-    test_ouput_iterators_triangulate_hole(it->c_str(), false);
+    test_output_iterators_triangulate_and_refine_hole(it->c_str(), true);
+    test_output_iterators_triangulate_and_refine_hole(it->c_str(), false);
+    test_output_iterators_triangulate_hole(it->c_str(), true);
+    test_output_iterators_triangulate_hole(it->c_str(), false);
     test_triangulate_hole_weight(it->c_str(), true, 0);
     test_triangulate_hole_weight(it->c_str(), false, 0);
     std::cout << "------------------------------------------------" << std::endl;
diff --git a/Property_map/include/CGAL/property_map.h b/Property_map/include/CGAL/property_map.h
index 1154ab87b42..e9868ef6e07 100644
--- a/Property_map/include/CGAL/property_map.h
+++ b/Property_map/include/CGAL/property_map.h
@@ -725,7 +725,7 @@ make_cartesian_converter_property_map(Vpm vpm)
 
 /// \ingroup PkgPropertyMapRef
 /// A property map with `std::size_t` as key-type that can be used
-/// to access the i'th element in a container with random access.
+/// to access the i-th element in a container with random access.
 /// \cgalModels{LvaluePropertyMap constness being than of `Container`.}
 template<typename Container>
 class Random_access_property_map
diff --git a/SMDS_3/doc/SMDS_3/SMDS_3.txt b/SMDS_3/doc/SMDS_3/SMDS_3.txt
index 7fcd35d7336..dff08599e10 100644
--- a/SMDS_3/doc/SMDS_3/SMDS_3.txt
+++ b/SMDS_3/doc/SMDS_3/SMDS_3.txt
@@ -34,7 +34,7 @@ of the support 3D triangulation, per dimension from 0 to 3:
 - corner vertices (0D),
 - feature edges (1D),
 - surface facets (2D),
-- domain cells (3D). See Figure \cgalFigureRef{figure_c3t3_cells}.
+- domain cells (3D). See \cgalFigureRef{figure_c3t3_cells}.
 
 The concept `MeshComplex_3InTriangulation_3` is a data structure devised to
 represent these three-dimensional complexes embedded in a `Triangulation_3`.
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Uncertain.h b/STL_Extension/doc/STL_Extension/CGAL/Uncertain.h
index bc3f39d92b5..0dfa921bdb0 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Uncertain.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Uncertain.h
@@ -500,7 +500,7 @@ Uncertain<T> operator-(Uncertain<T> u);
 returns the extension of the `enum_cast<T>` function over `u`.
 */
 template <class T, class U>
-Uncertain<T> enum_cast(Uncertain<U> u);
+T enum_cast(Uncertain<U> u);
 
 /// @}
 
diff --git a/STL_Extension/include/CGAL/Container_helper.h b/STL_Extension/include/CGAL/Container_helper.h
index 18a98dfa456..9c12ed2a8d8 100644
--- a/STL_Extension/include/CGAL/Container_helper.h
+++ b/STL_Extension/include/CGAL/Container_helper.h
@@ -18,8 +18,9 @@
 #include <CGAL/assertions.h>
 #include <boost/mpl/logical.hpp>
 
+#include <array>
 #include <cstddef>
-#include<type_traits>
+#include <type_traits>
 
 namespace CGAL {
 namespace internal {
@@ -29,24 +30,24 @@ CGAL_GENERATE_MEMBER_DETECTOR(resize);
 
 // Typical container
 template <class Container>
-void resize(Container& c, std::size_t size,
+void resize(Container& c,
+            const std::size_t size,
             std::enable_if_t<has_resize<Container>::value>* = nullptr)
 {
   c.resize(size);
 }
 
-// Container without a resize() function, but with a size() function (e.g. an array)
-template <class Container>
-void resize(Container& CGAL_assertion_code(array), std::size_t CGAL_assertion_code(size),
-            std::enable_if_t<!has_resize<Container>::value &&
-                              has_size<Container>::value >* = nullptr)
+template <class T, std::size_t s>
+void resize(const std::array<T, s>& CGAL_assertion_code(array),
+            const std::size_t CGAL_assertion_code(size))
 {
   CGAL_assertion(array.size() == size);
 }
 
 // A class with neither resize() nor size(), can't enforce size (it better be correct!)
 template <class Container>
-void resize(Container&, std::size_t,
+void resize(const Container&,
+            const std::size_t,
             std::enable_if_t<
               !(has_resize<Container>::value ||
                 has_size<Container>::value)>* = nullptr)
@@ -59,7 +60,8 @@ CGAL_GENERATE_MEMBER_DETECTOR(reserve);
 
 // Container with 'reserve'
 template <class Container>
-void reserve(Container& c, std::size_t size,
+void reserve(Container& c,
+             const std::size_t size,
              std::enable_if_t<has_reserve<Container>::value>* = nullptr)
 {
   c.reserve(size);
@@ -67,7 +69,8 @@ void reserve(Container& c, std::size_t size,
 
 // Container with no 'reserve'
 template <class Container>
-void reserve(Container&, std::size_t,
+void reserve(const Container&,
+             const std::size_t,
              std::enable_if_t<!has_reserve<Container>::value>* = nullptr)
 {
 }
diff --git a/STL_Extension/include/CGAL/Iterator_project.h b/STL_Extension/include/CGAL/Iterator_project.h
index 2a0627201d0..fe166dea6bc 100644
--- a/STL_Extension/include/CGAL/Iterator_project.h
+++ b/STL_Extension/include/CGAL/Iterator_project.h
@@ -19,6 +19,7 @@
 #ifndef CGAL_ITERATOR_PROJECT_H
 #define CGAL_ITERATOR_PROJECT_H 1
 
+#include <CGAL/config.h>
 #include <iterator>
 
 namespace CGAL {
@@ -137,13 +138,20 @@ public:
     return tmp += -n;
   }
 
-  template <typename It>
+#if defined(BOOST_MSVC)
+  difference_type operator- (const Self& i) const {
+    return nt - i.nt;
+  }
+#else
+
+template <typename It>
   std::enable_if_t<std::is_convertible_v<iterator_category, std::random_access_iterator_tag>
                    && std::is_convertible_v<const It&, const Self&>,
                    difference_type>
-  operator-( const It& i) const {
+  operator- (const It& i) const {
     return nt - i.nt;
   }
+#endif
 
   reference operator[]( difference_type n) const {
     Self tmp = *this;
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 50c7c71c3a5..305527636c1 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -28,6 +28,7 @@ CGAL_add_named_parameter(use_binary_mode_t, use_binary_mode, use_binary_mode)
 CGAL_add_named_parameter(metis_options_t, METIS_options, METIS_options)
 CGAL_add_named_parameter(vertex_partition_id_t, vertex_partition_id, vertex_partition_id_map)
 CGAL_add_named_parameter(face_partition_id_t, face_partition_id, face_partition_id_map)
+CGAL_add_named_parameter(edge_weight_t, edge_weight, edge_weight_map)
 
 CGAL_add_named_parameter(vertex_output_iterator_t, vertex_output_iterator, vertex_output_iterator)
 CGAL_add_named_parameter(face_output_iterator_t, face_output_iterator, face_output_iterator)
@@ -101,6 +102,10 @@ CGAL_add_named_parameter(vertex_mean_curvature_t, vertex_mean_curvature, vertex_
 CGAL_add_named_parameter(vertex_Gaussian_curvature_t, vertex_Gaussian_curvature, vertex_Gaussian_curvature)
 CGAL_add_named_parameter(vertex_principal_curvatures_and_directions_t, vertex_principal_curvatures_and_directions, vertex_principal_curvatures_and_directions)
 CGAL_add_named_parameter(ball_radius_t, ball_radius, ball_radius)
+CGAL_add_named_parameter(gradation_factor_t, gradation_factor, gradation_factor)
+CGAL_add_named_parameter(use_postprocessing_qem_t, use_postprocessing_qem, use_postprocessing_qem)
+CGAL_add_named_parameter(use_qem_based_energy_t, use_qem_based_energy, use_qem_based_energy)
+CGAL_add_named_parameter(vertex_count_ratio_t, vertex_count_ratio, vertex_count_ratio)
 CGAL_add_named_parameter(outward_orientation_t, outward_orientation, outward_orientation)
 CGAL_add_named_parameter(overlap_test_t, overlap_test, do_overlap_test_of_bounded_sides)
 CGAL_add_named_parameter(preserve_genus_t, preserve_genus, preserve_genus)
@@ -170,6 +175,7 @@ CGAL_add_named_parameter(progressive_t, progressive, progressive)
 CGAL_add_named_parameter(tiling_t, tiling, tiling)
 CGAL_add_named_parameter(dimension_t, dimension, dimension)
 
+
 // List of named parameters that we use in the package 'Surface Mesh Simplification'
 CGAL_add_named_parameter(get_cost_policy_t, get_cost_policy, get_cost)
 CGAL_add_named_parameter(get_placement_policy_t, get_placement_policy, get_placement)
@@ -245,6 +251,11 @@ CGAL_add_named_parameter(optimize_anchor_location_t, optimize_anchor_location, o
 CGAL_add_named_parameter(optimize_boundary_anchor_location_t, optimize_boundary_anchor_location, optimize_boundary_anchor_location)
 CGAL_add_named_parameter(pca_plane_t, pca_plane, pca_plane)
 
+// List of named parameters used in Isosurfacing_3
+CGAL_add_named_parameter(use_topologically_correct_marching_cubes_t, use_topologically_correct_marching_cubes, use_topologically_correct_marching_cubes)
+CGAL_add_named_parameter(constrain_to_cell_t, constrain_to_cell, constrain_to_cell)
+CGAL_add_named_parameter(isovalue_nudging_t, isovalue_nudging, isovalue_nudging)
+
 // tetrahedral remeshing parameters
 CGAL_add_named_parameter(remesh_boundaries_t, remesh_boundaries, remesh_boundaries)
 CGAL_add_named_parameter(cell_selector_t, cell_selector, cell_is_selected_map)
@@ -381,6 +392,9 @@ CGAL_add_named_parameter_with_compatibility(cell_min_size_param_t, cell_min_size
 CGAL_add_named_parameter_with_compatibility(function_param_t, function_param, function)
 CGAL_add_named_parameter_with_compatibility(bounding_object_param_t, bounding_object_param, bounding_object)
 
+// List of named parameters used in the package ' 3D Surface Subdivision Methods'
+CGAL_add_named_parameter(do_not_modify_geometry_t, do_not_modify_geometry, do_not_modify_geometry)
+
 //List of named parameters used in Straight_skeleton_2
 CGAL_add_named_parameter_with_compatibility_ref_only(angles_param_t, angles_param, angles)
 CGAL_add_named_parameter(maximum_height_t, maximum_height, maximum_height)
diff --git a/STL_Extension/include/CGAL/Uncertain.h b/STL_Extension/include/CGAL/Uncertain.h
index 5e5003a5d5b..348a65f0f7d 100644
--- a/STL_Extension/include/CGAL/Uncertain.h
+++ b/STL_Extension/include/CGAL/Uncertain.h
@@ -624,13 +624,22 @@ Uncertain<T> operator*(Uncertain<T> a, T b)
         return a * Uncertain<T>(b);
 }
 
+// SFINAE helper to check if a type is Uncertain
+template <typename T>
+struct Is_Uncertain : std::false_type {};
+
+template <typename T>
+struct Is_Uncertain<Uncertain<T> > : std::true_type {};
+
 // enum_cast overload
 
 template < typename T, typename U >
 inline
-Uncertain<T> enum_cast(Uncertain<U> u)
+T enum_cast(Uncertain<U> u)
 {
-  return Uncertain<T>(static_cast<T>(u.inf()), static_cast<T>(u.sup()));
+  static_assert(CGAL::Is_Uncertain<T>::value, "T must be an Uncertain type");
+  typedef typename T::value_type Tv;
+  return { enum_cast<Tv>(u.inf()), enum_cast<Tv>(u.sup()) };
 }
 
 } //namespace CGAL
diff --git a/STL_Extension/test/STL_Extension/test_Uncertain.cpp b/STL_Extension/test/STL_Extension/test_Uncertain.cpp
index c8ab9867633..138210b2879 100644
--- a/STL_Extension/test/STL_Extension/test_Uncertain.cpp
+++ b/STL_Extension/test/STL_Extension/test_Uncertain.cpp
@@ -348,10 +348,10 @@ void test_enum_cast()
         typedef CGAL::Uncertain<CGAL::Angle> Ua;
 
         Us s;
-        Ub b = CGAL::enum_cast<CGAL::Bounded_side>(s);
-        Ua a = CGAL::enum_cast<CGAL::Angle>(s);
+        Ub b = CGAL::enum_cast<Ub>(s);
+        Ua a = CGAL::enum_cast<Ua>(s);
         CGAL_USE(a);
-        s = CGAL::enum_cast<CGAL::Sign>(b);
+        s = CGAL::enum_cast<Us>(b);
 }
 
 int main()
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2.h
index 05a199a5bff..bf7f90187c8 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2.h
@@ -96,9 +96,7 @@ namespace Internal {
 
   template < class Node >
   struct Project_site_2 {
-    typedef Node                   argument_type;
     typedef typename Node::Site_2  Site;
-    typedef Site                   result_type;
 
     Site operator()(const Node& x) const {
       return x.site();
@@ -108,9 +106,7 @@ namespace Internal {
 
   template < class Node, class Site_t >
   struct Project_input_to_site_2 {
-    typedef Node                   argument_type;
     typedef Site_t                 Site;
-    typedef Site                   result_type;
 
     Site operator()(const Node& x) const {
       if ( boost::tuples::get<2>(x) /*x.third*/ ) { // it is a point
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_parallel_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_parallel_C2.h
index a0a1e4f9bfd..19f5ddb5fbc 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_parallel_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_parallel_C2.h
@@ -34,15 +34,13 @@ class Are_parallel_C2
 public:
   typedef typename K::Site_2       Site_2;
   typedef typename K::Boolean      Boolean;
-  typedef Boolean                  result_type;
-  typedef Site_2                   argument_type;
 
 private:
   typedef typename K::Segment_2    Segment_2;
   typedef typename K::FT           FT;
 
 private:
-  Boolean   predicate(const Site_2& p, const Site_2& q) const {
+  Boolean predicate(const Site_2& p, const Site_2& q) const {
     CGAL_precondition( p.is_segment() && q.is_segment() );
 
     Segment_2 s1 = p.segment();
@@ -64,7 +62,7 @@ private:
   }
 
 public:
-  result_type operator()(const Site_2& p, const Site_2& q) const
+  Boolean operator()(const Site_2& p, const Site_2& q) const
   {
     return predicate(p, q);
   }
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_points_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_points_C2.h
index a60b7551604..a3187245161 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_points_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_points_C2.h
@@ -75,10 +75,7 @@ private:
   }
 
 public:
-  typedef Boolean        result_type;
-  typedef Site_2         argument_type;
-
-  Boolean   operator()(const Site_2& p, const Site_2& q) const
+  Boolean operator()(const Site_2& p, const Site_2& q) const
   {
     CGAL_precondition( p.is_point() && q.is_point() );
 
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_segments_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_segments_C2.h
index 35ce0565ef9..33b97d4dfe8 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_segments_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Are_same_segments_C2.h
@@ -34,10 +34,9 @@ private:
 
 public:
   typedef typename K::Site_2    Site_2;
-  typedef bool                  result_type;
-  typedef Site_2                argument_type;
+  typedef typename K::Boolean   Boolean;
 
-  bool operator()(const Site_2& p, const Site_2& q) const
+  Boolean operator()(const Site_2& p, const Site_2& q) const
   {
     CGAL_precondition( p.is_segment() && q.is_segment() );
 
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_C2.h
index 409200b379c..f5bd1d55dc0 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_C2.h
@@ -70,13 +70,13 @@ private:
   Are_same_points_2     same_points;
 
 public:
-  typedef typename Enum::Arrangement_type    result_type;
+  typedef typename Enum::Arrangement_type    Arrangement_type;
 
 private:
-  result_type compute_type_C2(const RT& x1, const RT& y1,
-                              const RT& x2, const RT& y2,
-                              const RT& x3, const RT& y3,
-                              const RT& x4, const RT& y4) const
+  Arrangement_type compute_type_C2(const RT& x1, const RT& y1,
+                                   const RT& x2, const RT& y2,
+                                   const RT& x3, const RT& y3,
+                                   const RT& x4, const RT& y4) const
   {
     RT delta = -determinant<RT>(x2 - x1, x4 - x3, y2 - y1, y4 - y3);
 
@@ -88,7 +88,7 @@ private:
     }
   }
 
-  result_type
+  Arrangement_type
   non_parallel_C2(const RT& x1, const RT& y1, const RT& x2, const RT& y2,
                   const RT& x3, const RT& y3, const RT& x4, const RT& y4,
                   const RT& D) const
@@ -159,7 +159,7 @@ private:
   }
 
 
-  result_type
+  Arrangement_type
   parallel_C2(const RT& x1, const RT& y1, const RT& x2, const RT& y2,
               const RT& x3, const RT& y3, const RT& x4, const RT& y4) const
   {
@@ -326,7 +326,7 @@ private:
 
   //------------------------------------------------------------------------
 
-  result_type
+  Arrangement_type
   arrangement_type_same_point(const Site_2& p, const Site_2& q,
                               unsigned int ip, unsigned int iq) const
   {
@@ -368,7 +368,7 @@ private:
     }
   }
 
-  result_type
+  Arrangement_type
   arrangement_type_ss(const Site_2& p, const Site_2& q) const
   {
     bool same_p1q1 = same_points(p.source_site(), q.source_site());
@@ -393,17 +393,17 @@ private:
     Segment_2 s1 = p.segment();
     Segment_2 s2 = q.segment();
 
-    result_type res = compute_type_C2( s1.source().x(), s1.source().y(),
-                                       s1.target().x(), s1.target().y(),
-                                       s2.source().x(), s2.source().y(),
-                                       s2.target().x(), s2.target().y() );
+    Arrangement_type res = compute_type_C2(s1.source().x(), s1.source().y(),
+                                           s1.target().x(), s1.target().y(),
+                                           s2.source().x(), s2.source().y(),
+                                           s2.target().x(), s2.target().y() );
 
     return res;
   }
 
   //--------------------------------------------------------------------
 
-  result_type
+  Arrangement_type
   arrangement_type_ps(const Site_2& p, const Site_2& q) const
   {
     if ( same_points(p, q.source_site()) ) {
@@ -419,7 +419,7 @@ private:
 
   //--------------------------------------------------------------------
 
-  result_type
+  Arrangement_type
   arrangement_type_pp(const Site_2& p, const Site_2& q) const
   {
     if ( same_points(p, q) ) {
@@ -432,10 +432,7 @@ private:
   //--------------------------------------------------------------------
 
 public:
-  typedef Site_2                   argument_type;
-
-
-  result_type
+  Arrangement_type
   operator()(const Site_2& p, const Site_2& q) const
   {
     CGAL_precondition( p.is_defined() && q.is_defined() );
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_non_intersecting_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_non_intersecting_C2.h
index b235fb7b01a..3b74da58079 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_non_intersecting_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_non_intersecting_C2.h
@@ -65,13 +65,13 @@ private:
   Are_same_points_2     same_points;
 
 public:
-  typedef typename Enum::Arrangement_type    result_type;
+  typedef typename Enum::Arrangement_type    Arrangement_type;
 
 private:
 
   //--------------------------------------------------------------------
 
-  result_type
+  Arrangement_type
   arrangement_type_ss(const Site_2& p, const Site_2& q) const
   {
     bool same_p1q1 = same_points(p.source_site(), q.source_site());
@@ -98,7 +98,7 @@ private:
 
   //--------------------------------------------------------------------
 
-  result_type
+  Arrangement_type
   arrangement_type_ps(const Site_2& p, const Site_2& q) const
   {
     if ( same_points(p, q.source_site()) ) {
@@ -112,7 +112,7 @@ private:
 
   //--------------------------------------------------------------------
 
-  result_type
+  Arrangement_type
   arrangement_type_pp(const Site_2& p, const Site_2& q) const
   {
     if ( same_points(p, q) ) {
@@ -128,7 +128,7 @@ public:
   typedef Site_2                   argument_type;
 
 
-  result_type
+  Arrangement_type
   operator()(const Site_2& p, const Site_2& q) const
   {
     CGAL_precondition( p.is_defined() && q.is_defined() );
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_x_2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_x_2.h
index 75e5df58c14..08cb071fea6 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_x_2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_x_2.h
@@ -33,8 +33,7 @@ class Compare_x_2
 public:
   typedef typename K::Site_2              Site_2;
   typedef typename K::Point_2             Point_2;
-
-  typedef typename K::Comparison_result   result_type;
+  typedef typename K::Comparison_result   Comparison_result;
 
 private:
   typedef typename K::Compare_x_2         Kernel_compare_x_2;
@@ -42,13 +41,13 @@ private:
 public:
 
   inline
-  result_type operator()(const Point_2& p, const Point_2& q) const
+  Comparison_result operator()(const Point_2& p, const Point_2& q) const
   {
     return Kernel_compare_x_2()( p, q );
   }
 
   inline
-  result_type operator()(const Site_2& p, const Site_2& q) const
+  Comparison_result operator()(const Site_2& p, const Site_2& q) const
   {
     CGAL_precondition( p.is_point() && q.is_point() );
     return Kernel_compare_x_2()( p.point(), q.point() );
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_y_2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_y_2.h
index e2b686b9819..83eb5e50afd 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_y_2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Compare_y_2.h
@@ -34,21 +34,20 @@ class Compare_y_2
 public:
   typedef typename K::Site_2                Site_2;
   typedef typename K::Point_2               Point_2;
-  typedef typename K::Comparison_result     result_type;
+  typedef typename K::Comparison_result     Comparison_result;
 
 private:
   typedef typename K::Compare_y_2           Kernel_compare_y_2;
 
 public:
-
   inline
-  result_type operator()(const Point_2& p, const Point_2& q) const
+  Comparison_result operator()(const Point_2& p, const Point_2& q) const
   {
     return Kernel_compare_y_2()( p, q );
   }
 
   inline
-  result_type operator()(const Site_2& p, const Site_2& q) const
+  Comparison_result operator()(const Site_2& p, const Site_2& q) const
   {
     CGAL_precondition( p.is_point() && q.is_point() );
     return Kernel_compare_y_2()( p.point(), q.point() );
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_2.h
index ed7fc2b2b04..2f90b35379b 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_2.h
@@ -32,111 +32,109 @@ public:
   typedef typename Storage_traits::Point_handle      Point_handle;
   typedef typename Storage_traits::Geom_traits       Geom_traits;
 
-  typedef Storage_site_2                             result_type;
-
 protected:
   typedef typename Geom_traits::Intersections_tag    ITag;
 
-  result_type construct(const Point_handle& h1,
-                        const Point_handle& h2,
-                        const Point_handle& h3,
-                        const Point_handle& h4, const Tag_true&) const {
+  Storage_site_2 construct(const Point_handle& h1,
+                           const Point_handle& h2,
+                           const Point_handle& h3,
+                           const Point_handle& h4, const Tag_true&) const {
     return Storage_site_2::construct_storage_site_2(h1, h2, h3, h4);
   }
 
   inline
-  result_type construct(const Point_handle& h1,
-                        const Point_handle& h2,
-                        const Point_handle& h3,
-                        const Point_handle& h4,
-                        const Point_handle& h5,
-                        const Point_handle& h6, const Tag_true&) const {
+  Storage_site_2 construct(const Point_handle& h1,
+                           const Point_handle& h2,
+                           const Point_handle& h3,
+                           const Point_handle& h4,
+                           const Point_handle& h5,
+                           const Point_handle& h6, const Tag_true&) const {
     return Storage_site_2::construct_storage_site_2(h1, h2, h3, h4, h5, h6);
   }
 
   inline
-  result_type construct(const Point_handle& h1,
-                        const Point_handle& h2,
-                        const Point_handle& h3,
-                        const Point_handle& h4,
-                        bool is_first_exact, const Tag_true&) const {
+  Storage_site_2 construct(const Point_handle& h1,
+                           const Point_handle& h2,
+                           const Point_handle& h3,
+                           const Point_handle& h4,
+                           bool is_first_exact, const Tag_true&) const {
     return Storage_site_2::construct_storage_site_2(h1, h2, h3, h4,
                                                     is_first_exact);
   }
 
 
-  result_type construct(const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&, const Tag_false&) const {
+  Storage_site_2 construct(const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&, const Tag_false&) const {
     CGAL_error();
     return Storage_site_2();
   }
 
   inline
-  result_type construct(const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&, const Tag_false&) const {
+  Storage_site_2 construct(const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&, const Tag_false&) const {
     CGAL_error();
     return Storage_site_2();
   }
 
   inline
-  result_type construct(const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&,
-                        const Point_handle&,
-                        bool /* is_first_exact */, const Tag_false&) const {
+  Storage_site_2 construct(const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&,
+                           const Point_handle&,
+                           bool /* is_first_exact */, const Tag_false&) const {
     CGAL_error();
     return Storage_site_2();
   }
 
 public:
   inline
-  result_type operator()(const Point_handle& h) const {
+  Storage_site_2 operator()(const Point_handle& h) const {
     return Storage_site_2::construct_storage_site_2(h);
   }
 
   inline
-  result_type operator()(const Point_handle& h1,
-                         const Point_handle& h2) const {
+  Storage_site_2 operator()(const Point_handle& h1,
+                            const Point_handle& h2) const {
     return Storage_site_2::construct_storage_site_2(h1, h2);
   }
 
   inline
-  result_type operator()(const Point_handle& h1,
-                         const Point_handle& h2,
-                         const Point_handle& h3,
-                         const Point_handle& h4) const {
+  Storage_site_2 operator()(const Point_handle& h1,
+                            const Point_handle& h2,
+                            const Point_handle& h3,
+                            const Point_handle& h4) const {
     return construct(h1, h2, h3, h4, ITag());
   }
 
   inline
-  result_type operator()(const Point_handle& h1,
-                         const Point_handle& h2,
-                         const Point_handle& h3,
-                         const Point_handle& h4,
-                         const Point_handle& h5,
-                         const Point_handle& h6) const {
+  Storage_site_2 operator()(const Point_handle& h1,
+                            const Point_handle& h2,
+                            const Point_handle& h3,
+                            const Point_handle& h4,
+                            const Point_handle& h5,
+                            const Point_handle& h6) const {
     return construct(h1, h2, h3, h4, h5, h6, ITag());
   }
 
   inline
-  result_type operator()(const Point_handle& h1,
-                         const Point_handle& h2,
-                         const Point_handle& h3,
-                         const Point_handle& h4,
-                         bool is_first_exact) const {
+  Storage_site_2 operator()(const Point_handle& h1,
+                            const Point_handle& h2,
+                            const Point_handle& h3,
+                            const Point_handle& h4,
+                            bool is_first_exact) const {
     return construct(h1, h2, h3, h4, is_first_exact, ITag());
   }
 
   // constructs the point of intersection
   inline
-  result_type operator()(const Storage_site_2& ss0,
-                         const Storage_site_2& ss1) const {
+  Storage_site_2 operator()(const Storage_site_2& ss0,
+                            const Storage_site_2& ss1) const {
     CGAL_precondition( ss0.is_segment() && ss1.is_segment() );
     return Storage_site_2::construct_storage_site_2
       ( ss0.source_of_supporting_site(),
@@ -329,9 +327,9 @@ public:
   // endpoints the point of intersection of ss1 and ss0; the boolean
   // determines if the first or segment subsegment is constructed
   inline
-  result_type operator()(const Storage_site_2& ss0,
-                         const Storage_site_2& ss1,
-                         bool first) const {
+  Storage_site_2 operator()(const Storage_site_2& ss0,
+                            const Storage_site_2& ss1,
+                            bool first) const {
     //    CGAL_precondition( ss0.is_segment() && ss1.is_segment() );
     CGAL_precondition( ss0.is_segment() );
     if ( ss1.is_point() ) {
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_with_info_2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_with_info_2.h
index 1171067633b..cca67b237af 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_with_info_2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Construct_storage_site_with_info_2.h
@@ -33,8 +33,6 @@ public:
   typedef typename Storage_traits::Storage_site_2    Storage_site_2;
   typedef typename Storage_traits::Point_handle      Point_handle;
 
-  typedef Storage_site_2                             result_type;
-
 protected:
   typedef Construct_storage_site_2<Storage_traits>   Base;
   typedef typename Storage_traits::Info              Info;
@@ -42,10 +40,12 @@ protected:
   typedef typename Storage_traits::Merge_info        Merge_info;
 
 public:
+  using Base::operator();
+
   // constructs the point of intersection
   inline
-  result_type operator()(const Storage_site_2& ss0,
-                         const Storage_site_2& ss1) const {
+  Storage_site_2 operator()(const Storage_site_2& ss0,
+                            const Storage_site_2& ss1) const {
     Storage_site_2 ssx = Base::operator()(ss0, ss1);
     Info infox = Merge_info()(ss0.info(), ss1.info());
     ssx.set_info(infox);
@@ -56,16 +56,14 @@ public:
   // endpoints the point of intersection of ss1 and ss0; the boolean
   // determines if the first or segment subsegment is constructed
   inline
-  result_type operator()(const Storage_site_2& ss0,
-                         const Storage_site_2& ss1,
-                         bool first) const {
+  Storage_site_2 operator()(const Storage_site_2& ss0,
+                            const Storage_site_2& ss1,
+                            bool first) const {
     Storage_site_2 s = Base::operator()(ss0, ss1, first);
     Info is = Convert_info()(ss0.info(), ss1.info(), first);
     s.set_info(is);
     return s;
   }
-
-  using Base::operator();
 };
 
 
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Constructions_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Constructions_C2.h
index e4a88c83bdd..58794333774 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Constructions_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Constructions_C2.h
@@ -48,29 +48,28 @@ class Construct_sdg_site_2<Site,Tag_true>
 public:
   typedef Site                             Site_2;
   typedef typename Site_2::Point_2         Point_2;
-  typedef Site_2                           result_type;
 
 public:
-  result_type operator()(const Point_2& p) const {
+  Site_2 operator()(const Point_2& p) const {
     return Site_2(p);
   }
 
-  result_type operator()(const Point_2& p0, const Point_2& p1) const {
+  Site_2 operator()(const Point_2& p0, const Point_2& p1) const {
     return Site_2(p0, p1);
   }
 
-  result_type operator()(const Point_2& p0, const Point_2& p1,
+  Site_2 operator()(const Point_2& p0, const Point_2& p1,
                          const Point_2& q0, const Point_2& q1) const {
     return Site_2(p0, p1, q0, q1);
   }
 
-  result_type operator()(const Point_2& p0, const Point_2& p1,
+  Site_2 operator()(const Point_2& p0, const Point_2& p1,
                          const Point_2& q0, const Point_2& q1,
                          bool b) const {
     return Site_2(p0, p1, q0, q1, b);
   }
 
-  result_type operator()(const Point_2& p0, const Point_2& p1,
+  Site_2 operator()(const Point_2& p0, const Point_2& p1,
                          const Point_2& q0, const Point_2& q1,
                          const Point_2& r0, const Point_2& r1) const {
     return Site_2(p0, p1, q0, q1, r0, r1);
@@ -84,14 +83,13 @@ class Construct_sdg_site_2<Site,Tag_false>
 public:
   typedef Site                             Site_2;
   typedef typename Site_2::Point_2         Point_2;
-  typedef Site_2                           result_type;
 
 public:
-  result_type operator()(const Point_2& p) const {
+  Site_2 operator()(const Point_2& p) const {
     return Site_2(p);
   }
 
-  result_type operator()(const Point_2& p0, const Point_2& p1) const {
+  Site_2 operator()(const Point_2& p0, const Point_2& p1) const {
     return Site_2(p0, p1);
   }
 };
@@ -110,7 +108,6 @@ public:
   typedef typename K::Site_2                Site_2;
   typedef Voronoi_vertex_C2<K,M>            Voronoi_vertex_2;
   typedef typename K::Point_2               Point_2;
-  typedef Point_2                           result_type;
 
 public:
   Point_2 operator()(const Site_2& s1, const Site_2& s2,
@@ -134,7 +131,6 @@ public:
   typedef typename Gt::Site_2                 Site_2;
   typedef Voronoi_vertex_C2<Gt,M>             Voronoi_vertex_2;
   typedef typename Gt::Circle_2               Circle_2;
-  typedef Circle_2                            result_type;
 
 public:
   Circle_2 operator() (const Site_2& s1, const Site_2& s2,
@@ -159,7 +155,6 @@ public:
   typedef typename Gt::Site_2        Site_2;
   typedef typename Gt::Point_2       Point_2;
   typedef typename Gt::Line_2        Line_2;
-  typedef Line_2                     result_type;
 
 private:
   static
@@ -217,7 +212,6 @@ public:
   typedef typename Gt::Ray_2                    Ray_2;
   typedef typename Gt::Construct_svd_vertex_2   Construct_svd_vertex_2;
   typedef typename Gt::Equal_2                  Equal_2;
-  typedef Ray_2                                 result_type;
 
   Ray_2 operator()(const Site_2& p, const Site_2& q,
                    const Site_2& r) const
@@ -268,10 +262,9 @@ public:
   typedef typename Gt::Equal_2                 Equal_2;
 
   typedef CGAL::Object                         Object_2;
-  typedef Object_2                             result_type;
 
-  result_type operator()(const Site_2& p, const Site_2& q,
-                         const Site_2& r, const Site_2& s) const
+  Object_2 operator()(const Site_2& p, const Site_2& q,
+                      const Site_2& r, const Site_2& s) const
   {
     Construct_svd_vertex_2 circumcenter;
     Point_2 vpqr = circumcenter(p, q, r);
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Finite_edge_interior_conflict_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Finite_edge_interior_conflict_C2.h
index 3a11600e232..26486b216cf 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Finite_edge_interior_conflict_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Finite_edge_interior_conflict_C2.h
@@ -662,11 +662,8 @@ private:
   //------------------------------------------------------------------------
 
 public:
-  typedef Boolean           result_type;
-  typedef Site_2            argument_type;
-
-  Boolean   operator()(const Site_2& p, const Site_2& q, const Site_2& r,
-                       const Site_2& s, const Site_2& t, Sign sgn) const
+  Boolean operator()(const Site_2& p, const Site_2& q, const Site_2& r,
+                     const Site_2& s, const Site_2& t, Sign sgn) const
   {
     if ( sgn == POSITIVE ) {
       return is_interior_in_conflict_none(p, q, r, s, t, Method_tag());
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Infinite_edge_interior_conflict_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Infinite_edge_interior_conflict_C2.h
index a70381e27b7..f81915a9742 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Infinite_edge_interior_conflict_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Infinite_edge_interior_conflict_C2.h
@@ -37,16 +37,13 @@ public:
   typedef Are_same_points_C2<K>        Are_same_points_2;
   typedef Are_same_segments_C2<K>      Are_same_segments_2;
 
-  typedef Boolean                      result_type;
-  struct argument_type {};
-
 private:
   Are_same_points_2    same_points;
   Are_same_segments_2  same_segments;
 
 public:
-  Boolean   operator()(const Site_2& q, const Site_2& s, const Site_2& r,
-                       const Site_2& t, Sign sgn) const
+  Boolean operator()(const Site_2& q, const Site_2& s, const Site_2& r,
+                     const Site_2& t, Sign sgn) const
   {
     if ( t.is_segment() ) {
       return false;
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Is_degenerate_edge_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Is_degenerate_edge_C2.h
index 441b94f01ff..d6509777a2f 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Is_degenerate_edge_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Is_degenerate_edge_C2.h
@@ -46,11 +46,8 @@ private:
   }
 
 public:
-  typedef Boolean       result_type;
-  typedef Site_2        argument_type;
-
-  Boolean   operator()(const Site_2& p, const Site_2& q,
-                       const Site_2& r, const Site_2& s) const
+  Boolean operator()(const Site_2& p, const Site_2& q,
+                     const Site_2& r, const Site_2& s) const
   {
     Voronoi_vertex_2 vpqr(p, q, r);
     if ( vpqr.incircle_no_easy(s) == POSITIVE ) { return false; }
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Orientation_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Orientation_C2.h
index c3c4581229b..80477b4b0bc 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Orientation_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Orientation_C2.h
@@ -163,9 +163,6 @@ private:
   }
 
 public:
-  typedef Orientation                  result_type;
-  typedef Site_2                       argument_type;
-
   Orientation operator()(const Site_2& p, const Site_2& q,
                          const Site_2& r) const
   {
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_C2.h
index e867c86453b..a26a7aabeca 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_C2.h
@@ -52,8 +52,6 @@ private:
 
 public:
   typedef typename Base::Oriented_side        Oriented_side;
-  typedef Oriented_side                       result_type;
-  typedef Site_2                              argument_type;
 
   // computes the oriented side of the Voronoi vertex of s1, s2, inf
   // wrt the line that passes through the point p and its direction
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_of_bisector_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_of_bisector_C2.h
index f070318e694..b56b1e23e1c 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_of_bisector_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_of_bisector_C2.h
@@ -301,10 +301,6 @@ private:
   }
 
 public:
-  typedef Oriented_side              result_type;
-  typedef Site_2                     argument_type;
-
-
   Oriented_side
   operator()(const Site_2& t1, const Site_2& t2, const Site_2& q) const
   {
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
index d09313c5d6b..52fb6603ff2 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
@@ -2545,8 +2545,6 @@ Segment_Delaunay_graph_2<Gt,ST,D_S,LTag>::
 arrangement_type(const Site_2& p, const Site_2& q) const
 {
   typedef typename Geom_traits::Arrangement_type_2  AT2;
-  typedef typename AT2::result_type                 Arrangement_type;
-
   Arrangement_type res = geom_traits().arrangement_type_2_object()(p, q);
 
   // The values that have to be treated are the following:
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h
index 5b6b43ad161..3d4d266a808 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h
@@ -443,10 +443,6 @@ private:
 
 
 public:
-  typedef Site_2      argument_type;
-  typedef Sign        result_type;
-
-
   Sign operator()(const Site_2& p, const Site_2& q,
                   const Site_2& r, const Site_2& t) const
   {
diff --git a/Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/Multi_info.h b/Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/Multi_info.h
index 5c9945e6b70..cf266555c6c 100644
--- a/Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/Multi_info.h
+++ b/Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/Multi_info.h
@@ -68,7 +68,6 @@ template<class Info_t>
 struct Multi_info_convert_info
 {
   typedef Info_t             Info;
-  typedef Multi_info<Info>   result_type;
 
   inline
   Multi_info<Info> operator()(const Multi_info<Info>& minfo0, bool) const
@@ -88,7 +87,6 @@ template<class Info_t>
 struct Multi_info_merge_info
 {
   typedef Info_t            Info;
-  typedef Multi_info<Info>  result_type;
 
   inline
   Multi_info<Info> operator()(const Multi_info<Info>& minfo0,
diff --git a/Shape_detection/doc/Shape_detection/Shape_detection.txt b/Shape_detection/doc/Shape_detection/Shape_detection.txt
index c51a84aad19..d58d86eeacc 100644
--- a/Shape_detection/doc/Shape_detection/Shape_detection.txt
+++ b/Shape_detection/doc/Shape_detection/Shape_detection.txt
@@ -19,7 +19,7 @@ This \cgal component implements two algorithms for shape detection:
 
 \section Shape_detection_RANSAC Efficient RANSAC
 
-From an unstructured point set with unoriented normals, this algorithm detects a set of shapes (see Figure \cgalFigureRef{Efficient_RANSAC_overview}).
+From an unstructured point set with unoriented normals, this algorithm detects a set of shapes (see \cgalFigureRef{Efficient_RANSAC_overview}).
 Five types of primitive shapes are provided by this package: plane, sphere, cylinder, cone, and torus. Other primitive shapes can be easily added
 by the user (see Section \ref Shape_detection_RANSACExample_with_custom_shapes).
 
@@ -67,7 +67,7 @@ A high value of `epsilon` leads to the detection of fewer large shapes and hence
 A low value of `epsilon` yields a more detailed detection, but may lead to either lower coverage or over-segmentation.
 Over-segmentation translates into detection of fragmented shapes when `epsilon` is within or below the noise level.
 When the input point set is made of free-form parts, a higher tolerance `epsilon` enables to detect more primitive shapes that approximate some of the free-form surfaces.
-The impact of this parameter is depicted by Figure \cgalFigureRef{Efficient_RANSAC_parameter_epsilon_variation}. Its impact on performance is evaluated in Section \ref Shape_detection_RANSACPerformance.
+The impact of this parameter is depicted by \cgalFigureRef{Efficient_RANSAC_parameter_epsilon_variation}. Its impact on performance is evaluated in Section \ref Shape_detection_RANSACPerformance.
 
 \cgalFigureBegin{Efficient_RANSAC_parameter_epsilon_variation, Efficient_RANSAC/epsilon_variation2.png}
 Impact of the epsilon parameter over the levels of detail of the detection.
@@ -84,7 +84,7 @@ the points covered by a shape are mapped to a 2D parameter space chosen to minim
 This 2D parameter space is discretized using a regular grid, and a connected component search is performed to identify the largest cluster.
 The parameter `cluster_epsilon` defines the spacing between two cells of the regular grid, so that two points separated by a distance of at most \f$2\sqrt{2}\f$ `cluster_epsilon` are considered adjacent.
 For non-developable shapes, the connected components are identified by computing a neighboring graph in 3D and walking in the graph.
-The impact of the parameter `cluster_epsilon` is depicted in Figure \cgalFigureRef{Efficient_RANSAC_parameter_connectivity}.
+The impact of the parameter `cluster_epsilon` is depicted in \cgalFigureRef{Efficient_RANSAC_parameter_connectivity}.
 
 \cgalFigureBegin{Efficient_RANSAC_parameter_connectivity, Efficient_RANSAC/varying_connectivity.png}
 The parameter `cluster_epsilon` controls the connectivity of the points covered by a detected shape.
@@ -207,10 +207,10 @@ which is used by the example \ref Shape_detection/efficient_RANSAC_with_custom_s
 
 The running time and detection performance of the Efficient RANSAC depend on the chosen parameters.
 A selective error tolerance parameter leads to higher running time and fewer shapes, as many shape candidates are generated to find the largest shape.
-We plot the detection performance against the `epsilon` error tolerance parameter for detecting planes in a complex scene with 5M points (see Figure \cgalFigureRef{Efficient_RANSAC_performance_epsilon}).
+We plot the detection performance against the `epsilon` error tolerance parameter for detecting planes in a complex scene with 5M points (see \cgalFigureRef{Efficient_RANSAC_performance_epsilon}).
 The `probability` parameter controls the endurance when searching for the largest candidate at each iteration.
 It barely impacts the number of detected shapes, has a moderate impact on the size of the detected shapes, and increases the running time.
-We plot the performance against the `probability` parameter (see Figure \cgalFigureRef{Efficient_RANSAC_performance_probability}).
+We plot the performance against the `probability` parameter (see \cgalFigureRef{Efficient_RANSAC_performance_probability}).
 
 \cgalFigureBegin{Efficient_RANSAC_performance_epsilon, Efficient_RANSAC/epsilon_graph.png}
 The graph depicts the number of detected shapes (purple) and the coverage (green), that is the ratio assignedPoints / totalPoints, against the `epsilon` tolerance parameter.
@@ -358,7 +358,7 @@ The right choice of the parameters above plays an important role in producing a
 For example, if we consider the fuzzy sphere neighborhood, when `sphere_radius` is too large, we have fewer regions,
 and the details are not clearly separated. Meanwhile, if `sphere_radius` is too small, we produce more regions,
 and the point set may be over-segmented. Consider a 2D map of an intersection of streets in a city as
-in Figure \cgalFigureRef{Region_growing_parameter_sphere_radius_variation}. Each region is painted with
+in \cgalFigureRef{Region_growing_parameter_sphere_radius_variation}. Each region is painted with
 a unique color. As `sphere_radius` increases, the details become less clear.
 When `sphere_radius` = 0.3 (c), the best visual result is produced.
 
@@ -379,7 +379,7 @@ The first two parameters are used by the functions `RegionType::is_part_of_regio
 while the third parameter is used by the function `RegionType::is_valid_region()` from the `RegionType` concept.
 
 The right choice of `maximum_distance` and `maximum_angle` parameters is also very important.
-For example, Figure \cgalFigureRef{Region_growing_parameter_max_angle_variation} shows that the
+For example, \cgalFigureRef{Region_growing_parameter_max_angle_variation} shows that the
 roof top of the house can be distinguished as two planes (painted in blue and dark red) when `maximum_angle`
 is strict enough (c), or it can be recognized as only one plane (painted in pale yellow) in the other case (b).
 
@@ -403,7 +403,7 @@ Typical usage of the Region Growing component consists of five steps:
 -# Postprocess.
 
 Given a 2D point set, we detect 2D lines using the fuzzy sphere neighborhood. We then color all points
-from the found regions and save them in a file (see Figure \cgalFigureRef{Region_growing_on_point_set_2}).
+from the found regions and save them in a file (see \cgalFigureRef{Region_growing_on_point_set_2}).
 A point set with normals is stored in `std::vector`.
 
 \cgalExample{Shape_detection/region_growing_lines_on_point_set_2.cpp}
@@ -417,7 +417,7 @@ The following example shows a similar example, this time detecting circles inste
 \paragraph Shape_detection_RegionGrowingPoints_example_3D_planes Detecting 3D Planes
 
 If we are given a 3D point set, then the example below shows how to detect 3D planes using the K nearest neighbors search.
-We color all points from the found regions and save them in a file (see Figure \cgalFigureRef{Region_growing_on_point_set_3}).
+We color all points from the found regions and save them in a file (see \cgalFigureRef{Region_growing_on_point_set_3}).
 The example also shows how to retrieve all points, which are not assigned to any region, and how to use a custom output iterator.
 A point set with normals is stored in `CGAL::Point_set_3`.
 
@@ -484,7 +484,7 @@ In particular, it provides
 - `CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region` class that fits a 3D plane to the vertices of
 all mesh faces, which have been added to the region so far, and controls the quality of this fit.
 
-This component accepts any model of the concept `FaceListGraph` as a polygon mesh. Figure \cgalFigureRef{Region_growing_on_surface_mesh}
+This component accepts any model of the concept `FaceListGraph` as a polygon mesh. \cgalFigureRef{Region_growing_on_surface_mesh}
 gives an \ref Shape_detection_RegionGrowingMesh_examples "example" of the region growing algorithm
 for detecting 3D planes on `CGAL::Surface_mesh`.
 
@@ -573,7 +573,7 @@ The Efficient RANSAC algorithm is very quick, however, since it is not determini
 Instead, the region growing algorithm usually takes longer to complete, but it may provide better quality output in the presence of large scenes
 with numerous small details. Since it iterates throughout all items of the scene, there are fewer chances to miss a shape.
 In addition, it is deterministic (for a given input and a given set of parameters, it always returns the same output,
-whereas the Efficient RANSAC algorithm is randomized and so the output may vary at each run), see Figure \cgalFigureRef{Shape_detection_comparison}.
+whereas the Efficient RANSAC algorithm is randomized and so the output may vary at each run), see \cgalFigureRef{Shape_detection_comparison}.
 
 \cgalFigureBegin{Shape_detection_comparison, Efficient_RANSAC/comparison.png}
 Comparison of the Efficient RANSAC and region growing algorithms.
diff --git a/Skin_surface_3/include/CGAL/Triangulated_mixed_complex_observer_3.h b/Skin_surface_3/include/CGAL/Triangulated_mixed_complex_observer_3.h
index c519448c672..b67f0d63333 100644
--- a/Skin_surface_3/include/CGAL/Triangulated_mixed_complex_observer_3.h
+++ b/Skin_surface_3/include/CGAL/Triangulated_mixed_complex_observer_3.h
@@ -175,7 +175,7 @@ public:
                      const int orient)
   {
     if (s == 1) {
-      // Dont multiply by (1-s) as this will zero the equation
+      // Don't multiply by (1-s) as this will zero the equation
       Q[1] = Q[3] = Q[4] = 0;
       Q[0] = Q[2] = Q[5] = orient;
 
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
index dfad56236b8..b22173cb08b 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
@@ -71,12 +71,12 @@ public:
   size_t size();
 
   /*!
-    Return the `i`th entry, `i` from `0` to `size()-1`.
+    Return the `i`-th entry, `i` from `0` to `size()-1`.
   */
   FT operator()(size_t i);
 
   /*!
-    Set the `i`'th entry to `value`.
+    Set the `i`-th entry to `value`.
   */
   void set(size_t i, const FT value);
 
diff --git a/Spatial_searching/benchmark/Spatial_searching/include/nanoflann.hpp b/Spatial_searching/benchmark/Spatial_searching/include/nanoflann.hpp
index a9972641131..057de474521 100644
--- a/Spatial_searching/benchmark/Spatial_searching/include/nanoflann.hpp
+++ b/Spatial_searching/benchmark/Spatial_searching/include/nanoflann.hpp
@@ -712,7 +712,7 @@ namespace nanoflann
          *   // Must return the Euclidean (L2) distance between the vector "p1[0:size-1]" and the data point with index "idx_p2" stored in the class:
          *   inline DistanceType kdtree_distance(const T *p1, const size_t idx_p2,size_t size) const { ... }
          *
-         *   // Must return the dim'th component of the idx'th point in the class:
+         *   // Must return the dim-th component of the idx-th point in the class:
          *   inline T kdtree_get_pt(const size_t idx, int dim) const { ... }
          *
          *   // Optional bounding-box computation: return false to default to a standard bbox computation loop.
@@ -1470,7 +1470,7 @@ namespace nanoflann
                         return s;
                 }
 
-                // Returns the dim'th component of the idx'th point in the class:
+                // Returns the dim-th component of the idx-th point in the class:
                 inline num_t kdtree_get_pt(const size_t idx, int dim) const {
                         return m_data_matrix.coeff(idx,dim);
                 }
diff --git a/Spatial_searching/benchmark/Spatial_searching/nanoflan.cpp b/Spatial_searching/benchmark/Spatial_searching/nanoflan.cpp
index db5f5c4a94d..ebc93192bf8 100644
--- a/Spatial_searching/benchmark/Spatial_searching/nanoflan.cpp
+++ b/Spatial_searching/benchmark/Spatial_searching/nanoflan.cpp
@@ -47,7 +47,7 @@ struct PointCloud
                 return d0*d0+d1*d1+d2*d2;
         }
 
-        // Returns the dim'th component of the idx'th point in the class:
+        // Returns the dim-th component of the idx-th point in the class:
         // Since this is inlined and the "dim" argument is typically an immediate value, the
         //  "if/else's" are actually solved at compile time.
         inline T kdtree_get_pt(const size_t idx, int dim) const
diff --git a/Spatial_searching/benchmark/Spatial_searching/nn3nanoflan.cpp b/Spatial_searching/benchmark/Spatial_searching/nn3nanoflan.cpp
index 8822bae9992..abcf23f739c 100644
--- a/Spatial_searching/benchmark/Spatial_searching/nn3nanoflan.cpp
+++ b/Spatial_searching/benchmark/Spatial_searching/nn3nanoflan.cpp
@@ -51,7 +51,7 @@ struct PointCloud
                 return d0*d0+d1*d1+d2*d2;
         }
 
-        // Returns the dim'th component of the idx'th point in the class:
+        // Returns the dim-th component of the idx-th point in the class:
         // Since this is inlined and the "dim" argument is typically an immediate value, the
         //  "if/else's" are actually solved at compile time.
         inline T kdtree_get_pt(const size_t idx, int dim) const
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h b/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h
index e206f669fc0..a0fa65e7a71 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h
@@ -7,7 +7,7 @@ The class `Plane_separator` implements a plane separator, i.e., a
 hyperplane that is used to separate two half spaces.
 
 This hyperplane is defined by a cutting dimension `d` and a cutting
-value `v` as `xd=v`, where `v` denotes the `d`th coordinate value.
+value `v` as `xd=v`, where `v` denotes the `d`-th coordinate value.
 
 \cgalModels{SpatialSeparator}
 
@@ -21,7 +21,7 @@ public:
 
 /*!
 Constructs a separator that separates two half spaces by a hyperplane
-defined by `xd=v`, where `v` denotes the `d`th coordinate value.
+defined by `xd=v`, where `v` denotes the `d`-th coordinate value.
 */
 Plane_separator(int d, FT v);
 
diff --git a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
index b6f06106069..f92b88f171c 100644
--- a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
+++ b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
@@ -62,7 +62,7 @@ computation has to be re-invoked for a larger number of neighbors,
 thereby performing redundant computations. Therefore, Hjaltason and
 Samet \cgalCite{hs-rsd-95} introduced <I>incremental nearest neighbor
 searching</I> in the sense that having obtained the  `k` nearest
-neighbors, the `k + 1`th neighbor can be obtained without having
+neighbors, the `k + 1`-th neighbor can be obtained without having
 to calculate the `k + 1` nearest neighbor from scratch.
 
 Spatial searching typically consists of a preprocessing phase and a
@@ -85,7 +85,7 @@ neighbor exactly, one of these objects may be returned as the
 approximate nearest/furthest neighbor. I.e., given some non-negative
 constant \f$ \epsilon\f$ the distance of an object returned as an
 approximate `k`-nearest neighbor must not be larger than
-\f$ (1+\epsilon)r\f$, where \f$ r\f$ denotes the distance to the real `k`th
+\f$ (1+\epsilon)r\f$, where \f$ r\f$ denotes the distance to the real `k`-th
 nearest neighbor. Similar the distance of an approximate `k`-furthest
 neighbor must not be smaller than \f$ r/(1+\epsilon)\f$. Obviously, for
 \f$ \epsilon=0\f$ we get the exact result, and the larger \f$ \epsilon\f$ is,
@@ -495,13 +495,13 @@ rectangles. Data points are only stored in the leaf nodes of the
 tree, not in the internal nodes.
 
 Friedmann, Bentley and Finkel \cgalCite{fbf-afbml-77} described the
-standard search algorithm to find the `k`th nearest neighbor by
+standard search algorithm to find the `k`-th nearest neighbor by
 searching a `kd` tree recursively.
 
 When encountering a node of the tree, the algorithm first visits the
 child that is closest to the query point. On return, if the rectangle
 containing the other child lies within 1/ (1+\f$ \epsilon\f$) times the
-distance to the `k`th nearest neighbors so far, then the other child
+distance to the `k`-th nearest neighbors so far, then the other child
 is visited recursively. Priority search \cgalCite{am-annqf-93} visits the
 nodes in increasing order of distance from the queue with help of a
 priority queue. The search stops when the distance of the query point
diff --git a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
index 08cc1da0063..6d499b9617d 100644
--- a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
+++ b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
@@ -59,9 +59,8 @@ namespace CGAL {
 
     private:
 
-    std::remove_cv_t<
-      std::remove_reference_t< typename Construct_min_vertex_d::result_type >
-      > min, max;
+    CGAL::cpp20::remove_cvref_t<std::invoke_result_t<Construct_min_vertex_d, Iso_box_d> > min;
+    CGAL::cpp20::remove_cvref_t<std::invoke_result_t<Construct_max_vertex_d, Iso_box_d> > max;
     Cartesian_const_iterator_d min_begin, max_begin;
     FT eps;
     unsigned int dim;
diff --git a/Spatial_searching/include/CGAL/Kd_tree_node.h b/Spatial_searching/include/CGAL/Kd_tree_node.h
index b90068bf2ba..6e1eff258f8 100644
--- a/Spatial_searching/include/CGAL/Kd_tree_node.h
+++ b/Spatial_searching/include/CGAL/Kd_tree_node.h
@@ -22,7 +22,7 @@
 #include <CGAL/Compact_container.h>
 #include <CGAL/Has_member.h>
 #include <CGAL/Spatial_searching/internal/Search_helpers.h>
-#include <boost/cstdint.hpp>
+#include <cstdint>
 
 namespace CGAL {
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h
index 7db792ad14e..f3471d82342 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h
@@ -26,7 +26,7 @@ contour offset instead of two contour offsets, one of them corresponding to the
 
 Simply using `2*offset` as the separation is incorrect since `offset` is the distance
 between an offset line and its original, not between an offset vertex and its original.
-The later, which is calculated by this function and needed to place the frame sufficiently
+The latter, which is calculated by this function and needed to place the frame sufficiently
 away from the polygon, can be thousands of times larger than `offset`.
 
 If the result is <I>absent</I>, any attempt to construct an exterior offset polygon at distance `offset` will fail.
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
index 93048c58c45..d7204199842 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
@@ -101,9 +101,6 @@ private:
   E2C From_Exact;
   F2C From_Filtered;
 
-  typedef typename AC::result_type  AC_result_type;
-  typedef typename FC::result_type  FC_result_type;
-  typedef typename EC::result_type  EC_result_type;
   typedef typename C2F::Target_kernel FK;
 
   bool has_enough_precision(const typename FK::Point_2& point, double precision) const
@@ -140,22 +137,21 @@ public:
     , Filter_construction(Filter_construction)
   {}
 
-  typedef AC_result_type           result_type;
-
   template <class ... A>
-  result_type
-  operator()(A&& ... a) const
+  auto operator()(A&& ... a) const
+    -> typename std::invoke_result<AC, A...>::type
   {
     {
       Protect_FPU_rounding<Protection> P;
       try
       {
+        using FC_result_type = typename std::invoke_result<FC, decltype(To_Filtered(std::forward<A>(a)))...>::type;
         FC_result_type fr = Filter_construction(To_Filtered(std::forward<A>(a))...);
 
         const double precision =
           Lazy_exact_nt<double>::get_relative_precision_of_to_double();
 
-        if ( fr && has_enough_precision(*fr, precision) )
+        if (fr && has_enough_precision(*fr, precision))
           return From_Filtered(fr);
       }
       catch (Uncertain_conversion_exception&) {}
@@ -163,7 +159,9 @@ public:
 
     Protect_FPU_rounding<!Protection> P(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    EC_result_type er = Exact_construction(To_Exact(std::forward<A>(a))...) ;
+
+    using EC_result_type = typename std::invoke_result<EC, decltype(To_Exact(std::forward<A>(a)))...>::type;
+    EC_result_type er = Exact_construction(To_Exact(std::forward<A>(a))...);
     return From_Exact(er);
   }
 };
diff --git a/Stream_support/include/CGAL/IO/io.h b/Stream_support/include/CGAL/IO/io.h
index 631dfb6e5b7..5669aeb0527 100644
--- a/Stream_support/include/CGAL/IO/io.h
+++ b/Stream_support/include/CGAL/IO/io.h
@@ -152,7 +152,7 @@ typedef IO_rep_is_not_specialized_aux<void> IO_rep_is_not_specialized;
 
 The purpose of `Output_rep` is to provide a way to control output formatting that works independently of the object's stream output operator.
 
-If you dont specialize `Output_rep` for `T`, `T`'s stream output operator is called from within `Output_rep`, by default. If you want another behavior for your type `T`, you have to provide a specialization for that type. Furthermore, you can provide specializations with a second template parameter (a formatting tag). The second template parameter defaults to `Null_tag` and means *default behavior*.
+If you don't specialize `Output_rep` for `T`, `T`'s stream output operator is called from within `Output_rep`, by default. If you want another behavior for your type `T`, you have to provide a specialization for that type. Furthermore, you can provide specializations with a second template parameter (a formatting tag). The second template parameter defaults to `Null_tag` and means *default behavior*.
 
 Specializations of `Output_rep` should provide the following features:
 
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Subdivision_method_3.txt b/Subdivision_method_3/doc/Subdivision_method_3/Subdivision_method_3.txt
index 48a87621908..59bf264d1c8 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Subdivision_method_3.txt
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Subdivision_method_3.txt
@@ -29,7 +29,9 @@ which contains four popular subdivision methods and their refinement
 functions. These include Catmull-Clark, Loop, Doo-Sabin and
 \f$ \sqrt{3}\f$ subdivisions. Variations of these methods can be easily
 extended by substituting the geometry computation of the refinement
-host.
+host. In particular, the edge case where one wishes to subdivide
+a mesh while keeping its geometry fixed is offered, setting an optional parameter
+in Catmull-Clark subdivision and Loop subdivision.
 
 \section secSubAlgo Subdivision Method
 
@@ -132,7 +134,7 @@ Subdivision_method_3::CatmullClark_subdivision(pmesh, params::number_of_iteratio
 \endcode
 
 `Subdivision_method_3` specifies the namespace of the
-subdivision functions. `CatmullClark_subdivision(P, params::number_of_iterations(d))` computes the
+subdivision functions. `CatmullClark_subdivision(pmesh, params::number_of_iterations(d))` computes the
 Catmull-Clark subdivision surface of the polygon mesh `pmesh` after
 `d` iterations of the refinements. The polygon mesh  `pmesh` is
 passed by reference, and is modified (i.e.\ subdivided) by the
@@ -141,14 +143,7 @@ subdivision function.
 This example shows how to subdivide a `Surface_mesh`
 with `Subdivision_method_3`.
 An application-defined polygon mesh might use a specialized kernel and/or
-a specialized internal container. There is one major restriction on the
-application-defined polygon mesh to work with
-`Subdivision_method_3`:
-The primitives (such as vertices, halfedges and faces)
-in the internal container are sequentially ordered (e.g.
-`std::vector` and `std::list`).
-This implies that the iterators traverse the primitives in
-the order of their creations/insertions.
+a specialized internal container.
 
 Section \ref secRefHost gives detailed explanations on this
 two restrictions.
@@ -357,14 +352,6 @@ The order of the connectivity operations plays a key role when maintaining
 stencils. By matching the order of the source submeshes to the refined
 vertices, no flag in the primitives is required to register the stencils.
 It avoids the data dependency of the refinement host on the polygon mesh class.
-To make the ordering trick work, the polygon mesh class must
-have a sequential container, such as a vector or a linked-list, as
-the internal storage.
-A sequential container guarantees that the iterators of the
-polygon mesh always traverse the primitives in the order of their
-insertions. Non-sequential structures such as
-trees or maps do not provide the required ordering, and hence
-cannot be used with `Subdivision_method_3`.
 
 Although `Subdivision_method_3` does not require flags
 to support the refinements and the stencils, it
@@ -373,7 +360,6 @@ data (i.e.\ the points). The classes of `Subdivision_method_3`
 have as optional template argument a vertex property map
 that provides a mapping between vertices and points.
 
-
 Refinement hosts `PQQ` and `DQQ` work on a general
 polygon mesh, and `PTQ` and `Sqrt3` work on a triangulated
 polygon mesh. The result of `PTQ` and `Sqrt3` on a non-triangulated
@@ -552,8 +538,8 @@ namespace Subdivision_method_3 {
 
 \section Subdivision_method_3Other Example: Customizing a Subdivision Method
 
-`Subdivision_method_3` supports four practical subdivision methods on a
-`Polyhedron_3` with points with %Cartesian coordinates. More subdivision methods can be supported
+`Subdivision_method_3` supports four practical subdivision methods on a polygon mesh
+with points with %Cartesian coordinates. More subdivision methods can be supported
 through the specialization of refinement hosts with custom geometry masks.
 The following example develops a subdivision method
 generating an improved Loop subdivision surface.
diff --git a/Subdivision_method_3/examples/Subdivision_method_3/Linear_subdivision.cpp b/Subdivision_method_3/examples/Subdivision_method_3/Linear_subdivision.cpp
index a9314fb937a..49784762887 100644
--- a/Subdivision_method_3/examples/Subdivision_method_3/Linear_subdivision.cpp
+++ b/Subdivision_method_3/examples/Subdivision_method_3/Linear_subdivision.cpp
@@ -12,10 +12,12 @@ typedef CGAL::Simple_cartesian<double>          Kernel;
 typedef CGAL::Surface_mesh<Kernel::Point_3>     Surface_mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
+namespace params = CGAL::parameters;
 
 int main(int argc, char* argv[]) {
 
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/quad.off");
+  const unsigned int iter = (argc > 2) ? std::stoi(argv[2]) : 3;
 
   Surface_mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
@@ -24,8 +26,9 @@ int main(int argc, char* argv[]) {
     return 1;
   }
 
-  CGAL::Linear_mask_3<Surface_mesh> mask(&mesh);
-  CGAL::Subdivision_method_3::PQQ(mesh, mask, CGAL::parameters::number_of_iterations(1));
+  // Loop_subdivision can also be used for pure triangle meshes
+  CGAL::Subdivision_method_3::CatmullClark_subdivision(mesh, params::number_of_iterations(iter)
+                                                                    .do_not_modify_geometry(true));
 
   std::ofstream out("out.off");
   out << mesh;
diff --git a/Subdivision_method_3/include/CGAL/Subdivision_method_3/internal/subdivision_hosts_impl_3.h b/Subdivision_method_3/include/CGAL/Subdivision_method_3/internal/subdivision_hosts_impl_3.h
index 93141445a65..0184d343366 100644
--- a/Subdivision_method_3/include/CGAL/Subdivision_method_3/internal/subdivision_hosts_impl_3.h
+++ b/Subdivision_method_3/include/CGAL/Subdivision_method_3/internal/subdivision_hosts_impl_3.h
@@ -398,7 +398,7 @@ void DQQ_1step(Poly& p, VertexPointMap vpm, Mask mask) {
 template <class Poly, class VertexPointMap, class Mask>
 void Sqrt3_1step(Poly& p, VertexPointMap vpm, Mask mask,
                  const bool refine_border = false) {
-  // `refine_border` is a boolean that is meant to be true only every SECOND step
+  // `refine_border` is a Boolean that is meant to be true only every SECOND step
   // of the subdivision. In particular, this function makes uses of the fact
   // that there is at most a single border edge in a face, which is true if
   // the mesh is obtained from a sqrt3 subdivision before, but might otherwise
diff --git a/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h b/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
index af9edb11968..8b756fa95c4 100644
--- a/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
+++ b/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
@@ -117,8 +117,9 @@ public:
     pt = get(this->vpmap, vertex);
   }
 
-  void border_node(halfedge_descriptor edge, Point& ept, Point& /*vpt*/){
-   edge_node(edge, ept);
+  void border_node(halfedge_descriptor edge, Point& ept, Point& vtp){
+    edge_node(edge, ept);
+    vertex_node(target(edge, *(this->pmesh)), vtp);
   }
 };
 
@@ -373,7 +374,6 @@ public:
 /// @}
 };
 
-
 //==========================================================================
 /// The stencil of the Dual-Quadrilateral-Quadrisection
 template <class PolygonMesh,
diff --git a/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_methods_3.h b/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_methods_3.h
index 4aebef94d49..cd8c4994dbb 100644
--- a/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_methods_3.h
+++ b/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_methods_3.h
@@ -78,8 +78,6 @@ Catmull-Clark subdivision.
 */
 /// @{
 
-namespace parameters = CGAL::parameters;
-
 // -----------------------------------------------------------------------------
 
 #ifndef DOXYGEN_RUNNING
@@ -120,6 +118,13 @@ void CatmullClark_subdivision(PolygonMesh& pmesh, int step) {
  *     \cgalParamType{unsigned int}
  *     \cgalParamDefault{`1`}
  *   \cgalParamNEnd
+ *   \cgalParamNBegin{do_not_modify_geometry}
+ *     \cgalParamDescription{if set to `true`, the geometry of the mesh will not be modified}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`false`}
+ *     \cgalParamExtra{If `pmesh` is in fact a triangle mesh, this named parameter is also available
+ *                     in Loop subdivision and will create better shaped elements.}
+ *   \cgalParamNEnd
  * \cgalNamedParamsEnd
  *
  **/
@@ -133,10 +138,17 @@ void CatmullClark_subdivision(PolygonMesh& pmesh, const NamedParameters& np = pa
                          get_property_map(CGAL::vertex_point, pmesh));
 
   unsigned int step = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);
-  CatmullClark_mask_3<PolygonMesh,Vpm> mask(&pmesh, vpm);
+  bool do_not_modify_geometry = choose_parameter(get_parameter(np, internal_np::do_not_modify_geometry), false);
 
-  for(unsigned int i = 0; i < step; i++)
-    internal::PQQ_1step(pmesh, vpm, mask);
+  if (do_not_modify_geometry) {
+    Linear_mask_3<PolygonMesh, Vpm> mask(&pmesh, vpm);
+    for (unsigned int i = 0; i < step; i++)
+      internal::PQQ_1step(pmesh, vpm, mask);
+  } else {
+    CatmullClark_mask_3<PolygonMesh, Vpm> mask(&pmesh, vpm);
+    for (unsigned int i = 0; i < step; i++)
+      internal::PQQ_1step(pmesh, vpm, mask);
+  }
 }
 // -----------------------------------------------------------------------------
 
@@ -178,6 +190,13 @@ void Loop_subdivision(PolygonMesh& pmesh, int step) {
  *     \cgalParamType{unsigned int}
  *     \cgalParamDefault{`1`}
  *   \cgalParamNEnd
+ *   \cgalParamNBegin{do_not_modify_geometry}
+ *     \cgalParamDescription{if set to `true`, the geometry of the mesh will not be modified}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`false`}
+ *     \cgalParamExtra{This named parameter is also available in Catmull-Clark subdivision
+ *                     for non-triangle meshes.}
+ *   \cgalParamNEnd
  * \cgalNamedParamsEnd
  *
  * \pre `pmesh` must be a triangle mesh.
@@ -192,11 +211,19 @@ void Loop_subdivision(PolygonMesh& pmesh, const NamedParameters& np = parameters
                          get_property_map(CGAL::vertex_point, pmesh));
 
   unsigned int step = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);
-  Loop_mask_3<PolygonMesh,Vpm> mask(&pmesh, vpm);
+  bool do_not_modify_geometry = choose_parameter(get_parameter(np, internal_np::do_not_modify_geometry), false);
 
-  for(unsigned int i = 0; i < step; i++)
-    internal::PTQ_1step(pmesh, vpm, mask);
+  if (do_not_modify_geometry) {
+    Linear_mask_3<PolygonMesh, Vpm> mask(&pmesh, vpm);
+    for (unsigned int i = 0; i < step; i++)
+      internal::PTQ_1step(pmesh, vpm, mask);
+  } else {
+    Loop_mask_3<PolygonMesh, Vpm> mask(&pmesh, vpm);
+    for (unsigned int i = 0; i < step; i++)
+      internal::PTQ_1step(pmesh, vpm, mask);
+  }
 }
+
 // -----------------------------------------------------------------------------
 
 #ifndef DOXYGEN_RUNNING
diff --git a/Subdivision_method_3/test/Subdivision_method_3/test_Subdivision_method_3.cpp b/Subdivision_method_3/test/Subdivision_method_3/test_Subdivision_method_3.cpp
index c7c7757c49f..731c6c87ea9 100644
--- a/Subdivision_method_3/test/Subdivision_method_3/test_Subdivision_method_3.cpp
+++ b/Subdivision_method_3/test/Subdivision_method_3/test_Subdivision_method_3.cpp
@@ -1,44 +1,18 @@
-// ============================================================================
-//
-// Copyright (c) 2005-2006, 2017 Le-Jeng Shiue
-//
-// This software and related documentation is part of an INTERNAL release
-// of the Computational Geometry Algorithms Library (CGAL). It is not
-// intended for general use.
-//
-// ----------------------------------------------------------------------------
-//
-// release       : $CGAL_Revision: $
-// release_date  : $CGAL_Date: $
-//
-// file          : test/Subdivision_method_3/test_Subdivision_method_3.C
-// package       : Subdivision_method_3
-// chapter       : Subdivision Method
-//
-// revision      : $Id$
-// revision_date : $Date$
-//
-// author(s)     : Le-Jeng Shiue <Andy.Shiue@gmail.com>
-//
-// Test subdivision methods
-// ============================================================================
+#include <CGAL/subdivision_method_3.h>
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Surface_mesh.h>
-
-#include <CGAL/subdivision_method_3.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 
 #include <iostream>
 #include <fstream>
 #include <cassert>
 
-using namespace std;
-using namespace CGAL;
-
-#define TEST_DEPTH (3)
-
-//#define TESTMESH_GENERAL   "data/??.off"
+namespace PMP = ::CGAL::Polygon_mesh_processing;
+namespace SM = ::CGAL::Subdivision_method_3;
+namespace params = SM::parameters;
 
 #define TESTMESH_QUAD      CGAL::data_file_path("meshes/corner.off")
 #define TESTMESH_QUAD_OPEN CGAL::data_file_path("meshes/corner_with_hole.off")
@@ -46,316 +20,217 @@ using namespace CGAL;
 #define TESTMESH_TRI       CGAL::data_file_path("meshes/quint_tris.off")
 #define TESTMESH_TRI_OPEN  CGAL::data_file_path("meshes/nefertiti.off")
 
-void test_Subdivision_surface_3() {
-  typedef CGAL::Simple_cartesian<double>     Kernel;
-  typedef CGAL::Polyhedron_3<Kernel>         Polyhedron;
-
-  // test Catmull-Clark subdivision on quad mesh
+template <typename Mesh>
+void test_Subdivision_surface(const int depth = 3,
+                              const bool do_not_modify_geometry = false)
+{
+  auto check_volume_unchanged = [](Mesh& P)
   {
-    ifstream mesh(TESTMESH_QUAD);
+    if (!is_triangle_mesh(P))
+      PMP::triangulate_faces(P);
 
-    Polyhedron P;
-    mesh >> P;
+    double area_before = PMP::area(P);
+    double area_after = PMP::area(P);
+    assert(std::abs(area_before - area_after) < 1e-6);
 
-    Subdivision_method_3::CatmullClark_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
+    if (is_closed(P)) {
+      double volume_before = PMP::volume(P);
+      double volume_after = PMP::volume(P);
+      assert(std::abs(volume_before - volume_after) < 1e-6);
+    }
+  };
 
-  // test Catmull-Clark subdivision on 'opened' quad mesh
+  auto write_output = [](const Mesh& P, const std::string& test_name, int depth, bool do_not_modify_geometry) {
+    std::string filename = "out_" + test_name + "_" + std::to_string(depth)
+                             + (do_not_modify_geometry ? "_fixed." : ".") + "off";
+    if (!CGAL::IO::write_polygon_mesh(filename, P, CGAL::parameters::stream_precision(17))) {
+      std::cerr << "Error: Could not write to file " << filename << std::endl;
+    }
+  };
+
+  // Test Catmull-Clark subdivision on quad mesh
   {
-    ifstream mesh(TESTMESH_QUAD_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::CatmullClark_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-
-  // test Loop subdivision on tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Loop_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Loop subdivision on 'opened' tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Loop_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Doo-Sabin subdivision on general mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::DooSabin_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Sqrt-3 subdivision on tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Sqrt3_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-}
-
-void test_Subdivision_surface_3_SM() {
-  typedef CGAL::Simple_cartesian<double>            Kernel;
-  typedef CGAL::Surface_mesh<Kernel::Point_3>       Polyhedron;
-
-  // test Catmull-Clark subdivision on quad mesh
-  {
-    ifstream mesh(TESTMESH_QUAD);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::CatmullClark_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Catmull-Clark subdivision on 'opened' quad mesh
-  {
-    ifstream mesh(TESTMESH_QUAD_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::CatmullClark_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-
-  // test Loop subdivision on tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Loop_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Loop subdivision on 'opened' tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Loop_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Doo-Sabin subdivision on general mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::DooSabin_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P, true));
-  }
-
-  // test Doo-Sabin subdivision on 'opened' quad mesh
-  {
-    ifstream mesh(TESTMESH_QUAD_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::DooSabin_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Sqrt-3 subdivision on tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Sqrt3_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Sqrt-3 subdivision on 'opened' tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Sqrt3_subdivision(P);
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-}
-
-void test_Subdivision_surface_3_SM_NP() {
-  typedef CGAL::Simple_cartesian<double>            Kernel;
-  typedef CGAL::Surface_mesh<Kernel::Point_3>       Polyhedron;
-
-  // test Catmull-Clark subdivision on quad mesh
-  {
-    ifstream mesh(TESTMESH_QUAD);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::CatmullClark_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                                   .number_of_iterations(TEST_DEPTH));
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Catmull-Clark subdivision on 'opened' quad mesh
-  {
-    ifstream mesh(TESTMESH_QUAD_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::CatmullClark_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                                   .number_of_iterations(TEST_DEPTH));
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-
-  // test Loop subdivision on tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Loop_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                           .number_of_iterations(TEST_DEPTH));
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Loop subdivision on 'opened' tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Loop_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                           .number_of_iterations(TEST_DEPTH));
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Doo-Sabin subdivision on 'opened' tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::DooSabin_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                               .number_of_iterations(TEST_DEPTH));
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Doo-Sabin subdivision on 'opened' quad mesh
-  {
-    ifstream mesh(TESTMESH_QUAD_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::DooSabin_subdivision(P,Subdivision_method_3::parameters::number_of_iterations(TEST_DEPTH));
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Sqrt-3 subdivision on tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Sqrt3_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                            .number_of_iterations(TEST_DEPTH));
-
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Sqrt-3 subdivision on 'opened' tri mesh
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    Subdivision_method_3::Sqrt3_subdivision(P,Subdivision_method_3::parameters::vertex_point_map(get(vertex_point, P))
-                                            .number_of_iterations(TEST_DEPTH));
-
-    std::ofstream out("out_0.off");
-    out << P;
-
-    assert(CGAL::is_valid_polygon_mesh(P));
-  }
-
-  // test Sqrt-3 subdivision on 'opened' tri mesh & with external property map
-  {
-    ifstream mesh(TESTMESH_TRI_OPEN);
-
-    Polyhedron P;
-    mesh >> P;
-
-    typedef Kernel::Point_3                                               Point;
-    typedef Kernel::Vector_3                                              Vector;
-
-    typedef boost::graph_traits<Polyhedron>::vertex_descriptor            vertex_descriptor;
-    typedef std::unordered_map<vertex_descriptor, Kernel::Point_3>        Point_pmap;
-    typedef boost::associative_property_map<Point_pmap>                   APM;
-    typedef boost::property_map<Polyhedron, CGAL::vertex_point_t>::type   VPM;
-
-    Point_pmap um;
-    APM apm(um);
-    VPM vpm = get(vertex_point, P);
-
-    // some arbitrary new coordinates (different from the internal vpm)
-    for(vertex_descriptor vd : vertices(P)) {
-      boost::property_traits<VPM>::reference pt = get(vpm, vd);
-      Vector v = pt - Point(0., 0., -3.);
-      put(apm, vd, pt + 0.5*v);
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_QUAD, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_QUAD << std::endl;
+      return;
     }
 
-    Subdivision_method_3::Sqrt3_subdivision(P,
-                         Subdivision_method_3::parameters::vertex_point_map(apm)
-                         .number_of_iterations(TEST_DEPTH));
-
+    SM::CatmullClark_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                           .number_of_iterations(depth));
     assert(CGAL::is_valid_polygon_mesh(P));
+
+    write_output(P, "CatmullClark_quad", depth, false /*do not modify*/);
+  }
+
+  // Test Catmull-Clark subdivision on 'opened' quad mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_QUAD_OPEN, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_QUAD_OPEN << std::endl;
+      return;
+    }
+
+    SM::CatmullClark_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                           .number_of_iterations(depth)
+                                           .do_not_modify_geometry(do_not_modify_geometry));
+    assert(CGAL::is_valid_polygon_mesh(P));
+    if (do_not_modify_geometry) {
+      check_volume_unchanged(P);
+    }
+
+    write_output(P, "CatmullClark_quad_open", depth, do_not_modify_geometry);
+  }
+
+  // Test Catmull-Clark subdivision on 'opened' tri mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
+      return;
+    }
+
+    SM::CatmullClark_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                           .number_of_iterations(depth)
+                                           .do_not_modify_geometry(do_not_modify_geometry));
+    assert(CGAL::is_valid_polygon_mesh(P));
+    if (do_not_modify_geometry) {
+      check_volume_unchanged(P);
+    }
+
+    write_output(P, "CatmullClark_tri_open", depth, do_not_modify_geometry);
+  }
+
+  // Test Loop subdivision on tri mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI << std::endl;
+      return;
+    }
+
+    SM::Loop_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                   .number_of_iterations(depth)
+                                   .do_not_modify_geometry(do_not_modify_geometry));
+    assert(CGAL::is_valid_polygon_mesh(P));
+    if (do_not_modify_geometry) {
+      check_volume_unchanged(P);
+    }
+
+    write_output(P, "Loop_tri", depth, do_not_modify_geometry);
+  }
+
+  // Test Loop subdivision on 'opened' tri mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
+      return;
+    }
+
+    SM::Loop_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                   .number_of_iterations(depth)
+                                   .do_not_modify_geometry(do_not_modify_geometry));
+    assert(CGAL::is_valid_polygon_mesh(P));
+    if (do_not_modify_geometry) {
+      check_volume_unchanged(P);
+    }
+
+    write_output(P, "Loop_tri_open", depth, do_not_modify_geometry);
+  }
+
+  // Test Doo-Sabin subdivision on general mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
+      return;
+    }
+
+    SM::DooSabin_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                       .number_of_iterations(depth));
+    assert(CGAL::is_valid_polygon_mesh(P));
+
+    write_output(P, "DooSabin_general", depth, false);
+  }
+
+  // Test Sqrt-3 subdivision on tri mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI << std::endl;
+      return;
+    }
+
+    SM::Sqrt3_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                    .number_of_iterations(depth));
+    assert(CGAL::is_valid_polygon_mesh(P));
+    check_volume_unchanged(P);
+
+    write_output(P, "Sqrt3_tri", depth, false);
+  }
+
+  // Test Sqrt-3 subdivision on 'opened' tri mesh
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
+      return;
+    }
+
+    SM::Sqrt3_subdivision(P, params::vertex_point_map(get(CGAL::vertex_point, P))
+                                    .number_of_iterations(depth));
+    assert(CGAL::is_valid_polygon_mesh(P));
+
+    write_output(P, "Sqrt3_tri_open", depth, false);
+  }
+
+  // Test Sqrt-3 subdivision on 'opened' tri mesh with external property map
+  {
+    Mesh P;
+    if (!CGAL::IO::read_polygon_mesh(TESTMESH_TRI_OPEN, P) || is_empty(P)) {
+      std::cerr << "Error: failed to read or empty mesh: " << TESTMESH_TRI_OPEN << std::endl;
+      return;
+    }
+
+    typedef typename boost::property_map<Mesh, CGAL::vertex_point_t>::type VPM;
+    typedef typename boost::property_traits<VPM>::value_type Point;
+    typedef typename boost::property_traits<VPM>::reference PointRef;
+    typedef typename CGAL::Kernel_traits<Point>::type::Vector_3 Vector;
+
+    std::unordered_map<typename boost::graph_traits<Mesh>::vertex_descriptor, Point> um;
+    boost::associative_property_map<std::unordered_map<typename boost::graph_traits<Mesh>::vertex_descriptor, Point>> apm(um);
+
+    VPM vpm = get(CGAL::vertex_point, P);
+
+    // Assign arbitrary new coordinates
+    for (auto vd : vertices(P)) {
+      PointRef pt = get(vpm, vd);
+      Vector v = pt - Point(0., 0., -3.);
+      put(apm, vd, pt + 0.5 * v);
+    }
+
+    SM::Sqrt3_subdivision(P, params::vertex_point_map(apm)
+                                    .number_of_iterations(depth));
+    assert(CGAL::is_valid_polygon_mesh(P));
+
+    write_output(P, "Sqrt3_tri_open_external_map", depth, false);
   }
 }
 
-int main() {
-    test_Subdivision_surface_3();
-    test_Subdivision_surface_3_SM();
-    test_Subdivision_surface_3_SM_NP();
-    std::cerr << "Done" << std::endl;
-    return 0;
+int main(int argc, char* argv[])
+{
+  const int depth = (argc > 1) ? std::stoi(argv[1]) : 3;
+
+  typedef CGAL::Simple_cartesian<double> Kernel;
+  typedef CGAL::Polyhedron_3<Kernel> Polyhedron;
+  typedef CGAL::Surface_mesh<Kernel::Point_3> SurfaceMesh;
+
+  test_Subdivision_surface<Polyhedron>(depth);
+  test_Subdivision_surface<SurfaceMesh>(depth);
+  test_Subdivision_surface<SurfaceMesh>(depth, true /*do_not_modify_geometry*/);
+
+  std::cerr << "Done" << std::endl;
+
+  return 0;
 }
-// EOF //
diff --git a/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt b/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
index b7be50a395f..670449c2ee6 100644
--- a/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
+++ b/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
@@ -408,7 +408,7 @@ of points to OpenGL.
 
 We use a \em freelist for removed elements. This mean when a vertex gets removed
 and later `add_vertex` is called, the memory of the removed element is reused.
-This especially means that the n'th inserted element has not necessarily the index `n-1`,
+This especially means that the n-th inserted element has not necessarily the index `n-1`,
 and when iterating over elements they will not be enumerated in the insertion order.
 
 
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Properties.h b/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
index efdd4586966..320d53ab483 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
@@ -188,14 +188,14 @@ public:
         return &data_[0];
     }
 
-    /// Access the i'th element. No range check is performed!
+    /// Access the i-th element. No range check is performed!
     reference operator[](std::size_t _idx)
     {
         CGAL_assertion( _idx < data_.size() );
         return data_[_idx];
     }
 
-    /// Const access to the i'th element. No range check is performed!
+    /// Const access to the i-th element. No range check is performed!
     const_reference operator[](std::size_t _idx) const
     {
         CGAL_assertion( _idx < data_.size());
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
index 86a3b498b6f..d38d7ffeabd 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
@@ -1828,7 +1828,7 @@ public:
         return opposite(prev(h));
     }
 
-    /// returns the i'th vertex of edge `e`, for `i=0` or `1`.
+    /// returns the i-th vertex of edge `e`, for `i=0` or `1`.
     Vertex_index vertex(Edge_index e, unsigned int i) const
     {
         CGAL_assertion(i<=1);
@@ -1857,7 +1857,7 @@ public:
         return Halfedge_index(e.halfedge());
     }
 
-    /// returns the i'th halfedge of edge `e`, for `i=0` or `1`.
+    /// returns the i-th halfedge of edge `e`, for `i=0` or `1`.
     Halfedge_index halfedge(Edge_index e, unsigned int i) const
     {
         CGAL_assertion(i<=1);
diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt
index e2ea8e5b1b5..e7ff50e17cf 100644
--- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt
+++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt
@@ -29,7 +29,7 @@ A class interface is also provided for advanced users, in which a series of plia
 
 \section sma_overview Overview
 
-The package contains 3 main components: approximation algorithm, pliant operators and meshing as shown in Figure \cgalFigureRef{workflow}.
+The package contains 3 main components: approximation algorithm, pliant operators and meshing as shown in \cgalFigureRef{workflow}.
 
 \cgalFigureBegin{workflow, workflow.svg}
 From left to right are 3 components of the approximation package: approximation algorithm (left), optional pliant operations (middle) and meshing (right).
@@ -37,11 +37,11 @@ From left to right are 3 components of the approximation package: approximation
 
 \subsection sma_approximation Approximation
 
-The left part of Figure \cgalFigureRef{workflow} depicts the workflow of the approximation algorithm.
+The left part of \cgalFigureRef{workflow} depicts the workflow of the approximation algorithm.
 
 \subsubsection sma_clustering Clustering Iteration
 
-Figure \cgalFigureRef{iterations} depicts several Lloyd \cgalCite{cgal:l-lsqp-82} clustering iterations on the plane-sphere model with planar proxies and the \f$ \mathcal{L}^{2,1} \f$ metric. We plot the fitting error against each iteration. After 8 iterations, the error barely changes. Based on this observation, we consider that the clustering converges if the error change between the current and previous iteration is lower than a user-specified threshold (indicated by two green dash lines).
+\cgalFigureRef{iterations} depicts several Lloyd \cgalCite{cgal:l-lsqp-82} clustering iterations on the plane-sphere model with planar proxies and the \f$ \mathcal{L}^{2,1} \f$ metric. We plot the fitting error against each iteration. After 8 iterations, the error barely changes. Based on this observation, we consider that the clustering converges if the error change between the current and previous iteration is lower than a user-specified threshold (indicated by two green dash lines).
 
 \cgalFigureBegin{iterations, iterations.jpg}
 Discrete Lloyd iterations on the plane-sphere model with planar proxies and the \f$ \mathcal{L}^{2,1} \f$ metric: (left) random seeding of 6 proxies; (center) after one iteration; (right) after 8 iterations, the regions settle. The red lines depict the proxy normals drawn at the seed faces.
@@ -66,7 +66,7 @@ and the remaining error is added to the next proxy error in order to keep the to
 \f[ E'_{k+1} = (E_k - N_k * E_{avg}) + E_{k+1}. \f]
 
 
-Figure \cgalFigureRef{seeding_method} depicts different seeding methods. Random initialization randomly selects a set of input triangle faces as proxy seeds. While it is very fast, the subsequent clustering process can be entrapped in a bad local minimum, especially on shapes with regions surrounded by sharp creases (left closeup). Incremental initialization adds the proxies one by one at the most distorted region. It can thus be slow due to the large number of interleaved relaxation iterations. Hierarchical initialization (selected by default) repeatedly doubles the number of proxies in a hierarchical refinement sequence, so as to generate clustering regions with evenly distributed fitting errors. Time consumption is typically in-between the former two. Statistics and comparisons are available in Section \ref sma_perf.
+\cgalFigureRef{seeding_method} depicts different seeding methods. Random initialization randomly selects a set of input triangle faces as proxy seeds. While it is very fast, the subsequent clustering process can be entrapped in a bad local minimum, especially on shapes with regions surrounded by sharp creases (left closeup). Incremental initialization adds the proxies one by one at the most distorted region. It can thus be slow due to the large number of interleaved relaxation iterations. Hierarchical initialization (selected by default) repeatedly doubles the number of proxies in a hierarchical refinement sequence, so as to generate clustering regions with evenly distributed fitting errors. Time consumption is typically in-between the former two. Statistics and comparisons are available in Section \ref sma_perf.
 
 \cgalFigureBegin{seeding_method, seeding_method.jpg}
 Different seeding methods on the sphere-cube model. From left to right: initial partition (\f$ \mathcal{L}^{2,1} \f$ metrics and 20 proxies), add 5 proxy seeds (red faces) with random, incremental and hierarchical methods respectively.
@@ -78,7 +78,7 @@ Different seeding methods on the sphere-cube model. From left to right: initial
 To determine when to stop adding more proxies, we can specify either the maximum number of proxies required to approximate the geometry or the minimum error drop percentage with respect to the very first partition. More specifically, we can decide:
 - <b>Maximum number of proxies</b>. Adding proxies until the specified number is met.
 - <b>Minimum error drop</b>. Starting from the very first partition (with one proxy per connected component) with fitting error \f$ \hat E \f$, the algorithm adds proxies until the approximation error drops below the specified percentage \f$ target\_drop * \hat E \f$.
-As depicted by Figure \cgalFigureRef{nb_proxies}, specifying a minimum error drop of 10% (yellow dash lines) as stopping criterion, yields 12 proxies on the plane-sphere model. When both criteria are provided, the first criterion met stops the seeding. Different seeding examples are depicted by Figure \cgalFigureRef{meshing}.
+As depicted by \cgalFigureRef{nb_proxies}, specifying a minimum error drop of 10% (yellow dash lines) as stopping criterion, yields 12 proxies on the plane-sphere model. When both criteria are provided, the first criterion met stops the seeding. Different seeding examples are depicted by \cgalFigureRef{meshing}.
 To balance between performance and speed, we recommend using hierarchical seeding and specifying both stopping criteria.
 
 
@@ -92,14 +92,14 @@ Using different number of proxies to approximate the plane-sphere model. From le
 For interactive use, the approach can yield better approximations of the geometry via adding/removing proxies and tunneling out of local minima via additional operations:
 - <b>Merging</b>. Merging two adjacent regions.
 - <b>Splitting</b>. Splitting one specified region into smaller ones to reduce the error. By default bisection is performed but N-section is also possible. We first select the request number of face seeds from the specified region, then perform the refitting process confined to the region.
-- <b>Adding</b>. Adding one or more proxies to further reduce the approximation error. As for the seeding process, addition can be performed incrementally or hierarchically, as shown in Figure \cgalFigureRef{seeding_method}.
+- <b>Adding</b>. Adding one or more proxies to further reduce the approximation error. As for the seeding process, addition can be performed incrementally or hierarchically, as shown in \cgalFigureRef{seeding_method}.
 - <b>Teleporting</b>. A teleportation operator is a combination of merging and adding proxies: merging the pair of adjacent regions and adding a proxy seed to the worst region. More specifically, the pair of regions whose merging realizes the smallest error after merging and local re-fitting, is selected for merging. In practice, the teleport operation can temporarily either decrease or increase the total approximation error. We provide an optional heuristic to evaluate if the teleportation is worth it by verifying whether the error increase induced by a (simulated) deletion is smaller than half of the error of the worst region. If this test fails, no teleportation is judged necessary.
 
 \cgalFigureBegin{operations, operations.jpg}
 Operations on the sphere-cube union model. Upper row: merging (9 proxies) and the reverse bisection splitting (10 partitions) on the confined region. Lower row: one teleportation operation of merging and adding a face seed, the sphere is approximated with one more proxy.
 \cgalFigureEnd
 
-As depicted in Figure \cgalFigureRef{operations}, teleportation provides a means to relocate a local minimum region entrapped in the planar part (left) to the most needed regions on the sphere (right). In \ref sma_example3, the class interface is used to control the approximation process through the aforementioned operations.
+As depicted in \cgalFigureRef{operations}, teleportation provides a means to relocate a local minimum region entrapped in the planar part (left) to the most needed regions on the sphere (right). In \ref sma_example3, the class interface is used to control the approximation process through the aforementioned operations.
 
 \subsection sma_meshing Meshing
 
@@ -115,9 +115,9 @@ A vertex is selected as a basic anchor if it is:
 
 \subsubsection sma_anchors_subdivision Subdivision Anchors
 
-Walking along the boundary of a proxy region  (counterclockwise), a <em>chord</em> is a sequence of halfedges connecting two anchors. One cluster boundary cycle may consist of several chords. A connected region with holes may yield several boundary cycles (Figure \cgalFigureRef{operations}, planar part before teleportation).
+Walking along the boundary of a proxy region  (counterclockwise), a <em>chord</em> is a sequence of halfedges connecting two anchors. One cluster boundary cycle may consist of several chords. A connected region with holes may yield several boundary cycles (\cgalFigureRef{operations}, planar part before teleportation).
 
-In order to approximate complex boundaries well, more anchors are generated by recursive chord subdivision (Figure \cgalFigureRef{chord}). An anchor \f$ \mathbf{c} \f$ is added at the furthest vertex of a chord \f$ (\mathbf{a}, \mathbf{b}) \f$, split it into \f$ (\mathbf{a}, \mathbf{c}) \f$ and \f$ (\mathbf{c}, \mathbf{b}) \f$, if the distance \f$ d = \Vert \mathbf{c} , (\mathbf{a}, \mathbf{b}) \Vert \f$ is beyond certain threshold. To make \f$ d \f$ independent to the scale of the input:
+In order to approximate complex boundaries well, more anchors are generated by recursive chord subdivision (\cgalFigureRef{chord}). An anchor \f$ \mathbf{c} \f$ is added at the furthest vertex of a chord \f$ (\mathbf{a}, \mathbf{b}) \f$, split it into \f$ (\mathbf{a}, \mathbf{c}) \f$ and \f$ (\mathbf{c}, \mathbf{b}) \f$, if the distance \f$ d = \Vert \mathbf{c} , (\mathbf{a}, \mathbf{b}) \Vert \f$ is beyond certain threshold. To make \f$ d \f$ independent to the scale of the input:
 \f[ d = d / input\_mesh\_average\_edge\_length. \f]
 Optionally, \f$ d \f$ can be measured as the ratio of the chord length:
 \f[ d = d / \Vert(\mathbf{a}, \mathbf{b})\Vert. \f]
@@ -129,7 +129,7 @@ Varying the chord error. From left to right: clustering partition, and meshing w
 
 \subsubsection sma_anchors_additional Additional Anchors
 
-For a boundary cycle without any anchor such as the hole depicted Figure \cgalFigureRef{operations}, we first add a starting anchor to the boundary. We then subdivide this circular chord to ensure that every boundary cycle has at least 2 anchors (i.e., every chord is connecting 2 different anchors, Figure \cgalFigureRef{anchors}). Finally, we add additional anchors to ensure that at least three anchor vertices are generated on every boundary cycle.
+For a boundary cycle without any anchor such as the hole depicted \cgalFigureRef{operations}, we first add a starting anchor to the boundary. We then subdivide this circular chord to ensure that every boundary cycle has at least 2 anchors (i.e., every chord is connecting 2 different anchors, \cgalFigureRef{anchors}). Finally, we add additional anchors to ensure that at least three anchor vertices are generated on every boundary cycle.
 
 \cgalFigureBegin{anchors, anchors.jpg}
 Adding anchors. From left to right: starting from a partition (grey) with a hole (white) and two encircled regions (green and blue), we add a starting anchor (orange disk) to the boundary cycle (red dash line) without any anchor (2nd), subdivide the circular chord (3rd, the number indicates the level of recursion) and add anchors to the boundary cycle with less than 2 anchors (4th, red dash lines).
@@ -139,7 +139,7 @@ Adding anchors. From left to right: starting from a partition (grey) with a hole
 
 With the anchors defined, their chord connection graph forms a general polygon mesh. Because of non-flat, concave polygon or polygons with holes, we need to triangulate this initial polygon mesh. The triangulation is generated by computing a discrete variant of a constrained 2D Delaunay triangulation, where distances are measured on the input triangle mesh.
 
-The first image of Figure \cgalFigureRef{triangulation} depicts how the Delaunay triangulation of set of points (colored disks) is deduced from its dual Voronoi diagram (colored regions separated by blue lines) by connecting the points indicated by the vertices (red circles) where 3 Voronoi cells meet. In an analogous manner, we construct discrete Voronoi cells from which the triangulation is extracted.
+The first image of \cgalFigureRef{triangulation} depicts how the Delaunay triangulation of set of points (colored disks) is deduced from its dual Voronoi diagram (colored regions separated by blue lines) by connecting the points indicated by the vertices (red circles) where 3 Voronoi cells meet. In an analogous manner, we construct discrete Voronoi cells from which the triangulation is extracted.
 
 
 In a first step, we start a flooding of the interior of the region, coloring the vertices according to their closest anchor vertex. We then only flood the boundary of a region so that every vertex on it is colored depending on the closest anchor vertex. This enforces the constrained edges by forcing the boundary to be in it.
@@ -169,7 +169,7 @@ Free function with \ref bgl_namedparameters options.
 - `CGAL::Surface_mesh_approximation::approximate_triangle_mesh()`: given a triangle mesh, approximate the geometry with default \f$ \mathcal{L}^{2,1} \f$ metric.
 
 Class interface:
-- `CGAL::Variational_shape_approximation`: allowing more customization of the proxy, metric and approximation process. As shown in Figure \cgalFigureRef{workflow}, typical calling order of the approximation and meshing process is:
+- `CGAL::Variational_shape_approximation`: allowing more customization of the proxy, metric and approximation process. As shown in \cgalFigureRef{workflow}, typical calling order of the approximation and meshing process is:
   - \link CGAL::Variational_shape_approximation::initialize_seeds initialize seeds \endlink
   - \link CGAL::Variational_shape_approximation::run run clustering iterations \endlink
   - \link CGAL::Variational_shape_approximation::extract_mesh extract mesh \endlink
@@ -209,7 +209,7 @@ The class interface `CGAL::Variational_shape_approximation` offers a flexible me
 Comparison of different error metrics on the bear model, with 200 proxies and hierarchical seeding. From left to right: \f$ \mathcal{L}^{2,1} \f$ metric, \f$ \mathcal{L}^2 \f$ metric and custom compact metric.
 \cgalFigureEnd
 
-The following example defines a point-wise proxy to yield an isotropic approximation. The output mesh is depicted in Figure \cgalFigureRef{vsa_metric_comparison}.
+The following example defines a point-wise proxy to yield an isotropic approximation. The output mesh is depicted in \cgalFigureRef{vsa_metric_comparison}.
 
 \cgalExample{Surface_mesh_approximation/vsa_isotropic_metric_example.cpp}
 
diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
index 5a8a704883d..e89c30f0815 100644
--- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
+++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
@@ -49,7 +49,7 @@ public:
   /// Returns the vector (x,y,z)
   Vector vector(double x, double y, double z);
 
-  /// Returns `i`th coefficient of a vector
+  /// Returns `i`-th coefficient of a vector
   double vector_coordinate(const Vector& v, int i);
 
   /// Computes a rotation matrix close to `m` and places it into `R`
diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
index 3aae43c9c42..5919a1aada7 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
@@ -93,7 +93,7 @@ using the `Surface_mesh` built-in property mechanism.
 
 \cgalExample{Surface_mesh_parameterization/simple_parameterization.cpp}
 
-Figure \cgalFigureRef{Surface_mesh_parameterizationfigsimple} illustrates the input and output
+\cgalFigureRef{Surface_mesh_parameterizationfigsimple} illustrates the input and output
 of this program.
 
 \cgalFigureAnchor{Surface_mesh_parameterizationfigsimple}
@@ -179,9 +179,9 @@ depending on the type of border parameterization that is required: fixed border,
 free border, and borderless.
 
 Illustrations of the different methods are obtained with the same input model,
-the <i>hand</i> model, shown in Figure \cgalFigureRef{Surface_mesh_parameterizationfigbase}.
+the <i>hand</i> model, shown in \cgalFigureRef{Surface_mesh_parameterizationfigbase}.
 The hand is a topological sphere, and a `Seam_mesh` is used to cut it into
-a topological disk. In Figure \cgalFigureRef{Surface_mesh_parameterizationfigbase},
+a topological disk. In \cgalFigureRef{Surface_mesh_parameterizationfigbase},
 the seam is traced in red and the four cones used for Orbifold Tutte
 Parameterization (Section \ref Surface_mesh_parameterizationOrbi) are marked with green dots.
 
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
index a0324ab28ed..f85508a09fd 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
@@ -114,7 +114,7 @@ public:
   `Point_2 operator()(Segment_2 s, int i)`
   to return the source or target of `s`, depending on whether `i` is 0 or 1 respectively, and
   `Point_2 operator()(Triangle_2 t, int i)`
-  to return the `i`th vertex of `t`.
+  to return the `i`-th vertex of `t`.
   */
   typedef unspecified_type Construct_vertex_2;
 
@@ -186,7 +186,7 @@ public:
   `Point_3 operator()(Segment_3 s, int i)`
   to return the source or target of `s`, depending on whether `i` is 0 or 1 respectively, and
   `Point_3 operator()(Triangle_3 t, int i)`
-  to return the `i`th vertex of `t`.
+  to return the `i`-th vertex of `t`.
   */
   typedef unspecified_type Construct_vertex_3;
 
@@ -231,9 +231,9 @@ public:
   Function object type that provides
   `Triangle_2 operator()(Triangle_3 t, std::size_t i, Segment_2 base)`
   which computes a 2-dimensional projection of t that preserves edge lengths,
-  such that the `i`th edge of the projection of `t` is incident to `base`.
+  such that the `i`-th edge of the projection of `t` is incident to `base`.
 
-  \pre The length of the `i`th edge of `t` is equal to the length of `base`
+  \pre The length of the `i`-th edge of `t` is equal to the length of `base`
   */
   typedef unspecified_type Construct_triangle_3_along_segment_2_flattening;
 
@@ -258,7 +258,7 @@ public:
   /*!
   Function object type that provides
   `FT operator(Barycentric_coordinates b, std::size_t i)`
-  to get the `i`th weight of barycentric coordinates `b`.
+  to get the `i`-th weight of barycentric coordinates `b`.
   */
   typedef unspecified_type Construct_barycentric_coordinates_weight;
 
diff --git a/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Minimal_quadrangulation.h b/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Minimal_quadrangulation.h
index 6ced0efbf15..4af6c45dd35 100644
--- a/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Minimal_quadrangulation.h
+++ b/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Minimal_quadrangulation.h
@@ -1280,7 +1280,7 @@ protected:
         else
         {// there is at least a hole around the vertex
          // we set the 0-th dart just after a hole
-         // then we add 1 to the next dart if we dont cross a hole
+         // then we add 1 to the next dart if we don't cross a hole
          // and we add deg(v)+1 if we cross a hole
           dh=it;
           while(!get_local_map().is_marked(dh, m_mark_perforated))
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
index a8411edcbbd..eb277fce941 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
@@ -273,7 +273,7 @@ Returns the same facet seen from the other adjacent cell.
 Facet mirror_facet(Facet f) const;
 
 /*!
-Return the indexes of the `j`th vertex of the facet of a cell
+Return the indexes of the `j`-th vertex of the facet of a cell
 opposite to vertex `i`.
 */
 int vertex_triple_index(const int i, const int j);
diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
index 47b7353fd79..2c007c5955a 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
@@ -42,7 +42,7 @@ namespace Surface_sweep_2 {
  *
  * The algorithm is also extended to support the following degenerate cases:
  * - vertical segments
- * - multiple (more then two) curves intersecting at one point
+ * - multiple (more than two) curves intersecting at one point
  * - curves beginning and ending on other curves.
  * - overlapping curves
  *
diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
index 182b7cbd811..df7bd3a5510 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
@@ -480,7 +480,7 @@ void Surface_sweep_2<Vis>::_remove_curve_from_status_line(Subcurve* leftCurve,
   leftCurve->set_hint(this->m_statusLine.end());
 
   if (! remove_for_good) {
-    // the subcurve is not removed for good, so we dont need to intersect
+    // the subcurve is not removed for good, so we don't need to intersect
     // its neighbors after its removal.
     CGAL_SS_PRINT_ERASE(*sliter);
     this->m_statusLine.erase(sliter);
diff --git a/TDS_2/include/CGAL/Triangulation_data_structure_2.h b/TDS_2/include/CGAL/Triangulation_data_structure_2.h
index 7eb651ef407..e254fed4b55 100644
--- a/TDS_2/include/CGAL/Triangulation_data_structure_2.h
+++ b/TDS_2/include/CGAL/Triangulation_data_structure_2.h
@@ -162,7 +162,7 @@ public:
 public:
 // The face_iterator_base_begin  gives the possibility to iterate over all
 // faces in the container  independently of the dimension.
-  // public for the need of file_ouput() of Constrained triangulation
+  // public for the need of file_output() of Constrained triangulation
   // should be made private later
 
   Face_iterator face_iterator_base_begin() const    {
diff --git a/TDS_3/doc/TDS_3/CGAL/Triangulation_utils_3.h b/TDS_3/doc/TDS_3/CGAL/Triangulation_utils_3.h
index f78421c4a46..bc42a6f850a 100644
--- a/TDS_3/doc/TDS_3/CGAL/Triangulation_utils_3.h
+++ b/TDS_3/doc/TDS_3/CGAL/Triangulation_utils_3.h
@@ -43,7 +43,7 @@ opposite to this neighbor `n`. (see \cgalFigureRef{Triangulation3figutils}).
 static unsigned int next_around_edge(unsigned int i, unsigned int j);
 
 /*!
-In dimension 3, index of the `j`'th vertex in counterclockwise order on the face opposite to vertex with `i` of the cell.
+In dimension 3, index of the `j`-th vertex in counterclockwise order on the face opposite to vertex with `i` of the cell.
 \pre `( i < 4 ) && ( j < 3 )`.
 */
   static int vertex_triple_index(const int i, const int j);
diff --git a/TDS_3/include/CGAL/Triangulation_data_structure_3.h b/TDS_3/include/CGAL/Triangulation_data_structure_3.h
index ca34d9f92c5..3c2d36a1b59 100644
--- a/TDS_3/include/CGAL/Triangulation_data_structure_3.h
+++ b/TDS_3/include/CGAL/Triangulation_data_structure_3.h
@@ -1736,7 +1736,7 @@ create_star_3(Vertex_handle v, Cell_handle c, int li, int prev_ind2)
       Cell_handle nnn = n->neighbor(next_around_edge(jj2, jj1));
       int zzz = nnn->index(vvv);
       if (nnn == cur) {
-        // Neighbor relation is reciprocal, ie
+        // Neighbor relation is reciprocal, i.e.
         // the cell we are looking for is not yet created.
         nnn = create_star_3(v, nnn, zz, zzz);
       }
@@ -1794,7 +1794,7 @@ recursive_create_star_3(Vertex_handle v, Cell_handle c, int li,
       Cell_handle nnn = n->neighbor(next_around_edge(jj2, jj1));
       int zzz = nnn->index(vvv);
       if (nnn == cur) {
-        // Neighbor relation is reciprocal, ie
+        // Neighbor relation is reciprocal, i.e.
         // the cell we are looking for is not yet created.
         nnn = recursive_create_star_3(v, nnn, zz, zzz,depth+1);
       }
@@ -1855,7 +1855,7 @@ non_recursive_create_star_3(Vertex_handle v, Cell_handle c, int li, int prev_ind
         Cell_handle nnn = n->neighbor(next_around_edge(jj2, jj1));
         int zzz = nnn->index(vvv);
         if (nnn == cur) {
-          // Neighbor relation is reciprocal, ie
+          // Neighbor relation is reciprocal, i.e.
           // the cell we are looking for is not yet created.
           //re-run the loop
           adjacency_info_stack.push( iAdjacency_info(zzz,cnew,ii,c,li,prev_ind2) );
@@ -2344,7 +2344,7 @@ flip( Cell_handle c, int i )
   int in = n->index(c);
 
   // checks that the facet is flippable,
-  // ie the future edge does not already exist
+  // i.e. the future edge does not already exist
   if (is_edge(c->vertex(i), n->vertex(in)))
       return false;
 
@@ -2367,7 +2367,7 @@ flip_flippable(Cell_handle c, int i )
   int in = n->index(c);
 
   // checks that the facet is flippable,
-  // ie the future edge does not already exist
+  // i.e. the future edge does not already exist
   CGAL_expensive_precondition( !is_edge(c->vertex(i),
                                                       n->vertex(in)));
   flip_really(c,i,n,in);
@@ -2429,7 +2429,7 @@ flip( Cell_handle c, int i, int j )
                                    && (number_of_vertices() >= 6) );
   CGAL_expensive_precondition( is_cell(c) );
 
-  // checks that the edge is flippable ie degree 3
+  // checks that the edge is flippable, i.e. degree 3
   int degree = 0;
   Cell_circulator ccir = incident_cells(c,i,j);
   Cell_circulator cdone = ccir;
@@ -2479,7 +2479,7 @@ flip_flippable( Cell_handle c, int i, int j )
                                    && (number_of_vertices() >= 6) );
   CGAL_expensive_precondition( is_cell(c) );
 
-  // checks that the edge is flippable ie degree 3
+  // checks that the edge is flippable, i.e. degree 3
   CGAL_precondition_code( int degree = 0; );
   CGAL_precondition_code
     ( Cell_circulator ccir = incident_cells(c,i,j); );
diff --git a/TDS_3/include/CGAL/Triangulation_simplex_3.h b/TDS_3/include/CGAL/Triangulation_simplex_3.h
index c6245e8bb9f..252869bf523 100644
--- a/TDS_3/include/CGAL/Triangulation_simplex_3.h
+++ b/TDS_3/include/CGAL/Triangulation_simplex_3.h
@@ -294,6 +294,10 @@ struct Output_rep<Triangulation_simplex_3<TriangulationDataStructure_3>, Tag >
   Simplex simplex;
   Tag tag;
 
+  Output_rep(Simplex s)
+    : simplex(s)
+  {}
+
   std::ostream& operator()(std::ostream& os) const {
     auto display_vert = [&](auto v) {
       return CGAL::IO::oformat(v, tag);
diff --git a/Three/include/CGAL/Three/Primitive_container.h b/Three/include/CGAL/Three/Primitive_container.h
index 613af38b7e9..8a22c7fc639 100644
--- a/Three/include/CGAL/Three/Primitive_container.h
+++ b/Three/include/CGAL/Three/Primitive_container.h
@@ -178,7 +178,7 @@ public:
   //!
   void setVbos(std::vector<Vbo*>);
   //!
-  //! \brief setVbo sets the `vbo_id`th `Vbo` of this container to `vbo`.
+  //! \brief setVbo sets the `vbo_id`-th `Vbo` of this container to `vbo`.
   //! \param vbo_id
   //! \param vbo
   //!
@@ -199,7 +199,7 @@ public:
   //!
   Vao* getVao(Viewer_interface* viewer)const;
   //!
-  //! \brief getVbo returns the `id`th Vbo of this container.
+  //! \brief getVbo returns the `id`-th Vbo of this container.
   //!
   Vbo *getVbo(std::size_t id)const;
   //!
diff --git a/Three/include/CGAL/Three/Scene_interface.h b/Three/include/CGAL/Three/Scene_interface.h
index e246abdf2de..dde0016be5b 100644
--- a/Three/include/CGAL/Three/Scene_interface.h
+++ b/Three/include/CGAL/Three/Scene_interface.h
@@ -102,7 +102,7 @@ public:
   //! \brief The number of items
   //!@returns the number of items in the scene.
   virtual int numberOfEntries() const = 0;
-  //!\brief The `id`th item.
+  //!\brief The `id`-th item.
   //! @returns the item with the specified index.
   virtual CGAL::Three::Scene_item* item(Item_id id) const = 0;
   //!\brief The id of `item`
@@ -131,7 +131,7 @@ public:
   virtual double len_diagonal() const = 0;
 
 public:
-  //! Updates the information about the `i`th item in the
+  //! Updates the information about the `i`-th item in the
   //! Geometric Objects list and redraws the scene.
   virtual void itemChanged(Item_id i) = 0;
   //! Updates the information about `item` in the
diff --git a/Three/include/CGAL/Three/Scene_item_rendering_helper.h b/Three/include/CGAL/Three/Scene_item_rendering_helper.h
index e6928c3dcb6..2438f83ac6a 100644
--- a/Three/include/CGAL/Three/Scene_item_rendering_helper.h
+++ b/Three/include/CGAL/Three/Scene_item_rendering_helper.h
@@ -94,20 +94,20 @@ public:
   //! @returns the item's bounding box.
   Scene_item::Bbox bbox()const override;
   //!
-  //! \brief getTriangleContainer returns the `id`th `Triangle_container`.
+  //! \brief getTriangleContainer returns the `id`-th `Triangle_container`.
   //!
   CGAL::Three::Triangle_container* getTriangleContainer(std::size_t id) const;
   //!
-  //! \brief getEdgeContainer returns the `id`th `Edge_container`.
+  //! \brief getEdgeContainer returns the `id`-th `Edge_container`.
   //!
   CGAL::Three::Edge_container* getEdgeContainer(std::size_t id) const;
   //!
-  //! \brief getPointContainer returns the `id`th `Point_container`.
+  //! \brief getPointContainer returns the `id`-th `Point_container`.
   //!
   CGAL::Three::Point_container* getPointContainer(std::size_t id) const;
 
   //!
-  //! \brief setTriangleContainer sets the `id`th `Triangle_container` to `tc`.
+  //! \brief setTriangleContainer sets the `id`-th `Triangle_container` to `tc`.
   //!
   //! If `id` is bigger than the current size of the container vector, this vector is
   //! resized accordingly. This means that for optimization reasons, containers should be created
@@ -117,7 +117,7 @@ public:
                             Triangle_container* tc);
 
   //!
-  //! \brief setEdgeContainer sets the `id`th `Edge_container` to `tc`.
+  //! \brief setEdgeContainer sets the `id`-th `Edge_container` to `tc`.
   //!
   //! If `id` is bigger than the current size of the container vector, this vector is
   //! resized accordingly. This means that for optimization reasons, containers should be created
@@ -127,7 +127,7 @@ public:
                         Edge_container* tc);
 
   //!
-  //! \brief setPointContainer sets the `id`th `Point_container` to `tc`.
+  //! \brief setPointContainer sets the `id`-th `Point_container` to `tc`.
   //!
   //! If `id` is bigger than the current size of the container vector, this vector is
   //! resized accordingly. This means that for optimization reasons, containers should be created
diff --git a/Three/include/CGAL/Three/Viewer_interface.h b/Three/include/CGAL/Three/Viewer_interface.h
index 63d6824d613..8df31c7265a 100644
--- a/Three/include/CGAL/Three/Viewer_interface.h
+++ b/Three/include/CGAL/Three/Viewer_interface.h
@@ -223,7 +223,7 @@ public:
   //! Customizable from the MainWindow or the SubViewer menu.
   virtual float total_pass() = 0;
 Q_SIGNALS:
-  //!Emit this to signal that the `id`th item has been picked.
+  //!Emit this to signal that the `id`-th item has been picked.
   void selected(int id);
   //!Emit this to require a contextual menu to appear at `global_pos`.
   void requestContextMenu(QPoint global_pos);
@@ -286,7 +286,7 @@ public:
   virtual QVector4D* clipBox() const =0;
   virtual bool isClipping() const = 0;
   //!  A vector indicating the scaling factors to apply to the scene when displaying it.
-  //!  It can be useful when a scene is very large along one of it's coordinates, making it hard to visualize it.
+  //!  It can be useful when a scene is very large along one of its coordinates, making it hard to visualize it.
   virtual const QVector3D& scaler() const = 0;
 
   virtual void showEntireScene() = 0;
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
index 7649be08913..e12ab593ff7 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
@@ -480,7 +480,7 @@ The indexing of the vertices in the
 full cell is such that, if `f` was a full cell of maximal dimension in the
 initial complex, then `(f,v)`, in this order, is the corresponding full cell
 in the updated triangulation. A handle to `v` is returned
-(see Figure \cgalFigureRef{triangulationfiginsertincreasedim}).
+(see \cgalFigureRef{triangulationfiginsertincreasedim}).
 \pre
 If the current dimension is -2 (empty triangulation), then `star`
 can be omitted (it is ignored), otherwise
@@ -541,7 +541,7 @@ void clear();
 /*!
 Contracts the
 `Face f` to a single vertex. Returns a handle to that vertex
-(see Figure \cgalFigureRef{triangulationfigcollapseface}).
+(see \cgalFigureRef{triangulationfigcollapseface}).
 \pre The boundary of the full cells incident to `f`
 is a topological sphere of dimension
 `tds`.`current_dimension()`-1).
@@ -561,7 +561,7 @@ This method does exactly the opposite of
 full cells not containing `star` are removed,
 full cells containing `star` but not `v` lose vertex `star`,
 full cells containing `star` and `v` lose vertex `v`
-(see Figure \cgalFigureRef{triangulationfiginsertincreasedim}).
+(see \cgalFigureRef{triangulationfiginsertincreasedim}).
 \pre All cells contain either `star` or `v`.
 Edge `star-v` exists in the triangulation
 and `current_dimension() != -2`.
diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index 2e7c8e538bd..8fe83b3fdd5 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -163,7 +163,7 @@ neighbors. Its vertices and neighbors are indexed from \f$ 0\f$ to \f$ d \f$. Th
 of its neighbors have the following meaning: the \f$ i\f$-th neighbor of \f$ \sigma\f$
 is the unique neighbor of \f$ \sigma\f$ that does not contain the \f$ i\f$-th vertex of
 \f$ \sigma\f$; in other words, it is the neighbor of \f$ \sigma\f$ <I>opposite</I> to
-the \f$ i\f$-th vertex of \f$ \sigma\f$ (Figure \cgalFigureRef{triangulationfigfullcell}).
+the \f$ i\f$-th vertex of \f$ \sigma\f$ (\cgalFigureRef{triangulationfigfullcell}).
 
 The vertices and full cells of the triangulations are accessed through
 `handles` and `iterators`. A handle is a model of the
@@ -183,7 +183,7 @@ to \f$ f \f$.
 \if READY_TO_PUBLISH
 \cgalAdvanced The index of a full cell \f$ c\f$ in the \f$ i\f$-th
 neighbor of \f$ c\f$ is called the <I>\f$ i\f$-th mirror-index</I> of
-\f$ c\f$ (Figure \cgalFigureRef{triangulationfigfullcell}).  Mirror indices are
+\f$ c\f$ (\cgalFigureRef{triangulationfigfullcell}).  Mirror indices are
 often needed for maintaining the triangulation data structure. Thus,
 it might be desirable, for performance reasons, to store the mirror
 indices alongside the references to the vertices and neighbors in a
diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
index fb97a042599..1fa311710e0 100644
--- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
+++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
@@ -1055,7 +1055,7 @@ one can easily obtain the input constraints that induce `e`.
 \subsection Subsection_Edges_and_Constraints Edges, Constrained Edges, Constraints, and Subconstraints
 
 All triangulation classes define the type `Edge` as  `typedef std::pair<Face_handle, int> Edge`.
-For a pair `(fh,i)` it is the edge of the face `*fh`, which is opposite to the `i`'th vertex.
+For a pair `(fh,i)` it is the edge of the face `*fh`, which is opposite to the `i`-th vertex.
 
 A <em>constrained edge</em> `e` is an edge of a constrained triangulation `ct`, for which `ct.is_constrained(e)` returns `true`.
 
diff --git a/Triangulation_3/demo/Triangulation_3/Viewer.cpp b/Triangulation_3/demo/Triangulation_3/Viewer.cpp
index 12308b48517..d81f3ca7037 100644
--- a/Triangulation_3/demo/Triangulation_3/Viewer.cpp
+++ b/Triangulation_3/demo/Triangulation_3/Viewer.cpp
@@ -2040,7 +2040,7 @@ void Viewer::mouseReleaseEvent(QMouseEvent *event)
             } else {
                 displayMessage( tr("No point is selected.") );
             }
-        } else {  /* select multiple points, ie. selection window > 1 */
+        } else {  /* select multiple points, i.e. selection window > 1 */
             // define selection window
             if( m_rectSel.width() < 10 )
                 setSelectRegionWidth( 10 );
diff --git a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
index 5e2a44f9b2f..0e555a26767 100644
--- a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
+++ b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
@@ -807,7 +807,7 @@ in \cgalCite{msri52:liu-snoeyink-05}.
 
 \subsection Triangulation_3ParallelPerformance Parallel Performance
 
-Figure \cgalFigureRef{Triangulation3figparallelspeedup} shows insertion
+\cgalFigureRef{Triangulation3figparallelspeedup} shows insertion
 and removal speed-ups obtained using the parallel version of the
 triangulation algorithms of \cgal 4.5. The machine used is a PC running
 Windows 7 64-bits with two 6-core
diff --git a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
index 63ade11b5e8..35517beb83e 100644
--- a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
@@ -1542,7 +1542,7 @@ side_of_circle(Cell_handle c, int i, const Point& p, bool perturb) const
   if(dimension() == 2)
   {
     CGAL_precondition(i == 3);
-    // the triangulation is supposed to be valid, ie the facet
+    // the triangulation is supposed to be valid, i.e. the facet
     // with vertices 0 1 2 in this order is positively oriented
     if(! c->has_vertex(infinite_vertex(), i3))
       return coplanar_side_of_bounded_circle(c->vertex(0)->point(),
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
index 97459a258a1..6b5246c0d21 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
@@ -2148,7 +2148,7 @@ side_of_power_circle(Cell_handle c, int i, const Weighted_point& p,
   if(dimension() == 2)
   {
     CGAL_precondition(i == 3);
-    // the triangulation is supposed to be valid, ie the facet
+    // the triangulation is supposed to be valid, i.e. the facet
     // with vertices 0 1 2 in this order is positively oriented
     if(! c->has_vertex(infinite_vertex(), i3))
       return Bounded_side(side_of_oriented_power_circle(c->vertex(0)->point(),
diff --git a/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp b/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp
index 1a92679db60..1d16f47e079 100644
--- a/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp
+++ b/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp
@@ -25,7 +25,11 @@
 #include <fstream>
 #include <string>
 #include <string_view>
+
+#if CGAL_CXX20 && __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
 #include <ranges>
+#endif
+
 #include <optional>
 #include <chrono>
 
@@ -508,9 +512,19 @@ int go(Mesh mesh, CDT_options options) {
     {
       std::ofstream dump(options.output_filename);
       dump.precision(17);
+#if CGAL_CXX20 && __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
       cdt.write_facets(dump, cdt, std::views::filter(cdt.finite_facets(), [&](auto f) {
           return cdt.is_facet_constrained(f);
       }));
+#else
+      auto is_facet_constrained = [&](auto f) { return cdt.is_facet_constrained(f); };
+      auto it_end = cdt.finite_facets_end();
+      cdt.write_facets(dump, cdt,
+                        CGAL::make_range(
+                          boost::make_filter_iterator(is_facet_constrained,cdt.finite_facets_begin(), it_end),
+                          boost::make_filter_iterator(is_facet_constrained,it_end, it_end)));
+
+#endif
     }
     CGAL_CDT_3_TASK_END(output_task_handle);
   };
@@ -554,8 +568,20 @@ int go(Mesh mesh, CDT_options options) {
   start_time = std::chrono::high_resolution_clock::now();
   CGAL_CDT_3_TASK_BEGIN(compute_distances_task_handle);
   {
+#if CGAL_CXX20 && __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
     auto [min_sq_distance, min_edge] = (std::ranges::min)(
         cdt.finite_edges() | std::views::transform([&](auto edge) { return std::make_pair(cdt.segment(edge).squared_length(), edge); }));
+#else
+    auto trsf = [&](auto edge) { return std::make_pair(cdt.segment(edge).squared_length(), edge); };
+    auto min_p = trsf(*cdt.finite_edges_begin());
+    for (auto ite=cdt.finite_edges_begin(); ite!=cdt.finite_edges_end(); ++ite)
+    {
+      auto p = trsf(*ite);
+      if (p < min_p)
+        p = min_p;
+    }
+    auto [min_sq_distance, min_edge]  = min_p;
+#endif
     auto min_distance = CGAL::approximate_sqrt(min_sq_distance);
     auto vertices_of_min_edge = cdt.vertices(min_edge);
     if(!options.quiet) {
@@ -654,10 +680,17 @@ int go(Mesh mesh, CDT_options options) {
         for(auto& polyline: polylines) {
           assert(polyline.front() == polyline.back());
           polyline.pop_back();
+#if CGAL_CXX20 && __cpp_lib_concepts >= 201806L && __cpp_lib_ranges >= 201911L
           face_index = cdt.insert_constrained_face(
             polyline | std::views::transform([&](vertex_descriptor v) { return get(tr_vertex_pmap, v); }),
             false,
             face_index ? *face_index : -1);
+#else
+          face_index = cdt.insert_constrained_face( CGAL::Iterator_range(CGAL::make_transform_iterator_from_property_map(polyline.begin(), tr_vertex_pmap),
+                                                                         CGAL::make_transform_iterator_from_property_map(polyline.end(), tr_vertex_pmap)),
+            false,
+            face_index ? *face_index : -1);
+#endif
         }
       }
     } else {
diff --git a/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp b/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp
index 9252598776c..fd9cb735410 100644
--- a/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp
+++ b/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp
@@ -32,8 +32,11 @@ int degeneracy_counter = 0;
 // This gives a rough idea of how degenerate a data set is.
 struct traits : public K
 {
-    struct Power_side_of_oriented_power_sphere_3 : public K::Power_side_of_oriented_power_sphere_3
+    struct Power_side_of_oriented_power_sphere_3
+      : public K::Power_side_of_oriented_power_sphere_3
     {
+      using Oriented_side = K::Oriented_side;
+
       typedef K::Weighted_point_3 Weighted_point;
         typedef K::Power_side_of_oriented_power_sphere_3 P3;
         Oriented_side operator() (const Weighted_point &p0,
diff --git a/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt
new file mode 100644
index 00000000000..bea47a9213a
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt
@@ -0,0 +1,26 @@
+cmake_minimum_required(VERSION 3.12...3.31)
+
+project( Triangulation_on_hyperbolic_surface_2_Demo )
+
+# Find includes in corresponding build directories
+set(CMAKE_INCLUDE_CURRENT_DIR ON)
+include_directories(${CMAKE_BINARY_DIR})
+
+# Instruct CMake to run moc automatically when needed.
+set(CMAKE_AUTOMOC ON)
+
+# CGAL and its components
+find_package(CGAL REQUIRED COMPONENTS Core Qt6)
+find_package(Qt6 QUIET COMPONENTS Widgets)
+
+if (NOT CGAL_Qt6_FOUND  OR NOT Qt6_FOUND)
+  message(STATUS "This project requires the Qt6 library, and will not be compiled.")
+  return()
+endif()
+
+# ui files, created with Qt Designer
+qt6_wrap_ui(UIS drawing_window_description.ui)
+
+add_executable( Triangulation_on_hyperbolic_surface_2_demo Triangulation_on_hyperbolic_surface_2_demo.cpp window.cpp ${UIS})
+target_link_libraries(Triangulation_on_hyperbolic_surface_2_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets )
+cgal_add_compilation_test(Triangulation_on_hyperbolic_surface_2_demo)
diff --git a/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2_demo.cpp b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2_demo.cpp
new file mode 100644
index 00000000000..d25d07c1b5a
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2_demo.cpp
@@ -0,0 +1,43 @@
+#include "window.h"
+
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_fundamental_domain_factory_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+
+using namespace CGAL;
+
+typedef Simple_cartesian<Exact_rational>                                Kernel;
+typedef Hyperbolic_Delaunay_triangulation_traits_2<Kernel>              ParentTraits;
+typedef Hyperbolic_surface_traits_2<ParentTraits>                       Traits;
+typedef Hyperbolic_fundamental_domain_2<Traits>                         Domain;
+typedef Hyperbolic_fundamental_domain_factory_2<Traits>                 Factory;
+typedef Triangulation_on_hyperbolic_surface_2<Traits>                   Triangulation;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+int main(int argc, char** argv)
+{
+  // 1. Generate the triangulation
+  Factory factory;
+  Domain domain = factory.make_hyperbolic_fundamental_domain_g2(time(NULL));
+  Triangulation triangulation = Triangulation(domain);
+  triangulation.make_Delaunay();
+
+  // 2. Draw the triangulation
+  QApplication app(argc, argv);
+  app.setApplicationName("Hyperbolic surfaces triangulation 2 Demo");
+
+  DemoWindow window;
+  window.item().draw_triangulation(triangulation);
+  window.show();
+
+  QStringList args = app.arguments();
+  args.removeAt(0);
+  return app.exec();
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/drawing_window_description.ui b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/drawing_window_description.ui
new file mode 100644
index 00000000000..cba64b8f300
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/drawing_window_description.ui
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<ui version="4.0">
+ <class>MainWindow</class>
+ <widget class="QMainWindow" name="MainWindow">
+  <property name="geometry">
+   <rect>
+    <x>0</x>
+    <y>0</y>
+    <width>800</width>
+    <height>720</height>
+   </rect>
+  </property>
+  <property name="sizePolicy">
+   <sizepolicy hsizetype="Expanding" vsizetype="Expanding">
+    <horstretch>0</horstretch>
+    <verstretch>0</verstretch>
+   </sizepolicy>
+  </property>
+  <property name="windowTitle">
+   <string>Hyperbolic flips demo window</string>
+  </property>
+  <widget class="QWidget" name="centralwidget">
+   <widget class="QGraphicsView" name="graphicsView">
+    <property name="geometry">
+     <rect>
+      <x>10</x>
+      <y>10</y>
+      <width>771</width>
+      <height>671</height>
+     </rect>
+    </property>
+    <property name="sizePolicy">
+     <sizepolicy hsizetype="Expanding" vsizetype="Expanding">
+      <horstretch>0</horstretch>
+      <verstretch>0</verstretch>
+     </sizepolicy>
+    </property>
+   </widget>
+  </widget>
+  <widget class="QStatusBar" name="statusbar"/>
+ </widget>
+ <resources/>
+ <connections/>
+</ui>
diff --git a/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/window.cpp b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/window.cpp
new file mode 100644
index 00000000000..c3f03539f0d
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/window.cpp
@@ -0,0 +1,269 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Monique Teillaud
+
+#include "window.h"
+
+DemoWindowItem::DemoWindowItem()
+  : CGAL::Qt::GraphicsItem()
+{
+  // Clear
+  edges_.clear();
+
+  // Prepare the pens
+  poincare_disk_pen_.setStyle(Qt::SolidLine);
+  poincare_disk_pen_.setWidth(8);
+  poincare_disk_pen_.setBrush(Qt::black);
+
+  edges_pen_.setStyle(Qt::SolidLine);
+  edges_pen_.setWidth(6);
+  edges_pen_.setBrush(Qt::blue);
+}
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void DemoWindowItem::paint(QPainter *painter,
+                           const QStyleOptionGraphicsItem*,
+                           QWidget*)
+{
+  // 1. Draw the poincaré disk
+  QRectF circle_rect = QRectF(-poincare_disk_radius_in_pixels_-3,
+                              -poincare_disk_radius_in_pixels_-3,
+                              2*poincare_disk_radius_in_pixels_+6,
+                              2*poincare_disk_radius_in_pixels_+6);
+  painter->setPen(poincare_disk_pen_);
+  painter->setBrush(QBrush());
+  painter->drawEllipse(circle_rect);
+
+  // 2. Draw the edges
+  painter->setBrush(QBrush());
+  painter->setPen(edges_pen_);
+  for (std::size_t  i=0; i<edges_.size(); i++) {
+    draw_edge(painter, edges_[i].first, edges_[i].second);
+  }
+}
+
+QRectF DemoWindowItem::boundingRect() const {
+  return QRectF(-poincare_disk_radius_in_pixels_-3,
+                -poincare_disk_radius_in_pixels_-3,
+                poincare_disk_radius_in_pixels_+6,
+                poincare_disk_radius_in_pixels_+6);
+}
+
+void DemoWindowItem::modelChanged() {} // Only used by Qt : we don't need to fill it
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void DemoWindowItem::draw_triangulation(Triangulation& triangulation)
+{
+  typedef std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,
+                                 Point, Point, Point> > RealizationVector;
+
+  RealizationVector realized_triangles;
+  realized_triangles = triangulation.lift();
+
+  Point point_1, point_2, point_3;
+  for (typename RealizationVector::iterator it = realized_triangles.begin(); it != realized_triangles.end(); ++it) {
+    point_1 = std::get<1>(*it);
+    point_2 = std::get<2>(*it);
+    point_3 = std::get<3>(*it);
+
+    edges_.push_back(std::make_pair(point_1, point_2));
+    edges_.push_back(std::make_pair(point_2, point_3));
+    edges_.push_back(std::make_pair(point_3, point_1));
+  }
+}
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void DemoWindowItem::draw_point(QPainter* painter, Point position)
+{
+  // First convert the point in doubles, well-scaled
+  double point_x = poincare_disk_radius_in_pixels_ * CGAL::to_double(position.x());
+  double point_y = poincare_disk_radius_in_pixels_ * CGAL::to_double(position.y());
+
+  // Then draw a small circle
+  QRectF circle_rect = QRectF(point_x-1, point_y-1, 3, 3);
+  painter->drawEllipse(circle_rect);
+}
+
+void DemoWindowItem::draw_edge(QPainter* painter, Point source, Point target)
+{
+  // First convert the points coordinates to doubles
+
+  double src_x = CGAL::to_double(source.x());
+  double src_y = CGAL::to_double(source.y());
+
+  double tar_x = CGAL::to_double(target.x());
+  double tar_y = CGAL::to_double(target.y());
+
+  // 0. If src and tar are too colinear or too close from each other then draw a line
+
+  double determinant = src_x*tar_y - src_y*tar_x; // determinant of the matrix whose columns are the vectors src and tar : indicates colinearity
+  double distance_squared = (src_x-tar_x)*(src_x-tar_x) + (src_y-tar_y)*(src_y-tar_y);
+  if ((std::abs(determinant) < computation_treshold_squared) || (distance_squared < computation_treshold_squared)) {
+    // src and tar are too colinear or too close from each other
+    draw_line(painter, src_x, src_y, tar_x, tar_y);
+    return;
+  }
+
+  // 1. Compute the center of the circle supporting the geodesic between src and tar
+
+  // 1.a Inverse src and tar with respect to the unit circle and find the euclidean midpoints of the segments between respectively
+  //       src and its inversion, and tar and its inversion
+
+  double src_norm_2 = src_x*src_x + src_y*src_y; // Can't be too close to zero because determinant was not
+  double tar_norm_2 = tar_x*tar_x + tar_y*tar_y; // Can't be too close to zero because determinant was not
+
+  double src_inv_x = src_x / src_norm_2;
+  double src_inv_y = src_y / src_norm_2;
+  double tar_inv_x = tar_x / tar_norm_2;
+  double tar_inv_y = tar_y / tar_norm_2;
+
+  // coordinates of the euclidean midpoints of the segments [src, src_inv] and [tar, tar_inv]
+  double src_mid_x = (src_x + src_inv_x) / 2;
+  double src_mid_y = (src_y + src_inv_y) / 2;
+  double tar_mid_x = (tar_x + tar_inv_x) / 2;
+  double tar_mid_y = (tar_y + tar_inv_y) / 2;
+
+  // 1.b Solve a system to find the intersection (center_x, center_y) of the bisectors of the two segments [src, src_inv] and [tar, tar_inv]:
+  //      (center_x \\ center y) = (a & b \\ c & d)^{-1} \times (u_x \\ u_y)
+
+  // 1.b.i define the system
+
+  double a = src_x;
+  double b = src_y;
+  double c = tar_x;
+  double d = tar_y;
+
+  double u_x = a*src_mid_x + b*src_mid_y;
+  double u_y = c*tar_mid_x + d*tar_mid_y;
+
+  // 1.b.ii solve the system (just a matrix inversion)
+  double det = a*d-b*c; // Can't be too close to zero...
+  double center_x = (d*u_x - b*u_y) / det;
+  double center_y = (-c*u_x + a*u_y) / det;
+
+  // 2. draw the arc supported by the circle whose center is (center_x, center_y) and whose extremities are src and tar
+  draw_arc(painter, src_x, src_y, tar_x, tar_y, center_x, center_y);
+}
+
+void DemoWindowItem::draw_line(QPainter* painter,
+                               double point_1_x, double point_1_y,
+                               double point_2_x, double point_2_y)
+{
+  // Convert to doubles and scale by the radius of the poincaré disk
+  double src_x = poincare_disk_radius_in_pixels_ * point_1_x;
+  double src_y = poincare_disk_radius_in_pixels_ * point_1_y;
+  double tar_x = poincare_disk_radius_in_pixels_ * point_2_x;
+  double tar_y = poincare_disk_radius_in_pixels_ * point_2_y;
+
+  // Actual drawing
+  QLineF line (src_x, src_y, tar_x, tar_y);
+  painter->drawLine(line);
+}
+
+void DemoWindowItem::draw_arc(QPainter* painter,
+                              double point_1_x, double point_1_y,
+                              double point_2_x, double point_2_y,
+                              double center_x, double center_y)
+{
+  // Draws the arc supported by the circle whose center is (center_x, center_y) and whose extremities are src and tar
+
+  // 1. Scale by the radius of the poincaré disk
+
+  double src_x = poincare_disk_radius_in_pixels_ * point_1_x;
+  double src_y = poincare_disk_radius_in_pixels_ * point_1_y;
+
+  double tar_x = poincare_disk_radius_in_pixels_ * point_2_x;
+  double tar_y = poincare_disk_radius_in_pixels_ * point_2_y;
+
+  double xc = poincare_disk_radius_in_pixels_ * center_x;
+  double yc = poincare_disk_radius_in_pixels_ * center_y;
+
+  // 2. Define the radius of the circle and the box [xm, xM] \times [ym, yM] bounding the circle
+
+  double circle_radius = sqrt((point_1_x-center_x)*(point_1_x-center_x) + (point_1_y-center_y)*(point_1_y-center_y));
+
+  double xm = poincare_disk_radius_in_pixels_ * (center_x - circle_radius);
+  double xM = poincare_disk_radius_in_pixels_ * (center_x + circle_radius);
+  double ym = poincare_disk_radius_in_pixels_ * (center_y - circle_radius);
+  double yM = poincare_disk_radius_in_pixels_ * (center_y + circle_radius);
+
+  // If the source and the target are too close from each other (less than 10 pixels) or if the circle is very big then just draw a line
+  double dist_sq = (src_x-tar_x)*(src_x-tar_x) + (src_y - tar_y)*(src_y-tar_y);
+  double rad_sq = (xM-xc)*(xM-xc) + (yM-yc)*(yM-yc);
+  if ((dist_sq < 100) ||  (rad_sq > 1000 * dist_sq)) {
+    QLineF line (src_x, src_y, tar_x, tar_y);
+    painter->drawLine(line);
+    return;
+  }
+
+  // 3. Compute angles (needed because we will draw using QPainter::drawArc)
+
+  // src_angle is the argument, in degrees, of point_1 - center
+  // tar_angle is the argument, in degrees, of point_2 - center
+  double src_angle = deg_angle(src_x - xc, src_y - yc);
+  double tar_angle = deg_angle(tar_x - xc, tar_y - yc);
+  src_angle = 360 - src_angle; // Because of y-axis inversion
+  tar_angle = 360 - tar_angle; // Because of y-axis-inversion
+
+  // Compute the sweep angle (see QPainter::drawArc)
+  double sweep_angle = tar_angle - src_angle;
+  while (sweep_angle > 180)
+    sweep_angle -= 360;
+  while (sweep_angle < -180)
+    sweep_angle += 360;
+
+  // 4. Actual Drawing
+
+  QRectF bbox_rect (xm, ym, xM-xm, yM-ym);
+  painter->drawArc(bbox_rect, src_angle*16, sweep_angle*16);
+}
+
+double DemoWindowItem::deg_angle(double x, double y)
+{
+  // To avoid problems when further division by x (ok since x^2 + y^2 not too small) :
+  if (x*x <  computation_treshold_squared) {
+    if (y>0) return 90;
+    return -90;
+  }
+
+  double angle = 180. * std::atan(y / x) / M_PI;
+  if (x < 0) {
+    return angle + 180.;
+  }
+  return angle;
+}
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+DemoWindow::DemoWindow() : DemosMainWindow()
+{
+  setupUi(this); // Method automatically generated by the ui file and here inherited from Ui::MainWindow. Builds the window and the contents for us...
+  this->graphicsView->setScene(&scene_); // ... in particular graphicsView is already constructed : we just put our scene in it and then do things within the scene
+  scene_.setItemIndexMethod(QGraphicsScene::NoIndex);
+  scene_.setSceneRect(-600, -600, 1200, 1200);
+  item_ = new DemoWindowItem();
+  scene_.addItem(item_);
+  this->graphicsView->scale(0.5, -0.5); // Y-axis inversion
+
+  setWindowTitle("Hyperbolic surfaces triangulation 2 Demo");
+}
+
+DemoWindowItem& DemoWindow::item()
+{
+  return *item_;
+}
+
+void DemoWindow::keyPressEvent(QKeyEvent*) {}
diff --git a/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/window.h b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/window.h
new file mode 100644
index 00000000000..18748f12f31
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/demo/Triangulation_on_hyperbolic_surface_2/window.h
@@ -0,0 +1,107 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Monique Teillaud
+
+#ifndef CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_DEMO_WINDOW
+#define CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_DEMO_WINDOW
+
+// Qt headers
+#include <CGAL/Qt/utility.h>
+#include <CGAL/Qt/GraphicsItem.h>
+#include <CGAL/Qt/DemosMainWindow.h>
+
+// UI generated header
+#include "ui_drawing_window_description.h"
+
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Simple_cartesian.h>
+
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+
+typedef CGAL::Simple_cartesian<CGAL::Exact_rational>                             Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>                 ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                          Traits;
+typedef Traits::Hyperbolic_point_2                                               Point;
+typedef CGAL::Triangulation_on_hyperbolic_surface_2<Traits>                      Triangulation;
+
+class DemoWindowItem
+  : public CGAL::Qt::GraphicsItem
+{
+  Q_OBJECT // Qt macro for Qt objects
+  // (Q_OBJECT does not support templates)
+
+private:
+  typedef CGAL::Bbox_2                                Bbox_2; // "Bounding box": just a box type used for drawing
+
+  // Edges to draw
+  std::vector<std::pair<Point,Point> > edges_;
+
+  // Pens for drawing
+  QPen poincare_disk_pen_;
+  QPen edges_pen_;
+
+  // radius of the poincaré disk
+  const int poincare_disk_radius_in_pixels_ = 600;
+
+  // Approximation treshold: used to decide when to simplify a computation (ex: draw a line
+  // instead of an arc if an hyperbolic segment is very small)
+  const double computation_treshold = 0.001;
+  const double computation_treshold_squared = computation_treshold*computation_treshold;
+
+public:
+  // Initializer
+  DemoWindowItem();
+
+  // Qt methods
+  void paint(QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget);
+  QRectF boundingRect() const;
+  void modelChanged();
+
+  // Drawing method
+  void draw_triangulation(Triangulation& triangulation);
+
+private:
+  // Sub-methods for drawing edges and vertices
+  void draw_point(QPainter* painter, Point position);
+
+  void draw_edge(QPainter* painter, Point source, Point target);
+  void draw_line(QPainter* painter, double point_1_x, double point_1_y, double point_2_x, double point_2_y);
+  void draw_arc(QPainter* painter, double point_1_x, double point_1_y, double point_2_x, double point_2_y, double center_x, double center_y);
+
+  double deg_angle(double x, double y);
+};
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+class DemoWindow
+  : public CGAL::Qt::DemosMainWindow,
+    public Ui::MainWindow
+{
+  Q_OBJECT // Qt macro for Qt objects
+  // (Q_OBJECT does not support templates)
+
+private:
+  QGraphicsScene scene_;
+  DemoWindowItem* item_;
+
+public:
+  DemoWindow();
+  DemoWindowItem& item();
+
+  // Events handling
+  void keyPressEvent(QKeyEvent* event);
+};
+
+#endif // CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_DEMO_WINDOW
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Complex_number.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Complex_number.h
new file mode 100644
index 00000000000..c064c46d209
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Complex_number.h
@@ -0,0 +1,14 @@
+namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2MainClasses
+
+  \cgalModels{ComplexNumber}
+
+  \tparam FT is the field type and must be a model of `FieldNumberType`.
+*/
+template <class FT>
+class Complex_number {
+};
+
+} // namespace CGAL
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_fundamental_domain_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_fundamental_domain_2.h
new file mode 100644
index 00000000000..4dcd9e4f49b
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_fundamental_domain_2.h
@@ -0,0 +1,116 @@
+namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2MainClasses
+
+  represents a fundamental domain of a closed orientable hyperbolic surface.
+  The domain is given as a polygon \f$ P  \f$ represented by the list of its vertices in the Poincaré disk model,
+  together with a pairing of the sides of \f$ P \f$.
+  The \f$ n \f$-th side of \f$ P \f$ is the side between the \f$ n \f$-th and the \f$ (n+1) \f$-th vertex, where indices are modulo the number of vertices of \f$ P \f$.
+  The side pairings are represented by a list of integers, such that if the \f$ n \f$-th integer of the list is \f$ m \f$, then the \f$ n \f$-th side is paired to the \f$ m \f$-th side.
+
+  \tparam Traits must be a model of `HyperbolicSurfaceTraits_2`.
+
+  \sa `Hyperbolic_fundamental_domain_factory_2`
+*/
+template<class Traits>
+class Hyperbolic_fundamental_domain_2
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+    Point type.
+  */
+  typedef typename Traits::Hyperbolic_point_2                    Point;
+
+  /// @}
+  /// \name Creation
+  /// @{
+
+  /*!
+    Default constructor
+  */
+  Hyperbolic_fundamental_domain_2();
+
+  /*!
+    Constructor from vertices and pairings ranges.
+
+    \tparam PointRange a model of the concepts `RandomAccessContainer` whose `value_type` is `Point`.
+    \tparam PairingRange a model of the concepts `RandomAccessContainer` whose `value_type` is `std::size_t`.
+  */
+  template<class PointRange, class PairingRange>
+  Hyperbolic_fundamental_domain_2(PointRange & vertices, PairingRange & pairings);
+  /// @}
+
+  /// \name Access Functions
+  /// @{
+
+  /*!
+    returns the number of vertices (equivalently, the number of sides) of the domain.
+
+    \pre <code>  Hyperbolic_fundamental_domain_2< Traits >::is_valid() </code>
+  */
+  std::size_t size() const;
+
+  /*!
+    returns the i-th vertex.
+
+    \pre <code> is_valid() </code>
+  */
+  const Point& vertex(std::size_t i) const;
+
+  /*!
+    returns the index of the side paired to the i-th side.
+
+    \pre <code> is_valid() </code>
+  */
+  std::size_t paired_side(std::size_t i) const;
+
+  /*!
+    returns the isometry that maps the side paired to side \f$ i \f$ to side \f$ i \f$.
+
+    \pre <code> is_valid() </code>
+  */
+  Hyperbolic_isometry_2<Traits> side_pairing(std::size_t i) const;
+
+  /// @}
+
+  /// \name Validity
+  /// @{
+
+  /*!
+    checks that the number of vertices is even, that there are as many side pairings as vertices,
+    and that the vertices all lie within the open unit disk.
+  */
+  bool is_valid() const;
+
+  /// @}
+};
+
+} // namespace CGAL
+
+/// \name Input/Output
+/// @{
+
+/*!
+  \brief inserts the domain in a stream.
+
+  The format of the output is the following.
+  The first line prints the number \f$n\f$ of vertices of the domain.
+  For \f$ i=0 \f$ to \f$ n-1 \f$ the index of the side paired to side \f$ i \f$ is printed on a separate line.
+  For \f$ i=0 \f$ to \f$ n-1 \f$ the i-th vertex is printed on a separate line.
+
+  \pre <code> is_valid() </code>
+*/
+std::ostream& operator<<(std::ostream& s, const Hyperbolic_fundamental_domain_2<Traits>& domain);
+
+/*!
+  \brief extracts the domain from a stream.
+
+  The format of the input must be the same as the format of the output of 'operator<<()'.
+*/
+std::istream& operator>>(std::istream& s, Hyperbolic_fundamental_domain_2<Traits>& domain);
+
+/// @}
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_fundamental_domain_factory_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_fundamental_domain_factory_2.h
new file mode 100644
index 00000000000..e08d8aff218
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_fundamental_domain_factory_2.h
@@ -0,0 +1,38 @@
+namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2MainClasses
+
+  Factory class, whose only purpose is to construct random fundamental domains of
+  closed orientable hyperbolic surfaces.
+
+  The function `make_hyperbolic_fundamental_domain_g2()` constructs such a domain for
+  a surface of genus two.
+
+  \tparam Traits must be a model of `HyperbolicSurfaceTraits_2`.
+*/
+template<class Traits>
+class Hyperbolic_fundamental_domain_factory_2
+{
+public:
+  /// \name Creation
+  /// @{
+
+  /*!
+    Constructor.
+  */
+  Hyperbolic_fundamental_domain_factory_2();
+  /// @}
+
+  /// \name Generation of a domain in genus two.
+  /// @{
+
+  /*!
+    randomly generates a convex domain of a closed orientable hyperbolic surface of genus two from a seed.
+  */
+  Hyperbolic_fundamental_domain_2<Traits> make_hyperbolic_fundamental_domain_g2(unsigned int seed);
+
+  /// @}
+};
+
+} // namespace CGAL
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_isometry_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_isometry_2.h
new file mode 100644
index 00000000000..0f79c3d98cd
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_isometry_2.h
@@ -0,0 +1,105 @@
+ namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2MainClasses
+
+  represents an isometry in the Poincaré disk model.
+  The isometry \f$ f \f$ is represented by a list \f$ (c_0, c_1, c_2, c_3) \f$ of complex numbers,
+  so that \f$ f(z) = (c_0 z + c_1) / (c_2 z + c_3) \f$ holds on every complex \f$ z \f$ in the open unit disk.
+
+  Functionalities are offered to compose isometries, and apply an isometry to a point.
+
+  \tparam Traits must be a model of `HyperbolicSurfaceTraits_2`.
+*/
+template<class Traits>
+class Hyperbolic_isometry_2
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+    Complex number type.
+  */
+  typedef typename Traits::Complex                         Complex_number;
+
+  /*!
+    Point type.
+  */
+  typedef typename Traits::Hyperbolic_point_2              Point;
+
+  /// @}
+
+  /// \name Creation
+  /// @{
+
+  /*!
+    Default constructor to the identity.
+  */
+  Hyperbolic_isometry_2();
+
+  /*!
+    Constructor from coefficients.
+  */
+  Hyperbolic_isometry_2(const Complex_number& c0,
+                        const Complex_number& c1,
+                        const Complex_number& c2,
+                        const Complex_number& c3);
+  /// @}
+
+  /*!
+    sets the isometry to the identity.
+  */
+  void set_to_identity();
+
+  /*!
+    sets the coefficients of the isometry.
+
+    \warning The implementation does not check that the resulting transformation is an isometry.
+  */
+  void set_coefficients(const Complex_number& c0,
+                        const Complex_number& c1,
+                        const Complex_number& c2,
+                        const Complex_number& c3);
+
+  /*!
+    sets a particular coefficient of the isometry.
+
+    \warning The implementation does not check that the resulting transformation is an isometry.
+  */
+  void set_coefficient(int index, const Complex_number& coefficient);
+
+  /// \name Access Functions
+  /// @{
+
+  /*!
+    returns the index-th coefficient.
+  */
+  const Complex_number& get_coefficient(int index) const;
+
+  /// @}
+
+  /// \name Operations
+  /// @{
+
+  /*!
+    evaluates the isometry at point \f$ p \f$.
+  */
+  Point evaluate(const Point& p) const;
+
+  /*!
+    evaluates the isometry at point \f$ p \f$.
+  */
+  Point operator()(const Point& p) const;
+
+  /*!
+    returns the composition of two isometries.
+  */
+  template<class Traits>
+  Hyperbolic_isometry_2<Traits> operator*(const Hyperbolic_isometry_2<Traits>& iso1,
+                                          const Hyperbolic_isometry_2<Traits>& iso2);
+
+  /// @}
+};
+
+} // namespace CGAL
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_surface_traits_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_surface_traits_2.h
new file mode 100644
index 00000000000..b0b5598b51a
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Hyperbolic_surface_traits_2.h
@@ -0,0 +1,13 @@
+namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2TraitsClasses
+
+  \tparam HyperbolicTraits must be a model of `HyperbolicDelaunayTriangulationTraits_2`.
+
+  \cgalModels{HyperbolicSurfaceTraits_2}
+*/
+template<class HyperbolicTraits>
+class Hyperbolic_surface_traits_2 : public HyperbolicTraits {};
+
+} // namespace CGAL
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Triangulation_on_hyperbolic_surface_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Triangulation_on_hyperbolic_surface_2.h
new file mode 100644
index 00000000000..785eb2f6d94
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Triangulation_on_hyperbolic_surface_2.h
@@ -0,0 +1,258 @@
+namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2MainClasses
+
+  This item defines attributes of edges that are of type `Complex_number` reprensenting cross-ratios.
+
+  \tparam Traits must be a model of `HyperbolicSurfaceTraits_2`.
+
+  \cgalModels{GenericMapItems}
+*/
+template<class Traits>
+struct Combinatorial_map_with_cross_ratios_item
+{
+  template <class CMap>
+  struct Dart_wrapper
+  {
+    typedef Cell_attribute<CMap, Complex_number<typename Traits::FT> > Edge_attrib;
+    typedef std::tuple<void, Edge_attrib, void> Attributes;
+  };
+};
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2MainClasses
+
+  represents a triangulation of a closed orientable hyperbolic surface.
+
+  The class provides functions such as the generation of the triangulation from a convex fundamental domain,
+  the Delaunay flip algorithm, and the construction of a portion of the lift of the triangulation in the hyperbolic plane.
+
+  \tparam Traits must be a model of `HyperbolicSurfaceTraits_2`.
+  \tparam Attributes must be a model of `GenericMapItems` whose edges are
+  decorated with complex numbers to represent cross ratios.
+*/
+template<class Traits, class Attributes = Combinatorial_map_with_cross_ratios_item<Traits> >
+class Triangulation_on_hyperbolic_surface_2
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+    Type of combinatorial map whose edges are decorated with complex numbers.
+  */
+ typedef Combinatorial_map<2, Attributes> Combinatorial_map_with_cross_ratios;
+
+  /*!
+    Combinatorial map dart descriptor type.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::Dart_descriptor Dart_descriptor;
+
+  /*!
+      Combinatorial map dart const descriptor type.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::Dart_const_descriptor Dart_const_descriptor;
+
+  /*!
+    Range of one dart for each vertex (that is 0-cell) of the combinatorial map.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_range<0> Vertex_range;
+
+
+  /*!
+    Range of one dart for each edge (that is 1-cell) of the combinatorial map.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_range<1> Edge_range;
+
+  /*!
+    Range of one dart for each face (that is 2-cell) of the combinatorial map.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_range<2> Face_range;
+
+  /*!
+      Range of one dart for each vertex (that is 0-cell) of the combinatorial map.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_const_range<0> Vertex_const_range;
+
+  /*!
+    Range of one dart for each edge (that is 1-cell) of the combinatorial map.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_const_range<1> Edge_const_range;
+
+  /*!
+    Range of one dart for each face (that is 2-cell) of the combinatorial map.
+  */
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_const_range<2> Face_const_range;
+
+  /*!
+    Point type.
+  */
+  typedef typename Traits::Hyperbolic_point_2 Point;
+
+  /*!
+    stores a dart \f$ d \f$ of the combinatorial map, belonging to a triangle \f$ t \f$,
+    and stores the three vertices of a lift of \f$ t \f$ in the hyperbolic plane.
+  */
+  struct Anchor
+  {
+    typename Combinatorial_map_with_cross_ratios::Dart_descriptor dart;
+    typename Traits::Hyperbolic_point_2 vertices[3];
+  };
+
+  /// @}
+
+  /// \name Creation
+  /// @{
+
+  /*!
+    Default constructor.
+  */
+  Triangulation_on_hyperbolic_surface_2() {};
+
+  /*!
+    Constructor from a convex fundamental domain: triangulates the polygon of
+    the domain. (The triangulation is defined by adding an internal edge
+    between domain.vertex(size-1) and the other vertices. The anchor has the
+    three vertices of indices size-1, 0 and 1 and the dart is the one between
+    the vertices of indices size-1 and 0.)
+  */
+  Triangulation_on_hyperbolic_surface_2(const Hyperbolic_fundamental_domain_2<Traits>& domain);
+
+  /*!
+    Constructor from a decorated combinatorial map and an anchor.
+  */
+  Triangulation_on_hyperbolic_surface_2(Combinatorial_map_with_cross_ratios& cmap, Anchor& an_anchor);
+
+  /// @}
+
+  /// \name Assignment
+  /// @{
+
+  /*!
+    \pre <code> other.is_valid() </code>
+  */
+  Triangulation_on_hyperbolic_surface_2& operator=(Triangulation_on_hyperbolic_surface_2 other);
+
+  /// @}
+
+  /// \name Access Functions
+  /// @{
+
+  /*!
+    returns the decorated combinatorial map.
+  */
+  Combinatorial_map_with_cross_ratios& combinatorial_map();
+
+  /*!
+    returns whether the triangulation has an anchor or not.
+    \pre <code> is_valid() </code>
+  */
+  bool has_anchor() const;
+
+  /*!
+    returns the anchor.
+    \pre <code> is_valid() && has_anchor() </code>
+  */
+  Anchor& anchor();
+
+  /*!
+    returns the anchor.
+    \pre <code> is_valid() && has_anchor() </code>
+  */
+  const Anchor& anchor() const;
+
+  /*!
+    returns the range of vertices.
+  */
+Vertex_range vertices_range();
+
+  /*!
+    returns the range of edges.
+  */
+  Edge_range edges_range();
+
+  /*!
+    returns the range of faces.
+  */
+  Face_range faces_range();
+
+  /*!
+    returns the range of vertices.
+  */
+  Vertex_const_range vertices_const_range() const;
+
+  /*!
+    returns the range of edges.
+  */
+  Edge_const_range edges_const_range() const;
+
+  /*!
+    returns the range of faces.
+  */
+  Face_const_range faces_const_range() const;
+
+  /// @}
+
+  /// \name Delaunay Flip Algorithm
+  /// @{
+
+  /*!
+    returns whether the edge supported by the dart is Delaunay flippable or not. An edge \f$ e \f$
+    is Delaunay flippable if the imaginary part of its cross ratio is positive.
+
+    \pre <code> is_valid() </code>
+  */
+  bool is_Delaunay_flippable(Dart_descriptor dart) const;
+
+  /*!
+    flips the edge supported by the dart.
+
+    \pre <code> is_valid() </code>
+  */
+  void flip(Dart_descriptor dart);
+
+  /*!
+    determines if the triangulation is a valid Delaunay triangulation.
+  */
+  bool is_Delaunay() const;
+
+  /*!
+    applies the Delaunay flip algorithm: flips Delaunay-flippable edges until there is no such edge anymore.
+    \pre <code> is_valid() </code>
+  */
+  int make_Delaunay();
+
+  /// @}
+
+  /// \name Lifting
+  /// @{
+
+  /*!
+    lifts the triangulation in the hyperbolic plane.
+
+    Returns, for every triangle \f$ t \f$ of the triangulation, one of the darts of \f$ t \f$ in the combinatorial map of the triangulation, together with a triple \f$ p,q,r \f$ of points in the hyperbolic plane.
+    The points \f$ p,q,r \f$ are the vertices of a lift of \f$ t \f$ in the hyperbolic plane.
+    If the center parameter is set to true, then one of the vertices of the anchor is translated to the origin \f$ 0 \f$.
+
+    \pre <code> is_valid() && has_anchor() </code>
+  */
+  std::vector<std::tuple<Dart_const_descriptor, Point, Point, Point>> lift(bool center=true) const;
+
+  /// @}
+
+  /// \name Validity
+  /// @{
+
+  /*!
+    checks that the underlying combinatorial map \f$ M \f$ has no boundary and calls the is_valid method of \f$ M \f$.
+
+    If there is an anchor, then checks that the dart descriptor of the anchor does indeed point to a dart of \f$ M \f$,
+    and checks that the three vertices of the anchor lie within the open unit disk.
+  */
+  bool is_valid() const;
+
+  /// @}
+};
+
+} // namespace CGAL
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Triangulation_on_hyperbolic_surface_2_IO.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Triangulation_on_hyperbolic_surface_2_IO.h
new file mode 100644
index 00000000000..710a58ea510
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Triangulation_on_hyperbolic_surface_2_IO.h
@@ -0,0 +1,63 @@
+namespace CGAL {
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2InputOutput
+
+  inserts the triangulation in a stream.
+
+  The format of the output is the following.
+  Each dart of the triangulation is given an index between \f$ 0 \f$ and \f$ n-1 \f$, where \f$ n \f$
+  is the number of darts of the triangulation.
+  The first line contains the number \f$ n \f$ of darts.
+  The next line contains either 'yes' or 'no' and tells whether the triangulation has an anchor.
+  If the triangulation has an anchor, then the four next lines print the index of the dart of the anchor,
+  and the three vertices of the anchor.
+  Then, for every triangle \f$ t \f$, the indices of the three darts of \f$ t \f$ are printed on three distinct lines.
+  Finally, for every edge \f$ e \f$, the indices of the two darts of \f$ e \f$ are printed on two distinct lines, followed by a third line on which the cross ratio of \f$ e \f$ is printed.
+
+  \pre <code>   Triangulation_on_hyperbolic_surface_2<Traits>::is_valid() </code>
+*/
+std::ostream& operator<<(std::ostream& s, const Triangulation_on_hyperbolic_surface_2<Traits>& triangulation);
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2InputOutput
+
+  extracts the triangulation from a stream.
+
+  The format of the input should be the same as the format of the output of
+  the '<<' operator for Triangulation_on_hyperbolic_surface_2.
+*/
+std::istream& operator>>(std::istream& s, Triangulation_on_hyperbolic_surface_2<Traits>& triangulation);
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2InputOutput
+
+  inserts the domain in a stream.
+
+  The format of the output is the following.
+  The first line prints the number \f$n\f$ of vertices of the domain.
+  For \f$ i=0 \f$ to \f$ n-1 \f$ the index of the side paired to side \f$ i \f$ is printed on a separate line.
+  For \f$ i=0 \f$ to \f$ n-1 \f$ the i-th vertex is printed on a separate line.
+
+  \pre <code> Hyperbolic_fundamental_domain_2< Traits >::is_valid() </code>
+*/
+std::ostream& operator<<(std::ostream& s, const Hyperbolic_fundamental_domain_2<Traits>& domain);
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2InputOutput
+
+  extracts the domain from a stream.
+
+  The format of the input must be the same as the format of the output of
+  the '<<' operator for Hyperbolic_fundamental_domain_2.
+*/
+std::istream& operator>>(std::istream& s, Hyperbolic_fundamental_domain_2<Traits>& domain);
+
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2InputOutput
+
+  inserts the isometry in a stream.
+*/
+std::ostream& operator<<(std::ostream& s, const Hyperbolic_isometry_2<Traits>& isometry);
+
+} // namespace CGAL
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Concepts/ComplexNumber.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Concepts/ComplexNumber.h
new file mode 100644
index 00000000000..24d72eba175
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Concepts/ComplexNumber.h
@@ -0,0 +1,113 @@
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2Concepts
+  \cgalConcept
+
+  Describes a complex number type over a `FieldNumberType` for its real and imaginary parts.
+
+  \cgalRefines{Field}
+
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Complex_number}
+  \cgalHasModelsEnd
+*/
+class ComplexNumber
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+    Number type for real and imaginary parts: must be a model of `FieldNumberType`.
+  */
+  typedef unspecified_type FT;
+
+  /// @}
+
+  /// \name Creation
+  /// @{
+
+  /*!
+    Default constructor, sets the both the real part and the imaginary part to \f$ 0 \f$.
+  */
+  ComplexNumber();
+
+  /*!
+    Constructor, sets the real part to <code> real_part </code> and the imaginary part to \f$ 0 \f$.
+  */
+  ComplexNumber(const FT& real_part);
+
+  /*!
+    Constructor, sets the real part to <code> real_part </code> and the imaginary part to <code> imaginary_part </code>.
+  */
+  ComplexNumber(const FT& real_part, const FT& imaginary_part);
+
+  /*!
+    Constructor, sets the real part to <code> real_part </code> and the
+    imaginary part to <code> imaginary_part </code>. FT must be
+    constructible from U and V.
+  */
+  template<class U,class V>
+  ComplexNumber(U&& real_part, V&& imaginary_part);
+
+  /// @}
+
+  /// \name Getter and Setter
+  /// @{
+
+  /*!
+    sets the real part to <code> real_part </code>.
+  */
+  void real(const FT& real_part);
+
+  /*!
+    sets the imaginary part to <code> imaginary_part </code>.
+  */
+  void imag(const FT& imaginary_part);
+
+  /*!
+    returns the real part.
+  */
+  FT real() const;
+
+  /*!
+    returns the imaginary part.
+  */
+  FT imag() const;
+
+  /// @}
+
+  /// \name Operations
+  /// @{
+
+  /*!
+    Copy operator.
+  */
+  ComplexNumber operator=(const ComplexNumber& other) const;
+
+  /*!
+    writes the complex in a stream.
+  */
+  std::ostream& operator<<(std::ostream& s, const ComplexNumber& z);
+
+  /*!
+    reads the complex from a stream.
+  */
+  void operator>>(std::istream& s, ComplexNumber& z);
+
+  /// @}
+
+  /// \relates ComplexNumber
+  /// @{
+
+  /*!
+    returns the square of the modulus.
+  */
+  FT norm(ComplexNumber z) const;
+
+  /*!
+    returns the conjugate.
+  */
+  ComplexNumber conj(ComplexNumber z) const;
+
+  /// @}
+};
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Concepts/HyperbolicSurfaceTraits_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Concepts/HyperbolicSurfaceTraits_2.h
new file mode 100644
index 00000000000..e9e30e73195
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Concepts/HyperbolicSurfaceTraits_2.h
@@ -0,0 +1,26 @@
+/*!
+  \ingroup PkgHyperbolicSurfaceTriangulation2Concepts
+  \cgalConcept
+
+  This traits class must have a type for complex numbers.
+
+  \cgalRefines{HyperbolicDelaunayTriangulationTraits_2}
+
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Hyperbolic_surface_traits_2}
+  \cgalHasModelsEnd
+*/
+class HyperbolicSurfaceTraits_2
+{
+public:
+  /// \name Types
+  /// @{
+
+  /*!
+    represents a complex number, model of `ComplexNumber`,
+    over the field `HyperbolicSurfaceTraits_2::FT` for its real and imaginary parts.
+  */
+  typedef unspecified_type  Complex;
+
+  /// @}
+};
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Doxyfile.in b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Doxyfile.in
new file mode 100644
index 00000000000..b6cdaaaf88e
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Doxyfile.in
@@ -0,0 +1,12 @@
+@INCLUDE = ${CGAL_DOC_PACKAGE_DEFAULTS}
+
+EXTRACT_PRIVATE = NO
+
+PROJECT_NAME = "CGAL ${CGAL_CREATED_VERSION_NUM} - 2D Triangulations on Hyperbolic Surfaces"
+
+IMAGE_PATH  +=  ${CGAL_PACKAGE_DOC_DIR}/fig/cover.svg
+
+# custom options for this package
+#EXTRACT_ALL                =  true
+#HIDE_UNDOC_MEMBERS         =  true
+#HIDE_UNDOC_CLASSES         =  true
\ No newline at end of file
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/PackageDescription.txt b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/PackageDescription.txt
new file mode 100644
index 00000000000..b051d7fb880
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/PackageDescription.txt
@@ -0,0 +1,60 @@
+/// \defgroup PkgHyperbolicSurfaceTriangulation2Ref 2D Triangulations on Hyperbolic Surfaces Reference
+
+/// \defgroup PkgHyperbolicSurfaceTriangulation2Concepts Concepts
+/// \ingroup PkgHyperbolicSurfaceTriangulation2Ref
+
+/// \defgroup PkgHyperbolicSurfaceTriangulation2MainClasses Main Classes
+/// \ingroup PkgHyperbolicSurfaceTriangulation2Ref
+
+/// \defgroup PkgHyperbolicSurfaceTriangulation2TraitsClasses Traits Classes
+/// \ingroup PkgHyperbolicSurfaceTriangulation2Ref
+
+/// \defgroup PkgHyperbolicSurfaceTriangulation2InputOutput Input/Output Functions
+/// \ingroup PkgHyperbolicSurfaceTriangulation2Ref
+
+/*!
+\addtogroup PkgHyperbolicSurfaceTriangulation2Ref
+
+\cgalPkgDescriptionBegin{2D Triangulations on Hyperbolic Surfaces,PkgHyperbolicSurfaceTriangulation2}
+\cgalPkgPicture{cover.svg}
+
+\cgalPkgSummaryBegin
+\cgalPkgAuthors{Vincent Despré, Loïc Dubois, Marc Pouget and Monique Teillaud}
+\cgalPkgDesc{This package enables building and handling triangulations of closed orientable hyperbolic surfaces.  It offers functions for the  generation of the triangulation from a convex fundamental domain, the Delaunay flip algorithm and the construction of a portion of the lift of the triangulation in the Poincaré disk. A method is offered that generates such domains in genus two.}
+\cgalPkgManuals{Chapter_Hyperbolic_Surface_Triangulations,PkgHyperbolicSurfaceTriangulation2Ref}
+\cgalPkgSummaryEnd
+
+\cgalPkgShortInfoBegin
+\cgalPkgSince{6.1}
+\cgalPkgDependsOn{\ref PkgCombinatorialMaps}
+\cgalPkgBib{cgal:y-t2}
+\cgalPkgLicense{\ref licensesGPL "GPL"}
+\cgalPkgDemo{2D Triangulations on Hyperbolic Surfaces,nofilefornow.zip}
+\cgalPkgShortInfoEnd
+
+\cgalPkgDescriptionEnd
+
+\cgalClassifedRefPages
+
+\cgalCRPSection{Concepts}
+
+- `HyperbolicSurfaceTraits_2` is the concept for the template parameter of most classes of the package.
+- `ComplexNumber` describes a complex number type.
+
+\cgalCRPSection{Classes}
+
+- `CGAL::Triangulation_on_hyperbolic_surface_2` represents a triangulation of a closed orientable hyperbolic surface.  It offers functions for the  generation of the triangulation from a convex fundamental domain, the Delaunay flip algorithm and the construction of a portion of the lift of the triangulation in the Poincaré disk.
+
+- `CGAL::Hyperbolic_fundamental_domain_2` represents a fundamental domain of a closed orientable hyperbolic surface.
+
+- `CGAL::Hyperbolic_fundamental_domain_factory_2` is a factory class, whose purpose is to generate some convex domains of surfaces of genus two.
+
+- `CGAL::Hyperbolic_isometry_2` represents an isometry in the Poincaré disk model. Facilities are offered to compose isometries, and apply an isometry to a point.
+
+Models for `HyperbolicSurfaceTraits_2` and `ComplexNumber` are provided: `CGAL::Hyperbolic_surface_traits_2` and `CGAL::Complex_number`.
+
+\cgalCRPSection{Input/Output Functions}
+
+- `operator<<` and `operator>>` are overloaded for several classes of the package.
+
+*/
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.txt b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.txt
new file mode 100644
index 00000000000..17c1cac5374
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.txt
@@ -0,0 +1,161 @@
+
+\page Chapter_Hyperbolic_Surface_Triangulations Triangulations of Hyperbolic Surfaces
+
+namespace CGAL {
+/*!
+
+\mainpage User Manual
+\anchor Chapter_Hyperbolic_Surface_Triangulations
+
+\cgalAutoToc
+\authors Vincent Despré, Loïc Dubois, Marc Pouget and Monique Teillaud
+
+<center>
+<img src="header.svg" style="max-width:80%; width:80%;"/>
+</center>
+
+This package introduces a data structure and algorithms for triangulations of closed orientable hyperbolic surfaces. The triangulation is represented by an enriched CGAL::Combinatorial_map with complex number attributes on edges.
+Such a triangulation can be constructed from a surface given by a convex fundamental domain (see Section \ref Section_Hyperbolic_Surface_Triangulations_domains "Fundamental Domains and Triangulations").  A method is offered that randomly generates such domains for surfaces of genus two. On the other hand, the package works for any genus surface that may be provided by the user either as a fundamental domain or as an already computed triangulation.
+Functionalities are offered such as the Delaunay flip algorithm and the construction of a portion of the lift of the triangulation in the Poincaré disk model of the hyperbolic plane.
+
+For the case of the Bolza surface, which is the most symmetric surface of genus two, we refer the user to the specific package \ref Chapter_2D_Periodic_Hyperbolic_Triangulations "2D Periodic Hyperbolic Triangulations".
+
+
+\section Section_Hyperbolic_Surface_Triangulations_Background Hyperbolic Surfaces
+
+We assume some familiarity with basic notions from covering space theory and from the theory of hyperbolic surfaces. See for instance  \cgalCite{cgal:b-gdg-83}\cgalCite{cgal:b-gscrs-92}.
+The <em>Poincaré disk</em> \f$ \mathbb{D} \f$ is a model of the hyperbolic plane whose point set is the open unit disk of the complex plane \f$ \mathbb{C} \f$.
+In this package, every hyperbolic surface \f$ S \f$ is closed (compact and without boundary) and orientable.
+The Poincaré disk \f$ \mathbb{D} \f$ is a universal covering space for \f$ S \f$, whose projection map \f$ \pi: \mathbb{D} \to S \f$ is a local isometry.
+For a point \f$ x \in S \f$, the infinite set \f$ \pi^{-1}(x) \f$ consists of lifts of \f$ x \f$, denoted \f$ \widetilde x \f$. This notion extends to paths and triangulations of S  that can be lifted in \f$ \mathbb{D} \f$.
+
+\subsection Section_Hyperbolic_Surface_Triangulations_domains Fundamental Domains and Triangulations
+
+Let \f$ S \f$ be a hyperbolic surface. For representing \f$ S \f$, we cut it into topologically simple pieces.
+For a graph \f$ G \f$ embedded on \f$ S \f$, a face is a  connected component of \f$ S \setminus G \f$.
+A graph \f$ G \f$ embedded on \f$ S \f$ defines a <em>cellular decomposition</em> of \f$ S \f$ if every face is a topological disk.
+In this document, every edge of a graph \f$ G \f$ embedded on \f$ S \f$ is a geodesic on \f$ S \f$.
+We consider two types of cellular decompositions of \f$ S \f$:
+<ul>
+  <li>Decompositions with only one face, and
+  <li>Triangulations.
+</ul>
+
+A  decomposition of \f$ S \f$ that have only one face is a classical representation of the surface.
+Cutting \f$ S \f$ open along the edges of \f$ G \f$ results in a hyperbolic polygon \f$ P \f$ that is a <em>fundamental domain</em> for \f$ S \f$.
+Each edge of \f$ G \f$ is split into a pair of edges in \f$ P \f$.
+Every hyperbolic surface admits a fundamental domain \f$ P \f$ that is <em>convex</em>, meaning that the interior angles of \f$ P \f$ do not exceed \f$ \pi \f$.
+
+A  decomposition defined by the graph \f$ G \f$  is a <em>triangulation</em> of \f$ S \f$ if every face of \f$ G \f$ is a triangle: it is bounded by three edges of \f$ G \f$.
+Observe that this definition allows for triangulations with only one vertex.
+A triangulation of \f$ S \f$ can be obtained from a convex fundamental domain \f$ P \f$ of \f$ S \f$ by triangulating the interior of \f$ P \f$, and by gluing back the boundary edges that are paired in \f$ P \f$.
+The assumption that \f$ P \f$ is convex ensures that the interior of \f$ P \f$ can be triangulated naively by insertion of any maximal set of pairwise interior disjoint arcs of \f$ P \f$.
+
+\subsection Section_Hyperbolic_Surface_Triangulations_generation Generation of Convex Fundamental Domains
+
+In order to perform fast and exact computations with a fundamental domain, every vertex must be a complex number whose type supports fast and exact computations.  Under this constraint, it is still a research problem to generate domains of surfaces of genus greater than two.  In genus two, this package generates fundamental domains whose vertices belong to \f$ \mathbb{Q} + i \mathbb{Q} \f$ (their real and imaginary parts are rational numbers).  The exact generation process can be found in \cgalCite{despre2022experimental}, together with a proof that the surfaces that can be generated in this way are dense in the space of hyperbolic surfaces genus two.
+
+
+\section Subsection_Hyperbolic_Surface_Triangulations_Representation Representation
+
+\subsection Subsection_Hyperbolic_Surface_Triangulations_DS_Domains Data Structure for Domains
+
+We represent every fundamental domain as a polygon in the Poincaré disk, given by the list of its vertices in counter-clockwise order and by the list of its side pairings.
+This package can generate a random convex fundamental domain \f$ P \f$ of a surface of genus two, with eight vertices \f$ z_0, \dots, z_7 \in \mathbb{C} \f$.
+The vertices and the sides are in counter-clockwise order, the side between \f$ z_0 \f$ and \f$ z_1 \f$ is \f$ A \f$,  the side between \f$ z_4 \f$ and \f$ z_5 \f$ is \f$ \overline{A} \f$ and so on as on \cgalFigureRef{THS2-octagon}.  The side pairings are \f$ A \f$ with \f$\overline{A} \f$ , \f$ B \f$ with \f$ \overline{B} \f$ , \f$ C \f$ with \f$ \overline{C} \f$ and  \f$ D \f$ with \f$ \overline{D} \f$.
+
+These octagons are symmetric, i.e. \f$ z_i = -z_{i+4} \f$ for every  \f$ i \f$, where indices are modulo eight.
+Such octagons are described in \cgalCite{aigon2005hyperbolic}.
+
+\cgalFigureAnchor{THS2-octagon}
+<center>
+  <img src="octagon.svg" style="max-width:30%; width:30%; display: inline-block;"/>
+</center>
+\cgalFigureCaptionBegin{THS2-octagon}
+ Fundamental convex polygonal domain of a genus two surface.
+\cgalFigureCaptionEnd
+
+
+\subsection Subsection_Hyperbolic_Surface_Triangulations_DS_Triangulations Data Structure for Triangulations
+
+Our representation is edge-based instead of the usual CGAL::TriangulationDataStructure_2 used for instance in the package \ref Chapter_2D_Periodic_Hyperbolic_Triangulations "2D Periodic Hyperbolic Triangulations". This edge-based representation is more intrinsic to the surface and can handle non-simplicial triangulations, for instance a triangulation with only one vertex.
+We represent a triangulation \f$ T \f$ of a hyperbolic surface by an instance of CGAL::Combinatorial_map whose edges have complex number attributes that are cross ratios (defined shortly in the following).
+While the triangulation \f$ T \f$ is unambiguously determined by the combinatorial map and its cross ratios, the internal representation of \f$ T \f$  contains an additional data: the anchor, to be able to lift the triangulation in the Poincaré disk \f$ \mathbb{D} \f$.
+The anchor is a lift \f$ \widetilde t \f$  in \f$ \mathbb{D} \f$ of a triangle of \f$ T \f$. The anchor is represented by the three vertices  \f$ \widetilde v_0, \widetilde v_1, \widetilde v_2 \f$  of \f$ \widetilde t \f$  in \f$ \mathbb{D} \f$, and by the dart in the combinatorial map of \f$ T \f$ corresponding to the oriented edge \f$ v_0v_1 \f$.
+A lift function is provided that computes a lift of each triangle of \f$ T \f$ in the Poincaré disk \f$ \mathbb{D} \f$, it starts from the anchor and then  recursively constructs lifts of neighboring triangles using the cross ratios. See \cgalCite{despre2022experimental} for details.
+
+The attribute of an edge \f$ e \f$ of \f$ T \f$ is the complex number \f$ R_T(e) \in \mathbb{C} \f$  called the <em>cross ratio</em> of \f$ e \f$ in \f$ T \f$, defined as follows.
+Consider the lift \f$ \widetilde T \f$ of \f$ T \f$ in the Poincaré disk \f$ \mathbb{D} \f$.
+In \f$ \widetilde T \f$, let \f$ \widetilde e \f$ be a lift of \f$ e \f$, see \cgalFigureRef{THS2-crossratio}.
+Orient \f$ \widetilde e \f$ arbitrarily, and let \f$ z_0 \in \mathbb{D} \f$ and \f$ z_2 \in \mathbb{D} \f$ be respectively the source and target vertices of \f$ \widetilde e \f$.
+In  \f$ \widetilde T \f$, consider the triangle on the right of \f$ \widetilde e \f$, and let \f$ z_1 \in \mathbb{D} \f$ be the vertex distinct from \f$ z_0 \f$ and \f$ z_2 \f$ of this triangle.
+Similarly, consider the triangle on the left of \f$ \widetilde e \f$, and let \f$ z_3 \in \mathbb{D} \f$ be the vertex distinct from \f$ z_0 \f$ and \f$ z_2 \f$ of this triangle.
+Then \f$ R_T(e) = (z_3-z_1)(z_2-z_0) / ((z_3-z_0)(z_2-z_1)) \f$.
+This definition does not depend on the choice of the lift \f$ \widetilde e \f$, nor on the orientation of \f$ \widetilde e \f$.
+See \cgalCite{despre2022experimental} for details.
+
+\cgalFigureAnchor{THS2-crossratio}
+<center>
+  <img src="crossratio.svg" style="max-width:20%; width:20%; display: inline-block;"/>
+</center>
+\cgalFigureCaptionBegin{THS2-crossratio}
+ Computation of the cross ratio of an edge.
+\cgalFigureCaptionEnd
+
+
+\subsection Subsection_Hyperbolic_Surface_Triangulations_Delaunay Delaunay Flip Algorithm
+
+Let \f$ T \f$ be a triangulation of a hyperbolic surface. An edge \f$ e \f$ of \f$ T \f$ satisfies the <em>Delaunay criterion</em> if the imaginary part of its cross ratio \f$R_T(e)\f$ is non-positive.
+This definition is equivalent to the usual formulation for the triangulation lifted in \f$ \mathbb{D} \f$: there exists a disk containing  \f$ \widetilde e \f$ and that does not contain any other vertices of \f$ \widetilde T \f$ in its interior.
+Then \f$ T \f$ is a <em>Delaunay triangulation</em> if every edge of  \f$ T \f$ satisfies the Delaunay criterion.
+If an edge \f$e \f$ of \f$ T \f$ does not satisfy the Delaunay criterion, then \f$e \f$  is called Delaunay flippable, and then the two triangles incident to \f$ e \f$ form a strictly convex quadrilateral, so \f$ e \f$ can be deleted from \f$ T \f$ and replaced by the other diagonal of the quadrilateral.
+This operation is called a Delaunay <em>flip</em>.
+When a flip occurs, the cross ratios of the involved edges are modified via simple formulas.
+The <em>Delaunay flip algorithm</em> flips edges that do not satisfy the Delaunay until no more edges violate the criterion, with no preference on the order of the flips.
+This algorithm terminates, and outputs a Delaunay triangulation of \f$ S \f$ \cgalCite{despre2020flipping}.
+
+\section Section_Hyperbolic_Surface_Triangulations_Software_Design Software Design
+
+ The concept `ComplexNumber` describes a complex number type modeled by `CGAL::Complex_number`. Complex numbers are used to encode the cross ratios, for the coefficients of isometries and implicitly to work with points in the Poincaré disk.
+Most classes of the package are templated by the concept `HyperbolicSurfaceTraits_2`. It is a refinement of `HyperbolicDelaunayTriangulationTraits_2` and is modeled by `CGAL::Hyperbolic_surface_traits_2`. It defines the geometric objects (points, segments...) forming the lifted triangulation in the Poincaré disk.
+
+
+The package offers three main classes:
+- `CGAL::Triangulation_on_hyperbolic_surface_2` represents a triangulation of a hyperbolic surface. It offers functions for the  generation of the triangulation from a convex fundamental domain, the Delaunay flip algorithm and the construction of a portion of the lift of the triangulation in the Poincaré disk.
+
+- `CGAL::Hyperbolic_fundamental_domain_2` represents a convex fundamental domain of a hyperbolic surface.
+
+- `CGAL::Hyperbolic_fundamental_domain_factory_2`  generates random convex fundamental domains of surfaces of genus two.
+
+The secondary class `CGAL::Hyperbolic_isometry_2` defines isometries in the Poincaré disk together with operations to work with them.
+
+
+\section Visualization_Triangulation_lift Visualization of a Triangulation
+
+The function `CGAL::Triangulation_on_hyperbolic_surface_2::lift()` computes the lift of each triangle in the hyperbolic plane, enabling its visualization (see \cgalFigureRef{THS2-demo-output}). This package contains a demo (found in the folder Triangulation_on_hyperbolic_surface_2/demo), which can be used to display triangulations.
+
+\cgalFigureAnchor{THS2-demo-output}
+<center>
+  <img src="demo-output.png" style="max-width:25%; width:25%; display: inline-block;"/>
+</center>
+\cgalFigureCaptionBegin{THS2-demo-output}
+ Lift, in the Poincaré disk, of a Delaunay triangulation of a genus two hyperbolic surface with one vertex.
+\cgalFigureCaptionEnd
+
+
+\section Section_Hyperbolic_Surface_Triangulations_Example Example
+
+The example below generates a convex fundamental domain of a surface of genus two, triangulates the domain, applies the Delaunay flip algorithm to the resulting triangulation, saves and prints the Delaunay triangulation.
+\cgalExample{Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.cpp}
+
+\section Section_Hyperbolic_Surface_Implementation_History Design and Implementation History
+
+This package implements the Delaunay flip algorithm described in the hyperbolic setting by Vincent Despré, Jean-Marc Schlenker and Monique Teillaud in \cgalCite{despre2020flipping} using the data structure for representing triangulations presented in \cgalCite{despre2022experimental}).
+It also implements the generation of domains described by Vincent Despré, Loïc Dubois, Benedikt Kolbe and Monique Teillaud in \cgalCite{despre2022experimental}, based on results of Aline Aigon-Dupuy, Peter Buser, Michel Cibils, Alfred F Künzle and Frank Steiner \cgalCite{aigon2005hyperbolic}.
+The code and the documentation of the package were written by Loïc Dubois, under regular discussions with Vincent Despré, Marc Pouget and Monique Teillaud.
+The authors acknowledge support from the grants <a href="https://sos.loria.fr/">SoS</a> and <a href="https://perso.math.u-pem.fr/sabourau.stephane/min-max/min-max.html">MIN-MAX</a> of the French National Research Agency ANR.
+
+*/
+} /* namespace CGAL */
+
+\\\\\\\\\\\\
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/dependencies b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/dependencies
new file mode 100644
index 00000000000..dbe174d8cc2
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/dependencies
@@ -0,0 +1,7 @@
+Manual
+Stream_support
+Number_types
+Combinatorial_map
+Hyperbolic_triangulation_2
+Algebraic_foundations
+Periodic_4_hyperbolic_triangulation_2
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/examples.txt b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/examples.txt
new file mode 100644
index 00000000000..5d630b162a4
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/examples.txt
@@ -0,0 +1,3 @@
+/*!
+\example Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.cpp
+*/
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/cover.svg b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/cover.svg
new file mode 100644
index 00000000000..7ae13820ecd
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/cover.svg
@@ -0,0 +1,260 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<svg width="29.702mm" height="29.753mm" version="1.1" viewBox="0 0 29.702 29.753" xmlns="http://www.w3.org/2000/svg" xmlns:cc="http://creativecommons.org/ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
+<metadata>
+<rdf:RDF>
+<cc:Work rdf:about="">
+<dc:format>image/svg+xml</dc:format>
+<dc:type rdf:resource="http://purl.org/dc/dcmitype/StillImage"/>
+<dc:title/>
+</cc:Work>
+</rdf:RDF>
+</metadata>
+<g transform="translate(-188.95 -154.1)">
+<g transform="matrix(.20048 0 0 .20048 135.37 157.17)" fill="#387ba5" fill-opacity=".77869">
+<path d="m303.35 107.68c0-0.0548 0.12154-0.51486 0.27008-1.0223 0.54238-1.8529 1.0251-4.7658 1.2488-7.5353 0.77845-9.6387-2.4399-19.925-8.6418-27.62-4.1357-5.1315-9.7772-9.3038-15.943-11.791l-1.5121-0.60999 1.2041-0.12588c9.0412-0.9452 16.414-2.247 24.403-4.3085 25.544-6.5917 49.386-19.908 68.343-38.172 1.3584-1.3087 2.4698-2.3258 2.4698-2.2601 0 0.11466-71.07 92.71-71.589 93.271-0.13929 0.15067-0.25326 0.2291-0.25326 0.17427z" style="paint-order:stroke markers fill"/>
+<path d="m307.49 103.65c0.10123-0.30066 71.692-93.431 71.765-93.358 0.0337 0.0337-0.14638 0.91896-0.4002 1.9672-0.80987 3.3447-1.1046 6.4228-0.98697 10.31 0.1141 3.772 0.40795 5.9032 1.2532 9.089 1.2593 4.7463 3.3765 9.1448 6.4514 13.403 1.4411 1.9955 6.1056 6.66 8.1011 8.1011 2.8078 2.0277 6.4441 4.0473 9.0809 5.0436 1.3666 0.51638 1.3452 0.52535-2.024 0.84478-8.7824 0.83265-21.157 3.4063-29.841 6.2064-17.614 5.6796-32.31 13.23-46.585 23.935-5.5238 4.1424-9.8889 7.8619-14.57 12.415-1.2735 1.2387-2.2838 2.1582-2.2451 2.0433z" style="paint-order:stroke markers fill"/>
+<path d="m279.62 57.228c6.7309-6.3226 8.4229-16.445 4.1211-24.654-0.5439-1.038-0.65797-1.3865-0.43259-1.3217 0.16836 0.0484 1.4006 0.42613 2.7382 0.83935 22.487 6.9465 47.301 5.0322 68.67-5.2976 5.4396-2.6296 11.014-6.0134 15.492-9.4033 1.0133-0.76718 1.8767-1.3605 1.9187-1.3185 0.1936 0.19361-7.4037 6.8331-11.526 10.073-20.351 15.994-44.519 26.582-70.438 30.859-2.6172 0.43189-10.946 1.4864-11.743 1.4868-0.0791 3e-5 0.46116-0.56822 1.2006-1.2628z" style="paint-order:stroke markers fill"/>
+<path d="m308.91 35.473c-4.9666-0.26297-11.282-1.1144-15.191-2.0482l-1.4967-0.35753 1.6838 0.1302c0.92609 0.0716 4.1253 0.12885 7.1094 0.1272 5.8126-3e-3 7.9444-0.19858 12.535-1.1488 5.6889-1.1775 10.591-2.8772 15.812-5.4824 12.884-6.4286 22.97-16.639 29.301-29.661 0.6503-1.3377 1.1852-2.3901 1.1886-2.3386 0.0424 0.63061 1.477 4.1014 2.1788 5.2714 1.0818 1.8035 3.2325 4.159 4.853 5.3154 1.3882 0.99063 4.2237 2.3423 5.7867 2.7586 1.6605 0.44221 4.5005 0.7392 5.6908 0.5951l1.0444-0.12642-0.93545 0.96737c-0.51449 0.53206-1.8194 1.7456-2.8999 2.6968-13.525 11.907-30.168 19.658-48.024 22.366-5.5812 0.84626-13.145 1.2258-18.636 0.93509z" style="paint-order:stroke markers fill"/>
+<path d="m295.03 32.644c-1.029-0.0903-2.797-0.32103-3.9289-0.5128l-2.058-0.34867 2.5257-0.024c19.963-0.1899 37.162-13.719 41.884-32.949 0.60873-2.4788 1.132-5.7143 1.1687-7.2269 0.0122-0.50129 0.0754-1.1598 0.14053-1.4634 0.11632-0.5422 0.13142-0.52968 0.85672 0.71054 1.8886 3.2293 5.0478 5.6566 8.9899 6.9073 1.1256 0.3571 1.7303 0.41564 4.303 0.41658 2.6198 9.5e-4 3.1677-0.0536 4.39-0.43744 1.6543-0.51947 3.3094-1.3232 4.5618-2.2152 0.49885-0.35531 0.94168-0.61133 0.98406-0.56894 0.14094 0.14094-2.14 4.5896-3.5691 6.961-2.8454 4.7216-5.5839 8.2162-9.5394 12.173-10.836 10.839-24.506 17.191-40.045 18.606-2.4172 0.22008-8.0012 0.20521-10.664-0.0284z" style="paint-order:stroke markers fill"/>
+<path d="m311.87 100.46c24.287-22.748 55.993-37.318 88.68-40.75 1.5435-0.16208 3.0722-0.32856 3.3971-0.36996 0.56079-0.0714 0.51564-4e-3 -0.89105 1.3404-4.2222 4.0338-6.3413 9.0217-6.3413 14.925 0 3.5689 0.63202 6.2444 2.2208 9.4012 0.42725 0.84891 0.70486 1.5435 0.61693 1.5435-0.0879 0-0.63903-0.16485-1.2246-0.36633-10.756-3.7005-24.507-5.3029-36.879-4.2974-17.552 1.4263-34.61 7.8554-48.677 18.346-1.0853 0.80944-2.0269 1.4677-2.0924 1.4628-0.0655-5e-3 0.47024-0.56089 1.1905-1.2356z" style="paint-order:stroke markers fill"/>
+<path d="m322.63 122.25c-1.1923-4.6522-4.7222-8.9444-9.2166-11.207-2.4131-1.2149-4.3331-1.6885-7.4004-1.8256l-2.6705-0.11931 2.2963-2.0852c2.9864-2.7118 4.6062-4.0591 7.3368-6.102 11.999-8.9773 26.046-14.979 40.796-17.432 5.8985-0.98063 7.9274-1.1282 15.435-1.1228 6.1077 4e-3 7.462 0.0595 10.463 0.42579 3.4328 0.41902 7.5827 1.1219 9.5505 1.6175 1.0167 0.25608 1.0011 0.25828-0.93041 0.13155-3.7374-0.24522-11.519-0.12398-14.011 0.2183-7.5455 1.0362-13.634 2.8497-20.133 5.9963-6.6245 3.2075-11.676 6.7348-16.896 11.797-5.4232 5.26-9.4978 10.871-12.95 17.832l-1.4174 2.8582z" style="paint-order:stroke markers fill"/>
+<path d="m347.82 128.15c-0.27054-0.774-1.6634-2.7539-2.7149-3.859-2.8204-2.9642-6.3108-4.5429-10.513-4.7549-3.4651-0.17482-6.3876 0.60202-9.29 2.4694-0.69802 0.44911-1.299 0.78667-1.3356 0.75012-0.11712-0.11712 1.3569-3.113 2.6711-5.4287 4.5544-8.0256 10.914-15.103 18.358-20.43 8.7832-6.2853 18.926-10.214 29.918-11.59 3.6092-0.45164 10.801-0.45042 14.406 2e-3 4.3716 0.54924 4.4279 0.59328 0.93544 0.73278-3.7392 0.14937-6.1792 0.4925-9.5304 1.3403-12.332 3.1197-22.56 11.407-28.183 22.835-2.6048 5.2938-4.0142 10.491-4.4392 16.37-0.0913 1.2633-0.19219 1.8208-0.28262 1.5622z" style="paint-order:stroke markers fill"/>
+<path d="m349.09 123.5c0.0604-0.61739 0.3253-2.0907 0.5887-3.274 1.7436-7.8333 5.7888-15.249 11.386-20.873 6.3892-6.4196 14.443-10.596 23.403-12.137 3.8092-0.65509 9.6013-0.71368 13.082-0.13233 1.0227 0.1708 1.0005 0.18801-0.99349 0.76913-0.75221 0.21922-2.1432 0.79589-3.0911 1.2815-5.4545 2.7943-9.2644 7.9754-10.327 14.044-0.52246 2.9832-0.25789 6.806 0.65421 9.4528 0.20944 0.60777 0.38081 1.1311 0.38081 1.163 0 0.0319-0.52619-0.30804-1.1693-0.75541-5.5874-3.8867-13.225-4.9365-19.825-2.7251-6.1161 2.0491-11.158 6.8369-13.651 12.963l-0.54769 1.346z" style="paint-order:stroke markers fill"/>
+<path d="m400.07 56.276c-6.312-3.1736-11.615-7.8934-15.388-13.695-6.1173-9.4081-7.8724-21.339-4.7161-32.058l0.32483-1.1032 0.50853 1.5709c1.7758 5.4858 5.8193 9.3916 11.531 11.138 1.5119 0.46233 1.9535 0.51156 4.6908 0.52295l3.0217 0.0126-0.30895 0.39026c-4.2591 5.3801-5.8764 9.6589-5.8986 15.606-0.0116 3.0995 0.23144 4.7304 1.1035 7.4058 1.2228 3.7516 2.9366 6.5207 5.8086 9.3854 1.0574 1.0547 1.8239 1.9163 1.7032 1.9147-0.12066-2e-3 -1.1921-0.49198-2.381-1.0897z" style="paint-order:stroke markers fill"/>
+<path d="m403.52 57.074c-4.4758-3.3516-7.7078-8.6495-8.7797-14.392-0.4263-2.2836-0.28926-6.9855 0.26825-9.2035 0.74273-2.9549 2.2068-6.0344 4.0099-8.4345 0.40789-0.54294 0.76883-0.95997 0.80208-0.92671 0.0333 0.0333-0.0732 0.47748-0.23652 0.98717-0.18628 0.58125-0.30383 1.659-0.31536 2.8912-0.0317 3.3946 1.1278 6.138 3.5641 8.4321 1.5262 1.4372 3.0724 2.2968 5.0329 2.7982 0.79571 0.20351 1.4702 0.39342 1.4988 0.42202s-0.40046 0.40208-0.95345 0.82996c-2.1775 1.6848-4.0517 4.6168-4.7857 7.4866-0.68471 2.6772-0.42909 6.4094 0.60425 8.8225 0.19351 0.45188 0.31838 0.85507 0.27748 0.89597s-0.48501-0.23315-0.98692-0.60899z" style="paint-order:stroke markers fill"/>
+<path d="m375.76 8.0098c-2.1331-0.21584-4.2576-0.84039-6.1739-1.815-3.889-1.9779-6.818-5.2163-8.3829-9.2685-0.275-0.71206-0.78444-2.4728-0.78444-2.7113 0-0.0475 0.221 0.0787 0.49111 0.28033 1.5661 1.1693 3.6844 1.7966 5.6285 1.6668 2.034-0.1358 3.8513-0.91335 5.4219-2.3198 0.36008-0.32244 0.53188-0.42966 0.49756-0.31053-0.22041 0.76493-0.29355 1.4914-0.29619 2.9415-3e-3 1.8094 0.16819 2.8645 0.70008 4.3071 1.0682 2.8972 3.1862 5.3736 5.7792 6.7572l0.77604 0.41411-0.57928 0.0605c-0.58205 0.0608-2.4666 0.0593-3.0775-3e-3z" style="paint-order:stroke markers fill"/>
+<path d="m352.95-5.1551c-1.6364-0.16378-3.182-0.6732-4.5698-1.5061-1.8872-1.1326-3.4073-2.8638-4.2977-4.8942-0.17643-0.40233-0.4921-1.2796-0.4921-1.3675 0-0.019 0.1079 0.0791 0.23978 0.21806 0.68995 0.72697 1.5708 1.2066 2.5862 1.4081 0.47379 0.094 1.2744 0.10087 1.7215 0.0147 0.88069-0.16975 1.6731-0.54848 2.3294-1.1134 0.21206-0.18252 0.56089-0.55906 0.71538-0.77222l0.0682-0.0941 0.0761 0.392c0.40384 2.081 1.6256 3.9287 3.3748 5.104 1.1745 0.78914 2.5439 1.255 3.9534 1.3448l0.3638 0.0232-0.45964 0.22443c-0.98564 0.48127-2.0845 0.80898-3.2611 0.97257-0.45671 0.0635-1.8912 0.0914-2.3482 0.0457z" style="paint-order:stroke markers fill"/>
+<path d="m358.09-6.9613c-2.6894-0.40329-4.9323-2.1911-5.9209-4.7196-0.20071-0.51332-0.47014-1.574-0.39982-1.574 0.0111 0 0.0919 0.0515 0.17961 0.11452 0.45389 0.32609 0.93109 0.46171 1.544 0.43882 0.61804-0.0231 1.1034-0.21317 1.5268-0.598l0.17649-0.16041v0.29928c0 0.5908 0.14475 1.4237 0.36298 2.0886 0.36443 1.1104 0.97552 2.1048 1.8004 2.9299 0.45611 0.45623 0.72719 0.67764 1.2318 1.0061l0.35511 0.23116-0.26284-3e-3c-0.14456-2e-3 -0.41167-0.0257-0.59357-0.053z" style="paint-order:stroke markers fill"/>
+<path d="m358.26-7.976c-0.82489-0.67115-1.5474-1.6118-1.9707-2.5657-0.38207-0.86095-0.56519-1.6586-0.61329-2.6716l-0.0224-0.47086 0.19402 0.10509c0.28202 0.15275 0.70346 0.1699 1.0188 0.0415 0.052-0.0212 0.0581-0.0139 0.039 0.0463-0.0446 0.14055-0.0231 1.3691 0.0311 1.7742 0.11843 0.88569 0.37127 1.7237 0.75836 2.5136 0.22377 0.45661 0.58167 1.0447 0.82023 1.3477 0.0537 0.0682 0.0852 0.12358 0.07 0.12304-0.0152-5.3e-4 -0.16153-0.10997-0.32524-0.24317z" style="paint-order:stroke markers fill"/>
+<path d="m359.59-7.4969c-0.14539-0.18862-0.34861-0.4849-0.47845-0.69756-0.64425-1.0552-1.0443-2.2587-1.1576-3.4823-0.036-0.3885-0.0432-0.98603-0.0158-1.3051l4e-3 -0.0452 0.042 0.0539c0.13006 0.16701 0.32417 0.323 0.52852 0.42471 0.15749 0.0784 0.30866 0.12605 0.48639 0.15334 0.11969 0.0184 0.32768 0.0183 0.44794-1.5e-4 0.11393-0.0175 0.24649-0.0521 0.34542-0.0903 0.0451-0.0174 0.082-0.0287 0.082-0.0251-1e-5 4e-3 -0.0116 0.071-0.0259 0.14974-0.12535 0.69477-0.21252 1.4411-0.25163 2.1544-0.0178 0.3254-0.0212 0.43916-0.0246 0.83313-6e-3 0.66289 0.0173 1.2125 0.0775 1.8464 5e-3 0.0524 8e-3 0.0996 7e-3 0.10483-1e-3 6e-3 -0.0268-0.0229-0.0668-0.0749z" style="paint-order:stroke markers fill"/>
+<path d="m360.08-7.7899c-0.0199-0.25251-0.037-0.53364-0.0467-0.76887-0.0109-0.26356-0.0109-1.0439 1e-5 -1.314 0.0333-0.82524 0.11582-1.592 0.25667-2.3842 0.0178-0.10005 0.0324-0.18563 0.0326-0.19017 1.2e-4 -5e-3 3e-3 -0.0133 7e-3 -0.0195 6e-3 -9e-3 0.0181-2e-3 0.0557 0.0284 0.15329 0.12501 0.34366 0.21513 0.55068 0.26067 0.11139 0.0245 0.32787 0.0305 0.45056 0.0124 0.0947-0.0139 0.22406-0.0485 0.29472-0.0788 0.036-0.0154 0.039-0.0156 0.0349-2e-3 -2e-3 8e-3 -0.0421 0.13533-0.0879 0.28313-0.39278 1.2653-0.88266 2.6747-1.3622 3.9191-0.0499 0.1296-0.10656 0.27657-0.12581 0.32659-0.0192 0.05-0.0376 0.0939-0.0408 0.0974-3e-3 4e-3 -0.012-0.0727-0.0197-0.1695z" style="paint-order:stroke markers fill"/>
+<path d="m360.69-7.8687c0.45508-1.1636 1.061-2.919 1.4592-4.2271 0.0325-0.10687 0.0608-0.19928 0.0628-0.20536 2e-3 -7e-3 0.0235 6e-3 0.0621 0.0393 0.12109 0.10448 0.25081 0.17479 0.39403 0.21355 0.0735 0.0199 0.0949 0.0219 0.23596 0.0223 0.13447 3.7e-4 0.15446 2e-3 0.15014 0.0128-3e-3 7e-3 -0.0155 0.0403-0.0283 0.0744-0.42954 1.1429-1.0638 2.3374-1.7737 3.3404-0.19663 0.27779-0.54968 0.74414-0.56336 0.74414-3e-3 0-2e-3 -7e-3 1e-3 -0.0145z" style="paint-order:stroke markers fill"/>
+<path d="m361.71-8.4372c1e-3 -5e-3 0.0718-0.11245 0.15655-0.23978 0.66607-1.001 1.1984-2.0428 1.6186-3.1674l0.0713-0.19079 0.0248 0.0158c0.0848 0.054 0.21071 0.0999 0.30276 0.11026 0.0267 3e-3 0.0486 8e-3 0.0486 0.0121 0 4e-3 -0.0298 0.0776-0.0661 0.16441-0.47747 1.1394-1.1224 2.1612-1.9313 3.0598-0.11667 0.1296-0.22832 0.24651-0.22504 0.23565z" style="paint-order:stroke markers fill"/>
+<path d="m360.94-7.1081c0.079-0.0618 0.29169-0.24129 0.41177-0.34751 0.95239-0.84244 1.7588-1.8454 2.378-2.9576 0.15471-0.27789 0.37643-0.72836 0.49836-1.0125l0.0158-0.0369 0.0315 0.0519c0.2047 0.33698 0.53575 0.57055 0.92788 0.65466 0.10193 0.0219 0.33816 0.0312 0.44075 0.0174 0.0382-5e-3 0.071-8e-3 0.073-6e-3 0.01 0.01-0.24518 0.42566-0.38166 0.62284-0.48961 0.70737-1.0863 1.3183-1.7771 1.8196-0.64191 0.46577-1.391 0.84365-2.1388 1.079-0.15025 0.0473-0.47739 0.13793-0.49717 0.13777-6e-3 -5e-5 2e-3 -0.0103 0.0176-0.0227z" style="paint-order:stroke markers fill"/>
+<path d="m362.19-6.4238c-0.29931-0.0199-0.59663-0.0601-0.91689-0.12394-0.15868-0.0316-0.29152-0.0605-0.2952-0.0642-4e-3 -4e-3 0.0257-0.0149 0.0653-0.025 0.95446-0.2431 1.7578-0.59582 2.5359-1.1134 0.45909-0.30541 0.79563-0.58237 1.2085-0.99454 0.50916-0.50835 0.93086-1.0535 1.2626-1.6321l0.0898-0.15664 0.057 0.10848c0.28503 0.54222 0.81945 0.9121 1.4372 0.99469 0.18318 0.0245 0.46345 9e-3 0.64786-0.0349 0.0764-0.0184 0.14238-0.0298 0.14669-0.0255 4e-3 4e-3 -0.0501 0.0873-0.12083 0.1844-0.39294 0.53919-0.86931 1.0323-1.3884 1.4371-0.19132 0.14922-0.61039 0.42812-0.82845 0.55137-1.1804 0.66715-2.5608 0.98358-3.901 0.89423z" style="paint-order:stroke markers fill"/>
+<path d="m364.53-5.1603c-0.79172-0.0454-1.6212-0.22535-2.3482-0.50948-0.25342-0.0991-0.61688-0.26405-0.7276-0.33031l-0.0744-0.0445 0.0744 9e-3c0.0409 5e-3 0.16371 0.0204 0.27285 0.0339 1.9235 0.23857 3.8689-0.28048 5.4044-1.4419 0.6869-0.51958 1.3198-1.1987 1.7648-1.8939 0.0678-0.10597 0.12727-0.19293 0.13207-0.19324 5e-3 -3.2e-4 0.0294 0.047 0.0547 0.10507 0.19645 0.45094 0.63699 0.82348 1.1378 0.96213 0.27183 0.0753 0.6688 0.0736 0.95613-4e-3 0.0371-0.0101 0.0336-1e-3 -0.0402 0.10346-1.2203 1.7266-3.1234 2.8748-5.2177 3.1481-0.44173 0.0576-0.97839 0.0791-1.3891 0.0556z" style="paint-order:stroke markers fill"/>
+<path d="m365.4-4.6673c-0.15609-5e-3 -0.35147-0.0155-0.35542-0.0192-3e-3 -2e-3 0.0645-6e-3 0.14909-8e-3 0.91789-0.0216 1.9012-0.23047 2.7905-0.59264 1.206-0.49113 2.2981-1.2896 3.1333-2.2908 0.2929-0.35112 0.54642-0.71232 0.77776-1.1081 0.0336-0.0575 0.0665-0.1151 0.0731-0.12803l0.012-0.0235 0.0307 0.0295c0.0992 0.0954 0.24034 0.16987 0.36538 0.19293 0.0233 4e-3 0.0424 0.01 0.0424 0.0123 0 0.0172-0.24455 0.40245-0.36029 0.56756-0.27734 0.39568-0.53895 0.70588-0.89621 1.0627-0.1976 0.19736-0.33397 0.32275-0.51776 0.47604-1.2108 1.01-2.7012 1.6357-4.2681 1.7919-0.31935 0.0318-0.69519 0.0462-0.97637 0.0373z" style="paint-order:stroke markers fill"/>
+<path d="m367.84-4.5174c8e-3 -3e-3 0.0725-0.0222 0.14324-0.0432 1.8517-0.55041 3.4729-1.7474 4.546-3.3565 0.10723-0.16078 0.18683-0.2882 0.27184-0.43516 0.0887-0.15339 0.0778-0.14105 0.1055-0.11943 0.0313 0.0244 0.0707 0.0467 0.12402 0.0701 0.0247 0.0108 0.0441 0.0228 0.0431 0.0266-5e-3 0.0186-0.1734 0.29029-0.27312 0.44037-0.25096 0.37773-0.50495 0.69999-0.81557 1.0348-0.11441 0.12333-0.37116 0.37732-0.48807 0.48282-0.55714 0.50278-1.1434 0.90487-1.8066 1.2391-0.47031 0.237-0.92289 0.41373-1.4355 0.56053-0.17466 0.05-0.49623 0.12754-0.41497 0.10003z" style="paint-order:stroke markers fill"/>
+<path d="m378.59 6.9134c-2.1172-1.2715-3.7001-2.998-4.7484-5.1789-0.40465-0.8419-0.64858-1.516-0.85475-2.362-0.27566-1.1312-0.33039-1.6094-0.33185-2.8999-2e-3 -1.3721 0.0982-2.1413 0.42446-3.274l0.0741-0.25724 0.10478 0.2887c0.2994 0.82489 1.0665 1.5071 1.9424 1.7274 0.42242 0.10624 1.2332 0.0715 1.5912-0.0681 0.14148-0.0552 0.26949-0.10039 0.28445-0.1004 0.015-1e-5 -0.0543 0.23626-0.15387 0.52504-0.22976 0.6662-0.38143 1.2649-0.51393 2.0286-0.14316 0.82517-0.15557 2.8885-0.0222 3.6905 0.3715 2.2339 1.1928 4.1109 2.5428 5.8114 0.1889 0.23796 0.32608 0.43264 0.30485 0.43264-0.0212 0-0.31103-0.1636-0.64399-0.36357z" style="paint-order:stroke markers fill"/>
+<path d="m348.26-2.2297c-5.4297-0.23646-10.353-3.4331-12.785-8.3008-0.27412-0.54864-0.51711-1.0964-0.49582-1.1176 7e-3 -7e-3 0.0309 4e-3 0.0535 0.0238 0.0754 0.0664 0.54455 0.32511 0.77448 0.42706 0.44898 0.19906 0.94675 0.34746 1.42 0.42332 0.31849 0.0511 1.0663 0.0695 1.3955 0.0344 1.6519-0.1761 3.12-1.0588 4.0276-2.4219 0.0942-0.14149 0.1901-0.29671 0.21307-0.34494 0.023-0.0482 0.0482-0.0877 0.056-0.0877 8e-3 0 0.0333 0.0921 0.0565 0.20463 0.1081 0.52335 0.36999 1.3317 0.62523 1.9299 1.3398 3.1402 4.0582 5.5212 7.3168 6.4086 0.65828 0.17927 1.0892 0.26318 1.7856 0.34771 0.56665 0.0688 1.7922 0.075 2.3538 0.012 1.0678-0.11987 2.0204-0.35092 2.9687-0.7201 0.16005-0.0623 0.29489-0.10938 0.29965-0.10462 0.022 0.022-0.66417 0.52543-1.1519 0.84515-2.0115 1.3185-4.3608 2.1456-6.7703 2.3833-0.73637 0.0727-1.3938 0.0904-2.1429 0.0578z" style="paint-order:stroke markers fill"/>
+<path d="m378.68 5.6725c-1.3229-1.9966-1.9822-4.2858-1.9252-6.6846 0.0326-1.3729 0.25679-2.548 0.72768-3.8143l0.17009-0.45741 0.0997 0.12668c0.31961 0.40619 0.70826 0.60623 1.1778 0.60623 0.17664 0 0.23147 0.0104 0.21772 0.0413-0.63666 1.4319-0.93843 2.4612-1.132 3.8613-0.0838 0.60594-0.10134 2.1372-0.0322 2.8112 0.13321 1.2991 0.46238 2.605 0.92484 3.6691 0.0825 0.18988 0.14409 0.35118 0.13682 0.35845-7e-3 7e-3 -0.17158-0.22577-0.36513-0.51788z" style="paint-order:stroke markers fill"/>
+<path d="m379.98 6.9186c-0.18314-0.31431-0.52263-1.028-0.69691-1.465-1.0312-2.5858-1.1544-5.3805-0.35446-8.0393 0.12672-0.42118 0.46006-1.3195 0.4816-1.2978 6e-3 6e-3 0.048 0.11022 0.0939 0.23203 0.0912 0.24233 0.2502 0.508 0.41946 0.70077 0.25447 0.28982 0.74751 0.58462 1.1348 0.67856 0.24442 0.0593 0.64637 0.0804 0.84149 0.0442 0.0962-0.0178 0.17027-0.0232 0.16454-0.0119-0.56061 1.105-0.84253 1.7619-1.1515 2.6829-0.32313 0.9632-0.56148 1.9562-0.70652 2.9435-0.14016 0.95405-0.20883 2.3221-0.15853 3.1585 0.0164 0.27285 0.0265 0.50048 0.0224 0.50585-4e-3 5e-3 -0.0447-0.0542-0.0902-0.13229z" style="paint-order:stroke markers fill"/>
+<path d="m380.53 6.6112c-0.0339-0.57225 1e-3 -1.9016 0.0662-2.4933 0.16578-1.5133 0.54917-3.057 1.0966-4.4151 0.20919-0.51903 0.75063-1.674 0.78474-1.674 9e-3 0 0.0736 0.1079 0.14273 0.23978 0.14753 0.28142 0.44489 0.59447 0.7059 0.74316 0.32792 0.18679 0.57119 0.2508 0.96622 0.25422 0.19554 2e-3 0.35553 7e-3 0.35553 0.0123 0 5e-3 -0.12144 0.19051-0.26987 0.41207-1.3153 1.9632-2.6462 4.4739-3.5676 6.7303-0.10964 0.26851-0.21187 0.51796-0.22716 0.55435-0.0183 0.0436-0.0365-0.0805-0.0533-0.36381z" style="paint-order:stroke markers fill"/>
+<path d="m381.32 6.4624c0.01-0.0273 0.1176-0.2798 0.23979-0.56116 0.89423-2.0591 2.0614-4.1955 3.3328-6.1002l0.34092-0.51076 0.0788 0.14853c0.15069 0.28406 0.57728 0.57439 0.84394 0.57439 0.0437 0 0.0879 0.0136 0.0982 0.0303 0.0162 0.0262-4.7627 6.2856-4.9007 6.4189-0.0456 0.0441-0.0494 0.0441-0.0337 0z" style="paint-order:stroke markers fill"/>
+<path d="m381.33 7.516c0.0917-0.0975 0.33729-0.35607 0.5457-0.57471 1.5998-1.6783 3.2788-3.5776 4.7463-5.3693l0.36208-0.44204 0.0202 0.24422c0.0652 0.78709 0.54225 1.4882 1.2587 1.8498 0.21963 0.11087 0.62127 0.22815 0.7875 0.22995l0.11642 1e-3 -0.18191 0.17004c-0.50758 0.4745-1.3202 1.1044-2.067 1.6023-1.5372 1.0247-3.3735 1.8468-5.1594 2.3098-0.25466 0.066-0.49278 0.12808-0.52916 0.13793-0.0448 0.0121-0.0123-0.0393 0.10062-0.15929z" style="paint-order:stroke markers fill"/>
+<path d="m383.92 8.5984c-0.37038-0.0279-0.83907-0.0858-1.2178-0.15053-0.56108-0.0959-1.3648-0.2958-1.2962-0.32244 0.0193-8e-3 0.15084-0.0415 0.29232-0.0755 0.53088-0.12775 1.2593-0.3541 1.8943-0.58863 2.0682-0.76389 4.0731-1.9832 5.7296-3.4845 0.12863-0.11657 0.23642-0.2096 0.23954-0.20671 3e-3 3e-3 0.0212 0.0939 0.0402 0.20224 0.0924 0.52775 0.33778 0.98084 0.74082 1.368 0.44993 0.43222 0.96081 0.64458 1.6451 0.68382l0.28024 0.0161-0.23302 0.17427c-1.856 1.388-4.1201 2.2237-6.4623 2.3852-0.40827 0.0282-1.2709 0.0275-1.6527-1e-3z" style="paint-order:stroke markers fill"/>
+<path d="m387.38 10.858c-1.6902-0.15371-3.3363-0.67153-4.7979-1.5093-0.27139-0.15556-0.99947-0.629-0.98633-0.64137 4e-3 -4e-3 0.1605 0.0282 0.34701 0.0718 0.42409 0.0991 0.89702 0.17947 1.4522 0.24678 0.3735 0.0453 0.54939 0.0524 1.3308 0.0536 0.91981 1e-3 1.1314-0.0109 1.8241-0.10661 2.2062-0.30481 4.4225-1.2665 6.1388-2.6637l0.1637-0.13326 8e-4 0.37672c5.3e-4 0.31777 9e-3 0.40784 0.0543 0.57551 0.24305 0.90176 0.98636 1.5626 1.9053 1.6939l0.18766 0.0268-0.25545 0.16467c-1.6693 1.076-3.5176 1.7007-5.4915 1.856-0.40477 0.0318-1.4681 0.0253-1.8733-0.0116z" style="paint-order:stroke markers fill"/>
+<path d="m389.95 13.091c-2.6479-0.14241-5.1475-1.1237-7.1841-2.8204-0.30469-0.25383-0.7204-0.64095-0.70492-0.65643 5e-3 -5e-3 0.15029 0.0716 0.3222 0.17078 2.5182 1.4534 5.5792 1.9323 8.4969 1.3292 1.4687-0.30357 2.9517-0.92726 4.225-1.7768l0.38886-0.25947 0.0157 0.20023c0.0428 0.5471 0.24258 0.99858 0.59996 1.356 0.22669 0.22669 0.52483 0.4108 0.81664 0.50429 0.0707 0.0227 0.13674 0.0486 0.14666 0.0575 0.0238 0.0215-0.49722 0.33122-0.9465 0.56258-1.4195 0.73099-3.0062 1.182-4.6024 1.3082-0.44707 0.0353-1.1632 0.0464-1.574 0.0243z" style="paint-order:stroke markers fill"/>
+<path d="m399.81 20.987c-0.60207-0.33109-1.0105-0.63477-1.4749-1.0968-0.37773-0.37574-0.54354-0.57457-0.81435-0.97661-0.54977-0.81614-0.89564-1.7279-1.0357-2.7301-0.0613-0.43854-0.0555-1.2826 0.0118-1.7189 0.0839-0.5437 0.22535-1.0626 0.41764-1.5318 0.10164-0.24801 0.34933-0.7314 0.48396-0.94448l0.10174-0.16104 0.0161 0.11427c0.0605 0.42964 0.2621 0.84914 0.56542 1.1768 0.37303 0.40291 0.89375 0.64363 1.4623 0.67598l0.27189 0.0155-0.16963 0.22702c-0.53823 0.7203-0.8904 1.5719-1.0328 2.4975-0.0572 0.37159-0.0564 1.1686 1e-3 1.5435 0.16872 1.0932 0.61411 2.0428 1.3482 2.8744 0.0918 0.10402 0.15808 0.18911 0.14726 0.18909-0.0108-2e-5 -0.14596-0.0695-0.30031-0.15436z" style="paint-order:stroke markers fill"/>
+<path d="m400.92 21.057c-0.52146-0.58412-0.88984-1.2663-1.0744-1.9895-0.11002-0.43124-0.13769-0.66179-0.13881-1.1565-1e-3 -0.45306 0.011-0.5874 0.0841-0.94258 0.11542-0.56036 0.34464-1.1269 0.64235-1.5875l0.10687-0.16537 5.3e-4 0.10749c2e-3 0.46673 0.23502 0.99086 0.58694 1.3201 0.24725 0.23129 0.58555 0.40945 0.88635 0.46679 0.0585 0.0111 0.11562 0.0251 0.12706 0.0311 0.0142 7e-3 -0.0184 0.0599-0.10318 0.16609-0.57618 0.72164-0.93443 1.5963-1.0432 2.547-0.0307 0.2679-0.0254 0.93046 9e-3 1.1545 0.0103 0.0665 0.0164 0.12792 0.0136 0.1364-3e-3 8e-3 -0.0467-0.0311-0.0974-0.0879z" style="paint-order:stroke markers fill"/>
+<path d="m401.45 20.744c-0.0775-0.99578 0.18384-2.0044 0.73266-2.8277 0.14398-0.21597 0.3362-0.46801 0.35692-0.46801 6e-3 0 0.0272 0.0409 0.0475 0.0909 0.0741 0.18212 0.20434 0.35394 0.35779 0.47202 0.0935 0.0719 0.31572 0.18943 0.35825 0.18943 0.0116 0 0.0211 4e-3 0.0211 8e-3s-0.11628 0.12165-0.2584 0.26045c-0.38046 0.37155-0.63677 0.6778-0.91008 1.0874-0.2253 0.33767-0.44625 0.75096-0.60119 1.1245-0.0396 0.0955-0.077 0.17958-0.083 0.18683-6e-3 7e-3 -0.0157-0.0486-0.0216-0.12402z" style="paint-order:stroke markers fill"/>
+<path d="m402.15 20.504c0-0.0334 0.24916-0.46636 0.39192-0.6811 0.28731-0.43212 0.68064-0.884 1.0544-1.2114l0.14824-0.12982 0.045 0.0991c0.0247 0.0545 0.0825 0.13877 0.12839 0.18728l0.0834 0.0882-0.11126 0.0813c-0.44333 0.32389-0.92835 0.7507-1.397 1.2293-0.18873 0.19274-0.34314 0.34446-0.34314 0.33715z" style="paint-order:stroke markers fill"/>
+<path d="m402.59 21.125c0.4923-0.40782 0.99191-0.78862 1.5187-1.1575l0.34673-0.24283 0.0211 0.0823c0.0312 0.12193 0.0982 0.24828 0.18289 0.34514 0.0601 0.0687 0.0705 0.0891 0.0519 0.10142-0.0601 0.0398-0.79634 0.40432-1.032 0.51099-0.3828 0.17325-1.1867 0.49578-1.2357 0.49578-9e-3 0 0.0567-0.0608 0.14648-0.13522z" style="paint-order:stroke markers fill"/>
+<path d="m402.56 21.722c0.0227-0.01 0.16999-0.0659 0.32721-0.1248 0.56382-0.21129 1.3056-0.54359 1.8385-0.82358 0.13158-0.0691 0.24049-0.12569 0.24204-0.12569 2e-3 0 8e-3 0.0336 0.014 0.0746 0.0177 0.11798 0.12784 0.31938 0.23218 0.42456l0.0925 0.0932-0.17017 0.0656c-0.50689 0.19531-0.99205 0.31802-1.5592 0.39439-0.22457 0.0302-1.0796 0.0485-1.017 0.0218z" style="paint-order:stroke markers fill"/>
+<path d="m403.61 22.266c-0.10004-8e-3 -0.24143-0.0241-0.31419-0.0361l-0.1323-0.0217 0.1323-0.0124c0.83554-0.0784 1.4942-0.23548 2.157-0.51455 0.11856-0.0499 0.2231-0.0907 0.23231-0.0907 9e-3 0 0.0168 0.013 0.0169 0.0289 2.5e-4 0.0433 0.0712 0.18704 0.12225 0.24743l0.0449 0.0531-0.0585 0.0245c-0.11238 0.0469-0.47605 0.16017-0.64312 0.20021-0.49851 0.11947-1.0434 0.16193-1.5575 0.12137z" style="paint-order:stroke markers fill"/>
+<path d="m405.56 24.848c-1.4948-0.13339-2.7998-0.96151-3.5381-2.2452-0.0434-0.0755-0.0751-0.14107-0.0705-0.14573 5e-3 -5e-3 0.0744 0.0246 0.15489 0.065 0.20545 0.1031 0.57359 0.24624 0.80788 0.31413 0.46316 0.13421 0.83308 0.19182 1.3146 0.20475 0.53525 0.0144 0.98803-0.0367 1.4769-0.16649 0.17783-0.0472 0.2102-0.0519 0.2014-0.0292-6e-3 0.0149-0.0283 0.0882-0.05 0.16299-0.17513 0.60285-0.0112 1.2558 0.42681 1.7002l0.11938 0.12111-0.0579 9e-3c-0.11089 0.0179-0.62128 0.0238-0.78548 9e-3z" style="paint-order:stroke markers fill"/>
+<path d="m407.17 29.355c-1.0234-0.0845-2.0588-0.44432-2.9018-1.0086-1.2307-0.82375-2.1616-2.1094-2.5288-3.4926-0.1486-0.5597-0.18755-0.84755-0.20501-1.5151l-0.0169-0.64492 0.18538 0.293c0.74243 1.1735 1.8308 1.9366 3.1989 2.2429 0.29716 0.0665 0.43286 0.0769 1.0095 0.0769h0.66618l-0.062 0.12163c-0.0341 0.0669-0.10234 0.25293-0.15157 0.41341-0.0807 0.26297-0.0896 0.3424-0.0903 0.80441-7.9e-4 0.58477 0.0361 0.76722 0.24688 1.2185 0.28988 0.62054 0.81266 1.1524 1.3866 1.4107l0.14676 0.066-0.0979 0.021c-0.12985 0.0278-0.39028 0.0255-0.78577-7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m408.24 38.752c-5.8-1.3445-9.4745-7.1075-8.2371-12.919 0.15655-0.73523 0.43702-1.5884 0.74395-2.2631l0.22522-0.49505 0.0789 0.72656c0.10006 0.92134 0.27705 1.5598 0.64436 2.3246 1.1149 2.3213 3.3727 3.7229 6.0021 3.7258l0.78041 8e-4 -0.43386 0.51263c-0.47486 0.56107-1.0165 1.5731-1.1948 2.2324-0.1665 0.61558-0.20317 1.9475-0.0715 2.5973 0.29339 1.448 1.1604 2.7715 2.3584 3.6004l0.16229 0.11229-0.19844-1e-3c-0.10914-5.3e-4 -0.49609-0.0702-0.8599-0.15448z" style="paint-order:stroke markers fill"/>
+<path d="m405.1 57.389c-0.75905-1.5676-1.1834-3.1161-1.336-4.875-0.0504-0.58132-0.0202-2.1619 0.0513-2.6799 0.1363-0.98813 0.31684-1.7862 0.59507-2.6305 0.85796-2.6035 2.4998-4.9008 4.6839-6.5541 0.43181-0.32685 0.95699-0.68191 0.97783-0.66107 9e-3 9e-3 -0.0357 0.16271-0.0983 0.34261-0.20281 0.58264-0.23625 0.80621-0.23663 1.5821-2.7e-4 0.55527 0.012 0.7509 0.0612 0.97565 0.20358 0.93033 0.6654 1.7922 1.311 2.4467 0.58005 0.58802 1.29 1.0193 2.0429 1.2411l0.24042 0.0708-0.44286 0.17162c-4.3838 1.6989-7.3758 5.8901-7.5576 10.587l-0.021 0.54348z" style="paint-order:stroke markers fill"/>
+<path d="m405.88 57.168c-2.5e-4 -0.19175 0.0875-0.92379 0.15398-1.2849 0.41853-2.2726 1.4685-4.3095 3.061-5.9381 1.1207-1.1461 2.3243-1.9649 3.8047-2.5883 0.23581-0.0993 0.95418-0.3617 0.99023-0.3617 4e-3 0-0.0165 0.0447-0.0466 0.0994-0.12192 0.2216-0.18234 0.47566-0.19371 0.81441-9e-3 0.2709-3e-3 0.34807 0.0403 0.52619 0.10592 0.43385 0.37689 0.84973 0.72186 1.1079l0.17031 0.12748-0.38594 0.0996c-0.97093 0.25067-2.0322 0.68133-2.9258 1.1873-0.33056 0.18717-0.98357 0.61643-1.2979 0.8532-1.7525 1.32-3.1319 3.1131-3.9502 5.1352l-0.14197 0.35079z" style="paint-order:stroke markers fill"/>
+<path d="m413.8 46.249c-1.3392-0.24582-2.5178-1.1241-3.1346-2.3359-0.4318-0.84831-0.57468-1.7894-0.41736-2.7491l0.0285-0.17363 0.0206 0.16536c0.20257 1.6267 1.397 2.9738 2.982 3.363 0.21182 0.052 0.51217 0.10134 0.61711 0.10134h0.0589l-0.0724 0.13643c-0.0398 0.075-0.0927 0.2034-0.11752 0.28525-0.0404 0.13333-0.0451 0.17467-0.0454 0.39688-2.7e-4 0.29874 0.029 0.42877 0.15203 0.67386 0.0445 0.0887 0.0726 0.16042 0.0624 0.15944-0.0102-1e-3 -0.0706-0.0113-0.13426-0.0231z" style="paint-order:stroke markers fill"/>
+<path d="m413.4 44.068c-0.66542-0.17175-1.1696-0.45651-1.6387-0.92545-0.65038-0.65019-0.99924-1.4661-1.026-2.3994l-9e-3 -0.29765 0.0803 0.1819c0.37748 0.85498 1.1021 1.5168 1.981 1.8093 0.22807 0.0759 0.54772 0.14362 0.75458 0.15985l0.14273 0.0112-0.0556 0.0934c-0.23872 0.40074-0.22051 0.97464 0.0435 1.37l0.0359 0.0537-0.0471-7.9e-4c-0.0259-2.7e-4 -0.14383-0.0257-0.26207-0.0562z" style="paint-order:stroke markers fill"/>
+<path d="m413.14 42.056c-0.80366-0.2071-1.4632-0.73517-1.8364-1.4704-0.0966-0.19036-0.19104-0.42766-0.17608-0.44262 4e-3 -4e-3 0.0585 0.0368 0.12036 0.0914 0.5016 0.44342 1.1971 0.73339 1.8942 0.78972 0.0796 6e-3 0.1447 0.0136 0.1447 0.0159 0 2e-3 -0.0108 0.0348-0.024 0.0722-0.0925 0.26219-0.051 0.63788 0.0978 0.8849 0.0322 0.0534 0.0585 0.0999 0.0585 0.10335 0 0.0168-0.10881-5.3e-4 -0.27908-0.0445z" style="paint-order:stroke markers fill"/>
+<path d="m412.84 40.511c-0.47001-0.0975-0.92859-0.32155-1.2809-0.62573-0.0511-0.0441-0.0898-0.0834-0.0859-0.0873 4e-3 -4e-3 0.10026 0.0119 0.21422 0.0349 0.36453 0.0738 0.62256 0.0953 1.0668 0.0889 0.396-6e-3 0.40216-5e-3 0.39212 0.0273-6e-3 0.0182-0.0142 0.10005-0.0191 0.1819-8e-3 0.13914 4e-3 0.22595 0.0529 0.38448 0.0109 0.0352 7e-3 0.0371-0.0689 0.0361-0.0443-5.3e-4 -0.16633-0.0189-0.27126-0.0407z" style="paint-order:stroke markers fill"/>
+<path d="m407.63 36.255c-0.36614-0.80099-0.53037-1.7317-0.45709-2.5903 0.1089-1.2761 0.66515-2.4483 1.5817-3.3331 0.19293-0.18626 0.47051-0.41484 0.65002-0.53528 0.15749-0.10566 0.16532-0.10751 0.16532-0.039 0 0.14781 0.10789 0.38016 0.24275 0.52277 0.0479 0.0506 0.0854 0.0925 0.0834 0.0932-2e-3 5.2e-4 -0.0892 0.0581-0.19383 0.12783-0.27219 0.18138-0.52309 0.3876-0.76073 0.62524-0.91446 0.91445-1.4403 2.1196-1.4981 3.4333-0.0231 0.52518 0.0701 1.225 0.22724 1.7065 0.0187 0.0574 0.0307 0.1078 0.0266 0.11194-4e-3 4e-3 -0.0344-0.0512-0.0672-0.12304z" style="paint-order:stroke markers fill"/>
+<path d="m410.11 38.638c-0.2819-0.20203-0.62452-0.52696-0.84388-0.80031-1.1914-1.4846-1.2842-3.5652-0.22948-5.1428 0.16014-0.23954 0.3597-0.49274 0.36822-0.4672 3e-3 0.01-5e-3 0.0611-0.0187 0.11424-0.0689 0.27097-0.0779 0.77731-0.0186 1.0475 0.19454 0.88611 0.81896 1.5829 1.6538 1.8454 0.0818 0.0257 0.15215 0.0491 0.15621 0.052 4e-3 3e-3 -0.0488 0.0627-0.11754 0.13287-0.4256 0.43492-0.71222 0.95078-0.85653 1.5415-0.0688 0.28187-0.0901 0.47163-0.0889 0.79375 1e-3 0.31418 0.0279 0.53371 0.0977 0.8021 0.023 0.0884 0.0387 0.16386 0.035 0.1676-4e-3 4e-3 -0.0655-0.0353-0.13729-0.0867z" style="paint-order:stroke markers fill"/>
+<path d="m410.64 38.358c-0.0494-0.1663-0.0779-0.55481-0.0598-0.81514 0.0269-0.38679 0.11549-0.70627 0.29656-1.0692 0.13495-0.27051 0.27542-0.47282 0.47764-0.68794l0.14533-0.1546 0.0301 0.1227c0.0386 0.1576 0.13437 0.3481 0.23291 0.46336 0.0784 0.0917 0.26074 0.24822 0.2892 0.24822 0.0373 0 9e-3 0.0329-0.0796 0.0912-0.57073 0.37729-1.0588 1.0246-1.2771 1.6939-0.0317 0.0972-0.0485 0.12995-0.0552 0.10749z" style="paint-order:stroke markers fill"/>
+<path d="m411.3 37.999c0-2e-3 0.0142-0.0292 0.0315-0.0611 0.23904-0.44014 0.59099-0.81243 1.014-1.0726 0.0373-0.0229 0.0691-0.0417 0.0707-0.0417 2e-3 0 6e-3 0.0154 0.01 0.0341 0.0132 0.0666 0.0469 0.15097 0.0828 0.20704 8e-3 0.013 0.0149 0.025 0.0147 0.0266-1.9e-4 2e-3 -0.0323 0.0188-0.0713 0.0382-0.40207 0.19906-0.80067 0.49676-1.1142 0.83216-0.0208 0.0223-0.0378 0.0391-0.0378 0.0374z" style="paint-order:stroke markers fill"/>
+<path d="m411.7 38.579c4e-3 -3e-3 0.0286-0.0237 0.0558-0.0466 0.21423-0.18019 0.45619-0.34551 0.71084-0.48568 0.0849-0.0468 0.2753-0.1407 0.27964-0.13801 2e-3 1e-3 4e-3 8e-3 4e-3 0.0154 5e-5 0.0174 0.0174 0.0929 0.0291 0.12688 7e-3 0.0208 0.0335 0.0802 0.0442 0.0998 7.9e-4 1e-3 -3e-3 4e-3 -9e-3 5e-3 -0.0164 4e-3 -0.20248 0.0689-0.31831 0.11074-0.23538 0.0851-0.6006 0.2301-0.77256 0.30669-0.0264 0.0118-0.033 0.0134-0.023 6e-3z" style="paint-order:stroke markers fill"/>
+<path d="m411.9 38.99c0.0278-0.0162 0.41353-0.17242 0.58291-0.23603 0.1831-0.0688 0.46264-0.16748 0.46514-0.16426 5.3e-4 5.3e-4 4e-3 0.0183 8e-3 0.0394 8e-3 0.0473 0.0232 0.0944 0.0445 0.14282 9e-3 0.0203 0.0157 0.0374 0.0151 0.0378-2e-3 2e-3 -0.22416 0.0469-0.29265 0.0598-0.23183 0.0438-0.47797 0.0821-0.71891 0.11181-0.11054 0.0137-0.11277 0.0138-0.10378 9e-3z" style="paint-order:stroke markers fill"/>
+<path d="m409.24 53.044c0.0207-0.0232 0.2267-0.21128 0.34147-0.31174 0.93053-0.8145 1.9631-1.4647 3.1016-1.9531 0.77662-0.33314 1.6533-0.59918 2.4555-0.74518 0.0547-0.01 0.10531-0.0194 0.11254-0.0209 0.0128-3e-3 0.0131-2e-3 0.0131 0.0433 0 0.05 0.0122 0.1304 0.0255 0.16812l8e-3 0.0237-0.12654 0.022c-1.0564 0.18322-2.086 0.50274-3.0644 0.95099-0.17675 0.081-0.58469 0.28561-0.7542 0.37833-0.65168 0.35645-1.2508 0.75579-1.83 1.2197-0.10004 0.0801-0.27358 0.22492-0.27784 0.23181-2e-3 3e-3 -6e-3 6e-3 -0.01 6e-3s-1e-3 -6e-3 5e-3 -0.0125z" style="paint-order:stroke markers fill"/>
+<path d="m406.17 58.256c0-0.0247 0.26979-0.58363 0.40893-0.84728 0.33971-0.64371 0.86854-1.4362 1.3283-1.9906 0.54375-0.65571 1.1836-1.2842 1.8346-1.8018 0.91783-0.72987 1.9888-1.3477 3.0923-1.7841 0.45859-0.18132 1.4198-0.48621 1.475-0.46783 0.01 3e-3 -0.0245 0.0538-0.0766 0.11222-0.28953 0.32448-0.51334 0.79117-0.59859 1.2482-0.0465 0.24925-0.0431 0.71369 7e-3 0.96288 0.10304 0.51199 0.35255 0.98002 0.71801 1.3469l0.1606 0.1612-0.0531 9e-3c-0.0292 5e-3 -0.17589 0.0279-0.32596 0.051-2.1317 0.3282-4.1999 0.9917-6.135 1.9682-0.56264 0.28392-1.2511 0.67319-1.6991 0.96066-0.075 0.0482-0.13642 0.0804-0.13642 0.0716z" style="paint-order:stroke markers fill"/>
+<path d="m406.59 58.56c0.0182-0.0139 0.16974-0.10737 0.33678-0.20779 2.2722-1.3659 4.8146-2.2757 7.4321-2.6594 0.32154-0.0471 0.29997-0.0582 0.21707 0.11122-0.13074 0.26717-0.1863 0.4911-0.20042 0.80776-0.0254 0.56991 0.19788 1.1274 0.60946 1.5217l0.10561 0.10118-0.55442 0.011c-2.6792 0.0534-5.6919 0.18176-7.6155 0.32453-0.11823 9e-3 -0.24846 0.0157-0.28939 0.0155-0.0702-5.3e-4 -0.0725-2e-3 -0.0413-0.0257z" style="paint-order:stroke markers fill"/>
+<path d="m415.1 60.361c-2.6272-0.15163-5.3197-0.57922-7.7804-1.2356l-0.33073-0.0882 0.10748-0.0107c0.13477-0.0134 0.99415-0.0659 1.7859-0.10913 1.8892-0.10322 3.847-0.1732 5.8448-0.20889l0.62757-0.0112-0.0605 0.0841c-0.14097 0.19623-0.23477 0.45916-0.25331 0.71011-0.0186 0.25159 0.0524 0.54925 0.1838 0.7704 0.0315 0.0529 0.0572 0.0994 0.0572 0.10335 0 4e-3 -0.0205 6e-3 -0.0455 4e-3s-0.0864-5e-3 -0.13643-8e-3z" style="paint-order:stroke markers fill"/>
+<path d="m414.9 61.654c-2.3453-0.25141-4.5511-0.82744-6.7098-1.7522-0.16607-0.0712-0.29869-0.1326-0.29472-0.13658 4e-3 -4e-3 0.15101 0.0267 0.32675 0.0683 2.2078 0.52154 4.6386 0.87419 6.8147 0.9887 0.21627 0.0114 0.40062 0.0253 0.40966 0.0309 0.0104 6e-3 6e-3 0.0343-0.011 0.0751-0.08 0.18908-0.097 0.45698-0.0417 0.65647l0.0309 0.11127-0.0846-2e-3c-0.0465-1e-3 -0.24459-0.019-0.44013-0.04z" style="paint-order:stroke markers fill"/>
+<path d="m414.24 64.671c-2.2681-0.53681-4.2345-1.5531-5.9779-3.0896-0.27137-0.23916-0.88944-0.85722-1.1176-1.1176-0.30827-0.35177-0.72618-0.86816-0.70261-0.86816 5e-3 0 0.16413 0.0772 0.35277 0.17147 2.1424 1.0711 4.4344 1.807 6.8005 2.1834 0.39401 0.0627 1.0577 0.14973 1.2857 0.16861 0.075 6e-3 0.13643 0.0148 0.13643 0.019 0 4e-3 -0.0522 0.0561-0.11595 0.11511-0.22189 0.20543-0.40607 0.48893-0.50996 0.78497-0.17611 0.50181-0.14551 1.0274 0.0881 1.5141 0.0713 0.14857 0.0837 0.18574 0.0614 0.18456-0.0154-7.9e-4 -0.15075-0.0305-0.30082-0.066z" style="paint-order:stroke markers fill"/>
+<path d="m413.68 68.749c-1.0315-0.34789-1.8803-0.76397-2.7566-1.3514-2.1067-1.4121-3.6769-3.472-4.4787-5.8753-0.17375-0.5208-0.36537-1.2708-0.41195-1.6123l-0.0102-0.0744 0.046 0.0576c0.62815 0.78685 0.77886 0.9585 1.2934 1.4731 0.42373 0.42373 0.68889 0.66409 1.0925 0.99029 1.6352 1.3216 3.5279 2.2528 5.5645 2.7376 0.1819 0.0433 0.36233 0.0871 0.40096 0.0973l0.0702 0.0185-0.1172 0.091c-0.4117 0.31949-0.73745 0.83682-0.86615 1.3755-0.17209 0.72038-0.0119 1.5043 0.42545 2.0822 0.0352 0.0465 0.0616 0.0866 0.0588 0.0891-3e-3 2e-3 -0.14285-0.0419-0.31111-0.0987z" style="paint-order:stroke markers fill"/>
+<path d="m413.31 72.504c-2.0472-0.7478-3.8137-2.0131-5.151-3.6896-1.5107-1.8939-2.3791-4.141-2.54-6.5732-0.0298-0.4504 5.3e-4 -1.8614 0.0382-1.7694 6e-3 0.0137 0.0304 0.11038 0.0553 0.21497 0.58335 2.4576 1.9754 4.7051 3.9236 6.3349 1.3079 1.0941 2.8384 1.8969 4.4885 2.3544l0.0952 0.0264-0.16399 0.12353c-0.36624 0.27589-0.63088 0.64473-0.76986 1.073-0.0841 0.25915-0.0998 0.36739-0.0998 0.68766 0 0.17932 9e-3 0.33341 0.0229 0.40514 0.0532 0.26955 0.18427 0.59437 0.32263 0.79955 0.0328 0.0487 0.0597 0.0915 0.0597 0.0951 0 0.0162-0.0569-5.3e-4 -0.28112-0.0823z" style="paint-order:stroke markers fill"/>
+<path d="m413.92 73.92c-0.76722-0.23803-1.3879-0.48475-2.0089-0.79849-2.8797-1.455-5.0454-4.0103-6.0123-7.0937-0.0897-0.28602-0.27226-0.98464-0.27144-1.0387 2.3e-4 -0.0154 0.0551 0.13579 0.12188 0.33588 0.76718 2.298 2.1364 4.2515 4.0245 5.7417 1.2129 0.95728 2.6276 1.6818 4.1449 2.1228 0.15386 0.0447 0.28202 0.0836 0.28481 0.0864 3e-3 3e-3 -0.0146 0.034-0.0386 0.0693-0.0803 0.11815-0.12638 0.28066-0.1278 0.45061-8e-4 0.0912-8e-3 0.15232-0.0178 0.15138-9e-3 -8e-4 -0.0537-0.0131-0.0992-0.0272z" style="paint-order:stroke markers fill"/>
+<path d="m413.62 74.679c-2.9099-0.92812-5.337-2.8835-6.8574-5.5248-0.16013-0.27817-0.49306-0.92834-0.49306-0.96288 0-0.0117 0.0556 0.0806 0.12354 0.2051 0.57745 1.058 1.276 1.9917 2.1252 2.8408 1.1918 1.1915 2.5956 2.1178 4.1634 2.7472 0.29033 0.11656 0.80621 0.29376 1.1036 0.37909 0.13643 0.0391 0.24926 0.0717 0.25074 0.0723 2e-3 5.3e-4 -0.0151 0.0532-0.0368 0.11687-0.0217 0.0637-0.0397 0.13994-0.0399 0.1695-2.5e-4 0.0323-9e-3 0.0533-0.0211 0.0527-0.0114-5.3e-4 -0.15461-0.0437-0.31833-0.096z" style="paint-order:stroke markers fill"/>
+<path d="m400 85.799c-0.40148-0.66595-1.033-1.932-1.3299-2.666-0.64704-1.5999-1.1218-3.457-1.3452-5.2619-0.10085-0.81502-0.14075-2.897-0.0722-3.7673 0.40139-5.0946 2.5896-9.6633 6.3143-13.184 0.46374-0.43828 1.5515-1.3489 1.5787-1.3216 8e-3 8e-3 -0.0374 0.22316-0.10032 0.47873-0.25694 1.0439-0.35075 1.8551-0.35126 3.0374-7.9e-4 2.1125 0.43631 3.9304 1.3948 5.7995 1.2042 2.3482 3.2628 4.367 5.6295 5.5207l0.40647 0.19814-0.50002 0.0315c-0.71263 0.0449-1.2228 0.1075-1.7862 0.21914-3.5605 0.70543-6.5913 3.0116-8.1983 6.2381-0.75346 1.5128-1.1324 2.9566-1.2399 4.724l-0.0341 0.56126z" style="paint-order:stroke markers fill"/>
+<path d="m400.92 85.531c0.14225-2.0771 0.92968-4.1584 2.2432-5.9289 0.43654-0.58842 1.5734-1.7228 2.1683-2.1635 1.9999-1.4816 4.3464-2.2799 6.7015-2.2799h0.58387l-0.29633 0.17531c-0.39082 0.2312-0.87333 0.74575-1.0944 1.167-0.54249 1.034-0.47096 2.346 0.17708 3.248 0.0898 0.12507 0.16337 0.23409 0.16337 0.24226 0 8e-3 -0.45779 6e-3 -1.0173-5e-3 -1.1325-0.0221-1.8134 0.0423-2.672 0.25283-2.9365 0.7199-5.3543 2.6125-6.7447 5.2796l-0.24383 0.46772z" style="paint-order:stroke markers fill"/>
+<path d="m407.96 34.006c-2e-3 -0.0364 0.0656-0.34744 0.10845-0.50122 0.30832-1.1063 1.0065-2.0552 1.9666-2.6727 0.11303-0.0727 0.18073-0.11324 0.18385-0.11009 1e-3 1e-3 0.0105 0.0231 0.0206 0.0486s0.029 0.0645 0.042 0.0867c0.0129 0.0222 0.0226 0.0411 0.0216 0.042-1e-3 1e-3 -0.0243 0.0143-0.0517 0.0297-0.19703 0.1108-0.46347 0.29518-0.65481 0.45314-0.2425 0.2002-0.49051 0.44975-0.68258 0.68682-0.26317 0.32484-0.49615 0.70521-0.6607 1.0787-0.11322 0.25698-0.1952 0.49331-0.26769 0.77174-0.0138 0.0531-0.0253 0.092-0.0256 0.0866z" style="paint-order:stroke markers fill"/>
+<path d="m403.57 19.78c3e-3 -3e-3 0.0318-0.0272 0.063-0.0535 0.21707-0.18268 0.44397-0.35877 0.67849-0.52656 0.0581-0.0416 0.0644-0.0456 0.0665-0.0421 1e-3 2e-3 9e-3 0.0135 0.0164 0.0254 8e-3 0.0119 0.0138 0.0219 0.0134 0.0223-2.6e-4 2.6e-4 -0.0509 0.0341-0.11232 0.0749-0.21836 0.14524-0.42067 0.28469-0.63043 0.43453-0.0534 0.0382-0.0981 0.0697-0.0992 0.0701-1e-3 2.6e-4 7.9e-4 -2e-3 4e-3 -5e-3z" style="paint-order:stroke markers fill"/>
+<path d="m399.03 17.007c-2.6e-4 -8e-3 3e-3 -0.0607 8e-3 -0.11693 0.10184-1.1758 0.58981-2.2402 1.4146-3.0859l0.0883-0.0905 0.0227 0.0316c0.0125 0.0174 0.0368 0.0464 0.054 0.0644l0.0313 0.0328-0.12439 0.12511c-0.50406 0.50696-0.88921 1.0901-1.1524 1.7447-0.16378 0.40735-0.269 0.80544-0.33602 1.2713-3e-3 0.0209-6e-3 0.0314-6e-3 0.0234z" style="paint-order:stroke markers fill"/>
+<path d="m396.23 22.207c-2.2749-0.10612-4.4681-0.66282-6.481-1.6451-0.31037-0.15146-0.69975-0.35183-0.86529-0.44527-3.892-2.1968-6.693-5.8228-7.8402-10.149-0.0926-0.34909-0.21755-0.91093-0.20857-0.93755 4e-3 -0.0114 0.0561 0.0396 0.11619 0.11344 0.06 0.0738 0.23368 0.26665 0.38587 0.42851 1.9184 2.0404 4.3849 3.3636 7.1432 3.8321 0.73432 0.12473 1.0819 0.15041 2.0553 0.15187 0.94309 1e-3 1.1105-8e-3 1.8234-0.10693 1.4682-0.2029 3.0766-0.74001 4.3118-1.4399 0.10089-0.0572 0.1877-0.0997 0.19291-0.0945 5e-3 5e-3 -0.0493 0.12201-0.12114 0.25957-0.3576 0.68475-0.59167 1.4042-0.71623 2.2016-0.0432 0.27667-0.0513 0.42707-0.0519 0.97052-7.9e-4 0.69965 0.0215 0.92471 0.14941 1.5084 0.48164 2.1973 2.0513 4.0398 4.1504 4.8719l0.23218 0.092-0.16202 0.0368c-0.52778 0.11985-1.3728 0.24447-2.0914 0.30843-0.39278 0.035-1.633 0.0615-2.0229 0.0434z" style="paint-order:stroke markers fill"/>
+<path d="m311.64 8.1029c-2.3382-0.11924-4.1231-0.44429-6.1516-1.1202-2.4882-0.82912-4.8234-2.1066-6.829-3.7356l-0.24748-0.20102 0.5286-0.0212c0.99796-0.04 1.7943-0.23927 2.6317-0.65865 1.8543-0.92859 3.1234-2.7737 3.3428-4.86l0.0403-0.38281 0.24801 0.26588c3.8039 4.0781 9.3612 6.0492 14.87 5.2743 5.4533-0.767 10.181-4.0983 12.741-8.9772 0.30992-0.5907 0.3196-0.55955 0.0512 0.16453-1.5812 4.265-4.4369 7.9154-8.1951 10.476-3.1033 2.1142-6.7197 3.3942-10.484 3.7108-0.58852 0.0495-2.0984 0.0883-2.5466 0.0654z" style="paint-order:stroke markers fill"/>
+<path d="m289.18 31.167c-1.549-0.0869-3.3594-0.28153-4.788-0.51479l-0.789-0.12882 0.63056-0.12565c4.6282-0.9222 8.9222-3.6448 11.753-7.4517 3.2608-4.3855 4.533-9.8614 3.5484-15.274-0.20907-1.1493-0.64906-2.6831-1.0453-3.6439-0.0786-0.19057-0.13746-0.35185-0.13081-0.35839 7e-3 -7e-3 0.23309 0.15725 0.5032 0.36398 2.8082 2.1493 6.2847 3.658 9.7788 4.2435 1.4086 0.23606 2.1756 0.29877 3.6916 0.30182 1.4091 3e-3 2.0686-0.0397 3.2467-0.20952 4.248-0.61228 8.1755-2.4095 11.463-5.2456 1.1643-1.0044 2.6213-2.6132 3.5639-3.9351 0.83535-1.1716 1.7674-2.8498 2.3568-4.2437 0.3005-0.71066 0.75786-2.0253 0.95022-2.7312 0.13661-0.50136 0.14407-0.43579 0.0513 0.45103-0.87364 8.3541-4.0634 16.106-9.2994 22.599-1.3295 1.6487-3.2604 3.6868-4.7322 4.9948-3.7755 3.3553-8.0076 5.9926-12.574 7.8356-4.3685 1.7632-8.849 2.7638-13.689 3.057-0.68878 0.0417-3.829 0.0525-4.4901 0.0154z" style="paint-order:stroke markers fill"/>
+<path d="m283.32 29.87c0.43149-0.3548 1.3136-1.2488 1.6638-1.6862 2.6806-3.3482 3.356-7.8209 1.783-11.807-0.28334-0.71797-0.86781-1.828-1.1874-2.255-0.0433-0.0579-0.0788-0.11158-0.0788-0.11927 0-8e-3 0.15255 0.0294 0.339 0.0825 2.456 0.69919 5.0025 0.42649 7.2512-0.77649 1.957-1.0469 3.5388-2.8324 4.3578-4.9188 0.41932-1.0683 0.61353-2.035 0.64756-3.2234l0.0217-0.75943 0.17396 0.49485c1.5469 4.4003 1.4461 9.1196-0.28746 13.457-1.5021 3.7583-4.2608 7.0217-7.7248 9.1379-2.0814 1.2716-4.4288 2.1527-6.7634 2.5386-0.17281 0.0286-0.35782 0.0608-0.41114 0.0716-0.0777 0.0157-0.0351-0.0312 0.21497-0.23684z" style="paint-order:stroke markers fill"/>
+<path d="m302.34 108.32c-0.27436-1.5478-1.2899-3.9697-2.3367-5.5728-2.7227-4.1696-7.072-6.8801-12.12-7.5533-1.0498-0.14-3.4273-0.10332-4.5558 0.0703-0.52299 0.0804-0.96138 0.13578-0.9742 0.12296-0.0128-0.0128 0.20157-0.2745 0.47643-0.58149 3.9909-4.4574 6.1119-9.9422 6.1119-15.805 0-3.7877-0.84998-7.3176-2.5723-10.683-0.71867-1.4041-1.2354-2.2344-2.1341-3.429-1.2145-1.6144-2.6835-3.1254-4.1664-4.2854-0.29639-0.23184-0.6016-0.47519-0.67824-0.54078l-0.13934-0.11925 0.16537 0.0432c0.76065 0.19855 4.0873 1.7826 5.6224 2.6773 9.5929 5.5908 16.406 15.071 18.587 25.862 0.50495 2.4991 0.71272 4.3757 0.77261 6.9784 0.0921 4.002-0.40487 7.8136-1.5222 11.675-0.30506 1.0542-0.41709 1.3891-0.46473 1.3891-0.015 0-0.0471-0.11162-0.0713-0.24805z" style="paint-order:stroke markers fill"/>
+<path d="m310.21 124.57c0.25207-1.0861 0.3272-1.54 0.39056-2.3596 0.031-0.40107 0.0312-1.3656 2.7e-4 -1.7902-0.18028-2.4808-1.083-4.8586-2.5836-6.8054-0.69409-0.90045-1.5397-1.7337-2.4555-2.4197-0.64934-0.48637-1.517-1.0115-2.1106-1.2774-0.10611-0.0475-0.19293-0.0939-0.19293-0.10308 0-9e-3 0.071-0.0236 0.15785-0.0321 0.0868-8e-3 0.34202-0.0333 0.56711-0.0552 0.58837-0.0572 2.2681-0.0564 2.8756 1e-3 2.7478 0.26097 5.1244 1.0272 7.4377 2.3979 1.6446 0.97453 3.2181 2.3267 4.481 3.8508 1.6003 1.9313 2.8143 4.3242 3.4243 6.7498 0.10503 0.41761 0.23792 1.0284 0.22628 1.04-4e-3 4e-3 -0.089-0.0597-0.18816-0.14214-2.1246-1.7664-4.9409-2.4066-7.6161-1.7313-0.61577 0.15544-1.1275 0.34641-1.7306 0.64577-0.89179 0.44272-1.6093 0.97031-2.338 1.7191-0.24334 0.25007-0.35439 0.35017-0.34537 0.31133z" style="paint-order:stroke markers fill"/>
+<path d="m339.81 131.23c-0.0173-0.0885-0.0723-0.31078-0.12228-0.49399-0.97095-3.5616-3.5679-6.3888-7.0163-7.6384-1.6805-0.60896-3.5219-0.8085-5.2928-0.57355-0.91498 0.1214-1.9389 0.38896-2.7116 0.70852-0.14083 0.0583-0.25937 0.1026-0.26341 0.0986-4e-3 -4e-3 0.16906-0.13926 0.38468-0.3005 1.686-1.2608 3.5166-2.1218 5.5571-2.6139 2.8298-0.68243 5.836-0.51436 8.5977 0.48066 3.6053 1.299 6.5963 3.9414 8.3236 7.3537 0.21208 0.41894 0.55064 1.167 0.53475 1.1815-4e-3 3e-3 -0.13827-0.0716-0.29905-0.16669-1.288-0.76151-2.8381-0.96143-4.303-0.55499-1.2882 0.35737-2.4683 1.2451-3.1662 2.3816-0.20507 0.33398-0.18686 0.32275-0.2231 0.13749z" style="paint-order:stroke markers fill"/>
+<path d="m401.75 85.402c0-0.0242 0.28083-0.48143 0.42515-0.69221 0.46968-0.68597 1.0124-1.2994 1.6255-1.8375 2.1256-1.8654 4.9219-2.7164 7.7306-2.353 0.14552 0.0188 0.26714 0.0367 0.27025 0.0397 3e-3 3e-3 -0.0441 0.0636-0.10492 0.13481-0.1381 0.16156-0.22546 0.30717-0.28934 0.48219-0.1213 0.33237-0.12886 0.69857-0.021 1.0156 0.0178 0.0523 0.0279 0.0951 0.0225 0.095-5e-3 -3e-5 -0.10285-0.0182-0.21654-0.0405-0.56427-0.11026-1.0453-0.15788-1.7115-0.16942-0.81303-0.0141-1.3986 0.0363-2.1663 0.18631-2.0089 0.39263-3.9134 1.4337-5.3355 2.9166-0.12597 0.13136-0.22904 0.23144-0.22904 0.22241z" style="paint-order:stroke markers fill"/>
+<path d="m401.47 86.508c0.77996-1.052 1.7375-1.9286 2.8162-2.5781 1.0989-0.66171 2.3401-1.1072 3.605-1.2937 0.40781-0.0602 0.73262-0.0857 1.2154-0.0956 0.58527-0.012 1.0474 0.0162 1.6176 0.0987l0.13763 0.0199-0.18724 0.12222c-0.46856 0.30584-0.79584 0.76684-0.93398 1.3156-0.0571 0.22684-0.072 0.6247-0.0321 0.85868 0.0296 0.17334 0.0898 0.37913 0.15245 0.52082 0.0216 0.0489 0.0393 0.0907 0.0393 0.0929 0 2e-3 -0.0702-0.013-0.15591-0.0338-0.54996-0.13296-1.1984-0.23587-1.8367-0.29151-0.33184-0.0289-1.5224-0.0288-1.8438 2e-4 -1.5911 0.14351-2.9872 0.53087-4.3383 1.2036-0.17141 0.0854-0.3149 0.1552-0.31886 0.1552-4e-3 0 0.0245-0.0428 0.0633-0.0951z" style="paint-order:stroke markers fill"/>
+<path d="m408.75 88.056c-1.4177-0.49313-3.0035-0.83075-4.5641-0.9717-0.65485-0.0591-0.99786-0.0736-1.7733-0.0746l-0.76459-1e-3 0.22715-0.11429c1.3302-0.66925 2.6968-1.0506 4.2538-1.187 0.31599-0.0277 1.4045-0.0276 1.7198 7e-5 0.56078 0.0493 1.0927 0.12829 1.5462 0.22963 0.14552 0.0325 0.28659 0.0639 0.31348 0.0698l0.0489 0.0107-0.0991 0.0763c-0.58714 0.45179-0.82154 1.2473-0.57828 1.9626 0.0267 0.0785 0.0336 0.11754 0.0205 0.1164-0.0108-1e-3 -0.16852-0.0535-0.35042-0.11677z" style="paint-order:stroke markers fill"/>
+<path d="m408.49 89.576c-1.159-0.5067-2.8332-1.1231-4.192-1.5434-0.39586-0.12245-1.4292-0.41913-1.7611-0.50564-0.15199-0.0396-0.20044-0.0577-0.16537-0.0617 0.0859-0.01 1.1306 0.0297 1.4654 0.0554 1.778 0.13654 3.5597 0.51997 5.1438 1.107l0.20956 0.0777-0.0938 0.0956c-0.19392 0.19759-0.28307 0.41063-0.29636 0.70818-6e-3 0.12329-0.0146 0.18546-0.0269 0.18434-0.0102-1e-3 -0.13766-0.0538-0.28318-0.11738z" style="paint-order:stroke markers fill"/>
+<path d="m406.38 92.469c-1.6386-1.0642-3.0924-2.3332-4.3611-3.8069-0.24112-0.28007-0.6843-0.83512-0.67457-0.84485 0.0276-0.0276 2.6106 0.9764 3.9397 1.5313 0.88034 0.36754 2.4394 1.0473 2.6514 1.156l0.0552 0.0283-0.0692 0.0207c-0.23845 0.0714-0.53133 0.2537-0.73501 0.45737-0.38084 0.38085-0.57223 0.87508-0.55111 1.4232 4e-3 0.1127 7e-3 0.20463 6e-3 0.20429-8e-4 -2.7e-4 -0.11861-0.0766-0.26162-0.1695z" style="paint-order:stroke markers fill"/>
+<path d="m405.1 95.156c-0.35263-0.2823-0.62333-0.52455-0.9401-0.84132-1.604-1.604-2.6785-3.6427-3.1013-5.8842-0.0257-0.13629-0.0453-0.2492-0.0436-0.25092 2e-3 -2e-3 0.0924 0.10932 0.20144 0.24672 0.80192 1.0102 1.8616 2.0914 2.8952 2.9542 0.66486 0.55498 1.507 1.165 2.2791 1.6508l0.0811 0.051-0.13255 0.0667c-0.25036 0.12588-0.51689 0.35831-0.6881 0.60006-0.10958 0.15472-0.23652 0.42935-0.28683 0.62053-0.0573 0.21775-0.0716 0.58454-0.0318 0.81408 0.0148 0.0854 0.0239 0.15841 0.0201 0.16219-4e-3 4e-3 -0.11745-0.0816-0.25259-0.18983z" style="paint-order:stroke markers fill"/>
+<path d="m403.81 97.574c-2.2738-1.9918-3.5077-4.9583-3.3152-7.9702 0.0186-0.29061 0.0938-0.92784 0.11367-0.96341 8e-3 -0.0135 0.021 0.0255 0.0339 0.0985 0.0341 0.19335 0.17322 0.74165 0.26575 1.0471 0.72468 2.392 2.2587 4.5577 4.264 6.0198l0.15495 0.11298-0.11361 0.0307c-0.15403 0.0416-0.42096 0.17392-0.55184 0.27347-0.22033 0.16761-0.39426 0.38378-0.51287 0.63745-0.0945 0.20222-0.1346 0.3784-0.14659 0.64474l-0.0103 0.22815z" style="paint-order:stroke markers fill"/>
+<path d="m402.69 99.306c-0.87988-0.81294-1.6484-1.8699-2.166-2.9792-0.90566-1.9407-1.1446-4.1233-0.67974-6.2094 0.0551-0.24735 0.19179-0.75798 0.20046-0.74892 3e-3 3e-3 -2e-3 0.0866-0.01 0.18668-0.0197 0.25355-0.0189 1.0597 1e-3 1.3477 0.15438 2.1996 0.96751 4.2171 2.386 5.92 0.25752 0.30915 0.92598 0.97743 1.2396 1.2393l0.24458 0.20419-0.14536 0.0693c-0.3476 0.16571-0.60913 0.46254-0.73195 0.83075-0.028 0.0838-0.0563 0.20455-0.0629 0.26825l-0.012 0.1158z" style="paint-order:stroke markers fill"/>
+<path d="m397.52 103.3c-0.30879-0.47307-0.53704-0.87568-0.76516-1.3497-1.1954-2.4839-1.4432-5.3445-0.69263-7.9953 0.58121-2.0527 1.7305-3.9089 3.2979-5.3263 0.25077-0.22676 0.6689-0.57437 0.6689-0.55607 0 5e-3 -0.0138 0.0375-0.0308 0.0712-0.0556 0.11089-0.22027 0.53599-0.31122 0.8035-0.52965 1.558-0.67439 3.1996-0.4252 4.8224 0.32129 2.0923 1.2916 4.0393 2.7593 5.5368l0.28082 0.28652-0.16493-0.0137c-0.27088-0.0225-0.75554-0.0137-0.96693 0.0176-1.4901 0.22011-2.7054 1.1969-3.2328 2.5982-0.12279 0.32621-0.23638 0.87332-0.24149 1.163-4e-3 0.19918-9e-3 0.19743-0.17568-0.0583z" style="paint-order:stroke markers fill"/>
+<path d="m384.63 113.33c-0.0138-0.0418-0.09-0.26017-0.16921-0.48526-0.55595-1.5798-0.87845-3.1086-1.031-4.8877-0.0408-0.47575-0.0547-1.8958-0.0238-2.4322 0.0543-0.9425 0.15942-1.7864 0.33132-2.6598 0.91413-4.6447 3.4874-8.7395 7.2827-11.589 2.4173-1.8148 5.2425-3.0284 8.2336-3.537 0.26641-0.0453 0.48779-0.079 0.49194-0.0748 4e-3 4e-3 -0.11574 0.10859-0.26645 0.23208-3.3653 2.7574-4.9396 7.1918-4.0748 11.478 0.29579 1.466 0.83513 2.7955 1.6507 4.069 0.11939 0.18644 0.21391 0.34214 0.21003 0.34601-4e-3 4e-3 -0.15302-0.0351-0.33143-0.0866-0.5207-0.15025-0.98671-0.24607-1.5639-0.32156-0.45797-0.0599-1.797-0.0603-2.2451-5.3e-4 -1.1755 0.15647-2.1541 0.44921-3.1385 0.93891-1.0197 0.50723-1.8043 1.0804-2.6148 1.9103-1.5344 1.571-2.4569 3.5787-2.6793 5.8314-0.0152 0.15435-0.0289 0.52005-0.0304 0.81266-2e-3 0.29262-4e-3 0.53203-5e-3 0.53203-1e-3 1e-5 -0.0132-0.0342-0.0271-0.076z" style="paint-order:stroke markers fill"/>
+<path d="m385.18 113.95c-0.0988-0.88467-0.0758-1.7015 0.0726-2.571 0.47231-2.7682 2.1974-5.1663 4.6751-6.499 1.9074-1.0259 4.1077-1.3351 6.2509-0.87833 0.16332 0.0348 0.22 0.0647 0.12278 0.0647-0.0726 0-0.40369 0.0622-0.62301 0.11711-1.814 0.45387-3.2786 1.8239-3.8524 3.6036-0.37585 1.1657-0.35104 2.3967 0.072 3.5705 0.0374 0.10384 0.0662 0.19044 0.0639 0.19245-2e-3 2e-3 -0.0786-0.0256-0.1695-0.0615-0.39419-0.15518-0.86106-0.26915-1.3146-0.32091-0.30442-0.0347-1.0049-0.0253-1.2733 0.0172-0.58106 0.092-1.0295 0.22891-1.5131 0.462-0.81685 0.39375-1.481 0.95837-1.9957 1.6966-0.14661 0.21029-0.2455 0.37786-0.37755 0.63971l-0.11001 0.21814z" style="paint-order:stroke markers fill"/>
+<path d="m392.22 110.82c-0.1432-0.51676-0.18995-0.903-0.17776-1.4686 0.01-0.45912 0.041-0.70019 0.14229-1.102 0.2395-0.95034 0.78175-1.8481 1.5058-2.4931 0.85664-0.76306 1.8924-1.1902 3.0766-1.2686l0.1569-0.0104-0.14863 0.093c-0.0817 0.0512-0.20427 0.13529-0.27227 0.18693-0.16335 0.12405-0.45859 0.40976-0.58378 0.56492-0.65764 0.81511-0.91135 1.871-0.69634 2.8981 0.0468 0.22335 0.14549 0.52116 0.2394 0.7221 0.0357 0.0765 0.0619 0.14207 0.0582 0.14578-4e-3 4e-3 -0.0379-2e-3 -0.076-0.0119-0.44599-0.12009-1.0068-0.0978-1.4657 0.0584-0.3815 0.1298-0.69051 0.3252-0.9907 0.62646-0.31816 0.31929-0.50957 0.62841-0.63568 1.0266-0.0288 0.0909-0.058 0.1799-0.0649 0.19765-9e-3 0.0236-0.0274-0.0212-0.0673-0.16536z" style="paint-order:stroke markers fill"/>
+<path d="m395.8 108.54c-5e-3 -0.0126-0.0152-0.0405-0.0238-0.062-0.0297-0.074-0.0972-0.33525-0.11989-0.46368-0.0885-0.50131-0.0464-1.0211 0.12169-1.502 0.21657-0.61969 0.63056-1.1486 1.1842-1.513 0.11939-0.0786 0.31625-0.18885 0.32374-0.18135 2e-3 2e-3 -0.0335 0.0807-0.0797 0.17394-0.29167 0.58776-0.36233 1.2507-0.20068 1.8831 0.0378 0.14795 0.10261 0.33327 0.15817 0.45235l0.045 0.0965h-0.0503c-0.0799 0-0.24885 0.0332-0.3619 0.071-0.3088 0.10346-0.59602 0.32258-0.77289 0.58962-0.0826 0.12472-0.12766 0.21708-0.17555 0.35982-0.0294 0.0875-0.042 0.11265-0.048 0.0957z" style="paint-order:stroke markers fill"/>
+<path d="m397.52 107c-0.1-0.2761-0.13039-0.43807-0.13813-0.73583-4e-3 -0.17052-1e-3 -0.2536 0.0136-0.35664 0.0372-0.25725 0.10376-0.47392 0.21541-0.7014l0.066-0.13442 8e-3 0.0701c4e-3 0.0386 0.0138 0.12273 0.0209 0.18704 0.0353 0.3201 0.13422 0.64725 0.28984 0.95883 0.0651 0.13027 0.10397 0.19723 0.19783 0.34053 0.0157 0.024 0.0131 0.0258-0.0812 0.0552-0.22296 0.0695-0.36548 0.17502-0.53577 0.39658-0.0179 0.0233-0.0201 0.0203-0.0564-0.08z" style="paint-order:stroke markers fill"/>
+<path d="m399.01 105.93c-0.0891-0.10321-0.18305-0.2273-0.26284-0.34713-0.0475-0.0714-0.11519-0.18061-0.11971-0.19324-1e-3 -3e-3 0.0282 0.0241 0.065 0.0603 0.12962 0.12744 0.24777 0.239 0.38229 0.36097 0.0319 0.0289 0.0592 0.0531 0.0606 0.0536 1e-3 5.3e-4 -9e-3 0.0137-0.0239 0.0292-0.0146 0.0155-0.0346 0.0391-0.0445 0.0524-0.01 0.0133-0.0189 0.0241-0.0201 0.0241-1e-3 0-0.0178-0.0181-0.0369-0.0402z" style="paint-order:stroke markers fill"/>
+<path d="m399.37 105.47c-0.12165-0.11034-0.35597-0.33215-0.35371-0.33481 7.9e-4 -8e-4 0.0985 0.0599 0.16807 0.10461 0.10686 0.0687 0.30987 0.20647 0.30987 0.21036 0 1e-3 -3e-3 5e-3 -8e-3 9e-3 -6e-3 6e-3 -0.0264 0.0301-0.0549 0.066-1.9e-4 2.4e-4 -0.028-0.0246-0.0617-0.0553z" style="paint-order:stroke markers fill"/>
+<path d="m399.96 104.89c-0.0845-0.0544-0.17399-0.10846-0.263-0.15884-0.0404-0.0228-0.041-0.0233-0.0398-0.0233 2e-3 -2e-5 0.0737 0.0286 0.1096 0.0439 0.0809 0.0347 0.17048 0.0778 0.24405 0.11748l6e-3 3e-3 -6e-3 8e-3c-3e-3 5e-3 -9e-3 0.0129-0.0131 0.0186l-7e-3 0.0104z" style="paint-order:stroke markers fill"/>
+<path d="m400.14 104.43c-6e-3 -3e-3 -0.0293-0.0144-0.0509-0.0247-0.24207-0.11629-0.49224-0.20289-0.7523-0.2604-0.12259-0.0271-0.24271-0.0469-0.36979-0.0607-0.0221-2e-3 -0.046-5e-3 -0.0532-5e-3 -0.0166-1e-3 -0.0167-1e-3 0.0315-0.0165 0.19514-0.0619 0.38384-0.0956 0.58885-0.10534 0.0405-2e-3 0.15682-2e-3 0.19732 0 0.19905 9e-3 0.38434 0.0418 0.57311 0.10019l0.0228 7e-3 -0.0127 0.0154c-0.0795 0.0967-0.13293 0.20833-0.15713 0.32864-3e-3 0.0142-5e-3 0.0263-6e-3 0.0268-1.8e-4 5.3e-4 -6e-3 -2e-3 -0.012-5e-3z" style="paint-order:stroke markers fill"/>
+<path d="m398.46 103.75c0.0292-0.0553 0.11748-0.19026 0.1703-0.26059 0.12403-0.16514 0.26876-0.31589 0.42475-0.44245 0.14372-0.1166 0.32122-0.22936 0.48327-0.30701 0.28722-0.13762 0.58092-0.21571 0.90621-0.24096 0.0636-5e-3 0.27874-5e-3 0.34057 4e-5 0.0851 7e-3 0.19895 0.0207 0.24659 0.0302l0.0157 3e-3 -0.0162 0.01c-0.12085 0.0728-0.24275 0.18333-0.3286 0.29795-0.11181 0.14929-0.18726 0.32409-0.21855 0.50636-0.0113 0.0655-0.0137 0.0952-0.0152 0.18686l-2e-3 0.0938-0.0515-0.0158c-0.10196-0.0313-0.24033-0.0638-0.3468-0.0813-0.24577-0.0405-0.50712-0.0471-0.75258-0.0188-0.27831 0.0321-0.55151 0.10734-0.80531 0.22184-0.0288 0.013-0.0529 0.0237-0.0534 0.0237-5.3e-4 0 5.3e-4 -3e-3 2e-3 -7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m398.19 103.04c0.0125-0.0929 0.0498-0.26609 0.0846-0.39287 0.26007-0.94833 0.9068-1.7529 1.7804-2.2149 0.44049-0.23296 0.90874-0.366 1.4317-0.40676 0.10432-8e-3 0.39822-7e-3 0.50643 2e-3 0.19431 0.0163 0.50995 0.0656 0.5056 0.079-7.9e-4 2e-3 -0.0254 0.02-0.055 0.0399-0.27583 0.18499-0.47939 0.46541-0.5719 0.78785-0.0193 0.0673-0.0343 0.13926-0.0446 0.21424-0.0106 0.0769-0.0106 0.27541-7e-5 0.3514 8e-3 0.0555 0.0232 0.13666 0.0333 0.17467 3e-3 0.0119 4e-3 0.0217 3e-3 0.0217-2e-3 0-0.0234-6e-3 -0.0482-0.0142-0.55822-0.17525-1.144-0.19241-1.709-0.0501-0.4774 0.12029-0.90968 0.3467-1.29 0.67563-0.0734 0.0635-0.22574 0.21508-0.28917 0.28777-0.10469 0.11996-0.20162 0.24891-0.28482 0.3789-0.0602 0.0941-0.055 0.0875-0.052 0.0655z" style="paint-order:stroke markers fill"/>
+<path d="m385.66 114.34c0-8e-3 0.11229-0.23238 0.15505-0.31033 0.32108-0.58525 0.76371-1.0967 1.2949-1.4962 0.63366-0.47656 1.3677-0.78094 2.158-0.8949 0.23835-0.0344 0.33561-0.0405 0.64536-0.0408 0.29226-2.7e-4 0.34754 2e-3 0.55542 0.0263 0.32721 0.0378 0.66884 0.11574 0.97929 0.22344 0.12341 0.0428 0.29816 0.11072 0.29817 0.11587 0 2e-3 -0.0112 7e-3 -0.0249 0.0108-0.0137 4e-3 -0.0617 0.0219-0.1067 0.0396-0.48121 0.1899-0.87141 0.55323-1.0963 1.0208-0.10094 0.20986-0.16066 0.41608-0.19076 0.65879-0.0166 0.13397-0.0126 0.41769 7e-3 0.51607 3e-3 0.0159 2e-3 0.0155-0.0524-0.0189-0.49673-0.31294-1.0793-0.51997-1.6787-0.5966-0.23293-0.0298-0.57053-0.04-0.78929-0.0239-0.74706 0.055-1.4372 0.28996-2.0335 0.69214-0.12361 0.0834-0.12096 0.0817-0.12096 0.0777z" style="paint-order:stroke markers fill"/>
+<path d="m389.73 115.25c-0.0138-0.0166-0.21304-0.16422-0.3019-0.22364-0.3512-0.23489-0.7272-0.41089-1.1334-0.53052-0.4168-0.12276-0.88463-0.18054-1.3106-0.16185-0.15654 7e-3 -0.31896 0.0214-0.43397 0.0389-0.0334 5e-3 -0.0618 8e-3 -0.063 7e-3 -3e-3 -3e-3 0.16349-0.0764 0.2582-0.11339 0.82412-0.32177 1.7531-0.33368 2.5828-0.0331 0.30165 0.10927 0.59603 0.26018 0.84504 0.43321l0.0544 0.0378-0.0433 0.0217c-0.10956 0.055-0.23028 0.15684-0.30552 0.25765-0.043 0.0577-0.0932 0.15096-0.11948 0.22221-0.0101 0.0272-0.019 0.0503-0.02 0.0513s-5e-3 -2e-3 -9e-3 -7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m388.03 116.3c-0.56558-0.50086-1.2525-0.9072-1.9703-1.1655-0.0514-0.0185-0.0955-0.0354-0.098-0.0376-0.0114-0.01 0.2908-0.0577 0.46969-0.0742 0.15404-0.0142 0.47723-0.0142 0.63099-1e-5 0.63656 0.0587 1.2148 0.25887 1.7381 0.60172 0.054 0.0354 0.0974 0.065 0.0964 0.066s-0.0375 0.0135-0.0813 0.0279c-0.23352 0.0768-0.42051 0.21778-0.556 0.41907-0.0441 0.0655-0.088 0.15003-0.1105 0.2129-8e-3 0.0212-0.0152 0.0384-0.0168 0.0382-2e-3 -2e-4 -0.0477-0.04-0.10237-0.0884z" style="paint-order:stroke markers fill"/>
+<path d="m387.38 117.08c-0.38428-0.45212-0.75432-0.85531-1.1831-1.2891-0.10257-0.10375-0.18385-0.18864-0.18063-0.18864 3e-3 0 0.0437 0.0155 0.09 0.0344 0.36596 0.14946 0.70377 0.32841 1.0267 0.54386 0.23725 0.1583 0.4407 0.31748 0.68275 0.53416l0.0291 0.0261-0.0321 0.0162c-0.0897 0.0452-0.20085 0.13813-0.26505 0.2215-0.0448 0.0581-0.0528 0.0705-0.083 0.1279l-0.0238 0.0453z" style="paint-order:stroke markers fill"/>
+<path d="m386.9 117.6c-0.20577-0.28908-0.39807-0.57556-0.58523-0.87186-0.11305-0.17898-0.25146-0.40584-0.24906-0.40824 1e-3 -1e-3 0.13179 0.13423 0.22436 0.23289 0.23444 0.24989 0.47063 0.51366 0.68578 0.76586 0.15883 0.18616 0.19932 0.23528 0.19587 0.23759-2e-3 1e-3 -0.0187 0.0109-0.0375 0.0215-0.0449 0.0253-0.0905 0.0598-0.12783 0.0968-0.0167 0.0165-0.0307 0.03-0.0312 0.03-5.3e-4 0-0.0343-0.047-0.0753-0.10451z" style="paint-order:stroke markers fill"/>
+<path d="m385.74 118.39c-0.0629-0.12019-0.14518-0.30719-0.20412-0.46371-0.17657-0.46887-0.27509-0.9532-0.29728-1.4614-3e-3 -0.0659-5e-3 -0.25442-3e-3 -0.26957l2e-3 -0.0122 0.0357 0.0949c0.0959 0.2553 0.19257 0.48333 0.31443 0.74189 0.0316 0.0671 0.14574 0.29474 0.18264 0.36433 0.12915 0.24357 0.26885 0.48282 0.41117 0.70416 0.016 0.0249 0.0286 0.0461 0.0281 0.047-5.3e-4 1e-3 -3e-3 2e-3 -5e-3 2e-3 -7e-3 0-0.0549 0.0126-0.0837 0.022-0.10009 0.0326-0.19177 0.084-0.27014 0.15148-0.0295 0.0254-0.0699 0.067-0.0973 0.1001-7.9e-4 1e-3 -7e-3 -8e-3 -0.0131-0.0207z" style="paint-order:stroke markers fill"/>
+<path d="m384.64 119.02c-0.10522-0.27451-0.18071-0.58222-0.2164-0.88209-0.0303-0.25447-0.0329-0.53473-7e-3 -0.7922 0.0422-0.42682 0.1583-0.84247 0.34382-1.2313 0.014-0.0294 0.0269-0.0556 0.0286-0.0582 2e-3 -3e-3 3e-3 0.0561 3e-3 0.20901 0 0.21796 1e-3 0.26026 0.0133 0.41252 0.0516 0.65838 0.22685 1.2919 0.52225 1.8878 0.0249 0.0502 0.0375 0.0787 0.0352 0.0793-2e-3 5.3e-4 -0.0192 3e-3 -0.0383 6e-3 -0.11048 0.0151-0.22737 0.0552-0.32785 0.11238-0.0723 0.0412-0.13162 0.0869-0.19608 0.15108-0.0517 0.0515-0.0837 0.0895-0.11567 0.13722-0.0102 0.0153-0.0193 0.0278-0.0203 0.0279-8e-4 5e-5 -0.0119-0.0265-0.0244-0.0591z" style="paint-order:stroke markers fill"/>
+<path d="m383.74 119.77c-0.11419-0.29235-0.19331-0.61683-0.22725-0.932-0.0165-0.15278-0.019-0.20589-0.019-0.39274 5e-5 -0.18643 3e-3 -0.24139 0.0189-0.39274 0.0586-0.54566 0.24273-1.0758 0.53751-1.5475 0.0474-0.0758 0.12817-0.19391 0.13082-0.19126 1e-3 1e-3 -0.0106 0.0386-0.0258 0.0837-0.0972 0.28933-0.16318 0.59744-0.19417 0.90672-0.0145 0.14486-0.0167 0.19969-0.0167 0.40928 0 0.21597 2e-3 0.25902 0.0188 0.42581 0.0459 0.45243 0.16967 0.90151 0.36486 1.3234l0.0146 0.0315-0.027 3e-3c-0.0148 2e-3 -0.0514 9e-3 -0.0813 0.0168-0.17654 0.0454-0.32912 0.1446-0.44182 0.2871-0.0137 0.0173-0.0254 0.032-0.026 0.0327-5.3e-4 7.9e-4 -0.0126-0.0279-0.0265-0.0636z" style="paint-order:stroke markers fill"/>
+<path d="m378.29 120.57c2e-3 -0.0113 7e-3 -0.0558 9e-3 -0.099 0.0211-0.32758 0.0962-0.74745 0.19788-1.107 0.50646-1.7908 1.8628-3.2248 3.622-3.8295 0.67235-0.23109 1.3849-0.33586 2.0793-0.3057 0.12044 5e-3 0.2209 0.0115 0.22324 0.014 2e-3 2e-3 -5e-3 0.0106-0.0162 0.018-0.1412 0.0936-0.36182 0.26876-0.50916 0.40435-0.88448 0.81395-1.3795 1.9814-1.3488 3.1811 0.01 0.37232 0.0641 0.73659 0.15958 1.0641 3e-3 9e-3 -0.0342-9e-3 -0.10588-0.052-0.41003-0.2464-0.84981-0.39675-1.342-0.45876-0.13813-0.0174-0.49311-0.0245-0.63666-0.0126-0.90976 0.0748-1.7042 0.47611-2.3013 1.1624-0.0292 0.0336-0.035 0.0374-0.0315 0.0206z" style="paint-order:stroke markers fill"/>
+<path d="m381.71 121.1c-0.4474-0.37306-1.0052-0.60491-1.585-0.65884-0.38822-0.0361-0.77263 5e-3 -1.151 0.12416-0.0248 8e-3 -0.0458 0.0135-0.0467 0.0126-4e-3 -4e-3 0.13992-0.1226 0.22347-0.18384 0.39554-0.28992 0.85771-0.47515 1.3422-0.5379 0.13614-0.0176 0.21179-0.0222 0.36794-0.0225 0.22421-2.7e-4 0.38642 0.0159 0.59944 0.06 0.37549 0.0777 0.74703 0.23828 1.064 0.45972l0.0656 0.0458-0.0408 9e-3c-0.0588 0.0127-0.11256 0.0289-0.16686 0.0503-0.28836 0.11376-0.51785 0.355-0.61366 0.64508-6e-3 0.0188-0.0117 0.0341-0.0124 0.0341-5.3e-4 0-0.0214-0.0169-0.0462-0.0376z" style="paint-order:stroke markers fill"/>
+<path d="m381.38 121.64c-0.0323-0.0341-0.10754-0.10532-0.15733-0.1489-0.30348-0.2656-0.65982-0.46361-1.0464-0.58146-0.0145-4e-3 -0.0255-8e-3 -0.0245-8e-3 1e-3 -4e-5 0.0188 2e-3 0.0395 5e-3 0.38732 0.0533 0.74894 0.19499 1.0717 0.4199 0.0842 0.0587 0.19706 0.14979 0.25915 0.20925l0.01 9e-3 -0.0224 0.0149c-0.0313 0.0208-0.0576 0.0423-0.0876 0.0718l-0.0258 0.0253z" style="paint-order:stroke markers fill"/>
+<path d="m380.44 122.06c-0.12874-0.12924-0.26406-0.24419-0.4129-0.35075-0.0355-0.0254-0.12451-0.0848-0.16224-0.10826-0.18637-0.11584-0.37472-0.20865-0.57627-0.28398-0.059-0.022-0.11153-0.0399-0.18816-0.0639l-0.0175-5e-3 9e-3 -1e-3c0.0805-9e-3 0.17164-0.0136 0.28044-0.0126 0.0811 7.9e-4 0.11535 2e-3 0.17851 8e-3 0.44496 0.0382 0.87203 0.20111 1.2292 0.46887 0.0296 0.0222 0.0847 0.0657 0.0861 0.068 5.3e-4 8e-4 -2e-3 2e-3 -5e-3 3e-3 -0.011 3e-3 -0.0466 0.0177-0.0675 0.0275-0.0821 0.0382-0.15294 0.088-0.21783 0.153-0.0371 0.0372-0.0685 0.0752-0.095 0.1152-5e-3 7e-3 -9e-3 0.0128-9e-3 0.0128-5.3e-4 0-0.0144-0.0135-0.0308-0.0301z" style="paint-order:stroke markers fill"/>
+<path d="m379.88 122.51c-0.10805-0.13671-0.22479-0.26789-0.35705-0.40122-0.13331-0.13438-0.26293-0.25182-0.40028-0.36267-9e-3 -8e-3 -0.0166-0.014-0.0159-0.0143 8e-4 -2.3e-4 0.015 5e-3 0.0319 0.0111 0.0908 0.0343 0.16722 0.0675 0.25423 0.11063 0.25663 0.12713 0.49053 0.29265 0.69646 0.49284l0.027 0.0263-9e-3 5e-3c-0.0658 0.0331-0.13645 0.088-0.18534 0.14399-8e-3 0.01-0.0157 0.018-0.0162 0.0185-5.3e-4 5.3e-4 -0.0119-0.013-0.0253-0.03z" style="paint-order:stroke markers fill"/>
+<path d="m378.72 123.11c-0.0973-0.23358-0.17485-0.45828-0.23931-0.6936-0.0252-0.0919-0.0645-0.25071-0.0626-0.25264 2e-3 -2e-3 0.15326 0.20872 0.23661 0.32768 0.11475 0.16377 0.26685 0.38986 0.3552 0.52796l7e-3 0.0114-9e-3 2e-3c-0.0924 0.0235-0.18224 0.067-0.25001 0.12123-8e-3 6e-3 -0.0142 0.0111-0.0146 0.0111-5.3e-4 0-0.0111-0.0249-0.0238-0.0553z" style="paint-order:stroke markers fill"/>
+<path d="m378.09 123.55c-0.0683-0.23563-0.10555-0.46494-0.11504-0.70852-2e-3 -0.0489-2e-3 -0.16598 0-0.21486 2e-3 -0.0641 7e-3 -0.12608 0.0132-0.18855 3e-3 -0.0301 0.0106-0.0929 0.011-0.0924 1.5e-4 1.8e-4 6e-3 0.0243 0.0135 0.0537 0.083 0.3342 0.20105 0.67951 0.33812 0.98934 5e-3 0.0107 8e-3 0.0197 8e-3 0.0199-2.3e-4 2e-4 -0.0106 4e-3 -0.0231 7e-3 -0.0403 0.0122-0.0978 0.0368-0.13193 0.0565-0.0314 0.0181-0.0618 0.0388-0.0885 0.0604-0.0275 0.0222-0.0246 0.0203-0.0255 0.0173z" style="paint-order:stroke markers fill"/>
+<path d="m377.49 123.94c-7e-3 -0.0261-0.0197-0.0811-0.0278-0.12069-0.0275-0.13468-0.0427-0.25989-0.0485-0.39975-2e-3 -0.0468-1e-3 -0.18046 2e-3 -0.22217 0.0124-0.2051 0.0435-0.3826 0.10088-0.57588 5.3e-4 -2e-3 7.9e-4 0.0325 2.6e-4 0.0767-3e-3 0.35559 0.0467 0.69558 0.15117 1.0319 0.0103 0.033 0.0312 0.0963 0.0393 0.11847l5e-3 0.0137-8e-3 2e-3c-0.0684 0.0138-0.14167 0.0434-0.20075 0.0812l-0.01 6e-3z" style="paint-order:stroke markers fill"/>
+<path d="m377.05 124.27c-1e-3 -4e-3 -0.0141-0.0528-0.0197-0.0757-0.0576-0.23606-0.0787-0.47597-0.0633-0.72036 2e-3 -0.0251 2e-3 -0.0228 4e-3 0.0222 0.0128 0.23797 0.059 0.48479 0.13533 0.72243 4e-3 0.0134 8e-3 0.0248 8e-3 0.0253-1e-5 5.3e-4 -5e-3 3e-3 -0.0111 5e-3 -0.0102 4e-3 -0.0322 0.0129-0.047 0.0196-4e-3 2e-3 -6e-3 2e-3 -6e-3 1e-3z" style="paint-order:stroke markers fill"/>
+<path d="m375.43 124.29c2e-3 -0.16534 7e-3 -0.23306 0.0261-0.36691 0.0963-0.6756 0.44792-1.2987 0.97816-1.7332 0.15226-0.12479 0.31078-0.22843 0.48915-0.31982 0.10902-0.0559 0.28845-0.13416 0.29422-0.1284 7.9e-4 8e-4 -0.0134 0.019-0.0318 0.0404-0.31607 0.3679-0.54252 0.84696-0.63004 1.3328-0.0509 0.28275-0.0589 0.58566-0.0228 0.8661 8e-3 0.0603 0.0269 0.17988 0.0312 0.19495 2e-3 6e-3 -3e-3 6e-3 -0.0364-3e-3 -0.0211-6e-3 -0.065-0.0147-0.0975-0.0203-0.34089-0.0584-0.68895 0.0368-0.95628 0.26162-0.0223 0.0188-0.0418 0.0341-0.0433 0.0341-2e-3 0-2e-3 -0.0712-5.3e-4 -0.15813z" style="paint-order:stroke markers fill"/>
+<path d="m371.55 125.31c0.0873-1.4017 0.8282-2.6857 1.995-3.4574 0.59996-0.39678 1.2752-0.64245 1.9777-0.71951 0.16972-0.0186 0.21701-0.0214 0.41802-0.0249 0.41435-7e-3 0.7444 0.0295 1.1518 0.12759 0.0547 0.0132 0.10145 0.0258 0.10397 0.0281 3e-3 2e-3 -7e-3 7e-3 -0.0205 0.0116-0.0138 4e-3 -0.0632 0.0213-0.10981 0.0383-0.62378 0.22717-1.1708 0.65426-1.5428 1.2045-0.25008 0.36994-0.41188 0.75922-0.49696 1.1956-0.0415 0.21294-0.0559 0.37485-0.0557 0.62607l2e-4 0.20219-0.0588-0.035c-0.28081-0.16726-0.60783-0.27757-0.9592-0.32355-0.118-0.0155-0.46174-0.0155-0.57588-5e-5 -0.31118 0.0421-0.56259 0.11829-0.82143 0.24907-0.39176 0.19793-0.71048 0.48387-0.95631 0.85794l-0.0531 0.0809z" style="paint-order:stroke markers fill"/>
+<path d="m362.48 127.6c-2e-3 -0.0471 0.0569-0.58415 0.0834-0.76605 0.40103-2.7521 2.0796-5.2164 4.4948-6.5988 1.1585-0.66308 2.3915-1.0524 3.7559-1.186 0.29641-0.029 1.342-0.0293 1.6206-2.7e-4 1.414 0.14658 2.6334 0.5379 3.8116 1.2232 0.20872 0.12139 0.68908 0.4365 0.67971 0.44587-3e-3 4e-3 -0.0908-6e-3 -0.19416-0.02-1.2085-0.16902-2.4235 0.10096-3.4208 0.76007-0.29436 0.19455-0.52055 0.37939-0.77879 0.63641-0.39114 0.3893-0.69069 0.80629-0.93287 1.2986-0.34118 0.6936-0.50366 1.3686-0.50987 2.1182l-3e-3 0.31577-0.14056-0.13179c-0.83164-0.77976-1.7702-1.2346-2.8985-1.4045-0.19456-0.0293-0.31374-0.0356-0.68994-0.0366-0.44898-1e-3 -0.57771 8e-3 -0.90951 0.0673-0.98286 0.17471-1.8797 0.61811-2.6293 1.2999-0.51869 0.4718-0.99866 1.1582-1.2657 1.81-0.0402 0.0981-0.0732 0.17401-0.0734 0.16865z" style="paint-order:stroke markers fill"/>
+<path d="m356 129.53c0.0372-0.76145 0.0933-1.2688 0.20855-1.8852 0.54327-2.9056 2.1029-5.5365 4.3991-7.4205 1.0895-0.89396 2.3559-1.6114 3.7095-2.1015 0.94157-0.34092 1.9714-0.57538 2.9848-0.6796 0.8678-0.0892 1.9478-0.0767 2.8277 0.0327 1.6262 0.20224 3.2111 0.72901 4.6603 1.5488 0.11204 0.0634 0.20065 0.11832 0.19689 0.12207-4e-3 4e-3 -0.1624-0.0446-0.35254-0.1075-0.65938-0.21806-1.3106-0.35759-2.0572-0.44082-0.32734-0.0365-1.2541-0.0509-1.607-0.025-1.04 0.0764-1.9683 0.28589-2.8992 0.65429-0.97237 0.38482-1.8286 0.89598-2.6624 1.5894-0.26157 0.21754-0.86769 0.81816-1.0993 1.0893-0.51271 0.60023-0.94427 1.254-1.3045 1.9761-0.57926 1.1612-0.90744 2.3813-0.99411 3.6959-0.0287 0.43589-0.0155 1.2126 0.0258 1.513l0.0102 0.0743-0.15457-0.14947c-0.69436-0.67138-1.6488-1.0515-2.6433-1.0528-0.62376-8e-4 -1.1616 0.12217-1.7115 0.39124-0.61733 0.30204-1.1002 0.72077-1.5172 1.3158-0.028 0.04-0.0286 0.0359-0.02-0.14069z" style="paint-order:stroke markers fill"/>
+<path d="m355.33 129.77c-0.65583-0.63794-1.4255-1.0624-2.3151-1.2766-0.61242-0.14751-1.3303-0.17124-1.9596-0.0648-0.8371 0.14165-1.6389 0.50037-2.2826 1.0212-0.0578 0.0468-0.10673 0.0835-0.10865 0.0815-2e-3 -2e-3 0.0215-0.14874 0.0519-0.32609 0.49203-2.8633 1.738-5.5654 3.5953-7.7969 0.61451-0.73832 1.3594-1.486 2.0983-2.1062 2.0001-1.6788 4.3955-2.8699 6.9526-3.4572 0.78717-0.18077 1.5567-0.29816 2.451-0.37387 0.42589-0.0361 1.6142-0.0508 2.0763-0.0258 2.2892 0.12403 4.4373 0.67932 6.4772 1.6744l0.30179 0.14722v0.29229l-0.26872-0.0815c-2.2821-0.69232-4.6626-0.75558-6.966-0.18512-2.7635 0.68443-5.2401 2.2683-7.0304 4.4962-1.3052 1.6241-2.2101 3.5699-2.6188 5.6307-0.14871 0.74986-0.23178 1.537-0.25244 2.3922l-4e-3 0.15154z" style="paint-order:stroke markers fill"/>
+<path d="m349.62 124.74c0-0.062 0.29426-0.87278 0.51756-1.426 1.3342-3.3053 3.4915-6.2663 6.2361-8.5593 1.9567-1.6348 4.198-2.9206 6.5998-3.7864 2.3813-0.85842 4.8719-1.2938 7.4017-1.2938 4.9882 0 9.8174 1.7078 13.716 4.8506l0.29233 0.23565-0.54957 0.0153c-0.39315 0.011-0.63232 0.0295-0.84029 0.065-1.3277 0.22681-2.4282 0.79231-3.3703 1.7319-0.86547 0.86315-1.4402 1.9316-1.6814 3.1255-0.0491 0.24339-0.11822 0.77815-0.11822 0.91537v0.077l-0.14558-0.15871c-1.7934-1.9552-3.9322-3.4246-6.3953-4.3939-2.1582-0.84926-4.5793-1.2589-6.8516-1.1594-1.5059 0.066-2.6956 0.25558-4.0716 0.64886-2.3609 0.67477-4.4898 1.8217-6.4131 3.4549-0.47053 0.39959-1.4244 1.3536-1.8249 1.8253-0.92328 1.0872-1.6301 2.1454-2.2713 3.4005-0.1266 0.24779-0.23017 0.44199-0.23017 0.43155z" style="paint-order:stroke markers fill"/>
+<path d="m352.77 131.82c-0.20661-0.39468-0.46131-0.72973-0.78217-1.0289-0.42432-0.39564-0.95205-0.69394-1.5143-0.85595-0.27838-0.0802-0.56312-0.12723-0.86403-0.14266-0.11375-6e-3 -0.3566-2e-3 -0.46068 6e-3 -0.0408 3e-3 -0.0746 6e-3 -0.0751 5e-3 -5.3e-4 -5.3e-4 0.0245-0.0207 0.0555-0.0447 0.39556-0.30671 0.85028-0.54911 1.3298-0.70885 0.30287-0.1009 0.6158-0.1688 0.94052-0.20407 0.1663-0.0181 0.26214-0.0227 0.46922-0.0229 0.19393-1.1e-4 0.26124 3e-3 0.41341 0.0166 0.98469 0.0905 1.9085 0.50233 2.6376 1.1758 0.0689 0.0636 0.21755 0.21334 0.27031 0.2722l0.0305 0.0341-0.0801-3e-3c-0.0441-1e-3 -0.0824-3e-3 -0.0851-4e-3 -0.0122-4e-3 -0.22165 7e-3 -0.29066 0.0147-0.87796 0.0994-1.6208 0.67008-1.9389 1.4896l-0.0238 0.0613z" style="paint-order:stroke markers fill"/>
+<path d="m351.61 132.38c-0.0787-0.21244-0.18608-0.43577-0.30254-0.62923-0.10624-0.17649-0.24459-0.36657-0.37874-0.52034-0.12478-0.14304-0.27994-0.29503-0.42238-0.41375-0.2756-0.22971-0.57826-0.41602-0.90768-0.55873-0.0366-0.0159-0.0384-0.017-0.0248-0.0157 8e-3 8e-4 0.0311 2e-3 0.0512 3e-3 0.13408 6e-3 0.34228 0.034 0.49125 0.0659 0.62895 0.13457 1.198 0.44354 1.65 0.89592 0.25376 0.25394 0.45768 0.53669 0.61739 0.85604 0.0307 0.0613 0.071 0.14665 0.071 0.15014 0 7.9e-4 -2e-3 7.9e-4 -4e-3 -2.6e-4 -0.01-4e-3 -0.0651-0.0137-0.0989-0.018-0.25168-0.0314-0.51462 0.047-0.70401 0.20977-0.0108 9e-3 -0.0201 0.0168-0.0207 0.0168-5.3e-4 0-8e-3 -0.0187-0.0166-0.0417z" style="paint-order:stroke markers fill"/>
+<path d="m351.08 132.67c-0.12507-0.4435-0.34373-0.88866-0.61871-1.2596-0.0433-0.0584-0.04-0.0565 0.0277 0.0153 0.32348 0.34341 0.5624 0.73754 0.71585 1.1809 0.0142 0.0411 0.0191 0.0588 0.0168 0.0603-2e-3 1e-3 -0.0115 3e-3 -0.0213 4e-3 -0.0234 3e-3 -0.0629 0.0114-0.0904 0.0201l-0.0219 7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m350.03 132.67c-5.3e-4 -1e-3 -7e-3 -0.0245-0.0135-0.0512-0.13056-0.50283-0.33837-0.9965-0.60796-1.4442-0.0622-0.10323-0.14439-0.23012-0.20402-0.31482-0.0124-0.0176-0.0223-0.0324-0.0219-0.0328 1e-3 -1e-3 0.0871 0.0566 0.13592 0.0916 0.5471 0.39174 0.96631 0.92722 1.2139 1.5505 0.0184 0.0463 0.0403 0.10483 0.0395 0.1056-2.4e-4 2.3e-4 -0.0124-1e-3 -0.0269-3e-3 -0.13992-0.0204-0.28477-2e-3 -0.41773 0.0541-0.0275 0.0115-0.0593 0.0271-0.0801 0.0392-0.0153 9e-3 -0.0159 9e-3 -0.0172 5e-3z" style="paint-order:stroke markers fill"/>
+<path d="m349.2 132.82c-5.3e-4 -1e-3 -2e-3 -0.0105-3e-3 -0.0202-1e-3 -0.01-9e-3 -0.0599-0.0168-0.11162-0.0746-0.48357-0.17497-0.97545-0.29727-1.4562-0.0113-0.0443-0.0202-0.0808-0.0199-0.0812 8e-4 -8e-4 0.0612 0.0899 0.0874 0.13075 0.26432 0.41319 0.46513 0.85719 0.60112 1.3291 0.01 0.033 0.0216 0.0766 0.0269 0.097 5e-3 0.0204 0.01 0.0381 0.0105 0.0393 5.3e-4 2e-3 -5e-3 2e-3 -0.0193 5.3e-4 -0.0273-2e-3 -0.10111-2.7e-4 -0.13268 4e-3 -0.0751 0.01-0.15656 0.0331-0.21589 0.0623-0.0207 0.0102-0.0198 0.01-0.0209 6e-3z" style="paint-order:stroke markers fill"/>
+<path d="m348.71 133.03c-5.3e-4 -3e-3 -1e-3 -0.0133-2e-3 -0.0238-7.9e-4 -0.0104-4e-3 -0.0512-7e-3 -0.0906-0.0179-0.22023-0.0462-0.60844-0.045-0.61671 1e-3 -8e-3 0.0489 0.26626 0.0741 0.42596 0.0148 0.094 0.044 0.29308 0.044 0.30012 0 1e-3 -5e-3 2e-3 -0.0186 4e-3 -0.0102 1e-3 -0.0239 3e-3 -0.0303 4e-3 -6e-3 1e-3 -0.0121 2e-3 -0.0127 2e-3 -5.3e-4 0-1e-3 -2e-3 -2e-3 -5e-3z" style="paint-order:stroke markers fill"/>
+<path d="m346.19 132.89c0-6e-3 0.0207-0.097 0.0337-0.14897 0.0816-0.32565 0.21748-0.6462 0.39661-0.93544 0.23104-0.37306 0.54375-0.70431 0.9056-0.95932 0.0491-0.0346 0.0927-0.0638 0.0952-0.0638 1e-3 0-2e-5 3e-3 -2e-3 7e-3 -0.0116 0.0178-0.0786 0.137-0.11054 0.19659-0.29444 0.55003-0.48834 1.1817-0.55229 1.7993-0.01 0.0957-9e-3 0.0884-0.0142 0.0862-0.0723-0.0295-0.15535-0.0513-0.2402-0.0633-0.0183-3e-3 -0.0571-4e-3 -0.114-4e-3 -0.0795 1.4e-4 -0.09 7.9e-4 -0.13448 8e-3 -0.0826 0.0136-0.17202 0.0399-0.23622 0.0695-0.0278 0.0128-0.0269 0.0125-0.0269 8e-3z" style="paint-order:stroke markers fill"/>
+<path d="m345.7 133.03c-0.0224-0.0136-0.0843-0.0435-0.11575-0.0558-0.10293-0.0404-0.19767-0.0597-0.3054-0.062-0.11127-2e-3 -0.20488 0.0119-0.30839 0.0471-0.0164 6e-3 -0.0303 0.01-0.0308 9e-3 -1e-3 -1e-3 9e-3 -0.0464 0.0238-0.10432 0.1754-0.68858 0.56773-1.2977 1.1222-1.7423 0.30083-0.24122 0.63808-0.42504 1.0063-0.54845 0.0339-0.0113 0.0621-0.0202 0.0626-0.0197 5.3e-4 5.3e-4 -0.0132 0.012-0.0306 0.0255-0.1927 0.1497-0.38184 0.33021-0.54225 0.51754-0.28868 0.33712-0.5148 0.72123-0.66925 1.1369-0.0904 0.24331-0.15688 0.50274-0.19437 0.75874l-7e-3 0.0446z" style="paint-order:stroke markers fill"/>
+<path d="m344.42 133.09c-0.0554-0.0246-0.12664-0.0443-0.2012-0.0557-0.0353-5e-3 -0.0546-6e-3 -0.11546-6e-3 -0.0785 0-0.11732 4e-3 -0.18688 0.02-0.0176 4e-3 -0.0326 7e-3 -0.0333 6e-3 -8e-4 -7.9e-4 6e-3 -0.0344 0.0153-0.0747 0.16882-0.74316 0.58188-1.4159 1.169-1.904 0.33053-0.27476 0.7038-0.48371 1.1128-0.62291 0.0637-0.0217 0.19565-0.0612 0.19765-0.0592 7.9e-4 7.9e-4 -8e-3 6e-3 -0.02 0.0124-0.0802 0.042-0.19485 0.1114-0.29898 0.18107-0.15609 0.10443-0.28634 0.20604-0.43264 0.33751-0.0635 0.0571-0.20537 0.19988-0.26589 0.26768-0.4364 0.48894-0.73081 1.067-0.86798 1.7043-0.0131 0.0611-0.0369 0.19026-0.0369 0.20065 0 8e-3 -6e-3 7e-3 -0.0356-6e-3z" style="paint-order:stroke markers fill"/>
+<path d="m347.99 132.84c-0.0444-0.0177-0.13246-0.0397-0.18821-0.047-0.11767-0.0154-0.27288-2e-3 -0.36938 0.0327-0.0237 8e-3 -0.0241 8e-3 -0.0226-5e-3 0.0754-0.64788 0.26916-1.232 0.59161-1.7838 0.0196-0.0335 0.0362-0.0602 0.037-0.0595 7.9e-4 7.9e-4 -1e-3 0.0524-5e-3 0.11463-0.031 0.56195-0.0337 1.1347-8e-3 1.6997 2e-3 0.035 1e-3 0.0609-8e-4 0.0607-2e-3 -1.3e-4 -0.0176-6e-3 -0.0347-0.0126z" style="paint-order:stroke markers fill"/>
+<path d="m343.5 132.64c-8e-3 -0.0256-0.12266-0.19436-0.19675-0.28989-0.0876-0.1129-0.30776-0.33324-0.42003-0.4203-0.3841-0.29784-0.80737-0.47293-1.2897-0.53348-0.11232-0.0141-0.46419-0.0141-0.57878-2e-5 -0.21005 0.0259-0.44489 0.0844-0.6323 0.15757-0.0588 0.023-0.10801 0.0407-0.10933 0.0394-5e-3 -5e-3 0.13506-0.23803 0.22429-0.37331 0.65503-0.9931 1.6558-1.729 2.7994-2.0585 1.0759-0.30998 2.1945-0.2593 3.2411 0.14685 0.28594 0.11095 0.60022 0.27057 0.87023 0.44197 0.0534 0.0339 0.0972 0.0622 0.0972 0.0629 1e-5 7.9e-4 -0.0698-3e-5 -0.15503-2e-3 -0.85088-0.0156-1.7103 0.26104-2.4013 0.77298-0.21155 0.15672-0.47055 0.39744-0.63802 0.59297-0.34677 0.40486-0.59896 0.8528-0.76176 1.353-0.0215 0.0659-0.0402 0.1211-0.0416 0.12258-1e-3 2e-3 -5e-3 -4e-3 -8e-3 -0.0131z" style="paint-order:stroke markers fill"/>
+<path d="m331.5 131.04c-4e-3 -0.0209-0.0236-0.13097-0.0428-0.24466-0.36159-2.1327-1.6251-4.0675-3.4396-5.2668-1.2228-0.80818-2.5863-1.2526-4.0644-1.3248l-0.23618-0.0115 0.12042-0.0669c0.0662-0.0368 0.2581-0.1314 0.42635-0.21017 3.4351-1.6081 7.4114-1.3072 10.566 0.79965 1.9077 1.2739 3.3898 3.182 4.1514 5.3446 0.0879 0.24962 0.23404 0.72197 0.22587 0.73013-3e-3 3e-3 -0.0664-0.0633-0.14-0.14825-0.77814-0.89753-1.8728-1.4676-3.09-1.6091-0.28723-0.0334-0.93042-0.0236-1.1965 0.0182-1.3075 0.20542-2.408 0.86304-3.1774 1.8986-0.0834 0.11229-0.0968 0.12402-0.10356 0.0909z" style="paint-order:stroke markers fill"/>
+<path d="m327.57 131.12c-1e-4 -0.31966-0.0337-0.73516-0.0876-1.0822-0.23369-1.5058-0.92775-2.9108-1.9789-4.006-0.42036-0.43793-0.89276-0.82488-1.3896-1.1382-0.11821-0.0746-0.17865-0.11082-0.3514-0.21087l-0.0331-0.0192 0.062-7e-5c0.0901-1.1e-4 0.34676 0.0149 0.50436 0.0295 0.38351 0.0355 0.73191 0.094 1.1038 0.18536 1.1939 0.29322 2.2799 0.86378 3.2081 1.6855 0.14379 0.12729 0.48929 0.47337 0.61713 0.61814 0.34993 0.3963 0.65005 0.81419 0.90903 1.2658 0.1005 0.17523 0.30303 0.58282 0.38292 0.7706 0.23513 0.55272 0.40181 1.1218 0.50151 1.7122 0.0336 0.19921 0.0347 0.19259-0.0232 0.14098-0.17571-0.15671-0.45804-0.32483-0.71314-0.42465-0.43098-0.16865-0.93135-0.21085-1.3926-0.11746-0.46398 0.094-0.88529 0.31597-1.2303 0.64835l-0.0891 0.0858-4e-5 -0.14371z" style="paint-order:stroke markers fill"/>
+<path d="m327.03 131.44c-0.18169-0.12568-0.37712-0.19003-0.60434-0.19895-0.20584-8e-3 -0.34704 0.0212-0.56992 0.11805-6e-3 2e-3 -5e-3 -0.0329 2e-3 -0.10604 0.0422-0.46191 0.0415-0.99423-2e-3 -1.4657-0.0908-0.98722-0.36793-1.9608-0.81083-2.8484-0.25264-0.50633-0.57565-1.0138-0.90958-1.4288-0.0383-0.0476-0.0678-0.0883-0.0656-0.0906 5e-3 -5e-3 0.19801 0.13268 0.35305 0.25338 0.82985 0.646 1.5216 1.4999 1.98 2.4442 0.3841 0.79126 0.61043 1.6192 0.68597 2.5094 0.0148 0.17393 0.0258 0.79217 0.0149 0.83267l-7e-3 0.0265z" style="paint-order:stroke markers fill"/>
+<path d="m324.8 130.77c-0.33052-0.41887-0.86458-0.65202-1.3813-0.60304-0.16835 0.016-0.35887 0.0625-0.48989 0.11958-0.0175 8e-3 -0.031 0.01-0.031 5e-3s0.0148-0.0911 0.0329-0.19235c0.27276-1.5238 0.34181-3.1681 0.19794-4.7138-9e-3 -0.0994-0.0154-0.18218-0.0137-0.18393 8e-3 -8e-3 0.28083 0.36932 0.40522 0.55985 0.68663 1.0517 1.1177 2.2297 1.2703 3.4718 0.0465 0.37842 0.0625 0.70569 0.0547 1.1204-3e-3 0.17735-8e-3 0.35172-0.0114 0.38748l-5e-3 0.065z" style="paint-order:stroke markers fill"/>
+<path d="m322.39 130.23c-0.0924-0.0824-0.2732-0.18299-0.41143-0.22899-0.12346-0.0411-0.22563-0.0593-0.36286-0.0646-0.18508-7e-3 -0.35457 0.0191-0.51025 0.0791-0.0367 0.0142-0.0632 0.0207-0.0611 0.0151 2e-3 -5e-3 0.0213-0.0676 0.0429-0.13804 0.36917-1.2095 0.91612-2.7889 1.4059-4.0597 0.0622-0.16144 0.12446-0.32329 0.1383-0.35967 0.0138-0.0364 0.0278-0.0691 0.0309-0.0726 0.011-0.0124 0.0515 0.57114 0.067 0.9656 0.0113 0.28815 6e-3 1.2432-8e-3 1.4883-0.0394 0.67634-0.0952 1.2215-0.18335 1.7901-0.0314 0.20256-0.0967 0.57708-0.10469 0.60071-6e-3 0.0171-8e-3 0.0165-0.0431-0.0152z" style="paint-order:stroke markers fill"/>
+<path d="m320.5 130.06c-0.0916-0.0883-0.21996-0.16497-0.34714-0.20749-0.10826-0.0362-0.19978-0.0484-0.33292-0.0445-0.0648 2e-3 -0.11783 3e-3 -0.11783 2e-3 0-7.9e-4 0.0311-0.0809 0.0691-0.17826 0.5502-1.4084 1.2545-2.6524 2.1658-3.8255 0.12222-0.15734 0.14705-0.18575 0.13473-0.15412-0.47059 1.2082-1.0063 2.7594-1.456 4.216-0.0393 0.12729-0.0721 0.23147-0.0729 0.23151s-0.0201-0.0179-0.0428-0.0397z" style="paint-order:stroke markers fill"/>
+<path d="m319.19 129.81c-0.0596-0.0389-0.16102-0.082-0.22731-0.0966-0.0385-8e-3 -0.0909-0.0162-0.11034-0.0163l-0.0194-7e-5 0.0324-0.0796c0.4694-1.1538 1.1131-2.1909 1.9328-3.114 0.12628-0.14222 0.29511-0.32237 0.29872-0.31876 1e-3 1e-3 -0.0203 0.0342-0.0475 0.0735-0.51253 0.74238-0.97333 1.5575-1.3539 2.395-0.15898 0.34986-0.33787 0.78992-0.46669 1.148l-0.01 0.0276z" style="paint-order:stroke markers fill"/>
+<path d="m318.46 129.15c-0.10416-0.16091-0.28455-0.33434-0.45244-0.43498-0.12303-0.0738-0.29081-0.13896-0.44163-0.17162-0.0942-0.0204-0.35819-0.0301-0.45338-0.0167-0.034 5e-3 -0.0629 8e-3 -0.0643 6e-3 -4e-3 -4e-3 0.11197-0.20381 0.18647-0.32319 0.57537-0.92199 1.3184-1.6892 2.2134-2.2854 0.69322-0.46181 1.3993-0.78256 2.2127-1.0052 0.0926-0.0254 0.17271-0.045 0.17808-0.0438 5e-3 1e-3 -0.0423 0.0447-0.10598 0.0966-0.877 0.71443-1.6937 1.629-2.3116 2.5888-0.29823 0.46322-0.59437 1.0067-0.80428 1.4759-0.0325 0.0728-0.0672 0.14961-0.0771 0.17079l-0.0179 0.0385z" style="paint-order:stroke markers fill"/>
+<path d="m316.58 128.23c-0.32253-0.65708-1.0579-1.0749-1.7946-1.0197-0.13747 0.0103-0.30166 0.0391-0.40476 0.071-0.0352 0.0109-0.0641 0.018-0.0641 0.0157 0-0.017 0.2779-0.39406 0.40079-0.54388 0.20681-0.25212 0.51307-0.5718 0.74896-0.78175 0.93103-0.8287 2.0321-1.3836 3.249-1.6373 0.72276-0.1507 1.5401-0.1828 2.2779-0.0895 0.26104 0.033 0.79522 0.13456 0.81651 0.1552 3e-3 3e-3 -0.0301 0.0147-0.0744 0.0253-1.5814 0.37737-3.0367 1.2608-4.1279 2.5058-0.32231 0.36774-0.6435 0.81917-0.90448 1.2712-0.04 0.0694-0.0734 0.1258-0.074 0.12545-8e-4 -2.7e-4 -0.0227-0.0443-0.0488-0.0976z" style="paint-order:stroke markers fill"/>
+<path d="m313.7 127.26c-0.13433-0.31983-0.38995-0.61705-0.69124-0.80374-0.20862-0.12926-0.46201-0.21824-0.71645-0.25158-0.1-0.0131-0.3198-0.013-0.42168 1.5e-4 -0.0875 0.0113-0.24779 0.0451-0.29803 0.0628-0.018 6e-3 -0.0327 9e-3 -0.0326 6e-3 1.7e-4 -0.0105 0.19995-0.28509 0.31154-0.4282 0.90563-1.1615 2.1584-2.0457 3.5662-2.5171 1.7954-0.60118 3.7319-0.51208 5.4777 0.25206 0.13602 0.0595 0.54377 0.26123 0.53858 0.26642-2e-3 2e-3 -0.0628-5e-3 -0.13481-0.0171-0.62199-0.0996-1.246-0.12056-1.8672-0.0627-1.4625 0.13624-2.8327 0.69074-3.9802 1.6107-0.20315 0.16288-0.38582 0.32768-0.59675 0.5384-0.41779 0.41737-0.74298 0.82553-1.0566 1.3262l-0.0634 0.10129z" style="paint-order:stroke markers fill"/>
+<path d="m310.74 126.57c-0.084-0.0756-0.20492-0.13826-0.3198-0.16557-0.0336-8e-3 -0.0622-0.0154-0.0635-0.0164-5e-3 -4e-3 0.16993-0.2862 0.27181-0.43817 0.75529-1.1267 1.7797-2.0336 2.9884-2.6455 1.1884-0.60165 2.5202-0.89675 3.8277-0.84815 0.14554 5e-3 0.26628 0.0115 0.26829 0.0135 2e-3 2e-3 -0.0183 4e-3 -0.0453 4e-3 -0.16458 2.7e-4 -0.57385 0.03-0.80546 0.0585-2.4013 0.2953-4.5245 1.6347-5.8247 3.6746-0.0464 0.0728-0.11894 0.19182-0.16125 0.26458-0.0423 0.0728-0.0792 0.13474-0.082 0.13774-3e-3 3e-3 -0.0272-0.0145-0.0542-0.0388z" style="paint-order:stroke markers fill"/>
+<path d="m309.86 126.25c-0.0357-0.0259-0.0915-0.0564-0.1326-0.0725-0.0177-7e-3 -0.0331-0.0136-0.0343-0.0147-6e-3 -6e-3 0.17157-0.29402 0.29993-0.48505 0.60267-0.89689 1.3822-1.6667 2.2893-2.2609 0.28007-0.18345 0.53491-0.32869 0.8536-0.48648 0.43639-0.21608 0.86261-0.38175 1.3418-0.52154 0.13315-0.0388 0.44995-0.1193 0.46717-0.11864 7e-3 2.5e-4 -6e-3 6e-3 -0.0287 0.0121-1.394 0.39784-2.6285 1.1218-3.6425 2.1359-0.53318 0.53326-0.97421 1.1128-1.3601 1.7872l-0.0257 0.0449z" style="paint-order:stroke markers fill"/>
+<path d="m309.6 124.87c-5.3e-4 -0.0605-0.1294-0.41622-0.2072-0.5717-0.28317-0.56583-0.72226-0.99895-1.289-1.2715-0.4268-0.20523-0.8651-0.29645-1.3252-0.27579-0.34895 0.0157-0.79548 0.12324-1.0528 0.25364-0.0446 0.0226-0.084 0.0381-0.0876 0.0345-4e-3 -4e-3 0.0242-0.0878 0.0617-0.18714 0.39973-1.0568 0.6364-2.083 0.75105-3.2564 0.0356-0.36478 0.0502-1.3887 0.0252-1.7783-0.17451-2.728-1.1803-5.1883-2.9691-7.263-0.0608-0.0705-0.10608-0.12816-0.10067-0.12816 0.0379 0 0.6441 0.33024 0.93521 0.5095 1.5391 0.94782 2.8075 2.1728 3.7957 3.666 1.9681 2.9736 2.5322 6.6331 1.5511 10.062-0.0577 0.20169-0.088 0.2722-0.0885 0.20588z" style="paint-order:stroke markers fill"/>
+<path d="m305.02 122.98c-0.0901-0.13701-0.31545-0.35038-0.45901-0.43457-0.25077-0.14707-0.47389-0.20719-0.77308-0.20832-0.10687-5.3e-4 -0.1943-6e-3 -0.1943-0.0127 0-7e-3 0.0398-0.0968 0.0885-0.20043 0.20428-0.4352 0.44434-1.067 0.59921-1.577 0.81733-2.6918 0.71927-5.5748-0.27872-8.1943-0.0959-0.25175-0.27232-0.67145-0.32858-0.78172-0.0182-0.0357-0.0297-0.0682-0.0256-0.0724 0.0212-0.0212 0.5498 0.75492 0.76751 1.1269 0.94752 1.6191 1.4843 3.3956 1.5938 5.2751 0.0235 0.40332 0.0101 1.2597-0.0258 1.6454-0.10707 1.1508-0.35601 2.2045-0.7725 3.2698-0.0542 0.13851-0.10412 0.25533-0.11102 0.2596-7e-3 4e-3 -0.0431-0.0386-0.0803-0.0953z" style="paint-order:stroke markers fill"/>
+<path d="m303.34 121.69c-5e-3 -0.0136-0.0317-0.0934-0.0592-0.17713-0.2329-0.70977-0.82389-1.2545-1.5693-1.4464-0.29328-0.0755-0.74837-0.0842-1.0082-0.0192-0.0328 8e-3 -0.014-0.0366 0.14393-0.34389 1.1128-2.165 1.728-4.4596 1.8548-6.9183 0.0205-0.39757 0.0106-1.6084-0.0159-1.943-8e-3 -0.0955-0.0126-0.17528-0.0112-0.17728 7e-3 -0.0107 0.31396 0.55918 0.44663 0.83047 0.6446 1.318 1.0323 2.6771 1.1821 4.144 0.19536 1.9131-0.0836 3.9133-0.79298 5.6869-0.13885 0.34715-0.16017 0.39256-0.17079 0.3638z" style="paint-order:stroke markers fill"/>
+<path d="m300.26 119.79c-0.0363-0.0995-0.0614-0.15585-0.11604-0.26078-0.25619-0.49181-0.73703-0.85383-1.2945-0.97464-0.15315-0.0332-0.51007-0.0425-0.6635-0.0174-0.0609 0.01-0.1119 0.0169-0.11344 0.0153-2e-3 -2e-3 0.11416-0.1789 0.25713-0.39412 1.4882-2.2403 2.7619-4.6591 3.7395-7.1018l0.14457-0.36119 8e-3 0.0922c0.0398 0.47927 0.0522 1.5382 0.0235 2.0158-0.12807 2.133-0.5698 3.971-1.4125 5.8774-0.0986 0.2231-0.51273 1.0631-0.54716 1.1099-0.0165 0.0224-0.0168 0.0224-0.0252-8e-4z" style="paint-order:stroke markers fill"/>
+<path d="m297.5 118.43c-0.1708-0.36499-0.52171-0.61467-0.93282-0.66371l-0.11856-0.0142 2.5327-3.296c1.393-1.8128 2.5344-3.291 2.5364-3.285 4e-3 0.0118-0.15258 0.38899-0.32184 0.7754-0.5116 1.168-1.1047 2.3583-1.7304 3.4728-0.54513 0.97093-1.2817 2.1534-1.8704 3.0025l-0.059 0.0851z" style="paint-order:stroke markers fill"/>
+<path d="m295.77 116.54c-0.0247-0.45909-0.15462-0.84899-0.40563-1.2175-0.30444-0.44694-0.77925-0.78232-1.2992-0.91771-0.14604-0.038-0.32895-0.0701-0.4015-0.0705-0.0257-1.2e-4 -0.0529-4e-3 -0.0605-9e-3 -9e-3 -6e-3 0.0523-0.0683 0.16955-0.17421 1.9878-1.7953 4.3421-3.0988 6.9126-3.8274 0.26261-0.0744 0.80973-0.2131 0.90029-0.22816l0.0525-9e-3 -0.26302 0.27201c-1.8888 1.9534-3.6493 3.9336-5.3341 5.9999l-0.26336 0.32298z" style="paint-order:stroke markers fill"/>
+<path d="m293.19 113.95c-0.0198-0.23423-0.11584-0.55678-0.24054-0.80784-0.13933-0.28053-0.28191-0.4741-0.51236-0.69562-0.37267-0.35822-0.81528-0.57459-1.3538-0.66178-0.093-0.015-0.19515-0.0209-0.36906-0.021l-0.24044-1.8e-4 0.03-0.0249c0.0165-0.0137 0.11415-0.0879 0.21705-0.16479 1.6902-1.2639 3.6941-2.073 5.7705-2.33 0.56878-0.0704 0.87094-0.088 1.5143-0.088 0.54835-1e-5 0.70092 6e-3 1.1401 0.0471 0.70222 0.0653 1.4723 0.2086 2.1661 0.40319l0.13736 0.0385-0.33614 0.0843c-2.0379 0.51109-3.8672 1.3209-5.598 2.4782-0.77413 0.5176-1.4477 1.0452-2.1263 1.6656-0.0955 0.0873-0.17754 0.16014-0.18241 0.16197-5e-3 2e-3 -0.0122-0.0363-0.0163-0.0847z" style="paint-order:stroke markers fill"/>
+<path d="m289.91 111.58c0.0166-0.10215 0.0217-0.4848 8e-3 -0.59734-0.0974-0.79779-0.57186-1.4646-1.287-1.8086-0.2424-0.11658-0.49216-0.18906-0.74696-0.21676-0.0603-7e-3 -0.11138-0.0136-0.11344-0.0157-0.0101-0.0101 0.51431-0.34385 0.79024-0.50283 1.2821-0.73873 2.6966-1.2282 4.1627-1.4405 0.87173-0.12621 1.8204-0.1507 2.7128-0.07 1.7352 0.15689 3.4254 0.70817 4.9345 1.6094 0.16003 0.0956 0.77656 0.50234 0.83021 0.54775l0.0292 0.0247-0.0292-7e-3c-1.1726-0.29095-2.0744-0.4052-3.198-0.40516-0.58517 2e-5 -1.0113 0.0249-1.5376 0.0897-2.3322 0.28722-4.5287 1.2126-6.358 2.6787-0.098 0.0786-0.18418 0.14652-0.19147 0.15103-0.01 6e-3 -0.0111-5e-3 -6e-3 -0.0373z" style="paint-order:stroke markers fill"/>
+<path d="m287.25 108.55c-0.0108-0.28757-0.0653-0.53165-0.17387-0.7784-0.24183-0.54963-0.73312-0.97685-1.3162-1.1445-0.0529-0.0152-0.0992-0.0307-0.10293-0.0344-9e-3 -9e-3 0.19963-0.13924 0.50899-0.31595 1.4802-0.84555 3.133-1.3726 4.8292-1.54 0.39465-0.0389 0.56955-0.0485 1.0173-0.0556 1.6518-0.0262 3.2651 0.27742 4.7942 0.90232 1.2659 0.51736 2.4668 1.266 3.4784 2.1683 0.20412 0.18209 0.54572 0.50587 0.53987 0.51172-3e-3 3e-3 -0.0666-0.0327-0.14225-0.0784-1.6316-0.98538-3.4077-1.564-5.2909-1.7238-0.52226-0.0443-1.2778-0.0523-1.7715-0.0187-2.2931 0.15597-4.3807 0.89602-6.2628 2.2202l-0.10058 0.0708z" style="paint-order:stroke markers fill"/>
+<path d="m301.8 108.62c-0.20023-0.24947-0.98965-1.0395-1.34-1.3411-1.8429-1.5863-4.0792-2.6044-6.4642-2.9428-0.70938-0.10067-0.97652-0.11825-1.7958-0.11814-0.76158 9e-5 -1.0512 0.0166-1.6604 0.0948-0.99031 0.12712-2.1075 0.42077-3.0702 0.80699-0.35222 0.1413-1.2238 0.55773-1.4608 0.69791-0.0675 0.0399-0.12278 0.0668-0.12278 0.0597 0-7e-3 0.0572-0.12049 0.12702-0.25188 0.41508-0.78063 0.66893-1.6299 0.76278-2.5519 0.0371-0.36423 0.0166-1.2932-0.0358-1.6276-0.21726-1.3849-0.7698-2.5669-1.6842-3.6028-0.65711-0.74444-1.615-1.4131-2.5608-1.7875-0.1222-0.0484-0.22529-0.0906-0.22909-0.0939-0.0101-9e-3 0.83257-0.16816 1.1061-0.20936 0.67472-0.10163 1.1758-0.14772 1.9082-0.17553 1.9661-0.0747 4.0092 0.22956 5.891 0.87716 1.2996 0.44725 2.5249 1.0474 3.6716 1.7984 3.0429 1.9928 5.3533 4.9688 6.5281 8.4086 0.25132 0.73589 0.61224 2.1052 0.55472 2.1047-5e-3 -5e-5 -0.0611-0.0657-0.12543-0.14577z" style="paint-order:stroke markers fill"/>
+<path d="m285.25 105.95c-1.6e-4 -0.0194-6e-3 -0.073-0.0129-0.11921-0.12932-0.861-0.75516-1.5557-1.5968-1.7724-0.18673-0.0481-0.31973-0.0643-0.53346-0.0651-0.12347-5.3e-4 -0.18527-4e-3 -0.18117-9e-3 3e-3 -5e-3 0.0305-0.038 0.0601-0.0744 0.7372-0.90595 1.1703-2.0702 1.2041-3.237 0.0201-0.69331-0.0701-1.3041-0.28727-1.9448-0.25328-0.74733-0.6875-1.4596-1.2275-2.0136-0.0587-0.0602-0.10338-0.10955-0.0992-0.10955 0.0134 0 0.36763 0.17735 0.47858 0.23961 0.7096 0.39816 1.3266 0.9137 1.8358 1.5339 0.53773 0.65498 0.9483 1.4336 1.1903 2.2572 0.30823 1.0492 0.33948 2.1675 0.0906 3.2412-0.15714 0.67773-0.43632 1.3478-0.81091 1.9464-0.0403 0.0644-0.0815 0.12721-0.0916 0.13957l-0.0183 0.0225-2.9e-4 -0.0352z" style="paint-order:stroke markers fill"/>
+<path d="m282.2 104.04c-9e-3 -0.0137-0.0322-0.0413-0.0514-0.0614l-0.0351-0.0366 0.14001-0.14174c0.19638-0.19881 0.31997-0.34206 0.48005-0.5564 0.3847-0.51511 0.67359-1.1057 0.8482-1.7339 0.0587-0.21139 0.1118-0.46688 0.13926-0.67068 6e-3 -0.0425 0.0114-0.0763 0.0126-0.0751 3e-3 3e-3 -0.0157 0.22404-0.0284 0.32774-0.1043 0.852-0.43297 1.6728-0.94702 2.3651-0.0804 0.10819-0.19101 0.24438-0.28015 0.34475-0.0707 0.0796-0.24975 0.26309-0.25674 0.26309-3e-3 0-0.0123-0.0112-0.0213-0.0248z" style="paint-order:stroke markers fill"/>
+<path d="m282.22 102.44c-0.0129-0.35536-0.11745-0.67915-0.31424-0.97359-0.14446-0.21613-0.36125-0.42341-0.58455-0.55889-0.19428-0.11787-0.44423-0.21046-0.65976-0.24437-0.0373-6e-3 -0.0678-0.0136-0.0678-0.0171 0-4e-3 0.0301-0.0422 0.0669-0.0859 0.15689-0.1866 0.34947-0.46288 0.47423-0.68031 0.49836-0.86858 0.72194-1.8476 0.6488-2.8411-8e-3 -0.10563-0.035-0.34417-0.0457-0.40101l-6e-3 -0.0289 0.0309 0.0289c0.017 0.0159 0.0708 0.0736 0.11958 0.12815 0.69695 0.77963 1.1125 1.7683 1.1827 2.8139 0.0174 0.25931 9e-3 0.58323-0.0212 0.84476-0.0849 0.72867-0.34126 1.4324-0.74465 2.0443-0.0382 0.058-0.0707 0.10542-0.0722 0.10542-1e-3 0-5e-3 -0.0605-8e-3 -0.13435z" style="paint-order:stroke markers fill"/>
+<path d="m280.2 100.32c-0.0752-0.23429-0.24348-0.45329-0.45936-0.59763-0.0693-0.0463-0.17886-0.10076-0.2543-0.12634-0.0306-0.0104-0.0576-0.0206-0.0601-0.0228-2e-3 -2e-3 0.0422-0.0458 0.0994-0.097 0.1329-0.11902 0.36416-0.35023 0.48276-0.48266 0.54963-0.61378 0.95915-1.2793 1.2587-2.0455 0.017-0.0434 0.0322-0.075 0.0338-0.0701 7e-3 0.0202 0.0218 0.21306 0.0282 0.36392 0.0108 0.25491-4e-3 0.5239-0.0425 0.79661-0.11638 0.81429-0.45331 1.577-0.98019 2.2188-0.0356 0.0434-0.0711 0.0848-0.0788 0.092l-0.014 0.0131z" style="paint-order:stroke markers fill"/>
+<path d="m279 99.271c-0.0434-0.12324-0.12607-0.24216-0.22068-0.31763l-0.0275-0.0219 0.1035-0.076c0.26901-0.19744 0.59934-0.46661 0.85185-0.69414 0.28712-0.25873 0.63548-0.60824 0.88428-0.88722 0.0394-0.0442 0.0716-0.0773 0.0716-0.0735 0 0.0121-0.14849 0.29702-0.21754 0.41742-0.21792 0.37996-0.46524 0.72308-0.75832 1.052-0.14978 0.1681-0.40407 0.41692-0.57639 0.56397-0.0354 0.0302-0.0712 0.0611-0.0795 0.0687l-0.0152 0.0139z" style="paint-order:stroke markers fill"/>
+<path d="m278.38 98.617c-5e-3 -8e-3 -0.0125-0.0194-0.0169-0.0255l-8e-3 -0.0111 5e-3 -3e-3c0.0111-7e-3 0.23428-0.15572 0.29189-0.19489 0.18262-0.12417 0.39317-0.27146 0.53547-0.37457 0.0115-8e-3 0.0213-0.0149 0.0216-0.0146 3.4e-4 2.6e-4 -7e-3 7e-3 -0.0173 0.0159-0.23303 0.19838-0.46279 0.37865-0.70783 0.55537-0.0405 0.0292-0.094 0.067-0.0947 0.067-4e-4 0-5e-3 -6e-3 -0.01-0.0144z" style="paint-order:stroke markers fill"/>
+<path d="m278.3 98.016c-0.0326-0.1641-0.12429-0.32537-0.2502-0.44005-0.0152-0.0139-0.0264-0.0273-0.0248-0.0298 4e-3 -6e-3 0.18185-0.10092 0.38535-0.2048 0.48558-0.24785 1.0314-0.49086 1.5482-0.68927 0.20338-0.0781 0.40948-0.15278 0.41578-0.15068 6e-3 2e-3 -0.2339 0.20366-0.45696 0.38333-0.39004 0.31414-0.81758 0.63613-1.2172 0.91664-0.13329 0.0936-0.38414 0.26525-0.38759 0.26525-1e-3 0-7e-3 -0.0228-0.0126-0.0506z" style="paint-order:stroke markers fill"/>
+<path d="m277.78 97.102c-0.0314-0.19983-0.1516-0.4057-0.3093-0.52991l-0.0306-0.0241 0.0652-0.0275c0.0861-0.0363 0.22746-0.0902 0.33105-0.12612 0.54033-0.18741 1.0612-0.29626 1.6323-0.34112 0.24377-0.0192 0.59622-0.0243 0.76544-0.0112l0.0434 3e-3 -0.16617 0.06c-0.49905 0.18019-0.99633 0.38687-1.4846 0.61702-0.21435 0.10104-0.6132 0.3029-0.79825 0.404l-0.0411 0.0225z" style="paint-order:stroke markers fill"/>
+<path d="m277.07 96.198c-0.0226-0.10288-0.0732-0.20442-0.14728-0.29542-0.0178-0.0218-0.0312-0.0406-0.03-0.0417 7e-3 -6e-3 0.19201-0.0741 0.28875-0.10625 0.38116-0.12667 0.74351-0.20133 1.1664-0.24032 0.14459-0.0133 0.63812-0.0151 0.78635-3e-3 0.1802 0.0149 0.49284 0.0567 0.52597 0.0704 7e-3 3e-3 -0.0238 6e-3 -0.0789 9e-3 -0.45621 0.0194-1.0151 0.11312-1.5053 0.25242-0.30209 0.0858-0.69158 0.22846-0.94056 0.34437-0.0317 0.0148-0.0587 0.0269-0.0598 0.0269-1e-3 0-4e-3 -7e-3 -6e-3 -0.0161z" style="paint-order:stroke markers fill"/>
+<path d="m280.83 95.361c-9e-3 -9e-3 -0.25637-0.13096-0.34758-0.17179-1.1198-0.50123-2.3924-0.58417-3.572-0.2328-0.0433 0.0129-0.0794 0.0229-0.0801 0.0221-7.4e-4 -7.9e-4 9e-3 -0.0276 0.0222-0.0596 0.0434-0.10755 0.0815-0.25351 0.10228-0.39117 0.0123-0.0817 0.0172-0.3054 9e-3 -0.39251-0.0415-0.41962-0.22264-0.79835-0.5187-1.0843-0.0317-0.0306-0.069-0.0647-0.0828-0.0758-0.0217-0.0173-0.0237-0.0206-0.0143-0.0241 6e-3 -2e-3 0.0633-9e-3 0.12747-0.0148 0.0938-9e-3 0.1682-0.0108 0.37972-0.0106 0.2744 2.2e-4 0.35821 5e-3 0.57003 0.0324 1.0515 0.13629 2.0255 0.64292 2.7359 1.4231 0.26053 0.28612 0.46331 0.57423 0.65736 0.93398 0.0245 0.0454 0.0288 0.0619 0.0121 0.0458z" style="paint-order:stroke markers fill"/>
+<path d="m281.14 94.945c-0.22078-0.38958-0.44471-0.67755-0.8107-1.0426-0.39217-0.39114-0.7607-0.66037-1.2335-0.9011-0.49247-0.25077-0.97849-0.40494-1.5627-0.49571-0.23936-0.0372-0.8469-0.0509-1.1233-0.0253-0.12028 0.0111-0.22193 0.017-0.2259 0.013-4e-3 -4e-3 0.0191-0.0649 0.0512-0.13544 0.4271-0.9372 0.34527-1.989-0.22069-2.8369-0.32255-0.48319-0.77381-0.84844-1.3421-1.0863-0.033-0.0138 5e-3 -0.0199 0.18916-0.0299 0.51231-0.028 1.1699 0.0412 1.7297 0.18198 1.4104 0.35468 2.6637 1.2076 3.5072 2.3866 0.39471 0.55178 0.71676 1.2131 0.90604 1.8605 0.19521 0.66766 0.28273 1.4561 0.23526 2.1193l-0.0106 0.14883z" style="paint-order:stroke markers fill"/>
+<path d="m281.72 94.437c-5e-3 -0.22535-0.0213-0.50646-0.0356-0.6247-0.18492-1.5254-0.83345-2.8674-1.9022-3.9361-0.53859-0.53858-1.0907-0.93315-1.7699-1.2649-0.70768-0.34568-1.366-0.53757-2.1912-0.63874-0.335-0.0411-1.1024-0.0412-1.4363-2.4e-4 -0.13067 0.016-0.24074 0.026-0.24461 0.0221-4e-3 -4e-3 0.059-0.0674 0.13962-0.14109 0.51711-0.47262 1.0097-1.1658 1.3086-1.8415 0.62685-1.417 0.65293-3.0084 0.073-4.4517-0.0918-0.22856-0.312-0.65787-0.45276-0.8829-0.43556-0.69634-1.0818-1.3439-1.7761-1.7798-0.1734-0.10886-0.16927-0.11017 0.18438-0.0586 1.9346 0.28232 3.6815 1.0256 5.2165 2.2195 0.61166 0.47576 1.2948 1.1511 1.7945 1.7738 0.45427 0.56615 0.89132 1.2443 1.2202 1.8934 1.4646 2.8906 1.5755 6.271 0.30348 9.2518-0.1063 0.24909-0.33389 0.72656-0.38859 0.81524l-0.0334 0.0542z" style="paint-order:stroke markers fill"/>
+<path d="m282.55 94.291c0.0186-0.0514 0.10699-0.28297 0.19639-0.51449 0.36655-0.94932 0.61876-2.0266 0.71724-3.0636 0.067-0.70549 0.0314-2.0168-0.0738-2.7128-0.76651-5.0757-4.7619-8.988-9.8615-9.6565-0.30257-0.0397-0.56302-0.0721-0.57878-0.0721-0.0158 0 0.19054-0.15049 0.45843-0.33442 0.75014-0.51502 1.3188-0.98841 1.9862-1.6533 2.1789-2.1708 3.5224-4.8475 4.0027-7.9748 0.13943-0.90788 0.15315-2.8866 0.0262-3.7845-0.22013-1.5575-0.67673-3.0716-1.3039-4.3237-0.12698-0.25351-0.21864-0.47318-0.20368-0.48814 0.015-0.015 0.22148 0.10648 0.45892 0.26987 3.3604 2.3124 5.9356 5.2749 7.7053 8.8643 3.1183 6.3244 3.1649 13.633 0.12776 20.042-0.52344 1.1046-1.3165 2.4439-2.0586 3.4763-0.62081 0.86372-1.6733 2.1314-1.5989 1.9258z" style="paint-order:stroke markers fill"/>
+<path d="m273.2 88.034c-7e-3 -0.0929-0.0336-0.1869-0.0808-0.28706-0.0562-0.11933-0.12205-0.20717-0.21904-0.29203l-0.0442-0.0387 0.039-0.0227c0.14924-0.0869 0.43074-0.29049 0.61779-0.44684 0.20569-0.17191 0.5061-0.4789 0.67858-0.69341 0.26273-0.32676 0.48894-0.68952 0.65736-1.0542 0.25294-0.54765 0.39778-1.087 0.4596-1.7115 0.0179-0.18046 0.0205-0.67268 5e-3 -0.84749-0.0405-0.44306-0.11515-0.813-0.24209-1.2001-0.0232-0.0706-0.0399-0.13049-0.0373-0.13311 3e-3 -3e-3 0.0294 0.047 0.0596 0.11023 0.25442 0.53372 0.4106 1.0554 0.48227 1.611 0.0336 0.26006 0.0377 0.33439 0.0375 0.67856-2e-4 0.36223-7e-3 0.4682-0.0502 0.7589-0.18627 1.2595-0.83322 2.416-1.8089 3.2335-0.15292 0.12814-0.43084 0.33229-0.5394 0.39623-6e-3 4e-3 -0.0108-0.016-0.0143-0.0613z" style="paint-order:stroke markers fill"/>
+<path d="m272.54 87.041c-3e-3 -0.0102-0.0204-0.0492-0.0396-0.0866l-0.0348-0.068 0.0934-0.0542c0.11291-0.0656 0.31671-0.201 0.42954-0.28544 0.86609-0.64818 1.4936-1.5681 1.7699-2.5945 0.0173-0.0644 0.033-0.11551 0.0349-0.11366 6e-3 6e-3 -0.0307 0.18324-0.0697 0.33895-0.0883 0.3527-0.24128 0.74827-0.40886 1.0572-0.22765 0.41963-0.47813 0.75671-0.80943 1.0893-0.22356 0.22443-0.44351 0.40635-0.69754 0.57695-0.12066 0.081-0.24606 0.1586-0.2564 0.1586-4e-3 0-9e-3 -8e-3 -0.0115-0.0186z" style="paint-order:stroke markers fill"/>
+<path d="m273.34 85.595c2e-3 -8e-3 0.0175-0.0672 0.0335-0.1323 0.1136-0.45973 0.0874-0.95808-0.0741-1.4098-0.0822-0.22996-0.23919-0.50954-0.396-0.70529-0.18908-0.23604-0.45718-0.46071-0.72958-0.6114-0.16157-0.0894-0.421-0.19197-0.56625-0.22394l-0.0467-0.0103 0.079-0.0754c0.50525-0.48196 0.85232-1.137 0.96864-1.8282 0.0308-0.18335 0.043-0.33853 0.043-0.54984 0-0.33791-0.0433-0.64206-0.13469-0.94509-9e-3 -0.0309-0.0146-0.0586-0.0118-0.0614 3e-3 -3e-3 0.034 0.0148 0.0691 0.0392 0.77362 0.53642 1.3353 1.2717 1.6516 2.162 0.22967 0.64656 0.29989 1.4044 0.19376 2.0911-0.10458 0.6767-0.36245 1.3135-0.75864 1.8735-0.10751 0.15194-0.33191 0.4225-0.32098 0.387z" style="paint-order:stroke markers fill"/>
+<path d="m271.25 82.101c-0.0553-0.30837-0.23732-0.58357-0.49937-0.75487l-0.0724-0.0473 0.0495-0.0305c0.19025-0.11744 0.44366-0.33053 0.62361-0.5244 0.33349-0.35931 0.59181-0.80453 0.73719-1.2706l0.031-0.0992 0.0116 0.0496c0.0851 0.3645 0.0903 0.79721 0.0141 1.1782-0.11109 0.55552-0.3807 1.0551-0.78664 1.4577l-0.0984 0.0976z" style="paint-order:stroke markers fill"/>
+<path d="m270.35 80.942c0-0.0317-0.0413-0.14602-0.07-0.19366-0.0161-0.0267-0.0292-0.0499-0.0292-0.0516 0-2e-3 0.0403-0.0233 0.0896-0.048 0.34711-0.17408 0.68192-0.4156 0.98038-0.7072 0.0724-0.0707 0.12903-0.12155 0.12593-0.11299-0.0104 0.0285-0.098 0.17349-0.16318 0.26969-0.1858 0.27441-0.45705 0.5479-0.73098 0.73702-0.0759 0.0524-0.18893 0.12288-0.19706 0.12288-3e-3 0-5e-3 -7e-3 -5e-3 -0.0161z" style="paint-order:stroke markers fill"/>
+<path d="m270.02 79.861c0-0.0281-0.0275-0.12387-0.0499-0.17358-0.0205-0.0456-0.0215-0.0517-9e-3 -0.0566 7e-3 -3e-3 0.0666-0.0237 0.13138-0.0459 0.23887-0.082 0.56169-0.20553 0.81135-0.31056 0.0699-0.0294 0.12864-0.0518 0.13059-0.0499 2e-3 2e-3 -0.0254 0.0276-0.0609 0.0571-0.16601 0.13801-0.38915 0.29225-0.58839 0.40673-0.0987 0.0567-0.34977 0.18665-0.36065 0.18665-2e-3 0-4e-3 -6e-3 -4e-3 -0.0139z" style="paint-order:stroke markers fill"/>
+<path d="m269.8 79.132c-8e-3 -0.035-0.0231-0.0837-0.0339-0.10831-0.0109-0.0246-0.0188-0.0455-0.0176-0.0464 5e-3 -4e-3 0.39594-0.0791 0.51067-0.0985 0.22984-0.0388 0.56808-0.0843 0.57512-0.0772 2e-3 2e-3 -0.0156 0.0117-0.0396 0.0212-0.024 9e-3 -0.11194 0.0454-0.19551 0.0798-0.1795 0.0739-0.4522 0.17715-0.64615 0.24475l-0.1389 0.0484z" style="paint-order:stroke markers fill"/>
+<path d="m271.26 77.997c-0.16994-0.046-0.46106-0.0951-0.71521-0.12067-0.17903-0.018-0.66574-0.0204-0.82981-4e-3 -0.0585 6e-3 -0.108 9e-3 -0.11004 7e-3 -2e-3 -2e-3 2e-3 -0.0255 9e-3 -0.0521 0.0236-0.0895 0.033-0.2164 0.0228-0.306-0.0108-0.0945-0.0346-0.19056-0.0632-0.25511l-0.0201-0.0454h0.0225c0.0124 0 0.0682 6e-3 0.12394 0.0126 0.533 0.066 1.0158 0.26849 1.4346 0.60179 0.0964 0.0767 0.20785 0.17976 0.19321 0.17866-5e-3 -5.3e-4 -0.036-8e-3 -0.0678-0.0164z" style="paint-order:stroke markers fill"/>
+<path d="m271.59 77.624c-0.45449-0.42117-1.0472-0.71295-1.666-0.8202-0.1226-0.0212-0.35286-0.0465-0.4237-0.0465-0.026 0-0.0353-3e-3 -0.0322-0.0103 0.0172-0.0411 0.0483-0.15505 0.0593-0.21704 0.0173-0.0979 0.0172-0.28293-1e-4 -0.38034-0.0261-0.14627-0.0926-0.31093-0.17304-0.42848-0.0446-0.0651-0.0498-0.0632 0.096-0.0352 0.4632 0.089 0.88538 0.28359 1.2549 0.57847 0.12719 0.10151 0.33551 0.30877 0.43308 0.43089 0.21707 0.27166 0.38823 0.58632 0.49221 0.90485 0.014 0.0429 0.0246 0.0788 0.0236 0.0797-1e-3 7.9e-4 -0.0298-0.0242-0.0639-0.0558z" style="paint-order:stroke markers fill"/>
+<path d="m272 77.251c-0.0467-0.12003-0.16467-0.35512-0.24215-0.4825-0.53334-0.87696-1.4397-1.4549-2.4618-1.5697-0.0591-7e-3 -0.12609-0.0122-0.14883-0.0123-0.0227-1.2e-4 -0.0456-3e-3 -0.0508-6e-3 -7e-3 -4e-3 4e-3 -0.0283 0.0323-0.0764 0.0838-0.14076 0.1417-0.30243 0.16765-0.46786 0.0206-0.13116 0.0133-0.36197-0.0153-0.48305-0.0377-0.15999-0.10432-0.3142-0.19245-0.44557-0.0198-0.0295-0.0346-0.0552-0.0328-0.0569 6e-3 -6e-3 0.23863 0.0398 0.35596 0.0699 1.0007 0.25665 1.8461 0.95182 2.2912 1.8842 0.16654 0.34882 0.27086 0.71168 0.32197 1.12 0.0148 0.11801 0.0264 0.57755 0.0151 0.59773-6e-3 0.01-0.0156-8e-3 -0.0401-0.0712z" style="paint-order:stroke markers fill"/>
+<path d="m272.48 76.753c-0.0783-0.8258-0.40361-1.5922-0.94473-2.2254-0.12168-0.14239-0.36733-0.37965-0.51827-0.50054-0.60245-0.48257-1.3014-0.77016-2.0767-0.85445-0.0682-7e-3 -0.125-0.0145-0.12622-0.0157-1e-3 -1e-3 0.0187-0.0381 0.0442-0.082 0.0908-0.15589 0.16257-0.37003 0.18559-0.55365 0.0149-0.11847 6e-3 -0.36641-0.0166-0.47294-0.0347-0.16232-0.11097-0.35484-0.19056-0.48087-0.0181-0.0286-0.0329-0.0542-0.0329-0.0569 0-7e-3 0.0547 2e-3 0.2067 0.0305 0.73345 0.14011 1.4177 0.46589 2.0092 0.95664 0.12152 0.10081 0.42771 0.40688 0.53058 0.53035 0.86671 1.0403 1.214 2.3848 0.95479 3.6959l-0.0188 0.0951z" style="paint-order:stroke markers fill"/>
+<path d="m272.66 77.799c0.26156-0.60548 0.38845-1.234 0.38834-1.9235-1e-4 -0.57647-0.0697-1.0217-0.24117-1.5435-0.49359-1.5017-1.7331-2.6997-3.2421-3.1333l-0.21749-0.0625 0.24088-0.0885c2.3848-0.87594 4.4463-2.5093 5.8313-4.6202 0.75069-1.1442 1.2924-2.3809 1.6124-3.6812 0.21575-0.87673 0.29865-1.4849 0.35416-2.598l0.0152-0.30402 0.24032 0.48715c0.77423 1.5694 1.2149 3.1681 1.371 4.9735 0.0378 0.43675 0.0368 1.6444-2e-3 2.0814-0.25513 2.9008-1.3029 5.456-3.1504 7.6823-0.31453 0.37904-1.2107 1.2788-1.5997 1.6061-0.16078 0.13529-0.42513 0.34645-0.58744 0.46926-0.28546 0.21598-0.98642 0.69585-1.0164 0.69585-8e-3 0-7e-3 -0.0184 3e-3 -0.0409z" style="paint-order:stroke markers fill"/>
+<path d="m268.95 70.627c0.23225-0.51222 0.2327-1.1279 1e-3 -1.6384-0.13761-0.30351-0.39838-0.61738-0.65843-0.7925l-0.12238-0.0824 0.0679-0.0149c0.45841-0.10051 1.2041-0.33387 1.7166-0.53717 3.0928-1.227 5.5317-3.6454 6.7926-6.7354l0.15268-0.37418-0.0131 0.16371c-0.0552 0.68766-0.12866 1.1929-0.25639 1.7631-0.86459 3.86-3.687 7.0128-7.4326 8.3026-0.15256 0.0525-0.28608 0.0955-0.29671 0.0955-0.0106 0 0.0113-0.0675 0.0487-0.14998z" style="paint-order:stroke markers fill"/>
+<path d="m267.5 67.698c-4e-3 -0.0413-0.0119-0.0941-0.0182-0.11745l-0.0114-0.0424 0.0125-3e-3c7e-3 -2e-3 0.0743-0.0135 0.14989-0.0266 1.441-0.25066 2.8601-0.77359 4.1364-1.5243 0.58026-0.34129 1.1618-0.7513 1.6624-1.1722 0.0493-0.0415 0.0909-0.0742 0.0923-0.0728 3e-3 3e-3 -0.10716 0.10716-0.21418 0.20368-0.68875 0.62115-1.4593 1.1639-2.2889 1.6125-0.14123 0.0763-0.50271 0.25625-0.65773 0.32735-0.75712 0.34722-1.5371 0.60957-2.3474 0.78958-0.12774 0.0284-0.43179 0.0893-0.48252 0.0966l-0.0265 4e-3z" style="paint-order:stroke markers fill"/>
+<path d="m268.48 66.363c0.35685-0.3739 0.60803-0.92006 0.67084-1.4586 0.0962-0.82487-0.20627-1.6526-0.80939-2.2149-0.0627-0.0584-0.10745-0.10624-0.0995-0.10624 8e-3 0 0.12366-0.0161 0.25713-0.0358 2.512-0.37026 4.9654-1.2174 7.1708-2.4761 0.2351-0.13417 0.65456-0.38611 0.82312-0.49438 0.0581-0.0373 0.10755-0.066 0.10982-0.0638 7e-3 7e-3 -0.15114 0.34901-0.27299 0.59247-1.0251 2.048-2.6379 3.7882-4.6005 4.964-0.8404 0.50346-1.7874 0.92516-2.6999 1.2022-0.19155 0.0582-0.59474 0.16997-0.61294 0.16997-7e-3 0 0.022-0.0355 0.0635-0.0789z" style="paint-order:stroke markers fill"/>
+<path d="m268.18 62.008c0.16604-0.32771 0.24467-0.72282 0.2125-1.0677-0.0264-0.28262-0.085-0.49213-0.20623-0.73666-0.10034-0.20243-0.20331-0.34483-0.37295-0.5158l-0.14053-0.14163 0.44434-8e-3c2.5401-0.0442 5.0619-0.14854 7.5289-0.3116 0.28862-0.0191 0.54091-0.0347 0.56065-0.0347 0.032 0 0.0249 7e-3 -0.0659 0.0639-2.3266 1.4608-5.0881 2.4702-7.7898 2.8473-0.0965 0.0135-0.18948 0.0273-0.2067 0.0307-0.0312 6e-3 -0.031 6e-3 0.0357-0.12609z" style="paint-order:stroke markers fill"/>
+<path d="m267.46 59.011c0.17325-0.2289 0.26159-0.50143 0.26171-0.80735 1e-4 -0.27291-0.0737-0.51653-0.2281-0.75291l-0.0259-0.0396 0.14542 8e-3c2.5179 0.14205 4.9384 0.50889 7.3425 1.1128 0.29262 0.0735 0.60461 0.15359 0.69332 0.17798l0.16129 0.0444-0.31914 0.0203c-2.1858 0.13888-4.0432 0.22212-6.1774 0.27685-0.5462 0.014-1.6048 0.0346-1.7856 0.0348l-0.12524 1.1e-4z" style="paint-order:stroke markers fill"/>
+<path d="m274.73 57.998c-0.52966-0.13192-1.4967-0.33641-2.1749-0.45989-1.6305-0.29688-3.4111-0.50515-4.9696-0.58123-0.15756-8e-3 -0.28776-0.0149-0.28932-0.016-2e-3 -1e-3 8e-3 -0.0251 0.022-0.0533 0.099-0.20489 0.11947-0.47583 0.053-0.701-0.0161-0.0546-0.0277-0.10098-0.0257-0.10299 2e-3 -2e-3 0.12131 7e-3 0.2651 0.0207 2.3095 0.21504 4.5801 0.77825 6.6984 1.6615 0.29201 0.12175 0.61994 0.26457 0.62954 0.27417 0.0109 0.0109-0.0275 3e-3 -0.20859-0.0419z" style="paint-order:stroke markers fill"/>
+<path d="m275.93 58.001c-1.7781-0.88683-3.6104-1.5258-5.5845-1.9476-0.73801-0.15765-1.6762-0.3061-2.3726-0.3754-0.1029-0.0102-0.19915-0.0211-0.21388-0.0242-0.0261-5e-3 -0.0258-6e-3 0.0117-0.0365 0.0715-0.0574 0.19804-0.18427 0.2659-0.26658 0.32469-0.39385 0.49-0.91907 0.4453-1.4148-0.0249-0.27577-0.0961-0.51924-0.22312-0.76306-0.0377-0.0724-0.0639-0.13155-0.0583-0.13155 0.023 0 0.49773 0.10902 0.66688 0.15314 1.6393 0.4276 3.1447 1.1292 4.5005 2.0976 0.649 0.46353 1.1158 0.86091 1.7092 1.4549 0.4722 0.47273 0.75089 0.78562 1.1067 1.2426 0.15111 0.19404 0.16165 0.20889 0.14739 0.20763-5e-3 -5.3e-4 -0.18573-0.0888-0.40118-0.19621z" style="paint-order:stroke markers fill"/>
+<path d="m276.59 57.758c-2.0132-2.6022-4.8549-4.4056-8.0682-5.12-0.13505-0.03-0.24679-0.0558-0.2483-0.0572-2e-3 -2e-3 0.0327-0.0286 0.076-0.0603 0.10859-0.0795 0.32757-0.2937 0.42314-0.41389 0.62023-0.77989 0.73201-1.8224 0.29019-2.7064-0.0697-0.13941-0.14856-0.26827-0.23048-0.37648-0.0333-0.044-0.0556-0.0817-0.0496-0.0837s0.0708 0.0155 0.14395 0.0389c1.5582 0.49922 2.925 1.2742 4.1495 2.353 0.2208 0.19452 0.72771 0.69912 0.91874 0.91455 1.3849 1.5618 2.2846 3.3545 2.6953 5.3706 0.0325 0.1595 0.0574 0.30068 0.0554 0.31372-3e-3 0.0176-0.043-0.0272-0.15566-0.17278z" style="paint-order:stroke markers fill"/>
+<path d="m277.08 57.216c-0.40593-1.7752-1.2397-3.4729-2.3971-4.8811-0.34106-0.41495-0.87812-0.97715-1.2475-1.306-1.0785-0.95992-2.2695-1.6946-3.5898-2.2146-0.37165-0.14636-0.8051-0.2922-1.1474-0.38607l-0.16521-0.0453 0.10323-0.0706c0.42687-0.29196 0.74268-0.73793 0.8758-1.2367 0.0569-0.21313 0.0743-0.35224 0.0737-0.58785-6.4e-4 -0.22808-0.0219-0.38698-0.0792-0.5908-0.0576-0.20494-0.16049-0.42735-0.28555-0.61741-0.0605-0.092-0.0676-0.10779-0.0451-0.10088 0.0147 5e-3 0.12141 0.0423 0.23717 0.0839 3.04 1.0933 5.4692 3.3528 6.7666 6.2941 0.78239 1.7737 1.117 3.7655 0.95271 5.6709l-0.0136 0.15762z" style="paint-order:stroke markers fill"/>
+<path d="m277.06 52.575c-0.92631-2.8977-2.887-5.3286-5.517-6.8402-0.84148-0.48364-1.8412-0.90594-2.7207-1.1493-0.11823-0.0327-0.22412-0.0626-0.23531-0.0664-0.0139-5e-3 5e-5 -0.0453 0.0437-0.12747 0.0783-0.14747 0.10656-0.26266 0.10571-0.43101-5.7e-4 -0.11093 3e-3 -0.12749 0.0261-0.12057 0.89395 0.26764 1.5487 0.53174 2.3005 0.92798 1.7438 0.91902 3.253 2.284 4.3599 3.9431 0.7019 1.0521 1.2646 2.3015 1.5901 3.5305 0.0807 0.30479 0.14187 0.56959 0.13343 0.57783-4e-3 3e-3 -0.0424-0.10663-0.0864-0.24449z" style="paint-order:stroke markers fill"/>
+<path d="m276.63 49.888c-0.0724-0.16347-0.34516-0.66746-0.51192-0.94587-0.79245-1.323-1.8492-2.5117-3.0597-3.4417-0.66584-0.51154-1.3056-0.91099-2.0559-1.2836-0.55543-0.27582-1.0358-0.47454-1.5999-0.66189-0.18647-0.0619-0.53395-0.16754-0.64989-0.19752l-0.0339-9e-3 0.0226-0.0476c0.0345-0.0725 0.0579-0.15643 0.0634-0.22767 3e-3 -0.0354 8e-3 -0.0663 0.0118-0.0686 4e-3 -2e-3 0.0823 0.0186 0.17445 0.0464 1.1335 0.34205 2.2294 0.85732 3.2062 1.5074 0.22252 0.1481 0.32127 0.21767 0.54157 0.38154 1.4039 1.0442 2.5555 2.3707 3.4063 3.9233 0.17137 0.31273 0.52378 1.0502 0.51476 1.0773-2e-3 5e-3 -0.015-0.0192-0.0299-0.0528z" style="paint-order:stroke markers fill"/>
+<path d="m277.59 58.215c0-9e-3 0.0373-0.15484 0.0828-0.32441 0.11655-0.43394 0.26611-1.2187 0.33611-1.7635 0.0736-0.57322 0.0844-2.2185 0.018-2.7616-0.3163-2.5878-1.2136-4.7384-2.79-6.6866-0.38917-0.48098-1.366-1.4527-1.8181-1.8085-0.87261-0.68678-1.7671-1.2451-2.6064-1.627l-0.28345-0.12896 0.38034-8e-4c0.49895-1e-3 1.0232-0.0496 1.6536-0.15277 3.7407-0.61222 6.9279-2.9768 8.5994-6.3798 0.72231-1.4706 1.0955-2.906 1.1903-4.5787 0.019-0.33545 0.0402-0.61548 0.047-0.62229 7e-3 -7e-3 0.13118 0.1858 0.2764 0.42801 1.6626 2.7732 2.5948 5.6984 2.8542 8.9567 0.081 1.018 0.0427 2.6753-0.0872 3.7703-0.62185 5.2403-3.2692 10.031-7.3568 13.315-0.42321 0.3399-0.4961 0.3936-0.4961 0.36547z" style="paint-order:stroke markers fill"/>
+<path d="m270.13 42.631c0-7e-3 0.0502-0.0375 0.11162-0.0676 0.29028-0.14197 0.67931-0.44806 0.90537-0.71235 0.37841-0.4424 0.61681-0.94936 0.7216-1.5345 0.0492-0.27502 0.0492-0.7422 0-1.0172-0.1-0.55825-0.33821-1.0816-0.67087-1.4737-0.0777-0.0916-0.0873-0.1092-0.0557-0.10249 0.0559 0.0119 0.28719 0.0381 0.55071 0.0625 0.35224 0.0326 1.3654 0.0273 1.7281-9e-3 0.89376-0.0895 1.6175-0.24388 2.4108-0.51422 1.4501-0.49418 2.7453-1.2936 3.846-2.374 0.87696-0.86072 1.5015-1.7259 2.0471-2.836 0.0983-0.20009 0.17883-0.35264 0.17885-0.339 1.2e-4 0.0924-0.0376 0.62986-0.0586 0.83509-0.29849 2.9145-1.7148 5.5865-3.9594 7.4695-1.8477 1.5501-4.1075 2.4516-6.5399 2.6089-0.30912 0.02-1.2157 0.0231-1.2157 4e-3z" style="paint-order:stroke markers fill"/>
+<path d="m272.07 37.341c-0.40963-0.0248-1.0311-0.089-1.0969-0.1132-0.0146-5e-3 0.0136-0.0471 0.0832-0.12342 0.18185-0.19926 0.31383-0.45654 0.36752-0.71648 0.0495-0.2395 0.0288-0.58879-0.0477-0.80377-0.0143-0.0401-0.023-0.0758-0.0194-0.0794 4e-3 -4e-3 0.10599 0.0123 0.22755 0.0354 0.66917 0.12702 1.0998 0.1653 1.8664 0.16594 0.62767 5.3e-4 0.82877-0.0107 1.3312-0.0744 1.5455-0.19597 3.1019-0.78634 4.3904-1.6654 0.55583-0.37918 0.95927-0.71459 1.4676-1.2201 0.21146-0.21029 0.38447-0.37766 0.38447-0.37194 0 6e-3 -0.058 0.10693-0.12878 0.2249-0.67883 1.1306-1.6057 2.1369-2.6824 2.9121-1.3796 0.9933-3.0278 1.6162-4.7377 1.7905-0.40893 0.0417-1.0636 0.06-1.4056 0.0392z" style="paint-order:stroke markers fill"/>
+<path d="m272.99 35.243c-0.0409-3e-3 -0.17859-0.0143-0.30592-0.0242-0.23293-0.0181-0.70802-0.0756-0.75036-0.0908-0.0133-5e-3 0.0383-0.0465 0.12382-0.1002 0.35789-0.2247 0.61637-0.51206 0.80113-0.89068 0.1904-0.39018 0.26131-0.78819 0.21399-1.2011-0.0219-0.19082-0.0853-0.43459-0.15512-0.59607-0.0315-0.0729-0.0483-0.12906-0.0372-0.12482 0.0111 4e-3 0.14003 0.0347 0.2866 0.0676 2.6654 0.5994 5.4274 0.26934 7.8679-0.94022 0.17262-0.0856 0.31596-0.15346 0.31852-0.1509 8e-3 8e-3 -0.29494 0.40051-0.48528 0.62973-0.22995 0.27692-0.86311 0.91002-1.1395 1.1394-1.574 1.3061-3.3459 2.0496-5.3661 2.2514-0.23918 0.0239-1.1978 0.0455-1.3725 0.0309z" style="paint-order:stroke markers fill"/>
+<path d="m275.14 32.092c-0.50221-0.0287-1.1139-0.10752-1.5843-0.20412-0.37277-0.0765-0.53264-0.11433-0.53264-0.12588 0-5e-3 0.0325-0.033 0.0723-0.0615 0.0911-0.0654 0.26968-0.24829 0.35851-0.36712 0.0374-0.05 0.1046-0.16554 0.14934-0.2567 0.19793-0.40332 0.23266-0.87057 0.0969-1.3036-0.0259-0.0825-0.0448-0.1523-0.042-0.15505 3e-3 -3e-3 0.21633 0.0655 0.47462 0.1517 1.3799 0.4605 2.8053 0.76923 4.1986 0.90941 0.77218 0.0777 1.6749 0.1164 2.3482 0.1007l0.43822-0.0102-0.12403 0.0671c-0.19683 0.10652-0.58083 0.28588-0.86816 0.40549-1.5578 0.6485-3.3031 0.946-4.9854 0.84982z" style="paint-order:stroke markers fill"/>
+<path d="m279.82 30.307c-1.9916-0.0506-3.9609-0.4173-5.8704-1.0931l-0.37207-0.13168 0.11125-0.11496c0.0803-0.083 0.12928-0.15285 0.17607-0.25117 0.0847-0.17804 0.10882-0.28364 0.10883-0.4771l1e-5 -0.15899 0.13265 0.0571c1.9629 0.84469 4.1259 1.5952 6.0485 2.0987 0.23577 0.0617 0.3019 0.0916 0.19026 0.0859-0.0296-2e-3 -0.26582-8e-3 -0.52503-0.0147z" style="paint-order:stroke markers fill"/>
+<path d="m281.32 29.945c-0.0482-0.0184-0.32973-0.12391-0.62554-0.23444-1.7637-0.65895-3.5255-1.3801-5.2327-2.1419-0.27332-0.12197-0.54005-0.2407-0.59272-0.26385-0.0527-0.0232-0.0934-0.046-0.0905-0.0506 3e-3 -5e-3 0.0221-0.0122 0.0426-0.0168 0.0573-0.0126 0.26304-0.10214 0.35114-0.15284 0.4243-0.24422 0.74265-0.6409 0.87912-1.0954 0.0682-0.22721 0.0955-0.47101 0.0774-0.6917-6e-3 -0.0769-9e-3 -0.14207-6e-3 -0.1449 6e-3 -6e-3 0.20153 0.11791 0.50267 0.31834 1.6148 1.0747 3.0791 2.3915 4.3251 3.8893 0.1728 0.20773 0.48656 0.60335 0.48656 0.61352 0 0.0119-0.0297 5e-3 -0.11693-0.0287z" style="paint-order:stroke markers fill"/>
+<path d="m281.69 29.532c-0.21263-0.2807-0.6512-0.79996-1.0043-1.1891-0.24762-0.27288-0.94801-0.97912-1.2166-1.2268-0.99037-0.9131-1.9235-1.6236-3.1444-2.3941-0.0261-0.0165-0.023-0.0189 0.0994-0.081 0.70822-0.35916 1.1209-1.1297 1.032-1.9269-7e-3 -0.0598-0.022-0.15033-0.0342-0.20119-0.0121-0.0509-0.021-0.0935-0.0197-0.0948 6e-3 -6e-3 0.27645 0.20739 0.47561 0.37381 1.1958 0.99919 2.1726 2.2407 2.8634 3.6392 0.35395 0.71652 0.61634 1.4249 0.81442 2.1986 0.0855 0.3338 0.21986 0.98978 0.20225 0.98711-2e-3 -2.6e-4 -0.0329-0.0385-0.068-0.0848z" style="paint-order:stroke markers fill"/>
+<path d="m282.15 29.161c-4e-3 -0.0161-0.0257-0.11407-0.048-0.21775-0.59226-2.7526-2.1563-5.1941-4.4143-6.8907-0.12569-0.0944-0.23013-0.17646-0.23208-0.18226-2e-3 -6e-3 0.0401-0.0222 0.0935-0.0364 0.5168-0.13742 0.96145-0.55636 1.1316-1.0662 0.0628-0.18814 0.0854-0.32784 0.0868-0.53618l1e-3 -0.18888 0.076 0.0656c0.61268 0.52862 1.1195 1.0752 1.5718 1.6952 1.001 1.372 1.6313 2.9964 1.8182 4.6857 0.0453 0.40948 0.0534 0.57573 0.0531 1.0874-3.7e-4 0.53829-0.0132 0.75882-0.0704 1.2102-0.0389 0.30749-0.0578 0.412-0.0675 0.37418z" style="paint-order:stroke markers fill"/>
+<path d="m282.73 28.284c0.0992-1.5706-0.13589-3.0799-0.70158-4.5038-0.63751-1.6047-1.6924-3.0505-3.0126-4.1293l-0.16001-0.13075 0.0372-0.017c0.22755-0.10363 0.33473-0.17086 0.46651-0.29259 0.24861-0.22965 0.4005-0.5353 0.45011-0.90571l9e-3 -0.0693 0.14031 0.12654c0.20501 0.18488 0.60888 0.59412 0.78224 0.79262 1.2996 1.4881 2.0986 3.2634 2.3452 5.2111 0.0558 0.44031 0.0645 0.60115 0.0645 1.1938 0 0.44969-4e-3 0.61311-0.0206 0.78928-0.0535 0.57664-0.13306 1.0546-0.26052 1.5645-0.0545 0.21783-0.13185 0.48929-0.14236 0.4993-3e-3 3e-3 -2e-3 -0.0547 2e-3 -0.12862z" style="paint-order:stroke markers fill"/>
+<path d="m282.75 29.688c0.13714-0.32576 0.21082-0.5106 0.27664-0.694 0.52421-1.4608 0.70594-3.0439 0.52837-4.6028-0.20294-1.7816-0.89352-3.5101-1.9726-4.9374-0.30452-0.40279-0.54684-0.68278-0.92751-1.0717l-0.18303-0.18699 0.16536 0.0134c0.24334 0.0197 0.70358 0.0148 0.89297-9e-3 1.7449-0.22339 3.1356-1.516 3.4714-3.2266 0.0418-0.21279 0.0757-0.50478 0.0757-0.65102v-0.083l0.0756 0.10658c0.0416 0.0586 0.15208 0.22936 0.24559 0.37943 0.92505 1.4846 1.483 3.1027 1.6707 4.8452 0.09 0.83556 0.0745 1.8542-0.0412 2.7037-0.38266 2.8103-1.807 5.388-3.9734 7.1906-0.27683 0.23036-0.32086 0.26276-0.30461 0.22417z" style="paint-order:stroke markers fill"/>
+<path d="m280.8 17.756c-0.11689-0.01-0.46109-0.0586-0.49246-0.0702-0.0251-9e-3 -0.0144-0.0223 0.0615-0.0745 0.25293-0.1742 0.46507-0.49319 0.53752-0.80825 0.0551-0.23948 0.0579-0.46513 8e-3 -0.66303l-0.0105-0.0418 0.11323 0.0326c0.69293 0.19977 1.4414 0.15491 2.0985-0.12575 0.55252-0.236 1.0173-0.61656 1.3631-1.116 0.0847-0.1224 0.0854-0.12288 0.074-0.0573-0.097 0.55818-0.39746 1.1989-0.76764 1.6371-0.54512 0.64525-1.2402 1.0582-2.0593 1.2235-0.30075 0.0607-0.65966 0.0854-0.92604 0.0636z" style="paint-order:stroke markers fill"/>
+<path d="m282 15.276c-0.0273-4e-3 -0.0977-0.0113-0.15658-0.0168-0.0974-9e-3 -0.10406-0.012-0.0744-0.0331 0.272-0.19335 0.43239-0.42311 0.50406-0.72204 0.0179-0.0749 0.0327-0.18226 0.0328-0.23867l1.2e-4 -0.10256 0.0786 0.024c0.0432 0.0132 0.1604 0.0405 0.26045 0.0607 0.26381 0.0532 0.7299 0.0528 0.99923-1e-3 0.18546-0.037 0.49241-0.13088 0.58549-0.17902 0.0259-0.0134 0.0501-0.0215 0.0537-0.0179 4e-3 4e-3 -0.0341 0.0655-0.0837 0.13765-0.46024 0.66848-1.1601 1.0554-1.9681 1.0882-0.10005 4e-3 -0.20423 4e-3 -0.23151 5.3e-4z" style="paint-order:stroke markers fill"/>
+<path d="m283.03 13.832c-0.16357-0.0122-0.22982-0.0206-0.34106-0.0431-0.0707-0.0143-0.1447-0.0329-0.22409-0.0561l-0.0236-7e-3 0.026-0.0336c0.0344-0.0443 0.0516-0.0719 0.0794-0.12736 0.0252-0.0502 0.0508-0.12286 0.0619-0.17539l7e-3 -0.0335 0.0707 0.0341c0.25111 0.12111 0.52947 0.21374 0.81281 0.27049 0.11333 0.0227 0.29908 0.0498 0.34153 0.0498 0.0246 0 0.0128 6e-3 -0.0476 0.0246-0.14407 0.0441-0.29195 0.0733-0.45104 0.0891-0.0605 6e-3 -0.26734 0.0113-0.31212 8e-3z" style="paint-order:stroke markers fill"/>
+<path d="m283.09 13.069c-0.10806-0.0429-0.219-0.0939-0.3147-0.14491-0.0165-9e-3 -0.0198-0.0111-0.0181-0.0125 1e-3 -1e-3 7e-3 -9e-3 0.0129-0.0177 6e-3 -9e-3 0.0113-0.016 0.0119-0.016 6.3e-4 -3e-5 0.0148 9e-3 0.0314 0.0195 0.0859 0.0553 0.18937 0.11766 0.278 0.16737 0.0117 7e-3 0.0202 0.0118 0.019 0.0117-1e-3 -7e-5 -0.0104-3e-3 -0.0205-7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m283.67 12.603c-0.127-0.08-0.27321-0.17689-0.37615-0.24928l-0.0224-0.0158 0.0182-0.019c0.01-0.0105 0.0245-0.0273 0.0322-0.0374 0.0123-0.0161 0.0146-0.0179 0.0189-0.0146 0.0249 0.0194 0.189 0.17113 0.30155 0.27881 0.0947 0.0906 0.10773 0.10361 0.10362 0.10344-2e-3 -6e-5 -0.0357-0.0208-0.0759-0.0462z" style="paint-order:stroke markers fill"/>
+<path d="m284.08 12.34c-0.15249-0.14843-0.27225-0.26136-0.3838-0.36189l-0.0645-0.0582 0.0298-0.0311c0.0164-0.0171 0.0363-0.0405 0.0444-0.052 8e-3 -0.0115 0.0154-0.0209 0.0164-0.0209 2e-3 -1.8e-4 0.0701 0.0796 0.11492 0.1355 0.0583 0.0727 0.10942 0.14176 0.1659 0.22393 0.043 0.0626 0.14188 0.22128 0.1393 0.2236-5e-4 5.3e-4 -0.0285-0.0261-0.0623-0.0589z" style="paint-order:stroke markers fill"/>
+<path d="m285.07 12.669c-0.0237-0.50043-0.17959-0.99468-0.44813-1.4212-0.0193-0.0307-0.0453-0.0703-0.0578-0.0881-0.0124-0.0177-0.022-0.0328-0.0211-0.0335 8.2e-4 -7.9e-4 0.0201-5e-3 0.0428-0.0106 0.23657-0.0538 0.44726-0.19975 0.58961-0.40836l0.0238-0.0349 7e-3 0.0159c0.0939 0.21905 0.15166 0.45196 0.17623 0.71047 8e-3 0.0799 6e-3 0.29873-2e-3 0.38241-0.03 0.29418-0.10469 0.55605-0.22996 0.80591-0.0259 0.0516-0.071 0.13437-0.0763 0.13983-5.8e-4 5.3e-4 -2e-3 -0.0254-4e-3 -0.0579z" style="paint-order:stroke markers fill"/>
+<path d="m285.47 12.973c0-2e-3 0.0222-0.0444 0.0494-0.0935 0.15869-0.28689 0.26428-0.61559 0.31154-0.96981 0.0184-0.13773 0.021-0.49535 5e-3 -0.62839-0.0378-0.30683-0.11316-0.57644-0.23664-0.84669-0.0164-0.0359-0.0284-0.0668-0.0267-0.0685 2e-3 -2e-3 0.0381-7e-3 0.0807-0.0116 0.19052-0.0208 0.36696-0.0739 0.53644-0.16134 0.36271-0.18712 0.629-0.50732 0.74769-0.89903l0.0272-0.0897 0.0421 0.12687c0.0693 0.20895 0.11102 0.39337 0.1392 0.61469 0.0205 0.16103 0.0206 0.51586 1.5e-4 0.67799-0.0635 0.50382-0.22883 0.94316-0.51035 1.356-0.22082 0.32384-0.53504 0.62348-0.88204 0.84115-0.0887 0.0556-0.2832 0.15996-0.2832 0.1519z" style="paint-order:stroke markers fill"/>
+<path d="m286 13.208c0.53643-0.33615 0.95945-0.79893 1.2458-1.3628 0.25211-0.49656 0.36956-0.99342 0.36941-1.5628-8e-5 -0.36231-0.0354-0.61913-0.1318-0.95911-0.0463-0.16325-0.14719-0.42672-0.21354-0.55765-0.0342-0.0675-0.0371-0.0816-0.015-0.0731 0.0151 6e-3 0.10317 0.027 0.19576 0.0472 0.14376 0.0313 0.21787 0.0366 0.50735 0.0363 0.38292-3.9e-4 0.53456-0.0241 0.8443-0.1319 0.3854-0.13415 0.67621-0.31829 0.97581-0.61789 0.33753-0.33753 0.54307-0.68608 0.66863-1.1338l0.0371-0.13229 0.0439 0.14299c0.20386 0.66333 0.25843 1.4605 0.14868 2.1721-0.30505 1.9779-1.77 3.5877-3.7088 4.0756-0.3239 0.0815-0.79338 0.14937-1.0337 0.14941l-0.0811 2e-5z" style="paint-order:stroke markers fill"/>
+<path d="m287.94 13.978c-0.21569-0.0163-0.61563-0.0613-0.80202-0.0902-0.26555-0.0412-0.71541-0.13153-0.7326-0.14714-7e-3 -7e-3 0.0304-0.0166 0.0838-0.0222 0.0534-6e-3 0.1962-0.0295 0.31738-0.0531 0.85007-0.16575 1.6761-0.55173 2.3737-1.1092 0.23084-0.18445 0.61917-0.57297 0.80821-0.80857 0.66263-0.82588 1.0637-1.8018 1.1859-2.8856 0.0293-0.25993 0.0249-0.87325-8e-3 -1.1493-0.0536-0.44619-0.1642-0.91062-0.30826-1.2942-0.0361-0.096-0.0634-0.17673-0.0607-0.1794 3e-3 -3e-3 0.0902 0.0277 0.19451 0.0675 0.42714 0.16288 0.86765 0.2681 1.3223 0.31583 0.35287 0.0371 0.92053 0.0257 1.265-0.0254 1.6764-0.24845 3.1029-1.2798 3.8618-2.792l0.11044-0.22006 0.0278 0.24486c0.3275 2.8874-0.7429 5.7819-2.8568 7.725-1.4874 1.3672-3.2656 2.1721-5.2897 2.3942-0.22287 0.0245-1.2808 0.045-1.4924 0.029z" style="paint-order:stroke markers fill"/>
+<path d="m292.49 6.1735c-0.0273-4e-3 -0.12031-0.0148-0.20671-0.0245-0.32801-0.0368-0.77971-0.14647-1.088-0.2642-0.0746-0.0285-0.1357-0.058-0.1357-0.0656 0-8e-3 0.0279-0.0228 0.062-0.0337 0.11976-0.0384 0.37765-0.18155 0.51972-0.2885 0.41005-0.30867 0.68919-0.76652 0.78165-1.2821 0.0206-0.11471 0.0268-0.22344 0.0228-0.40023-5e-3 -0.24081-5e-3 -0.24256 0.0282-0.22068 0.31541 0.20698 0.87016 0.43461 1.2904 0.52946 0.41489 0.0937 0.99699 0.12584 1.388 0.0768 0.63693-0.08 1.2192-0.28632 1.7497-0.62009 0.0927-0.0583 0.17082-0.10372 0.17366-0.10093 0.0101 0.01-0.15025 0.31386-0.25663 0.48633-0.25244 0.40928-0.66141 0.87426-1.0301 1.1712-0.66261 0.53364-1.4255 0.86886-2.2738 0.99915-0.20478 0.0315-0.88942 0.0566-1.0253 0.0377z" style="paint-order:stroke markers fill"/>
+<path d="m294.48 3.7607c-0.60499-0.0357-1.1801-0.21315-1.697-0.52355-0.0666-0.04-0.24392-0.15666-0.24392-0.1605 0-9e-4 0.02-0.0117 0.0444-0.024 0.19978-0.10041 0.34995-0.27254 0.42665-0.48906l0.0149-0.0421 0.0474 0.0373c0.46669 0.36738 0.98035 0.6216 1.544 0.76414 0.34124 0.0863 0.65239 0.12493 1.0087 0.12521 0.22146 1.8e-4 0.39291-0.012 0.60296-0.0429 0.0315-5e-3 0.058-8e-3 0.059-7e-3 1e-3 9.6e-4 -0.0317 0.0169-0.0726 0.0355-0.4224 0.19183-0.86833 0.30102-1.3356 0.32705-0.0877 5e-3 -0.31355 5e-3 -0.39894-3.7e-4z" style="paint-order:stroke markers fill"/>
+<path d="m295.95 2.7785c-0.62543-0.01-1.2503-0.18342-1.8013-0.49987-0.10776-0.0619-0.28355-0.17565-0.28144-0.18215 5.3e-4 -1e-3 0.0224-9e-3 0.0488-0.0164 0.24177-0.0695 0.45243-0.22371 0.59215-0.43347 0.0339-0.051 0.0858-0.15142 0.10665-0.20671 9e-3 -0.0227 0.0162-0.0421 0.0169-0.0429 8e-4 -8.7e-4 0.0195 0.015 0.0417 0.0353 0.57779 0.52793 1.3033 0.96142 2.0566 1.2289l0.0896 0.0318-0.0772 0.0153c-0.19999 0.0396-0.40876 0.0633-0.59193 0.0672-0.0512 1e-3 -0.10511 2e-3 -0.11989 3e-3 -0.0148 5.3e-4 -0.0511 5.5e-4 -0.0806 8e-5z" style="paint-order:stroke markers fill"/>
+<path d="m296.64 2.1377c-0.60756-0.25087-1.1513-0.59182-1.6385-1.0274-0.0378-0.0338-0.0686-0.063-0.0686-0.0648 6e-5 -2e-3 0.0209-0.0149 0.0463-0.029 0.13561-0.0751 0.26478-0.20926 0.33455-0.34749 0.0146-0.0289 0.0188-0.0334 0.025-0.0267 4e-3 4e-3 0.0386 0.0449 0.0767 0.0899 0.34297 0.40515 0.7394 0.83663 1.1508 1.2525 0.10899 0.11018 0.19581 0.20026 0.19294 0.20018-3e-3 -8e-5 -0.0565-0.0213-0.11922-0.0472z" style="paint-order:stroke markers fill"/>
+<path d="m296.56 1.3219c-0.25926-0.27407-0.43627-0.46894-0.65264-0.71848-0.15017-0.17319-0.3098-0.36236-0.3098-0.36712 0-2e-3 9e-3 -8e-3 0.0196-0.0132 0.0543-0.0286 0.13529-0.0903 0.1619-0.12331 8e-3 -0.01 0.0136-0.0137 0.0161-0.011 0.0233 0.0251 0.3081 0.43719 0.44139 0.63872 0.18244 0.27586 0.46564 0.7282 0.45966 0.73418-1e-3 1e-3 -0.0624-0.0617-0.13616-0.13972z" style="paint-order:stroke markers fill"/>
+<path d="m297.5 1.5108c-0.23476-0.62779-0.54904-1.2551-0.90883-1.814-0.0163-0.0254-0.0297-0.0471-0.0297-0.0483 0-1e-3 0.0109-5e-3 0.0241-7e-3 0.0133-3e-3 0.0419-0.0112 0.0636-0.0182 0.13452-0.0436 0.25087-0.11985 0.3473-0.22766 0.02-0.0223 0.0211-0.0231 0.0252-0.0175 6e-3 8e-3 0.075 0.15233 0.10557 0.22065 0.2377 0.53191 0.37225 1.0976 0.40183 1.6896 5e-3 0.0907 7e-3 0.29327 4e-3 0.29902-2e-3 4e-3 -0.01-0.0144-0.0331-0.0762z" style="paint-order:stroke markers fill"/>
+<path d="m297.98 1.5928c0.0136-0.81265-0.16471-1.6112-0.52396-2.3471l-0.053-0.10852 0.0131-1e-5c0.0359-4e-5 0.15179-0.0268 0.21363-0.0494 0.051-0.0186 0.14483-0.0657 0.19017-0.0954 0.10148-0.0665 0.19712-0.1596 0.26221-0.25526 0.0112-0.0165 0.0215-0.0299 0.0229-0.0299 3e-3 0 0.0429 0.1061 0.0725 0.19431 0.0972 0.28942 0.15533 0.57493 0.18253 0.8971 9e-3 0.10717 0.0104 0.4252 2e-3 0.52917-0.0241 0.30572-0.0722 0.56184-0.15795 0.84103-0.0523 0.17028-0.12849 0.36343-0.20226 0.51289l-0.0245 0.0496z" style="paint-order:stroke markers fill"/>
+<path d="m298.59 1.4631c2e-3 -4e-3 0.0178-0.0535 0.0361-0.10951 0.20317-0.62477 0.25393-1.306 0.14573-1.9555-0.0584-0.35037-0.16259-0.69626-0.30673-1.0179-0.0195-0.0436-0.0347-0.0801-0.0336-0.0811 1e-3 -1e-3 0.0252-6e-3 0.0536-0.0115 0.19638-0.0366 0.3904-0.15799 0.50438-0.31552l0.0123-0.0171 0.025 0.0638c0.0398 0.10158 0.10217 0.29471 0.131 0.40584 0.18535 0.71463 0.15094 1.4633-0.0992 2.1574-0.10144 0.28151-0.22717 0.53026-0.39821 0.78782-0.0604 0.0909-0.079 0.11562-0.0704 0.0932z" style="paint-order:stroke markers fill"/>
+<path d="m298.53 2.5555c-0.0546-3e-3 -0.12091-6e-3 -0.14742-7e-3l-0.0482-1e-3 0.1191-0.0852c0.36726-0.26267 0.66407-0.55139 0.92815-0.90288 0.48054-0.63956 0.76066-1.3774 0.8318-2.1911 0.0129-0.14799 0.0129-0.51979-1e-4 -0.66972-0.0208-0.24067-0.0643-0.4982-0.12064-0.71454-0.0159-0.061-0.0276-0.1123-0.0259-0.11393 2e-3 -2e-3 0.0472 0.0239 0.10126 0.0567 0.38578 0.23412 0.83288 0.38965 1.3054 0.45413 0.16084 0.0219 0.5232 0.0306 0.69198 0.0166 0.82366-0.0686 1.569-0.41902 2.1403-1.0063 0.0525-0.054 0.11298-0.11857 0.13436-0.1435l0.0389-0.0453v0.0254c0 0.0443-0.0241 0.28378-0.0416 0.41253-0.13134 0.97021-0.51703 1.8986-1.1146 2.683-0.26618 0.34939-0.62118 0.71305-0.96437 0.98788-0.79061 0.63314-1.7354 1.0444-2.7337 1.1901-0.36982 0.0539-0.7612 0.0733-1.0947 0.0541z" style="paint-order:stroke markers fill"/>
+<path d="m301.7-2.0549c-0.0113-1e-3 -0.0494-5e-3 -0.0848-8e-3 -0.48783-0.0463-0.96875-0.2248-1.3824-0.51306l-0.0552-0.0385 0.0473-0.0102c0.27125-0.0584 0.52077-0.23507 0.66929-0.47402 0.0365-0.0587 0.0801-0.15018 0.099-0.20786 8e-3 -0.0233 0.0159-0.0423 0.0183-0.0424 2e-3 -4e-5 0.0142 9e-3 0.0263 0.0196 0.0844 0.0755 0.27301 0.20926 0.40459 0.28705 0.12916 0.0764 0.30781 0.16113 0.45646 0.21658 0.59216 0.22091 1.2502 0.24137 1.855 0.0577 0.038-0.0115 0.0703-0.0196 0.072-0.018 8e-3 8e-3 -0.19066 0.16449-0.31344 0.24642-0.41763 0.27867-0.88082 0.43964-1.3886 0.48257-0.0635 5e-3 -0.37393 7e-3 -0.42387 2e-3z" style="paint-order:stroke markers fill"/>
+<path d="m302.56-3.1215c-0.48871-0.0717-0.93533-0.28303-1.2998-0.61496-0.0122-0.0112-0.0223-0.0205-0.0223-0.0208 0-2.6e-4 0.0104-7e-3 0.023-0.0159 0.0361-0.0242 0.0678-0.0507 0.0964-0.0804l0.0153-0.0159 0.0478 0.0474c0.0496 0.0492 0.0833 0.0807 0.12907 0.12067 0.2994 0.26158 0.65091 0.45781 1.0296 0.57476 0.0185 6e-3 0.0343 0.0106 0.0351 0.0109 5e-3 2e-3 -0.0162-2.9e-4 -0.0541-6e-3z" style="paint-order:stroke markers fill"/>
+<path d="m303.34-3.4523c-0.5215-0.0183-1.012-0.19969-1.4188-0.52479l-0.0245-0.0196 0.0111-4e-3c0.14901-0.054 0.27837-0.15391 0.36925-0.28522l0.0154-0.0223 0.054 0.0534c0.32158 0.31779 0.70314 0.56125 1.1299 0.72095 0.0478 0.0179 0.13646 0.0481 0.17668 0.0601l0.0268 8e-3 -0.0113 1e-3c-0.0812 0.01-0.23397 0.0154-0.32861 0.0121z" style="paint-order:stroke markers fill"/>
+<path d="m303.62-3.9623c-0.31291-0.12014-0.58566-0.28332-0.83302-0.49839-0.0533-0.0464-0.13882-0.12775-0.13633-0.12978 5.3e-4 -4.2e-4 0.0101-6e-3 0.0214-0.0116 0.0583-0.0308 0.12277-0.0816 0.16798-0.13236l0.0199-0.0223 0.0341 0.0426c0.21285 0.26577 0.46431 0.52031 0.71888 0.72767 0.0451 0.0367 0.0459 0.0374 0.0432 0.0373-1e-3 -4e-5 -0.0173-6e-3 -0.0361-0.0132z" style="paint-order:stroke markers fill"/>
+<path d="m304.34-4.3952c-0.12755-0.17263-0.27974-0.38916-0.4147-0.59-0.0601-0.0895-0.17289-0.26156-0.17188-0.26229 2.5e-4 -1.7e-4 9e-3 -2e-3 0.0195-5e-3 0.0811-0.0206 0.16024-0.0589 0.23013-0.11126l0.0245-0.0184 0.0121 0.0286c0.10637 0.25049 0.19661 0.51415 0.26595 0.77698 0.0177 0.0672 0.0492 0.19759 0.048 0.19876-2.6e-4 2.6e-4 -6e-3 -8e-3 -0.0136-0.0173z" style="paint-order:stroke markers fill"/>
+<path d="m304.76-4.6237c-0.079-0.31518-0.1852-0.62935-0.31363-0.92798l-0.0303-0.0705 0.0224-6e-3c0.0772-0.0224 0.16701-0.0707 0.22961-0.12335 0.0102-9e-3 0.0164-0.0126 0.017-0.0109 3e-3 9e-3 0.021 0.0751 0.03 0.11092 0.0845 0.33748 0.10746 0.68726 0.0681 1.0348-7e-3 0.0654-5e-3 0.0661-0.023-7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m305.25-4.9404c-1e-5 -0.10394-7.9e-4 -0.13718-6e-3 -0.21657-0.0183-0.29111-0.0742-0.57788-0.1666-0.85432-7e-3 -0.0209-0.0149-0.0441-0.0176-0.0515l-5e-3 -0.0135 3e-3 -6.9e-4c0.0187-4e-3 0.055-0.0135 0.0691-0.0181 0.0422-0.0137 0.0905-0.0359 0.12701-0.0585l0.019-0.0117 2e-3 8e-3c4e-3 0.0115 0.0193 0.078 0.0268 0.11404 0.026 0.12401 0.0411 0.23994 0.0493 0.37953 2e-3 0.0422 2e-3 0.20241 3e-5 0.24409-0.0104 0.17576-0.0323 0.32098-0.0721 0.47851-7e-3 0.0284-0.0286 0.10617-0.0296 0.10712-1.4e-4 1.3e-4 -2.5e-4 -0.0476-2.5e-4 -0.10597z" style="paint-order:stroke markers fill"/>
+<path d="m305.8-5.6784c-6e-3 -0.11878-0.017-0.22123-0.0349-0.33073-0.0233-0.14321-0.06-0.29435-0.10449-0.4298-3e-3 -0.0104-6e-3 -0.0193-5e-3 -0.0197 5.3e-4 -4.2e-4 5e-3 -2e-3 0.0102-4e-3 0.0137-5e-3 0.03-0.0118 0.0423-0.0175 6e-3 -3e-3 0.0111-5e-3 0.0113-4e-3 2.5e-4 3.9e-4 4e-3 0.014 8e-3 0.0301 0.0666 0.25044 0.0926 0.51922 0.0746 0.77357l-1e-3 0.0176z" style="paint-order:stroke markers fill"/>
+<path d="m305.58-3.9835c0-4e-3 0.031-0.0449 0.0688-0.0914 0.1128-0.13861 0.21931-0.30764 0.31119-0.49385 0.13533-0.27426 0.19836-0.46359 0.25884-0.77758 0.0527-0.27355 0.0515-0.74311-3e-3 -1.0136l-7e-3 -0.0363 0.0684 0.0168c0.0376 9e-3 0.13159 0.0198 0.20876 0.0235 0.28679 0.0137 0.54293-0.0671 0.77349-0.24378l0.0774-0.0593-6e-3 0.22077c-7e-3 0.2428-0.0317 0.41539-0.0908 0.62804-0.12611 0.45446-0.35407 0.85078-0.68286 1.1872-0.23861 0.24414-0.45511 0.40182-0.74928 0.54573-0.17266 0.0845-0.22801 0.10724-0.22801 0.0938z" style="paint-order:stroke markers fill"/>
+<path d="m306.39-3.3353c-0.0611-6e-3 -0.17423-0.0188-0.2514-0.0293-0.22687-0.0308-0.62618-0.12039-0.54471-0.12214 0.0386-8.2e-4 0.38629-0.14983 0.52105-0.22327 0.28564-0.15568 0.50532-0.31884 0.73537-0.54618 0.61033-0.60313 0.94351-1.3945 0.94755-2.2506 5.3e-4 -0.13344 3e-3 -0.24262 4e-3 -0.24263 2e-3 -1e-5 0.0231 0.0126 0.0475 0.028s0.0881 0.05 0.14143 0.0768c0.6931 0.34848 1.5018 0.35321 2.1951 0.0128 0.39697-0.19489 0.7073-0.46464 0.96265-0.83678l0.0722-0.10524-7e-3 0.0819c-0.0401 0.44333-0.10066 0.74595-0.22224 1.1108-0.50895 1.5275-1.7995 2.6619-3.3854 2.9757-0.26697 0.0528-0.46173 0.0716-0.78928 0.0761-0.17364 2e-3 -0.3657-3.2e-4 -0.42679-6e-3z" style="paint-order:stroke markers fill"/>
+<path d="m310.77-1.2336c-0.72408-0.0436-1.2531-0.12281-1.8852-0.28241-0.96405-0.24344-1.9501-0.68177-2.7915-1.2409-0.1438-0.0956-0.25914-0.17603-0.25631-0.17883 3e-3 -3e-3 0.10188 0.0102 0.22012 0.029 0.17735 0.0281 0.29601 0.0343 0.67799 0.0354 0.49585 1e-3 0.64444-0.0125 1.0577-0.0995 1.4334-0.30185 2.6796-1.2574 3.3466-2.566 0.35917-0.70469 0.52211-1.3467 0.54355-2.1417l0.01-0.36094 0.10918 0.10584c0.83441 0.80888 1.8725 1.3015 3.045 1.4448 0.29841 0.0365 0.87412 0.0365 1.1721 1e-4 1.1868-0.14513 2.2513-0.65927 3.0793-1.4873 0.48129-0.4813 0.8443-1.0207 1.126-1.6732l0.0643-0.14883-0.01 0.14056c-0.0162 0.23406-0.0742 0.67076-0.12632 0.95084-0.25476 1.3693-0.83529 2.6899-1.6792 3.8199-0.48365 0.6476-1.1635 1.3277-1.8204 1.8211-1.3816 1.0377-3.011 1.657-4.7583 1.8085-0.20878 0.0181-0.95525 0.0337-1.1245 0.0236z" style="paint-order:stroke markers fill"/>
+<path d="m313.42 0.38755c-1.6557-0.12744-3.0763-0.48741-4.4998-1.1402-0.37137-0.1703-1.0873-0.5508-1.0696-0.56849 6e-3 -6e-3 0.14595 0.0326 0.31065 0.0862 0.5923 0.1927 1.192 0.32536 1.8678 0.4132 0.50687 0.0659 1.8012 0.0604 2.316-0.01 2.0627-0.28119 3.8301-1.1056 5.3517-2.4962 0.15276-0.13961 0.40244-0.3915 0.55484-0.55976 1.3995-1.545 2.228-3.3837 2.467-5.4751 0.0437-0.38248 0.0585-1.3792 0.0261-1.7604l-0.0185-0.21784 0.21727 0.18979c0.53998 0.47165 1.121 0.75996 1.8454 0.91568 0.20337 0.0437 0.3186 0.0524 0.71046 0.0537 0.55074 2e-3 0.76824-0.0309 1.2462-0.18719 0.78151-0.25554 1.5034-0.78999 1.9562-1.4483l0.0643-0.0935-0.0152 0.32741c-0.0308 0.66127-0.12199 1.3696-0.25898 2.0112-0.6722 3.1482-2.4799 5.875-5.1206 7.7243-1.732 1.2129-3.7426 1.9557-5.9401 2.1945-0.31012 0.0337-1.7296 0.0625-2.0112 0.0409z" style="paint-order:stroke markers fill"/>
+<path d="m316.84 2.3325c-0.78381-0.0531-1.3244-0.11464-1.941-0.22076-2.1041-0.36213-4.1106-1.1238-5.9358-2.2531-0.11982-0.0742-0.21294-0.13971-0.20694-0.14571s0.12122 0.0371 0.25604 0.0958c1.0219 0.44499 2.1945 0.77543 3.3192 0.93534 0.70636 0.10044 0.99337 0.1187 1.8659 0.1187 0.84592 0 1.1491-0.0183 1.789-0.10774 5.0708-0.70904 9.247-4.2931 10.707-9.1888 0.32555-1.0917 0.48955-2.1087 0.5432-3.3687l0.0155-0.36415 0.17799 0.174c0.76463 0.74745 1.7158 1.2145 2.7948 1.3723 0.33415 0.0489 0.99692 0.0485 1.3499-7.2e-4 0.85819-0.11969 1.6995-0.47513 2.3718-1.0021 0.077-0.0603 0.14344-0.0992 0.14769-0.0865 0.021 0.0631-0.22506 1.2494-0.36919 1.7797-0.67185 2.4721-1.8947 4.7506-3.5772 6.665-0.29943 0.34072-0.99982 1.0463-1.3541 1.3641-2.7965 2.5087-6.2905 3.9733-10.079 4.2248-0.31942 0.0212-1.6018 0.027-1.8749 8e-3z" style="paint-order:stroke markers fill"/>
+<path d="m330.52-11.055c-0.57497-0.049-1.1878-0.22805-1.6995-0.49665-0.435-0.22832-0.89521-0.57705-1.1866-0.89915l-0.0741-0.0819 0.21727-1e-3c0.38368-2e-3 0.70674-0.0802 1.0416-0.2512 0.50489-0.25781 0.91386-0.70605 1.122-1.2297l0.0268-0.0674 0.076 0.13661c0.10429 0.18753 0.16257 0.27698 0.29587 0.45413 0.54453 0.72363 1.3469 1.2315 2.233 1.4133 0.2894 0.0594 0.41464 0.071 0.76942 0.0714l0.33098 3.2e-4 -0.0328 0.0268c-0.0815 0.0667-0.30327 0.21778-0.44087 0.30041-0.57463 0.34504-1.2177 0.55541-1.8944 0.61974-0.19919 0.0189-0.58878 0.0212-0.78448 5e-3z" style="paint-order:stroke markers fill"/>
+<path d="m333.11-12.464c-1.1884-0.0827-2.2467-0.8065-2.7556-1.8847-0.0199-0.0421-0.0356-0.077-0.035-0.0777 5.3e-4 -6.5e-4 0.0222 3e-3 0.0481 7e-3 0.27062 0.0487 0.55637-0.0275 0.75794-0.2023l0.0205-0.0178 4e-3 0.0119c0.0107 0.034 0.0703 0.18281 0.1007 0.25123 0.17717 0.3992 0.42896 0.7706 0.73707 1.0872 0.33002 0.33911 0.74132 0.62275 1.1763 0.8112l0.0413 0.0179-0.0227-4.5e-4c-0.0125-2.4e-4 -0.0451-2e-3 -0.0724-4e-3z" style="paint-order:stroke markers fill"/>
+<path d="m332.28-13.641c-0.14172-0.14464-0.31072-0.36614-0.42809-0.56108-0.0891-0.14796-0.17398-0.31965-0.23845-0.48219-0.0271-0.0684-0.0739-0.19855-0.0719-0.1998 5.3e-4 -3.6e-4 0.016-3e-3 0.0341-5e-3 0.0182-3e-3 0.0484-9e-3 0.0672-0.0146l0.0341-0.01 8e-3 0.0294c0.0398 0.14005 0.12551 0.37609 0.1877 0.51718 0.10346 0.23469 0.25916 0.50488 0.41019 0.71179 0.0192 0.0263 0.0343 0.0485 0.0335 0.0493s-0.0173-0.0148-0.0368-0.0346z" style="paint-order:stroke markers fill"/>
+<path d="m333.5-13.093c-0.49952-0.34644-0.88812-0.79481-1.1514-1.3285-0.0663-0.13429-0.15842-0.35344-0.15154-0.36032 1e-3 -1e-3 0.0176-2.3e-4 0.0363 2e-3 0.0488 7e-3 0.15293 6e-3 0.20652-2e-3 0.0857-0.0119 0.16504-0.0368 0.24455-0.0767l0.0485-0.0243 5e-3 0.0175c0.16461 0.63769 0.43257 1.2296 0.7944 1.7549 0.0223 0.0324 0.0406 0.0599 0.0406 0.061 0 5e-3 -0.0106-1e-3 -0.0724-0.0441z" style="paint-order:stroke markers fill"/>
+<path d="m333.86-13.436c-0.30017-0.45632-0.51645-0.934-0.65991-1.4575-0.01-0.0349-0.0174-0.0646-0.0174-0.066 0-1e-3 0.0266-3e-3 0.0592-2e-3 0.0326 1e-5 0.0717-2e-3 0.087-4e-3 0.0721-9e-3 0.14527-0.0295 0.20728-0.0571 0.0167-7e-3 0.031-0.0129 0.0317-0.0122 7.9e-4 7.2e-4 0.01 0.055 0.0198 0.12062 0.0758 0.48935 0.16765 0.94367 0.28671 1.4184 0.0167 0.0666 0.0298 0.12168 0.029 0.12242-7.9e-4 7.4e-4 -0.0203-0.0274-0.0434-0.0626z" style="paint-order:stroke markers fill"/>
+<path d="m334.11-14.536c-0.0294-0.15914-0.0567-0.32102-0.0818-0.48594-0.01-0.0659-0.0316-0.21738-0.031-0.21793 2.6e-4 -2.5e-4 7e-3 -1e-3 0.0139-2e-3 0.013-1e-3 0.0352-4e-3 0.0451-6e-3l5e-3 -9e-4 5.3e-4 8e-3c2.7e-4 4e-3 3e-3 0.0362 6e-3 0.0709 0.0102 0.12382 0.0195 0.2437 0.0284 0.36535 0.01 0.13381 0.0215 0.30289 0.0209 0.30343-1.5e-4 1.6e-4 -3e-3 -0.0156-7e-3 -0.035z" style="paint-order:stroke markers fill"/>
+<path d="m334.73-13.196c-3e-5 -6e-3 3e-3 -0.0601 6e-3 -0.11986 0.0186-0.34729 0.022-0.49007 0.022-0.91557 0-0.36204-2e-3 -0.45878-0.0103-0.66942-7e-3 -0.17852-7e-3 -0.16628-1e-3 -0.16435 3e-3 9.6e-4 0.0197 7e-3 0.037 0.0136 0.0645 0.0244 0.1299 0.04 0.20386 0.0485 0.0572 7e-3 0.16269 5e-3 0.21778-4e-3 0.0411-7e-3 0.0944-0.019 0.13143-0.0307 0.0128-4e-3 0.0236-7e-3 0.0241-7e-3 5.3e-4 4.3e-4 -2e-3 0.0231-5e-3 0.0503-0.0727 0.61406-0.27176 1.2073-0.58394 1.7406-0.0136 0.0233-0.0285 0.0483-0.0331 0.0555l-8e-3 0.0132z" style="paint-order:stroke markers fill"/>
+<path d="m335.16-13.034c0.1006-0.17186 0.2123-0.39704 0.29327-0.59123 0.18157-0.43542 0.30205-0.90965 0.35091-1.3812 4e-3 -0.0418 8e-3 -0.0764 9e-3 -0.0769 2.6e-4 -4.7e-4 0.0104 3e-3 0.0222 8e-3 0.0764 0.0303 0.16595 0.051 0.2551 0.0592 0.0467 4e-3 0.15784 2e-3 0.19987-4e-3 0.0924-0.0138 0.18039-0.039 0.25177-0.0721 0.0135-6e-3 0.0252-0.0114 0.026-0.0114 2e-3 0-2e-3 0.0226-0.017 0.0882-0.17644 0.76512-0.61909 1.441-1.2514 1.9108-0.0473 0.0352-0.15781 0.11163-0.16128 0.11163-8e-4 0 9e-3 -0.0181 0.022-0.0402z" style="paint-order:stroke markers fill"/>
+<path d="m335.62-12.779c0.16574-0.12295 0.3837-0.32756 0.54253-0.50928 0.40697-0.46566 0.69556-1.0326 0.83248-1.6356 0.022-0.0968 0.0453-0.2231 0.056-0.30305l4e-3 -0.0268 0.0179 0.0102c0.0704 0.0403 0.16682 0.0769 0.25175 0.0956 0.14647 0.0322 0.31037 0.0235 0.45822-0.0244 0.0384-0.0124 0.0431-0.0134 0.0431-9e-3 0 0.0103-0.0436 0.17773-0.0624 0.23959-0.0939 0.3093-0.22743 0.59224-0.40686 0.86236-0.37157 0.55942-0.90528 0.98882-1.5337 1.2339-0.0633 0.0247-0.20134 0.0729-0.20821 0.0727-2e-3 -5e-5 5.3e-4 -3e-3 5e-3 -7e-3z" style="paint-order:stroke markers fill"/>
+<path d="m336.42-12.618c5e-3 -3e-3 0.0408-0.0242 0.08-0.0465 0.19856-0.1132 0.39457-0.25263 0.58654-0.41722 0.0907-0.0778 0.29711-0.28639 0.38247-0.3866 0.4175-0.49004 0.69417-1.061 0.82173-1.6956 0.0129-0.0643 0.0235-0.12417 0.0236-0.13301 2e-5 -9e-3 1e-3 -0.0161 3e-3 -0.0161 1e-3 0 0.0228 8e-3 0.0477 0.0181 0.10479 0.042 0.22524 0.0617 0.34098 0.0559 0.0643-3e-3 0.13638-0.0136 0.17079-0.0245 0.0134-4e-3 0.0132-3e-3 -0.0224 0.14015-0.24726 0.99598-0.92299 1.8319-1.8463 2.284-0.15745 0.0771-0.28329 0.12861-0.44105 0.18056-0.12435 0.0409-0.16246 0.0516-0.14652 0.0408z" style="paint-order:stroke markers fill"/>
+<path d="m337.88-11.177c-0.0225-1e-3 -0.0843-5e-3 -0.13739-8e-3 -0.76959-0.0491-1.5255-0.27743-2.1938-0.66266-0.0898-0.0518-0.24891-0.15046-0.27852-0.17279-0.0114-9e-3 2.6e-4 -9e-3 0.14985-7e-3 0.29437 4e-3 0.55315-0.0203 0.83748-0.078 1.3492-0.27358 2.4644-1.242 2.9225-2.5379 0.0226-0.0641 0.0488-0.14153 0.0581-0.17208l0.0169-0.0555 0.0169 0.0284c0.20322 0.34111 0.4894 0.63546 0.82665 0.85026 0.58029 0.36961 1.2984 0.48707 1.9703 0.32229 0.10824-0.0265 0.26937-0.0789 0.36394-0.11817 0.0346-0.0144 0.0628-0.0242 0.0628-0.0219 0 2e-3 -0.0232 0.0448-0.0516 0.0943-0.39118 0.68276-0.93783 1.2672-1.5883 1.6982-0.73848 0.48923-1.5514 0.76498-2.4555 0.83294-0.0835 6e-3 -0.44619 0.012-0.52034 8e-3z" style="paint-order:stroke markers fill"/>
+</g>
+</g>
+</svg>
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/crossratio.svg b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/crossratio.svg
new file mode 100644
index 00000000000..4962a10b947
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/crossratio.svg
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<svg width="101.21mm" height="66.077mm" version="1.1" viewBox="0 0 101.21 66.077" xmlns="http://www.w3.org/2000/svg" xmlns:cc="http://creativecommons.org/ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
+<metadata>
+<rdf:RDF>
+<cc:Work rdf:about="">
+<dc:format>image/svg+xml</dc:format>
+<dc:type rdf:resource="http://purl.org/dc/dcmitype/StillImage"/>
+<dc:title/>
+</cc:Work>
+</rdf:RDF>
+</metadata>
+<rect transform="translate(-40.11 -85.557)" x="39.361" y="84.559" width="102.57" height="67.883" fill="#fff" stroke="#fc0000" stroke-width=".076"/>
+<g transform="translate(-40.11 -85.557)">
+<g transform="translate(-222.6 -102.73)">
+<path d="m290.76 200.99c0.23897 0.10881 0.47294 0.22844 0.71112 0.33916 0.96647 0.4399 1.8833 0.97407 2.7836 1.5345 1.7141 1.0938 3.2526 2.4274 4.753 3.792 2.0394 1.854 3.7696 3.9665 5.4172 6.166 1.796 2.4517 3.3422 5.0693 4.7851 7.74 1.4129 2.6116 2.5253 5.3648 3.5464 8.148 0.86154 2.4209 1.626 4.8747 2.3834 7.3297 0.48988 1.5675 0.94716 3.1445 1.2767 4.7538 9e-3 0.0217-0.29811 0.14886-0.3071 0.12715-0.11909-0.25623-0.2463-0.50883-0.3573-0.76868-0.53006-1.241-0.91273-2.5394-1.3483-3.8146-0.79597-2.4282-1.5938-4.8563-2.4668-7.2582-1.0234-2.7444-2.1272-5.4614-3.5025-8.052-1.418-2.6459-2.9265-5.2463-4.6713-7.693-1.5841-2.1903-3.2492-4.3296-5.1839-6.2258-1.4403-1.3916-2.9273-2.742-4.5722-3.8913-0.86632-0.59371-1.7525-1.155-2.6607-1.6827-0.22235-0.14171-0.45664-0.27408-0.64658-0.45946-6e-3 -4e-3 0.0542-0.0889 0.0602-0.0846z" fill="#5050dc" style="paint-order:stroke markers fill"/>
+<path d="m290.87 200.92c0.1779 0.0806 0.36568 0.12478 0.55748 0.15672 0.69506 0.0741 1.3964 0.0625 2.0946 0.0691 1.2986 0.0158 2.597 0.0365 3.8957 0.0412 1.9038 0.0267 3.805-0.0717 5.7042-0.19057 2.7086-0.18588 5.4146-0.40701 8.1204-0.62991 3.2528-0.26129 6.5009-0.5757 9.7446-0.93175 3.0094-0.33488 6.0106-0.73644 9.0045-1.1883 2.2585-0.34334 4.5109-0.72513 6.7609-1.1198 1.6127-0.28436 3.2233-0.57987 4.834-0.87534 1.113-0.21079 2.2244-0.42969 3.3398-0.62789 0.76676-0.14634 1.5398-0.25849 2.3161-0.34031 0.41442-0.0307 0.21075-9e-3 0.61117-0.0642 8e-3 -2.6e-4 0.014 0.11768 6e-3 0.11807-0.39978 0.11211-0.19791 0.0492-0.60521 0.19004-0.75919 0.23816-1.5269 0.45033-2.3037 0.6233-1.1091 0.26094-2.2236 0.49779-3.341 0.72081-1.6106 0.33502-3.2216 0.6683-4.8349 0.99061-2.2545 0.44834-4.5109 0.88957-6.7794 1.2622-3.0051 0.48032-6.016 0.92869-9.0403 1.2722-3.2502 0.35794-6.5062 0.66073-9.7687 0.88278-2.7078 0.18911-5.4166 0.3703-8.129 0.48243-1.9082 0.066-3.8183 0.10359-5.7268 0.0222-1.2927-0.0575-2.585-0.12461-3.8779-0.17868-0.71125-0.0361-1.4312-0.0551-2.1287-0.21084-0.20839-0.0609-0.42754-0.11968-0.6023-0.25459-0.0156-0.0105 0.13327-0.22987 0.14878-0.21935z" style="paint-order:stroke markers fill"/>
+<path d="m347.73 195.51c-0.13067 0.10558-0.26087 0.21172-0.389 0.32043-0.32006 0.27339-0.62534 0.56345-0.93101 0.8528-0.59276 0.57336-1.182 1.1504-1.7767 1.7216-0.92283 0.89032-1.8548 1.771-2.7865 2.6519-1.2227 1.1458-2.3986 2.3402-3.5674 3.5411-1.2517 1.2851-2.4927 2.5806-3.728 3.8816-1.3156 1.375-2.5572 2.8168-3.7577 4.2937-1.145 1.4202-2.2341 2.8843-3.3004 4.3649-1.0204 1.4316-2.0433 2.8616-3.031 4.3164-0.88861 1.3085-1.6887 2.6736-2.4561 4.0565-0.67046 1.2228-1.3027 2.4661-1.913 3.7202-0.49652 1.0104-0.92381 2.052-1.3139 3.1079-0.29235 0.81558-0.55781 1.6406-0.81374 2.4684-0.19838 0.64231-0.38738 1.2876-0.56113 1.9371-0.13811 0.51717-0.25559 1.0396-0.36829 1.5628-0.0797 0.38609-0.16624 0.77066-0.24971 1.1559-0.0562 0.27223-0.11441 0.544-0.18421 0.81308-0.0599 0.19109-0.0985 0.38909-0.21431 0.55498-0.0173 0.0229-0.0345 0.0457-0.0518 0.0686 1.5e-4 2e-3 -0.026 4e-3 -0.0262 2e-3 -0.0154-0.0221-0.0308-0.0442-0.0461-0.0661-0.0833-0.18346-0.0321-0.37923-0.0164-0.57375 0.0378-0.27312 0.0878-0.54414 0.13939-0.81493 0.0702-0.38714 0.13695-0.77494 0.21549-1.1605 0.10659-0.53002 0.21749-1.0594 0.34842-1.584 0.16938-0.65422 0.35253-1.3046 0.5415-1.9533 0.24564-0.83593 0.49532-1.6709 0.77699-2.4954 0.37282-1.0749 0.78528-2.1357 1.2705-3.165 0.59419-1.269 1.2143-2.5257 1.8777-3.7597 0.76089-1.4017 1.5528-2.7873 2.4381-4.1142 0.9795-1.4685 1.9939-2.9126 3.0401-4.3339 1.0826-1.4791 2.1646-2.9595 3.3036-4.3955 1.2054-1.4947 2.4563-2.952 3.8026-4.3211 1.3169-1.3648 2.6506-2.7129 3.9855-4.0598 1.1864-1.1828 2.3828-2.3557 3.6251-3.4794 0.94255-0.85518 1.8935-1.7008 2.8402-2.5514 0.60678-0.54749 1.2126-1.0963 1.8302-1.6314 0.31798-0.27302 0.63784-0.54432 0.97209-0.79709 0.13516-0.10147 0.27053-0.20434 0.41754-0.28806 0.0108-4e-3 0.0682 0.14789 0.0575 0.15197z" style="paint-order:stroke markers fill"/>
+<path d="m291.03 200.92c0.0571 0.19348 0.0768 0.39542 0.10051 0.59497 0.0893 0.72837 0.0109 1.4584-0.0835 2.1815-0.2063 1.3833-0.60947 2.7252-1.0341 4.0542-0.60028 1.8187-1.3133 3.597-2.0479 5.3648-0.82233 1.9765-1.7441 3.9086-2.6986 5.824-0.87437 1.7432-1.8212 3.4483-2.799 5.1352-0.81348 1.3885-1.6491 2.7638-2.469 4.1486-0.59018 1.0102-1.1961 2.0108-1.8371 2.9896-0.23632 0.37497-0.50826 0.72519-0.77581 1.0778-4e-3 0.0106-0.15338-0.0415-0.1497-0.0521 0.18272-0.38597 0.36142-0.77448 0.57428-1.1452 0.55401-1.0167 1.1216-2.0258 1.6955-3.0314 0.79116-1.3905 1.572-2.7869 2.3586-4.1799 0.94387-1.6891 1.8784-3.3842 2.7321-5.1212 0.93938-1.9104 1.8524-3.834 2.6963-5.7888 0.75258-1.7524 1.4864-3.5137 2.1338-5.3082 0.46027-1.3016 0.9045-2.613 1.173-3.9702 0.13102-0.70043 0.25503-1.4082 0.24458-2.1236-7e-3 -0.20691-0.0266-0.41709 9e-3 -0.62238-3e-3 -0.0125 0.17511-0.0402 0.17706-0.0276z" style="paint-order:stroke markers fill"/>
+<path d="m277.18 232.11c0.24487-0.12718 0.51645-0.18852 0.78204-0.25312 0.82983-0.18298 1.6769-0.26529 2.5215-0.34039 1.3582-0.13407 2.7223-0.1322 4.0852-0.12033 1.9185-5e-3 3.8337 0.10788 5.7448 0.26931 2.1715 0.18473 4.3149 0.58509 6.4442 1.0427 1.8536 0.40269 3.6775 0.9277 5.4859 1.5012 1.3902 0.44253 2.7513 0.97056 4.1047 1.5163 0.98635 0.41016 1.9747 0.81544 2.9634 1.2197 0.75064 0.29979 1.4942 0.61692 2.229 0.95486 0.5505 0.25786 1.0949 0.52876 1.6379 0.80246 0.40403 0.20311 0.80753 0.40702 1.2057 0.62168 0.30082 0.1652 0.59596 0.34141 0.8809 0.53354 0.20193 0.14174 0.40001 0.28875 0.59753 0.43671 0.15374 0.0946 0.26674 0.2264 0.37524 0.3683 0.0577 0.0859 0.0333 0.0397 0.0721 0.13915 3e-3 1e-3 -0.0144 0.0226-0.0157 0.0214-0.10503-5e-3 -0.0539 2e-3 -0.15347-0.0205-0.17268-0.0466-0.33858-0.10057-0.48672-0.20698-0.21035-0.1238-0.41972-0.24947-0.6329-0.36813-0.28869-0.16789-0.5737-0.34271-0.87123-0.49435-0.39959-0.20504-0.80573-0.39638-1.2099-0.59185-0.54402-0.26108-1.0878-0.52293-1.6396-0.7668-0.73533-0.32151-1.4791-0.62207-2.2312-0.90074-0.99984-0.37818-1.9959-0.76661-2.9965-1.1425-1.3548-0.50833-2.7156-1.0016-4.0974-1.43-1.797-0.54763-3.6093-1.045-5.4494-1.4216-2.1087-0.429-4.2287-0.80977-6.3712-1.018-1.8903-0.18117-3.7842-0.31191-5.6798-0.42162-1.3395-0.0583-2.6818-0.0984-4.022-0.038-0.82717 0.0496-1.655 0.10592-2.4765 0.21906-0.2517 0.0403-0.50152 0.0885-0.74881 0.15106-0.0182 3e-3 -0.0658-0.25901-0.0475-0.26242z" style="paint-order:stroke markers fill"/>
+<ellipse transform="rotate(22.62)" cx="346.1" cy="73.888" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse transform="rotate(22.62)" cx="345.32" cy="107.8" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse transform="rotate(22.62)" cx="384.8" cy="100.76" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse transform="rotate(22.62)" cx="396.38" cy="46.565" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<g transform="translate(231.28 151.03)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m496.66 409.87v0.71l-0.02 0.68-0.03 0.66-0.04 0.64-0.06 0.62-0.07 0.6-0.09 0.57-0.11 0.56-0.13 0.55-0.15 0.53-0.17 0.51-0.19 0.5-0.21 0.49-0.24 0.48-0.26 0.47-0.14 0.23-0.15 0.23c-1.08 1.61-3.23 3-6.03 3v-0.98c1.89 0 3.7-1.14 4.33-3.17 0.56-1.88 0.59-4.39 0.59-7.43 0-2.57 0-5.15-0.45-7.34-0.7-3.17-3.06-3.94-4.47-3.94-1.59 0-3.72 0.94-4.42 3.8-0.49 2.05-0.49 4.91-0.49 7.48 0 2.55 0 5.21 0.52 7.11 0.73 2.75 2.97 3.49 4.39 3.49v0.98c-8.08 0-8.08-9.51-8.08-12.03 0-2.5 0-11.81 8.08-11.81 8.09 0 8.09 9.31 8.09 11.81z"/></g>
+</g>
+<g transform="translate(267.87 94.212)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m490.35 420.92v0.35l-0.01 0.03v0.09l-0.01 0.03v0.05l-0.01 0.03v0.02l-0.01 0.03v0.02l-0.02 0.04-0.01 0.04-0.08 0.12-0.09 0.06-0.08 0.02-0.05 0.02h-0.04l-0.03 0.01h-0.03l-0.02 0.01h-0.12l-0.04 0.01h-0.4c-2.23-2.2-5.39-2.23-6.82-2.23v-1.25c0.84 0 3.14 0 5.04 0.97v-17.77c0-1.16 0-1.61-3.48-1.61h-1.31v-1.25c0.62 0.03 4.9 0.14 6.2 0.14 1.08 0 5.47-0.11 6.23-0.14v1.25h-1.32c-3.49 0-3.49 0.45-3.49 1.61z"/></g>
+</g>
+<g transform="translate(193.98 93.995)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m496.27 405.11h-1.18c-0.1-0.77-0.46-2.83-0.91-3.18-0.27-0.2-2.95-0.2-3.44-0.2h-6.42c3.66 3.23 4.88 4.2 6.97 5.84 2.58 2.07 4.98 4.22 4.98 7.54 0 4.21-3.68 6.79-8.15 6.79-4.32 0-7.25-3.03-7.25-6.23 0-1.78 1.5-1.96 1.86-1.96 0.82 0 1.84 0.6 1.84 1.85 0 0.62-0.25 1.84-2.06 1.84 1.08 2.47 3.45 3.24 5.09 3.24 3.49 0 5.3-2.71 5.3-5.53 0-3.04-2.16-5.44-3.28-6.69l-8.39-8.3c-0.36-0.31-0.36-0.39-0.36-1.36h14.36z"/></g>
+</g>
+<g transform="translate(177.91 139.86)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m488.2 410.4h0.25l0.25-0.02 0.24-0.03 0.24-0.04 0.23-0.05 0.23-0.06 0.22-0.07 0.21-0.08 0.21-0.1 0.2-0.1 0.2-0.12 0.19-0.12 0.18-0.14 0.17-0.15 0.17-0.16 0.16-0.17 0.15-0.18 0.14-0.19 0.14-0.2 0.13-0.22 0.11-0.22 0.11-0.24 0.1-0.24 0.09-0.26 0.08-0.27 0.07-0.28 0.06-0.29 0.05-0.3 0.04-0.31 0.02-0.32 0.02-0.33 0.01-0.35c0-4.33-2.52-5.61-4.53-5.61-1.39 0-4.47 0.38-5.93 2.44 1.63 0.06 2.02 1.22 2.02 1.95 0 1.11-0.84 1.91-1.92 1.91-0.97 0-1.96-0.59-1.96-2.02 0-3.28 3.63-5.4 7.85-5.4 4.84 0 8.19 3.25 8.19 6.73 0 2.72-2.22 5.44-6.07 6.24 3.66 1.33 4.99 3.93 4.99 6.06 0 2.75-3.17 4.81-7.03 4.81-3.88 0-6.83-1.89-6.83-4.67 0-1.19 0.76-1.84 1.81-1.84 1.08 0 1.77 0.79 1.77 1.76 0 1.02-0.69 1.75-1.77 1.81 1.22 1.55 3.61 1.93 4.91 1.93 1.56 0 3.76-0.77 3.76-3.8 0-1.47-0.48-3.06-1.39-4.14-1.15-1.33-2.12-1.41-3.87-1.5-0.88-0.08-0.94-0.08-1.11-0.11-0.08 0-0.36-0.06-0.36-0.45 0-0.49 0.31-0.49 0.9-0.49z"/></g>
+</g>
+<g transform="translate(225.58 116.93)" fill="#5050dc">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill="#5050dc" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m483.07 442.17-0.46-0.38-0.46-0.36-0.47-0.35-0.47-0.33-0.47-0.31-0.48-0.29-0.48-0.27-0.48-0.25-0.48-0.22-0.48-0.2-0.24-0.08-0.24-0.09-0.25-0.07-0.24-0.07-0.24-0.06-0.48-0.1-0.24-0.04-0.24-0.02-0.24-0.03-0.24-0.01h-0.24c-1.99 0-3.44 0.84-5.17 1.84-1.46 0.84-3 1.69-4.99 1.69-1.25 0-2.54-0.39-3.64-0.89-1-0.5-2-1.05-2.84-1.75l-2.69-2.19 0.7-0.84c2.44 2.03 5.08 3.53 7.61 3.53 2 0 3.46-0.85 5.19-1.85 1.45-0.84 2.99-1.68 4.99-1.68 1.25 0 2.54 0.39 3.64 0.89 0.98 0.5 1.98 1.04 2.82 1.75l2.71 2.18z"/><path d="m464.83 417.71 0.14 0.01h0.5l0.19 0.01h0.2l0.21 0.01 0.44 0.02 0.23 0.01 0.24 0.01 0.75 0.06 0.53 0.05 0.53 0.07 0.55 0.07 0.54 0.1 0.54 0.11 0.54 0.12 0.26 0.07 0.26 0.08 0.5 0.16 0.24 0.09 0.24 0.1c3.48 1.5 3.73 4.43 3.73 5.12 0 2.2-1.89 4.23-5.33 4.23v-1.09c2.35 0 3.69-1.44 3.69-3.14 0-5.17-7.97-5.17-10.01-5.17h-2.05c1.95 7.56 7.08 8.31 8.37 8.31v1.09c-5.53 0-13.04-4.82-13.04-13.54 0-5.08 2.93-9.02 7.81-9.02 7.12 0 11.31 5.28 11.31 5.88 0 0.29-0.3 0.65-0.59 0.65-0.25 0-0.35-0.11-0.66-0.5-3.94-4.93-9.36-4.93-9.95-4.93-3.89 0-4.35 4.18-4.35 5.78 0 0.59 0.05 2.14 0.8 5.18z"/></g>
+</g>
+</g>
+</g>
+</svg>
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/demo-output.png b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/demo-output.png
new file mode 100644
index 00000000000..48b7bca18eb
Binary files /dev/null and b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/demo-output.png differ
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/header.svg b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/header.svg
new file mode 100644
index 00000000000..bd7d98ab9ec
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/header.svg
@@ -0,0 +1,4137 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<svg width="509.23mm" height="100.65mm" version="1.1" viewBox="0 0 509.23 100.65" xmlns="http://www.w3.org/2000/svg" xmlns:cc="http://creativecommons.org/ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
+<metadata>
+<rdf:RDF>
+<cc:Work rdf:about="">
+<dc:format>image/svg+xml</dc:format>
+<dc:type rdf:resource="http://purl.org/dc/dcmitype/StillImage"/>
+<dc:title/>
+</cc:Work>
+</rdf:RDF>
+</metadata>
+<rect x="-1.7977" y="-2.397" width="513.55" height="104.87" fill="#fff" stroke="#fc0000" stroke-width=".076"/>
+<g fill="none" stroke="#000" stroke-width=".3">
+<path d="m334.17 81.047a14.087 14.087 0 0 0-16.72-0.25313"/>
+<path d="m317.45 80.794a4.8425 4.8425 0 0 0-2.0861-8.1308"/>
+<path d="m315.37 72.663a15.953 15.953 0 0 1 18.806 8.384"/>
+<path d="m310.1 50.497a13.12 13.12 0 0 1 5.2639 22.166"/>
+<path d="m315.37 72.663a8.3836 8.3836 0 0 0-6.2967-13.554"/>
+<path d="m309.07 59.109a5.3946 5.3946 0 0 0 1.0328-8.612"/>
+<path d="m308.22 39.595a8.4957 8.4957 0 0 0 9.855-7.443"/>
+<path d="m318.07 32.152a9.0837 9.0837 0 0 1-10.044 9.4206"/>
+<path d="m308.03 41.572a1.1593 1.1593 0 0 0 0.18922-1.9776"/>
+<path d="m350.24 2.3075a7.4202 7.4202 0 0 0 13.366 1.5209"/>
+<path d="m363.61 3.8284a11.842 11.842 0 0 1-20.388 2.5488"/>
+<path d="m343.22 6.3772a5.189 5.189 0 0 0 7.022-4.0698"/>
+<path d="m386.47 90.219a0.84504 0.84504 0 0 0-1.2689 0.99902"/>
+<path d="m385.2 91.218a2.2243 2.2243 0 0 1 1.8421-3.3293"/>
+<path d="m387.04 87.889a1.7851 1.7851 0 0 0-0.57321 2.3303"/>
+<path d="m306.85 49.045a0.72449 0.72449 0 0 0-0.0974-1.3738"/>
+<path d="m306.76 47.671a3.832 3.832 0 0 1 3.3493 2.8256"/>
+<path d="m310.1 50.497a5.3946 5.3946 0 0 0-3.2519-1.4518"/>
+<path d="m369.86 94.616a4.16 4.16 0 0 0-3.7107 4.7444"/>
+<path d="m366.15 99.361a1.9252 1.9252 0 0 0-3.3114-0.6746"/>
+<path d="m362.83 98.686a5.189 5.189 0 0 1 7.022-4.0698"/>
+<path d="m318.07 32.152a8.4957 8.4957 0 0 0-3.7437-8.0117"/>
+<path d="m314.33 24.14a1.9148 1.9148 0 0 0 2.6647-2.1895"/>
+<path d="m317 21.951a8.0983 8.0983 0 0 1 1.079 10.201"/>
+<path d="m404.01 41.885a2.4743 2.4743 0 0 0 2.0732 3.8365"/>
+<path d="m406.08 45.721a3.832 3.832 0 0 0-3.106 4.7755"/>
+<path d="m402.97 50.497a5.3946 5.3946 0 0 1 1.0328-8.612"/>
+<path d="m395 68.842a8.4957 8.4957 0 0 1 9.855-7.443"/>
+<path d="m404.86 61.399a2.263 2.263 0 0 0-1.5609 3.9305"/>
+<path d="m403.3 65.329a8.0983 8.0983 0 0 0-8.2941 3.5125"/>
+<path d="m349.47 97.165a7.4202 7.4202 0 0 1 13.366 1.5209"/>
+<path d="m362.83 98.686a4.1936 4.1936 0 0 0-7.7449 0.71638"/>
+<path d="m355.09 99.402a3.7734 3.7734 0 0 0-5.6211-2.2373"/>
+<path d="m395.62 20.2a14.087 14.087 0 0 1-16.72-0.25312"/>
+<path d="m378.9 19.947a14.212 14.212 0 0 0 15.493-1.2591"/>
+<path d="m394.4 18.688a1.1293 1.1293 0 0 0 1.2265 1.5122"/>
+<path d="m338.99 96.752a14.087 14.087 0 0 0-4.8183-15.705"/>
+<path d="m334.17 81.047a14.212 14.212 0 0 1 6.922 16.254"/>
+<path d="m341.1 97.3a1.2674 1.2674 0 0 0-2.1036-0.54836"/>
+<path d="m323.03 13.54a1.9129 1.9129 0 0 0 3.0105-0.43524"/>
+<path d="m326.04 13.104a2.062 2.062 0 0 1-3.3297 0.80051"/>
+<path d="m322.71 13.905a0.28072 0.28072 0 0 0 0.31924-0.36527"/>
+<path d="m347.78 99.481a0.60488 0.60488 0 0 0-1.1478-0.09373"/>
+<path d="m346.63 99.387a2.9141 2.9141 0 0 1 2.8362-2.2222"/>
+<path d="m349.47 97.165a3.7734 3.7734 0 0 0-1.6884 2.3159"/>
+<path d="m400.53 27.215a0.5269 0.5269 0 0 0 0.57963 0.81379"/>
+<path d="m401.11 28.029a4.8425 4.8425 0 0 1-3.3958 0.30184"/>
+<path d="m397.71 28.331a15.953 15.953 0 0 0 2.8162-1.1156"/>
+<path d="m402.97 50.497a13.12 13.12 0 0 0 3.487 0.5313"/>
+<path d="m406.46 51.028a0.51287 0.51287 0 0 0-0.23504 0.92049"/>
+<path d="m406.23 51.949a5.3946 5.3946 0 0 1-3.2519-1.4518"/>
+<path d="m326.04 13.104a1.9129 1.9129 0 0 0-0.12904-2.0624"/>
+<path d="m325.91 11.042a0.41189 0.41189 0 0 0 0.70225-0.26791"/>
+<path d="m326.61 10.774a1.7851 1.7851 0 0 1-0.57321 2.3303"/>
+<path d="m309.78 35.664a1.7188 1.7188 0 0 0 0.34899-3.1588"/>
+<path d="m310.13 32.505a10.392 10.392 0 0 0 7.9451-0.35375"/>
+<path d="m318.07 32.152a8.0983 8.0983 0 0 1-8.2941 3.5125"/>
+<path d="m357.99 1.5911a1.5714 1.5714 0 0 0 2.7138-0.76432"/>
+<path d="m360.7 0.82676a2.9141 2.9141 0 0 0 2.9073 3.0016"/>
+<path d="m363.61 3.8284a3.7734 3.7734 0 0 1-5.6211-2.2373"/>
+<path d="m387.04 87.889a1.9129 1.9129 0 0 1 3.0105-0.43525"/>
+<path d="m390.05 87.454a0.53417 0.53417 0 0 0-0.82364 0.58563"/>
+<path d="m389.23 88.04a1.7851 1.7851 0 0 0-2.1869-0.15038"/>
+<path d="m378.9 19.947a14.087 14.087 0 0 1-4.8183-15.705"/>
+<path d="m374.09 4.2414a2.8016 2.8016 0 0 0 4.4117 2.742"/>
+<path d="m378.5 6.9835a15.953 15.953 0 0 0 0.40663 12.963"/>
+<path d="m398.75 76.853a8.4957 8.4957 0 0 1-3.7437-8.0117"/>
+<path d="m395 68.842a9.0837 9.0837 0 0 0 4.186 7.2668"/>
+<path d="m399.19 76.109a0.49931 0.49931 0 0 0-0.44233 0.74487"/>
+<path d="m307 55.272a2.4743 2.4743 0 0 1 2.0732 3.8365"/>
+<path d="m309.07 59.109a2.1821 2.1821 0 0 0-2.0327-3.091"/>
+<path d="m307.04 56.018a0.43049 0.43049 0 0 0-0.0405-0.74545"/>
+<path d="m346.93 1.6329a4.16 4.16 0 0 1-3.7107 4.7444"/>
+<path d="m343.22 6.3772a4.0844 4.0844 0 0 0 3.0191-4.6082"/>
+<path d="m346.24 1.769a0.40582 0.40582 0 0 0 0.69152-0.13617"/>
+<path d="m374.11 97.165a4.16 4.16 0 0 0-4.2486-2.5483"/>
+<path d="m369.86 94.616a4.0844 4.0844 0 0 1 4.7501 2.3089"/>
+<path d="m374.61 96.925a0.32076 0.32076 0 0 0-0.50153 0.23946"/>
+<path d="m400.3 26.445a13.12 13.12 0 0 0-2.5863 1.886"/>
+<path d="m397.71 28.331a8.3836 8.3836 0 0 1 2.4477-2.11"/>
+<path d="m400.16 26.221a0.15153 0.15153 0 0 0 0.13864 0.22408"/>
+<path d="m405.55 40.828a2.4743 2.4743 0 0 0-1.5454 1.0568"/>
+<path d="m404.01 41.885a2.1821 2.1821 0 0 1 1.5025-1.2189"/>
+<path d="m405.51 40.666a0.096405 0.096405 0 0 0 0.0428 0.16205"/>
+<path d="m334.58 94.01a2.4407 2.4407 0 0 0-4.3022-1.3663"/>
+<path d="m330.28 92.644a27.92 27.92 0 0 0 3.8956-11.597"/>
+<path d="m334.17 81.047a15.953 15.953 0 0 1 0.40663 12.963"/>
+<path d="m350.27 0.99109a0.22748 0.22748 0 0 0 0.41777-0.11136"/>
+<path d="m350.69 0.87973a1.9252 1.9252 0 0 1-0.4446 1.4277"/>
+<path d="m350.24 2.3075a5.189 5.189 0 0 0 0.0268-1.3164"/>
+<path d="m315.37 72.663a13.12 13.12 0 0 1-2.5863 1.886"/>
+<path d="m312.78 74.549a0.43127 0.43127 0 0 0-0.22985-0.77033"/>
+<path d="m312.55 73.778a15.953 15.953 0 0 1 2.8162-1.1156"/>
+<path d="m363.61 3.8284a7.4202 7.4202 0 0 0 0.98439-2.6179"/>
+<path d="m364.59 1.2104a0.41385 0.41385 0 0 0 0.70402 0.30206"/>
+<path d="m365.3 1.5125a3.7734 3.7734 0 0 1-1.6884 2.3159"/>
+<path d="m323.85 12.954a0.39603 0.39603 0 0 0 0.43463-0.59715"/>
+<path d="m324.29 12.357a2.2243 2.2243 0 0 0 1.7522 0.74753"/>
+<path d="m326.04 13.104a1.7851 1.7851 0 0 1-2.1869-0.15038"/>
+<path d="m309.07 59.109a2.4743 2.4743 0 0 1-1.5454 1.0568"/>
+<path d="m307.53 60.166a0.24932 0.24932 0 0 0-5e-3 -0.4676"/>
+<path d="m307.52 59.698a5.3946 5.3946 0 0 0 1.5502-0.58924"/>
+<path d="m343.22 6.3772a4.16 4.16 0 0 1-4.2486-2.5483"/>
+<path d="m338.97 3.8289a0.73602 0.73602 0 0 0 1.3564-0.26895"/>
+<path d="m340.33 3.5599a5.189 5.189 0 0 0 2.8922 2.8173"/>
+<path d="m387.17 89.952a1.9129 1.9129 0 0 1-0.12903-2.0624"/>
+<path d="m387.04 87.889a2.062 2.062 0 0 0 0.27636 1.9441"/>
+<path d="m387.32 89.833a0.10849 0.10849 0 0 0-0.14733 0.11834"/>
+<path d="m306.62 49.965a13.12 13.12 0 0 1 3.487 0.5313"/>
+<path d="m310.1 50.497a27.92 27.92 0 0 0-3.4786-0.2456"/>
+<path d="m306.63 50.251a0.1643 0.1643 0 0 0-8e-3 -0.2857"/>
+<path d="m349.93 0.96433a7.4202 7.4202 0 0 0 0.31388 1.3431"/>
+<path d="m350.24 2.3075a4.1936 4.1936 0 0 1-0.42286-1.3232"/>
+<path d="m349.82 0.98429a0.063645 0.063645 0 0 0 0.10898-0.019964"/>
+<path d="m372.75 97.434a0.67341 0.67341 0 0 0-1.0992 0.62347"/>
+<path d="m371.65 98.057a11.842 11.842 0 0 0-1.793-3.4408"/>
+<path d="m369.86 94.616a5.189 5.189 0 0 1 2.8922 2.8173"/>
+<path d="m405.56 41.296a0.26593 0.26593 0 0 0 0.17171 0.47281"/>
+<path d="m405.73 41.768a8.3836 8.3836 0 0 1-1.7219 0.11642"/>
+<path d="m404.01 41.885a5.3946 5.3946 0 0 1 1.5502-0.58924"/>
+<path d="m362.83 98.686a7.4202 7.4202 0 0 1 0.31389 1.3431"/>
+<path d="m363.15 100.03a0.18314 0.18314 0 0 0-0.34071-0.0268"/>
+<path d="m362.81 100a5.189 5.189 0 0 1 0.0268-1.3164"/>
+<path d="m348.48 99.783a7.4202 7.4202 0 0 1 0.98439-2.618"/>
+<path d="m349.47 97.165a11.842 11.842 0 0 0-0.76006 2.6462"/>
+<path d="m348.71 99.811a0.12992 0.12992 0 0 0-0.22433-0.02823"/>
+<path d="m378.9 19.947a27.92 27.92 0 0 0 24.07 30.55"/>
+<path d="m402.97 50.497a13.048 13.048 0 0 0-7.97 18.345"/>
+<path d="m395 68.842a44.027 44.027 0 0 1-16.1-48.895"/>
+<path d="m395 68.842a10.392 10.392 0 0 0-3.5657 16.09"/>
+<path d="m391.44 84.932a3.0651 3.0651 0 0 0-4.3991 2.9573"/>
+<path d="m387.04 87.889a12.776 12.776 0 0 1 7.9648-19.047"/>
+<path d="m315.37 72.663a4.8425 4.8425 0 0 1 2.0861 8.1308"/>
+<path d="m317.45 80.794a1.0808 1.0808 0 0 0-1.2623-1.4474"/>
+<path d="m316.19 79.346a4.0707 4.0707 0 0 0-0.82382-6.6835"/>
+<path d="m309.07 59.109a8.3836 8.3836 0 0 1 6.2967 13.554"/>
+<path d="m315.37 72.663a4.5355 4.5355 0 0 0-4.8941-5.6076"/>
+<path d="m310.47 67.055a4.4059 4.4059 0 0 0-1.4026-7.9465"/>
+<path d="m308.03 41.572a9.0837 9.0837 0 0 0 10.044-9.4206"/>
+<path d="m318.07 32.152a13.048 13.048 0 0 1-7.97 18.345"/>
+<path d="m310.1 50.497a5.3358 5.3358 0 0 0-2.0742-8.9244"/>
+<path d="m343.22 6.3772a11.842 11.842 0 0 0 20.388-2.5488"/>
+<path d="m363.61 3.8284a16.572 16.572 0 0 0 15.294 16.118"/>
+<path d="m378.9 19.947a27.546 27.546 0 0 1-35.682-13.57"/>
+<path d="m387.04 87.889a2.2243 2.2243 0 0 0-1.8421 3.3293"/>
+<path d="m385.2 91.218a0.63732 0.63732 0 0 0-1.0123 0.49872"/>
+<path d="m384.19 91.717a2.6874 2.6874 0 0 1 2.8544-3.828"/>
+<path d="m310.1 50.497a3.832 3.832 0 0 0-3.3493-2.8256"/>
+<path d="m306.76 47.671a0.36128 0.36128 0 0 0 0.0868-0.64059"/>
+<path d="m306.84 47.031a3.7081 3.7081 0 0 1 3.2625 3.4662"/>
+<path d="m362.83 98.686a1.9252 1.9252 0 0 1 3.3114 0.6746"/>
+<path d="m366.15 99.361a0.40113 0.40113 0 0 0-0.69423 0.18166"/>
+<path d="m365.45 99.542a1.6544 1.6544 0 0 0-2.6171-0.85626"/>
+<path d="m402.97 50.497a3.832 3.832 0 0 1 3.106-4.7755"/>
+<path d="m406.08 45.721a0.49715 0.49715 0 0 0 0.10265 0.88448"/>
+<path d="m406.18 46.606a3.7081 3.7081 0 0 0-3.2087 3.891"/>
+<path d="m355.09 99.402a4.1936 4.1936 0 0 1 7.7449-0.71638"/>
+<path d="m362.83 98.686a2.0495 2.0495 0 0 0-3.2888 1.1956"/>
+<path d="m359.55 99.882a2.4201 2.4201 0 0 0-4.4561-0.47926"/>
+<path d="m394.4 18.688a14.212 14.212 0 0 1-15.493 1.2591"/>
+<path d="m378.9 19.947a16.572 16.572 0 0 0 12.308-4.1595"/>
+<path d="m391.21 15.787a2.3154 2.3154 0 0 0 3.1853 2.9004"/>
+<path d="m341.1 97.3a14.212 14.212 0 0 0-6.922-16.254"/>
+<path d="m334.17 81.047a16.572 16.572 0 0 1 15.294 16.118"/>
+<path d="m349.47 97.165a4.7382 4.7382 0 0 0-8.3722 0.13529"/>
+<path d="m322.71 13.905a2.062 2.062 0 0 0 3.3297-0.80051"/>
+<path d="m326.04 13.104a3.0651 3.0651 0 0 1-4.3991 2.9573"/>
+<path d="m321.64 16.062a1.3618 1.3618 0 0 0 1.0694-2.1568"/>
+<path d="m402.24 30.797a1.7371 1.7371 0 0 0 0.36428 3.1412"/>
+<path d="m402.6 33.938a4.5355 4.5355 0 0 1-4.8941-5.6075"/>
+<path d="m397.71 28.331a3.4697 3.4697 0 0 0 4.5298 2.4663"/>
+<path d="m313.91 76.36a0.57734 0.57734 0 0 0-0.49539-0.97787"/>
+<path d="m313.42 75.382a4.5355 4.5355 0 0 0 1.9531-2.7195"/>
+<path d="m315.37 72.663a3.4697 3.4697 0 0 1-1.4577 3.6974"/>
+<path d="m307.95 61.739a0.48422 0.48422 0 0 0-0.17219-0.90528"/>
+<path d="m307.78 60.834a1.8216 1.8216 0 0 0 1.2901-1.7254"/>
+<path d="m309.07 59.109a1.8674 1.8674 0 0 1-1.1179 2.6307"/>
+<path d="m332.56 7.5934a2.5631 2.5631 0 0 0 4.2261-2.2988"/>
+<path d="m336.79 5.2946a4.3908 4.3908 0 0 0 6.4364 1.0826"/>
+<path d="m343.22 6.3772a6.2339 6.2339 0 0 1-10.662 1.2162"/>
+<path d="m349.47 97.165a2.9141 2.9141 0 0 0-2.8362 2.2222"/>
+<path d="m346.63 99.387a0.31189 0.31189 0 0 0-0.53602-0.15537"/>
+<path d="m346.1 99.232a2.8863 2.8863 0 0 1 3.3722-2.0668"/>
+<path d="m397.71 28.331a4.8425 4.8425 0 0 0 3.3958-0.30184"/>
+<path d="m401.11 28.029a0.22999 0.22999 0 0 0 0.16465 0.3782"/>
+<path d="m401.27 28.407a4.0707 4.0707 0 0 1-3.5605-0.07636"/>
+<path d="m318.07 32.152a10.392 10.392 0 0 1-7.9451 0.35375"/>
+<path d="m310.13 32.505a0.5261 0.5261 0 0 0 0.35697-0.87213"/>
+<path d="m310.49 31.633a12.776 12.776 0 0 0 7.5881 0.51838"/>
+<path d="m363.61 3.8284a2.9141 2.9141 0 0 1-2.9073-3.0016"/>
+<path d="m360.7 0.82676a0.34176 0.34176 0 0 0 0.61163 0.041363"/>
+<path d="m361.31 0.86812a2.8863 2.8863 0 0 0 2.2957 2.9603"/>
+<path d="m399.19 76.109a9.0837 9.0837 0 0 1-4.186-7.2668"/>
+<path d="m395 68.842a13.048 13.048 0 0 0 5.0118 5.3876"/>
+<path d="m400.02 74.229a1.0956 1.0956 0 0 0-0.82583 1.8793"/>
+<path d="m307.04 56.018a2.1821 2.1821 0 0 1 2.0327 3.091"/>
+<path d="m309.07 59.109a1.8216 1.8216 0 0 0-1.8384-1.8385"/>
+<path d="m307.23 57.27a0.67093 0.67093 0 0 0-0.19427-1.2525"/>
+<path d="m346.24 1.769a4.0844 4.0844 0 0 1-3.0191 4.6082"/>
+<path d="m343.22 6.3772a4.3908 4.3908 0 0 0 1.599-4.1667"/>
+<path d="m344.82 2.2105a0.78996 0.78996 0 0 0 1.4201-0.44149"/>
+<path d="m374.61 96.925a4.0844 4.0844 0 0 0-4.7501-2.3089"/>
+<path d="m369.86 94.616a4.3908 4.3908 0 0 1 6.4364 1.0826"/>
+<path d="m376.29 95.699a1.14 1.14 0 0 0-1.6863 1.2263"/>
+<path d="m400.16 26.221a8.3836 8.3836 0 0 0-2.4477 2.11"/>
+<path d="m397.71 28.331a4.5355 4.5355 0 0 1 1.9531-2.7195"/>
+<path d="m399.66 25.611a0.42051 0.42051 0 0 0 0.49459 0.6095"/>
+<path d="m405.51 40.666a2.1821 2.1821 0 0 0-1.5025 1.2189"/>
+<path d="m404.01 41.885a1.8216 1.8216 0 0 1 1.2901-1.7254"/>
+<path d="m405.3 40.159a0.2955 0.2955 0 0 0 0.21243 0.50654"/>
+<path d="m324.28 88.193a2.0613 2.0613 0 0 0-2.4151-2.9863"/>
+<path d="m321.87 85.206a16.572 16.572 0 0 1 12.308-4.1595"/>
+<path d="m334.17 81.047a27.546 27.546 0 0 0-9.8931 7.1458"/>
+<path d="m352.04 0.80921a0.83679 0.83679 0 0 0 1.4977 0.30261"/>
+<path d="m353.53 1.1118a2.0495 2.0495 0 0 1-3.2889 1.1956"/>
+<path d="m350.24 2.3075a1.5001 1.5001 0 0 0 1.7912-1.4982"/>
+<path d="m364.02 99.878a0.23589 0.23589 0 0 0-0.44741 0.03454"/>
+<path d="m363.57 99.912a2.0495 2.0495 0 0 0-0.73512-1.2261"/>
+<path d="m362.83 98.686a1.5001 1.5001 0 0 1 1.1825 1.1916"/>
+<path d="m406.41 49.011a0.50467 0.50467 0 0 0-0.0673 0.95436"/>
+<path d="m406.34 49.965a13.048 13.048 0 0 0-3.3635 0.53175"/>
+<path d="m402.97 50.497a5.3358 5.3358 0 0 1 3.4308-1.4861"/>
+<path d="m334.17 81.047a27.92 27.92 0 0 1-3.8956 11.597"/>
+<path d="m330.28 92.644a0.81641 0.81641 0 0 0-1.2112-0.81232"/>
+<path d="m329.07 91.831a44.027 44.027 0 0 0 5.1068-10.785"/>
+<path d="m350.24 2.3075a1.9252 1.9252 0 0 0 0.4446-1.4277"/>
+<path d="m350.69 0.87973a0.10076 0.10076 0 0 0 0.18057-0.011087"/>
+<path d="m350.87 0.86864a1.6544 1.6544 0 0 1-0.62517 1.4388"/>
+<path d="m326.04 13.104a2.2243 2.2243 0 0 1-1.7522-0.74753"/>
+<path d="m324.29 12.357a0.11957 0.11957 0 0 0 0.1655-0.13715"/>
+<path d="m324.45 12.22a2.6874 2.6874 0 0 0 1.5867 0.88468"/>
+<path d="m387.32 89.833a2.062 2.062 0 0 1-0.27636-1.9441"/>
+<path d="m387.04 87.889a3.0651 3.0651 0 0 0 0.59857 1.6276"/>
+<path d="m387.64 89.517a0.23968 0.23968 0 0 0-0.32221 0.31641"/>
+<path d="m306.63 50.251a27.92 27.92 0 0 1 3.4786 0.2456"/>
+<path d="m310.1 50.497a13.048 13.048 0 0 1-3.3635 0.53175"/>
+<path d="m306.74 51.028a0.41951 0.41951 0 0 0-0.11505-0.77735"/>
+<path d="m349.82 0.98429a4.1936 4.1936 0 0 0 0.42286 1.3232"/>
+<path d="m350.24 2.3075a2.0495 2.0495 0 0 1-0.73511-1.2261"/>
+<path d="m349.51 1.0813a0.17479 0.17479 0 0 0 0.31225-0.097054"/>
+<path d="m369.5 98.663a0.66296 0.66296 0 0 0-1.2397 0.11971"/>
+<path d="m368.26 98.783a4.3908 4.3908 0 0 1 1.599-4.1667"/>
+<path d="m369.86 94.616a6.2339 6.2339 0 0 0-0.35933 4.047"/>
+<path d="m311.92 28.407a1.0652 1.0652 0 0 0 1.1455-1.6432"/>
+<path d="m313.06 26.764a13.048 13.048 0 0 1 5.0118 5.3876"/>
+<path d="m318.07 32.152a44.027 44.027 0 0 0-6.1574-3.7444"/>
+<path d="m405.89 42.895a0.44384 0.44384 0 0 0-0.0391 0.82853"/>
+<path d="m405.85 43.723a1.8216 1.8216 0 0 1-1.8384-1.8385"/>
+<path d="m404.01 41.885a1.8674 1.8674 0 0 0 1.8775 1.01"/>
+<path d="m363.05 1.0072a0.38266 0.38266 0 0 0 0.70598 0.16783"/>
+<path d="m363.76 1.1751a16.572 16.572 0 0 0-0.14831 2.6533"/>
+<path d="m363.61 3.8284a4.7382 4.7382 0 0 1-0.55767-2.8212"/>
+<path d="m369.86 94.616a11.842 11.842 0 0 1 1.793 3.4408"/>
+<path d="m371.65 98.057a0.23376 0.23376 0 0 0-0.40333 0.1161"/>
+<path d="m371.25 98.173a27.546 27.546 0 0 0-1.3897-3.5568"/>
+<path d="m404.01 41.885a8.3836 8.3836 0 0 0 1.7219-0.11642"/>
+<path d="m405.73 41.768a0.10366 0.10366 0 0 0 0.0254 0.18452"/>
+<path d="m405.75 41.953a4.4059 4.4059 0 0 1-1.7473-0.06809"/>
+<path d="m348.71 99.811a11.842 11.842 0 0 1 0.76006-2.6462"/>
+<path d="m349.47 97.165a16.572 16.572 0 0 1-0.14831 2.6533"/>
+<path d="m349.32 99.818a0.32619 0.32619 0 0 0-0.61175-0.0071"/>
+<path d="m325.06 11.709a0.23527 0.23527 0 0 0 0.37936-0.23253"/>
+<path d="m325.44 11.477a3.0651 3.0651 0 0 1 0.59857 1.6276"/>
+<path d="m326.04 13.104a12.776 12.776 0 0 0-0.97793-1.3951"/>
+<path d="m378.9 19.947a44.027 44.027 0 0 0 16.1 48.895"/>
+<path d="m395 68.842a62.957 62.957 0 0 0-60.83 12.205"/>
+<path d="m334.17 81.047 44.73-61.1"/>
+<path d="m395 68.842a12.776 12.776 0 0 0-7.9648 19.047"/>
+<path d="m387.04 87.889a10.416 10.416 0 0 0-17.183 6.7271"/>
+<path d="m369.86 94.616a23.184 23.184 0 0 1 25.148-25.775"/>
+<path d="m315.37 72.663a4.0707 4.0707 0 0 1 0.82382 6.6835"/>
+<path d="m316.19 79.346a1.007 1.007 0 0 0-1.2624-1.4426"/>
+<path d="m314.93 77.904a3.4864 3.4864 0 0 0 0.43857-5.2409"/>
+<path d="m309.07 59.109a4.4059 4.4059 0 0 1 1.4026 7.9465"/>
+<path d="m310.47 67.055a2.0152 2.0152 0 0 0-1.8643-3.2485"/>
+<path d="m308.61 63.807a2.6425 2.6425 0 0 0 0.46169-4.698"/>
+<path d="m308.03 41.572a5.3358 5.3358 0 0 1 2.0742 8.9244"/>
+<path d="m310.1 50.497a4.2023 4.2023 0 0 0-2.9326-6.1201"/>
+<path d="m307.17 44.377a1.5546 1.5546 0 0 0 0.85837-2.8043"/>
+<path d="m343.22 6.3772a27.546 27.546 0 0 0 35.682 13.57"/>
+<path d="m378.9 19.947a62.957 62.957 0 0 1-60.83 12.205"/>
+<path d="m318.07 32.152a23.184 23.184 0 0 0 25.148-25.775"/>
+<path d="m398.15 23.09a0.47812 0.47812 0 0 0 0.52871 0.73275"/>
+<path d="m398.68 23.823a3.3579 3.3579 0 0 0-0.96729 4.5081"/>
+<path d="m397.71 28.331a3.4864 3.4864 0 0 1 0.43858-5.2409"/>
+<path d="m404.47 37.187a0.62674 0.62674 0 0 0 0.4043 1.1085"/>
+<path d="m404.87 38.295a2.1699 2.1699 0 0 0-0.86599 3.5895"/>
+<path d="m404.01 41.885a2.6425 2.6425 0 0 1 0.46169-4.698"/>
+<path d="m387.04 87.889a2.6874 2.6874 0 0 0-2.8544 3.828"/>
+<path d="m384.19 91.717a2.1349 2.1349 0 0 0-3.6661 1.6829"/>
+<path d="m380.52 93.4a4.596 4.596 0 0 1 6.5205-5.5109"/>
+<path d="m310.1 50.497a3.7081 3.7081 0 0 0-3.2625-3.4662"/>
+<path d="m306.84 47.031a0.70305 0.70305 0 0 0 0.12129-1.345"/>
+<path d="m306.96 45.686a3.8382 3.8382 0 0 1 3.1412 4.8112"/>
+<path d="m362.83 98.686a1.6544 1.6544 0 0 1 2.6171 0.85626"/>
+<path d="m365.45 99.542a0.38653 0.38653 0 0 0-0.70927 0.20747"/>
+<path d="m364.74 99.75a1.4538 1.4538 0 0 0-1.9079-1.0637"/>
+<path d="m402.97 50.497a3.7081 3.7081 0 0 1 3.2087-3.891"/>
+<path d="m406.18 46.606a0.57099 0.57099 0 0 0 0.16572 1.0809"/>
+<path d="m406.35 47.687a3.8382 3.8382 0 0 0-3.3744 2.8102"/>
+<path d="m341.1 97.3a4.7382 4.7382 0 0 1 8.3722-0.13529"/>
+<path d="m349.47 97.165a3.506 3.506 0 0 0-5.7232 1.4159"/>
+<path d="m343.75 98.581a1.5641 1.5641 0 0 0-2.6489-1.2807"/>
+<path d="m402.24 30.797a3.4697 3.4697 0 0 1-4.5298-2.4663"/>
+<path d="m397.71 28.331a3.3579 3.3579 0 0 0 4.1651 1.3565"/>
+<path d="m401.88 29.687a0.61212 0.61212 0 0 0 0.3647 1.1098"/>
+<path d="m406.12 55.308a0.70225 0.70225 0 0 0-0.20863 1.3089"/>
+<path d="m405.91 56.617a4.2023 4.2023 0 0 1-2.9326-6.1201"/>
+<path d="m402.97 50.497a3.8382 3.8382 0 0 0 3.1412 4.8112"/>
+<path d="m313.91 76.36a3.4697 3.4697 0 0 0 1.4577-3.6974"/>
+<path d="m315.37 72.663a3.3579 3.3579 0 0 1-0.96728 4.5081"/>
+<path d="m314.4 77.171a0.49355 0.49355 0 0 0-0.49043-0.81068"/>
+<path d="m307.95 61.739a1.8674 1.8674 0 0 0 1.1179-2.6307"/>
+<path d="m309.07 59.109a2.1699 2.1699 0 0 1-0.86599 3.5895"/>
+<path d="m308.21 62.698a0.51653 0.51653 0 0 0-0.25193-0.9588"/>
+<path d="m332.56 7.5934a6.2339 6.2339 0 0 0 10.662-1.2162"/>
+<path d="m343.22 6.3772a10.416 10.416 0 0 1-17.183 6.7271"/>
+<path d="m326.04 13.104a4.596 4.596 0 0 0 6.5205-5.5109"/>
+<path d="m306.73 53.307a0.3211 0.3211 0 0 0-0.0504-0.60585"/>
+<path d="m306.68 52.701a4.2023 4.2023 0 0 0 3.4248-2.2043"/>
+<path d="m310.1 50.497a3.8382 3.8382 0 0 1-3.3744 2.8102"/>
+<path d="m348.34 1.2437a0.18833 0.18833 0 0 0 0.34878-0.074464"/>
+<path d="m348.69 1.1693a1.4216 1.4216 0 0 0 1.5591 1.1382"/>
+<path d="m350.24 2.3075a1.4538 1.4538 0 0 1-1.9078-1.0637"/>
+<path d="m349.47 97.165a2.8863 2.8863 0 0 0-3.3722 2.0668"/>
+<path d="m346.1 99.232a0.62691 0.62691 0 0 0-1.1712-0.28174"/>
+<path d="m344.93 98.95a3.1037 3.1037 0 0 1 4.5434-1.7851"/>
+<path d="m397.71 28.331a4.0708 4.0708 0 0 0 3.5605 0.07636"/>
+<path d="m401.27 28.407a0.39861 0.39861 0 0 0 0.34434 0.68524"/>
+<path d="m401.62 29.092a3.4864 3.4864 0 0 1-3.9048-0.7616"/>
+<path d="m318.07 32.152a12.776 12.776 0 0 1-7.5881-0.51838"/>
+<path d="m310.49 31.633a0.72314 0.72314 0 0 0 0.47209-1.3039"/>
+<path d="m310.96 30.329a23.184 23.184 0 0 0 7.116 1.8223"/>
+<path d="m363.61 3.8284a2.8863 2.8863 0 0 1-2.2957-2.9603"/>
+<path d="m361.31 0.86812a0.40371 0.40371 0 0 0 0.77399 0.018072"/>
+<path d="m362.09 0.88619a3.1037 3.1037 0 0 0 1.5217 2.9422"/>
+<path d="m324.28 88.193a27.546 27.546 0 0 1 9.8931-7.1458"/>
+<path d="m334.17 81.047a62.957 62.957 0 0 0-8.2611 8.6498"/>
+<path d="m325.91 89.697a1.1626 1.1626 0 0 0-1.632-1.504"/>
+<path d="m352.04 0.80921a1.5001 1.5001 0 0 1-1.7912 1.4982"/>
+<path d="m350.24 2.3075a1.4216 1.4216 0 0 0 1.2546-1.5031"/>
+<path d="m351.5 0.80434a0.28073 0.28073 0 0 0 0.53656 0.004875"/>
+<path d="m311.46 71.901a0.34295 0.34295 0 0 0-0.26028-0.59494"/>
+<path d="m311.2 71.306a3.3579 3.3579 0 0 1 4.1651 1.3565"/>
+<path d="m315.37 72.663a3.4864 3.4864 0 0 0-3.9048-0.7616"/>
+<path d="m368.15 2.0433a0.65502 0.65502 0 0 0 1.1798 0.36911"/>
+<path d="m369.33 2.4124a3.506 3.506 0 0 1-5.7232 1.4159"/>
+<path d="m363.61 3.8284a3.1037 3.1037 0 0 0 4.5434-1.7851"/>
+<path d="m364.02 99.878a1.5001 1.5001 0 0 0-1.1825-1.1916"/>
+<path d="m362.83 98.686a1.4216 1.4216 0 0 1 1.5591 1.1382"/>
+<path d="m364.39 99.824a0.19779 0.19779 0 0 0-0.37655 0.05338"/>
+<path d="m406.41 49.011a5.3358 5.3358 0 0 0-3.4308 1.4861"/>
+<path d="m402.97 50.497a4.2023 4.2023 0 0 1 3.4248-2.2043"/>
+<path d="m406.4 48.292a0.37401 0.37401 0 0 0 6e-3 0.7182"/>
+<path d="m402.12 70.664a0.48114 0.48114 0 0 0-0.36614 0.83357"/>
+<path d="m401.75 71.498a62.957 62.957 0 0 0-6.7499-2.6558"/>
+<path d="m395 68.842a23.184 23.184 0 0 1 7.116 1.8223"/>
+<path d="m350.99 100.11a0.23275 0.23275 0 0 0-0.43933-0.0379"/>
+<path d="m350.55 100.07a3.506 3.506 0 0 0-1.0823-2.9043"/>
+<path d="m349.47 97.165a3.1037 3.1037 0 0 1 1.5217 2.9422"/>
+<path d="m334.17 81.047a44.027 44.027 0 0 1-5.1068 10.785"/>
+<path d="m329.07 91.831a1.1787 1.1787 0 0 0-1.9081-1.2025"/>
+<path d="m327.16 90.629 7.0149-9.5822"/>
+<path d="m350.24 2.3075a1.6544 1.6544 0 0 0 0.62517-1.4388"/>
+<path d="m350.87 0.86864a0.17672 0.17672 0 0 0 0.33784-0.041705"/>
+<path d="m351.21 0.82694a1.4538 1.4538 0 0 1-0.96301 1.4805"/>
+<path d="m326.04 13.104a2.6874 2.6874 0 0 1-1.5867-0.88468"/>
+<path d="m324.45 12.22a0.1632 0.1632 0 0 0 0.22949-0.2142"/>
+<path d="m324.68 12.005a4.596 4.596 0 0 0 1.3572 1.0989"/>
+<path d="m369.5 98.663a6.2339 6.2339 0 0 1 0.35933-4.047"/>
+<path d="m369.86 94.616a10.416 10.416 0 0 0 0.31255 3.9064"/>
+<path d="m370.17 98.523a0.35801 0.35801 0 0 0-0.67188 0.14056"/>
+<path d="m311.92 28.407a44.027 44.027 0 0 1 6.1574 3.7444"/>
+<path d="m318.07 32.152a62.957 62.957 0 0 1-6.7499-2.6558"/>
+<path d="m311.32 29.496a0.647 0.647 0 0 0 0.59251-1.0886"/>
+<path d="m405.89 42.895a1.8674 1.8674 0 0 1-1.8775-1.01"/>
+<path d="m404.01 41.885a2.1699 2.1699 0 0 0 1.8472 0.62092"/>
+<path d="m405.85 42.506a0.20357 0.20357 0 0 0 0.0303 0.38904"/>
+<path d="m361.87 100.17a0.15428 0.15428 0 0 0-0.2916 0.0226"/>
+<path d="m361.58 100.19a1.4216 1.4216 0 0 1 1.2546-1.5031"/>
+<path d="m362.83 98.686a1.4538 1.4538 0 0 0-0.963 1.4805"/>
+<path d="m385.92 10.365a0.82429 0.82429 0 0 0 1.2462 0.93238"/>
+<path d="m387.17 11.297a62.957 62.957 0 0 1-8.2611 8.6498"/>
+<path d="m378.9 19.947 7.0149-9.5822"/>
+<path d="m363.05 1.0072a4.7382 4.7382 0 0 0 0.55767 2.8212"/>
+<path d="m363.61 3.8284a3.506 3.506 0 0 1-1.0823-2.9043"/>
+<path d="m362.53 0.9241a0.2765 0.2765 0 0 0 0.52467 0.083131"/>
+<path d="m388.4 88.988a0.10786 0.10786 0 0 0-0.15622 0.13212"/>
+<path d="m388.24 89.12a10.416 10.416 0 0 0-1.201-1.231"/>
+<path d="m387.04 87.889a4.596 4.596 0 0 1 1.3572 1.0989"/>
+<path d="m369.86 94.616a27.546 27.546 0 0 1 1.3897 3.5568"/>
+<path d="m371.25 98.173a0.34522 0.34522 0 0 0-0.6268 0.21858"/>
+<path d="m370.62 98.392a23.184 23.184 0 0 1-0.76287-3.7754"/>
+<path d="m404.01 41.885a4.4059 4.4059 0 0 0 1.7473 0.06809"/>
+<path d="m405.75 41.953a0.16512 0.16512 0 0 0 0.0627 0.31173"/>
+<path d="m405.82 42.265a2.6425 2.6425 0 0 1-1.81-0.37982"/>
+<path d="m325.06 11.709a12.776 12.776 0 0 1 0.97793 1.3951"/>
+<path d="m326.04 13.104a10.416 10.416 0 0 1-1.201-1.231"/>
+<path d="m324.84 11.873a0.14416 0.14416 0 0 0 0.22309-0.16412"/>
+<path d="m307.26 58.729a0.12863 0.12863 0 0 0-0.0372-0.2411"/>
+<path d="m307.22 58.488a2.1699 2.1699 0 0 1 1.8472 0.62092"/>
+<path d="m309.07 59.109a2.6425 2.6425 0 0 0-1.81-0.37982"/>
+<path d="m342.46 2.6018a0.24745 0.24745 0 0 0 0.45032-0.131"/>
+<path d="m342.91 2.4708a10.416 10.416 0 0 1 0.31255 3.9064"/>
+<path d="m343.22 6.3772a23.184 23.184 0 0 0-0.76287-3.7754"/>
+<path d="m378.9 19.947-44.73 61.1"/>
+<path d="m334.17 81.047a44.027 44.027 0 0 0-16.1-48.895"/>
+<path d="m318.07 32.152a62.957 62.957 0 0 0 60.83-12.205"/>
+<path d="m405.91 56.617a1.5546 1.5546 0 0 0-0.85837 2.8043"/>
+<path d="m405.05 59.421a5.3358 5.3358 0 0 1-2.0742-8.9244"/>
+<path d="m402.97 50.497a4.2023 4.2023 0 0 0 2.9326 6.1201"/>
+<path d="m395 68.842a23.184 23.184 0 0 0-25.148 25.775"/>
+<path d="m369.86 94.616a27.546 27.546 0 0 0-35.682-13.57"/>
+<path d="m334.17 81.047a62.957 62.957 0 0 1 60.83-12.205"/>
+<path d="m315.37 72.663a3.4864 3.4864 0 0 1-0.43857 5.2409"/>
+<path d="m314.93 77.904a0.47812 0.47812 0 0 0-0.52871-0.73275"/>
+<path d="m314.4 77.171a3.3579 3.3579 0 0 0 0.96728-4.5081"/>
+<path d="m309.07 59.109a2.6425 2.6425 0 0 1-0.46169 4.698"/>
+<path d="m308.61 63.807a0.62674 0.62674 0 0 0-0.4043-1.1085"/>
+<path d="m308.21 62.698a2.1699 2.1699 0 0 0 0.86599-3.5895"/>
+<path d="m343.22 6.3772a23.184 23.184 0 0 1-25.148 25.775"/>
+<path d="m318.07 32.152a12.776 12.776 0 0 0 7.9648-19.047"/>
+<path d="m326.04 13.104a10.416 10.416 0 0 0 17.183-6.7271"/>
+<path d="m398.15 23.09a3.4864 3.4864 0 0 0-0.43858 5.2409"/>
+<path d="m397.71 28.331a4.0707 4.0707 0 0 1-0.82381-6.6835"/>
+<path d="m396.89 21.647a1.007 1.007 0 0 0 1.2624 1.4426"/>
+<path d="m404.47 37.187a2.6425 2.6425 0 0 0-0.46169 4.698"/>
+<path d="m404.01 41.885a4.4059 4.4059 0 0 1-1.4026-7.9465"/>
+<path d="m402.6 33.938a2.0152 2.0152 0 0 0 1.8643 3.2485"/>
+<path d="m311.2 71.306a0.61212 0.61212 0 0 0-0.36471-1.1098"/>
+<path d="m310.84 70.196a3.4697 3.4697 0 0 1 4.5298 2.4663"/>
+<path d="m315.37 72.663a3.3579 3.3579 0 0 0-4.1651-1.3565"/>
+<path d="m369.33 2.4124a1.5641 1.5641 0 0 0 2.6489 1.2807"/>
+<path d="m371.98 3.6931a4.7382 4.7382 0 0 1-8.3722 0.13529"/>
+<path d="m363.61 3.8284a3.506 3.506 0 0 0 5.7232-1.4159"/>
+<path d="m387.04 87.889a4.596 4.596 0 0 0-6.5205 5.5109"/>
+<path d="m380.52 93.4a6.2339 6.2339 0 0 0-10.663 1.2162"/>
+<path d="m369.86 94.616a10.416 10.416 0 0 1 17.183-6.7271"/>
+<path d="m310.1 50.497a3.8382 3.8382 0 0 0-3.1412-4.8112"/>
+<path d="m306.96 45.686a0.70225 0.70225 0 0 0 0.20864-1.3089"/>
+<path d="m307.17 44.377a4.2023 4.2023 0 0 1 2.9326 6.1201"/>
+<path d="m398.68 23.823a0.49355 0.49355 0 0 0 0.49043 0.81069"/>
+<path d="m399.17 24.633a3.4697 3.4697 0 0 0-1.4577 3.6974"/>
+<path d="m397.71 28.331a3.3579 3.3579 0 0 1 0.96729-4.5081"/>
+<path d="m404.87 38.295a0.51653 0.51653 0 0 0 0.25193 0.9588"/>
+<path d="m405.13 39.254a1.8674 1.8674 0 0 0-1.1179 2.6307"/>
+<path d="m404.01 41.885a2.1699 2.1699 0 0 1 0.86599-3.5895"/>
+<path d="m362.83 98.686a1.4538 1.4538 0 0 1 1.9079 1.0637"/>
+<path d="m364.74 99.75a0.18833 0.18833 0 0 0-0.34878 0.07447"/>
+<path d="m364.39 99.824a1.4216 1.4216 0 0 0-1.5591-1.1382"/>
+<path d="m402.97 50.497a3.8382 3.8382 0 0 1 3.3744-2.8102"/>
+<path d="m406.35 47.687a0.3211 0.3211 0 0 0 0.0504 0.60585"/>
+<path d="m406.4 48.292a4.2023 4.2023 0 0 0-3.4248 2.2043"/>
+<path d="m406.12 55.308a3.8382 3.8382 0 0 1-3.1412-4.8112"/>
+<path d="m402.97 50.497a3.7081 3.7081 0 0 0 3.2625 3.4662"/>
+<path d="m406.24 53.963a0.70305 0.70305 0 0 0-0.1213 1.345"/>
+<path d="m332.56 7.5934a4.596 4.596 0 0 1-6.5205 5.5109"/>
+<path d="m326.04 13.104a2.6874 2.6874 0 0 0 2.8544-3.828"/>
+<path d="m328.89 9.2763a2.1349 2.1349 0 0 0 3.6661-1.6828"/>
+<path d="m306.73 53.307a3.8382 3.8382 0 0 0 3.3744-2.8102"/>
+<path d="m310.1 50.497a3.7081 3.7081 0 0 1-3.2087 3.891"/>
+<path d="m306.9 54.388a0.57099 0.57099 0 0 0-0.16572-1.0809"/>
+<path d="m348.34 1.2437a1.4538 1.4538 0 0 0 1.9078 1.0637"/>
+<path d="m350.24 2.3075a1.6544 1.6544 0 0 1-2.6171-0.85626"/>
+<path d="m347.63 1.4512a0.38653 0.38653 0 0 0 0.70927-0.20748"/>
+<path d="m361.58 100.19a0.28073 0.28073 0 0 0-0.53656-5e-3"/>
+<path d="m361.04 100.18a1.5001 1.5001 0 0 1 1.7912-1.4982"/>
+<path d="m362.83 98.686a1.4216 1.4216 0 0 0-1.2546 1.5031"/>
+<path d="m387.17 11.297a1.1626 1.1626 0 0 0 1.632 1.504"/>
+<path d="m388.8 12.801a27.546 27.546 0 0 1-9.8931 7.1458"/>
+<path d="m378.9 19.947a62.957 62.957 0 0 0 8.2611-8.6498"/>
+<path d="m349.47 97.165a3.1037 3.1037 0 0 0-4.5434 1.7851"/>
+<path d="m344.93 98.95a0.65502 0.65502 0 0 0-1.1798-0.36911"/>
+<path d="m343.75 98.581a3.506 3.506 0 0 1 5.7232-1.4159"/>
+<path d="m397.71 28.331a3.4864 3.4864 0 0 0 3.9048 0.7616"/>
+<path d="m401.62 29.092a0.34295 0.34295 0 0 0 0.26028 0.59494"/>
+<path d="m401.88 29.687a3.3579 3.3579 0 0 1-4.1651-1.3565"/>
+<path d="m306.68 52.701a0.37401 0.37401 0 0 0-6e-3 -0.7182"/>
+<path d="m306.67 51.983a5.3358 5.3358 0 0 0 3.4308-1.4861"/>
+<path d="m310.1 50.497a4.2023 4.2023 0 0 1-3.4248 2.2043"/>
+<path d="m348.69 1.1693a0.19779 0.19779 0 0 0 0.37655-0.053382"/>
+<path d="m349.06 1.1159a1.5001 1.5001 0 0 0 1.1825 1.1916"/>
+<path d="m350.24 2.3075a1.4216 1.4216 0 0 1-1.5591-1.1382"/>
+<path d="m318.07 32.152a23.184 23.184 0 0 1-7.116-1.8223"/>
+<path d="m310.96 30.329a0.48114 0.48114 0 0 0 0.36614-0.83358"/>
+<path d="m311.32 29.496a62.957 62.957 0 0 0 6.7499 2.6558"/>
+<path d="m363.61 3.8284a3.1037 3.1037 0 0 1-1.5217-2.9422"/>
+<path d="m362.09 0.88619a0.23275 0.23275 0 0 0 0.43933 0.037908"/>
+<path d="m362.53 0.9241a3.506 3.506 0 0 0 1.0823 2.9043"/>
+<path d="m311.46 71.901a3.4864 3.4864 0 0 1 3.9048 0.7616"/>
+<path d="m315.37 72.663a4.0708 4.0708 0 0 0-3.5605-0.07636"/>
+<path d="m311.81 72.586a0.39861 0.39861 0 0 0-0.34434-0.68524"/>
+<path d="m368.15 2.0433a3.1037 3.1037 0 0 1-4.5434 1.7851"/>
+<path d="m363.61 3.8284a2.8863 2.8863 0 0 0 3.3722-2.0668"/>
+<path d="m366.98 1.7616a0.62691 0.62691 0 0 0 1.1712 0.28174"/>
+<path d="m402.12 70.664a23.184 23.184 0 0 0-7.116-1.8223"/>
+<path d="m395 68.842a12.776 12.776 0 0 1 7.5881 0.51838"/>
+<path d="m402.59 69.36a0.72314 0.72314 0 0 0-0.47209 1.3039"/>
+<path d="m350.99 100.11a3.1037 3.1037 0 0 0-1.5217-2.9422"/>
+<path d="m349.47 97.165a2.8863 2.8863 0 0 1 2.2957 2.9603"/>
+<path d="m351.76 100.13a0.40371 0.40371 0 0 0-0.77399-0.0181"/>
+<path d="m401.75 71.498a0.647 0.647 0 0 0-0.59252 1.0886"/>
+<path d="m401.16 72.586a44.027 44.027 0 0 1-6.1574-3.7444"/>
+<path d="m395 68.842a62.957 62.957 0 0 1 6.7499 2.6558"/>
+<path d="m307.22 58.488a0.20357 0.20357 0 0 0-0.0303-0.38904"/>
+<path d="m307.19 58.099a1.8674 1.8674 0 0 1 1.8775 1.01"/>
+<path d="m309.07 59.109a2.1699 2.1699 0 0 0-1.8472-0.62092"/>
+<path d="m342.91 2.4708a0.35801 0.35801 0 0 0 0.67188-0.14056"/>
+<path d="m343.58 2.3302a6.2339 6.2339 0 0 1-0.35933 4.047"/>
+<path d="m343.22 6.3772a10.416 10.416 0 0 0-0.31255-3.9064"/>
+<path d="m334.17 81.047-7.0149 9.5822"/>
+<path d="m327.16 90.629a0.82429 0.82429 0 0 0-1.2462-0.93238"/>
+<path d="m325.91 89.697a62.957 62.957 0 0 1 8.2611-8.6498"/>
+<path d="m350.24 2.3075a1.4538 1.4538 0 0 0 0.96301-1.4805"/>
+<path d="m351.21 0.82694a0.15428 0.15428 0 0 0 0.2916-0.022602"/>
+<path d="m351.5 0.80434a1.4216 1.4216 0 0 1-1.2546 1.5031"/>
+<path d="m350.55 100.07a0.2765 0.2765 0 0 0-0.52467-0.08313"/>
+<path d="m350.03 99.986a4.7382 4.7382 0 0 0-0.55767-2.8212"/>
+<path d="m349.47 97.165a3.506 3.506 0 0 1 1.0823 2.9043"/>
+<path d="m326.04 13.104a4.596 4.596 0 0 1-1.3572-1.0989"/>
+<path d="m324.68 12.005a0.10786 0.10786 0 0 0 0.15622-0.13212"/>
+<path d="m324.84 11.873a10.416 10.416 0 0 0 1.201 1.231"/>
+<path d="m361.87 100.17a1.4538 1.4538 0 0 1 0.963-1.4805"/>
+<path d="m362.83 98.686a1.6544 1.6544 0 0 0-0.62516 1.4388"/>
+<path d="m362.21 100.12a0.17672 0.17672 0 0 0-0.33784 0.0417"/>
+<path d="m385.92 10.365-7.0149 9.5822"/>
+<path d="m378.9 19.947a44.027 44.027 0 0 1 5.1068-10.785"/>
+<path d="m384.01 9.1621a1.1787 1.1787 0 0 0 1.9081 1.2025"/>
+<path d="m388.4 88.988a4.596 4.596 0 0 0-1.3572-1.0989"/>
+<path d="m387.04 87.889a2.6874 2.6874 0 0 1 1.5867 0.88468"/>
+<path d="m388.63 88.774a0.1632 0.1632 0 0 0-0.22949 0.2142"/>
+<path d="m388.24 89.12a0.14416 0.14416 0 0 0-0.22309 0.16412"/>
+<path d="m388.02 89.284a12.776 12.776 0 0 1-0.97793-1.3951"/>
+<path d="m387.04 87.889a10.416 10.416 0 0 1 1.201 1.231"/>
+<path d="m369.86 94.616a23.184 23.184 0 0 0 0.76287 3.7754"/>
+<path d="m370.62 98.392a0.24745 0.24745 0 0 0-0.45032 0.131"/>
+<path d="m370.17 98.523a10.416 10.416 0 0 1-0.31255-3.9064"/>
+<path d="m404.01 41.885a2.6425 2.6425 0 0 0 1.81 0.37982"/>
+<path d="m405.82 42.265a0.12863 0.12863 0 0 0 0.0373 0.2411"/>
+<path d="m405.85 42.506a2.1699 2.1699 0 0 1-1.8472-0.62092"/>
+<path d="m307.26 58.729a2.6425 2.6425 0 0 1 1.81 0.37982"/>
+<path d="m309.07 59.109a4.4059 4.4059 0 0 0-1.7473-0.06809"/>
+<path d="m307.32 59.041a0.16512 0.16512 0 0 0-0.0627-0.31173"/>
+<path d="m342.46 2.6018a23.184 23.184 0 0 1 0.76287 3.7754"/>
+<path d="m343.22 6.3772a27.546 27.546 0 0 1-1.3897-3.5568"/>
+<path d="m341.83 2.8204a0.34522 0.34522 0 0 0 0.6268-0.21859"/>
+<path d="m318.07 32.152a44.027 44.027 0 0 1 16.1 48.895"/>
+<path d="m334.17 81.047a27.92 27.92 0 0 0-24.07-30.55"/>
+<path d="m310.1 50.497a13.048 13.048 0 0 0 7.97-18.345"/>
+<path d="m402.97 50.497a5.3358 5.3358 0 0 0 2.0742 8.9244"/>
+<path d="m405.05 59.421a9.0837 9.0837 0 0 0-10.044 9.4206"/>
+<path d="m395 68.842a13.048 13.048 0 0 1 7.97-18.345"/>
+<path d="m334.17 81.047a27.546 27.546 0 0 1 35.682 13.57"/>
+<path d="m369.86 94.616a11.842 11.842 0 0 0-20.388 2.5488"/>
+<path d="m349.47 97.165a16.572 16.572 0 0 0-15.294-16.118"/>
+<path d="m326.04 13.104a12.776 12.776 0 0 1-7.9648 19.047"/>
+<path d="m318.07 32.152a10.392 10.392 0 0 0 3.5657-16.09"/>
+<path d="m321.64 16.062a3.0651 3.0651 0 0 0 4.3991-2.9573"/>
+<path d="m396.89 21.647a4.0707 4.0707 0 0 0 0.82381 6.6835"/>
+<path d="m397.71 28.331a4.8425 4.8425 0 0 1-2.0861-8.1308"/>
+<path d="m395.62 20.2a1.0808 1.0808 0 0 0 1.2623 1.4474"/>
+<path d="m402.6 33.938a4.4059 4.4059 0 0 0 1.4026 7.9465"/>
+<path d="m404.01 41.885a8.3836 8.3836 0 0 1-6.2967-13.554"/>
+<path d="m397.71 28.331a4.5355 4.5355 0 0 0 4.8941 5.6075"/>
+<path d="m391.44 84.932a1.3618 1.3618 0 0 0-1.0694 2.1568"/>
+<path d="m390.37 87.089a2.062 2.062 0 0 0-3.3297 0.80051"/>
+<path d="m387.04 87.889a3.0651 3.0651 0 0 1 4.3991-2.9573"/>
+<path d="m315.37 72.663a3.4697 3.4697 0 0 0-4.5298-2.4663"/>
+<path d="m310.84 70.196a1.7371 1.7371 0 0 0-0.36427-3.1412"/>
+<path d="m310.47 67.055a4.5355 4.5355 0 0 1 4.8941 5.6076"/>
+<path d="m363.61 3.8284a4.7382 4.7382 0 0 0 8.3722-0.13529"/>
+<path d="m371.98 3.6931a14.212 14.212 0 0 0 6.922 16.254"/>
+<path d="m378.9 19.947a16.572 16.572 0 0 1-15.294-16.118"/>
+<path d="m369.86 94.616a6.2339 6.2339 0 0 1 10.663-1.2162"/>
+<path d="m380.52 93.4a2.5631 2.5631 0 0 0-4.2261 2.2988"/>
+<path d="m376.29 95.699a4.3908 4.3908 0 0 0-6.4364-1.0826"/>
+<path d="m397.71 28.331a3.4697 3.4697 0 0 1 1.4577-3.6974"/>
+<path d="m399.17 24.633a0.57734 0.57734 0 0 0 0.49539 0.97787"/>
+<path d="m399.66 25.611a4.5355 4.5355 0 0 0-1.9531 2.7195"/>
+<path d="m404.01 41.885a1.8674 1.8674 0 0 1 1.1179-2.6307"/>
+<path d="m405.13 39.254a0.48422 0.48422 0 0 0 0.17219 0.90528"/>
+<path d="m405.3 40.159a1.8216 1.8216 0 0 0-1.2901 1.7254"/>
+<path d="m406.24 53.963a3.7081 3.7081 0 0 1-3.2625-3.4662"/>
+<path d="m402.97 50.497a3.832 3.832 0 0 0 3.3493 2.8256"/>
+<path d="m406.32 53.322a0.36128 0.36128 0 0 0-0.0868 0.64059"/>
+<path d="m328.89 9.2763a2.6874 2.6874 0 0 1-2.8544 3.828"/>
+<path d="m326.04 13.104a2.2243 2.2243 0 0 0 1.8421-3.3293"/>
+<path d="m327.88 9.775a0.63732 0.63732 0 0 0 1.0123-0.49872"/>
+<path d="m306.9 54.388a3.7081 3.7081 0 0 0 3.2087-3.891"/>
+<path d="m310.1 50.497a3.832 3.832 0 0 1-3.106 4.7755"/>
+<path d="m307 55.272a0.49715 0.49715 0 0 0-0.10265-0.88448"/>
+<path d="m347.63 1.4512a1.6544 1.6544 0 0 0 2.6171 0.85626"/>
+<path d="m350.24 2.3075a1.9252 1.9252 0 0 1-3.3114-0.6746"/>
+<path d="m346.93 1.6329a0.40113 0.40113 0 0 0 0.69423-0.18165"/>
+<path d="m321.87 85.206a2.3154 2.3154 0 0 0-3.1853-2.9005"/>
+<path d="m318.68 82.306a14.212 14.212 0 0 1 15.493-1.2591"/>
+<path d="m334.17 81.047a16.572 16.572 0 0 0-12.308 4.1595"/>
+<path d="m353.53 1.1118a2.4201 2.4201 0 0 0 4.4561 0.47925"/>
+<path d="m357.99 1.5911a4.1936 4.1936 0 0 1-7.745 0.71638"/>
+<path d="m350.24 2.3075a2.0495 2.0495 0 0 0 3.2889-1.1956"/>
+<path d="m362.83 98.686a1.5001 1.5001 0 0 0-1.7912 1.4982"/>
+<path d="m361.04 100.18a0.83679 0.83679 0 0 0-1.4977-0.30261"/>
+<path d="m359.55 99.882a2.0495 2.0495 0 0 1 3.2888-1.1956"/>
+<path d="m378.9 19.947a27.546 27.546 0 0 0 9.8931-7.1458"/>
+<path d="m388.8 12.801a2.0613 2.0613 0 0 0 2.4151 2.9863"/>
+<path d="m391.21 15.787a16.572 16.572 0 0 1-12.308 4.1595"/>
+<path d="m313.42 75.382a0.42051 0.42051 0 0 0-0.49458-0.6095"/>
+<path d="m312.92 74.773a8.3836 8.3836 0 0 0 2.4477-2.11"/>
+<path d="m315.37 72.663a4.5355 4.5355 0 0 1-1.9531 2.7195"/>
+<path d="m307.78 60.834a0.2955 0.2955 0 0 0-0.21244-0.50654"/>
+<path d="m307.57 60.328a2.1821 2.1821 0 0 0 1.5026-1.2189"/>
+<path d="m309.07 59.109a1.8216 1.8216 0 0 1-1.2901 1.7254"/>
+<path d="m336.79 5.2946a1.14 1.14 0 0 0 1.6863-1.2263"/>
+<path d="m338.47 4.0683a4.0844 4.0844 0 0 0 4.7501 2.3089"/>
+<path d="m343.22 6.3772a4.3908 4.3908 0 0 1-6.4364-1.0826"/>
+<path d="m310.1 50.497a5.3358 5.3358 0 0 1-3.4308 1.4861"/>
+<path d="m306.67 51.983a0.50467 0.50467 0 0 0 0.0673-0.95436"/>
+<path d="m306.74 51.028a13.048 13.048 0 0 0 3.3635-0.53175"/>
+<path d="m350.24 2.3075a1.5001 1.5001 0 0 1-1.1825-1.1916"/>
+<path d="m349.06 1.1159a0.23589 0.23589 0 0 0 0.44741-0.034532"/>
+<path d="m349.51 1.0813a2.0495 2.0495 0 0 0 0.73511 1.2261"/>
+<path d="m311.81 72.586a4.0707 4.0707 0 0 1 3.5605 0.07636"/>
+<path d="m315.37 72.663a4.8425 4.8425 0 0 0-3.3958 0.30183"/>
+<path d="m311.97 72.965a0.22999 0.22999 0 0 0-0.16465-0.3782"/>
+<path d="m366.98 1.7616a2.8863 2.8863 0 0 1-3.3722 2.0668"/>
+<path d="m363.61 3.8284a2.9141 2.9141 0 0 0 2.8362-2.2222"/>
+<path d="m366.45 1.6062a0.31189 0.31189 0 0 0 0.53602 0.15537"/>
+<path d="m402.59 69.36a12.776 12.776 0 0 0-7.5881-0.51838"/>
+<path d="m395 68.842a10.392 10.392 0 0 1 7.9451-0.35375"/>
+<path d="m402.95 68.488a0.5261 0.5261 0 0 0-0.35697 0.87213"/>
+<path d="m351.76 100.13a2.8863 2.8863 0 0 0-2.2957-2.9603"/>
+<path d="m349.47 97.165a2.9141 2.9141 0 0 1 2.9073 3.0016"/>
+<path d="m352.38 100.17a0.34176 0.34176 0 0 0-0.61163-0.0414"/>
+<path d="m368.26 98.783a0.78996 0.78996 0 0 0-1.4201 0.44148"/>
+<path d="m366.84 99.224a4.0844 4.0844 0 0 1 3.0191-4.6082"/>
+<path d="m369.86 94.616a4.3908 4.3908 0 0 0-1.599 4.1667"/>
+<path d="m313.06 26.764a1.0956 1.0956 0 0 0 0.82584-1.8793"/>
+<path d="m313.89 24.885a9.0837 9.0837 0 0 1 4.186 7.2668"/>
+<path d="m318.07 32.152a13.048 13.048 0 0 0-5.0118-5.3876"/>
+<path d="m405.85 43.723a0.67093 0.67093 0 0 0 0.19427 1.2525"/>
+<path d="m406.04 44.976a2.1821 2.1821 0 0 1-2.0327-3.091"/>
+<path d="m404.01 41.885a1.8216 1.8216 0 0 0 1.8384 1.8385"/>
+<path d="m395 68.842a44.027 44.027 0 0 0 6.1574 3.7444"/>
+<path d="m401.16 72.586a1.0652 1.0652 0 0 0-1.1455 1.6432"/>
+<path d="m400.02 74.229a13.048 13.048 0 0 1-5.0118-5.3876"/>
+<path d="m309.07 59.109a1.8674 1.8674 0 0 0-1.8775-1.01"/>
+<path d="m307.19 58.099a0.44384 0.44384 0 0 0 0.0391-0.82853"/>
+<path d="m307.23 57.27a1.8216 1.8216 0 0 1 1.8384 1.8385"/>
+<path d="m343.22 6.3772a6.2339 6.2339 0 0 0 0.35933-4.047"/>
+<path d="m343.58 2.3302a0.66296 0.66296 0 0 0 1.2397-0.11971"/>
+<path d="m344.82 2.2105a4.3908 4.3908 0 0 1-1.599 4.1667"/>
+<path d="m363.57 99.912a0.17479 0.17479 0 0 0-0.31225 0.09705"/>
+<path d="m363.26 100.01a4.1936 4.1936 0 0 0-0.42287-1.3232"/>
+<path d="m362.83 98.686a2.0495 2.0495 0 0 1 0.73512 1.2261"/>
+<path d="m406.34 49.965a0.41951 0.41951 0 0 0 0.11505 0.77735"/>
+<path d="m406.45 50.742a27.92 27.92 0 0 1-3.4786-0.2456"/>
+<path d="m402.97 50.497a13.048 13.048 0 0 1 3.3635-0.53175"/>
+<path d="m349.47 97.165a4.7382 4.7382 0 0 1 0.55767 2.8212"/>
+<path d="m350.03 99.986a0.38266 0.38266 0 0 0-0.70598-0.16783"/>
+<path d="m349.32 99.818a16.572 16.572 0 0 0 0.14831-2.6533"/>
+<path d="m362.21 100.12a1.6544 1.6544 0 0 1 0.62516-1.4388"/>
+<path d="m362.83 98.686a1.9252 1.9252 0 0 0-0.44459 1.4277"/>
+<path d="m362.39 100.11a0.10076 0.10076 0 0 0-0.18057 0.0111"/>
+<path d="m384.01 9.1621a44.027 44.027 0 0 0-5.1068 10.785"/>
+<path d="m378.9 19.947a27.92 27.92 0 0 1 3.8956-11.597"/>
+<path d="m382.8 8.3498a0.81641 0.81641 0 0 0 1.2112 0.81232"/>
+<path d="m388.63 88.774a2.6874 2.6874 0 0 0-1.5867-0.88468"/>
+<path d="m387.04 87.889a2.2243 2.2243 0 0 1 1.7522 0.74753"/>
+<path d="m388.79 88.637a0.11957 0.11957 0 0 0-0.1655 0.13715"/>
+<path d="m325.44 11.477a0.23968 0.23968 0 0 0 0.32222-0.31641"/>
+<path d="m325.76 11.16a2.062 2.062 0 0 1 0.27635 1.9441"/>
+<path d="m326.04 13.104a3.0651 3.0651 0 0 0-0.59857-1.6276"/>
+<path d="m387.04 87.889a12.776 12.776 0 0 0 0.97793 1.3951"/>
+<path d="m388.02 89.284a0.23527 0.23527 0 0 0-0.37936 0.23253"/>
+<path d="m387.64 89.517a3.0651 3.0651 0 0 1-0.59857-1.6276"/>
+<path d="m363.76 1.1751a0.32619 0.32619 0 0 0 0.61175 0.00714"/>
+<path d="m364.37 1.1822a11.842 11.842 0 0 1-0.76006 2.6462"/>
+<path d="m363.61 3.8284a16.572 16.572 0 0 1 0.14831-2.6533"/>
+<path d="m307.32 59.041a4.4059 4.4059 0 0 1 1.7473 0.06809"/>
+<path d="m309.07 59.109a8.3836 8.3836 0 0 0-1.7219 0.11642"/>
+<path d="m307.35 59.225a0.10366 0.10366 0 0 0-0.0253-0.18452"/>
+<path d="m341.83 2.8204a27.546 27.546 0 0 0 1.3897 3.5568"/>
+<path d="m343.22 6.3772a11.842 11.842 0 0 1-1.793-3.4408"/>
+<path d="m341.43 2.9365a0.23376 0.23376 0 0 0 0.40333-0.11609"/>
+<path d="m310.1 50.497a27.92 27.92 0 0 1 24.07 30.55"/>
+<path d="m334.17 81.047a15.953 15.953 0 0 0-18.806-8.384"/>
+<path d="m315.37 72.663a13.12 13.12 0 0 0-5.2639-22.166"/>
+<path d="m395 68.842a9.0837 9.0837 0 0 1 10.044-9.4206"/>
+<path d="m405.05 59.421a1.1593 1.1593 0 0 0-0.18922 1.9776"/>
+<path d="m404.86 61.399a8.4957 8.4957 0 0 0-9.855 7.443"/>
+<path d="m349.47 97.165a11.842 11.842 0 0 1 20.388-2.5488"/>
+<path d="m369.86 94.616a5.189 5.189 0 0 0-7.022 4.0698"/>
+<path d="m362.83 98.686a7.4202 7.4202 0 0 0-13.366-1.5209"/>
+<path d="m321.64 16.062a10.392 10.392 0 0 1-3.5657 16.09"/>
+<path d="m318.07 32.152a8.0983 8.0983 0 0 0-1.079-10.201"/>
+<path d="m317 21.951a4.0047 4.0047 0 0 0 4.6447-5.8889"/>
+<path d="m395.62 20.2a4.8425 4.8425 0 0 0 2.0861 8.1308"/>
+<path d="m397.71 28.331a15.953 15.953 0 0 1-18.806-8.384"/>
+<path d="m378.9 19.947a14.087 14.087 0 0 0 16.72 0.25312"/>
+<path d="m397.71 28.331a8.3836 8.3836 0 0 0 6.2967 13.554"/>
+<path d="m404.01 41.885a5.3946 5.3946 0 0 0-1.0328 8.612"/>
+<path d="m402.97 50.497a13.12 13.12 0 0 1-5.2639-22.166"/>
+<path d="m387.04 87.889a2.062 2.062 0 0 1 3.3297-0.80051"/>
+<path d="m390.37 87.089a0.28072 0.28072 0 0 0-0.31923 0.36526"/>
+<path d="m390.05 87.454a1.9129 1.9129 0 0 0-3.0105 0.43525"/>
+<path d="m378.9 19.947a14.212 14.212 0 0 1-6.922-16.254"/>
+<path d="m371.98 3.6931a1.2674 1.2674 0 0 0 2.1036 0.54835"/>
+<path d="m374.09 4.2414a14.087 14.087 0 0 0 4.8183 15.705"/>
+<path d="m406.32 53.322a3.832 3.832 0 0 1-3.3493-2.8256"/>
+<path d="m402.97 50.497a5.3946 5.3946 0 0 0 3.2519 1.4518"/>
+<path d="m406.23 51.949a0.72449 0.72449 0 0 0 0.0974 1.3738"/>
+<path d="m327.88 9.775a2.2243 2.2243 0 0 1-1.8421 3.3293"/>
+<path d="m326.04 13.104a1.7851 1.7851 0 0 0 0.57321-2.3303"/>
+<path d="m326.61 10.774a0.84504 0.84504 0 0 0 1.2689-0.99902"/>
+<path d="m398.75 76.853a1.9148 1.9148 0 0 0-2.6647 2.1895"/>
+<path d="m396.08 79.043a8.0983 8.0983 0 0 1-1.079-10.201"/>
+<path d="m395 68.842a8.4957 8.4957 0 0 0 3.7437 8.0117"/>
+<path d="m307 55.272a3.832 3.832 0 0 0 3.106-4.7755"/>
+<path d="m310.1 50.497a5.3946 5.3946 0 0 1-1.0328 8.612"/>
+<path d="m309.07 59.109a2.4743 2.4743 0 0 0-2.0732-3.8365"/>
+<path d="m346.93 1.6329a1.9252 1.9252 0 0 0 3.3114 0.6746"/>
+<path d="m350.24 2.3075a5.189 5.189 0 0 1-7.022 4.0698"/>
+<path d="m343.22 6.3772a4.16 4.16 0 0 0 3.7107-4.7444"/>
+<path d="m334.17 81.047a14.212 14.212 0 0 0-15.493 1.2591"/>
+<path d="m318.68 82.306a1.1293 1.1293 0 0 0-1.2265-1.5122"/>
+<path d="m317.45 80.794a14.087 14.087 0 0 1 16.72 0.25313"/>
+<path d="m308.22 39.595a2.263 2.263 0 0 0 1.5609-3.9305"/>
+<path d="m309.78 35.664a8.0983 8.0983 0 0 0 8.2941-3.5125"/>
+<path d="m318.07 32.152a8.4957 8.4957 0 0 1-9.855 7.443"/>
+<path d="m350.24 2.3075a4.1936 4.1936 0 0 0 7.745-0.71638"/>
+<path d="m357.99 1.5911a3.7734 3.7734 0 0 0 5.6211 2.2373"/>
+<path d="m363.61 3.8284a7.4202 7.4202 0 0 1-13.366-1.5209"/>
+<path d="m315.37 72.663a8.3836 8.3836 0 0 1-2.4477 2.11"/>
+<path d="m312.92 74.773a0.15153 0.15153 0 0 0-0.13865-0.22408"/>
+<path d="m312.78 74.549a13.12 13.12 0 0 0 2.5863-1.886"/>
+<path d="m309.07 59.109a2.1821 2.1821 0 0 1-1.5026 1.2189"/>
+<path d="m307.57 60.328a0.096405 0.096405 0 0 0-0.0428-0.16205"/>
+<path d="m307.53 60.166a2.4743 2.4743 0 0 0 1.5454-1.0568"/>
+<path d="m343.22 6.3772a4.0844 4.0844 0 0 1-4.7501-2.3089"/>
+<path d="m338.47 4.0683a0.32076 0.32076 0 0 0 0.50154-0.23946"/>
+<path d="m338.97 3.8289a4.16 4.16 0 0 0 4.2486 2.5483"/>
+<path d="m311.97 72.965a4.8425 4.8425 0 0 1 3.3958-0.30183"/>
+<path d="m315.37 72.663a15.953 15.953 0 0 0-2.8162 1.1156"/>
+<path d="m312.55 73.778a0.5269 0.5269 0 0 0-0.57963-0.81379"/>
+<path d="m366.45 1.6062a2.9141 2.9141 0 0 1-2.8362 2.2222"/>
+<path d="m363.61 3.8284a3.7734 3.7734 0 0 0 1.6884-2.3159"/>
+<path d="m365.3 1.5125a0.60488 0.60488 0 0 0 1.1478 0.093722"/>
+<path d="m387.17 89.952a0.41189 0.41189 0 0 0-0.70224 0.26791"/>
+<path d="m386.47 90.219a1.7851 1.7851 0 0 1 0.57321-2.3303"/>
+<path d="m387.04 87.889a1.9129 1.9129 0 0 0 0.12903 2.0624"/>
+<path d="m306.62 49.965a0.51287 0.51287 0 0 0 0.23503-0.92049"/>
+<path d="m306.85 49.045a5.3946 5.3946 0 0 1 3.2519 1.4518"/>
+<path d="m310.1 50.497a13.12 13.12 0 0 0-3.487-0.5313"/>
+<path d="m402.95 68.488a10.392 10.392 0 0 0-7.9451 0.35375"/>
+<path d="m395 68.842a8.0983 8.0983 0 0 1 8.2941-3.5125"/>
+<path d="m403.3 65.329a1.7188 1.7188 0 0 0-0.34899 3.1588"/>
+<path d="m352.38 100.17a2.9141 2.9141 0 0 0-2.9073-3.0016"/>
+<path d="m349.47 97.165a3.7734 3.7734 0 0 1 5.6211 2.2373"/>
+<path d="m355.09 99.402a1.5714 1.5714 0 0 0-2.7138 0.76432"/>
+<path d="m369.86 94.616a4.0844 4.0844 0 0 0-3.0191 4.6082"/>
+<path d="m366.84 99.224a0.40582 0.40582 0 0 0-0.69152 0.13617"/>
+<path d="m366.15 99.361a4.16 4.16 0 0 1 3.7107-4.7444"/>
+<path d="m318.07 32.152a9.0837 9.0837 0 0 0-4.186-7.2668"/>
+<path d="m313.89 24.885a0.49931 0.49931 0 0 0 0.44232-0.74487"/>
+<path d="m314.33 24.14a8.4957 8.4957 0 0 1 3.7437 8.0117"/>
+<path d="m404.01 41.885a2.1821 2.1821 0 0 0 2.0327 3.091"/>
+<path d="m406.04 44.976a0.43049 0.43049 0 0 0 0.0405 0.74545"/>
+<path d="m406.08 45.721a2.4743 2.4743 0 0 1-2.0732-3.8365"/>
+<path d="m338.99 96.752a2.8016 2.8016 0 0 0-4.4117-2.742"/>
+<path d="m334.58 94.01a15.953 15.953 0 0 0-0.40663-12.963"/>
+<path d="m334.17 81.047a14.087 14.087 0 0 1 4.8183 15.705"/>
+<path d="m323.03 13.54a0.53417 0.53417 0 0 0 0.82363-0.58563"/>
+<path d="m323.85 12.954a1.7851 1.7851 0 0 0 2.1869 0.15038"/>
+<path d="m326.04 13.104a1.9129 1.9129 0 0 1-3.0105 0.43524"/>
+<path d="m362.83 98.686a4.1936 4.1936 0 0 1 0.42287 1.3232"/>
+<path d="m363.26 100.01a0.063645 0.063645 0 0 0-0.10898 0.02"/>
+<path d="m363.15 100.03a7.4202 7.4202 0 0 0-0.31389-1.3431"/>
+<path d="m402.97 50.497a27.92 27.92 0 0 0 3.4786 0.2456"/>
+<path d="m406.45 50.742a0.1643 0.1643 0 0 0 8e-3 0.2857"/>
+<path d="m406.46 51.028a13.12 13.12 0 0 1-3.487-0.5313"/>
+<path d="m362.39 100.11a1.9252 1.9252 0 0 1 0.44459-1.4277"/>
+<path d="m362.83 98.686a5.189 5.189 0 0 0-0.0268 1.3164"/>
+<path d="m362.81 100a0.22748 0.22748 0 0 0-0.41777 0.11136"/>
+<path d="m382.8 8.3498a27.92 27.92 0 0 0-3.8956 11.597"/>
+<path d="m378.9 19.947a15.953 15.953 0 0 1-0.40663-12.963"/>
+<path d="m378.5 6.9835a2.4407 2.4407 0 0 0 4.3022 1.3663"/>
+<path d="m348.48 99.783a0.41385 0.41385 0 0 0-0.70402-0.30206"/>
+<path d="m347.78 99.481a3.7734 3.7734 0 0 1 1.6884-2.3159"/>
+<path d="m349.47 97.165a7.4202 7.4202 0 0 0-0.98439 2.618"/>
+<path d="m400.3 26.445a0.43127 0.43127 0 0 0 0.22985 0.77034"/>
+<path d="m400.53 27.215a15.953 15.953 0 0 1-2.8162 1.1156"/>
+<path d="m397.71 28.331a13.12 13.12 0 0 1 2.5863-1.886"/>
+<path d="m388.79 88.637a2.2243 2.2243 0 0 0-1.7522-0.74753"/>
+<path d="m387.04 87.889a1.7851 1.7851 0 0 1 2.1869 0.15038"/>
+<path d="m389.23 88.04a0.39603 0.39603 0 0 0-0.43463 0.59714"/>
+<path d="m326.04 13.104a2.062 2.062 0 0 0-0.27635-1.9441"/>
+<path d="m325.76 11.16a0.10849 0.10849 0 0 0 0.14731-0.11833"/>
+<path d="m325.91 11.042a1.9129 1.9129 0 0 1 0.12904 2.0624"/>
+<path d="m374.11 97.165a0.73602 0.73602 0 0 0-1.3564 0.26894"/>
+<path d="m372.75 97.434a5.189 5.189 0 0 0-2.8922-2.8173"/>
+<path d="m369.86 94.616a4.16 4.16 0 0 1 4.2486 2.5483"/>
+<path d="m405.55 40.828a0.24932 0.24932 0 0 0 5e-3 0.4676"/>
+<path d="m405.56 41.296a5.3946 5.3946 0 0 0-1.5502 0.58924"/>
+<path d="m404.01 41.885a2.4743 2.4743 0 0 1 1.5454-1.0568"/>
+<path d="m363.61 3.8284a11.842 11.842 0 0 0 0.76006-2.6462"/>
+<path d="m364.37 1.1822a0.12992 0.12992 0 0 0 0.22433 0.028229"/>
+<path d="m364.59 1.2104a7.4202 7.4202 0 0 1-0.98439 2.6179"/>
+<path d="m307.35 59.225a8.3836 8.3836 0 0 1 1.7219-0.11642"/>
+<path d="m309.07 59.109a5.3946 5.3946 0 0 1-1.5502 0.58924"/>
+<path d="m307.52 59.698a0.26593 0.26593 0 0 0-0.17171-0.47281"/>
+<path d="m341.43 2.9365a11.842 11.842 0 0 0 1.793 3.4408"/>
+<path d="m343.22 6.3772a5.189 5.189 0 0 1-2.8922-2.8173"/>
+<path d="m340.33 3.5599a0.67341 0.67341 0 0 0 1.0992-0.62348"/>
+<path d="m349.93 0.96433a0.18314 0.18314 0 0 0 0.34071 0.026762"/>
+<path d="m350.27 0.99109a5.189 5.189 0 0 1-0.02683 1.3164"/>
+<path d="m350.24 2.3075a7.4202 7.4202 0 0 1-0.31388-1.3431"/>
+<path d="m296.32 26.328a14.144 14.144 0 0 0 3.5728 24.047"/>
+<path d="m299.9 50.375a28.045 28.045 0 0 0-22.57 25.075"/>
+<path d="m277.33 75.45a44.966 44.966 0 0 1 18.997-49.122"/>
+<path d="m250.99 91.76a16.562 16.562 0 0 0-26.354-3.6981"/>
+<path d="m224.63 88.062a3.5397 3.5397 0 0 0-4.6838-4.0132"/>
+<path d="m219.95 84.048a19.845 19.845 0 0 1 31.038 7.7113"/>
+<path d="m210.06 50.375a14.144 14.144 0 0 1 3.5728 24.047"/>
+<path d="m213.63 74.422a3.2918 3.2918 0 0 0-3.6251-4.2437"/>
+<path d="m210.01 70.178a11.25 11.25 0 0 0 0.0523-19.803"/>
+<path d="m209.31 31.928a20.73 20.73 0 0 0 23.318-6.6287"/>
+<path d="m232.63 25.3a28.045 28.045 0 0 1-22.57 25.075"/>
+<path d="m210.06 50.375a10.497 10.497 0 0 0-0.74813-18.446"/>
+<path d="m251.08 0.70581a1.4065 1.4065 0 0 0 2.6197 0.3711"/>
+<path d="m253.7 1.0769a10.048 10.048 0 0 0 5.2687 7.9128"/>
+<path d="m258.97 8.9898a9.2881 9.2881 0 0 1-7.8884-8.284"/>
+<path d="m293.5 18.626a0.53614 0.53614 0 0 0 0.5283 0.87728"/>
+<path d="m294.03 19.503a1.4521 1.4521 0 0 0 0.29225 2.2174"/>
+<path d="m294.32 21.72a1.8008 1.8008 0 0 1-0.82055-3.0947"/>
+<path d="m232.63 25.3a20.73 20.73 0 0 0 3.0321-20.454"/>
+<path d="m235.66 4.846a1.0343 1.0343 0 0 0 1.6302-0.84772"/>
+<path d="m237.29 3.9983a20.462 20.462 0 0 1-4.6623 21.301"/>
+<path d="m277.33 75.45a20.73 20.73 0 0 1 23.318-6.6287"/>
+<path d="m300.65 68.821a1.2991 1.2991 0 0 0-0.58742 2.2109"/>
+<path d="m300.06 71.032a20.462 20.462 0 0 0-22.731 4.4178"/>
+<path d="m285.32 12.688a16.562 16.562 0 0 1-26.354-3.6981"/>
+<path d="m258.97 8.9898a10.048 10.048 0 0 0 13.454-3.8701"/>
+<path d="m272.42 5.1196a7.9745 7.9745 0 0 0 12.9 7.5682"/>
+<path d="m253 100.17a16.562 16.562 0 0 0-2.0074-8.4076"/>
+<path d="m250.99 91.76a10.048 10.048 0 0 1 5.2687 7.9128"/>
+<path d="m256.26 99.673a1.7203 1.7203 0 0 0-3.2613 0.49475"/>
+<path d="m215.25 80.672a1.376 1.376 0 0 0 0.38776-1.6424"/>
+<path d="m215.64 79.029a1.4521 1.4521 0 0 1 0.29225 2.2174"/>
+<path d="m215.93 81.247a0.46582 0.46582 0 0 0-0.68001-0.57503"/>
+<path d="m289.09 13.958a1.7033 1.7033 0 0 0 0.9198 2.7435"/>
+<path d="m290.01 16.701a3.5397 3.5397 0 0 1-4.6838-4.0132"/>
+<path d="m285.32 12.688a2.2324 2.2324 0 0 0 3.764 1.2697"/>
+<path d="m299.85 28.522a1.157 1.157 0 0 0 0.0956 2.0496"/>
+<path d="m299.95 30.572a3.2918 3.2918 0 0 1-3.6251-4.2437"/>
+<path d="m296.32 26.328a2.51 2.51 0 0 0 3.5294 2.194"/>
+<path d="m212.47 76.639a0.25815 0.25815 0 0 0-0.16174-0.45986"/>
+<path d="m212.31 76.179a3.2918 3.2918 0 0 0 1.3242-1.7578"/>
+<path d="m213.63 74.422a2.51 2.51 0 0 1-1.1625 2.2177"/>
+<path d="m299.9 50.375a14.144 14.144 0 0 0 4.976 1.0525"/>
+<path d="m304.87 51.427a0.17101 0.17101 0 0 0 0.0271 0.30444"/>
+<path d="m304.9 51.732a11.25 11.25 0 0 1-5.0031-1.3569"/>
+<path d="m215.64 79.029a1.376 1.376 0 0 0-1.9775-0.59761"/>
+<path d="m213.66 78.432a0.10945 0.10945 0 0 0-0.12325-0.15277"/>
+<path d="m213.54 78.279a1.4154 1.4154 0 0 1 2.1007 0.75038"/>
+<path d="m290.01 16.701a1.7033 1.7033 0 0 0 1.5306-0.39033"/>
+<path d="m291.54 16.311a0.058152 0.058152 0 0 0 0.0784 0.06855"/>
+<path d="m291.61 16.379a1.6013 1.6013 0 0 1-1.609 0.32178"/>
+<path d="m219.95 84.048a1.7033 1.7033 0 0 1 0.9198 2.7435"/>
+<path d="m220.87 86.792a0.17408 0.17408 0 0 0-0.25666-0.17171"/>
+<path d="m220.61 86.62a1.6013 1.6013 0 0 0-0.66314-2.5718"/>
+<path d="m258.97 8.9898a16.562 16.562 0 0 1-2.0074-8.4076"/>
+<path d="m256.96 0.58216a0.3015 0.3015 0 0 0 0.5356-0.043627"/>
+<path d="m257.5 0.53853a19.845 19.845 0 0 0 1.4718 8.4512"/>
+<path d="m294.32 21.72a1.376 1.376 0 0 1 0.38776-1.6424"/>
+<path d="m294.71 20.078a0.065699 0.065699 0 0 0 0.0832 0.08242"/>
+<path d="m294.79 20.16a1.4154 1.4154 0 0 0-0.471 1.56"/>
+<path d="m274.3 95.904a20.73 20.73 0 0 1 3.0321-20.454"/>
+<path d="m277.33 75.45a28.045 28.045 0 0 0 3.5478 16.295"/>
+<path d="m280.88 91.745a4.0699 4.0699 0 0 0-6.5799 4.1587"/>
+<path d="m298.08 25.106a14.144 14.144 0 0 0-1.7543 1.2223"/>
+<path d="m296.32 26.328a3.2918 3.2918 0 0 1 1.3242-1.7578"/>
+<path d="m297.65 24.57a0.35457 0.35457 0 0 0 0.43004 0.53546"/>
+<path d="m240.79 98.114a2.2729 2.2729 0 0 0-3.254-2.4837"/>
+<path d="m237.53 95.63a10.048 10.048 0 0 1 13.454-3.8701"/>
+<path d="m250.99 91.76a9.2881 9.2881 0 0 0-10.2 6.3538"/>
+<path d="m304.9 48.905a0.52115 0.52115 0 0 0-0.20311 0.95696"/>
+<path d="m304.69 49.862a28.045 28.045 0 0 0-4.7962 0.51258"/>
+<path d="m299.9 50.375a10.497 10.497 0 0 1 4.9993-1.4695"/>
+<path d="m224.63 88.062a16.562 16.562 0 0 0-1.0592 1.1855"/>
+<path d="m223.57 89.247a0.05025 0.05025 0 0 0-0.076-0.048"/>
+<path d="m223.5 89.199a7.9745 7.9745 0 0 1 1.1352-1.1376"/>
+<path d="m213.63 74.422a14.144 14.144 0 0 1-1.7543 1.2223"/>
+<path d="m211.88 75.644a0.067654 0.067654 0 0 0-0.0731-0.09631"/>
+<path d="m211.8 75.548a44.966 44.966 0 0 0 1.8274-1.126"/>
+<path d="m218.42 84.439a1.7033 1.7033 0 0 1 1.5306-0.39033"/>
+<path d="m219.95 84.048a3.5397 3.5397 0 0 0-1.169 0.70625"/>
+<path d="m218.78 84.755a0.24653 0.24653 0 0 0-0.36163-0.31593"/>
+<path d="m205.08 49.322a14.144 14.144 0 0 1 4.976 1.0525"/>
+<path d="m210.06 50.375a28.045 28.045 0 0 1-4.7962 0.51258"/>
+<path d="m205.26 50.887a0.81299 0.81299 0 0 0-0.1798-1.5651"/>
+<path d="m296.3 22.318a1.376 1.376 0 0 1-1.9775-0.59761"/>
+<path d="m294.32 21.72a1.4521 1.4521 0 0 0 1.5197 0.01523"/>
+<path d="m295.84 21.736a0.37942 0.37942 0 0 0 0.45776 0.58239"/>
+<path d="m225.49 10.257a2.0634 2.0634 0 0 0 3.5867-1.2519"/>
+<path d="m229.08 9.0047a28.045 28.045 0 0 1 3.5478 16.295"/>
+<path d="m232.63 25.3a44.966 44.966 0 0 0-7.1345-15.043"/>
+<path d="m224.2 89.751a0.17217 0.17217 0 0 0-0.20531-0.25149"/>
+<path d="m223.99 89.5a3.5397 3.5397 0 0 0 0.64194-1.4383"/>
+<path d="m224.63 88.062a2.2324 2.2324 0 0 1-0.43663 1.6898"/>
+<path d="m286.38 11.502a16.562 16.562 0 0 1-1.0592 1.1855"/>
+<path d="m285.32 12.688a3.5397 3.5397 0 0 1 0.64195-1.4383"/>
+<path d="m285.96 11.25a0.25143 0.25143 0 0 0 0.4173 0.25278"/>
+<path d="m214.22 79.31a0.16881 0.16881 0 0 0-0.1039-0.296"/>
+<path d="m214.12 79.014a1.4521 1.4521 0 0 1 1.5197 0.01523"/>
+<path d="m215.64 79.029a1.8008 1.8008 0 0 0-1.4158 0.28078"/>
+<path d="m291.05 15.771a0.13745 0.13745 0 0 0 0.12656 0.2242"/>
+<path d="m291.17 15.995a3.5397 3.5397 0 0 1-1.169 0.70625"/>
+<path d="m290.01 16.701a19.845 19.845 0 0 0 1.0424-0.93045"/>
+<path d="m277.33 75.45a28.045 28.045 0 0 1 22.57-25.075"/>
+<path d="m299.9 50.375a10.497 10.497 0 0 0 0.74812 18.446"/>
+<path d="m300.65 68.821a20.73 20.73 0 0 0-23.318 6.6287"/>
+<path d="m219.95 84.048a3.5397 3.5397 0 0 1 4.6838 4.0132"/>
+<path d="m224.63 88.062a2.2324 2.2324 0 0 0-3.764-1.2697"/>
+<path d="m220.87 86.792a1.7033 1.7033 0 0 0-0.9198-2.7435"/>
+<path d="m210.01 70.178a3.2918 3.2918 0 0 1 3.6251 4.2437"/>
+<path d="m213.63 74.422a2.51 2.51 0 0 0-3.5294-2.194"/>
+<path d="m210.1 72.228a1.157 1.157 0 0 0-0.0956-2.0496"/>
+<path d="m210.06 50.375a28.045 28.045 0 0 0 22.57-25.075"/>
+<path d="m232.63 25.3a44.966 44.966 0 0 1-18.997 49.122"/>
+<path d="m213.63 74.422a14.144 14.144 0 0 0-3.5728-24.047"/>
+<path d="m258.97 8.9898a10.048 10.048 0 0 1-5.2687-7.9128"/>
+<path d="m253.7 1.0769a1.7203 1.7203 0 0 0 3.2613-0.49475"/>
+<path d="m256.96 0.58216a16.562 16.562 0 0 0 2.0074 8.4076"/>
+<path d="m294.32 21.72a1.4521 1.4521 0 0 1-0.29225-2.2174"/>
+<path d="m294.03 19.503a0.46582 0.46582 0 0 0 0.68001 0.57502"/>
+<path d="m294.71 20.078a1.376 1.376 0 0 0-0.38776 1.6424"/>
+<path d="m272.42 5.1196a10.048 10.048 0 0 1-13.454 3.8701"/>
+<path d="m258.97 8.9898a9.2881 9.2881 0 0 0 10.2-6.3538"/>
+<path d="m269.17 2.636a2.2729 2.2729 0 0 0 3.254 2.4837"/>
+<path d="m256.26 99.673a10.048 10.048 0 0 0-5.2687-7.9128"/>
+<path d="m250.99 91.76a9.2881 9.2881 0 0 1 7.8884 8.2839"/>
+<path d="m258.88 100.04a1.4065 1.4065 0 0 0-2.6197-0.3711"/>
+<path d="m215.93 81.247a1.4521 1.4521 0 0 0-0.29225-2.2174"/>
+<path d="m215.64 79.029a1.8008 1.8008 0 0 1 0.82055 3.0947"/>
+<path d="m216.46 82.124a0.53614 0.53614 0 0 0-0.5283-0.87727"/>
+<path d="m285.32 12.688a3.5397 3.5397 0 0 0 4.6838 4.0132"/>
+<path d="m290.01 16.701a19.845 19.845 0 0 1-31.038-7.7113"/>
+<path d="m258.97 8.9898a16.562 16.562 0 0 0 26.354 3.6981"/>
+<path d="m296.32 26.328a3.2918 3.2918 0 0 0 3.6251 4.2437"/>
+<path d="m299.95 30.572a11.25 11.25 0 0 0-0.0523 19.803"/>
+<path d="m299.9 50.375a14.144 14.144 0 0 1-3.5728-24.047"/>
+<path d="m213.63 74.422a3.2918 3.2918 0 0 1-1.3242 1.7578"/>
+<path d="m212.31 76.179a0.35457 0.35457 0 0 0-0.43004-0.53546"/>
+<path d="m211.88 75.644a14.144 14.144 0 0 0 1.7543-1.2223"/>
+<path d="m280.88 91.745a28.045 28.045 0 0 1-3.5478-16.295"/>
+<path d="m277.33 75.45a44.966 44.966 0 0 0 7.1345 15.043"/>
+<path d="m284.46 90.493a2.0634 2.0634 0 0 0-3.5867 1.2519"/>
+<path d="m297.65 24.57a3.2918 3.2918 0 0 0-1.3242 1.7578"/>
+<path d="m296.32 26.328a2.51 2.51 0 0 1 1.1625-2.2176"/>
+<path d="m297.49 24.11a0.25815 0.25815 0 0 0 0.16174 0.45986"/>
+<path d="m274.3 95.904a1.0343 1.0343 0 0 0-1.6302 0.84772"/>
+<path d="m272.67 96.751a20.462 20.462 0 0 1 4.6623-21.301"/>
+<path d="m277.33 75.45a20.73 20.73 0 0 0-3.0321 20.454"/>
+<path d="m250.99 91.76a10.048 10.048 0 0 0-13.454 3.8701"/>
+<path d="m237.53 95.63a7.9745 7.9745 0 0 0-12.9-7.5682"/>
+<path d="m224.63 88.062a16.562 16.562 0 0 1 26.354 3.6981"/>
+<path d="m209.31 31.928a1.2991 1.2991 0 0 0 0.58743-2.2109"/>
+<path d="m209.9 29.718a20.462 20.462 0 0 0 22.731-4.4178"/>
+<path d="m232.63 25.3a20.73 20.73 0 0 1-23.318 6.6287"/>
+<path d="m299.9 50.375a28.045 28.045 0 0 1 4.7962-0.51258"/>
+<path d="m304.69 49.862a0.81299 0.81299 0 0 0 0.1798 1.5651"/>
+<path d="m304.87 51.427a14.144 14.144 0 0 1-4.976-1.0525"/>
+<path d="m218.78 84.755a3.5397 3.5397 0 0 1 1.169-0.70625"/>
+<path d="m219.95 84.048a19.845 19.845 0 0 0-1.0424 0.93045"/>
+<path d="m218.91 84.979a0.13745 0.13745 0 0 0-0.12656-0.2242"/>
+<path d="m205.26 50.887a28.045 28.045 0 0 0 4.7962-0.51258"/>
+<path d="m210.06 50.375a10.497 10.497 0 0 1-4.9993 1.4695"/>
+<path d="m205.06 51.844a0.52115 0.52115 0 0 0 0.2031-0.95696"/>
+<path d="m295.84 21.736a1.4521 1.4521 0 0 1-1.5197-0.01523"/>
+<path d="m294.32 21.72a1.8008 1.8008 0 0 0 1.4158-0.28078"/>
+<path d="m295.73 21.44a0.16881 0.16881 0 0 0 0.1039 0.296"/>
+<path d="m218.42 84.439a0.058152 0.058152 0 0 0-0.0784-0.06855"/>
+<path d="m218.34 84.37a1.6013 1.6013 0 0 1 1.609-0.32178"/>
+<path d="m219.95 84.048a1.7033 1.7033 0 0 0-1.5306 0.39033"/>
+<path d="m205.08 49.322a0.17101 0.17101 0 0 0-0.0271-0.30444"/>
+<path d="m205.05 49.018a11.25 11.25 0 0 1 5.0031 1.3569"/>
+<path d="m210.06 50.375a14.144 14.144 0 0 0-4.976-1.0525"/>
+<path d="m296.3 22.318a0.10945 0.10945 0 0 0 0.12325 0.15277"/>
+<path d="m296.42 22.471a1.4154 1.4154 0 0 1-2.1007-0.75038"/>
+<path d="m294.32 21.72a1.376 1.376 0 0 0 1.9775 0.59761"/>
+<path d="m232.63 25.3a28.045 28.045 0 0 0-3.5478-16.295"/>
+<path d="m229.08 9.0047a4.0699 4.0699 0 0 0 6.5799-4.1587"/>
+<path d="m235.66 4.846a20.73 20.73 0 0 1-3.0321 20.454"/>
+<path d="m253 100.17a0.3015 0.3015 0 0 0-0.5356 0.0436"/>
+<path d="m252.46 100.21a19.845 19.845 0 0 0-1.4718-8.4512"/>
+<path d="m250.99 91.76a16.562 16.562 0 0 1 2.0074 8.4076"/>
+<path d="m215.25 80.672a0.065699 0.065699 0 0 0-0.0832-0.08241"/>
+<path d="m215.17 80.589a1.4154 1.4154 0 0 0 0.47099-1.56"/>
+<path d="m215.64 79.029a1.376 1.376 0 0 1-0.38776 1.6424"/>
+<path d="m289.09 13.958a0.17408 0.17408 0 0 0 0.25666 0.1717"/>
+<path d="m289.34 14.129a1.6013 1.6013 0 0 0 0.66314 2.5718"/>
+<path d="m290.01 16.701a1.7033 1.7033 0 0 1-0.9198-2.7435"/>
+<path d="m224.63 88.062a3.5397 3.5397 0 0 1-0.64194 1.4383"/>
+<path d="m223.99 89.5a0.25143 0.25143 0 0 0-0.4173-0.25278"/>
+<path d="m223.57 89.247a16.562 16.562 0 0 1 1.0592-1.1855"/>
+<path d="m285.96 11.25a3.5397 3.5397 0 0 0-0.64195 1.4383"/>
+<path d="m285.32 12.688a2.2324 2.2324 0 0 1 0.43664-1.6898"/>
+<path d="m285.76 10.998a0.17217 0.17217 0 0 0 0.20531 0.25149"/>
+<path d="m286.38 11.502a0.05025 0.05025 0 0 0 0.076 0.048"/>
+<path d="m286.46 11.55a7.9745 7.9745 0 0 1-1.1352 1.1375"/>
+<path d="m285.32 12.688a16.562 16.562 0 0 0 1.0592-1.1855"/>
+<path d="m298.08 25.106a0.067654 0.067654 0 0 0 0.0731 0.09631"/>
+<path d="m298.15 25.202a44.966 44.966 0 0 0-1.8274 1.126"/>
+<path d="m296.32 26.328a14.144 14.144 0 0 1 1.7543-1.2223"/>
+<path d="m215.64 79.029a1.4521 1.4521 0 0 0-1.5197-0.01523"/>
+<path d="m214.12 79.014a0.37942 0.37942 0 0 0-0.45776-0.58238"/>
+<path d="m213.66 78.432a1.376 1.376 0 0 1 1.9775 0.59761"/>
+<path d="m290.01 16.701a3.5397 3.5397 0 0 0 1.169-0.70625"/>
+<path d="m291.17 15.995a0.24653 0.24653 0 0 0 0.36163 0.31592"/>
+<path d="m291.54 16.311a1.7033 1.7033 0 0 1-1.5306 0.39033"/>
+<path d="m296.32 26.328a44.966 44.966 0 0 0-18.997 49.122"/>
+<path d="m277.33 75.45a121 121 0 0 1-18.36-66.46"/>
+<path d="m258.97 8.9898a26.755 26.755 0 0 0 37.357 17.338"/>
+<path d="m270.32 97.565a3.3629 3.3629 0 0 0-6.3734 0.82243"/>
+<path d="m263.94 98.387a21.692 21.692 0 0 1 13.386-22.938"/>
+<path d="m277.33 75.45a20.465 20.465 0 0 0-7.0127 22.115"/>
+<path d="m250.99 91.76a19.845 19.845 0 0 0-31.038-7.7113"/>
+<path d="m219.95 84.048a6.2902 6.2902 0 0 0-6.3192-9.6269"/>
+<path d="m213.63 74.422a26.755 26.755 0 0 1 37.357 17.338"/>
+<path d="m210.06 50.375a11.25 11.25 0 0 1-0.0523 19.803"/>
+<path d="m210.01 70.178a2.3463 2.3463 0 0 0-1.918-3.9785"/>
+<path d="m208.09 66.199a9.1146 9.1146 0 0 0 1.9703-15.825"/>
+<path d="m209.31 31.928a10.497 10.497 0 0 1 0.74813 18.446"/>
+<path d="m210.06 50.375a7.2173 7.2173 0 0 0-3.0125-11.648"/>
+<path d="m207.05 38.727a3.714 3.714 0 0 0 2.2644-6.7987"/>
+<path d="m251.08 0.70581a9.2881 9.2881 0 0 0 7.8884 8.284"/>
+<path d="m258.97 8.9898a9.5775 9.5775 0 0 1-10.881-7.6211"/>
+<path d="m248.09 1.3686a1.5827 1.5827 0 0 0 2.9922-0.66283"/>
+<path d="m293.5 18.626a1.8008 1.8008 0 0 0 0.82055 3.0947"/>
+<path d="m294.32 21.72a2.6038 2.6038 0 0 1-2.2244-4.2582"/>
+<path d="m292.09 17.462a0.94756 0.94756 0 0 0 1.4038 1.1635"/>
+<path d="m218.25 84.27a0.17233 0.17233 0 0 0-0.19761-0.27085"/>
+<path d="m218.05 83.999a1.4337 1.4337 0 0 1 1.8993 0.04934"/>
+<path d="m219.95 84.048a1.5144 1.5144 0 0 0-1.7017 0.22151"/>
+<path d="m205.06 48.635a0.44513 0.44513 0 0 0 0.12229-0.85753"/>
+<path d="m205.19 47.777a6.8143 6.8143 0 0 1 4.8714 2.5978"/>
+<path d="m210.06 50.375a9.1146 9.1146 0 0 0-4.9937-1.7402"/>
+<path d="m296.57 22.708a0.43554 0.43554 0 0 0 0.35272 0.76498"/>
+<path d="m296.92 23.473a1.7918 1.7918 0 0 1-2.6064-1.7523"/>
+<path d="m294.32 21.72a1.4914 1.4914 0 0 0 2.2536 0.98737"/>
+<path d="m232.63 25.3a20.462 20.462 0 0 0 4.6623-21.301"/>
+<path d="m237.29 3.9983a1.3079 1.3079 0 0 0 2.3503-0.81363"/>
+<path d="m239.64 3.1846a20.465 20.465 0 0 1-7.0127 22.115"/>
+<path d="m301.87 34.55a2.7397 2.7397 0 0 0 1.3547 5.1251"/>
+<path d="m303.22 39.675a6.8143 6.8143 0 0 0-3.325 10.7"/>
+<path d="m299.9 50.375a9.1146 9.1146 0 0 1 1.9703-15.825"/>
+<path d="m277.33 75.45a20.462 20.462 0 0 1 22.731-4.4178"/>
+<path d="m300.06 71.032a1.3066 1.3066 0 0 0-1.022 2.2635"/>
+<path d="m299.04 73.295a20.465 20.465 0 0 0-21.709 2.1543"/>
+<path d="m285.32 12.688a7.9745 7.9745 0 0 1-12.9-7.5682"/>
+<path d="m272.42 5.1196a3.2113 3.2113 0 0 0 5.7313 1.5546"/>
+<path d="m278.15 6.6742a4.928 4.928 0 0 0 7.1685 6.0136"/>
+<path d="m289.09 13.958a2.2324 2.2324 0 0 1-3.764-1.2697"/>
+<path d="m285.32 12.688a1.8172 1.8172 0 0 0 2.9059 0.50842"/>
+<path d="m288.23 13.196a0.58598 0.58598 0 0 0 0.85812 0.76132"/>
+<path d="m299.85 28.522a2.51 2.51 0 0 1-3.5294-2.194"/>
+<path d="m296.32 26.328a2.2565 2.2565 0 0 0 3.0509 1.3035"/>
+<path d="m299.38 27.631a0.51646 0.51646 0 0 0 0.47856 0.89059"/>
+<path d="m212.47 76.639a2.51 2.51 0 0 0 1.1625-2.2177"/>
+<path d="m213.63 74.422a2.2565 2.2565 0 0 1-0.85446 2.6188"/>
+<path d="m212.78 77.04a0.25921 0.25921 0 0 0-0.30803-0.40115"/>
+<path d="m286.54 11.619a0.1243 0.1243 0 0 0 0.17245 0.17028"/>
+<path d="m286.72 11.79a2.8381 2.8381 0 0 1-1.3942 0.89828"/>
+<path d="m285.32 12.688a4.9281 4.9281 0 0 0 1.2218-1.0686"/>
+<path d="m298.23 25.328a0.16026 0.16026 0 0 0 0.13108 0.28371"/>
+<path d="m298.36 25.612a6.2902 6.2902 0 0 1-2.0337 0.7164"/>
+<path d="m296.32 26.328a26.755 26.755 0 0 0 1.9026-1.0001"/>
+<path d="m299.9 50.375a11.25 11.25 0 0 0 5.0031 1.3569"/>
+<path d="m304.9 51.732a0.20028 0.20028 0 0 0-9e-3 0.38328"/>
+<path d="m304.89 52.115a9.1146 9.1146 0 0 1-4.9937-1.7402"/>
+<path d="m215.64 79.029a1.4154 1.4154 0 0 0-2.1007-0.75038"/>
+<path d="m213.54 78.279a0.1473 0.1473 0 0 0-0.15291-0.23698"/>
+<path d="m213.38 78.042a1.4914 1.4914 0 0 1 2.2536 0.98736"/>
+<path d="m290.01 16.701a1.6013 1.6013 0 0 0 1.609-0.32178"/>
+<path d="m291.61 16.379a0.071251 0.071251 0 0 0 0.0926 0.10026"/>
+<path d="m291.71 16.48a1.5144 1.5144 0 0 1-1.7017 0.22152"/>
+<path d="m231.8 94.075a2.2459 2.2459 0 0 0-3.8306-2.0681"/>
+<path d="m227.97 92.007a2.8381 2.8381 0 0 0-3.338-3.9455"/>
+<path d="m224.63 88.062a4.928 4.928 0 0 1 7.1686 6.0136"/>
+<path d="m210.92 27.454a2.2732 2.2732 0 0 0 2.4341-3.664"/>
+<path d="m213.35 23.79a21.692 21.692 0 0 0 19.275 1.5097"/>
+<path d="m232.63 25.3a20.465 20.465 0 0 1-21.709 2.1543"/>
+<path d="m219.95 84.048a1.6013 1.6013 0 0 1 0.66314 2.5718"/>
+<path d="m220.61 86.62a0.16194 0.16194 0 0 0-0.23296-0.20422"/>
+<path d="m220.38 86.416a1.5144 1.5144 0 0 0-0.43018-2.3675"/>
+<path d="m258.97 8.9898a19.845 19.845 0 0 1-1.4718-8.4512"/>
+<path d="m257.5 0.53853a0.33203 0.33203 0 0 0 0.6345 0.025654"/>
+<path d="m258.13 0.56419a26.755 26.755 0 0 0 0.83729 8.4256"/>
+<path d="m294.32 21.72a1.4154 1.4154 0 0 1 0.47099-1.56"/>
+<path d="m294.79 20.16a0.068171 0.068171 0 0 0 0.0814 0.10204"/>
+<path d="m294.87 20.262a1.4914 1.4914 0 0 0-0.55243 1.458"/>
+<path d="m240.79 98.114a9.2881 9.2881 0 0 1 10.2-6.3538"/>
+<path d="m250.99 91.76a9.5775 9.5775 0 0 0-7.746 6.8978"/>
+<path d="m243.24 98.658a1.2893 1.2893 0 0 0-2.4543-0.54398"/>
+<path d="m304.9 48.905a10.497 10.497 0 0 0-4.9993 1.4695"/>
+<path d="m299.9 50.375a7.2173 7.2173 0 0 1 4.8869-2.3761"/>
+<path d="m304.78 47.999a0.46811 0.46811 0 0 0 0.11239 0.90659"/>
+<path d="m251.82 100.19a0.6641 0.6641 0 0 0-1.2768-0.20392"/>
+<path d="m250.55 99.981a121 121 0 0 0 0.4395-8.2216"/>
+<path d="m250.99 91.76a26.755 26.755 0 0 1 0.83729 8.4256"/>
+<path d="m224.63 88.062a7.9745 7.9745 0 0 0-1.1352 1.1376"/>
+<path d="m223.5 89.199a0.057778 0.057778 0 0 0-0.0866-0.06899"/>
+<path d="m223.41 89.13a4.9281 4.9281 0 0 1 1.2218-1.0686"/>
+<path d="m213.63 74.422a44.966 44.966 0 0 1-1.8274 1.126"/>
+<path d="m211.8 75.548a0.076563 0.076563 0 0 0-0.0752-0.1259"/>
+<path d="m211.73 75.422a26.755 26.755 0 0 1 1.9026-1.0001"/>
+<path d="m215.08 80.487a0.12431 0.12431 0 0 0-0.13208-0.20378"/>
+<path d="m214.95 80.283a1.7918 1.7918 0 0 0 0.68452-1.2542"/>
+<path d="m215.64 79.029a1.4914 1.4914 0 0 1-0.55244 1.458"/>
+<path d="m289.58 14.334a0.25404 0.25404 0 0 0 0.33921 0.36273"/>
+<path d="m289.91 14.696a1.4337 1.4337 0 0 0 0.091 2.0048"/>
+<path d="m290.01 16.701a1.5144 1.5144 0 0 1-0.43018-2.3675"/>
+<path d="m225.49 10.257a44.966 44.966 0 0 1 7.1345 15.043"/>
+<path d="m232.63 25.3a121 121 0 0 0-9.3873-13.016"/>
+<path d="m223.24 12.283a1.5583 1.5583 0 0 0 2.2528-2.0267"/>
+<path d="m224.2 89.751a2.2324 2.2324 0 0 0 0.43663-1.6898"/>
+<path d="m224.63 88.062a1.8172 1.8172 0 0 1-0.16767 1.8621"/>
+<path d="m224.47 89.924a0.16355 0.16355 0 0 0-0.26896-0.17232"/>
+<path d="m214.22 79.31a1.8008 1.8008 0 0 1 1.4158-0.28078"/>
+<path d="m215.64 79.029a2.6037 2.6037 0 0 0-1.2702 0.46028"/>
+<path d="m214.37 79.489a0.11807 0.11807 0 0 0-0.14564-0.1795"/>
+<path d="m291.05 15.771a19.845 19.845 0 0 1-1.0424 0.93045"/>
+<path d="m290.01 16.701a6.2902 6.2902 0 0 1 0.88052-1.0752"/>
+<path d="m290.89 15.626a0.11101 0.11101 0 0 0 0.16191 0.14472"/>
+<path d="m258.97 8.9898a121 121 0 0 0 18.36 66.46"/>
+<path d="m277.33 75.45-44.7-50.15"/>
+<path d="m232.63 25.3a28.101 28.101 0 0 0 26.34-16.31"/>
+<path d="m304.04 54.404a2.8816 2.8816 0 0 0-0.83447 5.3588"/>
+<path d="m303.21 59.763a6.3457 6.3457 0 0 1-3.3104-9.3884"/>
+<path d="m299.9 50.375a5.5404 5.5404 0 0 0 4.1449 4.0296"/>
+<path d="m277.33 75.45a21.692 21.692 0 0 0-13.386 22.938"/>
+<path d="m263.94 98.387a10.164 10.164 0 0 0-12.954-6.6276"/>
+<path d="m250.99 91.76a28.101 28.101 0 0 1 26.34-16.31"/>
+<path d="m213.63 74.422a6.2902 6.2902 0 0 1 6.3192 9.6269"/>
+<path d="m219.95 84.048a3.6835 3.6835 0 0 0-4.3126-5.0192"/>
+<path d="m215.64 79.029a3.1745 3.1745 0 0 0-2.0066-4.6076"/>
+<path d="m207.05 38.727a7.2173 7.2173 0 0 1 3.0125 11.648"/>
+<path d="m210.06 50.375a6.3457 6.3457 0 0 0-3.3104-9.3884"/>
+<path d="m206.75 40.986a1.3944 1.3944 0 0 0 0.29791-2.2592"/>
+<path d="m248.09 1.3686a9.5775 9.5775 0 0 0 10.881 7.6211"/>
+<path d="m258.97 8.9898a10.164 10.164 0 0 1-12.954-6.6276"/>
+<path d="m246.01 2.3622a1.4627 1.4627 0 0 0 2.0733-0.99356"/>
+<path d="m292.09 17.462a2.6038 2.6038 0 0 0 2.2244 4.2582"/>
+<path d="m294.32 21.72a3.6835 3.6835 0 0 1-4.3126-5.0192"/>
+<path d="m290.01 16.701a1.5286 1.5286 0 0 0 2.0882 0.76102"/>
+<path d="m223.04 88.586a0.64515 0.64515 0 0 0-0.95057-0.78301"/>
+<path d="m222.09 87.803a1.7054 1.7054 0 0 1 2.5482 0.25867"/>
+<path d="m224.63 88.062a1.9154 1.9154 0 0 0-1.5977 0.52434"/>
+<path d="m211.52 74.621a0.70663 0.70663 0 0 0-0.69383-1.1548"/>
+<path d="m210.82 73.466a2.218 2.218 0 0 1 2.8062 0.95557"/>
+<path d="m213.63 74.422a3.1745 3.1745 0 0 0-2.1124 0.19924"/>
+<path d="m219.95 84.048a1.4337 1.4337 0 0 0-1.8993-0.04934"/>
+<path d="m218.05 83.999a0.44867 0.44867 0 0 0-0.18888-0.71169"/>
+<path d="m217.86 83.287a1.5286 1.5286 0 0 1 2.0882 0.76102"/>
+<path d="m210.06 50.375a6.8143 6.8143 0 0 0-4.8714-2.5978"/>
+<path d="m205.19 47.777a0.9513 0.9513 0 0 0 0.72652-1.4318"/>
+<path d="m205.91 46.345a5.5404 5.5404 0 0 1 4.1449 4.0296"/>
+<path d="m294.32 21.72a1.7918 1.7918 0 0 0 2.6064 1.7523"/>
+<path d="m296.92 23.473a2.218 2.218 0 0 0-0.59974 2.8553"/>
+<path d="m296.32 26.328a3.1745 3.1745 0 0 1-2.0066-4.6076"/>
+<path d="m299.9 50.375a6.8143 6.8143 0 0 1 3.325-10.7"/>
+<path d="m303.22 39.675a2.318 2.318 0 0 0 0.0564 4.153"/>
+<path d="m303.28 43.828a5.5404 5.5404 0 0 0-3.3814 6.5466"/>
+<path d="m288.23 13.196a1.8172 1.8172 0 0 1-2.9059-0.50842"/>
+<path d="m285.32 12.688a1.7054 1.7054 0 0 0 2.5483 0.25868"/>
+<path d="m287.87 12.947a0.26436 0.26436 0 0 0 0.35763 0.24975"/>
+<path d="m299.38 27.631a2.2565 2.2565 0 0 1-3.0509-1.3035"/>
+<path d="m296.32 26.328a2.218 2.218 0 0 0 2.8062 0.95558"/>
+<path d="m299.13 27.284a0.25837 0.25837 0 0 0 0.24468 0.34787"/>
+<path d="m212.78 77.04a2.2565 2.2565 0 0 0 0.85446-2.6188"/>
+<path d="m213.63 74.422a2.218 2.218 0 0 1-0.59974 2.8553"/>
+<path d="m213.03 77.277a0.21615 0.21615 0 0 0-0.25472-0.23647"/>
+<path d="m261.21 1.6252a2.3082 2.3082 0 0 0 4.3277 0.38706"/>
+<path d="m265.53 2.0122a10.164 10.164 0 0 1-6.5667 6.9775"/>
+<path d="m258.97 8.9898a28.101 28.101 0 0 0 2.239-7.3646"/>
+<path d="m285.32 12.688a2.8381 2.8381 0 0 0 1.3942-0.89828"/>
+<path d="m286.72 11.79a0.24819 0.24819 0 0 0 0.20345 0.37394"/>
+<path d="m286.92 12.164a1.9154 1.9154 0 0 1-1.5977 0.52434"/>
+<path d="m296.32 26.328a6.2902 6.2902 0 0 0 2.0337-0.7164"/>
+<path d="m298.36 25.612a0.30306 0.30306 0 0 0 0.0787 0.51716"/>
+<path d="m298.44 26.129a3.1745 3.1745 0 0 1-2.1124 0.19924"/>
+<path d="m206.68 56.921a2.1177 2.1177 0 0 0-1.3444-3.6187"/>
+<path d="m205.33 53.303a6.3457 6.3457 0 0 0 4.7258-2.9279"/>
+<path d="m210.06 50.375a5.5404 5.5404 0 0 1-3.3814 6.5466"/>
+<path d="m224.63 88.062a2.8381 2.8381 0 0 1 3.338 3.9455"/>
+<path d="m227.97 92.007a1.2641 1.2641 0 0 0-1.7721-1.4764"/>
+<path d="m226.2 90.531a1.9154 1.9154 0 0 0-1.5659-2.4691"/>
+<path d="m232.63 25.3a21.692 21.692 0 0 1-19.275-1.5097"/>
+<path d="m213.35 23.79a3.1234 3.1234 0 0 0 4.216-3.3987"/>
+<path d="m217.57 20.391a28.101 28.101 0 0 0 15.059 4.9084"/>
+<path d="m243.24 98.658a9.5775 9.5775 0 0 1 7.746-6.8978"/>
+<path d="m250.99 91.76a10.164 10.164 0 0 0-6.5667 6.9775"/>
+<path d="m244.42 98.737a0.72447 0.72447 0 0 0-1.1794-0.07977"/>
+<path d="m304.78 47.999a7.2173 7.2173 0 0 0-4.8869 2.3761"/>
+<path d="m299.9 50.375a6.3457 6.3457 0 0 1 4.7258-2.9279"/>
+<path d="m304.62 47.447a0.35582 0.35582 0 0 0 0.16108 0.55175"/>
+<path d="m292.39 80.358a4.484 4.484 0 0 0-4.6392 6.7813"/>
+<path d="m287.75 87.139-10.419-11.69"/>
+<path d="m277.33 75.45a28.101 28.101 0 0 1 15.059 4.9084"/>
+<path d="m250.99 91.76a121 121 0 0 1-0.4395 8.2216"/>
+<path d="m250.55 99.981a1.1528 1.1528 0 0 0-1.7994-0.85706"/>
+<path d="m248.75 99.124a28.101 28.101 0 0 1 2.239-7.3646"/>
+<path d="m283.76 10.219a0.89809 0.89809 0 0 0 1.541 0.5228"/>
+<path d="m285.3 10.742a1.7054 1.7054 0 0 0 0.0248 1.9463"/>
+<path d="m285.32 12.688a1.9154 1.9154 0 0 1-1.5659-2.4691"/>
+<path d="m215.64 79.029a1.7918 1.7918 0 0 1-0.68452 1.2542"/>
+<path d="m214.95 80.283a0.18451 0.18451 0 0 0-0.11098-0.30722"/>
+<path d="m214.84 79.976a3.1745 3.1745 0 0 0 0.7955-0.94696"/>
+<path d="m290.01 16.701a1.4337 1.4337 0 0 1-0.091-2.0048"/>
+<path d="m289.91 14.696a0.303 0.303 0 0 0 0.28632 0.46258"/>
+<path d="m290.2 15.159a1.5286 1.5286 0 0 0-0.19535 1.5422"/>
+<path d="m223.24 12.283a121 121 0 0 1 9.3873 13.016"/>
+<path d="m232.63 25.3-10.419-11.69"/>
+<path d="m222.21 13.61a1.0414 1.0414 0 0 0 1.032-1.3267"/>
+<path d="m224.47 89.924a1.8172 1.8172 0 0 0 0.16767-1.8621"/>
+<path d="m224.63 88.062a1.7054 1.7054 0 0 1 0.0248 1.9463"/>
+<path d="m224.66 90.008a0.1301 0.1301 0 0 0-0.19249-0.08418"/>
+<path d="m219.75 85.591a0.37438 0.37438 0 0 0-0.57985-0.39651"/>
+<path d="m219.17 85.194a3.6835 3.6835 0 0 0 0.77519-1.1457"/>
+<path d="m219.95 84.048a1.5286 1.5286 0 0 1-0.19534 1.5422"/>
+<path d="m295.11 20.773a0.29387 0.29387 0 0 0 0.38568 0.40197"/>
+<path d="m295.5 21.175a3.6835 3.6835 0 0 1-1.1812 0.54499"/>
+<path d="m294.32 21.72a3.1745 3.1745 0 0 1 0.7955-0.94697"/>
+<path d="m214.37 79.489a2.6037 2.6037 0 0 1 1.2702-0.46028"/>
+<path d="m215.64 79.029a3.6835 3.6835 0 0 0-1.1812 0.54499"/>
+<path d="m214.46 79.574a0.075109 0.075109 0 0 0-0.089-0.08471"/>
+<path d="m290.89 15.626a6.2902 6.2902 0 0 0-0.88052 1.0752"/>
+<path d="m290.01 16.701a3.6835 3.6835 0 0 1 0.77519-1.1457"/>
+<path d="m290.78 15.555a0.077878 0.077878 0 0 0 0.10533 0.07056"/>
+<path d="m232.63 25.3 44.7 50.15"/>
+<path d="m277.33 75.45a28.101 28.101 0 0 0-26.34 16.31"/>
+<path d="m250.99 91.76a121 121 0 0 0-18.36-66.46"/>
+<path d="m299.9 50.375a6.3457 6.3457 0 0 0 3.3104 9.3884"/>
+<path d="m303.21 59.763a1.3944 1.3944 0 0 0-0.29791 2.2592"/>
+<path d="m302.91 62.022a7.2173 7.2173 0 0 1-3.0125-11.648"/>
+<path d="m250.99 91.76a10.164 10.164 0 0 1 12.954 6.6276"/>
+<path d="m263.94 98.387a1.4627 1.4627 0 0 0-2.0733 0.99357"/>
+<path d="m261.87 99.381a9.5775 9.5775 0 0 0-10.881-7.6211"/>
+<path d="m215.64 79.029a3.6835 3.6835 0 0 1 4.3126 5.0192"/>
+<path d="m219.95 84.048a1.5286 1.5286 0 0 0-2.0882-0.76102"/>
+<path d="m217.86 83.287a2.6038 2.6038 0 0 0-2.2244-4.2582"/>
+<path d="m206.75 40.986a6.3457 6.3457 0 0 1 3.3104 9.3884"/>
+<path d="m210.06 50.375a5.5404 5.5404 0 0 0-4.1449-4.0296"/>
+<path d="m205.91 46.345a2.8816 2.8816 0 0 0 0.83446-5.3588"/>
+<path d="m246.01 2.3622a10.164 10.164 0 0 0 12.954 6.6276"/>
+<path d="m258.97 8.9898a28.101 28.101 0 0 1-26.34 16.31"/>
+<path d="m232.63 25.3a21.692 21.692 0 0 0 13.386-22.938"/>
+<path d="m290.01 16.701a3.6835 3.6835 0 0 0 4.3126 5.0192"/>
+<path d="m294.32 21.72a3.1745 3.1745 0 0 0 2.0066 4.6076"/>
+<path d="m296.32 26.328a6.2902 6.2902 0 0 1-6.3192-9.6269"/>
+<path d="m224.63 88.062a1.7054 1.7054 0 0 0-2.5482-0.25867"/>
+<path d="m222.09 87.803a0.26436 0.26436 0 0 0-0.35765-0.24975"/>
+<path d="m221.73 87.553a1.8172 1.8172 0 0 1 2.9059 0.50842"/>
+<path d="m213.63 74.422a2.218 2.218 0 0 0-2.8062-0.95557"/>
+<path d="m210.82 73.466a0.25837 0.25837 0 0 0-0.24468-0.34788"/>
+<path d="m210.58 73.118a2.2565 2.2565 0 0 1 3.0509 1.3035"/>
+<path d="m296.32 26.328a2.218 2.218 0 0 1 0.59974-2.8553"/>
+<path d="m296.92 23.473a0.21615 0.21615 0 0 0 0.25472 0.23647"/>
+<path d="m297.18 23.709a2.2565 2.2565 0 0 0-0.85446 2.6188"/>
+<path d="m287.87 12.947a1.7054 1.7054 0 0 1-2.5483-0.25868"/>
+<path d="m285.32 12.688a1.9154 1.9154 0 0 0 1.5977-0.52434"/>
+<path d="m286.92 12.164a0.64515 0.64515 0 0 0 0.95058 0.78302"/>
+<path d="m299.13 27.284a2.218 2.218 0 0 1-2.8062-0.95558"/>
+<path d="m296.32 26.328a3.1745 3.1745 0 0 0 2.1124-0.19924"/>
+<path d="m298.44 26.129a0.70663 0.70663 0 0 0 0.69383 1.1548"/>
+<path d="m304.77 52.973a0.9513 0.9513 0 0 0-0.72652 1.4318"/>
+<path d="m304.04 54.404a5.5404 5.5404 0 0 1-4.1449-4.0296"/>
+<path d="m299.9 50.375a6.8143 6.8143 0 0 0 4.8714 2.5978"/>
+<path d="m213.03 77.277a2.218 2.218 0 0 0 0.59974-2.8553"/>
+<path d="m213.63 74.422a3.1745 3.1745 0 0 1 2.0066 4.6076"/>
+<path d="m215.64 79.029a1.7918 1.7918 0 0 0-2.6064-1.7523"/>
+<path d="m291.91 16.75a0.44867 0.44867 0 0 0 0.18889 0.71169"/>
+<path d="m292.09 17.462a1.5286 1.5286 0 0 1-2.0882-0.76102"/>
+<path d="m290.01 16.701a1.4337 1.4337 0 0 0 1.8993 0.04934"/>
+<path d="m206.73 61.074a2.318 2.318 0 0 0-0.0564-4.153"/>
+<path d="m206.68 56.921a5.5404 5.5404 0 0 0 3.3814-6.5466"/>
+<path d="m210.06 50.375a6.8143 6.8143 0 0 1-3.325 10.7"/>
+<path d="m258.97 8.9898a10.164 10.164 0 0 0 6.5667-6.9775"/>
+<path d="m265.53 2.0122a0.72447 0.72447 0 0 0 1.1794 0.079778"/>
+<path d="m266.71 2.092a9.5775 9.5775 0 0 1-7.746 6.8978"/>
+<path d="m210.06 50.375a6.3457 6.3457 0 0 1-4.7258 2.9279"/>
+<path d="m205.33 53.303a0.35582 0.35582 0 0 0-0.16108-0.55175"/>
+<path d="m205.17 52.751a7.2173 7.2173 0 0 0 4.8869-2.3761"/>
+<path d="m244.42 98.737a10.164 10.164 0 0 1 6.5667-6.9775"/>
+<path d="m250.99 91.76a28.101 28.101 0 0 0-2.239 7.3646"/>
+<path d="m248.75 99.124a2.3082 2.3082 0 0 0-4.3277-0.38706"/>
+<path d="m223.24 88.96a0.24819 0.24819 0 0 0-0.20346-0.37395"/>
+<path d="m223.04 88.586a1.9154 1.9154 0 0 1 1.5977-0.52434"/>
+<path d="m224.63 88.062a2.8381 2.8381 0 0 0-1.3942 0.89828"/>
+<path d="m211.6 75.138a0.30306 0.30306 0 0 0-0.0787-0.51717"/>
+<path d="m211.52 74.621a3.1745 3.1745 0 0 1 2.1124-0.19924"/>
+<path d="m213.63 74.422a6.2902 6.2902 0 0 0-2.0337 0.71641"/>
+<path d="m304.62 47.447a6.3457 6.3457 0 0 0-4.7258 2.9279"/>
+<path d="m299.9 50.375a5.5404 5.5404 0 0 1 3.3814-6.5466"/>
+<path d="m303.28 43.828a2.1177 2.1177 0 0 0 1.3444 3.6187"/>
+<path d="m296.6 76.959a3.1234 3.1234 0 0 0-4.216 3.3987"/>
+<path d="m292.39 80.358a28.101 28.101 0 0 0-15.059-4.9084"/>
+<path d="m277.33 75.45a21.692 21.692 0 0 1 19.275 1.5097"/>
+<path d="m281.98 8.7424a1.2641 1.2641 0 0 0 1.7721 1.4764"/>
+<path d="m283.76 10.219a1.9154 1.9154 0 0 0 1.5659 2.4691"/>
+<path d="m285.32 12.688a2.8381 2.8381 0 0 1-3.338-3.9455"/>
+<path d="m277.33 75.45 10.419 11.69"/>
+<path d="m287.75 87.139a1.0414 1.0414 0 0 0-1.032 1.3267"/>
+<path d="m286.72 88.466a121 121 0 0 1-9.3873-13.016"/>
+<path d="m285.32 12.688a1.7054 1.7054 0 0 1-0.0248-1.9463"/>
+<path d="m285.3 10.742a0.1301 0.1301 0 0 0 0.1925 0.08418"/>
+<path d="m285.49 10.826a1.8172 1.8172 0 0 0-0.16768 1.8621"/>
+<path d="m222.21 13.61 10.419 11.69"/>
+<path d="m232.63 25.3a28.101 28.101 0 0 1-15.059-4.9084"/>
+<path d="m217.57 20.391a4.484 4.484 0 0 0 4.6392-6.7813"/>
+<path d="m259.41 0.76811a1.1528 1.1528 0 0 0 1.7994 0.85706"/>
+<path d="m261.21 1.6252a28.101 28.101 0 0 1-2.239 7.3646"/>
+<path d="m258.97 8.9898a121 121 0 0 1 0.4395-8.2216"/>
+<path d="m224.66 90.008a1.7054 1.7054 0 0 0-0.0248-1.9463"/>
+<path d="m224.63 88.062a1.9154 1.9154 0 0 1 1.5659 2.4691"/>
+<path d="m226.2 90.531a0.89809 0.89809 0 0 0-1.541-0.5228"/>
+<path d="m220.04 86.053a0.303 0.303 0 0 0-0.28631-0.46259"/>
+<path d="m219.75 85.591a1.5286 1.5286 0 0 0 0.19534-1.5422"/>
+<path d="m219.95 84.048a1.4337 1.4337 0 0 1 0.091 2.0048"/>
+<path d="m295 20.466a0.18451 0.18451 0 0 0 0.11098 0.30721"/>
+<path d="m295.11 20.773a3.1745 3.1745 0 0 0-0.7955 0.94697"/>
+<path d="m294.32 21.72a1.7918 1.7918 0 0 1 0.68452-1.2542"/>
+<path d="m219.95 84.048a3.6835 3.6835 0 0 1-0.77519 1.1457"/>
+<path d="m219.17 85.194a0.077878 0.077878 0 0 0-0.10534-0.07056"/>
+<path d="m219.07 85.124a6.2902 6.2902 0 0 0 0.88053-1.0752"/>
+<path d="m294.32 21.72a3.6835 3.6835 0 0 0 1.1812-0.54499"/>
+<path d="m295.5 21.175a0.075109 0.075109 0 0 0 0.089 0.08471"/>
+<path d="m295.59 21.26a2.6037 2.6037 0 0 1-1.2702 0.46028"/>
+<path d="m214.46 79.574a3.6835 3.6835 0 0 1 1.1812-0.54499"/>
+<path d="m215.64 79.029a3.1745 3.1745 0 0 1-0.7955 0.94696"/>
+<path d="m214.84 79.976a0.29387 0.29387 0 0 0-0.38569-0.40197"/>
+<path d="m290.78 15.555a3.6835 3.6835 0 0 0-0.77519 1.1457"/>
+<path d="m290.01 16.701a1.5286 1.5286 0 0 1 0.19535-1.5422"/>
+<path d="m290.2 15.159a0.37438 0.37438 0 0 0 0.57984 0.39651"/>
+<path d="m232.63 25.3a121 121 0 0 1 18.36 66.46"/>
+<path d="m250.99 91.76a26.755 26.755 0 0 0-37.357-17.338"/>
+<path d="m213.63 74.422a44.966 44.966 0 0 0 18.997-49.122"/>
+<path d="m299.9 50.375a7.2173 7.2173 0 0 0 3.0125 11.648"/>
+<path d="m302.91 62.022a3.714 3.714 0 0 0-2.2644 6.7987"/>
+<path d="m300.65 68.821a10.497 10.497 0 0 1-0.74812-18.446"/>
+<path d="m250.99 91.76a9.5775 9.5775 0 0 1 10.881 7.6211"/>
+<path d="m261.87 99.381a1.5827 1.5827 0 0 0-2.9922 0.66282"/>
+<path d="m258.88 100.04a9.2881 9.2881 0 0 0-7.8884-8.2839"/>
+<path d="m215.64 79.029a2.6038 2.6038 0 0 1 2.2244 4.2582"/>
+<path d="m217.86 83.287a0.94756 0.94756 0 0 0-1.4038-1.1635"/>
+<path d="m216.46 82.124a1.8008 1.8008 0 0 0-0.82055-3.0947"/>
+<path d="m246.01 2.3622a21.692 21.692 0 0 1-13.386 22.938"/>
+<path d="m232.63 25.3a20.465 20.465 0 0 0 7.0127-22.115"/>
+<path d="m239.64 3.1846a3.3629 3.3629 0 0 0 6.3734-0.82244"/>
+<path d="m290.01 16.701a6.2902 6.2902 0 0 0 6.3192 9.6269"/>
+<path d="m296.32 26.328a26.755 26.755 0 0 1-37.357-17.338"/>
+<path d="m258.97 8.9898a19.845 19.845 0 0 0 31.038 7.7113"/>
+<path d="m299.95 30.572a2.3463 2.3463 0 0 0 1.918 3.9785"/>
+<path d="m301.87 34.55a9.1146 9.1146 0 0 0-1.9703 15.825"/>
+<path d="m299.9 50.375a11.25 11.25 0 0 1 0.0523-19.803"/>
+<path d="m224.63 88.062a1.8172 1.8172 0 0 0-2.9059-0.50842"/>
+<path d="m221.73 87.553a0.58598 0.58598 0 0 0-0.85811-0.76132"/>
+<path d="m220.87 86.792a2.2324 2.2324 0 0 1 3.764 1.2697"/>
+<path d="m213.63 74.422a2.2565 2.2565 0 0 0-3.0509-1.3035"/>
+<path d="m210.58 73.118a0.51646 0.51646 0 0 0-0.47856-0.89059"/>
+<path d="m210.1 72.228a2.51 2.51 0 0 1 3.5294 2.194"/>
+<path d="m296.32 26.328a2.2565 2.2565 0 0 1 0.85446-2.6188"/>
+<path d="m297.18 23.709a0.25921 0.25921 0 0 0 0.30803 0.40115"/>
+<path d="m297.49 24.11a2.51 2.51 0 0 0-1.1625 2.2176"/>
+<path d="m304.77 52.973a6.8143 6.8143 0 0 1-4.8714-2.5978"/>
+<path d="m299.9 50.375a9.1146 9.1146 0 0 0 4.9937 1.7402"/>
+<path d="m304.89 52.115a0.44513 0.44513 0 0 0-0.12229 0.85753"/>
+<path d="m213.03 77.277a1.7918 1.7918 0 0 1 2.6064 1.7523"/>
+<path d="m215.64 79.029a1.4914 1.4914 0 0 0-2.2536-0.98736"/>
+<path d="m213.38 78.042a0.43554 0.43554 0 0 0-0.35272-0.76498"/>
+<path d="m291.91 16.75a1.4337 1.4337 0 0 1-1.8993-0.04934"/>
+<path d="m290.01 16.701a1.5144 1.5144 0 0 0 1.7017-0.22152"/>
+<path d="m291.71 16.48a0.17233 0.17233 0 0 0 0.19761 0.27085"/>
+<path d="m272.67 96.751a1.3079 1.3079 0 0 0-2.3503 0.81364"/>
+<path d="m270.32 97.565a20.465 20.465 0 0 1 7.0127-22.115"/>
+<path d="m277.33 75.45a20.462 20.462 0 0 0-4.6623 21.301"/>
+<path d="m206.73 61.074a6.8143 6.8143 0 0 0 3.325-10.7"/>
+<path d="m210.06 50.375a9.1146 9.1146 0 0 1-1.9703 15.825"/>
+<path d="m208.09 66.199a2.7397 2.7397 0 0 0-1.3547-5.1251"/>
+<path d="m237.53 95.63a3.2113 3.2113 0 0 0-5.7313-1.5546"/>
+<path d="m231.8 94.075a4.928 4.928 0 0 0-7.1686-6.0136"/>
+<path d="m224.63 88.062a7.9745 7.9745 0 0 1 12.9 7.5682"/>
+<path d="m209.9 29.718a1.3066 1.3066 0 0 0 1.022-2.2635"/>
+<path d="m210.92 27.454a20.465 20.465 0 0 0 21.709-2.1543"/>
+<path d="m232.63 25.3a20.462 20.462 0 0 1-22.731 4.4178"/>
+<path d="m258.97 8.9898a9.5775 9.5775 0 0 0 7.746-6.8978"/>
+<path d="m266.71 2.092a1.2893 1.2893 0 0 0 2.4543 0.54398"/>
+<path d="m269.17 2.636a9.2881 9.2881 0 0 1-10.2 6.3538"/>
+<path d="m210.06 50.375a7.2173 7.2173 0 0 1-4.8869 2.3761"/>
+<path d="m205.17 52.751a0.46811 0.46811 0 0 0-0.11238-0.90659"/>
+<path d="m205.06 51.844a10.497 10.497 0 0 0 4.9993-1.4695"/>
+<path d="m223.24 88.96a2.8381 2.8381 0 0 1 1.3942-0.89828"/>
+<path d="m224.63 88.062a4.9281 4.9281 0 0 0-1.2218 1.0686"/>
+<path d="m223.41 89.13a0.1243 0.1243 0 0 0-0.17244-0.17027"/>
+<path d="m211.6 75.138a6.2902 6.2902 0 0 1 2.0337-0.71641"/>
+<path d="m213.63 74.422a26.755 26.755 0 0 0-1.9026 1.0001"/>
+<path d="m211.73 75.422a0.16026 0.16026 0 0 0-0.13108-0.28371"/>
+<path d="m218.34 84.37a0.071251 0.071251 0 0 0-0.0926-0.10026"/>
+<path d="m218.25 84.27a1.5144 1.5144 0 0 1 1.7017-0.22151"/>
+<path d="m219.95 84.048a1.6013 1.6013 0 0 0-1.609 0.32178"/>
+<path d="m205.05 49.018a0.20028 0.20028 0 0 0 9e-3 -0.38328"/>
+<path d="m205.06 48.635a9.1146 9.1146 0 0 1 4.9937 1.7402"/>
+<path d="m210.06 50.375a11.25 11.25 0 0 0-5.0031-1.3569"/>
+<path d="m296.42 22.471a0.1473 0.1473 0 0 0 0.15291 0.23698"/>
+<path d="m296.57 22.708a1.4914 1.4914 0 0 1-2.2536-0.98737"/>
+<path d="m294.32 21.72a1.4154 1.4154 0 0 0 2.1007 0.75038"/>
+<path d="m296.6 76.959a21.692 21.692 0 0 0-19.275-1.5097"/>
+<path d="m277.33 75.45a20.465 20.465 0 0 1 21.709-2.1543"/>
+<path d="m299.04 73.295a2.2732 2.2732 0 0 0-2.4341 3.664"/>
+<path d="m281.98 8.7424a2.8381 2.8381 0 0 0 3.338 3.9455"/>
+<path d="m285.32 12.688a4.928 4.928 0 0 1-7.1685-6.0136"/>
+<path d="m278.15 6.6742a2.2459 2.2459 0 0 0 3.8306 2.0681"/>
+<path d="m252.46 100.21a0.33203 0.33203 0 0 0-0.6345-0.0257"/>
+<path d="m251.82 100.19a26.755 26.755 0 0 0-0.83729-8.4256"/>
+<path d="m250.99 91.76a19.845 19.845 0 0 1 1.4718 8.4512"/>
+<path d="m215.17 80.589a0.068171 0.068171 0 0 0-0.0814-0.10204"/>
+<path d="m215.08 80.487a1.4914 1.4914 0 0 0 0.55244-1.458"/>
+<path d="m215.64 79.029a1.4154 1.4154 0 0 1-0.47099 1.56"/>
+<path d="m289.34 14.129a0.16194 0.16194 0 0 0 0.23296 0.20422"/>
+<path d="m289.58 14.334a1.5144 1.5144 0 0 0 0.43018 2.3675"/>
+<path d="m290.01 16.701a1.6013 1.6013 0 0 1-0.66314-2.5718"/>
+<path d="m277.33 75.45a121 121 0 0 0 9.3873 13.016"/>
+<path d="m286.72 88.466a1.5583 1.5583 0 0 0-2.2528 2.0267"/>
+<path d="m284.46 90.493a44.966 44.966 0 0 1-7.1345-15.043"/>
+<path d="m285.32 12.688a1.8172 1.8172 0 0 1 0.16768-1.8621"/>
+<path d="m285.49 10.826a0.16355 0.16355 0 0 0 0.26896 0.17232"/>
+<path d="m285.76 10.998a2.2324 2.2324 0 0 0-0.43664 1.6898"/>
+<path d="m259.41 0.76811a121 121 0 0 0-0.4395 8.2216"/>
+<path d="m258.97 8.9898a26.755 26.755 0 0 1-0.83729-8.4256"/>
+<path d="m258.13 0.56419a0.6641 0.6641 0 0 0 1.2768 0.20392"/>
+<path d="m286.46 11.55a0.057778 0.057778 0 0 0 0.0866 0.06899"/>
+<path d="m286.54 11.619a4.9281 4.9281 0 0 1-1.2218 1.0686"/>
+<path d="m285.32 12.688a7.9745 7.9745 0 0 0 1.1352-1.1375"/>
+<path d="m298.15 25.202a0.076563 0.076563 0 0 0 0.0752 0.1259"/>
+<path d="m298.23 25.328a26.755 26.755 0 0 1-1.9026 1.0001"/>
+<path d="m296.32 26.328a44.966 44.966 0 0 1 1.8274-1.126"/>
+<path d="m220.04 86.053a1.4337 1.4337 0 0 0-0.091-2.0048"/>
+<path d="m219.95 84.048a1.5144 1.5144 0 0 1 0.43018 2.3675"/>
+<path d="m220.38 86.416a0.25404 0.25404 0 0 0-0.33921-0.36272"/>
+<path d="m295 20.466a1.7918 1.7918 0 0 0-0.68452 1.2542"/>
+<path d="m294.32 21.72a1.4914 1.4914 0 0 1 0.55243-1.458"/>
+<path d="m294.87 20.262a0.12431 0.12431 0 0 0 0.13209 0.20378"/>
+<path d="m219.95 84.048a6.2902 6.2902 0 0 1-0.88053 1.0752"/>
+<path d="m219.07 85.124a0.11101 0.11101 0 0 0-0.1619-0.14472"/>
+<path d="m218.91 84.979a19.845 19.845 0 0 1 1.0424-0.93045"/>
+<path d="m294.32 21.72a2.6037 2.6037 0 0 0 1.2702-0.46028"/>
+<path d="m295.59 21.26a0.11807 0.11807 0 0 0 0.14564 0.17951"/>
+<path d="m295.73 21.44a1.8008 1.8008 0 0 1-1.4158 0.28078"/>
+<path d="m183.61 15.229a10.655 10.655 0 0 0 11.052 14.826"/>
+<path d="m194.66 30.055a24.623 24.623 0 0 1-31.637-18.369"/>
+<path d="m163.02 11.686a14.597 14.597 0 0 0 20.585 3.5431"/>
+<path d="m187.18 85.287a2.6217 2.6217 0 0 0-3.3949 3.4825"/>
+<path d="m183.78 88.769a9.1363 9.1363 0 0 1 4.1994-13.717"/>
+<path d="m187.98 75.052a7.7335 7.7335 0 0 0-0.80454 10.235"/>
+<path d="m158.31 99.888a0.58282 0.58282 0 0 0-1.0647 0.23992"/>
+<path d="m157.25 100.13a3.5262 3.5262 0 0 1 2.6384-3.6025"/>
+<path d="m159.88 96.526a3.9863 3.9863 0 0 0-1.5737 3.3626"/>
+<path d="m142.41 89.246a11.26 11.26 0 0 0-14.14 4.0265"/>
+<path d="m128.27 93.272a5.5872 5.5872 0 0 0-6.445-7.5696"/>
+<path d="m121.83 85.703a14.597 14.597 0 0 1 20.585 3.5431"/>
+<path d="m111.46 50.466a40.628 40.628 0 0 1 30.95 38.78"/>
+<path d="m142.41 89.246a24.623 24.623 0 0 0-31.637-18.369"/>
+<path d="m110.78 70.877a13.834 13.834 0 0 0 0.68667-20.411"/>
+<path d="m136.18 3.7956a1.8641 1.8641 0 0 0 3.3798-0.81695"/>
+<path d="m139.56 2.9787a3.4757 3.4757 0 0 1-5.9271 2.662"/>
+<path d="m133.64 5.6407a1.8496 1.8496 0 0 0 2.5473-1.8451"/>
+<path d="m103.48 46.627a1.3143 1.3143 0 0 0-0.0817-2.4418"/>
+<path d="m103.4 44.185a10.505 10.505 0 0 1 8.0636 6.2809"/>
+<path d="m111.46 50.466a13.834 13.834 0 0 0-7.9818-3.8391"/>
+<path d="m171.8 95.291a1.3437 1.3437 0 0 0-1.0914 1.7243"/>
+<path d="m170.71 97.015a0.79506 0.79506 0 0 0-1.4559 0.1208"/>
+<path d="m169.25 97.136a1.8496 1.8496 0 0 1 2.5473-1.8451"/>
+<path d="m117.46 25.88a8.0424 8.0424 0 0 0-2.2455-8.0125"/>
+<path d="m115.21 17.867a2.0302 2.0302 0 0 0 3.05-2.2225"/>
+<path d="m118.26 15.645a7.7335 7.7335 0 0 1-0.80454 10.235"/>
+<path d="m145.55 4.4058a6.7951 6.7951 0 0 0 0.45733-3.3841"/>
+<path d="m146.01 1.0216a0.59006 0.59006 0 0 0 1.1164 0.021547"/>
+<path d="m147.13 1.0431a3.9863 3.9863 0 0 1-1.5737 3.3626"/>
+<path d="m194.66 30.055a4.9044 4.9044 0 0 0 5.4062 6.4338"/>
+<path d="m200.07 36.489a10.505 10.505 0 0 0-6.0929 13.977"/>
+<path d="m193.97 50.466a13.834 13.834 0 0 1 0.68667-20.411"/>
+<path d="m159.88 96.526a6.7951 6.7951 0 0 1 11.917-1.2349"/>
+<path d="m171.8 95.291a3.4757 3.4757 0 0 0-5.9271 2.662"/>
+<path d="m165.87 97.953a3.9863 3.9863 0 0 0-5.9901-1.4271"/>
+<path d="m125.03 10.436a10.69 10.69 0 0 1-7.571 15.444"/>
+<path d="m117.46 25.88a9.1363 9.1363 0 0 0 4.1994-13.717"/>
+<path d="m121.66 12.162a2.1928 2.1928 0 0 0 3.3716-1.7269"/>
+<path d="m148.86 0.82542a3.5239 3.5239 0 0 1-3.3039 3.5803"/>
+<path d="m145.55 4.4058a3.5262 3.5262 0 0 0 2.6384-3.6025"/>
+<path d="m148.19 0.80323a0.37582 0.37582 0 0 0 0.66547 0.022196"/>
+<path d="m179.38 8.8321a4.4789 4.4789 0 0 0 4.227 6.3968"/>
+<path d="m183.61 15.229a5.5872 5.5872 0 0 1-6.445-7.5696"/>
+<path d="m177.16 7.6592a1.4224 1.4224 0 0 0 2.218 1.1729"/>
+<path d="m124.7 9.1544a0.17467 0.17467 0 0 0 0.24305-0.21894"/>
+<path d="m124.94 8.9355a1.5448 1.5448 0 0 1 0.0864 1.5001"/>
+<path d="m125.03 10.436a2.1928 2.1928 0 0 0-0.32941-1.2811"/>
+<path d="m185.83 13.244a0.36502 0.36502 0 0 0 0.57129 0.37028"/>
+<path d="m186.4 13.614a5.5872 5.5872 0 0 1-2.7937 1.6149"/>
+<path d="m183.61 15.229a14.597 14.597 0 0 0 2.2224-1.9852"/>
+<path d="m193.97 50.466a40.628 40.628 0 0 0 8.4671 1.1502"/>
+<path d="m202.44 51.616a1.4489 1.4489 0 0 0-0.48524 2.6889"/>
+<path d="m201.96 54.305a13.834 13.834 0 0 1-7.9818-3.8391"/>
+<path d="m183.78 88.769a0.91522 0.91522 0 0 0-0.82157 1.3784"/>
+<path d="m182.96 90.147a1.5448 1.5448 0 0 0-2.5501 0.34855"/>
+<path d="m180.41 90.496a2.1928 2.1928 0 0 1 3.3716-1.7269"/>
+<path d="m139.56 2.9787a1.1094 1.1094 0 0 0 1.7157-1.0221"/>
+<path d="m141.28 1.9565a3.5262 3.5262 0 0 0 4.2744 2.4492"/>
+<path d="m145.55 4.4058a3.9863 3.9863 0 0 1-5.9901-1.4271"/>
+<path d="m163.02 11.686a11.26 11.26 0 0 1-6.52-10.572"/>
+<path d="m156.5 1.1133a2.1645 2.1645 0 0 0 4.0317 0.70389"/>
+<path d="m160.54 1.8172a14.597 14.597 0 0 0 2.4883 9.8685"/>
+<path d="m201.7 58.098a9.8897 9.8897 0 0 1-7.7258-7.632"/>
+<path d="m193.97 50.466a10.505 10.505 0 0 0 8.0636 6.2809"/>
+<path d="m202.04 56.747a0.78792 0.78792 0 0 0-0.33776 1.3511"/>
+<path d="m104.73 61.974a9.8897 9.8897 0 0 0 6.7373-11.509"/>
+<path d="m111.46 50.466a10.505 10.505 0 0 1-6.0929 13.977"/>
+<path d="m105.37 64.443a1.4441 1.4441 0 0 0-0.64447-2.4685"/>
+<path d="m144.9 99.114a1.3291 1.3291 0 0 0-2.4411 0.04405"/>
+<path d="m142.46 99.158a24.623 24.623 0 0 0-0.0472-9.9126"/>
+<path d="m142.41 89.246a14.597 14.597 0 0 1 2.4883 9.8685"/>
+<path d="m180.41 90.496a10.69 10.69 0 0 0 0.66378 1.1085"/>
+<path d="m181.07 91.604a0.19783 0.19783 0 0 0-0.33438 0.17262"/>
+<path d="m180.74 91.777a2.1928 2.1928 0 0 1-0.3294-1.2811"/>
+<path d="m121.83 85.703a10.655 10.655 0 0 1-1.6294 2.6242"/>
+<path d="m120.2 88.327a0.45808 0.45808 0 0 0-0.593-0.63908"/>
+<path d="m119.61 87.688a14.597 14.597 0 0 1 2.2224-1.9852"/>
+<path d="m187.98 75.052a8.0424 8.0424 0 0 1 10.29-5.4817"/>
+<path d="m198.27 69.57a2.3115 2.3115 0 0 0-1.9453 3.9165"/>
+<path d="m196.32 73.486a7.7335 7.7335 0 0 0-8.345 1.5652"/>
+<path d="m110.78 70.877a4.9044 4.9044 0 0 1-2.2694 2.704"/>
+<path d="m108.51 73.581a0.5247 0.5247 0 0 0-0.3781-0.92597"/>
+<path d="m108.13 72.655a13.834 13.834 0 0 0 2.6475-1.778"/>
+<path d="m133.64 5.6407a1.3437 1.3437 0 0 1-1.3944-0.72785"/>
+<path d="m132.24 4.9128a0.24476 0.24476 0 0 0 0.43836-0.16451"/>
+<path d="m132.68 4.7483a1.8496 1.8496 0 0 0 0.95605 0.89236"/>
+<path d="m180.33 92.081a1.4183 1.4183 0 0 1 0.0749-1.5855"/>
+<path d="m180.41 90.496a1.5448 1.5448 0 0 0 0.0864 1.5001"/>
+<path d="m180.5 91.996a0.10255 0.10255 0 0 0-0.16128 0.08539"/>
+<path d="m118.8 87.057a4.4789 4.4789 0 0 1 3.0314-1.3543"/>
+<path d="m121.83 85.703a5.5872 5.5872 0 0 0-2.7937 1.6149"/>
+<path d="m119.04 87.318a0.1981 0.1981 0 0 0-0.23763-0.26057"/>
+<path d="m163.5 99.11a3.5239 3.5239 0 0 0-3.6178-2.5846"/>
+<path d="m159.88 96.526a3.5262 3.5262 0 0 1 4.2744 2.4492"/>
+<path d="m164.16 98.975a0.37585 0.37585 0 0 0-0.65659 0.13541"/>
+<path d="m122.82 10.521a1.4183 1.4183 0 0 0 2.2045-0.08522"/>
+<path d="m125.03 10.436a1.5448 1.5448 0 0 1-2.5501 0.34855"/>
+<path d="m122.48 10.784a0.24323 0.24323 0 0 0 0.34558-0.26332"/>
+<path d="m172.76 96.183a0.15343 0.15343 0 0 0-0.23346 0.16267"/>
+<path d="m172.52 96.346a3.4757 3.4757 0 0 0-0.72259-1.055"/>
+<path d="m171.8 95.291a1.8496 1.8496 0 0 1 0.95605 0.89236"/>
+<path d="m109.11 27.445a1.1905 1.1905 0 0 0 0.60062-2.0917"/>
+<path d="m109.71 25.353a9.1363 9.1363 0 0 0 7.7444 0.52655"/>
+<path d="m117.46 25.88a7.7335 7.7335 0 0 1-8.345 1.5652"/>
+<path d="m197.31 28.277a0.37504 0.37504 0 0 0 0.4119 0.56255"/>
+<path d="m197.72 28.839a24.624 24.624 0 0 1-3.0594 1.2154"/>
+<path d="m194.66 30.055a13.834 13.834 0 0 1 2.6475-1.778"/>
+<path d="m164.01 2.07a40.628 40.628 0 0 0-0.98929 9.6157"/>
+<path d="m163.02 11.686a24.623 24.623 0 0 1-0.0472-9.9126"/>
+<path d="m162.98 1.7732a0.60668 0.60668 0 0 0 1.0364 0.29682"/>
+<path d="m195.24 76.311a10.69 10.69 0 0 0-7.2601-1.259"/>
+<path d="m187.98 75.052a9.1363 9.1363 0 0 1 7.7444 0.52655"/>
+<path d="m195.72 75.578a0.49323 0.49323 0 0 0-0.48427 0.73246"/>
+<path d="m107.6 71.779a10.655 10.655 0 0 1 3.1808-0.90206"/>
+<path d="m110.78 70.877a24.624 24.624 0 0 0-3.0594 1.2154"/>
+<path d="m107.72 72.092a0.18858 0.18858 0 0 0-0.12137-0.31338"/>
+<path d="m133.03 4.5429a6.7952 6.7952 0 0 0 0.60331 1.0977"/>
+<path d="m133.64 5.6407a3.4757 3.4757 0 0 1-0.7226-1.055"/>
+<path d="m132.91 4.5856a0.070961 0.070961 0 0 0 0.11929-0.04271"/>
+<path d="m163.02 11.686a24.623 24.623 0 0 0 31.637 18.369"/>
+<path d="m194.66 30.055a13.834 13.834 0 0 0-0.68667 20.411"/>
+<path d="m193.97 50.466a40.628 40.628 0 0 1-30.95-38.78"/>
+<path d="m187.98 75.052a9.1363 9.1363 0 0 0-4.1994 13.717"/>
+<path d="m183.78 88.769a2.1928 2.1928 0 0 0-3.3716 1.7269"/>
+<path d="m180.41 90.496a10.69 10.69 0 0 1 7.571-15.444"/>
+<path d="m159.88 96.526a3.5262 3.5262 0 0 0-2.6384 3.6025"/>
+<path d="m157.25 100.13a0.37582 0.37582 0 0 0-0.66547-0.0222"/>
+<path d="m156.58 100.11a3.5239 3.5239 0 0 1 3.3039-3.5803"/>
+<path d="m121.83 85.703a5.5872 5.5872 0 0 1 6.445 7.5696"/>
+<path d="m128.27 93.272a1.4224 1.4224 0 0 0-2.218-1.1729"/>
+<path d="m126.06 92.099a4.4789 4.4789 0 0 0-4.227-6.3967"/>
+<path d="m110.78 70.877a24.623 24.623 0 0 1 31.637 18.369"/>
+<path d="m142.41 89.246a14.597 14.597 0 0 0-20.585-3.5431"/>
+<path d="m121.83 85.703a10.655 10.655 0 0 0-11.052-14.826"/>
+<path d="m133.64 5.6407a3.4757 3.4757 0 0 0 5.9271-2.662"/>
+<path d="m139.56 2.9787a3.9863 3.9863 0 0 0 5.9901 1.4271"/>
+<path d="m145.55 4.4058a6.7951 6.7951 0 0 1-11.917 1.2349"/>
+<path d="m111.46 50.466a10.505 10.505 0 0 0-8.0636-6.2809"/>
+<path d="m103.4 44.185a0.78792 0.78792 0 0 0 0.33775-1.3511"/>
+<path d="m103.74 42.834a9.8897 9.8897 0 0 1 7.7258 7.632"/>
+<path d="m193.97 50.466a10.505 10.505 0 0 1 6.0929-13.977"/>
+<path d="m200.07 36.489a1.4441 1.4441 0 0 0 0.64447 2.4685"/>
+<path d="m200.71 38.957a9.8897 9.8897 0 0 0-6.7373 11.509"/>
+<path d="m165.87 97.953a3.4757 3.4757 0 0 1 5.9271-2.662"/>
+<path d="m171.8 95.291a1.8496 1.8496 0 0 0-2.5473 1.8451"/>
+<path d="m169.25 97.136a1.8641 1.8641 0 0 0-3.3798 0.81695"/>
+<path d="m121.66 12.162a9.1363 9.1363 0 0 1-4.1994 13.717"/>
+<path d="m117.46 25.88a7.7335 7.7335 0 0 0 0.80454-10.235"/>
+<path d="m118.26 15.645a2.6217 2.6217 0 0 0 3.3949-3.4825"/>
+<path d="m148.19 0.80323a3.5262 3.5262 0 0 1-2.6384 3.6025"/>
+<path d="m145.55 4.4058a3.9863 3.9863 0 0 0 1.5737-3.3626"/>
+<path d="m147.13 1.0431a0.58282 0.58282 0 0 0 1.0647-0.23992"/>
+<path d="m177.16 7.6592a5.5872 5.5872 0 0 0 6.445 7.5696"/>
+<path d="m183.61 15.229a14.597 14.597 0 0 1-20.585-3.5431"/>
+<path d="m163.02 11.686a11.26 11.26 0 0 0 14.14-4.0265"/>
+<path d="m148.93 99.818a2.1645 2.1645 0 0 0-4.0317-0.70389"/>
+<path d="m144.9 99.114a14.597 14.597 0 0 0-2.4883-9.8685"/>
+<path d="m142.41 89.246a11.26 11.26 0 0 1 6.52 10.572"/>
+<path d="m125.03 10.436a1.5448 1.5448 0 0 0-0.0864-1.5001"/>
+<path d="m124.94 8.9355a0.10255 0.10255 0 0 0 0.16128-0.08539"/>
+<path d="m125.1 8.8501a1.4183 1.4183 0 0 1-0.0749 1.5855"/>
+<path d="m183.61 15.229a5.5872 5.5872 0 0 0 2.7937-1.6149"/>
+<path d="m186.4 13.614a0.1981 0.1981 0 0 0 0.23763 0.26057"/>
+<path d="m186.64 13.875a4.4789 4.4789 0 0 1-3.0314 1.3543"/>
+<path d="m180.41 90.496a1.5448 1.5448 0 0 1 2.5501-0.34855"/>
+<path d="m182.96 90.147a0.24323 0.24323 0 0 0-0.34558 0.26332"/>
+<path d="m182.61 90.411a1.4183 1.4183 0 0 0-2.2045 0.08523"/>
+<path d="m145.55 4.4058a3.5262 3.5262 0 0 1-4.2744-2.4492"/>
+<path d="m141.28 1.9565a0.37585 0.37585 0 0 0 0.65659-0.13541"/>
+<path d="m141.94 1.8211a3.5239 3.5239 0 0 0 3.6178 2.5846"/>
+<path d="m202.04 56.747a10.505 10.505 0 0 1-8.0636-6.2809"/>
+<path d="m193.97 50.466a13.834 13.834 0 0 0 7.9818 3.8391"/>
+<path d="m201.96 54.305a1.3143 1.3143 0 0 0 0.0817 2.4418"/>
+<path d="m190.23 83.064a2.0302 2.0302 0 0 0-3.05 2.2224"/>
+<path d="m187.18 85.287a7.7335 7.7335 0 0 1 0.80454-10.235"/>
+<path d="m187.98 75.052a8.0424 8.0424 0 0 0 2.2455 8.0125"/>
+<path d="m159.43 99.91a0.59006 0.59006 0 0 0-1.1164-0.02155"/>
+<path d="m158.31 99.888a3.9863 3.9863 0 0 1 1.5737-3.3626"/>
+<path d="m159.88 96.526a6.7951 6.7951 0 0 0-0.45733 3.3841"/>
+<path d="m105.37 64.443a10.505 10.505 0 0 0 6.0929-13.977"/>
+<path d="m111.46 50.466a13.834 13.834 0 0 1-0.68667 20.411"/>
+<path d="m110.78 70.877a4.9044 4.9044 0 0 0-5.4062-6.4338"/>
+<path d="m134.73 3.9164a0.79506 0.79506 0 0 0 1.4559-0.1208"/>
+<path d="m136.18 3.7956a1.8496 1.8496 0 0 1-2.5473 1.8451"/>
+<path d="m133.64 5.6407a1.3437 1.3437 0 0 0 1.0914-1.7243"/>
+<path d="m173.2 96.019a0.24476 0.24476 0 0 0-0.43836 0.16451"/>
+<path d="m172.76 96.183a1.8496 1.8496 0 0 0-0.95605-0.89236"/>
+<path d="m171.8 95.291a1.3437 1.3437 0 0 1 1.3944 0.72784"/>
+<path d="m107.17 31.362a2.3115 2.3115 0 0 0 1.9453-3.9165"/>
+<path d="m109.11 27.445a7.7335 7.7335 0 0 0 8.345-1.5652"/>
+<path d="m117.46 25.88a8.0424 8.0424 0 0 1-10.29 5.4817"/>
+<path d="m185.24 12.605a0.45808 0.45808 0 0 0 0.59301 0.63908"/>
+<path d="m185.83 13.244a14.597 14.597 0 0 1-2.2224 1.9852"/>
+<path d="m183.61 15.229a10.655 10.655 0 0 1 1.6294-2.6242"/>
+<path d="m196.93 27.351a0.5247 0.5247 0 0 0 0.3781 0.92597"/>
+<path d="m197.31 28.277a13.834 13.834 0 0 0-2.6475 1.778"/>
+<path d="m194.66 30.055a4.9044 4.9044 0 0 1 2.2694-2.704"/>
+<path d="m142.41 89.246a24.623 24.623 0 0 1 0.0472 9.9126"/>
+<path d="m142.46 99.158a0.60668 0.60668 0 0 0-1.0364-0.29681"/>
+<path d="m141.42 98.862a40.628 40.628 0 0 0 0.98929-9.6158"/>
+<path d="m180.5 91.996a1.5448 1.5448 0 0 1-0.0864-1.5001"/>
+<path d="m180.41 90.496a2.1928 2.1928 0 0 0 0.3294 1.2811"/>
+<path d="m180.74 91.777a0.17467 0.17467 0 0 0-0.24304 0.21895"/>
+<path d="m119.04 87.318a5.5872 5.5872 0 0 1 2.7937-1.6149"/>
+<path d="m121.83 85.703a14.597 14.597 0 0 0-2.2224 1.9852"/>
+<path d="m119.61 87.688a0.36502 0.36502 0 0 0-0.5713-0.37028"/>
+<path d="m103 49.316a1.4489 1.4489 0 0 0 0.48524-2.6889"/>
+<path d="m103.48 46.627a13.834 13.834 0 0 1 7.9818 3.8391"/>
+<path d="m111.46 50.466a40.628 40.628 0 0 0-8.4671-1.1502"/>
+<path d="m164.16 98.975a3.5262 3.5262 0 0 0-4.2744-2.4492"/>
+<path d="m159.88 96.526a3.9863 3.9863 0 0 1 5.9901 1.4271"/>
+<path d="m165.87 97.953a1.1094 1.1094 0 0 0-1.7157 1.0221"/>
+<path d="m122.48 10.784a1.5448 1.5448 0 0 0 2.5501-0.34855"/>
+<path d="m125.03 10.436a2.1928 2.1928 0 0 1-3.3716 1.7269"/>
+<path d="m121.66 12.162a0.91522 0.91522 0 0 0 0.82157-1.3784"/>
+<path d="m171.8 95.291a3.4757 3.4757 0 0 1 0.72259 1.055"/>
+<path d="m172.52 96.346a0.070961 0.070961 0 0 0-0.11928 0.04271"/>
+<path d="m172.4 96.389a6.7952 6.7952 0 0 0-0.60331-1.0977"/>
+<path d="m117.46 25.88a9.1363 9.1363 0 0 1-7.7444-0.52655"/>
+<path d="m109.71 25.353a0.49323 0.49323 0 0 0 0.48427-0.73246"/>
+<path d="m110.2 24.621a10.69 10.69 0 0 0 7.2601 1.259"/>
+<path d="m194.66 30.055a24.624 24.624 0 0 0 3.0594-1.2154"/>
+<path d="m197.72 28.839a0.18858 0.18858 0 0 0 0.12136 0.31337"/>
+<path d="m197.84 29.153a10.655 10.655 0 0 1-3.1808 0.90207"/>
+<path d="m162.98 1.7732a24.623 24.623 0 0 0 0.0472 9.9126"/>
+<path d="m163.02 11.686a14.597 14.597 0 0 1-2.4883-9.8685"/>
+<path d="m160.54 1.8172a1.3291 1.3291 0 0 0 2.4411-0.044057"/>
+<path d="m124.37 9.327a0.19783 0.19783 0 0 0 0.33437-0.17262"/>
+<path d="m124.7 9.1544a2.1928 2.1928 0 0 1 0.32941 1.2811"/>
+<path d="m125.03 10.436a10.69 10.69 0 0 0-0.66378-1.1085"/>
+<path d="m195.72 75.578a9.1363 9.1363 0 0 0-7.7444-0.52655"/>
+<path d="m187.98 75.052a7.7335 7.7335 0 0 1 8.345-1.5652"/>
+<path d="m196.32 73.486a1.1905 1.1905 0 0 0-0.60062 2.0917"/>
+<path d="m107.72 72.092a24.624 24.624 0 0 1 3.0594-1.2154"/>
+<path d="m110.78 70.877a13.834 13.834 0 0 1-2.6475 1.778"/>
+<path d="m108.13 72.655a0.37504 0.37504 0 0 0-0.4119-0.56255"/>
+<path d="m132.91 4.5856a3.4757 3.4757 0 0 0 0.7226 1.055"/>
+<path d="m133.64 5.6407a1.8496 1.8496 0 0 1-0.95605-0.89236"/>
+<path d="m132.68 4.7483a0.15343 0.15343 0 0 0 0.23345-0.16267"/>
+<path d="m163.02 11.686a40.628 40.628 0 0 0 30.95 38.78"/>
+<path d="m193.97 50.466a67.224 67.224 0 0 0-51.56 38.78"/>
+<path d="m142.41 89.246 20.61-77.56"/>
+<path d="m187.98 75.052a10.69 10.69 0 0 0-7.571 15.444"/>
+<path d="m180.41 90.496a5.2552 5.2552 0 0 0-8.6076 4.7949"/>
+<path d="m171.8 95.291a15.469 15.469 0 0 1 16.179-20.239"/>
+<path d="m159.88 96.526a3.5239 3.5239 0 0 0-3.3039 3.5803"/>
+<path d="m156.58 100.11a0.6581 0.6581 0 0 0-1.2563 0.16065"/>
+<path d="m155.32 100.27a3.7615 3.7615 0 0 1 4.5602-3.741"/>
+<path d="m121.83 85.703a4.4789 4.4789 0 0 1 4.227 6.3967"/>
+<path d="m126.06 92.099a1.153 1.153 0 0 0-2.0034-0.84391"/>
+<path d="m124.05 91.255a3.6666 3.6666 0 0 0-2.2236-5.5528"/>
+<path d="m110.78 70.877a10.655 10.655 0 0 1 11.052 14.826"/>
+<path d="m121.83 85.703a5.0728 5.0728 0 0 0-7.8611-4.3657"/>
+<path d="m113.97 81.337a6.0785 6.0785 0 0 0-3.191-10.46"/>
+<path d="m133.64 5.6407a6.7951 6.7951 0 0 0 11.917-1.2349"/>
+<path d="m145.55 4.4058a22.316 22.316 0 0 1-28.096 21.474"/>
+<path d="m117.46 25.88a15.469 15.469 0 0 0 16.179-20.239"/>
+<path d="m150.11 0.66477a0.54804 0.54804 0 0 0 1.027 0.060025"/>
+<path d="m151.14 0.7248a4.077 4.077 0 0 1-5.5872 3.681"/>
+<path d="m145.55 4.4058a3.7615 3.7615 0 0 0 4.5602-3.741"/>
+<path d="m181.38 9.676a0.46672 0.46672 0 0 0 0.71036 0.52126"/>
+<path d="m182.1 10.197a3.4172 3.4172 0 0 0 1.5133 5.0316"/>
+<path d="m183.61 15.229a3.6666 3.6666 0 0 1-2.2236-5.5528"/>
+<path d="m191.47 19.595a1.3281 1.3281 0 0 0 1.55 1.9516"/>
+<path d="m193.02 21.546a4.9705 4.9705 0 0 0 1.641 8.5088"/>
+<path d="m194.66 30.055a6.0785 6.0785 0 0 1-3.191-10.46"/>
+<path d="m111.46 50.466a9.8897 9.8897 0 0 0-7.7258-7.632"/>
+<path d="m103.74 42.834a1.2849 1.2849 0 0 0 0.25582-2.4486"/>
+<path d="m103.99 40.385a9.6931 9.6931 0 0 1 7.47 10.081"/>
+<path d="m193.97 50.466a9.8897 9.8897 0 0 1 6.7373-11.509"/>
+<path d="m200.71 38.957a1.4954 1.4954 0 0 0 0.9999 2.6515"/>
+<path d="m201.71 41.609a9.6931 9.6931 0 0 0-7.7372 8.8571"/>
+<path d="m177.16 7.6592a11.26 11.26 0 0 1-14.14 4.0265"/>
+<path d="m163.02 11.686a11.34 11.34 0 0 0 10.705-6.2653"/>
+<path d="m173.73 5.4205a2.1334 2.1334 0 0 0 3.4344 2.2387"/>
+<path d="m148.93 99.818a11.26 11.26 0 0 0-6.52-10.572"/>
+<path d="m142.41 89.246a11.34 11.34 0 0 1 10.768 10.771"/>
+<path d="m153.18 100.02a2.2014 2.2014 0 0 0-4.2485-0.19868"/>
+<path d="m201.44 60.546a0.98024 0.98024 0 0 0-0.55954 1.7497"/>
+<path d="m200.88 62.296a9.9378 9.9378 0 0 1-6.9104-11.83"/>
+<path d="m193.97 50.466a9.6931 9.6931 0 0 0 7.47 10.081"/>
+<path d="m103.73 59.323a0.72773 0.72773 0 0 0-0.18431-1.3585"/>
+<path d="m103.54 57.964a9.9378 9.9378 0 0 0 7.9215-7.4986"/>
+<path d="m111.46 50.466a9.6931 9.6931 0 0 1-7.7372 8.8571"/>
+<path d="m125.03 10.436a1.4183 1.4183 0 0 0 0.0749-1.5855"/>
+<path d="m125.1 8.8501a0.16416 0.16416 0 0 0 0.24973-0.19429"/>
+<path d="m125.35 8.6558a1.3458 1.3458 0 0 1-0.32465 1.7798"/>
+<path d="m183.61 15.229a4.4789 4.4789 0 0 0 3.0314-1.3543"/>
+<path d="m186.64 13.875a0.29631 0.29631 0 0 0 0.44945 0.35074"/>
+<path d="m187.09 14.225a3.6666 3.6666 0 0 1-3.4808 1.0036"/>
+<path d="m180.41 90.496a1.4183 1.4183 0 0 1 2.2045-0.08523"/>
+<path d="m182.61 90.411a0.2419 0.2419 0 0 0-0.32216 0.33037"/>
+<path d="m182.29 90.741a1.3458 1.3458 0 0 0-1.8823-0.24514"/>
+<path d="m145.55 4.4058a3.5239 3.5239 0 0 1-3.6178-2.5846"/>
+<path d="m141.94 1.8211a0.41565 0.41565 0 0 0 0.74532-0.27445"/>
+<path d="m142.68 1.5467a3.7615 3.7615 0 0 0 2.8725 2.8591"/>
+<path d="m190.23 83.064a8.0424 8.0424 0 0 1-2.2455-8.0125"/>
+<path d="m187.98 75.052a10.119 10.119 0 0 0 3.5986 6.6395"/>
+<path d="m191.58 81.691a0.99533 0.99533 0 0 0-1.3532 1.373"/>
+<path d="m159.43 99.91a6.7951 6.7951 0 0 1 0.45733-3.3841"/>
+<path d="m159.88 96.526a22.316 22.316 0 0 0 0.23782 3.3301"/>
+<path d="m160.12 99.856a0.35842 0.35842 0 0 0-0.69515 0.05402"/>
+<path d="m105.37 64.443a4.9044 4.9044 0 0 1 5.4062 6.4338"/>
+<path d="m110.78 70.877a3.7714 3.7714 0 0 0-4.8768-3.398"/>
+<path d="m105.9 67.479a1.609 1.609 0 0 0-0.52934-3.0358"/>
+<path d="m134.73 3.9164a1.3437 1.3437 0 0 1-1.0914 1.7243"/>
+<path d="m133.64 5.6407a1.3096 1.3096 0 0 0 0.56913-1.5803"/>
+<path d="m134.21 4.0603a0.27938 0.27938 0 0 0 0.52229-0.14392"/>
+<path d="m173.2 96.019a1.3437 1.3437 0 0 0-1.3944-0.72784"/>
+<path d="m171.8 95.291a1.3096 1.3096 0 0 1 1.8288 0.53825"/>
+<path d="m173.63 95.829a0.24302 0.24302 0 0 0-0.43437 0.18959"/>
+<path d="m107.17 31.362a8.0424 8.0424 0 0 0 10.29-5.4817"/>
+<path d="m117.46 25.88a10.119 10.119 0 0 1-12.136 11.055"/>
+<path d="m105.32 36.935a3.053 3.053 0 0 0 1.8454-5.5738"/>
+<path d="m185.24 12.605a10.655 10.655 0 0 0-1.6294 2.6242"/>
+<path d="m183.61 15.229a5.0728 5.0728 0 0 1 1.1406-3.0779"/>
+<path d="m184.75 12.151a0.3424 0.3424 0 0 0 0.48879 0.45364"/>
+<path d="m196.93 27.351a4.9044 4.9044 0 0 0-2.2694 2.704"/>
+<path d="m194.66 30.055a3.7714 3.7714 0 0 1 1.8889-3.4772"/>
+<path d="m196.55 26.578a0.44249 0.44249 0 0 0 0.38049 0.77327"/>
+<path d="m180.08 92.276a0.12267 0.12267 0 0 0-0.20375 0.10948"/>
+<path d="m179.88 92.385a1.3536 1.3536 0 0 1 0.5284-1.8892"/>
+<path d="m180.41 90.496a1.3458 1.3458 0 0 0-0.32465 1.7798"/>
+<path d="m118.35 86.706a0.20506 0.20506 0 0 0-0.25926-0.28698"/>
+<path d="m118.09 86.419a3.4172 3.4172 0 0 1 3.7401-0.71659"/>
+<path d="m121.83 85.703a3.6666 3.6666 0 0 0-3.4808 1.0036"/>
+<path d="m162.76 99.385a0.21411 0.21411 0 0 0-0.39935 0.06518"/>
+<path d="m162.36 99.45a4.077 4.077 0 0 0-2.4731-2.9242"/>
+<path d="m159.88 96.526a3.7615 3.7615 0 0 1 2.8725 2.8591"/>
+<path d="m123.15 10.19a0.11405 0.11405 0 0 0 0.17754-0.12258"/>
+<path d="m123.32 10.068a1.3536 1.3536 0 0 0 1.7048 0.36772"/>
+<path d="m125.03 10.436a1.3458 1.3458 0 0 1-1.8823-0.24514"/>
+<path d="m142.41 89.246a40.628 40.628 0 0 1-0.98929 9.6158"/>
+<path d="m141.42 98.862a0.79724 0.79724 0 0 0-1.5128-0.19968"/>
+<path d="m139.91 98.662 2.5021-9.4161"/>
+<path d="m103 49.316a40.628 40.628 0 0 1 8.4671 1.1502"/>
+<path d="m111.46 50.466a67.224 67.224 0 0 1-8.5815 0.69056"/>
+<path d="m102.88 51.156a0.9503 0.9503 0 0 0 0.11444-1.8407"/>
+<path d="m165.53 2.2697a0.48181 0.48181 0 0 0 0.86078 0.28939"/>
+<path d="m166.39 2.5591a67.224 67.224 0 0 1-3.3629 9.1267"/>
+<path d="m163.02 11.686 2.5021-9.4161"/>
+<path d="m171.8 95.291a6.7952 6.7952 0 0 1 0.60331 1.0977"/>
+<path d="m172.4 96.389a0.094116 0.094116 0 0 0-0.15745 0.08907"/>
+<path d="m172.25 96.478a15.468 15.468 0 0 1-0.44586-1.1868"/>
+<path d="m117.46 25.88a10.69 10.69 0 0 1-7.2601-1.259"/>
+<path d="m110.2 24.621a0.60914 0.60914 0 0 0 0.48997-1.0577"/>
+<path d="m110.69 23.563a15.469 15.469 0 0 0 6.7701 2.3167"/>
+<path d="m194.66 30.055a10.655 10.655 0 0 0 3.1808-0.90207"/>
+<path d="m197.84 29.153a0.26559 0.26559 0 0 0 0.26136 0.43862"/>
+<path d="m198.1 29.591a6.0785 6.0785 0 0 1-3.4421 0.46345"/>
+<path d="m124.37 9.327a10.69 10.69 0 0 1 0.66378 1.1085"/>
+<path d="m125.03 10.436a5.2553 5.2553 0 0 1-0.88508-0.9725"/>
+<path d="m124.14 9.4631a0.13332 0.13332 0 0 0 0.2213-0.13602"/>
+<path d="m194.75 77.368a0.34673 0.34673 0 0 0-0.38236 0.53103"/>
+<path d="m194.37 77.899a22.316 22.316 0 0 0-6.3878-2.8477"/>
+<path d="m187.98 75.052a15.469 15.469 0 0 1 6.7701 2.3167"/>
+<path d="m107.34 71.34a0.17232 0.17232 0 0 0-0.11556-0.30406"/>
+<path d="m107.22 71.036a4.9705 4.9705 0 0 1 3.5577-0.15939"/>
+<path d="m110.78 70.877a6.0785 6.0785 0 0 0-3.4421 0.46345"/>
+<path d="m133.19 4.4539a0.057428 0.057428 0 0 0 0.10219-0.036561"/>
+<path d="m133.29 4.4173a5.2552 5.2552 0 0 1 0.34367 1.2234"/>
+<path d="m133.64 5.6407a15.468 15.468 0 0 0-0.44586-1.1868"/>
+<path d="m163.02 11.686-20.61 77.56"/>
+<path d="m142.41 89.246a40.628 40.628 0 0 0-30.95-38.78"/>
+<path d="m111.46 50.466a67.224 67.224 0 0 0 51.56-38.78"/>
+<path d="m187.98 75.052a15.469 15.469 0 0 0-16.179 20.239"/>
+<path d="m171.8 95.291a6.7951 6.7951 0 0 0-11.917 1.2349"/>
+<path d="m159.88 96.526a22.316 22.316 0 0 1 28.096-21.474"/>
+<path d="m159.88 96.526a3.7615 3.7615 0 0 0-4.5602 3.741"/>
+<path d="m155.32 100.27a0.54804 0.54804 0 0 0-1.027-0.06"/>
+<path d="m154.3 100.21a4.077 4.077 0 0 1 5.5872-3.681"/>
+<path d="m121.83 85.703a3.6666 3.6666 0 0 1 2.2236 5.5528"/>
+<path d="m124.05 91.255a0.46672 0.46672 0 0 0-0.71036-0.52126"/>
+<path d="m123.34 90.734a3.4172 3.4172 0 0 0-1.5133-5.0316"/>
+<path d="m110.78 70.877a6.0785 6.0785 0 0 1 3.191 10.46"/>
+<path d="m113.97 81.337a1.3281 1.3281 0 0 0-1.55-1.9516"/>
+<path d="m112.42 79.385a4.9705 4.9705 0 0 0-1.641-8.5088"/>
+<path d="m133.64 5.6407a15.469 15.469 0 0 1-16.179 20.239"/>
+<path d="m117.46 25.88a10.69 10.69 0 0 0 7.571-15.444"/>
+<path d="m125.03 10.436a5.2552 5.2552 0 0 0 8.6076-4.7949"/>
+<path d="m150.11 0.66477a3.7615 3.7615 0 0 1-4.5602 3.741"/>
+<path d="m145.55 4.4058a3.5239 3.5239 0 0 0 3.3039-3.5803"/>
+<path d="m148.86 0.82542a0.6581 0.6581 0 0 0 1.2563-0.16065"/>
+<path d="m181.38 9.676a3.6666 3.6666 0 0 0 2.2236 5.5528"/>
+<path d="m183.61 15.229a4.4789 4.4789 0 0 1-4.227-6.3968"/>
+<path d="m179.38 8.8321a1.153 1.153 0 0 0 2.0034 0.84391"/>
+<path d="m191.47 19.595a6.0785 6.0785 0 0 0 3.191 10.46"/>
+<path d="m194.66 30.055a10.655 10.655 0 0 1-11.052-14.826"/>
+<path d="m183.61 15.229a5.0728 5.0728 0 0 0 7.8611 4.3657"/>
+<path d="m152.26 0.91467a2.2014 2.2014 0 0 0 4.2485 0.19868"/>
+<path d="m156.5 1.1133a11.26 11.26 0 0 0 6.52 10.572"/>
+<path d="m163.02 11.686a11.34 11.34 0 0 1-10.768-10.771"/>
+<path d="m111.46 50.466a9.6931 9.6931 0 0 0-7.47-10.081"/>
+<path d="m103.99 40.385a0.98024 0.98024 0 0 0 0.55955-1.7497"/>
+<path d="m104.55 38.635a9.9378 9.9378 0 0 1 6.9104 11.83"/>
+<path d="m193.97 50.466a9.6931 9.6931 0 0 1 7.7372-8.8571"/>
+<path d="m201.71 41.609a0.72773 0.72773 0 0 0 0.18431 1.3585"/>
+<path d="m201.9 42.967a9.9378 9.9378 0 0 0-7.9215 7.4986"/>
+<path d="m201.44 60.546a9.6931 9.6931 0 0 1-7.47-10.081"/>
+<path d="m193.97 50.466a9.8897 9.8897 0 0 0 7.7258 7.632"/>
+<path d="m201.7 58.098a1.2849 1.2849 0 0 0-0.25582 2.4486"/>
+<path d="m103.73 59.323a9.6931 9.6931 0 0 0 7.7372-8.8571"/>
+<path d="m111.46 50.466a9.8897 9.8897 0 0 1-6.7373 11.509"/>
+<path d="m104.73 61.974a1.4954 1.4954 0 0 0-0.9999-2.6515"/>
+<path d="m131.71 95.511a2.1334 2.1334 0 0 0-3.4344-2.2387"/>
+<path d="m128.27 93.272a11.26 11.26 0 0 1 14.14-4.0265"/>
+<path d="m142.41 89.246a11.34 11.34 0 0 0-10.705 6.2653"/>
+<path d="m200.12 63.996a3.053 3.053 0 0 0-1.8454 5.5738"/>
+<path d="m198.27 69.57a8.0424 8.0424 0 0 0-10.29 5.4817"/>
+<path d="m187.98 75.052a10.119 10.119 0 0 1 12.136-11.055"/>
+<path d="m120.69 88.781a0.3424 0.3424 0 0 0-0.48879-0.45364"/>
+<path d="m120.2 88.327a10.655 10.655 0 0 0 1.6294-2.6242"/>
+<path d="m121.83 85.703a5.0728 5.0728 0 0 1-1.1406 3.0779"/>
+<path d="m108.89 74.354a0.44249 0.44249 0 0 0-0.38049-0.77327"/>
+<path d="m108.51 73.581a4.9044 4.9044 0 0 0 2.2694-2.704"/>
+<path d="m110.78 70.877a3.7714 3.7714 0 0 1-1.8889 3.4772"/>
+<path d="m131.81 5.1024a0.24302 0.24302 0 0 0 0.43437-0.18959"/>
+<path d="m132.24 4.9128a1.3437 1.3437 0 0 0 1.3944 0.72785"/>
+<path d="m133.64 5.6407a1.3096 1.3096 0 0 1-1.8288-0.53825"/>
+<path d="m125.03 10.436a1.3458 1.3458 0 0 0 0.32465-1.7798"/>
+<path d="m125.35 8.6558a0.12267 0.12267 0 0 0 0.20374-0.10948"/>
+<path d="m125.56 8.5463a1.3536 1.3536 0 0 1-0.52839 1.8892"/>
+<path d="m183.61 15.229a3.6666 3.6666 0 0 0 3.4808-1.0036"/>
+<path d="m187.09 14.225a0.20506 0.20506 0 0 0 0.25927 0.28698"/>
+<path d="m187.35 14.512a3.4172 3.4172 0 0 1-3.7401 0.71659"/>
+<path d="m180.41 90.496a1.3458 1.3458 0 0 1 1.8823 0.24514"/>
+<path d="m182.29 90.741a0.11405 0.11405 0 0 0-0.17754 0.12258"/>
+<path d="m182.11 90.864a1.3536 1.3536 0 0 0-1.7048-0.36772"/>
+<path d="m145.55 4.4058a3.7615 3.7615 0 0 1-2.8725-2.8591"/>
+<path d="m142.68 1.5467a0.21411 0.21411 0 0 0 0.39935-0.06518"/>
+<path d="m143.08 1.4815a4.077 4.077 0 0 0 2.4731 2.9242"/>
+<path d="m180.08 92.276a1.3458 1.3458 0 0 1 0.32465-1.7798"/>
+<path d="m180.41 90.496a1.4183 1.4183 0 0 0-0.0749 1.5855"/>
+<path d="m180.33 92.081a0.16416 0.16416 0 0 0-0.24973 0.19429"/>
+<path d="m118.35 86.706a3.6666 3.6666 0 0 1 3.4808-1.0036"/>
+<path d="m121.83 85.703a4.4789 4.4789 0 0 0-3.0314 1.3543"/>
+<path d="m118.8 87.057a0.29631 0.29631 0 0 0-0.44946-0.35074"/>
+<path d="m162.76 99.385a3.7615 3.7615 0 0 0-2.8725-2.8591"/>
+<path d="m159.88 96.526a3.5239 3.5239 0 0 1 3.6178 2.5846"/>
+<path d="m163.5 99.11a0.41565 0.41565 0 0 0-0.74532 0.27445"/>
+<path d="m123.15 10.19a1.3458 1.3458 0 0 0 1.8823 0.24514"/>
+<path d="m125.03 10.436a1.4183 1.4183 0 0 1-2.2045 0.08522"/>
+<path d="m122.82 10.521a0.2419 0.2419 0 0 0 0.32216-0.33036"/>
+<path d="m171.23 96.871a0.27938 0.27938 0 0 0-0.52229 0.14392"/>
+<path d="m170.71 97.015a1.3437 1.3437 0 0 1 1.0914-1.7243"/>
+<path d="m171.8 95.291a1.3096 1.3096 0 0 0-0.56913 1.5803"/>
+<path d="m113.86 19.24a0.99533 0.99533 0 0 0 1.3532-1.373"/>
+<path d="m115.21 17.867a8.0424 8.0424 0 0 1 2.2455 8.0125"/>
+<path d="m117.46 25.88a10.119 10.119 0 0 0-3.5986-6.6395"/>
+<path d="m145.32 1.0756a0.35842 0.35842 0 0 0 0.69515-0.05402"/>
+<path d="m146.01 1.0216a6.7951 6.7951 0 0 1-0.45733 3.3841"/>
+<path d="m145.55 4.4058a22.316 22.316 0 0 0-0.23782-3.3301"/>
+<path d="m199.54 33.453a1.609 1.609 0 0 0 0.52934 3.0358"/>
+<path d="m200.07 36.489a4.9044 4.9044 0 0 1-5.4062-6.4338"/>
+<path d="m194.66 30.055a3.7714 3.7714 0 0 0 4.8768 3.398"/>
+<path d="m202.56 49.775a0.9503 0.9503 0 0 0-0.11443 1.8407"/>
+<path d="m202.44 51.616a40.628 40.628 0 0 1-8.4671-1.1502"/>
+<path d="m193.97 50.466a67.224 67.224 0 0 1 8.5815-0.69056"/>
+<path d="m142.41 89.246-2.5021 9.4161"/>
+<path d="m139.91 98.662a0.48181 0.48181 0 0 0-0.86079-0.28939"/>
+<path d="m139.05 98.372a67.224 67.224 0 0 1 3.3629-9.1267"/>
+<path d="m165.53 2.2697-2.5021 9.4161"/>
+<path d="m163.02 11.686a40.628 40.628 0 0 1 0.98929-9.6157"/>
+<path d="m164.01 2.07a0.79724 0.79724 0 0 0 1.5128 0.19968"/>
+<path d="m181.29 91.468a0.13332 0.13332 0 0 0-0.2213 0.13602"/>
+<path d="m181.07 91.604a10.69 10.69 0 0 1-0.66378-1.1085"/>
+<path d="m180.41 90.496a5.2553 5.2553 0 0 1 0.88508 0.97249"/>
+<path d="m171.8 95.291a15.468 15.468 0 0 0 0.44586 1.1868"/>
+<path d="m172.25 96.478a0.057428 0.057428 0 0 0-0.1022 0.03656"/>
+<path d="m172.14 96.514a5.2552 5.2552 0 0 1-0.34366-1.2234"/>
+<path d="m117.46 25.88a15.469 15.469 0 0 1-6.7701-2.3167"/>
+<path d="m110.69 23.563a0.34673 0.34673 0 0 0 0.38236-0.53103"/>
+<path d="m111.07 23.032a22.316 22.316 0 0 0 6.3878 2.8477"/>
+<path d="m194.66 30.055a6.0785 6.0785 0 0 0 3.4421-0.46345"/>
+<path d="m198.1 29.591a0.17232 0.17232 0 0 0 0.11557 0.30405"/>
+<path d="m198.22 29.895a4.9705 4.9705 0 0 1-3.5577 0.1594"/>
+<path d="m194.75 77.368a15.469 15.469 0 0 0-6.7701-2.3167"/>
+<path d="m187.98 75.052a10.69 10.69 0 0 1 7.2601 1.259"/>
+<path d="m195.24 76.311a0.60914 0.60914 0 0 0-0.48997 1.0577"/>
+<path d="m107.34 71.34a6.0785 6.0785 0 0 1 3.4421-0.46345"/>
+<path d="m110.78 70.877a10.655 10.655 0 0 0-3.1808 0.90206"/>
+<path d="m107.6 71.779a0.26559 0.26559 0 0 0-0.26135-0.43861"/>
+<path d="m133.19 4.4539a15.468 15.468 0 0 1 0.44586 1.1868"/>
+<path d="m133.64 5.6407a6.7952 6.7952 0 0 1-0.60331-1.0977"/>
+<path d="m133.03 4.5429a0.094116 0.094116 0 0 0 0.15745-0.089067"/>
+<path d="m142.41 89.246a67.224 67.224 0 0 1 51.56-38.78"/>
+<path d="m193.97 50.466a18.17 18.17 0 0 0-5.9942 24.586"/>
+<path d="m187.98 75.052a36.88 36.88 0 0 0-45.566 14.194"/>
+<path d="m171.8 95.291a5.2552 5.2552 0 0 1 8.6076-4.7949"/>
+<path d="m180.41 90.496a2.1495 2.1495 0 0 0-2.7438 2.3549"/>
+<path d="m177.66 92.851a3.4214 3.4214 0 0 0-5.8638 2.44"/>
+<path d="m113.97 81.337a5.0728 5.0728 0 0 1 7.8611 4.3657"/>
+<path d="m121.83 85.703a3.6216 3.6216 0 0 0-5.1595-1.7537"/>
+<path d="m116.67 83.949a2.0073 2.0073 0 0 0-2.7016-2.6119"/>
+<path d="m117.46 25.88a22.316 22.316 0 0 0 28.096-21.474"/>
+<path d="m145.55 4.4058a13.699 13.699 0 0 0 17.47 7.28"/>
+<path d="m163.02 11.686a36.88 36.88 0 0 1-45.566 14.194"/>
+<path d="m145.55 4.4058a4.077 4.077 0 0 0 5.5872-3.681"/>
+<path d="m151.14 0.7248a0.667 0.667 0 0 0 1.1143 0.18988"/>
+<path d="m152.26 0.91467a4.4906 4.4906 0 0 1-6.7015 3.4911"/>
+<path d="m183.61 15.229a3.4172 3.4172 0 0 1-1.5133-5.0316"/>
+<path d="m182.1 10.197a0.34818 0.34818 0 0 0 0.46217 0.38542"/>
+<path d="m182.56 10.583a3.2982 3.2982 0 0 0 1.0511 4.6462"/>
+<path d="m194.66 30.055a4.9705 4.9705 0 0 1-1.641-8.5088"/>
+<path d="m193.02 21.546a0.83502 0.83502 0 0 0 0.79612 1.1979"/>
+<path d="m193.82 22.744a4.3887 4.3887 0 0 0 0.84488 7.3109"/>
+<path d="m173.73 5.4205a11.34 11.34 0 0 1-10.705 6.2653"/>
+<path d="m163.02 11.686a13.699 13.699 0 0 0 7.4615-6.9323"/>
+<path d="m170.49 4.7534a1.7973 1.7973 0 0 0 3.2437 0.66706"/>
+<path d="m153.18 100.02a11.34 11.34 0 0 0-10.768-10.771"/>
+<path d="m142.41 89.246a13.699 13.699 0 0 1 17.47 7.28"/>
+<path d="m159.88 96.526a4.4906 4.4906 0 0 0-6.7015 3.4911"/>
+<path d="m122.88 90.349a0.97208 0.97208 0 0 0-1.3948-1.2412"/>
+<path d="m121.49 89.108a3.6216 3.6216 0 0 0 0.3437-3.4049"/>
+<path d="m121.83 85.703a3.2982 3.2982 0 0 1 1.0511 4.6462"/>
+<path d="m111.62 78.187a1.8234 1.8234 0 0 0-1.7954-2.9964"/>
+<path d="m109.83 75.191a3.4768 3.4768 0 0 0 0.95054-4.3145"/>
+<path d="m110.78 70.877a4.3887 4.3887 0 0 1 0.84488 7.3109"/>
+<path d="m127.77 8.0807a2.207 2.207 0 0 0 3.4673-2.3558"/>
+<path d="m131.24 5.7249a1.5178 1.5178 0 0 0 2.3965-0.084212"/>
+<path d="m133.64 5.6407a3.4213 3.4213 0 0 1-5.8638 2.44"/>
+<path d="m193.97 50.466a9.9378 9.9378 0 0 0 6.9104 11.83"/>
+<path d="m200.88 62.296a1.1012 1.1012 0 0 0-0.76894 1.7"/>
+<path d="m200.12 63.996a10.38 10.38 0 0 1-6.1415-13.53"/>
+<path d="m111.46 50.466a9.9378 9.9378 0 0 1-7.9215 7.4986"/>
+<path d="m103.54 57.964a0.5969 0.5969 0 0 0-0.0614-1.0256"/>
+<path d="m103.48 56.939a10.38 10.38 0 0 0 7.9829-6.473"/>
+<path d="m191.58 81.691a10.119 10.119 0 0 1-3.5986-6.6395"/>
+<path d="m187.98 75.052a18.17 18.17 0 0 0 4.3506 5.0121"/>
+<path d="m192.33 80.064a0.9726 0.9726 0 0 0-0.75202 1.6274"/>
+<path d="m160.12 99.856a22.316 22.316 0 0 1-0.23782-3.3301"/>
+<path d="m159.88 96.526a13.699 13.699 0 0 1 0.92832 3.0275"/>
+<path d="m160.81 99.553a0.4104 0.4104 0 0 0-0.6905 0.3026"/>
+<path d="m105.9 67.479a3.7714 3.7714 0 0 1 4.8768 3.398"/>
+<path d="m110.78 70.877a3.4768 3.4768 0 0 0-3.951-1.7908"/>
+<path d="m106.83 69.086a0.99214 0.99214 0 0 0-0.92588-1.6071"/>
+<path d="m134.21 4.0603a1.3096 1.3096 0 0 1-0.56913 1.5803"/>
+<path d="m133.64 5.6407a1.5178 1.5178 0 0 0 0.21511-1.349"/>
+<path d="m133.85 4.2916a0.2266 0.2266 0 0 0 0.35402-0.23129"/>
+<path d="m173.63 95.829a1.3096 1.3096 0 0 0-1.8288-0.53825"/>
+<path d="m171.8 95.291a1.5178 1.5178 0 0 1 2.3965-0.08421"/>
+<path d="m174.2 95.207a0.48043 0.48043 0 0 0-0.56769 0.62247"/>
+<path d="m105.32 36.935a10.119 10.119 0 0 0 12.136-11.055"/>
+<path d="m117.46 25.88a18.17 18.17 0 0 1-5.9942 24.586"/>
+<path d="m111.46 50.466a10.38 10.38 0 0 0-6.1415-13.53"/>
+<path d="m184.75 12.151a5.0728 5.0728 0 0 0-1.1406 3.0779"/>
+<path d="m183.61 15.229a3.6216 3.6216 0 0 1 0.3437-3.4049"/>
+<path d="m183.95 11.824a0.47488 0.47488 0 0 0 0.79695 0.32706"/>
+<path d="m196.55 26.578a3.7714 3.7714 0 0 0-1.8889 3.4772"/>
+<path d="m194.66 30.055a3.4768 3.4768 0 0 1 0.95053-4.3145"/>
+<path d="m195.61 25.74a0.70213 0.70213 0 0 0 0.93839 0.83724"/>
+<path d="m201.96 43.993a1.9794 1.9794 0 0 0-0.0354 3.7669"/>
+<path d="m201.92 47.76a18.17 18.17 0 0 0-7.9475 2.7061"/>
+<path d="m193.97 50.466a10.38 10.38 0 0 1 7.9829-6.473"/>
+<path d="m180.41 90.496a1.3536 1.3536 0 0 0-0.5284 1.8892"/>
+<path d="m179.88 92.385a0.13547 0.13547 0 0 0-0.2126 0.09295"/>
+<path d="m179.67 92.478a1.39 1.39 0 0 1 0.741-1.9822"/>
+<path d="m121.83 85.703a3.4172 3.4172 0 0 0-3.7401 0.71659"/>
+<path d="m118.09 86.419a0.21269 0.21269 0 0 0-0.22318-0.28881"/>
+<path d="m117.87 86.13a3.2982 3.2982 0 0 1 3.9633-0.42778"/>
+<path d="m159.88 96.526a4.077 4.077 0 0 1 2.4731 2.9242"/>
+<path d="m162.36 99.45a0.18152 0.18152 0 0 0-0.31193 0.03184"/>
+<path d="m162.05 99.482a4.4906 4.4906 0 0 0-2.1612-2.9561"/>
+<path d="m125.03 10.436a1.3536 1.3536 0 0 1-1.7048-0.36772"/>
+<path d="m123.32 10.068a0.091955 0.091955 0 0 0 0.13565-0.083226"/>
+<path d="m123.46 9.9846a1.39 1.39 0 0 0 1.5691 0.45095"/>
+<path d="m102.88 51.156a67.224 67.224 0 0 0 8.5815-0.69056"/>
+<path d="m111.46 50.466a18.17 18.17 0 0 1-7.9475 2.7061"/>
+<path d="m103.52 53.172a1.1613 1.1613 0 0 0-0.63396-2.0155"/>
+<path d="m125.77 8.4534a1.1386 1.1386 0 0 0 2.0029-0.3727"/>
+<path d="m127.77 8.0807a2.1495 2.1495 0 0 1-2.7438 2.3549"/>
+<path d="m125.03 10.436a1.39 1.39 0 0 0 0.74099-1.9822"/>
+<path d="m187.57 14.801a1.3475 1.3475 0 0 0 1.1962 2.1815"/>
+<path d="m188.77 16.983a3.6216 3.6216 0 0 1-5.1595-1.7537"/>
+<path d="m183.61 15.229a3.2982 3.2982 0 0 0 3.9633-0.42778"/>
+<path d="m181.98 90.947a0.29497 0.29497 0 0 0-0.4909 0.2843"/>
+<path d="m181.49 91.231a2.1495 2.1495 0 0 0-1.0782-0.73524"/>
+<path d="m180.41 90.496a1.39 1.39 0 0 1 1.5691 0.45094"/>
+<path d="m143.39 1.4497a0.645 0.645 0 0 0 1.2329-0.071439"/>
+<path d="m144.63 1.3782a13.699 13.699 0 0 0 0.92832 3.0275"/>
+<path d="m145.55 4.4058a4.4906 4.4906 0 0 1-2.1612-2.9561"/>
+<path d="m163.02 11.686a67.224 67.224 0 0 0 3.3629-9.1267"/>
+<path d="m166.39 2.5591a0.45229 0.45229 0 0 0 0.71534 0.30344"/>
+<path d="m167.1 2.8625a36.88 36.88 0 0 1-4.0782 8.8232"/>
+<path d="m124.14 9.4631a5.2553 5.2553 0 0 0 0.88508 0.9725"/>
+<path d="m125.03 10.436a2.1495 2.1495 0 0 1-1.0782-0.73525"/>
+<path d="m123.95 9.7003a0.1671 0.1671 0 0 0 0.19315-0.23725"/>
+<path d="m138.34 98.069a2.0619 2.0619 0 0 0-3.3832-1.8909"/>
+<path d="m134.95 96.178a13.699 13.699 0 0 1 7.4615-6.9323"/>
+<path d="m142.41 89.246a36.88 36.88 0 0 0-4.0782 8.8232"/>
+<path d="m187.98 75.052a22.316 22.316 0 0 1 6.3878 2.8477"/>
+<path d="m194.37 77.899a0.31273 0.31273 0 0 0-0.34409 0.41442"/>
+<path d="m194.02 78.314a36.88 36.88 0 0 0-6.0437-3.2621"/>
+<path d="m110.78 70.877a4.9705 4.9705 0 0 0-3.5577 0.15939"/>
+<path d="m107.22 71.036a0.17017 0.17017 0 0 0-0.0844-0.28025"/>
+<path d="m107.14 70.756a4.3887 4.3887 0 0 1 3.6421 0.12086"/>
+<path d="m133.64 5.6407a5.2552 5.2552 0 0 0-0.34367-1.2234"/>
+<path d="m133.29 4.4173a0.054277 0.054277 0 0 0 0.0899-0.025952"/>
+<path d="m133.38 4.3914a3.4213 3.4213 0 0 1 0.25374 1.2493"/>
+<path d="m172.05 96.54a0.25231 0.25231 0 0 0-0.46884 0.09973"/>
+<path d="m171.59 96.64a1.5178 1.5178 0 0 1 0.21511-1.349"/>
+<path d="m171.8 95.291a3.4213 3.4213 0 0 0 0.25373 1.2493"/>
+<path d="m111.41 22.618a1.2827 1.2827 0 0 0 1.693-1.75"/>
+<path d="m113.11 20.868a18.17 18.17 0 0 1 4.3506 5.0121"/>
+<path d="m117.46 25.88a36.88 36.88 0 0 1-6.0437-3.2621"/>
+<path d="m198.3 30.176a0.90454 0.90454 0 0 0 0.30887 1.67"/>
+<path d="m198.61 31.846a3.4768 3.4768 0 0 1-3.951-1.7908"/>
+<path d="m194.66 30.055a4.3887 4.3887 0 0 0 3.6421 0.12086"/>
+<path d="m163.02 11.686a67.224 67.224 0 0 1-51.56 38.78"/>
+<path d="m111.46 50.466a18.17 18.17 0 0 0 5.9942-24.586"/>
+<path d="m117.46 25.88a36.88 36.88 0 0 0 45.566-14.194"/>
+<path d="m187.98 75.052a22.316 22.316 0 0 0-28.096 21.474"/>
+<path d="m159.88 96.526a13.699 13.699 0 0 0-17.47-7.28"/>
+<path d="m142.41 89.246a36.88 36.88 0 0 1 45.566-14.194"/>
+<path d="m159.88 96.526a4.077 4.077 0 0 0-5.5872 3.681"/>
+<path d="m154.3 100.21a0.667 0.667 0 0 0-1.1143-0.18987"/>
+<path d="m153.18 100.02a4.4906 4.4906 0 0 1 6.7015-3.4911"/>
+<path d="m121.83 85.703a3.4172 3.4172 0 0 1 1.5133 5.0316"/>
+<path d="m123.34 90.734a0.34818 0.34818 0 0 0-0.46217-0.38541"/>
+<path d="m122.88 90.349a3.2982 3.2982 0 0 0-1.0511-4.6462"/>
+<path d="m110.78 70.877a4.9705 4.9705 0 0 1 1.641 8.5088"/>
+<path d="m112.42 79.385a0.83502 0.83502 0 0 0-0.79611-1.1979"/>
+<path d="m111.62 78.187a4.3887 4.3887 0 0 0-0.84488-7.3109"/>
+<path d="m133.64 5.6407a5.2552 5.2552 0 0 1-8.6076 4.7949"/>
+<path d="m125.03 10.436a2.1495 2.1495 0 0 0 2.7438-2.3549"/>
+<path d="m127.77 8.0807a3.4214 3.4214 0 0 0 5.8638-2.44"/>
+<path d="m191.47 19.595a5.0728 5.0728 0 0 1-7.8611-4.3657"/>
+<path d="m183.61 15.229a3.6216 3.6216 0 0 0 5.1595 1.7537"/>
+<path d="m188.77 16.983a2.0073 2.0073 0 0 0 2.7016 2.6119"/>
+<path d="m177.66 92.851a2.207 2.207 0 0 0-3.4673 2.3558"/>
+<path d="m174.2 95.207a1.5178 1.5178 0 0 0-2.3965 0.08421"/>
+<path d="m171.8 95.291a3.4213 3.4213 0 0 1 5.8638-2.44"/>
+<path d="m152.26 0.91467a11.34 11.34 0 0 0 10.768 10.771"/>
+<path d="m163.02 11.686a13.699 13.699 0 0 1-17.47-7.28"/>
+<path d="m145.55 4.4058a4.4906 4.4906 0 0 0 6.7015-3.4911"/>
+<path d="m182.56 10.583a0.97208 0.97208 0 0 0 1.3948 1.2412"/>
+<path d="m183.95 11.824a3.6216 3.6216 0 0 0-0.3437 3.4049"/>
+<path d="m183.61 15.229a3.2982 3.2982 0 0 1-1.0511-4.6462"/>
+<path d="m193.82 22.744a1.8234 1.8234 0 0 0 1.7954 2.9964"/>
+<path d="m195.61 25.74a3.4768 3.4768 0 0 0-0.95053 4.3145"/>
+<path d="m194.66 30.055a4.3887 4.3887 0 0 1-0.84488-7.3109"/>
+<path d="m111.46 50.466a9.9378 9.9378 0 0 0-6.9104-11.83"/>
+<path d="m104.55 38.635a1.1012 1.1012 0 0 0 0.76894-1.7"/>
+<path d="m105.32 36.935a10.38 10.38 0 0 1 6.1415 13.53"/>
+<path d="m193.97 50.466a9.9378 9.9378 0 0 1 7.9215-7.4986"/>
+<path d="m201.9 42.967a0.5969 0.5969 0 0 0 0.0614 1.0256"/>
+<path d="m201.96 43.993a10.38 10.38 0 0 0-7.9829 6.473"/>
+<path d="m131.71 95.511a11.34 11.34 0 0 1 10.705-6.2653"/>
+<path d="m142.41 89.246a13.699 13.699 0 0 0-7.4615 6.9323"/>
+<path d="m134.95 96.178a1.7973 1.7973 0 0 0-3.2437-0.66706"/>
+<path d="m200.12 63.996a10.119 10.119 0 0 0-12.136 11.055"/>
+<path d="m187.98 75.052a18.17 18.17 0 0 1 5.9942-24.586"/>
+<path d="m193.97 50.466a10.38 10.38 0 0 0 6.1415 13.53"/>
+<path d="m120.69 88.781a5.0728 5.0728 0 0 0 1.1406-3.0779"/>
+<path d="m121.83 85.703a3.6216 3.6216 0 0 1-0.3437 3.4049"/>
+<path d="m121.49 89.108a0.47488 0.47488 0 0 0-0.79695-0.32706"/>
+<path d="m108.89 74.354a3.7714 3.7714 0 0 0 1.8889-3.4772"/>
+<path d="m110.78 70.877a3.4768 3.4768 0 0 1-0.95054 4.3145"/>
+<path d="m109.83 75.191a0.70213 0.70213 0 0 0-0.93838-0.83724"/>
+<path d="m131.81 5.1024a1.3096 1.3096 0 0 0 1.8288 0.53825"/>
+<path d="m133.64 5.6407a1.5178 1.5178 0 0 1-2.3965 0.084212"/>
+<path d="m131.24 5.7249a0.48043 0.48043 0 0 0 0.56769-0.62247"/>
+<path d="m103.48 56.939a1.9794 1.9794 0 0 0 0.0354-3.7669"/>
+<path d="m103.52 53.172a18.17 18.17 0 0 0 7.9475-2.7061"/>
+<path d="m111.46 50.466a10.38 10.38 0 0 1-7.9829 6.473"/>
+<path d="m125.03 10.436a1.3536 1.3536 0 0 0 0.52839-1.8892"/>
+<path d="m125.56 8.5463a0.13547 0.13547 0 0 0 0.2126-0.092948"/>
+<path d="m125.77 8.4534a1.39 1.39 0 0 1-0.74099 1.9822"/>
+<path d="m183.61 15.229a3.4172 3.4172 0 0 0 3.7401-0.71659"/>
+<path d="m187.35 14.512a0.21269 0.21269 0 0 0 0.22318 0.28881"/>
+<path d="m187.57 14.801a3.2982 3.2982 0 0 1-3.9633 0.42778"/>
+<path d="m180.41 90.496a1.3536 1.3536 0 0 1 1.7048 0.36772"/>
+<path d="m182.11 90.864a0.091955 0.091955 0 0 0-0.13565 0.08322"/>
+<path d="m181.98 90.947a1.39 1.39 0 0 0-1.5691-0.45094"/>
+<path d="m145.55 4.4058a4.077 4.077 0 0 1-2.4731-2.9242"/>
+<path d="m143.08 1.4815a0.18152 0.18152 0 0 0 0.31193-0.031841"/>
+<path d="m143.39 1.4497a4.4906 4.4906 0 0 0 2.1612 2.9561"/>
+<path d="m171.23 96.871a1.3096 1.3096 0 0 1 0.56913-1.5803"/>
+<path d="m171.8 95.291a1.5178 1.5178 0 0 0-0.21511 1.349"/>
+<path d="m171.59 96.64a0.2266 0.2266 0 0 0-0.35402 0.23129"/>
+<path d="m113.86 19.24a10.119 10.119 0 0 1 3.5986 6.6395"/>
+<path d="m117.46 25.88a18.17 18.17 0 0 0-4.3506-5.0121"/>
+<path d="m113.11 20.868a0.9726 0.9726 0 0 0 0.75202-1.6274"/>
+<path d="m145.32 1.0756a22.316 22.316 0 0 1 0.23782 3.3301"/>
+<path d="m145.55 4.4058a13.699 13.699 0 0 1-0.92832-3.0275"/>
+<path d="m144.63 1.3782a0.4104 0.4104 0 0 0 0.6905-0.3026"/>
+<path d="m199.54 33.453a3.7714 3.7714 0 0 1-4.8768-3.398"/>
+<path d="m194.66 30.055a3.4768 3.4768 0 0 0 3.951 1.7908"/>
+<path d="m198.61 31.846a0.99214 0.99214 0 0 0 0.92587 1.6071"/>
+<path d="m179.67 92.478a1.1386 1.1386 0 0 0-2.0028 0.3727"/>
+<path d="m177.66 92.851a2.1495 2.1495 0 0 1 2.7438-2.3549"/>
+<path d="m180.41 90.496a1.39 1.39 0 0 0-0.741 1.9822"/>
+<path d="m117.87 86.13a1.3475 1.3475 0 0 0-1.1962-2.1815"/>
+<path d="m116.67 83.949a3.6216 3.6216 0 0 1 5.1595 1.7537"/>
+<path d="m121.83 85.703a3.2982 3.2982 0 0 0-3.9633 0.42778"/>
+<path d="m202.56 49.775a67.224 67.224 0 0 0-8.5815 0.69056"/>
+<path d="m193.97 50.466a18.17 18.17 0 0 1 7.9475-2.7061"/>
+<path d="m201.92 47.76a1.1613 1.1613 0 0 0 0.63395 2.0155"/>
+<path d="m162.05 99.482a0.645 0.645 0 0 0-1.2329 0.07144"/>
+<path d="m160.81 99.553a13.699 13.699 0 0 0-0.92832-3.0275"/>
+<path d="m159.88 96.526a4.4906 4.4906 0 0 1 2.1612 2.9561"/>
+<path d="m123.46 9.9846a0.29497 0.29497 0 0 0 0.4909-0.2843"/>
+<path d="m123.95 9.7003a2.1495 2.1495 0 0 0 1.0782 0.73525"/>
+<path d="m125.03 10.436a1.39 1.39 0 0 1-1.5691-0.45095"/>
+<path d="m142.41 89.246a67.224 67.224 0 0 0-3.3629 9.1267"/>
+<path d="m139.05 98.372a0.45229 0.45229 0 0 0-0.71532-0.30344"/>
+<path d="m138.34 98.069a36.88 36.88 0 0 1 4.0782-8.8232"/>
+<path d="m167.1 2.8625a2.0619 2.0619 0 0 0 3.3832 1.8909"/>
+<path d="m170.49 4.7534a13.699 13.699 0 0 1-7.4615 6.9323"/>
+<path d="m163.02 11.686a36.88 36.88 0 0 0 4.0782-8.8232"/>
+<path d="m181.29 91.468a5.2553 5.2553 0 0 0-0.88508-0.97249"/>
+<path d="m180.41 90.496a2.1495 2.1495 0 0 1 1.0782 0.73524"/>
+<path d="m181.49 91.231a0.1671 0.1671 0 0 0-0.19315 0.23724"/>
+<path d="m171.8 95.291a5.2552 5.2552 0 0 0 0.34366 1.2234"/>
+<path d="m172.14 96.514a0.054277 0.054277 0 0 0-0.0899 0.02595"/>
+<path d="m172.05 96.54a3.4213 3.4213 0 0 1-0.25373-1.2493"/>
+<path d="m117.46 25.88a22.316 22.316 0 0 1-6.3878-2.8477"/>
+<path d="m111.07 23.032a0.31273 0.31273 0 0 0 0.34409-0.41442"/>
+<path d="m111.41 22.618a36.88 36.88 0 0 0 6.0437 3.2621"/>
+<path d="m194.66 30.055a4.9705 4.9705 0 0 0 3.5577-0.1594"/>
+<path d="m198.22 29.895a0.17017 0.17017 0 0 0 0.0844 0.28026"/>
+<path d="m198.3 30.176a4.3887 4.3887 0 0 1-3.6421-0.12086"/>
+<path d="m194.02 78.314a1.2827 1.2827 0 0 0-1.693 1.75"/>
+<path d="m192.33 80.064a18.17 18.17 0 0 1-4.3506-5.0121"/>
+<path d="m187.98 75.052a36.88 36.88 0 0 1 6.0437 3.2621"/>
+<path d="m107.14 70.756a0.90454 0.90454 0 0 0-0.30886-1.67"/>
+<path d="m106.83 69.086a3.4768 3.4768 0 0 1 3.951 1.7908"/>
+<path d="m110.78 70.877a4.3887 4.3887 0 0 0-3.6421-0.12086"/>
+<path d="m133.38 4.3914a0.25231 0.25231 0 0 0 0.46885-0.099734"/>
+<path d="m133.85 4.2916a1.5178 1.5178 0 0 1-0.21511 1.349"/>
+<path d="m133.64 5.6407a3.4213 3.4213 0 0 0-0.25374-1.2493"/>
+<path d="m89.981 38.32a10.916 10.916 0 0 0 4.3886 11.83"/>
+<path d="m94.37 50.15a15.933 15.933 0 0 0-5.4332 25.627"/>
+<path d="m88.937 75.777a24.595 24.595 0 0 1 1.0447-37.458"/>
+<path d="m81.922 86.54a1.8761 1.8761 0 0 0-1.2887 2.0486"/>
+<path d="m80.634 88.589a2.1175 2.1175 0 0 0-2.8614 2.6996"/>
+<path d="m77.772 91.288a3.4141 3.4141 0 0 1 4.1501-4.7483"/>
+<path d="m33.25 90.455a6.7797 6.7797 0 0 0-6.5808 1.4656"/>
+<path d="m26.669 91.921a3.3957 3.3957 0 0 0-5.7725-1.8217"/>
+<path d="m20.897 90.099a7.855 7.855 0 0 1 12.353 0.35607"/>
+<path d="m5.93 50.15a10.916 10.916 0 0 1 4.3886 11.83"/>
+<path d="m10.319 61.98a10.319 10.319 0 0 0-9.103-3.2959"/>
+<path d="m1.2155 58.684a6.5282 6.5282 0 0 0 4.7145-8.5345"/>
+<path d="m38.749 4.2514a3.9074 3.9074 0 0 0 5.0562-0.94142"/>
+<path d="m43.805 3.31a14.646 14.646 0 0 0 23.245 6.535"/>
+<path d="m67.05 9.845a17.462 17.462 0 0 1-28.301-5.5936"/>
+<path d="m11.363 24.523a3.8709 3.8709 0 0 0-0.77075-3.3795"/>
+<path d="m10.593 21.143a1.4082 1.4082 0 0 0 0.86137-2.3685"/>
+<path d="m11.454 18.775a3.8021 3.8021 0 0 1-0.09062 5.748"/>
+<path d="m43.805 3.31a3.9073 3.9073 0 0 0 0.83771-2.2672"/>
+<path d="m44.643 1.0428a0.78675 0.78675 0 0 0 1.2398-0.62108"/>
+<path d="m45.883 0.42176a2.8369 2.8369 0 0 1-2.0775 2.8882"/>
+<path d="m56.495 96.99a3.9074 3.9074 0 0 1 5.0562-0.94142"/>
+<path d="m61.551 96.049a2.8518 2.8518 0 0 0-1.5454 3.0016"/>
+<path d="m60.006 99.05a2.8369 2.8369 0 0 0-3.5108-2.0602"/>
+<path d="m19.666 11.711a1.8761 1.8761 0 0 1-1.2887 2.0486"/>
+<path d="m18.378 13.76a2.0664 2.0664 0 0 0-0.37632-1.8304"/>
+<path d="m18.001 11.929a1.0344 1.0344 0 0 0 1.6651-0.2182"/>
+<path d="m73.631 8.3794a6.7797 6.7797 0 0 1-6.5808 1.4656"/>
+<path d="m67.05 9.845a14.646 14.646 0 0 0 3.8593-4.9824"/>
+<path d="m70.909 4.8626a2.6113 2.6113 0 0 0 2.7215 3.5167"/>
+<path d="m37.965 96.082a6.7797 6.7797 0 0 0-4.715-5.6274"/>
+<path d="m33.25 90.455a14.646 14.646 0 0 1 23.245 6.535"/>
+<path d="m56.495 96.99a10.346 10.346 0 0 0-18.53-0.90755"/>
+<path d="m9.6167 78.304a1.0209 1.0209 0 0 0-0.64482-1.2354"/>
+<path d="m8.9719 77.068a10.319 10.319 0 0 0 1.3467-15.088"/>
+<path d="m10.319 61.98a10.778 10.778 0 0 1-0.70186 16.323"/>
+<path d="m94.37 50.15a10.916 10.916 0 0 0 4.5657 1.7859"/>
+<path d="m98.936 51.936a1.5435 1.5435 0 0 0 0.86158 2.5335"/>
+<path d="m99.797 54.469a6.5282 6.5282 0 0 1-5.4273-4.3194"/>
+<path d="m67.05 9.845a6.7797 6.7797 0 0 1-4.715-5.6274"/>
+<path d="m62.335 4.2176a2.5901 2.5901 0 0 0 3.5282-1.3663"/>
+<path d="m65.863 2.8512a7.855 7.855 0 0 0 1.1868 6.9938"/>
+<path d="m89.707 79.157a3.8709 3.8709 0 0 1-0.77074-3.3795"/>
+<path d="m88.937 75.777a15.933 15.933 0 0 0 2.618 2.234"/>
+<path d="m91.555 78.011a1.2381 1.2381 0 0 0-1.8473 1.1455"/>
+<path d="m55.657 99.257a3.9073 3.9073 0 0 1 0.83771-2.2672"/>
+<path d="m56.495 96.99a14.647 14.647 0 0 1 0.62601 2.5986"/>
+<path d="m57.121 99.589a0.83325 0.83325 0 0 0-1.4637-0.33145"/>
+<path d="m7.6229 27.474a3.8709 3.8709 0 0 0 3.7404-2.9508"/>
+<path d="m11.363 24.523a15.933 15.933 0 0 1-5.4332 25.627"/>
+<path d="m5.93 50.15a13.364 13.364 0 0 0 1.6929-22.676"/>
+<path d="m94.5 32.035a10.916 10.916 0 0 0-4.5188 6.2841"/>
+<path d="m89.981 38.32a10.319 10.319 0 0 1 1.3467-15.088"/>
+<path d="m91.328 23.232a5.0668 5.0668 0 0 0 3.1722 8.8038"/>
+<path d="m65.779 97.495a0.2253 0.2253 0 0 0-0.30498 0.05874"/>
+<path d="m65.475 97.554a2.8518 2.8518 0 0 0-3.9233-1.5053"/>
+<path d="m61.551 96.049a2.9146 2.9146 0 0 1 4.2283 1.4466"/>
+<path d="m14.795 15.024a0.25016 0.25016 0 0 0 0.26714-0.21967"/>
+<path d="m15.062 14.804a2.0664 2.0664 0 0 0 3.3152-1.0443"/>
+<path d="m18.378 13.76a2.1932 2.1932 0 0 1-3.5823 1.264"/>
+<path d="m100.01 48.657a0.19542 0.19542 0 0 0-0.03863 0.26484"/>
+<path d="m99.972 48.922a15.933 15.933 0 0 0-5.6022 1.2283"/>
+<path d="m94.37 50.15a13.364 13.364 0 0 1 5.6408-1.4932"/>
+<path d="m26.669 91.921a6.7797 6.7797 0 0 0-1.1161 1.3151"/>
+<path d="m25.553 93.236a0.4823 0.4823 0 0 0-0.82877-0.08928"/>
+<path d="m24.724 93.146a2.6113 2.6113 0 0 1 1.9449-1.2258"/>
+<path d="m10.319 61.98a10.916 10.916 0 0 1-4.5188 6.2841"/>
+<path d="m5.7997 68.265a2.3006 2.3006 0 0 0-2.8696-2.2054"/>
+<path d="m2.9302 66.059a24.595 24.595 0 0 0 7.3884-4.0787"/>
+<path d="m88.937 75.777a3.8709 3.8709 0 0 1 3.7404-2.9508"/>
+<path d="m92.677 72.826a1.8445 1.8445 0 0 0 0.53496 2.5325"/>
+<path d="m93.212 75.359a3.8021 3.8021 0 0 0-4.2753 0.41821"/>
+<path d="m1.3643 48.364a10.916 10.916 0 0 1 4.5657 1.7859"/>
+<path d="m5.93 50.15a15.933 15.933 0 0 1-5.6022 1.2283"/>
+<path d="m0.32781 51.378a1.7683 1.7683 0 0 0 1.0365-3.0142"/>
+<path d="m78.975 9.6346a0.53698 0.53698 0 0 0 0.42792 0.56651"/>
+<path d="m79.403 10.201a3.3957 3.3957 0 0 1-5.7725-1.8217"/>
+<path d="m73.631 8.3794a3.0909 3.0909 0 0 0 5.3446 1.2552"/>
+<path d="m99.1 41.096a0.38303 0.38303 0 0 0-0.01555 0.51939"/>
+<path d="m99.084 41.616a10.319 10.319 0 0 1-9.103-3.2959"/>
+<path d="m89.981 38.32a10.778 10.778 0 0 0 9.1186 2.7765"/>
+<path d="m83.548 86.778a1.8761 1.8761 0 0 0-1.6259-0.23757"/>
+<path d="m81.922 86.54a2.0664 2.0664 0 0 1 3.3152-1.0443"/>
+<path d="m85.238 85.496a1.1132 1.1132 0 0 0-1.6892 1.2819"/>
+<path d="m37.163 2.464a3.9074 3.9074 0 0 0 1.5861 1.7874"/>
+<path d="m38.749 4.2514a2.8518 2.8518 0 0 1-3.9233-1.5053"/>
+<path d="m34.825 2.7461a1.2477 1.2477 0 0 0 2.3372-0.28214"/>
+<path d="m60.737 1.3682a0.13371 0.13371 0 0 0 0.17231 0.06485"/>
+<path d="m60.91 1.433a2.5901 2.5901 0 0 0 1.4252 2.7845"/>
+<path d="m62.335 4.2176a2.5584 2.5584 0 0 1-1.5976-2.8494"/>
+<path d="m26.413 94.106a0.073551 0.073551 0 0 0-0.07971-0.06207"/>
+<path d="m26.333 94.044a3.3957 3.3957 0 0 0 0.3364-2.123"/>
+<path d="m26.669 91.921a3.0909 3.0909 0 0 1-0.25668 2.185"/>
+<path d="m43.06 0.70719a0.086522 0.086522 0 0 0 0.11852 0.004196"/>
+<path d="m43.179 0.71139a14.647 14.647 0 0 0 0.62601 2.5986"/>
+<path d="m43.805 3.31a10.346 10.346 0 0 1-0.74453-2.6028"/>
+<path d="m61.551 96.049a3.9074 3.9074 0 0 1 1.5861 1.7875"/>
+<path d="m63.137 97.836a0.63727 0.63727 0 0 0-0.72952 0.73621"/>
+<path d="m62.408 98.572a17.462 17.462 0 0 0-0.85655-2.5237"/>
+<path d="m18.378 13.76a1.8761 1.8761 0 0 1-1.6259-0.23757"/>
+<path d="m16.752 13.522a0.45993 0.45993 0 0 0 0.18666-0.7041"/>
+<path d="m16.938 12.818a3.4141 3.4141 0 0 0 1.4393 0.94167"/>
+<path d="m74.747 7.0642a6.7797 6.7797 0 0 1-1.1161 1.3151"/>
+<path d="m73.631 8.3794a3.3957 3.3957 0 0 1 0.3364-2.123"/>
+<path d="m73.967 6.2564a0.61103 0.61103 0 0 0 0.77969 0.80783"/>
+<path d="m82.378 88.328a0.066205 0.066205 0 0 0-0.0794 0.04298"/>
+<path d="m82.299 88.371a2.0664 2.0664 0 0 1-0.37632-1.8304"/>
+<path d="m81.922 86.54a2.1932 2.1932 0 0 0 0.45572 1.7875"/>
+<path d="m29.629 95.607a0.21476 0.21476 0 0 0-0.23876-0.16985"/>
+<path d="m29.391 95.437a14.646 14.646 0 0 1 3.8593-4.9824"/>
+<path d="m33.25 90.455a17.462 17.462 0 0 0-3.6206 5.1522"/>
+<path d="m40.11 1.2472a0.1355 0.1355 0 0 0 0.18415 0.00269"/>
+<path d="m40.294 1.2498a2.8518 2.8518 0 0 1-1.5454 3.0016"/>
+<path d="m38.749 4.2514a2.9146 2.9146 0 0 0 1.3612-3.0043"/>
+<path d="m37.908 98.145a6.7797 6.7797 0 0 0 0.05678-2.0627"/>
+<path d="m37.965 96.082a2.5901 2.5901 0 0 1 1.4252 2.7845"/>
+<path d="m39.39 98.867a0.88069 0.88069 0 0 0-1.482-0.7218"/>
+<path d="m95.046 72.007a0.10686 0.10686 0 0 0-0.08249 0.12202"/>
+<path d="m94.964 72.129a1.8445 1.8445 0 0 0-2.2866 0.69775"/>
+<path d="m92.677 72.826a1.8386 1.8386 0 0 1 2.3691-0.81977"/>
+<path d="m4.5382 70.487a0.097222 0.097222 0 0 0-0.035324-0.12906"/>
+<path d="m4.5029 70.358a2.3006 2.3006 0 0 0 1.2968-2.0939"/>
+<path d="m5.7997 68.265a2.2355 2.2355 0 0 1-1.2615 2.2229"/>
+<path d="m62.335 4.2176a6.7797 6.7797 0 0 1 0.05678-2.0627"/>
+<path d="m62.392 2.1548a0.53759 0.53759 0 0 0 0.87296-0.20609"/>
+<path d="m63.265 1.9488a10.346 10.346 0 0 1-0.92974 2.2688"/>
+<path d="m8.6381 22.398a0.11177 0.11177 0 0 0 0.10715-0.10904"/>
+<path d="m8.7453 22.289a15.933 15.933 0 0 1 2.618 2.234"/>
+<path d="m11.363 24.523a24.595 24.595 0 0 0-2.7251-2.125"/>
+<path d="m34.648 97.579a0.18332 0.18332 0 0 0-0.21135-0.12981"/>
+<path d="m34.437 97.449a2.5901 2.5901 0 0 1 3.5282-1.3663"/>
+<path d="m37.965 96.082a2.5584 2.5584 0 0 0-3.3168 1.4961"/>
+<path d="m6.1288 27.182a3.8709 3.8709 0 0 0 1.4941 0.29177"/>
+<path d="m7.6229 27.474a1.8445 1.8445 0 0 1-2.2866 0.69775"/>
+<path d="m5.3363 28.171a0.67441 0.67441 0 0 0 0.79248-0.98952"/>
+<path d="m96.005 31.201a10.916 10.916 0 0 0-1.5051 0.83413"/>
+<path d="m94.5 32.035a2.3006 2.3006 0 0 1 1.2968-2.0939"/>
+<path d="m95.797 29.942a0.68468 0.68468 0 0 0 0.20827 1.2598"/>
+<path d="m92.677 72.826a3.8709 3.8709 0 0 1 1.4941 0.29176"/>
+<path d="m94.171 73.118a0.39369 0.39369 0 0 0 0.0093 0.65369"/>
+<path d="m94.18 73.772a13.364 13.364 0 0 1-1.5034-0.94546"/>
+<path d="m5.7997 68.265a10.916 10.916 0 0 1-1.5051 0.83413"/>
+<path d="m4.2946 69.099a0.44901 0.44901 0 0 0-0.57179-0.49647"/>
+<path d="m3.7228 68.602a5.0668 5.0668 0 0 1 2.0769-0.33766"/>
+<path d="m6.9789 25.057a0.11733 0.11733 0 0 0 0.10906-0.11584"/>
+<path d="m7.0879 24.941a1.8445 1.8445 0 0 1 0.53496 2.5325"/>
+<path d="m7.6229 27.474a1.8386 1.8386 0 0 0-0.64401-2.4167"/>
+<path d="m97.348 33.977a0.19648 0.19648 0 0 0 0.02228 0.26414"/>
+<path d="m97.37 34.241a2.3006 2.3006 0 0 1-2.8696-2.2054"/>
+<path d="m94.5 32.035a2.2355 2.2355 0 0 0 2.8473 1.9413"/>
+<path d="m94.37 50.15a10.916 10.916 0 0 1-4.3886-11.83"/>
+<path d="m89.981 38.32a10.319 10.319 0 0 0 9.103 3.2959"/>
+<path d="m99.084 41.616a6.5282 6.5282 0 0 0-4.7145 8.5345"/>
+<path d="m80.634 88.589a1.8761 1.8761 0 0 1 1.2887-2.0486"/>
+<path d="m81.922 86.54a2.0664 2.0664 0 0 0 0.37632 1.8304"/>
+<path d="m82.299 88.371a1.0344 1.0344 0 0 0-1.6651 0.2182"/>
+<path d="m26.669 91.921a6.7797 6.7797 0 0 1 6.5808-1.4656"/>
+<path d="m33.25 90.455a14.646 14.646 0 0 0-3.8593 4.9824"/>
+<path d="m29.391 95.437a2.6113 2.6113 0 0 0-2.7215-3.5167"/>
+<path d="m10.319 61.98a10.916 10.916 0 0 0-4.3886-11.83"/>
+<path d="m5.93 50.15a15.933 15.933 0 0 0 5.4332-25.627"/>
+<path d="m11.363 24.523a24.595 24.595 0 0 1-1.0447 37.458"/>
+<path d="m43.805 3.31a3.9074 3.9074 0 0 1-5.0562 0.94142"/>
+<path d="m38.749 4.2514a2.8518 2.8518 0 0 0 1.5454-3.0016"/>
+<path d="m40.294 1.2498a2.8369 2.8369 0 0 0 3.5108 2.0602"/>
+<path d="m10.593 21.143a3.8709 3.8709 0 0 1 0.77075 3.3795"/>
+<path d="m11.363 24.523a15.933 15.933 0 0 0-2.618-2.234"/>
+<path d="m8.7453 22.289a1.2381 1.2381 0 0 0 1.8472-1.1455"/>
+<path d="m44.643 1.0428a3.9073 3.9073 0 0 1-0.83771 2.2672"/>
+<path d="m43.805 3.31a14.647 14.647 0 0 1-0.62601-2.5986"/>
+<path d="m43.179 0.71139a0.83325 0.83325 0 0 0 1.4637 0.33145"/>
+<path d="m61.551 96.049a3.9074 3.9074 0 0 0-5.0562 0.94142"/>
+<path d="m56.495 96.99a14.646 14.646 0 0 0-23.245-6.535"/>
+<path d="m33.25 90.455a17.462 17.462 0 0 1 28.301 5.5936"/>
+<path d="m18.378 13.76a1.8761 1.8761 0 0 0 1.2887-2.0486"/>
+<path d="m19.666 11.711a2.1175 2.1175 0 0 0 2.8614-2.6996"/>
+<path d="m22.528 9.0116a3.4141 3.4141 0 0 1-4.1501 4.7482"/>
+<path d="m67.05 9.845a6.7797 6.7797 0 0 0 6.5808-1.4656"/>
+<path d="m73.631 8.3794a3.3957 3.3957 0 0 0 5.7725 1.8217"/>
+<path d="m79.403 10.201a7.855 7.855 0 0 1-12.353-0.35607"/>
+<path d="m33.25 90.455a6.7797 6.7797 0 0 1 4.715 5.6274"/>
+<path d="m37.965 96.082a2.5901 2.5901 0 0 0-3.5282 1.3663"/>
+<path d="m34.437 97.449a7.855 7.855 0 0 0-1.1868-6.9938"/>
+<path d="m98.936 51.936a10.916 10.916 0 0 1-4.5657-1.7859"/>
+<path d="m94.37 50.15a15.933 15.933 0 0 1 5.6022-1.2283"/>
+<path d="m99.972 48.922a1.7683 1.7683 0 0 0-1.0365 3.0142"/>
+<path d="m62.335 4.2176a6.7797 6.7797 0 0 0 4.715 5.6274"/>
+<path d="m67.05 9.845a14.646 14.646 0 0 1-23.245-6.535"/>
+<path d="m43.805 3.31a10.346 10.346 0 0 0 18.53 0.90756"/>
+<path d="m90.683 21.996a1.0209 1.0209 0 0 0 0.64481 1.2354"/>
+<path d="m91.328 23.232a10.319 10.319 0 0 0-1.3467 15.088"/>
+<path d="m89.981 38.32a10.778 10.778 0 0 1 0.70186-16.323"/>
+<path d="m88.937 75.777a3.8709 3.8709 0 0 0 0.77074 3.3795"/>
+<path d="m89.707 79.157a1.4082 1.4082 0 0 0-0.86137 2.3685"/>
+<path d="m88.846 81.525a3.8021 3.8021 0 0 1 0.09062-5.748"/>
+<path d="m56.495 96.99a3.9073 3.9073 0 0 0-0.83771 2.2672"/>
+<path d="m55.657 99.257a0.78675 0.78675 0 0 0-1.2398 0.62108"/>
+<path d="m54.417 99.878a2.8369 2.8369 0 0 1 2.0775-2.8882"/>
+<path d="m11.363 24.523a3.8709 3.8709 0 0 1-3.7404 2.9508"/>
+<path d="m7.6229 27.474a1.8445 1.8445 0 0 0-0.53496-2.5325"/>
+<path d="m7.0879 24.941a3.8021 3.8021 0 0 0 4.2753-0.41821"/>
+<path d="m89.981 38.32a10.916 10.916 0 0 1 4.5188-6.2841"/>
+<path d="m94.5 32.035a2.3006 2.3006 0 0 0 2.8696 2.2054"/>
+<path d="m97.37 34.241a24.595 24.595 0 0 0-7.3884 4.0787"/>
+<path d="m25.553 93.236a6.7797 6.7797 0 0 1 1.1161-1.3151"/>
+<path d="m26.669 91.921a3.3957 3.3957 0 0 1-0.3364 2.123"/>
+<path d="m26.333 94.044a0.61103 0.61103 0 0 0-0.77969-0.80784"/>
+<path d="m5.7997 68.265a10.916 10.916 0 0 0 4.5188-6.2841"/>
+<path d="m10.319 61.98a10.319 10.319 0 0 1-1.3467 15.088"/>
+<path d="m8.9719 77.068a5.0668 5.0668 0 0 0-3.1722-8.8038"/>
+<path d="m92.677 72.826a3.8709 3.8709 0 0 0-3.7404 2.9508"/>
+<path d="m88.937 75.777a15.933 15.933 0 0 1 5.4332-25.627"/>
+<path d="m94.37 50.15a13.364 13.364 0 0 0-1.6929 22.676"/>
+<path d="m85.505 85.276a0.25016 0.25016 0 0 0-0.26714 0.21967"/>
+<path d="m85.238 85.496a2.0664 2.0664 0 0 0-3.3152 1.0443"/>
+<path d="m81.922 86.54a2.1932 2.1932 0 0 1 3.5823-1.264"/>
+<path d="m0.28919 51.643a0.19542 0.19542 0 0 0 0.038624-0.26484"/>
+<path d="m0.32781 51.378a15.933 15.933 0 0 0 5.6022-1.2283"/>
+<path d="m5.93 50.15a13.364 13.364 0 0 1-5.6408 1.4932"/>
+<path d="m34.521 2.8048a0.2253 0.2253 0 0 0 0.30499-0.058741"/>
+<path d="m34.825 2.7461a2.8518 2.8518 0 0 0 3.9233 1.5053"/>
+<path d="m38.749 4.2514a2.9146 2.9146 0 0 1-4.2283-1.4466"/>
+<path d="m5.93 50.15a10.916 10.916 0 0 0-4.5657-1.7859"/>
+<path d="m1.3643 48.364a1.5435 1.5435 0 0 0-0.86158-2.5335"/>
+<path d="m0.50271 45.831a6.5282 6.5282 0 0 1 5.4273 4.3194"/>
+<path d="m81.922 86.54a1.8761 1.8761 0 0 1 1.6259 0.23757"/>
+<path d="m83.548 86.778a0.45993 0.45993 0 0 0-0.18665 0.7041"/>
+<path d="m83.362 87.482a3.4141 3.4141 0 0 0-1.4393-0.94167"/>
+<path d="m38.749 4.2514a3.9074 3.9074 0 0 1-1.5861-1.7874"/>
+<path d="m37.163 2.464a0.63727 0.63727 0 0 0 0.72952-0.73621"/>
+<path d="m37.892 1.7278a17.462 17.462 0 0 0 0.85655 2.5237"/>
+<path d="m63.137 97.836a3.9074 3.9074 0 0 0-1.5861-1.7875"/>
+<path d="m61.551 96.049a2.8518 2.8518 0 0 1 3.9233 1.5053"/>
+<path d="m65.475 97.554a1.2477 1.2477 0 0 0-2.3372 0.28214"/>
+<path d="m16.752 13.522a1.8761 1.8761 0 0 0 1.6259 0.23757"/>
+<path d="m18.378 13.76a2.0664 2.0664 0 0 1-3.3152 1.0443"/>
+<path d="m15.062 14.804a1.1132 1.1132 0 0 0 1.6892-1.2819"/>
+<path d="m21.325 90.665a0.53698 0.53698 0 0 0-0.42792-0.56651"/>
+<path d="m20.897 90.099a3.3957 3.3957 0 0 1 5.7725 1.8217"/>
+<path d="m26.669 91.921a3.0909 3.0909 0 0 0-5.3446-1.2552"/>
+<path d="m1.2 59.204a0.38303 0.38303 0 0 0 0.015548-0.51939"/>
+<path d="m1.2155 58.684a10.319 10.319 0 0 1 9.103 3.2959"/>
+<path d="m10.319 61.98a10.778 10.778 0 0 0-9.1186-2.7765"/>
+<path d="m57.24 99.593a0.086522 0.086522 0 0 0-0.11852-0.0042"/>
+<path d="m57.121 99.589a14.647 14.647 0 0 0-0.62601-2.5986"/>
+<path d="m56.495 96.99a10.346 10.346 0 0 1 0.74453 2.6028"/>
+<path d="m73.887 6.1943a0.073551 0.073551 0 0 0 0.079712 0.06207"/>
+<path d="m73.967 6.2564a3.3957 3.3957 0 0 0-0.3364 2.123"/>
+<path d="m73.631 8.3794a3.0909 3.0909 0 0 1 0.25668-2.185"/>
+<path d="m39.563 98.932a0.13371 0.13371 0 0 0-0.17231-0.06485"/>
+<path d="m39.39 98.867a2.5901 2.5901 0 0 0-1.4252-2.7845"/>
+<path d="m37.965 96.082a2.5584 2.5584 0 0 1 1.5976 2.8494"/>
+<path d="m73.631 8.3794a6.7797 6.7797 0 0 0 1.1161-1.3151"/>
+<path d="m74.747 7.0642a0.4823 0.4823 0 0 0 0.82878 0.089285"/>
+<path d="m75.576 7.1535a2.6113 2.6113 0 0 1-1.9449 1.2258"/>
+<path d="m37.965 96.082a6.7797 6.7797 0 0 1-0.05678 2.0627"/>
+<path d="m37.908 98.145a0.53759 0.53759 0 0 0-0.87296 0.20608"/>
+<path d="m37.035 98.351a10.346 10.346 0 0 1 0.92974-2.2688"/>
+<path d="m62.392 2.1548a6.7797 6.7797 0 0 0-0.05678 2.0627"/>
+<path d="m62.335 4.2176a2.5901 2.5901 0 0 1-1.4252-2.7845"/>
+<path d="m60.91 1.433a0.88069 0.88069 0 0 0 1.482 0.72181"/>
+<path d="m60.19 99.053a0.1355 0.1355 0 0 0-0.18415-0.0027"/>
+<path d="m60.006 99.05a2.8518 2.8518 0 0 1 1.5454-3.0016"/>
+<path d="m61.551 96.049a2.9146 2.9146 0 0 0-1.3612 3.0043"/>
+<path d="m17.922 11.972a0.066205 0.066205 0 0 0 0.0794-0.04299"/>
+<path d="m18.001 11.929a2.0664 2.0664 0 0 1 0.37632 1.8304"/>
+<path d="m18.378 13.76a2.1932 2.1932 0 0 0-0.45572-1.7874"/>
+<path d="m70.671 4.6928a0.21476 0.21476 0 0 0 0.23876 0.16985"/>
+<path d="m70.909 4.8626a14.646 14.646 0 0 1-3.8593 4.9824"/>
+<path d="m67.05 9.845a17.462 17.462 0 0 0 3.6206-5.1522"/>
+<path d="m5.2538 28.293a0.10686 0.10686 0 0 0 0.082497-0.12201"/>
+<path d="m5.3363 28.171a1.8445 1.8445 0 0 0 2.2866-0.69775"/>
+<path d="m7.6229 27.474a1.8386 1.8386 0 0 1-2.3691 0.81977"/>
+<path d="m95.762 29.813a0.097222 0.097222 0 0 0 0.03532 0.12906"/>
+<path d="m95.797 29.942a2.3006 2.3006 0 0 0-1.2968 2.0939"/>
+<path d="m94.5 32.035a2.2355 2.2355 0 0 1 1.2615-2.2229"/>
+<path d="m7.6229 27.474a3.8709 3.8709 0 0 1-1.4941-0.29177"/>
+<path d="m6.1288 27.182a0.39369 0.39369 0 0 0-0.009293-0.65369"/>
+<path d="m6.1195 26.528a13.364 13.364 0 0 1 1.5034 0.94546"/>
+<path d="m94.5 32.035a10.916 10.916 0 0 1 1.5051-0.83413"/>
+<path d="m96.005 31.201a0.44901 0.44901 0 0 0 0.57179 0.49646"/>
+<path d="m96.577 31.698a5.0668 5.0668 0 0 1-2.0769 0.33767"/>
+<path d="m94.171 73.118a3.8709 3.8709 0 0 0-1.4941-0.29176"/>
+<path d="m92.677 72.826a1.8445 1.8445 0 0 1 2.2866-0.69775"/>
+<path d="m94.964 72.129a0.67441 0.67441 0 0 0-0.79249 0.98952"/>
+<path d="m4.2946 69.099a10.916 10.916 0 0 0 1.5051-0.83413"/>
+<path d="m5.7997 68.265a2.3006 2.3006 0 0 1-1.2968 2.0939"/>
+<path d="m4.5029 70.358a0.68468 0.68468 0 0 0-0.20827-1.2598"/>
+<path d="m65.652 2.7214a0.18332 0.18332 0 0 0 0.21136 0.12982"/>
+<path d="m65.863 2.8512a2.5901 2.5901 0 0 1-3.5282 1.3663"/>
+<path d="m62.335 4.2176a2.5584 2.5584 0 0 0 3.3168-1.4961"/>
+<path d="m91.662 77.902a0.11177 0.11177 0 0 0-0.10716 0.10904"/>
+<path d="m91.555 78.011a15.933 15.933 0 0 1-2.618-2.234"/>
+<path d="m88.937 75.777a24.595 24.595 0 0 0 2.7252 2.125"/>
+<path d="m93.321 75.243a0.11733 0.11733 0 0 0-0.10905 0.11584"/>
+<path d="m93.212 75.359a1.8445 1.8445 0 0 1-0.53496-2.5325"/>
+<path d="m92.677 72.826a1.8386 1.8386 0 0 0 0.64401 2.4167"/>
+<path d="m2.9524 66.323a0.19648 0.19648 0 0 0-0.022289-0.26414"/>
+<path d="m2.9302 66.059a2.3006 2.3006 0 0 1 2.8696 2.2054"/>
+<path d="m5.7997 68.265a2.2355 2.2355 0 0 0-2.8473-1.9413"/>
+<path d="m89.981 38.32a24.595 24.595 0 0 0-1.0447 37.458"/>
+<path d="m88.937 75.777a42.028 42.028 0 0 0-55.687 14.678"/>
+<path d="m33.25 90.455a107.21 107.21 0 0 1 56.731-52.135"/>
+<path d="m81.922 86.54a3.4141 3.4141 0 0 0-4.1501 4.7483"/>
+<path d="m77.772 91.288a4.3723 4.3723 0 0 0-7.6518 3.6314"/>
+<path d="m70.121 94.92a7.6432 7.6432 0 0 1 11.802-8.3797"/>
+<path d="m33.25 90.455a7.855 7.855 0 0 0-12.353-0.35607"/>
+<path d="m20.897 90.099a2.8288 2.8288 0 0 0-4.3386-3.433"/>
+<path d="m16.558 86.666a10.092 10.092 0 0 1 16.692 3.7891"/>
+<path d="m5.93 50.15a6.5282 6.5282 0 0 1-4.7145 8.5345"/>
+<path d="m1.2155 58.684a1.1633 1.1633 0 0 0-0.56657-2.2053"/>
+<path d="m0.64898 56.479a6.162 6.162 0 0 0 5.281-6.3292"/>
+<path d="m38.749 4.2514a17.462 17.462 0 0 0 28.301 5.5936"/>
+<path d="m67.05 9.845a42.028 42.028 0 0 1-55.687 14.678"/>
+<path d="m11.363 24.523a19.801 19.801 0 0 0 27.386-20.271"/>
+<path d="m52.316 0.43114a0.93542 0.93542 0 0 0 1.7903 0.13479"/>
+<path d="m54.106 0.56593a5.7511 5.7511 0 0 1-10.301 2.7441"/>
+<path d="m43.805 3.31a4.9142 4.9142 0 0 0 8.5106-2.8789"/>
+<path d="m85.394 15.454a1.6411 1.6411 0 0 0 2.2696 2.1555"/>
+<path d="m87.664 17.61a12.89 12.89 0 0 0 2.3176 20.71"/>
+<path d="m89.981 38.32a14.304 14.304 0 0 1-4.5872-22.865"/>
+<path d="m11.363 24.523a3.8021 3.8021 0 0 0 0.09062-5.748"/>
+<path d="m11.454 18.775a0.98038 0.98038 0 0 0 1.199-1.5129"/>
+<path d="m12.653 17.262a4.3865 4.3865 0 0 1-1.2896 7.2609"/>
+<path d="m43.805 3.31a2.8369 2.8369 0 0 0 2.0775-2.8882"/>
+<path d="m45.883 0.42176a0.43931 0.43931 0 0 0 0.8598-0.1045"/>
+<path d="m46.742 0.31726a2.8505 2.8505 0 0 1-2.9373 2.9927"/>
+<path d="m56.495 96.99a2.8369 2.8369 0 0 1 3.5108 2.0602"/>
+<path d="m60.006 99.05a0.42705 0.42705 0 0 0-0.80471 0.23673"/>
+<path d="m59.201 99.287a2.8505 2.8505 0 0 0-2.7061-2.2969"/>
+<path d="m73.631 8.3794a2.6113 2.6113 0 0 1-2.7215-3.5167"/>
+<path d="m70.909 4.8626a0.60473 0.60473 0 0 0 1.1216 0.3813"/>
+<path d="m72.031 5.2439a2.2391 2.2391 0 0 0 1.5999 3.1354"/>
+<path d="m37.965 96.082a10.346 10.346 0 0 1 18.53 0.90755"/>
+<path d="m56.495 96.99a5.7511 5.7511 0 0 0-10.301 2.7441"/>
+<path d="m46.194 99.734a4.8695 4.8695 0 0 0-8.2292-3.6516"/>
+<path d="m9.6167 78.304a10.778 10.778 0 0 0 0.70186-16.323"/>
+<path d="m10.319 61.98a12.89 12.89 0 0 1 2.3176 20.71"/>
+<path d="m12.636 82.69a2.7388 2.7388 0 0 0-3.0194-4.3865"/>
+<path d="m97.88 64.037a1.1046 1.1046 0 0 0-0.6346 2.0209"/>
+<path d="m97.246 66.058a9.3988 9.3988 0 0 1-2.8758-15.908"/>
+<path d="m94.37 50.15a8.4802 8.4802 0 0 0 3.5104 13.887"/>
+<path d="m87.104 83.586a0.47756 0.47756 0 0 0-0.56814 0.71886"/>
+<path d="m86.536 84.304a2.7832 2.7832 0 0 0-4.6137 2.2357"/>
+<path d="m81.922 86.54a3.1975 3.1975 0 0 1 5.1818-2.9546"/>
+<path d="m0.27451 52.785a0.18161 0.18161 0 0 0-0.030586-0.34843"/>
+<path d="m0.24393 52.436a9.3988 9.3988 0 0 0 5.6861-2.2863"/>
+<path d="m5.93 50.15a8.4802 8.4802 0 0 1-5.6555 2.6347"/>
+<path d="m32.884 3.3354a0.31708 0.31708 0 0 0 0.56024-0.24044"/>
+<path d="m33.444 3.095a3.2382 3.2382 0 0 0 5.3045 1.1564"/>
+<path d="m38.749 4.2514a3.4563 3.4563 0 0 1-5.8647-0.91599"/>
+<path d="m94.37 50.15a6.5282 6.5282 0 0 0 5.4273 4.3194"/>
+<path d="m99.797 54.469a0.79292 0.79292 0 0 0-0.08379 1.5588"/>
+<path d="m99.714 56.028a6.162 6.162 0 0 1-5.3435-5.8782"/>
+<path d="m67.05 9.845a7.855 7.855 0 0 1-1.1868-6.9938"/>
+<path d="m65.863 2.8512a0.63111 0.63111 0 0 0 1.2013 0.30859"/>
+<path d="m67.065 3.1598a10.092 10.092 0 0 0-0.014511 6.6852"/>
+<path d="m7.6229 27.474a13.364 13.364 0 0 1-1.6929 22.676"/>
+<path d="m5.93 50.15a9.3988 9.3988 0 0 0-2.8758-15.908"/>
+<path d="m3.0542 34.242a4.3239 4.3239 0 0 0 4.5687-6.7685"/>
+<path d="m94.5 32.035a5.0668 5.0668 0 0 1-3.1722-8.8038"/>
+<path d="m91.328 23.232a2.1005 2.1005 0 0 0 2.6319 3.0796"/>
+<path d="m93.96 26.311a3.1824 3.1824 0 0 0 0.54031 5.7242"/>
+<path d="m65.779 97.495a2.9146 2.9146 0 0 0-4.2283-1.4466"/>
+<path d="m61.551 96.049a3.2382 3.2382 0 0 1 5.3045 1.1564"/>
+<path d="m66.856 97.205a0.5683 0.5683 0 0 0-1.0762 0.29015"/>
+<path d="m14.795 15.024a2.1932 2.1932 0 0 0 3.5823-1.264"/>
+<path d="m18.378 13.76a2.7832 2.7832 0 0 1-4.6137 2.2357"/>
+<path d="m13.764 15.996a0.72207 0.72207 0 0 0 1.0314-0.97172"/>
+<path d="m100.01 48.657a13.364 13.364 0 0 0-5.6408 1.4932"/>
+<path d="m94.37 50.15a9.3988 9.3988 0 0 1 5.6861-2.2863"/>
+<path d="m100.06 47.864a0.40574 0.40574 0 0 0-0.0453 0.79311"/>
+<path d="m22.698 91.869a0.21818 0.21818 0 0 0-0.35241-0.22926"/>
+<path d="m22.346 91.64a2.5368 2.5368 0 0 1 4.3232 0.28104"/>
+<path d="m26.669 91.921a2.3957 2.3957 0 0 0-3.9708-0.05178"/>
+<path d="m1.4377 61.068a0.27226 0.27226 0 0 0-0.12604-0.50892"/>
+<path d="m1.3117 60.559a12.89 12.89 0 0 1 9.0069 1.4217"/>
+<path d="m10.319 61.98a14.304 14.304 0 0 0-8.8808-0.91281"/>
+<path d="m57.732 99.548a0.077565 0.077565 0 0 0-0.14686 0.02787"/>
+<path d="m57.585 99.576a5.7511 5.7511 0 0 0-1.09-2.5861"/>
+<path d="m56.495 96.99a4.9142 4.9142 0 0 1 1.2368 2.5582"/>
+<path d="m73.505 5.965a0.072179 0.072179 0 0 0 0.12542 0.06012"/>
+<path d="m73.631 6.0251a2.5368 2.5368 0 0 0-1.15e-4 2.3543"/>
+<path d="m73.631 8.3794a2.3957 2.3957 0 0 1-0.1253-2.4144"/>
+<path d="m40.447 99.149a0.15737 0.15737 0 0 0-0.29961-0.04511"/>
+<path d="m40.147 99.104a2.5643 2.5643 0 0 0-2.1821-3.0214"/>
+<path d="m37.965 96.082a2.6097 2.6097 0 0 1 2.4817 3.0665"/>
+<path d="m26.669 91.921a2.6113 2.6113 0 0 0-1.9449 1.2258"/>
+<path d="m24.724 93.146a0.22497 0.22497 0 0 0-0.39257-0.20667"/>
+<path d="m24.332 92.94a2.2392 2.2392 0 0 1 2.3374-1.0192"/>
+<path d="m10.319 61.98a24.595 24.595 0 0 1-7.3884 4.0787"/>
+<path d="m2.9302 66.059a0.71805 0.71805 0 0 0-0.52801-1.3093"/>
+<path d="m2.4021 64.75a107.21 107.21 0 0 0 7.9164-2.7693"/>
+<path d="m88.937 75.777a3.8021 3.8021 0 0 1 4.2753-0.41821"/>
+<path d="m93.212 75.359a0.39276 0.39276 0 0 0-0.33679 0.69496"/>
+<path d="m92.875 76.054a4.3865 4.3865 0 0 0-3.9385-0.27676"/>
+<path d="m78.975 9.6346a3.0909 3.0909 0 0 1-5.3446-1.2552"/>
+<path d="m73.631 8.3794a2.5368 2.5368 0 0 0 4.3232 0.28104"/>
+<path d="m77.954 8.6604a0.72794 0.72794 0 0 0 1.0214 0.97416"/>
+<path d="m99.1 41.096a10.778 10.778 0 0 1-9.1186-2.7765"/>
+<path d="m89.981 38.32a12.89 12.89 0 0 0 9.0069 1.4217"/>
+<path d="m98.988 39.741a0.69664 0.69664 0 0 0 0.11169 1.3548"/>
+<path d="m60.737 1.3682a2.5584 2.5584 0 0 0 1.5976 2.8494"/>
+<path d="m62.335 4.2176a2.5643 2.5643 0 0 1-2.1821-3.0214"/>
+<path d="m60.153 1.1962a0.31062 0.31062 0 0 0 0.58451 0.17201"/>
+<path d="m26.413 94.106a3.0909 3.0909 0 0 0 0.25668-2.185"/>
+<path d="m26.669 91.921a2.5368 2.5368 0 0 1-1.15e-4 2.3543"/>
+<path d="m26.669 94.275a0.15677 0.15677 0 0 0-0.25657-0.16925"/>
+<path d="m43.06 0.70719a10.346 10.346 0 0 0 0.74453 2.6028"/>
+<path d="m43.805 3.31a5.7511 5.7511 0 0 1-1.09-2.5861"/>
+<path d="m42.715 0.72395a0.17652 0.17652 0 0 0 0.34545-0.016752"/>
+<path d="m60.828 98.969a0.091382 0.091382 0 0 0-0.17114 0.04173"/>
+<path d="m60.657 99.011a3.2382 3.2382 0 0 1 0.89418-2.9626"/>
+<path d="m61.551 96.049a3.4563 3.4563 0 0 0-0.72304 2.9208"/>
+<path d="m17.654 12.168a0.048333 0.048333 0 0 0 0.06911-0.06251"/>
+<path d="m17.724 12.106a2.7832 2.7832 0 0 1 0.65395 1.6544"/>
+<path d="m18.378 13.76a3.1975 3.1975 0 0 0-0.72306-1.5919"/>
+<path d="m69.659 4.1685a0.17187 0.17187 0 0 0 0.3084 0.12049"/>
+<path d="m69.968 4.289a42.028 42.028 0 0 1-2.9178 5.556"/>
+<path d="m67.05 9.845a107.21 107.21 0 0 0 2.6094-5.6765"/>
+<path d="m4.9098 28.956a0.13092 0.13092 0 0 0 0.095739-0.23318"/>
+<path d="m5.0055 28.723a1.8919 1.8919 0 0 0 2.6174-1.2495"/>
+<path d="m7.6229 27.474a1.9476 1.9476 0 0 1-2.7131 1.4827"/>
+<path d="m95.522 29.222a0.10795 0.10795 0 0 0 0.09535 0.18477"/>
+<path d="m95.618 29.406a2.1425 2.1425 0 0 0-1.1173 2.6292"/>
+<path d="m94.5 32.035a2.1403 2.1403 0 0 1 1.0219-2.8139"/>
+<path d="m61.551 96.049a17.462 17.462 0 0 1 0.85655 2.5237"/>
+<path d="m62.408 98.572a0.21337 0.21337 0 0 0-0.39991 0.12955"/>
+<path d="m62.008 98.702a19.801 19.801 0 0 1-0.45664-2.6532"/>
+<path d="m18.378 13.76a3.4141 3.4141 0 0 1-1.4393-0.94167"/>
+<path d="m16.938 12.818a0.13685 0.13685 0 0 0 0.18806-0.19314"/>
+<path d="m17.126 12.625a7.6432 7.6432 0 0 0 1.2512 1.1348"/>
+<path d="m82.378 88.328a2.1932 2.1932 0 0 1-0.45572-1.7875"/>
+<path d="m81.922 86.54a2.7832 2.7832 0 0 0 0.65395 1.6544"/>
+<path d="m82.576 88.194a0.12203 0.12203 0 0 0-0.19823 0.13309"/>
+<path d="m29.629 95.607a17.462 17.462 0 0 1 3.6206-5.1522"/>
+<path d="m33.25 90.455a42.028 42.028 0 0 0-2.9178 5.556"/>
+<path d="m30.332 96.011a0.41441 0.41441 0 0 0-0.70273-0.40376"/>
+<path d="m40.11 1.2472a2.9146 2.9146 0 0 1-1.3612 3.0043"/>
+<path d="m38.749 4.2514a3.2382 3.2382 0 0 0 0.89418-2.9626"/>
+<path d="m39.643 1.2889a0.23994 0.23994 0 0 0 0.46705-0.041708"/>
+<path d="m95.046 72.007a1.8386 1.8386 0 0 0-2.3691 0.81977"/>
+<path d="m92.677 72.826a1.8919 1.8919 0 0 1 2.6174-1.2495"/>
+<path d="m95.295 71.577a0.25292 0.25292 0 0 0-0.24832 0.42975"/>
+<path d="m4.5382 70.487a2.2355 2.2355 0 0 0 1.2615-2.2229"/>
+<path d="m5.7997 68.265a2.1425 2.1425 0 0 1-1.1173 2.6292"/>
+<path d="m4.6824 70.894a0.21976 0.21976 0 0 0-0.14425-0.40623"/>
+<path d="m64.906 2.41a0.11023 0.11023 0 0 0 0.20419 0.058791"/>
+<path d="m65.111 2.4688a2.5643 2.5643 0 0 1-2.7755 1.7488"/>
+<path d="m62.335 4.2176a2.6097 2.6097 0 0 0 2.5713-1.8076"/>
+<path d="m92.029 77.415a0.09325 0.09325 0 0 0-0.09319 0.15366"/>
+<path d="m91.935 77.569a42.028 42.028 0 0 0-2.9987-1.7919"/>
+<path d="m88.937 75.777a19.801 19.801 0 0 1 3.0919 1.6382"/>
+<path d="m62.335 4.2176a10.346 10.346 0 0 0 0.92974-2.2688"/>
+<path d="m63.265 1.9488a0.20289 0.20289 0 0 0 0.39148 0.081557"/>
+<path d="m63.656 2.0303a4.8695 4.8695 0 0 1-1.3212 2.1872"/>
+<path d="m8.6381 22.398a24.595 24.595 0 0 1 2.7251 2.125"/>
+<path d="m11.363 24.523a42.028 42.028 0 0 1-2.9987-1.7919"/>
+<path d="m8.3646 22.731a0.22015 0.22015 0 0 0 0.27354-0.3331"/>
+<path d="m34.648 97.579a2.5584 2.5584 0 0 1 3.3168-1.4961"/>
+<path d="m37.965 96.082a2.5643 2.5643 0 0 0-2.7755 1.7488"/>
+<path d="m35.189 97.831a0.30609 0.30609 0 0 0-0.54132-0.25265"/>
+<path d="m93.623 74.808a0.073051 0.073051 0 0 0-0.06686 0.12397"/>
+<path d="m93.556 74.932a1.8919 1.8919 0 0 1-0.87876-2.1058"/>
+<path d="m92.677 72.826a1.9476 1.9476 0 0 0 0.94562 1.9818"/>
+<path d="m3.1532 67.126a0.11019 0.11019 0 0 0-0.075572-0.19852"/>
+<path d="m3.0776 66.927a2.1425 2.1425 0 0 1 2.7221 1.3371"/>
+<path d="m5.7997 68.265a2.1403 2.1403 0 0 0-2.6466-1.1386"/>
+<path d="m92.677 72.826a13.364 13.364 0 0 0 1.5034 0.94546"/>
+<path d="m94.18 73.772a0.14393 0.14393 0 0 0-0.11815 0.25792"/>
+<path d="m94.062 74.03a4.3239 4.3239 0 0 1-1.3852-1.2034"/>
+<path d="m5.7997 68.265a5.0668 5.0668 0 0 0-2.0769 0.33766"/>
+<path d="m3.7228 68.602a0.17889 0.17889 0 0 0-0.1491-0.3196"/>
+<path d="m3.5737 68.283a3.1824 3.1824 0 0 1 2.226-0.018067"/>
+<path d="m6.9789 25.057a1.8386 1.8386 0 0 1 0.64401 2.4167"/>
+<path d="m7.6229 27.474a1.8919 1.8919 0 0 0-0.87876-2.1058"/>
+<path d="m6.7441 25.368a0.19946 0.19946 0 0 0 0.23475-0.3109"/>
+<path d="m97.348 33.977a2.2355 2.2355 0 0 1-2.8473-1.9413"/>
+<path d="m94.5 32.035a2.1425 2.1425 0 0 0 2.7221 1.3371"/>
+<path d="m97.222 33.373a0.3164 0.3164 0 0 0 0.12514 0.6042"/>
+<path d="m89.981 38.32a107.21 107.21 0 0 0-56.731 52.135"/>
+<path d="m33.25 90.455a25.347 25.347 0 0 0-22.931-28.475"/>
+<path d="m10.319 61.98 79.663-23.661"/>
+<path d="m81.922 86.54a7.6432 7.6432 0 0 0-11.802 8.3797"/>
+<path d="m70.121 94.92a4.9019 4.9019 0 0 0-8.5693 1.1288"/>
+<path d="m61.551 96.049a12.317 12.317 0 0 1 20.371-9.5085"/>
+<path d="m33.25 90.455a10.092 10.092 0 0 0-16.692-3.7891"/>
+<path d="m16.558 86.666a1.3259 1.3259 0 0 0-1.6524-1.8201"/>
+<path d="m14.906 84.846a11.218 11.218 0 0 1 18.344 5.6092"/>
+<path d="m5.93 50.15a6.162 6.162 0 0 1-5.281 6.3292"/>
+<path d="m0.64898 56.479a0.28169 0.28169 0 0 0-0.061026-0.52385"/>
+<path d="m0.58795 55.955a6.1653 6.1653 0 0 0 5.342-5.8054"/>
+<path d="m38.749 4.2514a19.801 19.801 0 0 1-27.386 20.271"/>
+<path d="m11.363 24.523a7.3654 7.3654 0 0 0 7.0143-10.763"/>
+<path d="m18.378 13.76a12.317 12.317 0 0 0 20.371-9.5085"/>
+<path d="m52.316 0.43114a4.9142 4.9142 0 0 1-8.5106 2.8789"/>
+<path d="m43.805 3.31a3.4773 3.4773 0 0 0 5.1106-2.7127"/>
+<path d="m48.916 0.59726a1.7468 1.7468 0 0 0 3.4-0.16612"/>
+<path d="m85.394 15.454a14.304 14.304 0 0 0 4.5872 22.865"/>
+<path d="m89.981 38.32a25.347 25.347 0 0 1-22.931-28.475"/>
+<path d="m67.05 9.845a11.218 11.218 0 0 0 18.344 5.6092"/>
+<path d="m99.712 44.345a0.9647 0.9647 0 0 0 0.0067 1.8845"/>
+<path d="m99.719 46.229a6.761 6.761 0 0 0-5.3487 3.9208"/>
+<path d="m94.37 50.15a6.1653 6.1653 0 0 1 5.342-5.8054"/>
+<path d="m55.388 0.64553a1.5934 1.5934 0 0 0 3.069 0.54701"/>
+<path d="m58.457 1.1925a2.9988 2.9988 0 0 0 3.8778 3.025"/>
+<path d="m62.335 4.2176a4.2791 4.2791 0 0 1-6.9468-3.572"/>
+<path d="m11.363 24.523a4.3865 4.3865 0 0 0 1.2896-7.2609"/>
+<path d="m12.653 17.262a0.41275 0.41275 0 0 0 0.54288-0.54742"/>
+<path d="m13.196 16.714a4.6762 4.6762 0 0 1-1.8325 7.8083"/>
+<path d="m43.805 3.31a2.8505 2.8505 0 0 0 2.9373-2.9927"/>
+<path d="m46.742 0.31726a0.1645 0.1645 0 0 0 0.3079-0.007245"/>
+<path d="m47.05 0.31002a2.9038 2.9038 0 0 1-3.2452 3"/>
+<path d="m56.495 96.99a2.8505 2.8505 0 0 1 2.7061 2.2969"/>
+<path d="m59.201 99.287a0.10773 0.10773 0 0 0-0.19899 0.03444"/>
+<path d="m59.002 99.321a2.9038 2.9038 0 0 0-2.5071-2.3313"/>
+<path d="m73.631 8.3794a2.2391 2.2391 0 0 1-1.5999-3.1354"/>
+<path d="m72.031 5.2439a0.13511 0.13511 0 0 0 0.2273 0.11163"/>
+<path d="m72.258 5.3556a2.1851 2.1851 0 0 0 1.3726 3.0238"/>
+<path d="m37.965 96.082a4.8695 4.8695 0 0 1 8.2292 3.6516"/>
+<path d="m46.194 99.734a0.68856 0.68856 0 0 0-1.2824-0.0796"/>
+<path d="m44.912 99.654a4.2791 4.2791 0 0 0-6.9468-3.572"/>
+<path d="m97.88 64.037a8.4802 8.4802 0 0 1-3.5104-13.887"/>
+<path d="m94.37 50.15a6.761 6.761 0 0 0 4.2437 9.2759"/>
+<path d="m98.614 59.426a2.4074 2.4074 0 0 0-0.73331 4.6111"/>
+<path d="m87.104 83.586a3.1975 3.1975 0 0 0-5.1818 2.9546"/>
+<path d="m81.922 86.54a7.3654 7.3654 0 0 1 7.0143-10.763"/>
+<path d="m88.937 75.777a4.6762 4.6762 0 0 0-1.8325 7.8083"/>
+<path d="m53.25 99.99a0.9819 0.9819 0 0 0-1.8654-0.28725"/>
+<path d="m51.384 99.703a3.4773 3.4773 0 0 1 5.1106-2.7127"/>
+<path d="m56.495 96.99a2.9038 2.9038 0 0 0-3.2452 3"/>
+<path d="m0.27451 52.785a8.4802 8.4802 0 0 0 5.6555-2.6347"/>
+<path d="m5.93 50.15a6.761 6.761 0 0 1-5.3487 3.9208"/>
+<path d="m0.58128 54.071a0.68443 0.68443 0 0 0-0.30677-1.2861"/>
+<path d="m32.884 3.3354a3.4563 3.4563 0 0 0 5.8647 0.91599"/>
+<path d="m38.749 4.2514a4.9019 4.9019 0 0 1-8.5693 1.1288"/>
+<path d="m30.179 5.3802a1.8054 1.8054 0 0 0 2.7046-2.0448"/>
+<path d="m28.042 94.944a0.43357 0.43357 0 0 0-0.72372-0.44509"/>
+<path d="m27.318 94.499a2.1499 2.1499 0 0 0-0.64891-2.5787"/>
+<path d="m26.669 91.921a2.1851 2.1851 0 0 1 1.3726 3.0238"/>
+<path d="m41.298 0.97868a0.38265 0.38265 0 0 0 0.747-0.052917"/>
+<path d="m42.045 0.92576a3.4773 3.4773 0 0 0 1.7601 2.3842"/>
+<path d="m43.805 3.31a2.9038 2.9038 0 0 1-2.5071-2.3313"/>
+<path d="m96.839 67.39a1.5419 1.5419 0 0 0-1.2022 2.7692"/>
+<path d="m95.637 70.16a2.3432 2.3432 0 0 0-2.9596 2.6668"/>
+<path d="m92.677 72.826a3.6612 3.6612 0 0 1 4.1618-5.436"/>
+<path d="m6.0277 73.429a0.90268 0.90268 0 0 0-0.70701-1.6219"/>
+<path d="m5.3207 71.807a2.2947 2.2947 0 0 0 0.47897-3.5429"/>
+<path d="m5.7997 68.265a2.9146 2.9146 0 0 1 0.22804 5.1648"/>
+<path d="m94.37 50.15a6.162 6.162 0 0 0 5.3435 5.8782"/>
+<path d="m99.714 56.028a0.28535 0.28535 0 0 0-0.08572 0.52694"/>
+<path d="m99.628 56.555a6.1653 6.1653 0 0 1-5.2578-6.4051"/>
+<path d="m67.05 9.845a10.092 10.092 0 0 1 0.01451-6.6852"/>
+<path d="m67.065 3.1598a0.17568 0.17568 0 0 0 0.30746 0.11744"/>
+<path d="m67.372 3.2773a11.218 11.218 0 0 0-0.32197 6.5677"/>
+<path d="m7.6229 27.474a4.3239 4.3239 0 0 1-4.5687 6.7685"/>
+<path d="m3.0542 34.242a0.74733 0.74733 0 0 0 0.40691-1.3325"/>
+<path d="m3.4611 32.91a3.6612 3.6612 0 0 0 4.1618-5.436"/>
+<path d="m94.5 32.035a3.1824 3.1824 0 0 1-0.54031-5.7242"/>
+<path d="m93.96 26.311a0.34237 0.34237 0 0 0 0.31227 0.55941"/>
+<path d="m94.272 26.871a2.9146 2.9146 0 0 0 0.22804 5.1648"/>
+<path d="m22.698 91.869a2.3957 2.3957 0 0 1 3.9708 0.05178"/>
+<path d="m26.669 91.921a2.1499 2.1499 0 0 0-3.0447 0.42618"/>
+<path d="m23.624 92.347a0.53364 0.53364 0 0 0-0.92612-0.47796"/>
+<path d="m1.4377 61.068a14.304 14.304 0 0 1 8.8808 0.91281"/>
+<path d="m10.319 61.98a25.347 25.347 0 0 0-8.2737 0.63951"/>
+<path d="m2.0448 62.62a0.85901 0.85901 0 0 0-0.60708-1.5523"/>
+<path d="m0.67222 43.745a1.584 1.584 0 0 0 1.014-2.8708"/>
+<path d="m1.6863 40.874a6.761 6.761 0 0 1 4.2437 9.2759"/>
+<path d="m5.93 50.15a6.1653 6.1653 0 0 0-5.2578-6.4051"/>
+<path d="m57.732 99.548a4.9142 4.9142 0 0 0-1.2368-2.5582"/>
+<path d="m56.495 96.99a3.4773 3.4773 0 0 1 1.7601 2.3842"/>
+<path d="m58.255 99.374a0.28462 0.28462 0 0 0-0.52328 0.17394"/>
+<path d="m73.505 5.965a2.3957 2.3957 0 0 0 0.1253 2.4144"/>
+<path d="m73.631 8.3794a2.1499 2.1499 0 0 1-0.6489-2.5787"/>
+<path d="m72.982 5.8007a0.28392 0.28392 0 0 0 0.5236 0.16432"/>
+<path d="m40.447 99.149a2.6097 2.6097 0 0 0-2.4817-3.0665"/>
+<path d="m37.965 96.082a2.9988 2.9988 0 0 1 3.8778 3.025"/>
+<path d="m41.843 99.107a0.72948 0.72948 0 0 0-1.3961 0.04149"/>
+<path d="m32.928 97.023a0.68764 0.68764 0 0 0-1.1894-0.62087"/>
+<path d="m31.739 96.402a25.347 25.347 0 0 0 1.5113-5.9469"/>
+<path d="m33.25 90.455a11.218 11.218 0 0 1-0.32197 6.5677"/>
+<path d="m26.669 91.921a2.2391 2.2391 0 0 0-2.3374 1.0192"/>
+<path d="m24.332 92.94a0.07761 0.07761 0 0 0-0.12178-0.0795"/>
+<path d="m24.21 92.86a2.1851 2.1851 0 0 1 2.4592-0.93967"/>
+<path d="m10.319 61.98a107.21 107.21 0 0 1-7.9164 2.7693"/>
+<path d="m2.4021 64.75a0.21403 0.21403 0 0 0-0.10741-0.38618"/>
+<path d="m2.2947 64.364 8.0238-2.3832"/>
+<path d="m88.937 75.777a4.3865 4.3865 0 0 1 3.9385 0.27676"/>
+<path d="m92.875 76.054a0.10594 0.10594 0 0 0-0.1056 0.16818"/>
+<path d="m92.77 76.222a4.6762 4.6762 0 0 0-3.8329-0.44493"/>
+<path d="m60.828 98.969a3.4563 3.4563 0 0 1 0.72304-2.9208"/>
+<path d="m61.551 96.049a4.902 4.902 0 0 0-0.21126 2.7331"/>
+<path d="m61.34 98.782a0.27997 0.27997 0 0 0-0.51178 0.18769"/>
+<path d="m17.654 12.168a3.1975 3.1975 0 0 1 0.72306 1.5919"/>
+<path d="m18.378 13.76a7.3653 7.3653 0 0 0-0.92223-1.3655"/>
+<path d="m17.455 12.394a0.15494 0.15494 0 0 0 0.19917-0.22638"/>
+<path d="m69.659 4.1685a107.21 107.21 0 0 1-2.6094 5.6765"/>
+<path d="m67.05 9.845a25.347 25.347 0 0 1 1.5113-5.9469"/>
+<path d="m68.561 3.8981a0.58318 0.58318 0 0 0 1.0981 0.27039"/>
+<path d="m76.09 7.4397a0.40163 0.40163 0 0 0 0.58549 0.51349"/>
+<path d="m76.676 7.9532a2.1499 2.1499 0 0 1-3.0447 0.42617"/>
+<path d="m73.631 8.3794a2.1851 2.1851 0 0 0 2.4592-0.93967"/>
+<path d="m98.005 35.936a0.90526 0.90526 0 0 0 0.24992 1.7437"/>
+<path d="m98.255 37.68a25.347 25.347 0 0 1-8.2737 0.63951"/>
+<path d="m89.981 38.32 8.0238-2.3832"/>
+<path d="m4.9098 28.956a1.9476 1.9476 0 0 0 2.7131-1.4827"/>
+<path d="m7.6229 27.474a2.3432 2.3432 0 0 1-2.9596 2.6668"/>
+<path d="m4.6632 30.14a0.63274 0.63274 0 0 0 0.24651-1.1841"/>
+<path d="m95.522 29.222a2.1403 2.1403 0 0 0-1.0219 2.8139"/>
+<path d="m94.5 32.035a2.2947 2.2947 0 0 1 0.47897-3.5429"/>
+<path d="m94.979 28.493a0.47279 0.47279 0 0 0 0.54295 0.72898"/>
+<path d="m7.5303 24.078a0.40132 0.40132 0 0 0 0.48534-0.61631"/>
+<path d="m8.0157 23.462a7.3653 7.3653 0 0 0 3.3476 1.0612"/>
+<path d="m11.363 24.523a4.6762 4.6762 0 0 1-3.8329-0.44494"/>
+<path d="m61.551 96.049a19.801 19.801 0 0 0 0.45664 2.6532"/>
+<path d="m62.008 98.702a0.065045 0.065045 0 0 0-0.11912 0.02602"/>
+<path d="m61.889 98.728a12.317 12.317 0 0 1-0.33752-2.6792"/>
+<path d="m18.378 13.76a7.6432 7.6432 0 0 1-1.2512-1.1348"/>
+<path d="m17.126 12.625a0.040218 0.040218 0 0 0 0.057649-0.04862"/>
+<path d="m17.184 12.576a12.317 12.317 0 0 0 1.1935 1.1834"/>
+<path d="m64.906 2.41a2.6097 2.6097 0 0 1-2.5713 1.8076"/>
+<path d="m62.335 4.2176a2.9988 2.9988 0 0 0 1.9605-1.9142"/>
+<path d="m64.296 2.3034a0.31808 0.31808 0 0 0 0.61076 0.10662"/>
+<path d="m92.029 77.415a19.801 19.801 0 0 0-3.0919-1.6382"/>
+<path d="m88.937 75.777a7.3653 7.3653 0 0 1 3.3476 1.0612"/>
+<path d="m92.284 76.838a0.32531 0.32531 0 0 0-0.25571 0.57699"/>
+<path d="m83.116 87.724a0.1673 0.1673 0 0 0-0.27132 0.18204"/>
+<path d="m82.845 87.906a7.3653 7.3653 0 0 1-0.92223-1.3655"/>
+<path d="m81.922 86.54a12.317 12.317 0 0 1 1.1936 1.1834"/>
+<path d="m38.411 1.5722a0.28279 0.28279 0 0 0 0.54878-0.05391"/>
+<path d="m38.96 1.5183a4.9019 4.9019 0 0 1-0.21126 2.7331"/>
+<path d="m38.749 4.2514a12.317 12.317 0 0 0-0.33752-2.6792"/>
+<path d="m62.335 4.2176a4.8695 4.8695 0 0 0 1.3212-2.1872"/>
+<path d="m63.656 2.0303a0.064429 0.064429 0 0 0 0.11533 0.035867"/>
+<path d="m63.772 2.0662a4.2791 4.2791 0 0 1-1.4365 2.1514"/>
+<path d="m93.623 74.808a1.9476 1.9476 0 0 1-0.94562-1.9818"/>
+<path d="m92.677 72.826a2.3432 2.3432 0 0 0 1.1039 1.5947"/>
+<path d="m93.781 74.421a0.21454 0.21454 0 0 0-0.15827 0.3871"/>
+<path d="m3.1532 67.126a2.1403 2.1403 0 0 1 2.6466 1.1386"/>
+<path d="m5.7997 68.265a2.2947 2.2947 0 0 0-2.376-0.60325"/>
+<path d="m3.4237 67.661a0.3075 0.3075 0 0 0-0.27056-0.5353"/>
+<path d="m36.528 98.234a0.29539 0.29539 0 0 0-0.52399-0.23719"/>
+<path d="m36.004 97.997a2.9988 2.9988 0 0 1 1.9605-1.9142"/>
+<path d="m37.965 96.082a4.2791 4.2791 0 0 0-1.4365 2.1514"/>
+<path d="m92.677 72.826a4.3239 4.3239 0 0 0 1.3852 1.2034"/>
+<path d="m94.062 74.03a0.045193 0.045193 0 0 0-0.04244 0.07333"/>
+<path d="m94.02 74.103a3.6611 3.6611 0 0 1-1.3428-1.2767"/>
+<path d="m5.7997 68.265a3.1824 3.1824 0 0 0-2.226 0.01807"/>
+<path d="m3.5737 68.283a0.057947 0.057947 0 0 0-0.036407-0.10234"/>
+<path d="m3.5373 68.18a2.9146 2.9146 0 0 1 2.2624 0.08427"/>
+<path d="m6.2801 26.197a0.20411 0.20411 0 0 0 0.2389-0.31802"/>
+<path d="m6.519 25.879a2.3432 2.3432 0 0 1 1.1039 1.5947"/>
+<path d="m7.6229 27.474a3.6611 3.6611 0 0 0-1.3428-1.2767"/>
+<path d="m96.763 32.12a0.27302 0.27302 0 0 0 0.11359 0.51898"/>
+<path d="m96.876 32.639a2.2947 2.2947 0 0 1-2.376-0.60325"/>
+<path d="m94.5 32.035a2.9146 2.9146 0 0 0 2.2624 0.08427"/>
+<path d="m89.981 38.32-79.663 23.661"/>
+<path d="m10.319 61.98a107.21 107.21 0 0 0 56.731-52.135"/>
+<path d="m67.05 9.845a25.347 25.347 0 0 0 22.931 28.475"/>
+<path d="m81.922 86.54a12.317 12.317 0 0 0-20.371 9.5085"/>
+<path d="m61.551 96.049a19.801 19.801 0 0 1 27.386-20.271"/>
+<path d="m88.937 75.777a7.3654 7.3654 0 0 0-7.0143 10.763"/>
+<path d="m51.384 99.703a1.7468 1.7468 0 0 0-3.4 0.16612"/>
+<path d="m47.984 99.869a4.9142 4.9142 0 0 1 8.5106-2.8789"/>
+<path d="m56.495 96.99a3.4773 3.4773 0 0 0-5.1106 2.7127"/>
+<path d="m33.25 90.455a11.218 11.218 0 0 0-18.344-5.6092"/>
+<path d="m14.906 84.846a14.304 14.304 0 0 0-4.5872-22.865"/>
+<path d="m10.319 61.98a25.347 25.347 0 0 1 22.931 28.475"/>
+<path d="m5.93 50.15a6.1653 6.1653 0 0 1-5.342 5.8054"/>
+<path d="m0.58795 55.955a0.9647 0.9647 0 0 0-0.006673-1.8845"/>
+<path d="m0.58128 54.071a6.761 6.761 0 0 0 5.3487-3.9208"/>
+<path d="m38.749 4.2514a12.317 12.317 0 0 1-20.371 9.5085"/>
+<path d="m18.378 13.76a7.6432 7.6432 0 0 0 11.802-8.3797"/>
+<path d="m30.179 5.3802a4.9019 4.9019 0 0 0 8.5693-1.1288"/>
+<path d="m85.394 15.454a11.218 11.218 0 0 1-18.344-5.6092"/>
+<path d="m67.05 9.845a10.092 10.092 0 0 0 16.692 3.7891"/>
+<path d="m83.742 13.634a1.3259 1.3259 0 0 0 1.6524 1.8201"/>
+<path d="m99.712 44.345a6.1653 6.1653 0 0 0-5.342 5.8054"/>
+<path d="m94.37 50.15a6.162 6.162 0 0 1 5.281-6.3292"/>
+<path d="m99.651 43.821a0.28169 0.28169 0 0 0 0.06103 0.52385"/>
+<path d="m55.388 0.64553a4.2791 4.2791 0 0 0 6.9468 3.572"/>
+<path d="m62.335 4.2176a4.8695 4.8695 0 0 1-8.2292-3.6516"/>
+<path d="m54.106 0.56593a0.68856 0.68856 0 0 0 1.2824 0.079596"/>
+<path d="m1.6863 40.874a2.4074 2.4074 0 0 0 0.73332-4.6111"/>
+<path d="m2.4196 36.263a8.4802 8.4802 0 0 1 3.5104 13.887"/>
+<path d="m5.93 50.15a6.761 6.761 0 0 0-4.2437-9.2759"/>
+<path d="m70.121 94.92a1.8054 1.8054 0 0 0-2.7046 2.0448"/>
+<path d="m67.416 96.965a3.4563 3.4563 0 0 0-5.8647-0.91599"/>
+<path d="m61.551 96.049a4.9019 4.9019 0 0 1 8.5693-1.1288"/>
+<path d="m11.363 24.523a4.6762 4.6762 0 0 0 1.8325-7.8083"/>
+<path d="m13.196 16.714a3.1975 3.1975 0 0 0 5.1818-2.9546"/>
+<path d="m18.378 13.76a7.3654 7.3654 0 0 1-7.0143 10.763"/>
+<path d="m43.805 3.31a2.9038 2.9038 0 0 0 3.2452-3"/>
+<path d="m47.05 0.31002a0.9819 0.9819 0 0 0 1.8654 0.28724"/>
+<path d="m48.916 0.59726a3.4773 3.4773 0 0 1-5.1106 2.7127"/>
+<path d="m99.719 46.229a0.68443 0.68443 0 0 0 0.30677 1.2861"/>
+<path d="m100.03 47.515a8.4802 8.4802 0 0 0-5.6555 2.6347"/>
+<path d="m94.37 50.15a6.761 6.761 0 0 1 5.3487-3.9208"/>
+<path d="m56.495 96.99a2.9038 2.9038 0 0 1 2.5071 2.3313"/>
+<path d="m59.002 99.321a0.38265 0.38265 0 0 0-0.747 0.05292"/>
+<path d="m58.255 99.374a3.4773 3.4773 0 0 0-1.7601-2.3842"/>
+<path d="m73.631 8.3794a2.1851 2.1851 0 0 1-1.3726-3.0238"/>
+<path d="m72.258 5.3556a0.43357 0.43357 0 0 0 0.72372 0.44509"/>
+<path d="m72.982 5.8007a2.1499 2.1499 0 0 0 0.6489 2.5787"/>
+<path d="m37.965 96.082a4.2791 4.2791 0 0 1 6.9468 3.572"/>
+<path d="m44.912 99.654a1.5934 1.5934 0 0 0-3.069-0.54701"/>
+<path d="m41.843 99.107a2.9988 2.9988 0 0 0-3.8778-3.025"/>
+<path d="m87.104 83.586a4.6762 4.6762 0 0 1 1.8325-7.8083"/>
+<path d="m88.937 75.777a4.3865 4.3865 0 0 0-1.2896 7.2609"/>
+<path d="m87.647 83.038a0.41275 0.41275 0 0 0-0.54288 0.54742"/>
+<path d="m53.25 99.99a2.9038 2.9038 0 0 1 3.2452-3"/>
+<path d="m56.495 96.99a2.8505 2.8505 0 0 0-2.9373 2.9927"/>
+<path d="m53.558 99.983a0.1645 0.1645 0 0 0-0.3079 0.0072"/>
+<path d="m28.042 94.944a2.1851 2.1851 0 0 0-1.3726-3.0238"/>
+<path d="m26.669 91.921a2.2391 2.2391 0 0 1 1.5999 3.1354"/>
+<path d="m28.269 95.056a0.13511 0.13511 0 0 0-0.22731-0.11163"/>
+<path d="m41.298 0.97868a2.9038 2.9038 0 0 0 2.5071 2.3313"/>
+<path d="m43.805 3.31a2.8505 2.8505 0 0 1-2.7061-2.2969"/>
+<path d="m41.099 1.0131a0.10773 0.10773 0 0 0 0.19899-0.034437"/>
+<path d="m96.839 67.39a3.6612 3.6612 0 0 0-4.1618 5.436"/>
+<path d="m92.677 72.826a4.3239 4.3239 0 0 1 4.5687-6.7685"/>
+<path d="m97.246 66.058a0.74733 0.74733 0 0 0-0.40691 1.3325"/>
+<path d="m6.0277 73.429a2.9146 2.9146 0 0 0-0.22804-5.1648"/>
+<path d="m5.7997 68.265a3.1824 3.1824 0 0 1 0.5403 5.7242"/>
+<path d="m6.34 73.989a0.34237 0.34237 0 0 0-0.31227-0.55941"/>
+<path d="m76.676 7.9532a0.53364 0.53364 0 0 0 0.92612 0.47796"/>
+<path d="m77.602 8.4311a2.3957 2.3957 0 0 1-3.9708-0.051784"/>
+<path d="m73.631 8.3794a2.1499 2.1499 0 0 0 3.0447-0.42617"/>
+<path d="m98.255 37.68a0.85901 0.85901 0 0 0 0.60709 1.5523"/>
+<path d="m98.862 39.232a14.304 14.304 0 0 1-8.8808-0.91281"/>
+<path d="m89.981 38.32a25.347 25.347 0 0 0 8.2737-0.63951"/>
+<path d="m58.457 1.1925a0.72948 0.72948 0 0 0 1.3961-0.041485"/>
+<path d="m59.853 1.1511a2.6097 2.6097 0 0 0 2.4817 3.0665"/>
+<path d="m62.335 4.2176a2.9988 2.9988 0 0 1-3.8778-3.025"/>
+<path d="m94.37 50.15a6.1653 6.1653 0 0 0 5.2578 6.4051"/>
+<path d="m99.628 56.555a1.584 1.584 0 0 0-1.014 2.8708"/>
+<path d="m98.614 59.426a6.761 6.761 0 0 1-4.2437-9.2759"/>
+<path d="m27.318 94.499a0.28392 0.28392 0 0 0-0.5236-0.16432"/>
+<path d="m26.795 94.335a2.3957 2.3957 0 0 0-0.12531-2.4144"/>
+<path d="m26.669 91.921a2.1499 2.1499 0 0 1 0.64891 2.5787"/>
+<path d="m42.045 0.92576a0.28462 0.28462 0 0 0 0.52328-0.17394"/>
+<path d="m42.568 0.75182a4.9142 4.9142 0 0 0 1.2368 2.5582"/>
+<path d="m43.805 3.31a3.4773 3.4773 0 0 1-1.7601-2.3842"/>
+<path d="m67.05 9.845a11.218 11.218 0 0 1 0.32197-6.5677"/>
+<path d="m67.372 3.2773a0.68764 0.68764 0 0 0 1.1894 0.62087"/>
+<path d="m68.561 3.8981a25.347 25.347 0 0 0-1.5113 5.9469"/>
+<path d="m7.6229 27.474a3.6612 3.6612 0 0 1-4.1618 5.436"/>
+<path d="m3.4611 32.91a1.5419 1.5419 0 0 0 1.2022-2.7692"/>
+<path d="m4.6632 30.14a2.3432 2.3432 0 0 0 2.9596-2.6668"/>
+<path d="m94.5 32.035a2.9146 2.9146 0 0 1-0.22804-5.1648"/>
+<path d="m94.272 26.871a0.90268 0.90268 0 0 0 0.70701 1.6219"/>
+<path d="m94.979 28.493a2.2947 2.2947 0 0 0-0.47897 3.5429"/>
+<path d="m0.67222 43.745a6.1653 6.1653 0 0 1 5.2578 6.4051"/>
+<path d="m5.93 50.15a6.162 6.162 0 0 0-5.3435-5.8782"/>
+<path d="m0.58649 44.272a0.28535 0.28535 0 0 0 0.085726-0.52694"/>
+<path d="m32.928 97.023a11.218 11.218 0 0 0 0.32197-6.5677"/>
+<path d="m33.25 90.455a10.092 10.092 0 0 1-0.01451 6.6852"/>
+<path d="m33.235 97.14a0.17568 0.17568 0 0 0-0.30746-0.11743"/>
+<path d="m82.845 87.906a0.15494 0.15494 0 0 0-0.19916 0.22638"/>
+<path d="m82.646 88.132a3.1975 3.1975 0 0 1-0.72306-1.5919"/>
+<path d="m81.922 86.54a7.3653 7.3653 0 0 0 0.92223 1.3655"/>
+<path d="m31.739 96.402a0.58318 0.58318 0 0 0-1.0981-0.27039"/>
+<path d="m30.641 96.131a107.21 107.21 0 0 1 2.6094-5.6765"/>
+<path d="m33.25 90.455a25.347 25.347 0 0 1-1.5113 5.9469"/>
+<path d="m38.96 1.5183a0.27997 0.27997 0 0 0 0.51178-0.18769"/>
+<path d="m39.472 1.3306a3.4563 3.4563 0 0 1-0.72304 2.9208"/>
+<path d="m38.749 4.2514a4.902 4.902 0 0 0 0.21126-2.7331"/>
+<path d="m95.637 70.16a0.63274 0.63274 0 0 0-0.24651 1.1841"/>
+<path d="m95.39 71.344a1.9476 1.9476 0 0 0-2.7131 1.4827"/>
+<path d="m92.677 72.826a2.3432 2.3432 0 0 1 2.9596-2.6668"/>
+<path d="m5.3207 71.807a0.47279 0.47279 0 0 0-0.54296-0.72899"/>
+<path d="m4.7778 71.078a2.1403 2.1403 0 0 0 1.0219-2.8139"/>
+<path d="m5.7997 68.265a2.2947 2.2947 0 0 1-0.47897 3.5429"/>
+<path d="m26.669 91.921a2.1851 2.1851 0 0 0-2.4592 0.93967"/>
+<path d="m24.21 92.86a0.40163 0.40163 0 0 0-0.58549-0.51349"/>
+<path d="m23.624 92.347a2.1499 2.1499 0 0 1 3.0447-0.42618"/>
+<path d="m10.319 61.98-8.0238 2.3832"/>
+<path d="m2.2947 64.364a0.90526 0.90526 0 0 0-0.24992-1.7437"/>
+<path d="m2.0448 62.62a25.347 25.347 0 0 1 8.2737-0.63951"/>
+<path d="m88.937 75.777a4.6762 4.6762 0 0 1 3.8329 0.44493"/>
+<path d="m92.77 76.222a0.40132 0.40132 0 0 0-0.48534 0.61632"/>
+<path d="m92.284 76.838a7.3653 7.3653 0 0 0-3.3476-1.0612"/>
+<path d="m76.09 7.4397a2.1851 2.1851 0 0 1-2.4592 0.93967"/>
+<path d="m73.631 8.3794a2.2391 2.2391 0 0 0 2.3374-1.0192"/>
+<path d="m75.968 7.3602a0.07761 0.07761 0 0 0 0.12179 0.079498"/>
+<path d="m98.005 35.936-8.0238 2.3832"/>
+<path d="m89.981 38.32a107.21 107.21 0 0 1 7.9164-2.7693"/>
+<path d="m97.898 35.55a0.21403 0.21403 0 0 0 0.10741 0.38617"/>
+<path d="m7.5303 24.078a4.6762 4.6762 0 0 0 3.8329 0.44494"/>
+<path d="m11.363 24.523a4.3865 4.3865 0 0 1-3.9385-0.27676"/>
+<path d="m7.4247 24.246a0.10594 0.10594 0 0 0 0.1056-0.16818"/>
+<path d="m8.0157 23.462a0.32531 0.32531 0 0 0 0.25571-0.57698"/>
+<path d="m8.2714 22.885a19.801 19.801 0 0 0 3.0919 1.6382"/>
+<path d="m11.363 24.523a7.3653 7.3653 0 0 1-3.3476-1.0612"/>
+<path d="m36.004 97.997a0.31808 0.31808 0 0 0-0.61076-0.10661"/>
+<path d="m35.394 97.89a2.6097 2.6097 0 0 1 2.5713-1.8076"/>
+<path d="m37.965 96.082a2.9988 2.9988 0 0 0-1.9605 1.9142"/>
+<path d="m61.551 96.049a12.317 12.317 0 0 0 0.33752 2.6792"/>
+<path d="m61.889 98.728a0.28279 0.28279 0 0 0-0.54878 0.05391"/>
+<path d="m61.34 98.782a4.9019 4.9019 0 0 1 0.21126-2.7331"/>
+<path d="m18.378 13.76a12.317 12.317 0 0 1-1.1935-1.1834"/>
+<path d="m17.184 12.576a0.1673 0.1673 0 0 0 0.27132-0.18204"/>
+<path d="m17.455 12.394a7.3653 7.3653 0 0 1 0.92223 1.3655"/>
+<path d="m83.116 87.724a12.317 12.317 0 0 0-1.1936-1.1834"/>
+<path d="m81.922 86.54a7.6432 7.6432 0 0 1 1.2512 1.1348"/>
+<path d="m83.174 87.675a0.040218 0.040218 0 0 0-0.05765 0.04862"/>
+<path d="m38.411 1.5722a12.317 12.317 0 0 1 0.33752 2.6792"/>
+<path d="m38.749 4.2514a19.801 19.801 0 0 0-0.45664-2.6532"/>
+<path d="m38.292 1.5982a0.065045 0.065045 0 0 0 0.11912-0.02602"/>
+<path d="m6.519 25.879a0.21454 0.21454 0 0 0 0.15827-0.3871"/>
+<path d="m6.6773 25.492a1.9476 1.9476 0 0 1 0.94561 1.9818"/>
+<path d="m7.6229 27.474a2.3432 2.3432 0 0 0-1.1039-1.5947"/>
+<path d="m96.876 32.639a0.3075 0.3075 0 0 0 0.27056 0.5353"/>
+<path d="m97.147 33.174a2.1403 2.1403 0 0 1-2.6466-1.1386"/>
+<path d="m94.5 32.035a2.2947 2.2947 0 0 0 2.376 0.60325"/>
+<path d="m62.335 4.2176a4.2791 4.2791 0 0 0 1.4365-2.1514"/>
+<path d="m63.772 2.0662a0.29539 0.29539 0 0 0 0.52399 0.23719"/>
+<path d="m64.296 2.3034a2.9988 2.9988 0 0 1-1.9605 1.9142"/>
+<path d="m36.528 98.234a4.2791 4.2791 0 0 1 1.4365-2.1514"/>
+<path d="m37.965 96.082a4.8695 4.8695 0 0 0-1.3212 2.1872"/>
+<path d="m36.644 98.27a0.064429 0.064429 0 0 0-0.11533-0.03587"/>
+<path d="m92.677 72.826a3.6611 3.6611 0 0 0 1.3428 1.2767"/>
+<path d="m94.02 74.103a0.20411 0.20411 0 0 0-0.2389 0.31802"/>
+<path d="m93.781 74.421a2.3432 2.3432 0 0 1-1.1039-1.5947"/>
+<path d="m5.7997 68.265a2.9146 2.9146 0 0 0-2.2624-0.084274"/>
+<path d="m3.5373 68.18a0.27302 0.27302 0 0 0-0.11358-0.51897"/>
+<path d="m3.4237 67.661a2.2947 2.2947 0 0 1 2.376 0.60325"/>
+<path d="m6.2801 26.197a3.6611 3.6611 0 0 1 1.3428 1.2767"/>
+<path d="m7.6229 27.474a4.3239 4.3239 0 0 0-1.3852-1.2034"/>
+<path d="m6.2377 26.27a0.045193 0.045193 0 0 0 0.042441-0.07333"/>
+<path d="m96.763 32.12a2.9146 2.9146 0 0 1-2.2624-0.08427"/>
+<path d="m94.5 32.035a3.1824 3.1824 0 0 0 2.226-0.01807"/>
+<path d="m96.726 32.017a0.057947 0.057947 0 0 0 0.03641 0.10234"/>
+<path d="m67.05 9.845a107.21 107.21 0 0 1-56.731 52.135"/>
+<path d="m10.319 61.98a24.595 24.595 0 0 0 1.0447-37.458"/>
+<path d="m11.363 24.523a42.028 42.028 0 0 0 55.687-14.678"/>
+<path d="m88.937 75.777a19.801 19.801 0 0 0-27.386 20.271"/>
+<path d="m61.551 96.049a17.462 17.462 0 0 0-28.301-5.5936"/>
+<path d="m33.25 90.455a42.028 42.028 0 0 1 55.687-14.678"/>
+<path d="m56.495 96.99a4.9142 4.9142 0 0 0-8.5106 2.8789"/>
+<path d="m47.984 99.869a0.93542 0.93542 0 0 0-1.7903-0.1348"/>
+<path d="m46.194 99.734a5.7511 5.7511 0 0 1 10.301-2.7441"/>
+<path d="m10.319 61.98a14.304 14.304 0 0 1 4.5872 22.865"/>
+<path d="m14.906 84.846a1.6411 1.6411 0 0 0-2.2696-2.1555"/>
+<path d="m12.636 82.69a12.89 12.89 0 0 0-2.3176-20.71"/>
+<path d="m30.179 5.3802a7.6432 7.6432 0 0 1-11.802 8.3797"/>
+<path d="m18.378 13.76a3.4141 3.4141 0 0 0 4.1501-4.7482"/>
+<path d="m22.528 9.0116a4.3723 4.3723 0 0 0 7.6518-3.6314"/>
+<path d="m83.742 13.634a10.092 10.092 0 0 1-16.692-3.7891"/>
+<path d="m67.05 9.845a7.855 7.855 0 0 0 12.353 0.35607"/>
+<path d="m79.403 10.201a2.8288 2.8288 0 0 0 4.3386 3.433"/>
+<path d="m99.651 43.821a6.162 6.162 0 0 0-5.281 6.3292"/>
+<path d="m94.37 50.15a6.5282 6.5282 0 0 1 4.7145-8.5345"/>
+<path d="m99.084 41.616a1.1633 1.1633 0 0 0 0.56657 2.2053"/>
+<path d="m54.106 0.56593a4.8695 4.8695 0 0 0 8.2292 3.6516"/>
+<path d="m62.335 4.2176a10.346 10.346 0 0 1-18.53-0.90756"/>
+<path d="m43.805 3.31a5.7511 5.7511 0 0 0 10.301-2.7441"/>
+<path d="m87.664 17.61a2.7388 2.7388 0 0 0 3.0194 4.3865"/>
+<path d="m90.683 21.996a10.778 10.778 0 0 0-0.70186 16.323"/>
+<path d="m89.981 38.32a12.89 12.89 0 0 1-2.3176-20.71"/>
+<path d="m5.93 50.15a8.4802 8.4802 0 0 0-3.5104-13.887"/>
+<path d="m2.4196 36.263a1.1046 1.1046 0 0 0 0.6346-2.0209"/>
+<path d="m3.0542 34.242a9.3988 9.3988 0 0 1 2.8758 15.908"/>
+<path d="m61.551 96.049a3.4563 3.4563 0 0 1 5.8647 0.91599"/>
+<path d="m67.416 96.965a0.31708 0.31708 0 0 0-0.56024 0.24044"/>
+<path d="m66.856 97.205a3.2382 3.2382 0 0 0-5.3045-1.1564"/>
+<path d="m18.378 13.76a3.1975 3.1975 0 0 1-5.1818 2.9546"/>
+<path d="m13.196 16.714a0.47756 0.47756 0 0 0 0.56814-0.71886"/>
+<path d="m13.764 15.996a2.7832 2.7832 0 0 0 4.6137-2.2357"/>
+<path d="m94.37 50.15a8.4802 8.4802 0 0 1 5.6555-2.6347"/>
+<path d="m100.03 47.515a0.18161 0.18161 0 0 0 0.0306 0.34843"/>
+<path d="m100.06 47.864a9.3988 9.3988 0 0 0-5.6861 2.2863"/>
+<path d="m87.647 83.038a4.3865 4.3865 0 0 1 1.2896-7.2609"/>
+<path d="m88.937 75.777a3.8021 3.8021 0 0 0-0.09062 5.748"/>
+<path d="m88.846 81.525a0.98038 0.98038 0 0 0-1.199 1.5129"/>
+<path d="m53.558 99.983a2.8505 2.8505 0 0 1 2.9373-2.9927"/>
+<path d="m56.495 96.99a2.8369 2.8369 0 0 0-2.0775 2.8882"/>
+<path d="m54.417 99.878a0.43931 0.43931 0 0 0-0.8598 0.1045"/>
+<path d="m28.269 95.056a2.2391 2.2391 0 0 0-1.5999-3.1354"/>
+<path d="m26.669 91.921a2.6113 2.6113 0 0 1 2.7215 3.5167"/>
+<path d="m29.391 95.437a0.60473 0.60473 0 0 0-1.1216-0.3813"/>
+<path d="m41.099 1.0131a2.8505 2.8505 0 0 0 2.7061 2.2969"/>
+<path d="m43.805 3.31a2.8369 2.8369 0 0 1-3.5108-2.0602"/>
+<path d="m40.294 1.2498a0.42705 0.42705 0 0 0 0.80471-0.23674"/>
+<path d="m97.246 66.058a4.3239 4.3239 0 0 0-4.5687 6.7685"/>
+<path d="m92.677 72.826a13.364 13.364 0 0 1 1.6929-22.676"/>
+<path d="m94.37 50.15a9.3988 9.3988 0 0 0 2.8758 15.908"/>
+<path d="m6.34 73.989a3.1824 3.1824 0 0 0-0.5403-5.7242"/>
+<path d="m5.7997 68.265a5.0668 5.0668 0 0 1 3.1722 8.8038"/>
+<path d="m8.9719 77.068a2.1005 2.1005 0 0 0-2.6319-3.0796"/>
+<path d="m86.536 84.304a0.72207 0.72207 0 0 0-1.0314 0.97172"/>
+<path d="m85.505 85.276a2.1932 2.1932 0 0 0-3.5823 1.264"/>
+<path d="m81.922 86.54a2.7832 2.7832 0 0 1 4.6137-2.2357"/>
+<path d="m0.24393 52.436a0.40574 0.40574 0 0 0 0.045261-0.79311"/>
+<path d="m0.28919 51.643a13.364 13.364 0 0 0 5.6408-1.4932"/>
+<path d="m5.93 50.15a9.3988 9.3988 0 0 1-5.6861 2.2863"/>
+<path d="m33.444 3.095a0.5683 0.5683 0 0 0 1.0762-0.29015"/>
+<path d="m34.521 2.8048a2.9146 2.9146 0 0 0 4.2283 1.4466"/>
+<path d="m38.749 4.2514a3.2382 3.2382 0 0 1-5.3045-1.1564"/>
+<path d="m73.631 8.3794a2.3957 2.3957 0 0 0 3.9708 0.051784"/>
+<path d="m77.602 8.4311a0.21818 0.21818 0 0 0 0.35241 0.22926"/>
+<path d="m77.954 8.6604a2.5368 2.5368 0 0 1-4.3232-0.28104"/>
+<path d="m89.981 38.32a14.304 14.304 0 0 0 8.8808 0.91281"/>
+<path d="m98.862 39.232a0.27226 0.27226 0 0 0 0.12604 0.50892"/>
+<path d="m98.988 39.741a12.89 12.89 0 0 1-9.0069-1.4217"/>
+<path d="m62.335 4.2176a2.6097 2.6097 0 0 1-2.4817-3.0665"/>
+<path d="m59.853 1.1511a0.15737 0.15737 0 0 0 0.29961 0.045115"/>
+<path d="m60.153 1.1962a2.5643 2.5643 0 0 0 2.1821 3.0214"/>
+<path d="m26.669 91.921a2.3957 2.3957 0 0 1 0.12531 2.4144"/>
+<path d="m26.795 94.335a0.072179 0.072179 0 0 0-0.12542-0.06012"/>
+<path d="m26.669 94.275a2.5368 2.5368 0 0 0 1.15e-4 -2.3543"/>
+<path d="m43.805 3.31a4.9142 4.9142 0 0 1-1.2368-2.5582"/>
+<path d="m42.568 0.75182a0.077565 0.077565 0 0 0 0.14686-0.027871"/>
+<path d="m42.715 0.72395a5.7511 5.7511 0 0 0 1.09 2.5861"/>
+<path d="m0.58649 44.272a6.162 6.162 0 0 1 5.3435 5.8782"/>
+<path d="m5.93 50.15a6.5282 6.5282 0 0 0-5.4273-4.3194"/>
+<path d="m0.50271 45.831a0.79292 0.79292 0 0 0 0.083784-1.5588"/>
+<path d="m33.235 97.14a10.092 10.092 0 0 0 0.014507-6.6852"/>
+<path d="m33.25 90.455a7.855 7.855 0 0 1 1.1868 6.9938"/>
+<path d="m34.437 97.449a0.63111 0.63111 0 0 0-1.2013-0.30859"/>
+<path d="m22.346 91.64a0.72794 0.72794 0 0 0-1.0214-0.97416"/>
+<path d="m21.325 90.665a3.0909 3.0909 0 0 1 5.3446 1.2552"/>
+<path d="m26.669 91.921a2.5368 2.5368 0 0 0-4.3232-0.28104"/>
+<path d="m1.3117 60.559a0.69664 0.69664 0 0 0-0.11169-1.3548"/>
+<path d="m1.2 59.204a10.778 10.778 0 0 1 9.1186 2.7765"/>
+<path d="m10.319 61.98a12.89 12.89 0 0 0-9.0069-1.4217"/>
+<path d="m57.585 99.576a0.17652 0.17652 0 0 0-0.34545 0.01675"/>
+<path d="m57.24 99.593a10.346 10.346 0 0 0-0.74453-2.6028"/>
+<path d="m56.495 96.99a5.7511 5.7511 0 0 1 1.09 2.5861"/>
+<path d="m73.631 6.0251a0.15677 0.15677 0 0 0 0.25657 0.16925"/>
+<path d="m73.887 6.1943a3.0909 3.0909 0 0 0-0.25668 2.185"/>
+<path d="m73.631 8.3794a2.5368 2.5368 0 0 1 1.15e-4 -2.3543"/>
+<path d="m40.147 99.104a0.31062 0.31062 0 0 0-0.58451-0.17202"/>
+<path d="m39.563 98.932a2.5584 2.5584 0 0 0-1.5976-2.8494"/>
+<path d="m37.965 96.082a2.5643 2.5643 0 0 1 2.1821 3.0214"/>
+<path d="m81.922 86.54a3.1975 3.1975 0 0 0 0.72306 1.5919"/>
+<path d="m82.646 88.132a0.048333 0.048333 0 0 0-0.06911 0.06251"/>
+<path d="m82.576 88.194a2.7832 2.7832 0 0 1-0.65395-1.6544"/>
+<path d="m33.25 90.455a107.21 107.21 0 0 0-2.6094 5.6765"/>
+<path d="m30.641 96.131a0.17187 0.17187 0 0 0-0.3084-0.12049"/>
+<path d="m30.332 96.011a42.028 42.028 0 0 1 2.9178-5.556"/>
+<path d="m38.749 4.2514a3.4563 3.4563 0 0 0 0.72304-2.9208"/>
+<path d="m39.472 1.3306a0.091382 0.091382 0 0 0 0.17114-0.041735"/>
+<path d="m39.643 1.2889a3.2382 3.2382 0 0 1-0.89418 2.9626"/>
+<path d="m92.677 72.826a1.9476 1.9476 0 0 1 2.7131-1.4827"/>
+<path d="m95.39 71.344a0.13092 0.13092 0 0 0-0.09574 0.23318"/>
+<path d="m95.295 71.577a1.8919 1.8919 0 0 0-2.6174 1.2495"/>
+<path d="m5.7997 68.265a2.1403 2.1403 0 0 1-1.0219 2.8139"/>
+<path d="m4.7778 71.078a0.10795 0.10795 0 0 0-0.095344-0.18476"/>
+<path d="m4.6824 70.894a2.1425 2.1425 0 0 0 1.1173-2.6292"/>
+<path d="m75.968 7.3602a2.2392 2.2392 0 0 1-2.3374 1.0192"/>
+<path d="m73.631 8.3794a2.6113 2.6113 0 0 0 1.9449-1.2258"/>
+<path d="m75.576 7.1535a0.22497 0.22497 0 0 0 0.39256 0.20667"/>
+<path d="m97.898 35.55a107.21 107.21 0 0 0-7.9164 2.7693"/>
+<path d="m89.981 38.32a24.595 24.595 0 0 1 7.3884-4.0787"/>
+<path d="m97.37 34.241a0.71805 0.71805 0 0 0 0.52802 1.3093"/>
+<path d="m7.4247 24.246a4.3865 4.3865 0 0 0 3.9385 0.27676"/>
+<path d="m11.363 24.523a3.8021 3.8021 0 0 1-4.2753 0.41821"/>
+<path d="m7.0879 24.941a0.39276 0.39276 0 0 0 0.33679-0.69496"/>
+<path d="m60.657 99.011a0.23994 0.23994 0 0 0-0.46705 0.04171"/>
+<path d="m60.19 99.053a2.9146 2.9146 0 0 1 1.3612-3.0043"/>
+<path d="m61.551 96.049a3.2382 3.2382 0 0 0-0.89418 2.9626"/>
+<path d="m17.724 12.106a0.12203 0.12203 0 0 0 0.19823-0.13308"/>
+<path d="m17.922 11.972a2.1932 2.1932 0 0 1 0.45572 1.7874"/>
+<path d="m18.378 13.76a2.7832 2.7832 0 0 0-0.65395-1.6544"/>
+<path d="m69.968 4.289a0.41441 0.41441 0 0 0 0.70273 0.40376"/>
+<path d="m70.671 4.6928a17.462 17.462 0 0 1-3.6206 5.1522"/>
+<path d="m67.05 9.845a42.028 42.028 0 0 0 2.9178-5.556"/>
+<path d="m5.0055 28.723a0.25292 0.25292 0 0 0 0.24832-0.42975"/>
+<path d="m5.2538 28.293a1.8386 1.8386 0 0 0 2.3691-0.81977"/>
+<path d="m7.6229 27.474a1.8919 1.8919 0 0 1-2.6174 1.2495"/>
+<path d="m95.618 29.406a0.21976 0.21976 0 0 0 0.14425 0.40623"/>
+<path d="m95.762 29.813a2.2355 2.2355 0 0 0-1.2615 2.2229"/>
+<path d="m94.5 32.035a2.1425 2.1425 0 0 1 1.1173-2.6292"/>
+<path d="m11.363 24.523a19.801 19.801 0 0 1-3.0919-1.6382"/>
+<path d="m8.2714 22.885a0.09325 0.09325 0 0 0 0.093187-0.15367"/>
+<path d="m8.3646 22.731a42.028 42.028 0 0 0 2.9987 1.7919"/>
+<path d="m37.965 96.082a2.6097 2.6097 0 0 0-2.5713 1.8076"/>
+<path d="m35.394 97.89a0.11023 0.11023 0 0 0-0.20419-0.05879"/>
+<path d="m35.189 97.831a2.5643 2.5643 0 0 1 2.7755-1.7488"/>
+<path d="m83.174 87.675a7.6432 7.6432 0 0 0-1.2512-1.1348"/>
+<path d="m81.922 86.54a3.4141 3.4141 0 0 1 1.4393 0.94167"/>
+<path d="m83.362 87.482a0.13685 0.13685 0 0 0-0.18806 0.19315"/>
+<path d="m38.292 1.5982a19.801 19.801 0 0 1 0.45664 2.6532"/>
+<path d="m38.749 4.2514a17.462 17.462 0 0 1-0.85655-2.5237"/>
+<path d="m37.892 1.7278a0.21337 0.21337 0 0 0 0.39991-0.12955"/>
+<path d="m65.111 2.4688a0.30609 0.30609 0 0 0 0.54131 0.25265"/>
+<path d="m65.652 2.7214a2.5584 2.5584 0 0 1-3.3168 1.4961"/>
+<path d="m62.335 4.2176a2.5643 2.5643 0 0 0 2.7755-1.7488"/>
+<path d="m91.935 77.569a0.22015 0.22015 0 0 0-0.27354 0.33309"/>
+<path d="m91.662 77.902a24.595 24.595 0 0 1-2.7252-2.125"/>
+<path d="m88.937 75.777a42.028 42.028 0 0 1 2.9987 1.7919"/>
+<path d="m7.6229 27.474a1.9476 1.9476 0 0 0-0.94561-1.9818"/>
+<path d="m6.6773 25.492a0.073051 0.073051 0 0 0 0.066855-0.12397"/>
+<path d="m6.7441 25.368a1.8919 1.8919 0 0 1 0.87876 2.1058"/>
+<path d="m94.5 32.035a2.1403 2.1403 0 0 0 2.6466 1.1386"/>
+<path d="m97.147 33.174a0.11019 0.11019 0 0 0 0.07557 0.19852"/>
+<path d="m97.222 33.373a2.1425 2.1425 0 0 1-2.7221-1.3371"/>
+<path d="m36.644 98.27a4.8695 4.8695 0 0 1 1.3212-2.1872"/>
+<path d="m37.965 96.082a10.346 10.346 0 0 0-0.92974 2.2688"/>
+<path d="m37.035 98.351a0.20289 0.20289 0 0 0-0.39148-0.081558"/>
+<path d="m93.556 74.932a0.19946 0.19946 0 0 0-0.23475 0.3109"/>
+<path d="m93.321 75.243a1.8386 1.8386 0 0 1-0.64401-2.4167"/>
+<path d="m92.677 72.826a1.8919 1.8919 0 0 0 0.87876 2.1058"/>
+<path d="m3.0776 66.927a0.3164 0.3164 0 0 0-0.12514-0.6042"/>
+<path d="m2.9524 66.323a2.2355 2.2355 0 0 1 2.8473 1.9413"/>
+<path d="m5.7997 68.265a2.1425 2.1425 0 0 0-2.7221-1.3371"/>
+<path d="m6.2377 26.27a4.3239 4.3239 0 0 1 1.3852 1.2034"/>
+<path d="m7.6229 27.474a13.364 13.364 0 0 0-1.5034-0.94546"/>
+<path d="m6.1195 26.528a0.14393 0.14393 0 0 0 0.11815-0.25792"/>
+<path d="m96.726 32.017a3.1824 3.1824 0 0 1-2.226 0.01807"/>
+<path d="m94.5 32.035a5.0668 5.0668 0 0 0 2.0769-0.33767"/>
+<path d="m96.577 31.698a0.17889 0.17889 0 0 0 0.14909 0.3196"/>
+<path d="m499.11 25.667a15.476 15.476 0 0 0 2.8182 24.707"/>
+<path d="m501.93 50.374a26.134 26.134 0 0 1-16.82-33.875"/>
+<path d="m485.11 16.499a11.098 11.098 0 0 0 14.002 9.1683"/>
+<path d="m496.82 80.673a6.2369 6.2369 0 0 0-8.56 7.1813"/>
+<path d="m488.26 87.854a12.866 12.866 0 0 1 10.347-18.531"/>
+<path d="m498.61 69.323a7.7285 7.7285 0 0 0-1.787 11.349"/>
+<path d="m442.53 97.107a1.0996 1.0996 0 0 0-1.9598-0.62318"/>
+<path d="m440.57 96.484a4.8107 4.8107 0 0 1 6.1181-2.3906"/>
+<path d="m446.68 94.094a5.1577 5.1577 0 0 0-4.1583 3.0138"/>
+<path d="m433.05 84.249a8.2732 8.2732 0 0 0-11.611-1.9392"/>
+<path d="m421.44 82.309a4.4123 4.4123 0 0 0-2.391-7.2291"/>
+<path d="m419.05 75.08a11.098 11.098 0 0 1 14.002 9.1683"/>
+<path d="m416.23 50.374a15.476 15.476 0 0 1 2.8182 24.707"/>
+<path d="m419.05 75.08a7.453 7.453 0 0 0-6.2195-11.637"/>
+<path d="m412.83 63.443a9.1991 9.1991 0 0 0 3.4013-13.07"/>
+<path d="m460.18 1.4915a7.3278 7.3278 0 0 0 11.299 5.1621"/>
+<path d="m471.47 6.6536a10.201 10.201 0 0 1-17.031-3.8106"/>
+<path d="m454.44 2.8431a3.5149 3.5149 0 0 0 5.7317-1.3515"/>
+<path d="m481.69 94.519a1.4884 1.4884 0 0 0-2.581 1.0124"/>
+<path d="m479.11 95.532a3.1372 3.1372 0 0 1 4.4239-3.5226"/>
+<path d="m483.54 92.009a1.9833 1.9833 0 0 0-1.8428 2.5102"/>
+<path d="m409.86 46.239a1.5238 1.5238 0 0 0 0.12913-2.8357"/>
+<path d="m409.99 43.403a7.7744 7.7744 0 0 1 6.2428 6.9702"/>
+<path d="m416.23 50.374a9.1991 9.1991 0 0 0-6.372-4.1345"/>
+<path d="m463.72 97.904a2.4748 2.4748 0 0 0-3.1657 2.2362"/>
+<path d="m460.55 100.14a1.5456 1.5456 0 0 0-2.566-0.8847"/>
+<path d="m457.98 99.256a3.5149 3.5149 0 0 1 5.7317-1.3515"/>
+<path d="m419.55 31.424a6.6167 6.6167 0 0 0-1.7505-8.5421"/>
+<path d="m417.8 22.882a2.5378 2.5378 0 0 0 3.5375-2.8073"/>
+<path d="m421.34 20.075a7.7285 7.7285 0 0 1-1.787 11.349"/>
+<path d="m471.47 6.6536a7.3278 7.3278 0 0 0 2.8909-3.7206"/>
+<path d="m474.37 2.933a0.7874 0.7874 0 0 0 1.2674 0.70683"/>
+<path d="m475.63 3.6398a5.1577 5.1577 0 0 1-4.1583 3.0138"/>
+<path d="m505.33 37.304a3.0922 3.0922 0 0 0 2.5705 4.8431"/>
+<path d="m507.9 42.147a7.7744 7.7744 0 0 0-5.9718 8.2265"/>
+<path d="m501.93 50.374a9.1991 9.1991 0 0 1 3.4013-13.07"/>
+<path d="m446.68 94.094a7.3279 7.3279 0 0 1 11.299 5.1621"/>
+<path d="m457.98 99.256a3.0412 3.0412 0 0 0-5.6002-0.2494"/>
+<path d="m452.38 99.006a5.1577 5.1577 0 0 0-5.699-4.9127"/>
+<path d="m429.9 12.893a6.2369 6.2369 0 0 1-8.56 7.1813"/>
+<path d="m421.34 20.075a3.4784 3.4784 0 0 0 3.6531-5.1763"/>
+<path d="m424.99 14.898a3.274 3.274 0 0 0 4.9068-2.005"/>
+<path d="m496.72 18.438a8.2732 8.2732 0 0 1-11.611-1.9392"/>
+<path d="m485.11 16.499a7.9236 7.9236 0 0 0 10.31 0.25885"/>
+<path d="m495.42 16.757a1.2173 1.2173 0 0 0 1.3009 1.6803"/>
+<path d="m433.56 92.962a8.2732 8.2732 0 0 0-0.50696-8.7136"/>
+<path d="m433.05 84.249a7.9236 7.9236 0 0 1 1.8059 9.3784"/>
+<path d="m434.86 93.627a0.83201 0.83201 0 0 0-1.2989-0.66481"/>
+<path d="m429.46 10.328a0.47505 0.47505 0 0 0 0.68118-0.57463"/>
+<path d="m430.14 9.7535a2.6113 2.6113 0 0 1-0.24309 3.1399"/>
+<path d="m429.9 12.893a3.274 3.274 0 0 0-0.43809-2.5653"/>
+<path d="m501.69 24.575a0.42701 0.42701 0 0 0 0.47893 0.63936"/>
+<path d="m502.17 25.214a4.4123 4.4123 0 0 1-3.0561 0.45304"/>
+<path d="m499.11 25.667a11.098 11.098 0 0 0 2.5772-1.0924"/>
+<path d="m434.62 8.7384a1.7442 1.7442 0 0 0 0.72679-2.2581"/>
+<path d="m435.35 6.4802a0.63158 0.63158 0 0 0 1.116-0.25209"/>
+<path d="m436.47 6.2281a1.9833 1.9833 0 0 1-1.8428 2.5102"/>
+<path d="m501.93 50.374a15.476 15.476 0 0 0 6.8685 2.0534"/>
+<path d="m508.8 52.427a1.1618 1.1618 0 0 0-0.49654 2.0811"/>
+<path d="m508.3 54.508a9.1991 9.1991 0 0 1-6.372-4.1345"/>
+<path d="m493.17 85.849a1.2188 1.2188 0 0 0-1.1211 1.8734"/>
+<path d="m492.04 87.722a2.6113 2.6113 0 0 0-3.7857 0.13156"/>
+<path d="m488.26 87.854a3.274 3.274 0 0 1 4.9068-2.005"/>
+<path d="m465.78 1.7409a1.5039 1.5039 0 0 0 2.7132-0.21511"/>
+<path d="m468.49 1.5258a4.8107 4.8107 0 0 0 2.9857 5.1278"/>
+<path d="m471.47 6.6536a5.1577 5.1577 0 0 1-5.699-4.9127"/>
+<path d="m485.11 16.499a8.2732 8.2732 0 0 1-0.50697-8.7136"/>
+<path d="m484.6 7.785a1.3342 1.3342 0 0 0 1.9779 1.5012"/>
+<path d="m486.58 9.2862a11.098 11.098 0 0 0-1.4709 7.2124"/>
+<path d="m500.36 77.865a6.6167 6.6167 0 0 1-1.7505-8.5421"/>
+<path d="m498.61 69.323a6.6786 6.6786 0 0 0 2.5679 7.4102"/>
+<path d="m501.17 76.733a0.7958 0.7958 0 0 0-0.81743 1.1319"/>
+<path d="m443.79 97.814a7.3278 7.3278 0 0 1 2.8909-3.7206"/>
+<path d="m446.68 94.094a10.201 10.201 0 0 0-2.338 3.9038"/>
+<path d="m444.35 97.997a0.33007 0.33007 0 0 0-0.55283-0.18316"/>
+<path d="m410.26 58.6a3.0922 3.0922 0 0 1 2.5705 4.8431"/>
+<path d="m412.83 63.443a2.4905 2.4905 0 0 0-2.5045-3.4039"/>
+<path d="m410.32 60.039a0.82805 0.82805 0 0 0-0.0659-1.4392"/>
+<path d="m457.61 0.60683a2.4748 2.4748 0 0 1-3.1658 2.2362"/>
+<path d="m454.44 2.8431a2.3258 2.3258 0 0 0 2.4675-2.262"/>
+<path d="m456.91 0.58109a0.39731 0.39731 0 0 0 0.69829 0.025746"/>
+<path d="m465.46 99.867a2.4748 2.4748 0 0 0-1.7454-1.9628"/>
+<path d="m463.72 97.904a2.3258 2.3258 0 0 1 2.143 1.89"/>
+<path d="m465.86 99.794a0.22912 0.22912 0 0 0-0.39759 0.07279"/>
+<path d="m412.03 34.527a6.6167 6.6167 0 0 0 7.5234-3.1031"/>
+<path d="m419.55 31.424a6.6786 6.6786 0 0 1-7.8906 4.5734"/>
+<path d="m411.66 35.997a0.86499 0.86499 0 0 0 0.36713-1.4702"/>
+<path d="m501.39 23.903a15.476 15.476 0 0 0-2.2813 1.7636"/>
+<path d="m499.11 25.667a7.453 7.453 0 0 1 2.0918-2.0555"/>
+<path d="m501.2 23.611a0.19701 0.19701 0 0 0 0.1895 0.29195"/>
+<path d="m506.93 36.111a3.0922 3.0922 0 0 0-1.6036 1.1933"/>
+<path d="m505.33 37.304a2.4905 2.4905 0 0 1 1.5213-1.4404"/>
+<path d="m506.85 35.864a0.14736 0.14736 0 0 0 0.0822 0.24705"/>
+<path d="m497.88 81.748a0.22461 0.22461 0 0 0-0.22862 0.35311"/>
+<path d="m497.65 82.101a2.5378 2.5378 0 0 1-0.83501-1.4287"/>
+<path d="m496.82 80.673a7.7285 7.7285 0 0 0 1.0636 1.0755"/>
+<path d="m431.58 91.461a1.1154 1.1154 0 0 0-1.8534-0.90382"/>
+<path d="m429.73 90.557a26.134 26.134 0 0 0 3.3244-6.3086"/>
+<path d="m433.05 84.249a11.098 11.098 0 0 1-1.4709 7.2124"/>
+<path d="m488.26 87.854a6.2369 6.2369 0 0 0 1.0519 2.248"/>
+<path d="m489.31 90.102a0.37264 0.37264 0 0 0-0.6138 0.31727"/>
+<path d="m488.7 90.419a3.274 3.274 0 0 1-0.43809-2.5653"/>
+<path d="m419.05 75.08a15.476 15.476 0 0 1-2.2813 1.7636"/>
+<path d="m416.77 76.844a0.3938 0.3938 0 0 0-0.2959-0.67116"/>
+<path d="m416.47 76.173a11.098 11.098 0 0 1 2.5772-1.0924"/>
+<path d="m498.61 69.323a6.6167 6.6167 0 0 1 7.5235-3.1031"/>
+<path d="m506.13 66.22a1.2989 1.2989 0 0 0-0.98528 2.2113"/>
+<path d="m505.14 68.431a7.7285 7.7285 0 0 0-6.5382 0.89185"/>
+<path d="m412.83 63.443a3.0922 3.0922 0 0 1-1.6036 1.1933"/>
+<path d="m411.22 64.637a0.26827 0.26827 0 0 0-0.0853-0.49427"/>
+<path d="m411.14 64.142a9.1991 9.1991 0 0 0 1.6889-0.69905"/>
+<path d="m454.44 2.8431a2.4748 2.4748 0 0 1-1.7454-1.9628"/>
+<path d="m452.7 0.88032a0.37414 0.37414 0 0 0 0.70044-0.022894"/>
+<path d="m453.4 0.85742a3.5149 3.5149 0 0 0 1.0449 1.9857"/>
+<path d="m482.81 94.267a1.7442 1.7442 0 0 1 0.7268-2.2581"/>
+<path d="m483.54 92.009a1.7807 1.7807 0 0 0-0.40577 2.1032"/>
+<path d="m483.13 94.112a0.202 0.202 0 0 0-0.32103 0.15491"/>
+<path d="m409.36 48.32a15.476 15.476 0 0 1 6.8685 2.0534"/>
+<path d="m416.23 50.374a26.134 26.134 0 0 0-6.9046-1.1609"/>
+<path d="m409.32 49.213a0.50704 0.50704 0 0 0 0.0361-0.89248"/>
+<path d="m432.35 8.234a1.7442 1.7442 0 0 0 2.2713 0.50436"/>
+<path d="m434.62 8.7384a1.7807 1.7807 0 0 1-2.6158-0.24887"/>
+<path d="m432.01 8.4895a0.24341 0.24341 0 0 0 0.34445-0.25549"/>
+<path d="m498.17 81.477a6.2369 6.2369 0 0 0-1.3478-0.80473"/>
+<path d="m496.82 80.673a3.4784 3.4784 0 0 1 1.4626 0.65533"/>
+<path d="m498.28 81.328a0.10655 0.10655 0 0 0-0.11476 0.1494"/>
+<path d="m464.76 99.89a0.31924 0.31924 0 0 0-0.57391 0.1534"/>
+<path d="m464.19 100.04a10.201 10.201 0 0 0-0.47104-2.139"/>
+<path d="m463.72 97.904a3.5149 3.5149 0 0 1 1.045 1.9856"/>
+<path d="m413.02 32.316a1.0145 1.0145 0 0 0 0.41465-1.8265"/>
+<path d="m413.43 30.489a12.866 12.866 0 0 0 6.1235 0.93466"/>
+<path d="m419.55 31.424a7.7285 7.7285 0 0 1-6.5382 0.89185"/>
+<path d="m507.02 36.605a0.25895 0.25895 0 0 0 0.19028 0.4447"/>
+<path d="m507.21 37.05a7.453 7.453 0 0 1-1.8792 0.25436"/>
+<path d="m505.33 37.304a9.1991 9.1991 0 0 1 1.6889-0.69905"/>
+<path d="m421.34 20.075a6.2369 6.2369 0 0 1-1.3478-0.80473"/>
+<path d="m419.99 19.27a0.21041 0.21041 0 0 0 0.28422-0.27082"/>
+<path d="m420.28 18.999a7.7285 7.7285 0 0 1 1.0636 1.0755"/>
+<path d="m483.54 92.009a1.7442 1.7442 0 0 1 2.2713 0.50436"/>
+<path d="m485.81 92.513a0.35884 0.35884 0 0 0-0.59342 0.31836"/>
+<path d="m485.21 92.832a1.9833 1.9833 0 0 0-1.6779-0.82272"/>
+<path d="m428.85 10.645a6.2369 6.2369 0 0 1 1.0519 2.248"/>
+<path d="m429.9 12.893a12.866 12.866 0 0 0-1.2856-2.0711"/>
+<path d="m428.62 10.822a0.16585 0.16585 0 0 0 0.23366-0.17697"/>
+<path d="m432.95 7.9156a0.27539 0.27539 0 0 0 0.38457-0.33646"/>
+<path d="m433.33 7.5792a3.1372 3.1372 0 0 0 1.2933 1.1592"/>
+<path d="m434.62 8.7384a1.9833 1.9833 0 0 1-1.6779-0.82273"/>
+<path d="m485.11 16.499a26.134 26.134 0 0 0 16.82 33.875"/>
+<path d="m501.93 50.374a103.01 103.01 0 0 0-68.88 33.875"/>
+<path d="m433.05 84.249 52.06-67.75"/>
+<path d="m498.61 69.323a12.866 12.866 0 0 0-10.347 18.531"/>
+<path d="m488.26 87.854a14.714 14.714 0 0 0-24.543 10.05"/>
+<path d="m463.72 97.904a28.749 28.749 0 0 1 34.89-28.581"/>
+<path d="m446.68 94.094a4.8107 4.8107 0 0 0-6.1181 2.3906"/>
+<path d="m440.57 96.484a1.0213 1.0213 0 0 0-1.9066-0.57688"/>
+<path d="m438.66 95.907a5.2173 5.2173 0 0 1 8.0248-1.8137"/>
+<path d="m419.05 75.08a4.4123 4.4123 0 0 1 2.391 7.2291"/>
+<path d="m421.44 82.309a1.2854 1.2854 0 0 0-1.9348-1.4961"/>
+<path d="m419.5 80.813a3.4769 3.4769 0 0 0-0.45611-5.733"/>
+<path d="m412.83 63.443a7.453 7.453 0 0 1 6.2195 11.637"/>
+<path d="m419.05 75.08a4.2614 4.2614 0 0 0-5.713-4.8974"/>
+<path d="m413.33 70.183a3.6319 3.6319 0 0 0-0.50649-6.7397"/>
+<path d="m454.44 2.8431a10.201 10.201 0 0 0 17.031 3.8106"/>
+<path d="m471.47 6.6536a42.784 42.784 0 0 1-51.921 24.77"/>
+<path d="m419.55 31.424a28.749 28.749 0 0 0 34.89-28.581"/>
+<path d="m479.5 4.8399a0.34208 0.34208 0 0 0 0.56858 0.29907"/>
+<path d="m480.07 5.139a5.4135 5.4135 0 0 1-8.5934 1.5147"/>
+<path d="m471.47 6.6536a5.2173 5.2173 0 0 0 8.0248-1.8137"/>
+<path d="m498.66 19.934a0.22366 0.22366 0 0 0 0.25102 0.33801"/>
+<path d="m498.91 20.272a3.3465 3.3465 0 0 0 0.20509 5.395"/>
+<path d="m499.11 25.667a3.4769 3.4769 0 0 1-0.45611-5.733"/>
+<path d="m504.82 30.564a0.44063 0.44063 0 0 0 0.32906 0.76008"/>
+<path d="m505.15 31.324a3.2565 3.2565 0 0 0 0.17744 5.9797"/>
+<path d="m505.33 37.304a3.6319 3.6319 0 0 1-0.5065-6.7397"/>
+<path d="m483.54 92.009a3.1372 3.1372 0 0 0-4.4239 3.5226"/>
+<path d="m479.11 95.532a3.3061 3.3061 0 0 0-6.0076 2.2817"/>
+<path d="m473.1 97.813a6.259 6.259 0 0 1 10.431-5.8043"/>
+<path d="m416.23 50.374a7.7744 7.7744 0 0 0-6.2428-6.9702"/>
+<path d="m409.99 43.403a1.314 1.314 0 0 0 0.131-2.5537"/>
+<path d="m410.12 40.85a7.9421 7.9421 0 0 1 6.1118 9.5239"/>
+<path d="m421.34 20.075a2.5378 2.5378 0 0 1-3.5375 2.8073"/>
+<path d="m417.8 22.882a0.79698 0.79698 0 0 0 0.53554-1.4199"/>
+<path d="m418.34 21.462a1.9315 1.9315 0 0 0 3.002-1.3873"/>
+<path d="m501.93 50.374a7.7744 7.7744 0 0 1 5.9718-8.2265"/>
+<path d="m507.9 42.147a1.1571 1.1571 0 0 0 0.72418 2.1059"/>
+<path d="m508.63 44.253a7.9421 7.9421 0 0 0-6.696 6.1206"/>
+<path d="m424.99 14.898a3.4784 3.4784 0 0 1-3.6531 5.1763"/>
+<path d="m421.34 20.075a2.1436 2.1436 0 0 0 1.1075-3.6306"/>
+<path d="m422.45 16.444a1.5699 1.5699 0 0 0 2.5457-1.5456"/>
+<path d="m495.42 16.757a7.9236 7.9236 0 0 1-10.31-0.25885"/>
+<path d="m485.11 16.499a8.2626 8.2626 0 0 0 8.7534-1.9171"/>
+<path d="m493.86 14.582a1.3787 1.3787 0 0 0 1.5566 2.1759"/>
+<path d="m434.86 93.627a7.9236 7.9236 0 0 0-1.8059-9.3784"/>
+<path d="m433.05 84.249a8.2626 8.2626 0 0 1 4.6406 11.137"/>
+<path d="m437.69 95.386a1.7048 1.7048 0 0 0-2.8346-1.7587"/>
+<path d="m445.06 2.934a2.427 2.427 0 0 0 4.4237-0.42142"/>
+<path d="m449.48 2.5126a8.542 8.542 0 0 1-14.855 6.2258"/>
+<path d="m434.62 8.7384a6.259 6.259 0 0 0 10.431-5.8043"/>
+<path d="m508.04 59.897a0.41931 0.41931 0 0 0-0.1964 0.76233"/>
+<path d="m507.84 60.66a8.1066 8.1066 0 0 1-5.9154-10.286"/>
+<path d="m501.93 50.374a7.9421 7.9421 0 0 0 6.1118 9.5239"/>
+<path d="m499.82 79.285a0.1338 0.1338 0 0 0-0.1486 0.20355"/>
+<path d="m499.67 79.489a1.8469 1.8469 0 0 0-2.8534 1.1838"/>
+<path d="m496.82 80.673a1.9315 1.9315 0 0 1 3.002-1.3873"/>
+<path d="m409.53 56.494a0.24867 0.24867 0 0 0-0.0439-0.46585"/>
+<path d="m409.49 56.028a8.1066 8.1066 0 0 0 6.7399-5.6547"/>
+<path d="m416.23 50.374a7.9421 7.9421 0 0 1-6.696 6.1206"/>
+<path d="m429.9 12.893a2.6113 2.6113 0 0 0 0.24309-3.1399"/>
+<path d="m430.14 9.7535a0.39736 0.39736 0 0 0 0.57859-0.51732"/>
+<path d="m430.72 9.2362a2.5861 2.5861 0 0 1-0.82168 3.6572"/>
+<path d="m499.11 25.667a4.4123 4.4123 0 0 0 3.0561-0.45304"/>
+<path d="m502.17 25.214a0.30231 0.30231 0 0 0 0.35999 0.46681"/>
+<path d="m502.53 25.681a3.4769 3.4769 0 0 1-3.4161-0.01377"/>
+<path d="m488.26 87.854a2.6113 2.6113 0 0 1 3.7857-0.13156"/>
+<path d="m492.04 87.722a0.42789 0.42789 0 0 0-0.5098 0.6499"/>
+<path d="m491.53 88.372a2.5861 2.5861 0 0 0-3.2759-0.51834"/>
+<path d="m471.47 6.6536a4.8107 4.8107 0 0 1-2.9857-5.1278"/>
+<path d="m468.49 1.5258a0.61245 0.61245 0 0 0 1.1833 0.025698"/>
+<path d="m469.67 1.5515a5.2173 5.2173 0 0 0 1.8025 5.1021"/>
+<path d="m501.17 76.733a6.6786 6.6786 0 0 1-2.5679-7.4102"/>
+<path d="m498.61 69.323a7.6469 7.6469 0 0 0 3.7491 5.9658"/>
+<path d="m502.35 75.289a0.95847 0.95847 0 0 0-1.1812 1.4444"/>
+<path d="m444.35 97.997a10.201 10.201 0 0 1 2.338-3.9038"/>
+<path d="m446.68 94.094a42.784 42.784 0 0 0-1.4905 4.2759"/>
+<path d="m445.19 98.37a0.47303 0.47303 0 0 0-0.84757-0.37214"/>
+<path d="m410.32 60.039a2.4905 2.4905 0 0 1 2.5045 3.4039"/>
+<path d="m412.83 63.443a2.0554 2.0554 0 0 0-2.4702-2.0181"/>
+<path d="m410.36 61.425a0.71631 0.71631 0 0 0-0.0343-1.3858"/>
+<path d="m456.91 0.58109a2.3258 2.3258 0 0 1-2.4675 2.262"/>
+<path d="m454.44 2.8431a2.3521 2.3521 0 0 0 1.6208-2.3501"/>
+<path d="m456.06 0.49293a0.437 0.437 0 0 0 0.84663 0.088155"/>
+<path d="m465.86 99.794a2.3258 2.3258 0 0 0-2.143-1.89"/>
+<path d="m463.72 97.904a2.3521 2.3521 0 0 1 3.0456 1.8315"/>
+<path d="m466.76 99.736a0.46012 0.46012 0 0 0-0.90262 0.05843"/>
+<path d="m411.66 35.997a6.6786 6.6786 0 0 0 7.8906-4.5734"/>
+<path d="m419.55 31.424a7.6469 7.6469 0 0 1-9.0897 8.133"/>
+<path d="m410.46 39.557a1.9196 1.9196 0 0 0 1.1991-3.5596"/>
+<path d="m501.2 23.611a7.453 7.453 0 0 0-2.0918 2.0555"/>
+<path d="m499.11 25.667a4.2614 4.2614 0 0 1 1.8058-2.6233"/>
+<path d="m500.92 23.044a0.32404 0.32404 0 0 0 0.28603 0.56781"/>
+<path d="m506.85 35.864a2.4905 2.4905 0 0 0-1.5213 1.4404"/>
+<path d="m505.33 37.304a2.0554 2.0554 0 0 1 1.4156-1.9484"/>
+<path d="m506.75 35.356a0.26409 0.26409 0 0 0 0.10567 0.50798"/>
+<path d="m487.44 91.511a0.12452 0.12452 0 0 0-0.19964 0.12255"/>
+<path d="m487.24 91.634a2.6185 2.6185 0 0 1 1.0213-3.7798"/>
+<path d="m488.26 87.854a2.5861 2.5861 0 0 0-0.82169 3.6572"/>
+<path d="m415.63 75.067a0.085959 0.085959 0 0 0-0.0736-0.14411"/>
+<path d="m415.56 74.922a3.3465 3.3465 0 0 1 3.4897 0.15789"/>
+<path d="m419.05 75.08a3.4769 3.4769 0 0 0-3.4161-0.01378"/>
+<path d="m448.49 99.196a0.13566 0.13566 0 0 0-0.24798-0.06128"/>
+<path d="m448.24 99.134a5.4135 5.4135 0 0 0-1.5545-5.0408"/>
+<path d="m446.68 94.094a5.2173 5.2173 0 0 1 1.8025 5.1021"/>
+<path d="m426.62 12.375a0.090092 0.090092 0 0 0 0.13173-0.107"/>
+<path d="m426.76 12.268a2.6185 2.6185 0 0 0 3.1442 0.62534"/>
+<path d="m429.9 12.893a2.5861 2.5861 0 0 1-3.2759-0.51834"/>
+<path d="m496.82 80.673a2.5378 2.5378 0 0 0 0.83501 1.4287"/>
+<path d="m497.65 82.101a0.15668 0.15668 0 0 0-0.16125 0.25966"/>
+<path d="m497.49 82.361a1.9315 1.9315 0 0 1-0.67376-1.6883"/>
+<path d="m433.05 84.249a26.134 26.134 0 0 1-3.3244 6.3086"/>
+<path d="m429.73 90.557a0.63094 0.63094 0 0 0-1.0814-0.57509"/>
+<path d="m428.64 89.982 4.4057-5.7335"/>
+<path d="m483.13 94.112a1.7807 1.7807 0 0 1 0.40577-2.1032"/>
+<path d="m483.54 92.009a2.0849 2.0849 0 0 0 0.043 1.9321"/>
+<path d="m483.58 93.941a0.24588 0.24588 0 0 0-0.44875 0.17111"/>
+<path d="m409.32 49.213a26.134 26.134 0 0 1 6.9046 1.1609"/>
+<path d="m416.23 50.374a103.01 103.01 0 0 1-7.0914 0.28961"/>
+<path d="m409.14 50.663a0.74787 0.74787 0 0 0 0.18681-1.4505"/>
+<path d="m432.01 8.4895a1.7807 1.7807 0 0 0 2.6158 0.24887"/>
+<path d="m434.62 8.7384a2.0849 2.0849 0 0 1-3.5613 0.29196"/>
+<path d="m431.06 9.0303a0.55364 0.55364 0 0 0 0.94553-0.54084"/>
+<path d="m498.28 81.328a3.4784 3.4784 0 0 0-1.4626-0.65533"/>
+<path d="m496.82 80.673a2.1436 2.1436 0 0 1 1.7045 0.4055"/>
+<path d="m498.52 81.078a0.17711 0.17711 0 0 0-0.2419 0.24982"/>
+<path d="m420.67 18.386a0.044192 0.044192 0 0 0 0.056-0.06159"/>
+<path d="m420.72 18.325a1.8469 1.8469 0 0 1 0.61779 1.7499"/>
+<path d="m421.34 20.075a1.9315 1.9315 0 0 0-0.67376-1.6883"/>
+<path d="m489.52 10.765a0.16007 0.16007 0 0 0 0.23178 0.19249"/>
+<path d="m489.75 10.958a103.01 103.01 0 0 1-4.6375 5.541"/>
+<path d="m485.11 16.499 4.4057-5.7335"/>
+<path d="m463.72 97.904a10.201 10.201 0 0 1 0.47104 2.139"/>
+<path d="m464.19 100.04a0.1836 0.1836 0 0 0-0.34596 0.089"/>
+<path d="m463.84 100.13a28.749 28.749 0 0 1-0.12508-2.228"/>
+<path d="m419.55 31.424a12.866 12.866 0 0 1-6.1235-0.93466"/>
+<path d="m413.43 30.489a0.54543 0.54543 0 0 0 0.27491-1.0221"/>
+<path d="m413.71 29.467a28.749 28.749 0 0 0 5.8486 1.9568"/>
+<path d="m505.33 37.304a7.453 7.453 0 0 0 1.8792-0.25436"/>
+<path d="m507.21 37.05a0.16488 0.16488 0 0 0 0.1283 0.29454"/>
+<path d="m507.34 37.344a3.6319 3.6319 0 0 1-2.0075-0.04018"/>
+<path d="m428.62 10.822a12.866 12.866 0 0 1 1.2856 2.0711"/>
+<path d="m429.9 12.893a14.714 14.714 0 0 1-1.702-1.8193"/>
+<path d="m428.2 11.074a0.24827 0.24827 0 0 0 0.41644-0.25173"/>
+<path d="m504.45 71.28a0.1352 0.1352 0 0 0-0.11472 0.22721"/>
+<path d="m504.34 71.507a42.784 42.784 0 0 0-5.7339-2.184"/>
+<path d="m498.61 69.323a28.749 28.749 0 0 1 5.8486 1.9568"/>
+<path d="m410.82 63.403a0.044327 0.044327 0 0 0-0.0185-0.0814"/>
+<path d="m410.8 63.322a3.2565 3.2565 0 0 1 2.026 0.12158"/>
+<path d="m412.83 63.443a3.6319 3.6319 0 0 0-2.0075-0.04018"/>
+<path d="m454.32 0.61504a0.046952 0.046952 0 0 0 0.0883-0.005222"/>
+<path d="m454.41 0.60982a14.714 14.714 0 0 1 0.0368 2.2333"/>
+<path d="m454.44 2.8431a28.749 28.749 0 0 0-0.12507-2.228"/>
+<path d="m434.62 8.7384a3.1372 3.1372 0 0 1-1.2933-1.1592"/>
+<path d="m433.33 7.5792a0.14627 0.14627 0 0 0 0.21777-0.18283"/>
+<path d="m433.55 7.3964a6.2589 6.2589 0 0 0 1.0756 1.342"/>
+<path d="m484.61 93.351a0.036065 0.036065 0 0 0-0.0596 0.03271"/>
+<path d="m484.55 93.384a8.542 8.542 0 0 0-1.016-1.3747"/>
+<path d="m483.54 92.009a6.259 6.259 0 0 1 1.0756 1.342"/>
+<path d="m485.11 16.499-52.06 67.75"/>
+<path d="m433.05 84.249a26.134 26.134 0 0 0-16.82-33.875"/>
+<path d="m416.23 50.374a103.01 103.01 0 0 0 68.88-33.875"/>
+<path d="m498.61 69.323a28.749 28.749 0 0 0-34.89 28.581"/>
+<path d="m463.72 97.904a10.201 10.201 0 0 0-17.031-3.8106"/>
+<path d="m446.68 94.094a42.784 42.784 0 0 1 51.921-24.77"/>
+<path d="m446.68 94.094a5.2173 5.2173 0 0 0-8.0248 1.8137"/>
+<path d="m438.66 95.907a0.34208 0.34208 0 0 0-0.56858-0.29907"/>
+<path d="m438.09 95.608a5.4135 5.4135 0 0 1 8.5934-1.5147"/>
+<path d="m419.05 75.08a3.4769 3.4769 0 0 1 0.45611 5.733"/>
+<path d="m419.5 80.813a0.22366 0.22366 0 0 0-0.25102-0.33801"/>
+<path d="m419.25 80.475a3.3465 3.3465 0 0 0-0.20509-5.395"/>
+<path d="m412.83 63.443a3.6319 3.6319 0 0 1 0.50649 6.7397"/>
+<path d="m413.33 70.183a0.44063 0.44063 0 0 0-0.32905-0.76009"/>
+<path d="m413.01 69.423a3.2565 3.2565 0 0 0-0.17744-5.9796"/>
+<path d="m454.44 2.8431a28.749 28.749 0 0 1-34.89 28.581"/>
+<path d="m419.55 31.424a12.866 12.866 0 0 0 10.347-18.531"/>
+<path d="m429.9 12.893a14.714 14.714 0 0 0 24.543-10.05"/>
+<path d="m479.5 4.8399a5.2173 5.2173 0 0 1-8.0248 1.8137"/>
+<path d="m471.47 6.6536a4.8107 4.8107 0 0 0 6.1181-2.3906"/>
+<path d="m477.59 4.263a1.0213 1.0213 0 0 0 1.9066 0.57688"/>
+<path d="m498.66 19.934a3.4769 3.4769 0 0 0 0.45611 5.733"/>
+<path d="m499.11 25.667a4.4123 4.4123 0 0 1-2.391-7.2291"/>
+<path d="m496.72 18.438a1.2854 1.2854 0 0 0 1.9348 1.4961"/>
+<path d="m504.82 30.564a3.6319 3.6319 0 0 0 0.5065 6.7397"/>
+<path d="m505.33 37.304a7.453 7.453 0 0 1-6.2195-11.637"/>
+<path d="m499.11 25.667a4.2614 4.2614 0 0 0 5.713 4.8974"/>
+<path d="m483.54 92.009a6.259 6.259 0 0 0-10.431 5.8043"/>
+<path d="m473.1 97.813a2.427 2.427 0 0 0-4.4237 0.42142"/>
+<path d="m468.68 98.235a8.542 8.542 0 0 1 14.855-6.2258"/>
+<path d="m480.47 5.3615a1.7048 1.7048 0 0 0 2.8346 1.7587"/>
+<path d="m483.3 7.1202a7.9236 7.9236 0 0 0 1.8059 9.3784"/>
+<path d="m485.11 16.499a8.2626 8.2626 0 0 1-4.6406-11.137"/>
+<path d="m416.23 50.374a7.9421 7.9421 0 0 0-6.1118-9.5239"/>
+<path d="m410.12 40.85a0.41931 0.41931 0 0 0 0.1964-0.76233"/>
+<path d="m410.31 40.087a8.1066 8.1066 0 0 1 5.9154 10.286"/>
+<path d="m421.34 20.075a1.9315 1.9315 0 0 1-3.002 1.3873"/>
+<path d="m418.34 21.462a0.1338 0.1338 0 0 0 0.1486-0.20355"/>
+<path d="m418.49 21.259a1.8469 1.8469 0 0 0 2.8534-1.1838"/>
+<path d="m501.93 50.374a7.9421 7.9421 0 0 1 6.696-6.1206"/>
+<path d="m508.63 44.253a0.24867 0.24867 0 0 0 0.0439 0.46585"/>
+<path d="m508.67 44.719a8.1066 8.1066 0 0 0-6.7399 5.6547"/>
+<path d="m445.06 2.934a6.259 6.259 0 0 1-10.431 5.8043"/>
+<path d="m434.62 8.7384a3.1372 3.1372 0 0 0 4.4239-3.5226"/>
+<path d="m439.05 5.2157a3.3061 3.3061 0 0 0 6.0076-2.2817"/>
+<path d="m508.04 59.897a7.9421 7.9421 0 0 1-6.1118-9.5239"/>
+<path d="m501.93 50.374a7.7744 7.7744 0 0 0 6.2428 6.9702"/>
+<path d="m508.17 57.344a1.314 1.314 0 0 0-0.131 2.5537"/>
+<path d="m499.82 79.285a1.9315 1.9315 0 0 0-3.002 1.3873"/>
+<path d="m496.82 80.673a2.5378 2.5378 0 0 1 3.5375-2.8073"/>
+<path d="m500.36 77.865a0.79698 0.79698 0 0 0-0.53554 1.4199"/>
+<path d="m409.53 56.494a7.9421 7.9421 0 0 0 6.696-6.1206"/>
+<path d="m416.23 50.374a7.7744 7.7744 0 0 1-5.9718 8.2265"/>
+<path d="m410.26 58.6a1.1571 1.1571 0 0 0-0.72418-2.1059"/>
+<path d="m495.71 84.303a1.5699 1.5699 0 0 0-2.5457 1.5456"/>
+<path d="m493.17 85.849a3.4784 3.4784 0 0 1 3.6531-5.1763"/>
+<path d="m496.82 80.673a2.1436 2.1436 0 0 0-1.1075 3.6306"/>
+<path d="m424.3 86.166a1.3787 1.3787 0 0 0-1.5566-2.1759"/>
+<path d="m422.74 83.99a7.9236 7.9236 0 0 1 10.31 0.25885"/>
+<path d="m433.05 84.249a8.2626 8.2626 0 0 0-8.7534 1.9171"/>
+<path d="m507.69 61.19a1.9196 1.9196 0 0 0-1.1991 3.5596"/>
+<path d="m506.5 64.75a6.6786 6.6786 0 0 0-7.8906 4.5734"/>
+<path d="m498.61 69.323a7.6469 7.6469 0 0 1 9.0897-8.133"/>
+<path d="m417.24 77.704a0.32404 0.32404 0 0 0-0.28602-0.5678"/>
+<path d="m416.96 77.136a7.453 7.453 0 0 0 2.0918-2.0555"/>
+<path d="m419.05 75.08a4.2614 4.2614 0 0 1-1.8058 2.6233"/>
+<path d="m411.41 65.392a0.26409 0.26409 0 0 0-0.10567-0.50798"/>
+<path d="m411.31 64.884a2.4905 2.4905 0 0 0 1.5213-1.4404"/>
+<path d="m412.83 63.443a2.0554 2.0554 0 0 1-1.4156 1.9484"/>
+<path d="m451.4 1.0115a0.46012 0.46012 0 0 0 0.90262-0.058431"/>
+<path d="m452.3 0.9531a2.3258 2.3258 0 0 0 2.143 1.89"/>
+<path d="m454.44 2.8431a2.3521 2.3521 0 0 1-3.0456-1.8315"/>
+<path d="m429.9 12.893a2.5861 2.5861 0 0 0 0.82168-3.6572"/>
+<path d="m430.72 9.2362a0.12452 0.12452 0 0 0 0.19965-0.12255"/>
+<path d="m430.92 9.1137a2.6185 2.6185 0 0 1-1.0213 3.7798"/>
+<path d="m499.11 25.667a3.4769 3.4769 0 0 0 3.4161 0.01377"/>
+<path d="m502.53 25.681a0.085959 0.085959 0 0 0 0.0736 0.14411"/>
+<path d="m502.6 25.825a3.3465 3.3465 0 0 1-3.4897-0.15789"/>
+<path d="m488.26 87.854a2.5861 2.5861 0 0 1 3.2759 0.51834"/>
+<path d="m491.53 88.372a0.090092 0.090092 0 0 0-0.13173 0.107"/>
+<path d="m491.4 88.479a2.6185 2.6185 0 0 0-3.1442-0.62534"/>
+<path d="m471.47 6.6536a5.2173 5.2173 0 0 1-1.8025-5.1021"/>
+<path d="m469.67 1.5515a0.13566 0.13566 0 0 0 0.24798 0.061277"/>
+<path d="m469.92 1.6128a5.4135 5.4135 0 0 0 1.5545 5.0408"/>
+<path d="m487.44 91.511a2.5861 2.5861 0 0 1 0.82169-3.6572"/>
+<path d="m488.26 87.854a2.6113 2.6113 0 0 0-0.2431 3.1399"/>
+<path d="m488.02 90.994a0.39736 0.39736 0 0 0-0.57859 0.51731"/>
+<path d="m415.63 75.067a3.4769 3.4769 0 0 1 3.4161 0.01378"/>
+<path d="m419.05 75.08a4.4123 4.4123 0 0 0-3.0561 0.45303"/>
+<path d="m415.99 75.533a0.30231 0.30231 0 0 0-0.35998-0.46681"/>
+<path d="m448.49 99.196a5.2173 5.2173 0 0 0-1.8025-5.1021"/>
+<path d="m446.68 94.094a4.8107 4.8107 0 0 1 2.9857 5.1278"/>
+<path d="m449.67 99.221a0.61245 0.61245 0 0 0-1.1833-0.0257"/>
+<path d="m426.62 12.375a2.5861 2.5861 0 0 0 3.2759 0.51834"/>
+<path d="m429.9 12.893a2.6113 2.6113 0 0 1-3.7857 0.13156"/>
+<path d="m426.12 13.025a0.42789 0.42789 0 0 0 0.50981-0.6499"/>
+<path d="m462.09 100.25a0.437 0.437 0 0 0-0.84663-0.0882"/>
+<path d="m461.25 100.17a2.3258 2.3258 0 0 1 2.4674-2.262"/>
+<path d="m463.72 97.904a2.3521 2.3521 0 0 0-1.6208 2.3501"/>
+<path d="m415.8 25.458a0.95847 0.95847 0 0 0 1.1812-1.4444"/>
+<path d="m416.99 24.014a6.6786 6.6786 0 0 1 2.5679 7.4102"/>
+<path d="m419.55 31.424a7.6469 7.6469 0 0 0-3.7491-5.9658"/>
+<path d="m472.97 2.3777a0.47303 0.47303 0 0 0 0.84757 0.37214"/>
+<path d="m473.81 2.7498a10.201 10.201 0 0 1-2.338 3.9038"/>
+<path d="m471.47 6.6536a42.784 42.784 0 0 0 1.4905-4.2759"/>
+<path d="m507.8 39.322a0.71631 0.71631 0 0 0 0.0343 1.3858"/>
+<path d="m507.84 40.708a2.4905 2.4905 0 0 1-2.5045-3.4039"/>
+<path d="m505.33 37.304a2.0554 2.0554 0 0 0 2.4702 2.0181"/>
+<path d="m487.1 91.717a0.55364 0.55364 0 0 0-0.94554 0.54083"/>
+<path d="m486.15 92.258a1.7807 1.7807 0 0 0-2.6158-0.24887"/>
+<path d="m483.54 92.009a2.0849 2.0849 0 0 1 3.5613-0.29196"/>
+<path d="m419.64 19.669a0.17711 0.17711 0 0 0 0.2419-0.24983"/>
+<path d="m419.88 19.419a3.4784 3.4784 0 0 0 1.4626 0.65533"/>
+<path d="m421.34 20.075a2.1436 2.1436 0 0 1-1.7045-0.4055"/>
+<path d="m509.02 50.084a0.74787 0.74787 0 0 0-0.18681 1.4505"/>
+<path d="m508.83 51.535a26.134 26.134 0 0 1-6.9046-1.1609"/>
+<path d="m501.93 50.374a103.01 103.01 0 0 1 7.0914-0.28961"/>
+<path d="m496.82 80.673a1.9315 1.9315 0 0 0 0.67376 1.6883"/>
+<path d="m497.49 82.361a0.044192 0.044192 0 0 0-0.056 0.06158"/>
+<path d="m497.44 82.422a1.8469 1.8469 0 0 1-0.61779-1.7499"/>
+<path d="m433.05 84.249-4.4057 5.7335"/>
+<path d="m428.64 89.982a0.16007 0.16007 0 0 0-0.23178-0.1925"/>
+<path d="m428.41 89.79a103.01 103.01 0 0 1 4.6375-5.541"/>
+<path d="m420.67 18.386a1.9315 1.9315 0 0 1 0.67376 1.6883"/>
+<path d="m421.34 20.075a2.5378 2.5378 0 0 0-0.83502-1.4287"/>
+<path d="m420.51 18.646a0.15668 0.15668 0 0 0 0.16126-0.25966"/>
+<path d="m489.52 10.765-4.4057 5.7335"/>
+<path d="m485.11 16.499a26.134 26.134 0 0 1 3.3244-6.3086"/>
+<path d="m488.43 10.19a0.63094 0.63094 0 0 0 1.0814 0.57509"/>
+<path d="m434.58 6.8063a0.24588 0.24588 0 0 0 0.44875-0.17111"/>
+<path d="m435.03 6.6352a1.7807 1.7807 0 0 1-0.40576 2.1032"/>
+<path d="m434.62 8.7384a2.0849 2.0849 0 0 0-0.043-1.9321"/>
+<path d="m489.96 89.673a0.24827 0.24827 0 0 0-0.41644 0.25172"/>
+<path d="m489.54 89.925a12.866 12.866 0 0 1-1.2856-2.0711"/>
+<path d="m488.26 87.854a14.714 14.714 0 0 1 1.702 1.8193"/>
+<path d="m463.72 97.904a28.749 28.749 0 0 0 0.12508 2.228"/>
+<path d="m463.84 100.13a0.046952 0.046952 0 0 0-0.0883 5e-3"/>
+<path d="m463.75 100.14a14.714 14.714 0 0 1-0.0368-2.2333"/>
+<path d="m419.55 31.424a28.749 28.749 0 0 1-5.8486-1.9568"/>
+<path d="m413.71 29.467a0.1352 0.1352 0 0 0 0.11472-0.22721"/>
+<path d="m413.82 29.24a42.784 42.784 0 0 0 5.7339 2.184"/>
+<path d="m505.33 37.304a3.6319 3.6319 0 0 0 2.0075 0.04018"/>
+<path d="m507.34 37.344a0.044327 0.044327 0 0 0 0.0185 0.0814"/>
+<path d="m507.36 37.426a3.2565 3.2565 0 0 1-2.026-0.12158"/>
+<path d="m504.45 71.28a28.749 28.749 0 0 0-5.8486-1.9568"/>
+<path d="m498.61 69.323a12.866 12.866 0 0 1 6.1235 0.93466"/>
+<path d="m504.73 70.258a0.54543 0.54543 0 0 0-0.27491 1.0221"/>
+<path d="m410.82 63.403a3.6319 3.6319 0 0 1 2.0075 0.04018"/>
+<path d="m412.83 63.443a7.453 7.453 0 0 0-1.8792 0.25436"/>
+<path d="m410.95 63.698a0.16488 0.16488 0 0 0-0.1283-0.29454"/>
+<path d="m454.32 0.61504a28.749 28.749 0 0 1 0.12507 2.228"/>
+<path d="m454.44 2.8431a10.201 10.201 0 0 1-0.47103-2.139"/>
+<path d="m453.97 0.70403a0.1836 0.1836 0 0 0 0.34596-0.088989"/>
+<path d="m434.62 8.7384a6.259 6.259 0 0 1-1.0756-1.342"/>
+<path d="m433.55 7.3964a0.036065 0.036065 0 0 0 0.0596-0.03272"/>
+<path d="m433.61 7.3636a8.542 8.542 0 0 0 1.016 1.3747"/>
+<path d="m484.61 93.351a6.2589 6.2589 0 0 0-1.0756-1.342"/>
+<path d="m483.54 92.009a3.1372 3.1372 0 0 1 1.2933 1.1592"/>
+<path d="m484.83 93.168a0.14627 0.14627 0 0 0-0.21776 0.18283"/>
+<path d="m433.05 84.249a103.01 103.01 0 0 1 68.88-33.875"/>
+<path d="m501.93 50.374a13.557 13.557 0 0 0-3.3244 18.95"/>
+<path d="m498.61 69.323a62.736 62.736 0 0 0-65.556 14.925"/>
+<path d="m463.72 97.904a14.714 14.714 0 0 1 24.543-10.05"/>
+<path d="m488.26 87.854a3.9456 3.9456 0 0 0-4.7227 4.1551"/>
+<path d="m483.54 92.009a11.216 11.216 0 0 0-19.82 5.8953"/>
+<path d="m413.33 70.183a4.2614 4.2614 0 0 1 5.713 4.8974"/>
+<path d="m419.05 75.08a3.1408 3.1408 0 0 0-3.7882-2.0699"/>
+<path d="m415.26 73.01a1.7764 1.7764 0 0 0-1.9248-2.8275"/>
+<path d="m419.55 31.424a42.784 42.784 0 0 0 51.921-24.77"/>
+<path d="m471.47 6.6536a11.713 11.713 0 0 0 13.635 9.845"/>
+<path d="m485.11 16.499a62.736 62.736 0 0 1-65.556 14.925"/>
+<path d="m471.47 6.6536a5.4135 5.4135 0 0 0 8.5934-1.5147"/>
+<path d="m480.07 5.139a0.27427 0.27427 0 0 0 0.40108 0.22257"/>
+<path d="m480.47 5.3615a5.566 5.566 0 0 1-8.9944 1.2921"/>
+<path d="m499.11 25.667a3.3465 3.3465 0 0 1-0.20509-5.395"/>
+<path d="m498.91 20.272a0.14652 0.14652 0 0 0 0.14453 0.19896"/>
+<path d="m499.05 20.471a3.2774 3.2774 0 0 0 0.0606 5.196"/>
+<path d="m505.33 37.304a3.2565 3.2565 0 0 1-0.17744-5.9797"/>
+<path d="m505.15 31.324a0.2633 0.2633 0 0 0 0.16877 0.40786"/>
+<path d="m505.32 31.732a3.062 3.062 0 0 0 9e-3 5.5718"/>
+<path d="m422.45 16.444a2.1436 2.1436 0 0 1-1.1075 3.6306"/>
+<path d="m421.34 20.075a1.655 1.655 0 0 0 0.22493-2.2464"/>
+<path d="m421.57 17.828a0.84971 0.84971 0 0 0 0.88253-1.3842"/>
+<path d="m493.86 14.582a8.2626 8.2626 0 0 1-8.7534 1.9171"/>
+<path d="m485.11 16.499a11.713 11.713 0 0 0 6.2638-3.2769"/>
+<path d="m491.37 13.222a1.5001 1.5001 0 0 0 2.4896 1.3599"/>
+<path d="m437.69 95.386a8.2626 8.2626 0 0 0-4.6406-11.137"/>
+<path d="m433.05 84.249a11.713 11.713 0 0 1 13.635 9.845"/>
+<path d="m446.68 94.094a5.566 5.566 0 0 0-8.9944 1.2921"/>
+<path d="m419.11 80.276a1.0962 1.0962 0 0 0-0.94082-1.9004"/>
+<path d="m418.17 78.376a3.1407 3.1407 0 0 0 0.88026-3.2956"/>
+<path d="m419.05 75.08a3.2774 3.2774 0 0 1 0.0606 5.196"/>
+<path d="m412.84 69.015a1.4809 1.4809 0 0 0-0.70548-2.7951"/>
+<path d="m412.13 66.22a2.0427 2.0427 0 0 0 0.69681-2.7767"/>
+<path d="m412.83 63.443a3.062 3.062 0 0 1 9e-3 5.5718"/>
+<path d="m434.62 8.7384a8.542 8.542 0 0 0 14.855-6.2258"/>
+<path d="m449.48 2.5126a3.1407 3.1407 0 0 0 4.965 0.33045"/>
+<path d="m454.44 2.8431a11.216 11.216 0 0 1-19.82 5.8953"/>
+<path d="m501.93 50.374a8.1066 8.1066 0 0 0 5.9154 10.286"/>
+<path d="m507.84 60.66a0.32968 0.32968 0 0 0-0.15009 0.53039"/>
+<path d="m507.69 61.19a8.2424 8.2424 0 0 1-5.7653-10.817"/>
+<path d="m496.82 80.673a1.8469 1.8469 0 0 1 2.8534-1.1838"/>
+<path d="m499.67 79.489a0.086967 0.086967 0 0 0-0.087 0.1173"/>
+<path d="m499.58 79.606a1.8016 1.8016 0 0 0-2.7664 1.0665"/>
+<path d="m416.23 50.374a8.1066 8.1066 0 0 1-6.7399 5.6547"/>
+<path d="m409.49 56.028a0.17164 0.17164 0 0 0-0.0234-0.28695"/>
+<path d="m409.47 55.741a8.2424 8.2424 0 0 0 6.7634-5.3678"/>
+<path d="m502.35 75.289a7.6469 7.6469 0 0 1-3.7491-5.9658"/>
+<path d="m498.61 69.323a13.557 13.557 0 0 0 4.2676 3.9017"/>
+<path d="m502.87 73.225a1.1264 1.1264 0 0 0-0.51851 2.064"/>
+<path d="m445.19 98.37a42.784 42.784 0 0 1 1.4905-4.2759"/>
+<path d="m446.68 94.094a11.713 11.713 0 0 1-0.1578 4.234"/>
+<path d="m446.53 98.328a0.71323 0.71323 0 0 0-1.3327 0.04189"/>
+<path d="m410.36 61.425a2.0554 2.0554 0 0 1 2.4702 2.0181"/>
+<path d="m412.83 63.443a2.0427 2.0427 0 0 0-1.9896-0.99636"/>
+<path d="m410.84 62.447a0.58844 0.58844 0 0 0-0.4806-1.0217"/>
+<path d="m456.06 0.49293a2.3521 2.3521 0 0 1-1.6208 2.3501"/>
+<path d="m454.44 2.8431a3.1407 3.1407 0 0 0 0.78554-2.0849"/>
+<path d="m455.23 0.75821a0.45994 0.45994 0 0 0 0.83529-0.26528"/>
+<path d="m466.76 99.736a2.3521 2.3521 0 0 0-3.0456-1.8315"/>
+<path d="m463.72 97.904a3.1407 3.1407 0 0 1 4.965 0.33045"/>
+<path d="m468.68 98.235a1.4206 1.4206 0 0 0-1.9194 1.5011"/>
+<path d="m410.46 39.557a7.6469 7.6469 0 0 0 9.0897-8.133"/>
+<path d="m419.55 31.424a13.557 13.557 0 0 1-3.3244 18.95"/>
+<path d="m416.23 50.374a8.2424 8.2424 0 0 0-5.7653-10.817"/>
+<path d="m500.92 23.044a4.2614 4.2614 0 0 0-1.8058 2.6233"/>
+<path d="m499.11 25.667a3.1408 3.1408 0 0 1 0.88025-3.2956"/>
+<path d="m499.99 22.371a0.62288 0.62288 0 0 0 0.92552 0.67232"/>
+<path d="m506.75 35.356a2.0554 2.0554 0 0 0-1.4156 1.9484"/>
+<path d="m505.33 37.304a2.0427 2.0427 0 0 1 0.69681-2.7767"/>
+<path d="m506.03 34.527a0.60834 0.60834 0 0 0 0.71884 0.82836"/>
+<path d="m418.57 21.141a0.63262 0.63262 0 0 0 0.8748-0.86138"/>
+<path d="m419.45 20.28a1.655 1.655 0 0 0 1.8916-0.2051"/>
+<path d="m421.34 20.075a1.8016 1.8016 0 0 1-2.7664 1.0665"/>
+<path d="m508.69 45.006a1.5873 1.5873 0 0 0-0.39614 3.0068"/>
+<path d="m508.3 48.013a13.557 13.557 0 0 0-6.3672 2.3609"/>
+<path d="m501.93 50.374a8.2424 8.2424 0 0 1 6.7634-5.3678"/>
+<path d="m488.26 87.854a2.6185 2.6185 0 0 0-1.0213 3.7798"/>
+<path d="m487.24 91.634a0.097216 0.097216 0 0 0-0.14006 0.08333"/>
+<path d="m487.1 91.717a2.6482 2.6482 0 0 1 1.1614-3.8631"/>
+<path d="m419.05 75.08a3.3465 3.3465 0 0 0-3.4897-0.15789"/>
+<path d="m415.56 74.922a0.06474 0.06474 0 0 0-0.0484-0.09727"/>
+<path d="m415.51 74.825a3.2774 3.2774 0 0 1 3.5381 0.25516"/>
+<path d="m446.68 94.094a5.4135 5.4135 0 0 1 1.5545 5.0408"/>
+<path d="m448.24 99.134a0.094418 0.094418 0 0 0-0.15352-0.03944"/>
+<path d="m448.09 99.095a5.566 5.566 0 0 0-1.401-5.0014"/>
+<path d="m429.9 12.893a2.6185 2.6185 0 0 1-3.1442-0.62534"/>
+<path d="m426.76 12.268a0.061841 0.061841 0 0 0 0.0811-0.06488"/>
+<path d="m426.84 12.203a2.6482 2.6482 0 0 0 3.0631 0.69022"/>
+<path d="m483.58 93.941a2.0849 2.0849 0 0 1-0.043-1.9321"/>
+<path d="m483.54 92.009a3.9456 3.9456 0 0 0 0.44021 1.5425"/>
+<path d="m483.98 93.551a0.29316 0.29316 0 0 0-0.39723 0.38956"/>
+<path d="m409.14 50.663a103.01 103.01 0 0 0 7.0914-0.28961"/>
+<path d="m416.23 50.374a13.557 13.557 0 0 1-6.3672 2.3609"/>
+<path d="m409.86 52.735a1.1812 1.1812 0 0 0-0.72422-2.0713"/>
+<path d="m431.06 9.0303a2.0849 2.0849 0 0 0 3.5613-0.29196"/>
+<path d="m434.62 8.7384a3.9456 3.9456 0 0 1-4.7227 4.1551"/>
+<path d="m429.9 12.893a2.6482 2.6482 0 0 0 1.1614-3.8631"/>
+<path d="m502.65 25.922a0.99973 0.99973 0 0 0 0.25015 1.8147"/>
+<path d="m502.9 27.737a3.1408 3.1408 0 0 1-3.7882-2.0699"/>
+<path d="m499.11 25.667a3.2774 3.2774 0 0 0 3.5381 0.25515"/>
+<path d="m498.52 81.078a2.1436 2.1436 0 0 0-1.7045-0.4055"/>
+<path d="m496.82 80.673a1.655 1.655 0 0 1 1.8915-0.2051"/>
+<path d="m498.71 80.467a0.34768 0.34768 0 0 0-0.18704 0.6106"/>
+<path d="m491.32 88.544a0.55797 0.55797 0 0 0-0.94842 0.50308"/>
+<path d="m490.37 89.047a3.9456 3.9456 0 0 0-2.1146-1.1933"/>
+<path d="m488.26 87.854a2.6482 2.6482 0 0 1 3.0631 0.69022"/>
+<path d="m470.07 1.6523a0.90783 0.90783 0 0 0 1.5588 0.76735"/>
+<path d="m471.63 2.4196a11.713 11.713 0 0 0-0.1578 4.234"/>
+<path d="m471.47 6.6536a5.566 5.566 0 0 1-1.401-5.0014"/>
+<path d="m421.34 20.075a1.8469 1.8469 0 0 0-0.61779-1.7499"/>
+<path d="m420.72 18.325a0.033189 0.033189 0 0 0 0.0378-0.04087"/>
+<path d="m420.76 18.284a1.8016 1.8016 0 0 1 0.57995 1.7908"/>
+<path d="m485.11 16.499a103.01 103.01 0 0 0 4.6375-5.541"/>
+<path d="m489.75 10.958a0.11603 0.11603 0 0 0 0.14833 0.12607"/>
+<path d="m489.9 11.084a62.736 62.736 0 0 1-4.7858 5.415"/>
+<path d="m428.2 11.074a14.714 14.714 0 0 0 1.702 1.8193"/>
+<path d="m429.9 12.893a3.9456 3.9456 0 0 1-2.1146-1.1933"/>
+<path d="m427.79 11.7a0.40214 0.40214 0 0 0 0.41265-0.62603"/>
+<path d="m497.4 82.463a0.5015 0.5015 0 0 0-0.80487 0.45561"/>
+<path d="m496.59 82.919a1.655 1.655 0 0 1 0.22493-2.2464"/>
+<path d="m496.82 80.673a1.8016 1.8016 0 0 0 0.57994 1.7908"/>
+<path d="m428.26 89.664a1.3831 1.3831 0 0 0-1.478-2.138"/>
+<path d="m426.79 87.526a11.713 11.713 0 0 1 6.2638-3.2769"/>
+<path d="m433.05 84.249a62.736 62.736 0 0 0-4.7858 5.4149"/>
+<path d="m498.61 69.323a42.784 42.784 0 0 1 5.7339 2.184"/>
+<path d="m504.34 71.507a0.097286 0.097286 0 0 0-0.0751 0.14497"/>
+<path d="m504.26 71.652a62.736 62.736 0 0 0-5.6588-2.329"/>
+<path d="m412.83 63.443a3.2565 3.2565 0 0 0-2.026-0.12158"/>
+<path d="m410.8 63.322a0.032743 0.032743 0 0 0-0.0117-0.0537"/>
+<path d="m410.79 63.268a3.062 3.062 0 0 1 2.0378 0.17528"/>
+<path d="m454.44 2.8431a14.714 14.714 0 0 0-0.0368-2.2333"/>
+<path d="m454.41 0.60982a0.034121 0.034121 0 0 0 0.0572-0.002926"/>
+<path d="m454.46 0.60689a11.216 11.216 0 0 1-0.02043 2.2362"/>
+<path d="m463.69 100.14a0.41298 0.41298 0 0 0-0.76511-0.15132"/>
+<path d="m462.93 99.989a3.1407 3.1407 0 0 1 0.78553-2.0849"/>
+<path d="m463.72 97.904a11.216 11.216 0 0 0-0.0204 2.2362"/>
+<path d="m413.9 29.095a1.1115 1.1115 0 0 0 1.3912-1.5728"/>
+<path d="m415.29 27.522a13.557 13.557 0 0 1 4.2676 3.9017"/>
+<path d="m419.55 31.424a62.736 62.736 0 0 1-5.6588-2.329"/>
+<path d="m507.37 37.479a0.43987 0.43987 0 0 0-0.0481 0.82109"/>
+<path d="m507.32 38.3a2.0427 2.0427 0 0 1-1.9896-0.99636"/>
+<path d="m505.33 37.304a3.062 3.062 0 0 0 2.0378 0.17528"/>
+<path d="m483.54 92.009a8.542 8.542 0 0 1 1.016 1.3747"/>
+<path d="m484.55 93.384-0.0383 0.02068"/>
+<path d="m484.51 93.404a11.216 11.216 0 0 0-0.97772-1.3954"/>
+<path d="m433.65 7.343a0.2933 0.2933 0 0 0 0.5375-0.14713"/>
+<path d="m434.18 7.1958a3.9456 3.9456 0 0 1 0.44023 1.5426"/>
+<path d="m434.62 8.7384a11.216 11.216 0 0 1-0.97773-1.3954"/>
+<path d="m416.23 50.374a26.134 26.134 0 0 1 16.82 33.875"/>
+<path d="m433.05 84.249a11.098 11.098 0 0 0-14.002-9.1683"/>
+<path d="m419.05 75.08a15.476 15.476 0 0 0-2.8182-24.707"/>
+<path d="m446.68 94.094a10.201 10.201 0 0 1 17.031 3.8106"/>
+<path d="m463.72 97.904a3.5149 3.5149 0 0 0-5.7317 1.3515"/>
+<path d="m457.98 99.256a7.3278 7.3278 0 0 0-11.299-5.1621"/>
+<path d="m429.9 12.893a12.866 12.866 0 0 1-10.347 18.531"/>
+<path d="m419.55 31.424a7.7285 7.7285 0 0 0 1.787-11.349"/>
+<path d="m421.34 20.075a6.2369 6.2369 0 0 0 8.56-7.1813"/>
+<path d="m477.59 4.263a4.8107 4.8107 0 0 1-6.1181 2.3906"/>
+<path d="m471.47 6.6536a5.1577 5.1577 0 0 0 4.1583-3.0138"/>
+<path d="m475.63 3.6398a1.0996 1.0996 0 0 0 1.9598 0.62318"/>
+<path d="m496.72 18.438a4.4123 4.4123 0 0 0 2.391 7.2291"/>
+<path d="m499.11 25.667a11.098 11.098 0 0 1-14.002-9.1683"/>
+<path d="m485.11 16.499a8.2732 8.2732 0 0 0 11.611 1.9392"/>
+<path d="m499.11 25.667a7.453 7.453 0 0 0 6.2195 11.637"/>
+<path d="m505.33 37.304a9.1991 9.1991 0 0 0-3.4013 13.07"/>
+<path d="m501.93 50.374a15.476 15.476 0 0 1-2.8182-24.707"/>
+<path d="m485.11 16.499a7.9236 7.9236 0 0 1-1.8059-9.3784"/>
+<path d="m483.3 7.1202a0.83201 0.83201 0 0 0 1.2989 0.66481"/>
+<path d="m484.6 7.785a8.2732 8.2732 0 0 0 0.50697 8.7136"/>
+<path d="m439.05 5.2157a3.1372 3.1372 0 0 1-4.4239 3.5226"/>
+<path d="m434.62 8.7384a1.9833 1.9833 0 0 0 1.8428-2.5102"/>
+<path d="m436.47 6.2281a1.4884 1.4884 0 0 0 2.581-1.0124"/>
+<path d="m508.17 57.344a7.7744 7.7744 0 0 1-6.2428-6.9702"/>
+<path d="m501.93 50.374a9.1991 9.1991 0 0 0 6.372 4.1345"/>
+<path d="m508.3 54.508a1.5238 1.5238 0 0 0-0.12913 2.8357"/>
+<path d="m500.36 77.865a2.5378 2.5378 0 0 0-3.5375 2.8073"/>
+<path d="m496.82 80.673a7.7285 7.7285 0 0 1 1.787-11.349"/>
+<path d="m498.61 69.323a6.6167 6.6167 0 0 0 1.7505 8.5421"/>
+<path d="m443.79 97.814a0.7874 0.7874 0 0 0-1.2675-0.70683"/>
+<path d="m442.53 97.107a5.1577 5.1577 0 0 1 4.1583-3.0138"/>
+<path d="m446.68 94.094a7.3278 7.3278 0 0 0-2.8909 3.7206"/>
+<path d="m410.26 58.6a7.7744 7.7744 0 0 0 5.9718-8.2265"/>
+<path d="m416.23 50.374a9.1991 9.1991 0 0 1-3.4013 13.07"/>
+<path d="m412.83 63.443a3.0922 3.0922 0 0 0-2.5705-4.8431"/>
+<path d="m457.61 0.60683a1.5456 1.5456 0 0 0 2.566 0.8847"/>
+<path d="m460.18 1.4915a3.5149 3.5149 0 0 1-5.7317 1.3515"/>
+<path d="m454.44 2.8431a2.4748 2.4748 0 0 0 3.1658-2.2362"/>
+<path d="m496.82 80.673a3.4784 3.4784 0 0 0-3.6531 5.1763"/>
+<path d="m493.17 85.849a3.274 3.274 0 0 0-4.9068 2.005"/>
+<path d="m488.26 87.854a6.2369 6.2369 0 0 1 8.56-7.1813"/>
+<path d="m433.05 84.249a7.9236 7.9236 0 0 0-10.31-0.25885"/>
+<path d="m422.74 83.99a1.2173 1.2173 0 0 0-1.3009-1.6803"/>
+<path d="m421.44 82.309a8.2732 8.2732 0 0 1 11.611 1.9392"/>
+<path d="m460.18 1.4915a3.0412 3.0412 0 0 0 5.6002 0.2494"/>
+<path d="m465.78 1.7409a5.1577 5.1577 0 0 0 5.699 4.9127"/>
+<path d="m471.47 6.6536a7.3279 7.3279 0 0 1-11.299-5.1621"/>
+<path d="m498.61 69.323a6.6786 6.6786 0 0 1 7.8906-4.5734"/>
+<path d="m506.5 64.75a0.86499 0.86499 0 0 0-0.36712 1.4702"/>
+<path d="m506.13 66.22a6.6167 6.6167 0 0 0-7.5235 3.1031"/>
+<path d="m419.05 75.08a7.453 7.453 0 0 1-2.0918 2.0555"/>
+<path d="m416.96 77.136a0.19701 0.19701 0 0 0-0.1895-0.29195"/>
+<path d="m416.77 76.844a15.476 15.476 0 0 0 2.2813-1.7636"/>
+<path d="m412.83 63.443a2.4905 2.4905 0 0 1-1.5213 1.4404"/>
+<path d="m411.31 64.884a0.14736 0.14736 0 0 0-0.0822-0.24706"/>
+<path d="m411.22 64.637a3.0922 3.0922 0 0 0 1.6036-1.1933"/>
+<path d="m454.44 2.8431a2.3258 2.3258 0 0 1-2.143-1.89"/>
+<path d="m452.3 0.9531a0.22912 0.22912 0 0 0 0.39759-0.072783"/>
+<path d="m452.7 0.88032a2.4748 2.4748 0 0 0 1.7454 1.9628"/>
+<path d="m488.02 90.994a2.6113 2.6113 0 0 1 0.2431-3.1399"/>
+<path d="m488.26 87.854a3.274 3.274 0 0 0 0.43809 2.5653"/>
+<path d="m488.7 90.419a0.47505 0.47505 0 0 0-0.68119 0.57464"/>
+<path d="m415.99 75.533a4.4123 4.4123 0 0 1 3.0561-0.45303"/>
+<path d="m419.05 75.08a11.098 11.098 0 0 0-2.5772 1.0924"/>
+<path d="m416.47 76.173a0.42701 0.42701 0 0 0-0.47894-0.63937"/>
+<path d="m482.81 94.267a0.63158 0.63158 0 0 0-1.116 0.25209"/>
+<path d="m481.69 94.519a1.9833 1.9833 0 0 1 1.8428-2.5102"/>
+<path d="m483.54 92.009a1.7442 1.7442 0 0 0-0.7268 2.2581"/>
+<path d="m409.36 48.32a1.1618 1.1618 0 0 0 0.49654-2.0811"/>
+<path d="m409.86 46.239a9.1991 9.1991 0 0 1 6.372 4.1345"/>
+<path d="m416.23 50.374a15.476 15.476 0 0 0-6.8685-2.0534"/>
+<path d="m449.67 99.221a4.8107 4.8107 0 0 0-2.9857-5.1278"/>
+<path d="m446.68 94.094a5.1577 5.1577 0 0 1 5.699 4.9127"/>
+<path d="m452.38 99.006a1.5039 1.5039 0 0 0-2.7132 0.21511"/>
+<path d="m426.12 13.025a2.6113 2.6113 0 0 0 3.7857-0.13156"/>
+<path d="m429.9 12.893a3.274 3.274 0 0 1-4.9068 2.005"/>
+<path d="m424.99 14.898a1.2188 1.2188 0 0 0 1.1211-1.8734"/>
+<path d="m463.72 97.904a2.3258 2.3258 0 0 0-2.4674 2.262"/>
+<path d="m461.25 100.17a0.39731 0.39731 0 0 0-0.69829-0.0257"/>
+<path d="m460.55 100.14a2.4748 2.4748 0 0 1 3.1657-2.2362"/>
+<path d="m419.55 31.424a6.6786 6.6786 0 0 0-2.5679-7.4102"/>
+<path d="m416.99 24.014a0.7958 0.7958 0 0 0 0.81743-1.1319"/>
+<path d="m417.8 22.882a6.6167 6.6167 0 0 1 1.7505 8.5421"/>
+<path d="m471.47 6.6536a10.201 10.201 0 0 0 2.338-3.9038"/>
+<path d="m473.81 2.7498a0.33007 0.33007 0 0 0 0.55283 0.18316"/>
+<path d="m474.37 2.933a7.3278 7.3278 0 0 1-2.8909 3.7206"/>
+<path d="m505.33 37.304a2.4905 2.4905 0 0 0 2.5045 3.4039"/>
+<path d="m507.84 40.708a0.82805 0.82805 0 0 0 0.0659 1.4392"/>
+<path d="m507.9 42.147a3.0922 3.0922 0 0 1-2.5705-4.8431"/>
+<path d="m433.56 92.962a1.3342 1.3342 0 0 0-1.9779-1.5012"/>
+<path d="m431.58 91.461a11.098 11.098 0 0 0 1.4709-7.2124"/>
+<path d="m433.05 84.249a8.2732 8.2732 0 0 1 0.50696 8.7136"/>
+<path d="m483.54 92.009a1.7807 1.7807 0 0 1 2.6158 0.24887"/>
+<path d="m486.15 92.258a0.24341 0.24341 0 0 0-0.34444 0.25549"/>
+<path d="m485.81 92.513a1.7442 1.7442 0 0 0-2.2713-0.50436"/>
+<path d="m421.34 20.075a3.4784 3.4784 0 0 1-1.4626-0.65533"/>
+<path d="m419.88 19.419a0.10655 0.10655 0 0 0 0.11476-0.1494"/>
+<path d="m419.99 19.27a6.2369 6.2369 0 0 0 1.3478 0.80473"/>
+<path d="m501.93 50.374a26.134 26.134 0 0 0 6.9046 1.1609"/>
+<path d="m508.83 51.535a0.50704 0.50704 0 0 0-0.0361 0.89248"/>
+<path d="m508.8 52.427a15.476 15.476 0 0 1-6.8685-2.0534"/>
+<path d="m420.51 18.646a2.5378 2.5378 0 0 1 0.83502 1.4287"/>
+<path d="m421.34 20.075a7.7285 7.7285 0 0 0-1.0636-1.0755"/>
+<path d="m420.28 18.999a0.22461 0.22461 0 0 0 0.2286-0.35311"/>
+<path d="m488.43 10.19a26.134 26.134 0 0 0-3.3244 6.3086"/>
+<path d="m485.11 16.499a11.098 11.098 0 0 1 1.4709-7.2124"/>
+<path d="m486.58 9.2862a1.1154 1.1154 0 0 0 1.8534 0.90382"/>
+<path d="m428.85 10.645a0.37264 0.37264 0 0 0 0.6138-0.31727"/>
+<path d="m429.46 10.328a3.274 3.274 0 0 1 0.43809 2.5653"/>
+<path d="m429.9 12.893a6.2369 6.2369 0 0 0-1.0519-2.248"/>
+<path d="m501.39 23.903a0.3938 0.3938 0 0 0 0.2959 0.67116"/>
+<path d="m501.69 24.575a11.098 11.098 0 0 1-2.5772 1.0924"/>
+<path d="m499.11 25.667a15.476 15.476 0 0 1 2.2813-1.7636"/>
+<path d="m434.62 8.7384a1.7807 1.7807 0 0 0 0.40576-2.1032"/>
+<path d="m435.03 6.6352a0.202 0.202 0 0 0 0.32103-0.15492"/>
+<path d="m435.35 6.4802a1.7442 1.7442 0 0 1-0.72679 2.2581"/>
+<path d="m465.46 99.867a0.37414 0.37414 0 0 0-0.70044 0.02289"/>
+<path d="m464.76 99.89a3.5149 3.5149 0 0 0-1.045-1.9856"/>
+<path d="m463.72 97.904a2.4748 2.4748 0 0 1 1.7454 1.9628"/>
+<path d="m412.03 34.527a1.2989 1.2989 0 0 0 0.98528-2.2113"/>
+<path d="m413.02 32.316a7.7285 7.7285 0 0 0 6.5382-0.89185"/>
+<path d="m419.55 31.424a6.6167 6.6167 0 0 1-7.5234 3.1031"/>
+<path d="m506.93 36.111a0.26827 0.26827 0 0 0 0.0853 0.49427"/>
+<path d="m507.02 36.605a9.1991 9.1991 0 0 0-1.6889 0.69905"/>
+<path d="m505.33 37.304a3.0922 3.0922 0 0 1 1.6036-1.1933"/>
+<path d="m488.26 87.854a12.866 12.866 0 0 0 1.2856 2.0711"/>
+<path d="m489.54 89.925a0.16585 0.16585 0 0 0-0.23366 0.17697"/>
+<path d="m489.31 90.102a6.2369 6.2369 0 0 1-1.0519-2.248"/>
+<path d="m504.73 70.258a12.866 12.866 0 0 0-6.1235-0.93466"/>
+<path d="m498.61 69.323a7.7285 7.7285 0 0 1 6.5382-0.89185"/>
+<path d="m505.14 68.431a1.0145 1.0145 0 0 0-0.41465 1.8265"/>
+<path d="m410.95 63.698a7.453 7.453 0 0 1 1.8792-0.25436"/>
+<path d="m412.83 63.443a9.1991 9.1991 0 0 1-1.6889 0.69905"/>
+<path d="m411.14 64.142a0.25895 0.25895 0 0 0-0.19029-0.4447"/>
+<path d="m453.97 0.70403a10.201 10.201 0 0 0 0.47103 2.139"/>
+<path d="m454.44 2.8431a3.5149 3.5149 0 0 1-1.0449-1.9857"/>
+<path d="m453.4 0.85742a0.31924 0.31924 0 0 0 0.57391-0.15339"/>
+<path d="m498.17 81.477a0.21041 0.21041 0 0 0-0.28421 0.27082"/>
+<path d="m497.88 81.748a7.7285 7.7285 0 0 1-1.0636-1.0755"/>
+<path d="m496.82 80.673a6.2369 6.2369 0 0 1 1.3478 0.80473"/>
+<path d="m432.35 8.234a0.35884 0.35884 0 0 0 0.59342-0.31836"/>
+<path d="m432.95 7.9156a1.9833 1.9833 0 0 0 1.6779 0.82273"/>
+<path d="m434.62 8.7384a1.7442 1.7442 0 0 1-2.2713-0.50436"/>
+<path d="m484.83 93.168a3.1372 3.1372 0 0 0-1.2933-1.1592"/>
+<path d="m483.54 92.009a1.9833 1.9833 0 0 1 1.6779 0.82272"/>
+<path d="m485.21 92.832a0.27539 0.27539 0 0 0-0.38458 0.33646"/>
+<path d="m485.11 16.499a103.01 103.01 0 0 1-68.88 33.875"/>
+<path d="m416.23 50.374a13.557 13.557 0 0 0 3.3244-18.95"/>
+<path d="m419.55 31.424a62.736 62.736 0 0 0 65.556-14.925"/>
+<path d="m498.61 69.323a42.784 42.784 0 0 0-51.921 24.77"/>
+<path d="m446.68 94.094a11.713 11.713 0 0 0-13.635-9.845"/>
+<path d="m433.05 84.249a62.736 62.736 0 0 1 65.556-14.925"/>
+<path d="m446.68 94.094a5.4135 5.4135 0 0 0-8.5934 1.5147"/>
+<path d="m438.09 95.608a0.27427 0.27427 0 0 0-0.40108-0.22256"/>
+<path d="m437.69 95.386a5.566 5.566 0 0 1 8.9944-1.2921"/>
+<path d="m419.05 75.08a3.3465 3.3465 0 0 1 0.20509 5.395"/>
+<path d="m419.25 80.475a0.14652 0.14652 0 0 0-0.14453-0.19896"/>
+<path d="m419.11 80.276a3.2774 3.2774 0 0 0-0.0606-5.196"/>
+<path d="m412.83 63.443a3.2565 3.2565 0 0 1 0.17744 5.9796"/>
+<path d="m413.01 69.423a0.2633 0.2633 0 0 0-0.16877-0.40785"/>
+<path d="m412.84 69.015a3.062 3.062 0 0 0-9e-3 -5.5718"/>
+<path d="m454.44 2.8431a14.714 14.714 0 0 1-24.543 10.05"/>
+<path d="m429.9 12.893a3.9456 3.9456 0 0 0 4.7227-4.1551"/>
+<path d="m434.62 8.7384a11.216 11.216 0 0 0 19.82-5.8953"/>
+<path d="m504.82 30.564a4.2614 4.2614 0 0 1-5.713-4.8974"/>
+<path d="m499.11 25.667a3.1408 3.1408 0 0 0 3.7882 2.0699"/>
+<path d="m502.9 27.737a1.7764 1.7764 0 0 0 1.9248 2.8275"/>
+<path d="m483.54 92.009a8.542 8.542 0 0 0-14.855 6.2258"/>
+<path d="m468.68 98.235a3.1407 3.1407 0 0 0-4.965-0.33045"/>
+<path d="m463.72 97.904a11.216 11.216 0 0 1 19.82-5.8953"/>
+<path d="m480.47 5.3615a8.2626 8.2626 0 0 0 4.6406 11.137"/>
+<path d="m485.11 16.499a11.713 11.713 0 0 1-13.635-9.845"/>
+<path d="m471.47 6.6536a5.566 5.566 0 0 0 8.9944-1.2921"/>
+<path d="m499.05 20.471a1.0962 1.0962 0 0 0 0.94081 1.9004"/>
+<path d="m499.99 22.371a3.1407 3.1407 0 0 0-0.88025 3.2956"/>
+<path d="m499.11 25.667a3.2774 3.2774 0 0 1-0.06056-5.196"/>
+<path d="m505.32 31.732a1.4809 1.4809 0 0 0 0.70548 2.7951"/>
+<path d="m506.03 34.527a2.0427 2.0427 0 0 0-0.69681 2.7767"/>
+<path d="m505.33 37.304a3.062 3.062 0 0 1-9e-3 -5.5718"/>
+<path d="m416.23 50.374a8.1066 8.1066 0 0 0-5.9154-10.286"/>
+<path d="m410.31 40.087a0.32968 0.32968 0 0 0 0.15009-0.53039"/>
+<path d="m410.46 39.557a8.2424 8.2424 0 0 1 5.7653 10.817"/>
+<path d="m421.34 20.075a1.8469 1.8469 0 0 1-2.8534 1.1838"/>
+<path d="m418.49 21.259a0.086967 0.086967 0 0 0 0.087-0.1173"/>
+<path d="m418.57 21.141a1.8016 1.8016 0 0 0 2.7664-1.0665"/>
+<path d="m501.93 50.374a8.1066 8.1066 0 0 1 6.7399-5.6547"/>
+<path d="m508.67 44.719a0.17164 0.17164 0 0 0 0.0235 0.28695"/>
+<path d="m508.69 45.006a8.2424 8.2424 0 0 0-6.7634 5.3678"/>
+<path d="m495.71 84.303a2.1436 2.1436 0 0 1 1.1075-3.6306"/>
+<path d="m496.82 80.673a1.655 1.655 0 0 0-0.22493 2.2464"/>
+<path d="m496.59 82.919a0.84971 0.84971 0 0 0-0.88253 1.3842"/>
+<path d="m424.3 86.166a8.2626 8.2626 0 0 1 8.7534-1.9171"/>
+<path d="m433.05 84.249a11.713 11.713 0 0 0-6.2638 3.2769"/>
+<path d="m426.79 87.526a1.5001 1.5001 0 0 0-2.4896-1.3599"/>
+<path d="m507.69 61.19a7.6469 7.6469 0 0 0-9.0897 8.133"/>
+<path d="m498.61 69.323a13.557 13.557 0 0 1 3.3244-18.95"/>
+<path d="m501.93 50.374a8.2424 8.2424 0 0 0 5.7653 10.817"/>
+<path d="m417.24 77.704a4.2614 4.2614 0 0 0 1.8058-2.6233"/>
+<path d="m419.05 75.08a3.1408 3.1408 0 0 1-0.88026 3.2956"/>
+<path d="m418.17 78.376a0.62288 0.62288 0 0 0-0.92552-0.67232"/>
+<path d="m411.41 65.392a2.0554 2.0554 0 0 0 1.4156-1.9484"/>
+<path d="m412.83 63.443a2.0427 2.0427 0 0 1-0.69681 2.7767"/>
+<path d="m412.13 66.22a0.60834 0.60834 0 0 0-0.71884-0.82836"/>
+<path d="m451.4 1.0115a2.3521 2.3521 0 0 0 3.0456 1.8315"/>
+<path d="m454.44 2.8431a3.1407 3.1407 0 0 1-4.965-0.33045"/>
+<path d="m449.48 2.5126a1.4206 1.4206 0 0 0 1.9194-1.5011"/>
+<path d="m499.58 79.606a0.63262 0.63262 0 0 0-0.87481 0.86138"/>
+<path d="m498.71 80.467a1.655 1.655 0 0 0-1.8915 0.2051"/>
+<path d="m496.82 80.673a1.8016 1.8016 0 0 1 2.7664-1.0665"/>
+<path d="m409.47 55.741a1.5873 1.5873 0 0 0 0.39614-3.0068"/>
+<path d="m409.86 52.735a13.557 13.557 0 0 0 6.3672-2.3609"/>
+<path d="m416.23 50.374a8.2424 8.2424 0 0 1-6.7634 5.3678"/>
+<path d="m429.9 12.893a2.6185 2.6185 0 0 0 1.0213-3.7798"/>
+<path d="m430.92 9.1137a0.097216 0.097216 0 0 0 0.14006-0.083327"/>
+<path d="m431.06 9.0303a2.6482 2.6482 0 0 1-1.1614 3.8631"/>
+<path d="m499.11 25.667a3.3465 3.3465 0 0 0 3.4897 0.15789"/>
+<path d="m502.6 25.825a0.06474 0.06474 0 0 0 0.0484 0.09726"/>
+<path d="m502.65 25.922a3.2774 3.2774 0 0 1-3.5381-0.25515"/>
+<path d="m488.26 87.854a2.6185 2.6185 0 0 1 3.1442 0.62534"/>
+<path d="m491.4 88.479a0.061841 0.061841 0 0 0-0.0811 0.06487"/>
+<path d="m491.32 88.544a2.6482 2.6482 0 0 0-3.0631-0.69022"/>
+<path d="m471.47 6.6536a5.4135 5.4135 0 0 1-1.5545-5.0408"/>
+<path d="m469.92 1.6128a0.094418 0.094418 0 0 0 0.15351 0.039446"/>
+<path d="m470.07 1.6523a5.566 5.566 0 0 0 1.401 5.0014"/>
+<path d="m462.09 100.25a2.3521 2.3521 0 0 1 1.6208-2.3501"/>
+<path d="m463.72 97.904a3.1407 3.1407 0 0 0-0.78553 2.0849"/>
+<path d="m462.93 99.989a0.45994 0.45994 0 0 0-0.83529 0.26528"/>
+<path d="m415.8 25.458a7.6469 7.6469 0 0 1 3.7491 5.9658"/>
+<path d="m419.55 31.424a13.557 13.557 0 0 0-4.2676-3.9017"/>
+<path d="m415.29 27.522a1.1264 1.1264 0 0 0 0.51851-2.064"/>
+<path d="m472.97 2.3777a42.784 42.784 0 0 1-1.4905 4.2759"/>
+<path d="m471.47 6.6536a11.713 11.713 0 0 1 0.1578-4.234"/>
+<path d="m471.63 2.4196a0.71323 0.71323 0 0 0 1.3327-0.041893"/>
+<path d="m507.8 39.322a2.0554 2.0554 0 0 1-2.4702-2.0181"/>
+<path d="m505.33 37.304a2.0427 2.0427 0 0 0 1.9896 0.99636"/>
+<path d="m507.32 38.3a0.58844 0.58844 0 0 0 0.48061 1.0217"/>
+<path d="m487.1 91.717a2.0849 2.0849 0 0 0-3.5613 0.29196"/>
+<path d="m483.54 92.009a3.9456 3.9456 0 0 1 4.7227-4.1551"/>
+<path d="m488.26 87.854a2.6482 2.6482 0 0 0-1.1614 3.8631"/>
+<path d="m415.51 74.825a0.99973 0.99973 0 0 0-0.25015-1.8147"/>
+<path d="m415.26 73.01a3.1408 3.1408 0 0 1 3.7882 2.0699"/>
+<path d="m419.05 75.08a3.2774 3.2774 0 0 0-3.5381-0.25516"/>
+<path d="m419.64 19.669a2.1436 2.1436 0 0 0 1.7045 0.4055"/>
+<path d="m421.34 20.075a1.655 1.655 0 0 1-1.8916 0.2051"/>
+<path d="m419.45 20.28a0.34768 0.34768 0 0 0 0.18705-0.61061"/>
+<path d="m509.02 50.084a103.01 103.01 0 0 0-7.0914 0.28961"/>
+<path d="m501.93 50.374a13.557 13.557 0 0 1 6.3672-2.3609"/>
+<path d="m508.3 48.013a1.1812 1.1812 0 0 0 0.72422 2.0713"/>
+<path d="m448.09 99.095a0.90783 0.90783 0 0 0-1.5588-0.76735"/>
+<path d="m446.53 98.328a11.713 11.713 0 0 0 0.1578-4.234"/>
+<path d="m446.68 94.094a5.566 5.566 0 0 1 1.401 5.0014"/>
+<path d="m426.84 12.203a0.55797 0.55797 0 0 0 0.94843-0.50308"/>
+<path d="m427.79 11.7a3.9456 3.9456 0 0 0 2.1146 1.1933"/>
+<path d="m429.9 12.893a2.6482 2.6482 0 0 1-3.0631-0.69022"/>
+<path d="m496.82 80.673a1.8469 1.8469 0 0 0 0.61779 1.7499"/>
+<path d="m497.44 82.422a0.033189 0.033189 0 0 0-0.0379 0.04087"/>
+<path d="m497.4 82.463a1.8016 1.8016 0 0 1-0.57994-1.7908"/>
+<path d="m433.05 84.249a103.01 103.01 0 0 0-4.6375 5.541"/>
+<path d="m428.41 89.79a0.11603 0.11603 0 0 0-0.14833-0.12607"/>
+<path d="m428.26 89.664a62.736 62.736 0 0 1 4.7858-5.4149"/>
+<path d="m434.58 6.8063a2.0849 2.0849 0 0 1 0.043 1.9321"/>
+<path d="m434.62 8.7384a3.9456 3.9456 0 0 0-0.44023-1.5426"/>
+<path d="m434.18 7.1958a0.29316 0.29316 0 0 0 0.39724-0.38956"/>
+<path d="m420.76 18.284a0.5015 0.5015 0 0 0 0.80488-0.45561"/>
+<path d="m421.57 17.828a1.655 1.655 0 0 1-0.22493 2.2464"/>
+<path d="m421.34 20.075a1.8016 1.8016 0 0 0-0.57995-1.7908"/>
+<path d="m489.9 11.084a1.3831 1.3831 0 0 0 1.478 2.138"/>
+<path d="m491.37 13.222a11.713 11.713 0 0 1-6.2638 3.2769"/>
+<path d="m485.11 16.499a62.736 62.736 0 0 0 4.7858-5.415"/>
+<path d="m489.96 89.673a14.714 14.714 0 0 0-1.702-1.8193"/>
+<path d="m488.26 87.854a3.9456 3.9456 0 0 1 2.1146 1.1933"/>
+<path d="m490.37 89.047a0.40214 0.40214 0 0 0-0.41266 0.62604"/>
+<path d="m463.72 97.904a14.714 14.714 0 0 0 0.0368 2.2333"/>
+<path d="m463.75 100.14a0.034121 0.034121 0 0 0-0.0572 3e-3"/>
+<path d="m463.69 100.14a11.216 11.216 0 0 1 0.0204-2.2362"/>
+<path d="m419.55 31.424a42.784 42.784 0 0 1-5.7339-2.184"/>
+<path d="m413.82 29.24a0.097286 0.097286 0 0 0 0.0751-0.14497"/>
+<path d="m413.9 29.095a62.736 62.736 0 0 0 5.6588 2.329"/>
+<path d="m505.33 37.304a3.2565 3.2565 0 0 0 2.026 0.12158"/>
+<path d="m507.36 37.426a0.032743 0.032743 0 0 0 0.0117 0.0537"/>
+<path d="m507.37 37.479a3.062 3.062 0 0 1-2.0378-0.17528"/>
+<path d="m504.26 71.652a1.1115 1.1115 0 0 0-1.3912 1.5728"/>
+<path d="m502.87 73.225a13.557 13.557 0 0 1-4.2676-3.9017"/>
+<path d="m498.61 69.323a62.736 62.736 0 0 1 5.6588 2.329"/>
+<path d="m410.79 63.268a0.43987 0.43987 0 0 0 0.0481-0.82109"/>
+<path d="m410.84 62.447a2.0427 2.0427 0 0 1 1.9896 0.99636"/>
+<path d="m412.83 63.443a3.062 3.062 0 0 0-2.0378-0.17528"/>
+<path d="m454.46 0.60689a0.41298 0.41298 0 0 0 0.76511 0.15132"/>
+<path d="m455.23 0.75821a3.1407 3.1407 0 0 1-0.78554 2.0849"/>
+<path d="m454.44 2.8431a11.216 11.216 0 0 0 0.0204-2.2362"/>
+<path d="m434.62 8.7384a8.542 8.542 0 0 1-1.016-1.3747"/>
+<path d="m433.61 7.3636 0.0383-0.020679"/>
+<path d="m433.65 7.343a11.216 11.216 0 0 0 0.97773 1.3954"/>
+<path d="m484.51 93.404a0.2933 0.2933 0 0 0-0.53751 0.14713"/>
+<path d="m483.98 93.551a3.9456 3.9456 0 0 1-0.44021-1.5425"/>
+<path d="m483.54 92.009a11.216 11.216 0 0 1 0.97772 1.3954"/>
+<path d="m397.71 28.331a13.12 13.12 0 0 0 5.2639 22.166"/>
+<path d="m402.97 50.497a27.92 27.92 0 0 1-24.07-30.55"/>
+<path d="m378.9 19.947a15.953 15.953 0 0 0 18.806 8.384"/>
+<path d="m396.08 79.043a4.0047 4.0047 0 0 0-4.6447 5.8889"/>
+<path d="m391.44 84.932a10.392 10.392 0 0 1 3.5657-16.09"/>
+<path d="m395 68.842a8.0983 8.0983 0 0 0 1.079 10.201"/>
+</g>
+</svg>
diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/octagon.svg b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/octagon.svg
new file mode 100644
index 00000000000..1bfdfa54980
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/fig/octagon.svg
@@ -0,0 +1,83 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<svg width="164.78mm" height="156.08mm" version="1.1" viewBox="0 0 164.78 156.08" xmlns="http://www.w3.org/2000/svg" xmlns:cc="http://creativecommons.org/ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
+<metadata>
+<rdf:RDF>
+<cc:Work rdf:about="">
+<dc:format>image/svg+xml</dc:format>
+<dc:type rdf:resource="http://purl.org/dc/dcmitype/StillImage"/>
+<dc:title/>
+</cc:Work>
+</rdf:RDF>
+</metadata>
+<rect x="-4.5357" y="-7.5595" width="172.36" height="172.36" fill="#fff" stroke="#fc0000" stroke-width=".076"/>
+<g transform="translate(-11.849 -14.534)">
+<g transform="translate(.37798 -77.863)">
+<g transform="rotate(22.62 93.825 170.85)">
+<path d="m67.909 111.4c0.15285 0.15806 0.30098 0.31908 0.46294 0.4686 0.69532 0.57384 1.5083 0.98126 2.3115 1.3797 1.4914 0.71788 3.0686 1.2228 4.6544 1.683 2.0616 0.59347 4.1794 0.93422 6.3051 1.1932 2.4261 0.27854 4.8686 0.33413 7.3081 0.32892 2.4817-0.01 4.9545-0.22484 7.4191-0.49712 2.184-0.24192 4.3531-0.59224 6.513-0.99246 1.6727-0.31601 3.3306-0.70268 4.9766-1.1352 1.242-0.32639 2.4642-0.72084 3.6731-1.1528 0.91499-0.32875 1.81-0.70891 2.7095-1.0769 0.64138-0.27075 1.2918-0.51909 1.9358-0.78342 0.38757-0.17948 0.79264-0.30223 1.2101-0.38664 8e-3 -2e-3 0.0314 0.1094 0.0236 0.11106-0.36689 0.24265-0.74728 0.46177-1.1544 0.63102-0.63896 0.29429-1.2706 0.6044-1.9141 0.88886-0.89648 0.40482-1.8019 0.79002-2.7194 1.145-1.218 0.46138-2.4502 0.88427-3.7024 1.2436-1.6561 0.4739-3.324 0.90702-5.0105 1.2599-2.1741 0.45217-4.3623 0.83752-6.5674 1.1061-2.4905 0.28936-4.9911 0.49685-7.5006 0.49193-2.4674-7e-3 -4.938-0.0804-7.387-0.40604-2.1484-0.3078-4.2882-0.69621-6.3626-1.3488-1.5961-0.51409-3.1814-1.0817-4.6614-1.8795-0.80628-0.4553-1.6234-0.92838-2.2563-1.6174-0.14604-0.17744-0.31728-0.3697-0.35303-0.60549-0.0035-6e-3 0.08274-0.0554 0.08623-0.0493z" style="paint-order:stroke markers fill"/>
+<path d="m33.608 147.08c0.21985 4e-3 0.43845 0.0128 0.6587 4e-3 0.89743-0.0859 1.7604-0.3727 2.6101-0.65888 1.5622-0.54696 3.0345-1.3052 4.4813-2.1011 1.8774-1.0381 3.6159-2.2947 5.3021-3.6146 1.9125-1.5186 3.6789-3.2063 5.4002-4.935 1.7478-1.7619 3.3444-3.6624 4.8946-5.5976 1.3733-1.7154 2.6593-3.4968 3.9036-5.3071 0.95932-1.4062 1.8582-2.852 2.7163-4.3217 0.64747-1.109 1.2328-2.2522 1.7822-3.4124 0.41453-0.87946 0.77857-1.7811 1.1544-2.6774 0.26207-0.64497 0.5464-1.2805 0.81487-1.9228 0.14713-0.40096 0.34676-0.77418 0.58226-1.129 4e-3 -7e-3 0.0996 0.0551 0.0952 0.0618-0.0879 0.43102-0.20189 0.85494-0.37012 1.2625-0.24372 0.65992-0.47106 1.3258-0.72493 1.982-0.34765 0.92016-0.7155 1.8328-1.1132 2.7325-0.53498 1.1875-1.1073 2.3578-1.7386 3.4974-0.83595 1.5062-1.7091 2.9918-2.6521 4.4339-1.2176 1.8571-2.4924 3.6768-3.8617 5.426-1.5564 1.9656-3.1779 3.8806-4.9559 5.6516-1.7496 1.7398-3.5486 3.4348-5.5105 4.9363-1.7368 1.3015-3.5245 2.5399-5.4527 3.5453-1.4921 0.76507-3.0145 1.4847-4.6252 1.9671-0.89207 0.24818-1.8044 0.49147-2.7391 0.45178-0.22874-0.0222-0.48577-0.0371-0.67778-0.17851-0.0067-2e-3 0.01933-0.0977 0.02611-0.0958z" style="paint-order:stroke markers fill"/>
+<path d="m34.468 196.58c0.15828-0.15262 0.31909-0.30098 0.4686-0.46294 0.57383-0.69532 0.98126-1.5083 1.3797-2.3115 0.71789-1.4914 1.2228-3.0686 1.6831-4.6544 0.59347-2.0616 0.93422-4.1794 1.1932-6.3051 0.27854-2.4261 0.33413-4.8686 0.32892-7.3081-0.01-2.4817-0.22484-4.9545-0.49712-7.4191-0.24192-2.184-0.59224-4.3531-0.99246-6.513-0.31601-1.6727-0.70268-3.3306-1.1352-4.9766-0.32639-1.242-0.72084-2.4642-1.1528-3.6731-0.32875-0.91499-0.70891-1.81-1.0769-2.7095-0.27075-0.64137-0.51909-1.2918-0.78342-1.9358-0.17948-0.38756-0.30223-0.79262-0.38664-1.2101-2e-3 -8e-3 0.10939-0.0315 0.11102-0.0236 0.24262 0.36693 0.46177 0.74729 0.63101 1.1544 0.2943 0.63897 0.6044 1.2706 0.88887 1.9141 0.40482 0.89647 0.79002 1.8019 1.145 2.7194 0.46138 1.218 0.88427 2.4502 1.2436 3.7024 0.4739 1.6561 0.90702 3.324 1.2599 5.0106 0.45217 2.1741 0.83751 4.3623 1.1061 6.5674 0.28936 2.4905 0.49685 4.9911 0.49193 7.5006-7e-3 2.4674-0.0804 4.938-0.40604 7.387-0.3078 2.1484-0.69621 4.2882-1.3488 6.3626-0.51409 1.5961-1.0817 3.1814-1.8795 4.6614-0.4553 0.80627-0.92837 1.6234-1.6174 2.2563-0.17744 0.14604-0.36973 0.31726-0.60549 0.35303-6e-3 4e-3 -0.0554-0.0827-0.0493-0.0862z" style="paint-order:stroke markers fill"/>
+<path d="m70.13 231.06c4e-3 -0.21984 0.0128-0.43846 4e-3 -0.6587-0.0859-0.89742-0.3727-1.7604-0.65888-2.6101-0.54696-1.5622-1.3052-3.0345-2.1011-4.4813-1.0382-1.8774-2.2947-3.6159-3.6146-5.3021-1.5186-1.9125-3.2063-3.6789-4.935-5.4002-1.7619-1.7478-3.6624-3.3444-5.5976-4.8946-1.7154-1.3733-3.4969-2.6593-5.3071-3.9036-1.4062-0.95931-2.8519-1.8582-4.3217-2.7163-1.109-0.64747-2.2522-1.2328-3.4124-1.7822-0.87945-0.41453-1.7811-0.77857-2.6774-1.1544-0.64497-0.26207-1.2805-0.5464-1.9228-0.81487-0.40095-0.14714-0.77417-0.34676-1.129-0.58226-7e-3 -4e-3 0.0551-0.0996 0.0618-0.0952 0.43102 0.0879 0.85493 0.20189 1.2625 0.37012 0.65992 0.24371 1.3258 0.47106 1.982 0.72492 0.92015 0.34765 1.8328 0.7155 2.7325 1.1132 1.1875 0.53498 2.3578 1.1073 3.4974 1.7386 1.5062 0.83596 2.9918 1.7091 4.4339 2.6521 1.8571 1.2176 3.6768 2.4924 5.426 3.8617 1.9656 1.5564 3.8806 3.1779 5.6516 4.9559 1.7398 1.7496 3.4348 3.5486 4.9363 5.5105 1.3015 1.7368 2.5399 3.5245 3.5453 5.4527 0.76508 1.4921 1.4847 3.0145 1.9671 4.6252 0.24818 0.89206 0.49147 1.8044 0.45179 2.7391-0.0222 0.22874-0.0371 0.48578-0.17852 0.67778-1e-3 7e-3 -0.0976-0.0193-0.0958-0.0261z" style="paint-order:stroke markers fill"/>
+<path d="m119.73 230.23c-0.15262-0.15828-0.30098-0.31908-0.46293-0.46859-0.69532-0.57384-1.5083-0.98126-2.3115-1.3797-1.4914-0.71788-3.0686-1.2228-4.6544-1.6831-2.0616-0.59346-4.1794-0.93421-6.3051-1.1932-2.4261-0.27855-4.8686-0.33415-7.3081-0.32892-2.4817 0.01-4.9545 0.22483-7.4191 0.49711-2.184 0.24192-4.3531 0.59224-6.513 0.99246-1.6727 0.31601-3.3306 0.70268-4.9766 1.1352-1.242 0.32639-2.4642 0.72084-3.6731 1.1528-0.91498 0.32875-1.81 0.70891-2.7095 1.0769-0.64138 0.27075-1.2918 0.51909-1.9358 0.78343-0.38756 0.17947-0.79262 0.30222-1.2101 0.38664-8e-3 2e-3 -0.0315-0.10939-0.0236-0.11102 0.36693-0.24262 0.74728-0.46177 1.1544-0.63101 0.63896-0.2943 1.2706-0.6044 1.9141-0.88887 0.89647-0.40482 1.8019-0.79002 2.7194-1.145 1.218-0.46139 2.4502-0.88427 3.7024-1.2436 1.6561-0.4739 3.324-0.90702 5.0106-1.2599 2.1741-0.45218 4.3623-0.83751 6.5674-1.1061 2.4905-0.28936 4.9911-0.49685 7.5006-0.49193 2.4674 7e-3 4.938 0.0804 7.387 0.40604 2.1484 0.30781 4.2882 0.69621 6.3626 1.3488 1.5961 0.51408 3.1814 1.0817 4.6614 1.8796 0.80626 0.45528 1.6234 0.92836 2.2563 1.6174 0.14604 0.17745 0.31726 0.36974 0.35304 0.60551 4e-3 6e-3 -0.0827 0.0554-0.0862 0.0493z" style="paint-order:stroke markers fill"/>
+<path d="m154.12 194.62c-0.21984-4e-3 -0.43845-0.0128-0.65868-4e-3 -0.89743 0.0859-1.7604 0.37271-2.6101 0.65889-1.5622 0.54696-3.0345 1.3052-4.4813 2.1011-1.8774 1.0382-3.6159 2.2947-5.3021 3.6146-1.9125 1.5186-3.6789 3.2063-5.4002 4.935-1.7478 1.7619-3.3444 3.6624-4.8946 5.5976-1.3733 1.7154-2.6593 3.4969-3.9036 5.3071-0.95932 1.4062-1.8582 2.852-2.7163 4.3217-0.64747 1.1091-1.2328 2.2522-1.7822 3.4124-0.41452 0.87945-0.77856 1.7811-1.1544 2.6774-0.26208 0.64497-0.54641 1.2805-0.81487 1.9228-0.14715 0.40095-0.34677 0.77416-0.58226 1.129-4e-3 7e-3 -0.0996-0.0551-0.0952-0.0618 0.0879-0.43102 0.20188-0.85493 0.37011-1.2625 0.24371-0.65991 0.47106-1.3258 0.72493-1.982 0.34764-0.92015 0.7155-1.8328 1.1132-2.7325 0.53498-1.1875 1.1073-2.3578 1.7386-3.4974 0.83597-1.5062 1.7091-2.9918 2.6521-4.4339 1.2176-1.8571 2.4924-3.6768 3.8617-5.426 1.5564-1.9656 3.1779-3.8806 4.9559-5.6516 1.7496-1.7398 3.5486-3.4348 5.5105-4.9363 1.7368-1.3015 3.5245-2.5399 5.4527-3.5453 1.4921-0.76509 3.0145-1.4847 4.6252-1.9671 0.89204-0.24818 1.8044-0.49147 2.7391-0.45179 0.22874 0.0222 0.48578 0.0371 0.6778 0.17852 7e-3 1e-3 -0.0193 0.0977-0.0261 0.0958z" style="paint-order:stroke markers fill"/>
+<path d="m153.29 145.02c-0.15828 0.15262-0.31907 0.30097-0.46858 0.46292-0.57384 0.69532-0.98126 1.5083-1.3797 2.3115-0.71787 1.4914-1.2228 3.0686-1.683 4.6544-0.59346 2.0616-0.93421 4.1794-1.1932 6.3051-0.27855 2.4262-0.33415 4.8686-0.32892 7.3081 0.01 2.4817 0.22483 4.9545 0.49711 7.4191 0.24192 2.184 0.59224 4.3531 0.99246 6.513 0.316 1.6727 0.70268 3.3306 1.1352 4.9766 0.32639 1.2421 0.72085 2.4642 1.1528 3.6731 0.32876 0.91498 0.70892 1.81 1.0769 2.7095 0.27076 0.64139 0.51909 1.2918 0.78344 1.9358 0.17947 0.38757 0.30221 0.79262 0.38663 1.2101 2e-3 8e-3 -0.10938 0.0315-0.11101 0.0236-0.24262-0.36693-0.46177-0.74727-0.63102-1.1544-0.29429-0.63895-0.60439-1.2706-0.88886-1.9141-0.40482-0.89646-0.79001-1.8019-1.145-2.7193-0.46139-1.218-0.88427-2.4502-1.2436-3.7024-0.4739-1.6561-0.90701-3.324-1.2599-5.0106-0.45218-2.1741-0.83751-4.3623-1.1061-6.5674-0.28935-2.4905-0.49684-4.9911-0.49193-7.5006 7e-3 -2.4674 0.0804-4.938 0.40604-7.387 0.30782-2.1484 0.69622-4.2882 1.3488-6.3626 0.51407-1.5961 1.0817-3.1814 1.8796-4.6614 0.45528-0.80626 0.92835-1.6234 1.6174-2.2563 0.17745-0.14603 0.36974-0.31725 0.60552-0.35304 6e-3 -4e-3 0.0554 0.0827 0.0493 0.0862z" style="paint-order:stroke markers fill"/>
+<path d="m117.41 110.54c-4e-3 0.21984-0.0128 0.43844-4e-3 0.65867 0.0859 0.89744 0.3727 1.7604 0.65889 2.6101 0.54696 1.5622 1.3052 3.0345 2.1011 4.4813 1.0382 1.8774 2.2947 3.6159 3.6146 5.3021 1.5186 1.9125 3.2063 3.6789 4.935 5.4002 1.7619 1.7478 3.6624 3.3444 5.5976 4.8946 1.7154 1.3733 3.4969 2.6593 5.3072 3.9036 1.4062 0.95932 2.8519 1.8582 4.3217 2.7163 1.1091 0.64748 2.2522 1.2328 3.4124 1.7822 0.87945 0.41452 1.7811 0.77856 2.6774 1.1544 0.64499 0.26207 1.2805 0.54641 1.9228 0.81487 0.40096 0.14715 0.77416 0.34677 1.129 0.58226 7e-3 4e-3 -0.0551 0.0996-0.0618 0.0952-0.43102-0.0879-0.85492-0.20188-1.2625-0.37011-0.6599-0.24371-1.3258-0.47106-1.982-0.72493-0.92015-0.34764-1.8328-0.7155-2.7325-1.1132-1.1875-0.53498-2.3578-1.1073-3.4974-1.7386-1.5062-0.83596-2.9918-1.7091-4.4339-2.6521-1.8571-1.2176-3.6768-2.4924-5.426-3.8617-1.9656-1.5564-3.8806-3.1779-5.6516-4.9559-1.7398-1.7497-3.4349-3.5486-4.9363-5.5105-1.3015-1.7368-2.5399-3.5245-3.5453-5.4527-0.76508-1.4921-1.4847-3.0145-1.9671-4.6252-0.24818-0.89205-0.49147-1.8044-0.45179-2.7391 0.0222-0.22874 0.0371-0.48578 0.17852-0.67782 1e-3 -7e-3 0.0977 0.0193 0.0958 0.0261z" style="paint-order:stroke markers fill"/>
+<ellipse cx="33.435" cy="147.39" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="68.036" cy="111.79" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="117.36" cy="110.85" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="153.27" cy="145.43" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="154.21" cy="194.19" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="119.63" cy="230.1" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="70.493" cy="230.85" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+<ellipse cx="34.585" cy="196.65" rx="2.2836" ry="2.3896" style="paint-order:stroke markers fill"/>
+</g>
+<g transform="translate(79.753 72.193)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m496.66 409.87v0.71l-0.02 0.68-0.03 0.66-0.04 0.64-0.06 0.62-0.07 0.6-0.09 0.57-0.11 0.56-0.13 0.55-0.15 0.53-0.17 0.51-0.19 0.5-0.21 0.49-0.24 0.48-0.26 0.47-0.14 0.23-0.15 0.23c-1.08 1.61-3.23 3-6.03 3v-0.98c1.89 0 3.7-1.14 4.33-3.17 0.56-1.88 0.59-4.39 0.59-7.43 0-2.57 0-5.15-0.45-7.34-0.7-3.17-3.06-3.94-4.47-3.94-1.59 0-3.72 0.94-4.42 3.8-0.49 2.05-0.49 4.91-0.49 7.48 0 2.55 0 5.21 0.52 7.11 0.73 2.75 2.97 3.49 4.39 3.49v0.98c-8.08 0-8.08-9.51-8.08-12.03 0-2.5 0-11.81 8.08-11.81 8.09 0 8.09 9.31 8.09 11.81z"/></g>
+</g>
+<g transform="translate(57.452 20.033)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m490.35 420.92v0.35l-0.01 0.03v0.09l-0.01 0.03v0.05l-0.01 0.03v0.02l-0.01 0.03v0.02l-0.02 0.04-0.01 0.04-0.08 0.12-0.09 0.06-0.08 0.02-0.05 0.02h-0.04l-0.03 0.01h-0.03l-0.02 0.01h-0.12l-0.04 0.01h-0.4c-2.23-2.2-5.39-2.23-6.82-2.23v-1.25c0.84 0 3.14 0 5.04 0.97v-17.77c0-1.16 0-1.61-3.48-1.61h-1.31v-1.25c0.62 0.03 4.9 0.14 6.2 0.14 1.08 0 5.47-0.11 6.23-0.14v1.25h-1.32c-3.49 0-3.49 0.45-3.49 1.61z"/></g>
+</g>
+<g transform="translate(1.5119 -1.8899)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m496.27 405.11h-1.18c-0.1-0.77-0.46-2.83-0.91-3.18-0.27-0.2-2.95-0.2-3.44-0.2h-6.42c3.66 3.23 4.88 4.2 6.97 5.84 2.58 2.07 4.98 4.22 4.98 7.54 0 4.21-3.68 6.79-8.15 6.79-4.32 0-7.25-3.03-7.25-6.23 0-1.78 1.5-1.96 1.86-1.96 0.82 0 1.84 0.6 1.84 1.85 0 0.62-0.25 1.84-2.06 1.84 1.08 2.47 3.45 3.24 5.09 3.24 3.49 0 5.3-2.71 5.3-5.53 0-3.04-2.16-5.44-3.28-6.69l-8.39-8.3c-0.36-0.31-0.36-0.39-0.36-1.36h14.36z"/></g>
+</g>
+<g transform="translate(-53.673 19.277)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m488.2 410.4h0.25l0.25-0.02 0.24-0.03 0.24-0.04 0.23-0.05 0.23-0.06 0.22-0.07 0.21-0.08 0.21-0.1 0.2-0.1 0.2-0.12 0.19-0.12 0.18-0.14 0.17-0.15 0.17-0.16 0.16-0.17 0.15-0.18 0.14-0.19 0.14-0.2 0.13-0.22 0.11-0.22 0.11-0.24 0.1-0.24 0.09-0.26 0.08-0.27 0.07-0.28 0.06-0.29 0.05-0.3 0.04-0.31 0.02-0.32 0.02-0.33 0.01-0.35c0-4.33-2.52-5.61-4.53-5.61-1.39 0-4.47 0.38-5.93 2.44 1.63 0.06 2.02 1.22 2.02 1.95 0 1.11-0.84 1.91-1.92 1.91-0.97 0-1.96-0.59-1.96-2.02 0-3.28 3.63-5.4 7.85-5.4 4.84 0 8.19 3.25 8.19 6.73 0 2.72-2.22 5.44-6.07 6.24 3.66 1.33 4.99 3.93 4.99 6.06 0 2.75-3.17 4.81-7.03 4.81-3.88 0-6.83-1.89-6.83-4.67 0-1.19 0.76-1.84 1.81-1.84 1.08 0 1.77 0.79 1.77 1.76 0 1.02-0.69 1.75-1.77 1.81 1.22 1.55 3.61 1.93 4.91 1.93 1.56 0 3.76-0.77 3.76-3.8 0-1.47-0.48-3.06-1.39-4.14-1.15-1.33-2.12-1.41-3.87-1.5-0.88-0.08-0.94-0.08-1.11-0.11-0.08 0-0.36-0.06-0.36-0.45 0-0.49 0.31-0.49 0.9-0.49z"/></g>
+</g>
+<g transform="translate(-73.327 73.705)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m497.12 404.48v1.25h-3.88v15.55c0 0.72 0 0.97-0.76 0.97-0.43 0-0.57 0-0.91-0.49l-11.53-16.03v-1.25h10.25l0.23 1.25h-9.2l9.2 12.75v-12.75l-0.23-1.25v-2.86c0-1.19 0-1.61-2.83-1.61h-0.94v-1.25c1.74 0.06 3.97 0.14 5.22 0.14 1.3 0 3.52-0.08 5.27-0.14v1.25h-0.94c-2.83 0-2.83 0.42-2.83 1.61v2.86z"/></g>
+</g>
+<g transform="translate(-50.649 126.62)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m484.09 418.2 0.32-0.08 0.15-0.04 0.3-0.06 0.28-0.06 0.14-0.02 0.13-0.03 0.13-0.02 0.12-0.02 0.12-0.01 0.12-0.02 0.11-0.01 0.11-0.02 0.1-0.01 0.11-0.01 0.09-0.01h0.1l0.18-0.02h0.17l0.07-0.01h0.52c4.59 0 7.31 3.14 7.31 3.67 0 0.37-0.23 0.48-0.4 0.48-0.08 0-0.14 0-0.28-0.11-0.85-0.31-2.69-1.01-5.27-1.01-0.97 0-2.83 0.08-5.09 0.95-0.35 0.17-0.41 0.17-0.46 0.17-0.45 0-0.45-0.39-0.45-0.94v-10.28c0-0.59 0-1.01 0.56-1.01 0.32 0 0.35 0.06 0.71 0.48 1.5 1.92 3.62 2.21 4.84 2.21 2.08 0 3.03-1.68 3.2-1.96 0.63-1.15 0.83-2.47 0.83-4.5 0-1.04 0-3.09-1.05-4.62-0.86-1.27-2.36-2.1-4.06-2.1-2.26 0-4.61 1.25-5.48 3.55 1.33-0.09 1.98 0.77 1.98 1.7 0 1.5-1.28 1.78-1.73 1.78-0.07 0-1.75 0-1.75-1.87 0-3.14 2.86-6.28 7.04-6.28 4.46 0 8.36 3.31 8.36 7.7 0 3.94-3 7.56-7.31 7.56-1.53 0-3.34-0.37-4.87-1.7z"/></g>
+</g>
+<g transform="translate(4.5357 145.14)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m483.91 410.15 0.02 1.06 0.01 0.52 0.03 0.51 0.04 0.51 0.05 0.49 0.06 0.49 0.08 0.48 0.09 0.47 0.11 0.46 0.13 0.46 0.14 0.44 0.08 0.22 0.09 0.21 0.09 0.22 0.2 0.42 0.11 0.2 0.24 0.4c1.18 1.9 3.06 3.18 5.29 3.18 1.05 0 2.44-0.28 3.14-1.22-0.87-0.06-1.61-0.66-1.61-1.67 0-0.88 0.6-1.64 1.65-1.64 1.04 0 1.67 0.7 1.67 1.7 0 2.03-1.47 3.84-4.92 3.84-5.02 0-10.15-4.61-10.15-12.09 0-9.03 4.25-11.75 8.1-11.75 4.25 0 7.94 3.25 7.94 7.81 0 4.42-3.52 7.7-7.6 7.7l-0.17-0.98c1.61 0 2.69-0.63 3.55-1.91 0.84-1.32 0.87-2.79 0.87-4.81 0-1.98 0-3.45-0.94-4.81-0.84-1.22-1.95-1.88-3.65-1.88-1.75 0-3.11 1-3.85 2.55-0.51 1.03-0.79 2.78-0.79 4.88 0 3.37 2.03 5.98 4.81 5.98l0.17 0.98c-2.78 0-4.31-1.84-5.08-3.42z"/></g>
+</g>
+<g transform="translate(58.208 124.73)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><path d="m462.14 410.34 0.25 0.27 0.48 0.5 0.23 0.24 0.22 0.23 0.22 0.22 0.21 0.22 0.2 0.21 0.2 0.2 0.2 0.19 0.38 0.38 0.18 0.17 0.19 0.18 0.35 0.33 0.34 0.32 0.33 0.3 0.33 0.29 0.32 0.29 0.65 0.56 0.33 0.29 0.33 0.28c0 0.05 3.08 2.69 4.88 4.49 4.73 4.64 5.83 7.03 5.83 7.21 0 0.5-0.46 0.5-0.55 0.5-0.35 0-0.5-0.09-0.75-0.54-1.49-2.39-2.53-3.19-3.74-3.19-1.2 0-1.79 0.75-2.54 1.59-0.94 1.16-1.78 2.14-3.44 2.14-3.73 0-6.02-4.62-6.02-5.67 0-0.25 0.14-0.54 0.6-0.54 0.45 0 0.54 0.25 0.64 0.54 0.95 2.3 3.84 2.35 4.23 2.35 1.05 0 2-0.36 3.14-0.75 2-0.75 2.55-0.75 3.85-0.75-1.8-2.14-5.99-5.74-6.92-6.53l-4.49-4.18c-3.39-3.34-5.14-6.18-5.14-6.53 0-0.5 0.5-0.5 0.59-0.5 0.41 0 0.5 0.1 0.8 0.64 1.16 1.75 2.64 3.1 4.24 3.1 1.15 0 1.65-0.46 2.89-1.89 0.86-1.05 1.75-1.85 3.18-1.85 4.94 0 7.83 6.33 7.83 7.67 0 0.25-0.2 0.5-0.59 0.5-0.46 0-0.55-0.29-0.71-0.65-1.14-3.24-4.32-4.17-5.98-4.17-0.98 0-1.89 0.29-2.94 0.64-1.68 0.64-2.43 0.84-3.48 0.84-0.1 0-0.89 0-1.35-0.14z"/><path d="m497.32 419.81 0.03 0.04 0.03 0.03 0.03 0.04 0.02 0.03 0.03 0.03 0.02 0.04 0.06 0.09 0.01 0.03 0.02 0.03 0.01 0.02 0.01 0.04 0.03 0.09 0.01 0.04 0.01 0.03v0.04l0.01 0.04v0.09l0.01 0.05v0.59h-9.12c-1.39 0-1.78 0.03-3.03 0.14-1.81 0.14-1.88 0.39-1.99 0.98h-1.18l-1.22-7.46h1.18c0.07 0.53 0.43 2.82 0.97 3.17 0.28 0.22 3.11 0.22 3.63 0.22h7.59c-1.11-1.47-2.89-3.63-3.61-4.61-4.58-5.99-4.98-11.53-4.98-13.58 0-0.39 0-2 1.62-2 1.68 0 1.68 1.58 1.68 2.03v1.39c0 6.77 1.4 9.86 2.9 11.73z"/></g>
+</g>
+<g transform="translate(65.012 47.247)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill="none" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" xml:space="preserve"><path d="m464.44 411.93-0.19-0.3-0.18-0.29-0.19-0.28-0.19-0.26-0.18-0.25-0.19-0.23-0.19-0.22-0.18-0.21-0.19-0.2-0.19-0.18-0.18-0.17-0.19-0.16-0.19-0.15-0.18-0.14-0.19-0.13-0.19-0.12-0.19-0.11-0.19-0.1-0.38-0.18-0.19-0.07-0.2-0.07-0.19-0.07-0.2-0.05-0.19-0.05-0.4-0.08-0.19-0.03-0.41-0.05-0.4-0.03c-0.61-0.05-1.05-0.05-1.05-1 0-0.3 0.25-0.55 0.64-0.55 1.34 0 2.89 0.16 4.28 0.16 1.64 0 3.39-0.16 4.99-0.16 0.29 0 0.95 0 0.95 0.95 0 0.55-0.45 0.6-0.8 0.6-1.15 0.09-2.34 0.5-2.34 1.73 0 0.61 0.3 1.16 0.69 1.84l3.79 6.39h12.5l-0.14 1.54h-11.42l9.83 16.45 1.59-16.45 0.14-1.54c0.11-1.04 0.8-7.82 0.8-8.32 0-1.5-2.59-1.64-3.58-1.64-0.7 0-1.2 0-1.2-1 0-0.55 0.59-0.55 0.7-0.55 2.03 0 4.19 0.16 6.22 0.16 1.25 0 4.39-0.16 5.64-0.16 0.3 0 0.89 0 0.89 1 0 0.55-0.5 0.55-1.14 0.55-3.09 0-3.09 0.34-3.25 1.79l-3.03 31.13c-0.11 1-0.11 1.2-0.95 1.2-0.8 0-0.99-0.34-1.3-0.84z" fill="#000" stroke-width="0"/></g>
+</g>
+<g transform="translate(28.726 13.985)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill="none" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" xml:space="preserve"><path d="m463.49 410.09-0.05-0.18-0.04-0.17-0.05-0.16-0.08-0.3-0.1-0.26-0.05-0.12-0.05-0.11-0.06-0.11-0.07-0.1-0.14-0.18-0.09-0.07-0.09-0.08-0.11-0.06-0.11-0.07-0.26-0.1-0.15-0.05-0.16-0.04-0.09-0.02-0.09-0.01-0.09-0.02-0.1-0.02-0.2-0.02-0.11-0.01-0.12-0.02-0.11-0.01-0.13-0.01h-0.12l-0.13-0.01-0.14-0.01h-0.14l-0.14-0.01h-0.15l-0.16-0.01h-0.85c-0.85 0-1.35 0-1.35-1 0-0.55 0.46-0.55 1.35-0.55h17.78c7.87 0 13.75 5.87 13.75 10.76 0 3.58-2.89 6.47-7.72 7.02 5.19 0.95 10.42 4.64 10.42 9.38 0 3.68-3.3 6.87-9.28 6.87l-0.69-1.55c4.38 0 5.42-2.93 5.42-5.12 0-4.39-4.28-9.13-10.35-9.13h-7.27l-0.3-1.09h9.41c4.78 0 5.73-3.69 5.73-5.83 0-4.94-4.43-9.76-10.31-9.76h-6.78c-0.69 0-0.8 0-1.09 0.04-0.5 0.05-0.64 0.1-0.64 0.5 0 0.14 0 0.25 0.25 1.14l3.43 13.91 0.3 1.09 3.08 12.36c0.45 1.74 0.54 1.89 2.7 1.89h6.42l0.69 1.55h-16.73c-0.94 0-1.44 0-1.44-1 0-0.55 0.44-0.55 1.39-0.55 0.09 0 1.05 0 1.89-0.09 0.89-0.11 1.34-0.16 1.34-0.8 0-0.2-0.04-0.36-0.2-0.95z" fill="#000" stroke-width="0"/></g>
+</g>
+<g transform="translate(-20.789 12.851)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill="none" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" xml:space="preserve"><path d="m493.38 440.82v0.05l-0.01 0.02v0.04l-0.01 0.02v0.02l-0.03 0.06v0.02l-0.02 0.02-0.03 0.06-0.08 0.08-0.02 0.01-0.02 0.02-0.03 0.01-0.02 0.02-0.03 0.01-0.01 0.01h-0.02l-0.01 0.01h-0.02l-0.02 0.01h-0.03l-0.02 0.01h-0.12c-0.14 0-0.2-0.04-0.75-0.59l-3.48-3.84c-0.44 0.7-2.74 4.43-8.27 4.43-11.11 0-22.33-11.01-22.33-22.56 0-8.23 5.89-13.65 13.52-13.65 4.33 0 8.11 1.98 10.75 4.28 4.64 4.09 5.48 8.62 5.48 8.76 0 0.5-0.5 0.5-0.59 0.5-0.3 0-0.55-0.09-0.66-0.5-0.43-1.44-1.59-4.98-5.03-7.87-3.43-2.78-6.58-3.63-9.15-3.63-4.49 0-9.77 2.6-9.77 10.36 0 2.85 1.05 10.91 6.02 16.74 3.04 3.54 7.73 6.03 12.15 6.03 5.1 0 8.03-3.83 8.03-9.61 0-2-0.15-2.05-0.15-2.55s0.54-0.5 0.75-0.5c0.64 0 0.64 0.11 0.89 1z" fill="#000" stroke-width="0"/></g>
+</g>
+<g transform="translate(-56.318 48.381)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill="none" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" xml:space="preserve"><path d="m463.44 410.09-0.04-0.18-0.05-0.17-0.04-0.16-0.05-0.15-0.04-0.15-0.05-0.13-0.04-0.13-0.05-0.12-0.12-0.22-0.06-0.1-0.07-0.09-0.08-0.09-0.09-0.07-0.09-0.08-0.11-0.06-0.11-0.07-0.12-0.05-0.14-0.05-0.15-0.05-0.16-0.04-0.09-0.02-0.08-0.01-0.2-0.04-0.2-0.02-0.11-0.01-0.11-0.02-0.24-0.02h-0.13l-0.26-0.02h-0.15l-0.14-0.01h-0.15l-0.16-0.01h-0.85c-0.84 0-1.39 0-1.39-0.96 0-0.59 0.44-0.59 1.39-0.59h16.48l-0.89 1.55h-5.62c-0.7 0-0.8 0-1.11 0.04-0.48 0.05-0.64 0.1-0.64 0.5 0 0.14 0 0.25 0.25 1.14l6.83 27.36c0.43 1.74 0.54 1.89 2.68 1.89h5.33c4.89 0 9.02-2.64 9.02-9.22 0-2.43-1-10.6-5.24-16.09-1.43-1.84-5.37-5.62-11.5-5.62l0.89-1.55c10.36 0 20.19 10.51 20.19 21.42 0 7.03-4.23 12.61-11.72 12.61h-16.73c-0.95 0-1.5 0-1.5-0.95 0-0.6 0.45-0.6 1.45-0.6 0.64 0 1.55-0.04 2.14-0.09 0.8-0.11 1.1-0.25 1.1-0.8 0-0.2-0.05-0.36-0.21-0.95z" fill="#000" stroke-width="0"/></g>
+</g>
+<g transform="translate(-56.696 99.03)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><polyline points="456 446 493.44 446 493.44 448.04 456 448.04" fill-rule="nonzero"/><path d="m464.44 411.93-0.19-0.3-0.18-0.29-0.19-0.28-0.19-0.26-0.18-0.25-0.19-0.23-0.19-0.22-0.18-0.21-0.19-0.2-0.19-0.18-0.18-0.17-0.19-0.16-0.19-0.15-0.18-0.14-0.19-0.13-0.19-0.12-0.19-0.11-0.19-0.1-0.38-0.18-0.19-0.07-0.2-0.07-0.19-0.07-0.2-0.05-0.19-0.05-0.4-0.08-0.19-0.03-0.41-0.05-0.4-0.03c-0.61-0.05-1.05-0.05-1.05-1 0-0.3 0.25-0.55 0.64-0.55 1.34 0 2.89 0.16 4.28 0.16 1.64 0 3.39-0.16 4.99-0.16 0.29 0 0.95 0 0.95 0.95 0 0.55-0.45 0.6-0.8 0.6-1.15 0.09-2.34 0.5-2.34 1.73 0 0.61 0.3 1.16 0.69 1.84l3.79 6.39h12.5l-0.14 1.54h-11.42l9.83 16.45 1.59-16.45 0.14-1.54c0.11-1.04 0.8-7.82 0.8-8.32 0-1.5-2.59-1.64-3.58-1.64-0.7 0-1.2 0-1.2-1 0-0.55 0.59-0.55 0.7-0.55 2.03 0 4.19 0.16 6.22 0.16 1.25 0 4.39-0.16 5.64-0.16 0.3 0 0.89 0 0.89 1 0 0.55-0.5 0.55-1.14 0.55-3.09 0-3.09 0.34-3.25 1.79l-3.03 31.13c-0.11 1-0.11 1.2-0.95 1.2-0.8 0-0.99-0.34-1.3-0.84z"/></g>
+</g>
+<g transform="translate(-23.435 136.07)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><polyline points="456 446 496.32 446 496.32 448.04 456 448.04" fill-rule="nonzero"/><path d="m463.49 410.09-0.05-0.18-0.04-0.17-0.05-0.16-0.08-0.3-0.1-0.26-0.05-0.12-0.05-0.11-0.06-0.11-0.07-0.1-0.14-0.18-0.09-0.07-0.09-0.08-0.11-0.06-0.11-0.07-0.26-0.1-0.15-0.05-0.16-0.04-0.09-0.02-0.09-0.01-0.09-0.02-0.1-0.02-0.2-0.02-0.11-0.01-0.12-0.02-0.11-0.01-0.13-0.01h-0.12l-0.13-0.01-0.14-0.01h-0.14l-0.14-0.01h-0.15l-0.16-0.01h-0.85c-0.85 0-1.35 0-1.35-1 0-0.55 0.46-0.55 1.35-0.55h17.78c7.87 0 13.75 5.87 13.75 10.76 0 3.58-2.89 6.47-7.72 7.02 5.19 0.95 10.42 4.64 10.42 9.38 0 3.68-3.3 6.87-9.28 6.87l-0.69-1.55c4.38 0 5.42-2.93 5.42-5.12 0-4.39-4.28-9.13-10.35-9.13h-7.27l-0.3-1.09h9.41c4.78 0 5.73-3.69 5.73-5.83 0-4.94-4.43-9.76-10.31-9.76h-6.78c-0.69 0-0.8 0-1.09 0.04-0.5 0.05-0.64 0.1-0.64 0.5 0 0.14 0 0.25 0.25 1.14l3.43 13.91 0.3 1.09 3.08 12.36c0.45 1.74 0.54 1.89 2.7 1.89h6.42l0.69 1.55h-16.73c-0.94 0-1.44 0-1.44-1 0-0.55 0.44-0.55 1.39-0.55 0.09 0 1.05 0 1.89-0.09 0.89-0.11 1.34-0.16 1.34-0.8 0-0.2-0.04-0.36-0.2-0.95z"/></g>
+</g>
+<g transform="translate(30.994 135.69)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><polyline points="456 446 495.24 446 495.24 448.04 456 448.04" fill-rule="nonzero"/><path d="m493.38 440.82v0.05l-0.01 0.02v0.04l-0.01 0.02v0.02l-0.03 0.06v0.02l-0.02 0.02-0.03 0.06-0.08 0.08-0.02 0.01-0.02 0.02-0.03 0.01-0.02 0.02-0.03 0.01-0.01 0.01h-0.02l-0.01 0.01h-0.02l-0.02 0.01h-0.03l-0.02 0.01h-0.12c-0.14 0-0.2-0.04-0.75-0.59l-3.48-3.84c-0.44 0.7-2.74 4.43-8.27 4.43-11.11 0-22.33-11.01-22.33-22.56 0-8.23 5.89-13.65 13.52-13.65 4.33 0 8.11 1.98 10.75 4.28 4.64 4.09 5.48 8.62 5.48 8.76 0 0.5-0.5 0.5-0.59 0.5-0.3 0-0.55-0.09-0.66-0.5-0.43-1.44-1.59-4.98-5.03-7.87-3.43-2.78-6.58-3.63-9.15-3.63-4.49 0-9.77 2.6-9.77 10.36 0 2.85 1.05 10.91 6.02 16.74 3.04 3.54 7.73 6.03 12.15 6.03 5.1 0 8.03-3.83 8.03-9.61 0-2-0.15-2.05-0.15-2.55s0.54-0.5 0.75-0.5c0.64 0 0.64 0.11 0.89 1z"/></g>
+</g>
+<g transform="translate(63.878 98.274)">
+<g transform="matrix(.3 0 0 -.3 -52.5 222.75)" fill-rule="evenodd" stroke="#000" stroke-miterlimit="10.433" stroke-width="0" xml:space="preserve"><polyline points="456 446 498.72 446 498.72 448.04 456 448.04" fill-rule="nonzero"/><path d="m463.44 410.09-0.04-0.18-0.05-0.17-0.04-0.16-0.05-0.15-0.04-0.15-0.05-0.13-0.04-0.13-0.05-0.12-0.12-0.22-0.06-0.1-0.07-0.09-0.08-0.09-0.09-0.07-0.09-0.08-0.11-0.06-0.11-0.07-0.12-0.05-0.14-0.05-0.15-0.05-0.16-0.04-0.09-0.02-0.08-0.01-0.2-0.04-0.2-0.02-0.11-0.01-0.11-0.02-0.24-0.02h-0.13l-0.26-0.02h-0.15l-0.14-0.01h-0.15l-0.16-0.01h-0.85c-0.84 0-1.39 0-1.39-0.96 0-0.59 0.44-0.59 1.39-0.59h16.48l-0.89 1.55h-5.62c-0.7 0-0.8 0-1.11 0.04-0.48 0.05-0.64 0.1-0.64 0.5 0 0.14 0 0.25 0.25 1.14l6.83 27.36c0.43 1.74 0.54 1.89 2.68 1.89h5.33c4.89 0 9.02-2.64 9.02-9.22 0-2.43-1-10.6-5.24-16.09-1.43-1.84-5.37-5.62-11.5-5.62l0.89-1.55c10.36 0 20.19 10.51 20.19 21.42 0 7.03-4.23 12.61-11.72 12.61h-16.73c-0.95 0-1.5 0-1.5-0.95 0-0.6 0.45-0.6 1.45-0.6 0.64 0 1.55-0.04 2.14-0.09 0.8-0.11 1.1-0.25 1.1-0.8 0-0.2-0.05-0.36-0.21-0.95z"/></g>
+</g>
+</g>
+</g>
+</svg>
diff --git a/Triangulation_on_hyperbolic_surface_2/examples/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt b/Triangulation_on_hyperbolic_surface_2/examples/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt
new file mode 100644
index 00000000000..26fafb1b64d
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/examples/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt
@@ -0,0 +1,15 @@
+cmake_minimum_required(VERSION 3.12...3.31)
+
+project( Triangulation_on_hyperbolic_surface_2_Examples )
+
+# CGAL and its components
+find_package( CGAL REQUIRED  )
+
+# create a target per cppfile
+file(
+  GLOB cppfiles
+  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
+  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
+foreach(cppfile ${cppfiles})
+  create_single_source_cgal_program("${cppfile}")
+endforeach()
diff --git a/Triangulation_on_hyperbolic_surface_2/examples/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.cpp b/Triangulation_on_hyperbolic_surface_2/examples/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.cpp
new file mode 100644
index 00000000000..910a6b7a593
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/examples/Triangulation_on_hyperbolic_surface_2/Triangulation_on_hyperbolic_surface_2.cpp
@@ -0,0 +1,38 @@
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_fundamental_domain_factory_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2_IO.h>
+#include <time.h>
+
+typedef CGAL::Exact_rational                                         Rational;
+typedef CGAL::Simple_cartesian<Rational>                             Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>     ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>              Traits;
+typedef CGAL::Hyperbolic_fundamental_domain_2<Traits>                Domain;
+typedef CGAL::Hyperbolic_fundamental_domain_factory_2<Traits>        Factory;
+typedef CGAL::Triangulation_on_hyperbolic_surface_2<Traits>          Triangulation;
+
+int main() {
+  // Generates the domain:
+  Factory factory = Factory();
+  Domain domain = factory.make_hyperbolic_fundamental_domain_g2(time(NULL)); // get a random seed with time(NULL)
+
+  // Triangulates the domain:
+  Triangulation triangulation = Triangulation(domain);
+
+  // Applies the Delaunay flip algorithm to the triangulation:
+  triangulation.make_Delaunay();
+
+  // Saves the triangulation:
+  std::ofstream  output_file = std::ofstream ("OutputTriangulation.txt");
+  output_file << triangulation;
+  output_file.close();
+
+  // Prints the triangulation:
+  std::cout << triangulation << std::endl;
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Complex_number.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Complex_number.h
new file mode 100644
index 00000000000..52baafdcdda
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Complex_number.h
@@ -0,0 +1,175 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallée (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_COMPLEX_NUMBER_H
+#define CGAL_COMPLEX_NUMBER_H
+
+#include <fstream>
+#include <sstream>
+#include <utility>
+
+namespace CGAL {
+
+/*
+Templated by a field FT. Represents a complex number over FT.
+*/
+template <class FT>
+class Complex_number
+{
+  typedef Complex_number<FT> Self;
+
+  FT real_, imag_;
+
+public:
+  Complex_number(const FT& real_part)
+    : real_(real_part),
+      imag_(0)
+  {}
+
+  Complex_number(const FT& real_part, const FT& imaginary_part)
+    : real_(real_part),
+      imag_(imaginary_part)
+  {}
+
+  Complex_number()
+    : Complex_number(FT(0), FT(0))
+  {}
+
+  template<class U,class V>
+  Complex_number(U&& real_part, V&& imaginary_part)
+    : real_(std::forward<U>(real_part)),
+      imag_(std::forward<V>(imaginary_part))
+  {}
+
+  void real(const FT& real_part) {
+    real_ = real_part;
+  }
+
+  void imag(const FT& imaginary_part) {
+    imag_ = imaginary_part;
+  }
+
+  FT real() const {
+    return real_;
+  }
+
+  FT imag() const {
+    return imag_;
+  }
+
+  Self& operator+=(const Self& other);
+  Self& operator-=(const Self& other);
+  Self& operator*=(const Self& other);
+  Self& operator/=(const Self& other);
+
+  // These member versions are not working ?
+  /* Self operator+(const Self& z) const; */
+  /* Self operator-(const Self& z) const; */
+
+  // Hidden friends
+  friend Self operator+(const Self& z) {
+    return z;
+  }
+
+  friend Self operator-(const Self& z) {
+    return Self(-z.real_,-z.imag_);
+  }
+
+  friend bool operator==(const Self& z1, const Self& z2) {
+    return (z1.real_==z2.real_ && z1.imag_==z2.imag_);
+  }
+
+  friend bool operator!=(const Self& z1, const Self& z2) {
+    return !operator==(z1, z2);
+  }
+
+  friend Self operator+(const Self& z1, const Self& z2) {
+    return Self(z1.real_+z2.real_, z1.imag_+z2.imag_);
+  }
+
+  friend Self operator-(const Self& z1, const Self& z2) {
+    return Self(z1.real_-z2.real_, z1.imag_-z2.imag_);
+  }
+
+  friend Self operator*(const Self& z1, const Self& z2) {
+    return Self(z1.real_*z2.real_-z1.imag_*z2.imag_, z1.real_*z2.imag_+z1.imag_*z2.real_);
+  }
+
+  friend Self operator/(const Self& z1, const Self& z2) {
+    FT m2 = norm(z2);
+    return Self(z1.real_/m2, z1.imag_/m2)*conj(z2);
+  }
+
+  friend std::ostream& operator<<(std::ostream& s, const Self& z) {
+    s << z.real_ << std::endl << z.imag_ << std::endl;
+    return s;
+  }
+
+  friend void operator>>(std::istream& s, Self& z) {
+    FT ft;
+    s >> ft;
+    z.real(ft);
+    s >> ft;
+    z.imag(ft);
+  }
+};
+
+////////////////////////////////////////////////////////////////////////////////
+template<class FT>
+Complex_number<FT>& Complex_number<FT>::operator+=(const Complex_number<FT>& other)
+{
+  real_ += other.real();
+  imag_ += other.imag();
+  return *this;
+}
+
+template<class FT>
+Complex_number<FT>& Complex_number<FT>::operator-=(const Complex_number<FT>& other)
+{
+  real_ -= other.real();
+  imag_ -= other.imag();
+  return *this;
+}
+
+template<class FT>
+Complex_number<FT>& Complex_number<FT>::operator*=(const Complex_number<FT>& other)
+{
+  real_ = real_*other.real() - imag_*other.imag();
+  imag_ = real_*other.imag() + imag_*other.real();
+  return *this;
+}
+
+template<class FT>
+Complex_number<FT>& Complex_number<FT>::operator/=(const Complex_number<FT>& other)
+{
+  FT m2 = norm(other);
+  real_ /= m2;
+  imag_ /= m2;
+  this *= conj(other);
+  return *this;
+}
+
+template<class FT>
+FT norm(const Complex_number<FT>& z)
+{
+  return z.real()*z.real() + z.imag()*z.imag();
+}
+
+template<class FT>
+Complex_number<FT> conj(const Complex_number<FT>& z)
+{
+  return Complex_number<FT>(z.real(), -z.imag());
+}
+
+} // namespace CGAL
+
+#endif // CGAL_COMPLEX_NUMBER_H
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_2.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_2.h
new file mode 100644
index 00000000000..5f1a8edb88d
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_2.h
@@ -0,0 +1,221 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_HYPERBOLIC_FUNDAMENTAL_DOMAIN_2_H
+#define CGAL_HYPERBOLIC_FUNDAMENTAL_DOMAIN_2_H
+
+#include <CGAL/license/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/Hyperbolic_isometry_2.h>
+
+#include <CGAL/assertions.h>
+
+#include <iostream>
+#include <vector>
+
+namespace CGAL {
+
+/*
+Represents a convex geodesic hyperbolic domain D of a closed orientable hyperbolic surface.
+The domain D is given as a convex geodesic hyperbolic polygon P given by the list of its vertices in the hyperbolic plane,
+together with a pairing of the sides of P, such that every two paired sides have the same length, and such that
+identifying every two paired sides in a way that respects the orientation of P would result in a closed
+orientable hyperbolic surface.
+*/
+template<class Traits>
+class Hyperbolic_fundamental_domain_2
+{
+public:
+  typedef typename Traits::Hyperbolic_point_2                    Point;
+
+  Hyperbolic_fundamental_domain_2() {};
+
+  template<class PointRange, class PairingRange>
+  Hyperbolic_fundamental_domain_2(PointRange & vertices, PairingRange & pairings)
+  {
+    vertices_ = std::vector<Point>(vertices.begin(), vertices.end());
+    pairings_ = std::vector<std::size_t>(pairings.begin(), pairings.end());
+  }
+
+  // returns the number of vertices (equivalently, the number of sides)
+  std::size_t size() const;
+
+  // returns the index-th vertex
+  const Point& vertex(std::size_t index) const;
+
+  // returns the index of the side paired to side A, where A is the index-th side
+  std::size_t paired_side(std::size_t index) const;
+
+  // returns the isometry that maps side A to side B, where B is the index-th side, and A is the side paired to B
+  Hyperbolic_isometry_2<Traits> side_pairing(std::size_t index) const;
+
+  std::istream& from_stream(std::istream& s);
+  std::ostream& to_stream(std::ostream& s) const;
+
+  bool is_valid() const;
+
+private:
+  std::vector<Point> vertices_;
+  std::vector<std::size_t> pairings_;
+};
+
+//template<class Traits> std::ostream& operator<<(std::ostream& s, const Hyperbolic_fundamental_domain_2<Traits>& domain);
+//template<class Traits> std::istream& operator>>(std::istream& s, Hyperbolic_fundamental_domain_2<Traits>& domain);
+
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+std::size_t
+Hyperbolic_fundamental_domain_2<Traits>::
+size() const
+{
+  CGAL_precondition(is_valid());
+  return vertices_.size();
+}
+
+template<class Traits>
+const typename Hyperbolic_fundamental_domain_2<Traits>::Point&
+Hyperbolic_fundamental_domain_2<Traits>::
+vertex(std::size_t index) const
+{
+  CGAL_precondition(is_valid());
+  return vertices_[index];
+}
+
+template<class Traits>
+std::size_t
+Hyperbolic_fundamental_domain_2<Traits>::
+paired_side(std::size_t index) const
+{
+  CGAL_precondition(is_valid());
+  return pairings_[index];
+}
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits>
+Hyperbolic_fundamental_domain_2<Traits>::
+side_pairing(std::size_t index) const
+{
+  CGAL_precondition(is_valid());
+  std::size_t n = size();
+  std::size_t paired_index = paired_side(index);
+
+  //const Point& p1,p2,q1,q2;
+  const Point& q1 = vertex(index);
+  const Point& q2 = vertex((index+1)%n);
+  const Point& p2 = vertex(paired_index);
+  const Point& p1 = vertex((paired_index+1)%n);
+
+  Hyperbolic_isometry_2<Traits> isom = isometry_pairing_the_sides<Traits>(p1,p2,q1,q2);
+  return isom;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+std::ostream&
+Hyperbolic_fundamental_domain_2<Traits>::
+to_stream(std::ostream& s) const
+{
+  std::size_t n = size();
+
+  s << std::to_string(n) << std::endl;
+
+  for (std::size_t k=0; k<n; ++k) {
+    s << paired_side(k) << std::endl;
+  }
+
+  for (std::size_t k=0; k<n; ++k) {
+    s << vertex(k) << std::endl;
+  }
+  return s;
+}
+
+template<class Traits>
+std::istream&
+Hyperbolic_fundamental_domain_2<Traits>::
+from_stream(std::istream& s)
+{
+  vertices_.clear();
+  pairings_.clear();
+
+  std::string line;
+  s >> line;
+  std::size_t size = std::stoi(line);
+  vertices_.reserve(size);
+  pairings_.reserve(size);
+
+  for (std::size_t k=0; k<size; ++k) {
+    s >> line;
+    pairings_.push_back(std::stoi(line));
+  }
+
+  for (std::size_t k=0; k<size; ++k) {
+    Point p;
+    s >> p;
+    vertices_.push_back(p);
+  }
+  return s;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+bool
+Hyperbolic_fundamental_domain_2<Traits>::
+is_valid()const
+{
+  // Get the number of vertices
+  std::size_t n = vertices_.size();
+
+  // Check that the number of vertices is even
+  if (n%2) {
+    return false;
+  }
+
+  // Check that there are as many side pairings as vertices
+  if (pairings_.size() != n) {
+    return false;
+  }
+
+  // Check that the pairings_ vector encodes a perfect matching of the set {0,1,\dots,n-1}
+  std::vector<bool> already_paired(n);
+  for (std::size_t k=0; k<n; ++k) {
+    already_paired[k] = false;
+  }
+  for (std::size_t k=0; k<n; ++k) {
+    std::size_t paired_side = pairings_[k];
+    if (paired_side>=n) {
+      return false;
+    }
+    if (already_paired[paired_side]) {
+      return false;
+    }
+    already_paired[paired_side] = true;
+  }
+
+  // Check that the vertices all lie within the open unit disk
+  for (std::size_t k=0; k<n; ++k) {
+    if (norm(Complex_number(vertices_[k].x(), vertices_[k].y())) >= typename Traits::FT(1)) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+} // namespace CGAL
+
+#endif // CGAL_HYPERBOLIC_FUNDAMENTAL_DOMAIN_2_H
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_factory_2.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_factory_2.h
new file mode 100644
index 00000000000..76a106378ef
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_fundamental_domain_factory_2.h
@@ -0,0 +1,284 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_HYPERBOLIC_FUNDAMENTAL_DOMAIN_FACTORY_2_H
+#define CGAL_HYPERBOLIC_FUNDAMENTAL_DOMAIN_FACTORY_2_H
+
+#include <CGAL/license/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/Hyperbolic_fundamental_domain_2.h>
+#include <CGAL/Random.h>
+
+#include <cmath>
+#include <vector>
+
+namespace CGAL {
+
+/*
+Factory class, whose only purpose is to construct random fundamental domains of
+closed orientable hyperbolic surfaces. The function
+`make_hyperbolic_fundamental_domain_g2()` constructs such a domain for a surface of
+genus 2.
+*/
+template<class Traits>
+class Hyperbolic_fundamental_domain_factory_2
+{
+private:
+  typedef typename Traits::FT                    FT;
+  typedef typename Traits::Complex               Cmplx;
+  typedef typename Traits::Hyperbolic_point_2    Point;
+
+  Random random_;
+
+public:
+  Hyperbolic_fundamental_domain_factory_2();
+  Hyperbolic_fundamental_domain_2<Traits> make_hyperbolic_fundamental_domain_g2(unsigned int seed);
+
+private:
+  float random_positive_float(); // returns number in [0,1]
+  float random_float(); // returns number in [-1,1]
+  Complex_number<float> random_complex_float(); // returns complex z such that modulus(z) < 1 and imag(z) > 0
+
+  FT exact_number_from_float(float x);
+  Cmplx exact_complex_from_float_complex(const Complex_number<float>& z);
+
+  bool try_to_compute_inexact_z0_from_z1_z2_z3(Complex_number<float>& z0, Complex_number<float>& z1, Complex_number<float>& z2, Complex_number<float>& z3);
+  bool try_to_compute_exact_z3_from_z0_z1_z2(Cmplx& z0, Cmplx& z1, Cmplx& z2, Cmplx& z3);
+
+  bool sanity_check(Cmplx& z0, Cmplx& z1, Cmplx& z2, Cmplx& z3);
+
+  const int CGAL_DENOMINATOR_FOR_GENERATION = 10000;
+};
+
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+  Hyperbolic_fundamental_domain_factory_2<Traits>::Hyperbolic_fundamental_domain_factory_2() {}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+Hyperbolic_fundamental_domain_2<Traits>
+Hyperbolic_fundamental_domain_factory_2<Traits>::
+make_hyperbolic_fundamental_domain_g2(unsigned int seed)
+{
+  random_ = Random(seed);
+  bool is_domain_generated = false;
+  Cmplx exact_z0, exact_z1, exact_z2, exact_z3;
+
+  while (!is_domain_generated) {
+    // 1. Generate inexact z0,z1,z2,z3
+    Complex_number<float> z0, z1, z2, z3;
+    z1 = random_complex_float();
+    z2 = random_complex_float();
+    z3 = random_complex_float();
+    while (! try_to_compute_inexact_z0_from_z1_z2_z3(z0,z1,z2,z3)) {
+      z1 = random_complex_float();
+      z2 = random_complex_float();
+      z3 = random_complex_float();
+    }
+
+    // 2. Compute exact z0,z1,z2,z3 nearby
+    exact_z0 = exact_complex_from_float_complex(z0);
+    exact_z1 = exact_complex_from_float_complex(z1);
+    exact_z2 = exact_complex_from_float_complex(z2);
+    exact_z3 = exact_complex_from_float_complex(z3);
+
+    // 3. Modify z3 to fix the area...
+    is_domain_generated = try_to_compute_exact_z3_from_z0_z1_z2(exact_z0, exact_z1, exact_z2, exact_z3);
+    if (is_domain_generated) {
+      // ... and perform a sanity check
+      is_domain_generated = sanity_check(exact_z0, exact_z1, exact_z2, exact_z3);
+    }
+  }
+
+  Cmplx exact_zero(FT(0), FT(0));
+  std::vector<Point> vertices;
+  vertices.push_back(Point(exact_z0.real(), exact_z0.imag()));
+  vertices.push_back(Point(exact_z1.real(), exact_z1.imag()));
+  vertices.push_back(Point(exact_z2.real(), exact_z2.imag()));
+  vertices.push_back(Point(exact_z3.real(), exact_z3.imag()));
+  vertices.push_back(Point(-exact_z0.real(), -exact_z0.imag()));
+  vertices.push_back(Point(-exact_z1.real(), -exact_z1.imag()));
+  vertices.push_back(Point(-exact_z2.real(), -exact_z2.imag()));
+  vertices.push_back(Point(-exact_z3.real(), -exact_z3.imag()));
+
+  std::vector<int> pairings;
+  for (int k=0; k<8; ++k) {
+    pairings.push_back((k+4)%8);
+  }
+
+  Hyperbolic_fundamental_domain_2<Traits> domain(vertices, pairings);
+  return domain;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+float Hyperbolic_fundamental_domain_factory_2<Traits>::random_positive_float() {
+  return random_.uniform_01<float>();
+}
+
+template<class Traits>
+float Hyperbolic_fundamental_domain_factory_2<Traits>::random_float() {
+  return random_.uniform_01<float>() * 2  - 1;
+}
+
+template<class Traits>
+Complex_number<float>
+Hyperbolic_fundamental_domain_factory_2<Traits>::
+random_complex_float()
+{
+  Complex_number<float> result (random_float(), random_positive_float());
+  while (norm(result) >= 1) {
+    result.real(random_float());
+    result.imag(random_positive_float());
+  }
+
+  return result;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+typename Traits::FT
+Hyperbolic_fundamental_domain_factory_2<Traits>::
+exact_number_from_float(float x)
+{
+  if (x < 0) {
+    return FT(0)-exact_number_from_float(-x);
+  }
+  return FT(int(x*CGAL_DENOMINATOR_FOR_GENERATION)%CGAL_DENOMINATOR_FOR_GENERATION)/FT(CGAL_DENOMINATOR_FOR_GENERATION);
+}
+
+template<class Traits>
+typename Traits::Complex
+Hyperbolic_fundamental_domain_factory_2<Traits>::
+exact_complex_from_float_complex(const Complex_number<float>& z)
+{
+  return Cmplx(exact_number_from_float(z.real()), exact_number_from_float(z.imag()));
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+bool Hyperbolic_fundamental_domain_factory_2<Traits>::
+try_to_compute_inexact_z0_from_z1_z2_z3(Complex_number<float>& z0,
+                                        Complex_number<float>& z1,
+                                        Complex_number<float>& z2,
+                                        Complex_number<float>& z3)
+{
+  if (((z2/z1).imag()<=0) || ((z3/z2).imag()<=0)) {
+    return false;
+  }
+
+  Complex_number<float> one(1.0f, 0.0f);
+  Complex_number<float> u = (one - conj(z1*z2))   *   (one - conj(z2*z3));
+  float a = -(conj(u*z1)*z3).imag();
+  float b = (u*(conj(z3-z1))).imag();
+  float c = u.imag();
+
+  const float COMPUTATION_TRESHOLD = 0.00001f;
+  if (a+b+c> 0 - COMPUTATION_TRESHOLD) {
+    return false;
+  }
+
+  z0.real(2.0f * c / (std::sqrt(b * b - 4.0f * a * c) - b));
+  z0.imag(0.0f);
+  return true;
+}
+
+template<class Traits>
+bool
+Hyperbolic_fundamental_domain_factory_2<Traits>::
+try_to_compute_exact_z3_from_z0_z1_z2(Cmplx& z0, Cmplx& z1, Cmplx& z2, Cmplx& z3)
+{
+  FT zero_number (0);
+  FT one_number (1);
+  if ((z0.real()<=zero_number) || (z1.imag()<=zero_number) || (z2.imag()<=zero_number) || (z3.imag()<=zero_number)) {
+    return false;
+  }
+
+  if ((norm(z0)>=one_number) || (norm(z1)>=one_number) || (norm(z2)>=one_number) || (norm(z3)>=one_number)) {
+    return false;
+  }
+
+  if (((z1/z0).imag()<=zero_number) || ((z2/z1).imag()<=zero_number) || ((z3/z2).imag()<=zero_number)) {
+    return false;
+  }
+
+  Cmplx one_cmplx (FT(1), FT(0));
+  Cmplx two_cmplx(FT(2), FT(0));
+
+  Cmplx f_of_z0 = two_cmplx * z0 / (z0*z0 + one_cmplx);
+  Cmplx f_of_z1 = (z0 + z1) / (z0*z1 + one_cmplx);
+  Cmplx f_of_z2 = (z0 + z2) / (z0*z2 + one_cmplx);
+  Cmplx f_of_z3 = (z0 + z3) / (z0*z3 + one_cmplx);
+
+  Cmplx intermediate = (one_cmplx - f_of_z0*conj(f_of_z1)) * (one_cmplx - f_of_z1*conj(f_of_z2));
+  FT P_of_zero = intermediate.imag();
+  FT P_of_one = (intermediate * (one_cmplx-f_of_z2*conj(f_of_z3))).imag();
+
+  if (P_of_one == P_of_zero) {
+    return false;
+  }
+
+  FT lbda = P_of_zero / (P_of_zero - P_of_one);
+  Cmplx V (lbda*(f_of_z3.real()), lbda*(f_of_z3.imag()));
+
+  if ((V.imag()<=zero_number) || (norm(V)>=one_number) || ((V/f_of_z2).imag()<=zero_number)) {
+    return false;
+  }
+
+  z3 = (V - z0) / (one_cmplx - z0*V);
+
+  return true;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+bool
+Hyperbolic_fundamental_domain_factory_2<Traits>::
+sanity_check(Cmplx& z0, Cmplx& z1, Cmplx& z2, Cmplx& z3)
+{
+  FT zero_number(0);
+  FT one_number(1);
+
+  // 1. Check the positions
+  if ((z0.imag()!=zero_number) || (z0.real()<=zero_number) || (z1.imag()<=zero_number) || (z2.imag()<=zero_number) || (z3.imag()<=zero_number)) {
+    return false;
+  }
+
+  if ((norm(z0)>=one_number) || (norm(z1)>=one_number) || (norm(z2)>=one_number) || (norm(z3)>=one_number)) {
+    return false;
+  }
+
+  if (((z2/z1).imag()<=zero_number) || ((z3/z2).imag()<=zero_number)) {
+    return false;
+  }
+
+  // 2. Check the area
+  Cmplx one_cmplx (one_number, zero_number);
+  Cmplx Z = (one_cmplx-z0*conj(z1)) * (one_cmplx-z1*conj(z2)) *(one_cmplx-z2*conj(z3)) *(one_cmplx+z3*conj(z0));
+  if (Z.imag()!=zero_number) {
+    return false;
+  }
+
+  return true;
+}
+
+} // namespace CGAL
+
+#endif // CGAL_HYPERBOLIC_FUNDAMENTAL_DOMAIN_FACTORY_2_H
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_isometry_2.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_isometry_2.h
new file mode 100644
index 00000000000..87bd5151a1f
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_isometry_2.h
@@ -0,0 +1,235 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_HYPERBOLIC_ISOMETRY_2_H
+#define CGAL_HYPERBOLIC_ISOMETRY_2_H
+
+#include <CGAL/license/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/Complex_number.h>
+
+namespace CGAL {
+
+/*
+Represents a hyperbolic isometry in the Poincare disk model the hyperbolic plane.
+The isometry f is stored as list (c0, c1, c2, c3) of 4 complex numbers,
+so that f(z) = (c0 z + c1) / (c2 z + c3) holds on every complex z in the open unit disk.
+*/
+template<class Traits>
+class Hyperbolic_isometry_2
+{
+public:
+  typedef Hyperbolic_isometry_2<Traits>                    Self;
+  typedef typename Traits::FT                              FT;
+  typedef typename Traits::Complex                         Complex_number;
+  typedef typename Traits::Hyperbolic_point_2              Point;
+
+  Hyperbolic_isometry_2();
+  Hyperbolic_isometry_2(const Complex_number& c0, const Complex_number& c1, const Complex_number& c2, const Complex_number& c3);
+
+  void set_to_identity();
+
+  // Can be used to set the coefficients manually. Warning: the implementation does not check that the resulting moebius transform fixes the unit circle.
+  void set_coefficients(const Complex_number& c0, const Complex_number& c1, const Complex_number& c2, const Complex_number& c3);
+  void set_coefficient(int index, const Complex_number& coefficient);
+
+  // returns the index-th coefficient
+  const Complex_number& get_coefficient(int index) const;
+
+  // evaluates the isometry at point
+  Point evaluate(const Point& point) const;
+  Point operator()(const Point& point) const;
+
+private:
+  Complex_number coefficients_[4];
+};
+
+// returns the composition of two isometries.
+template<class Traits>
+  Hyperbolic_isometry_2<Traits>  operator*(const Hyperbolic_isometry_2<Traits>& iso1, const Hyperbolic_isometry_2<Traits>& iso2);
+
+// template<class Traits> std::ostream& operator<<(std::ostream& s, const Hyperbolic_isometry_2<Traits>& isometry);
+
+// When inverse is 'false', returns the hyperbolic translation that maps -p to zero, and zero to p.
+// Otherwise, returns the hyperbolic translation that maps p to zero, and zero to -p.
+template<class Traits>
+Hyperbolic_isometry_2<Traits> hyperbolic_translation(const typename Traits::Hyperbolic_point_2& p,
+                                                     bool inverse = false);
+
+// When inverse is 'false', returns the hyperbolic rotation around zero that maps p to q.
+// Otherwise, returns the hyperbolic rotation around zero that maps q to p.
+template<class Traits>
+Hyperbolic_isometry_2<Traits> hyperbolic_rotation(const typename Traits::Hyperbolic_point_2& p,
+                                                  const typename Traits::Hyperbolic_point_2& q,
+                                                  bool inverse = false);
+
+// returns the hyperbolic isometry that maps p1 to q1 and p2 to q2
+template<class Traits>
+Hyperbolic_isometry_2<Traits> isometry_pairing_the_sides(const typename Traits::Hyperbolic_point_2& p1,
+                                                         const typename Traits::Hyperbolic_point_2& p2,
+                                                         const typename Traits::Hyperbolic_point_2& q1,
+                                                         const typename Traits::Hyperbolic_point_2& q2);
+
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits>::
+Hyperbolic_isometry_2()
+{
+  set_to_identity();
+}
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits>::
+Hyperbolic_isometry_2(const Complex_number& c0,
+                      const Complex_number& c1,
+                      const Complex_number& c2,
+                      const Complex_number& c3)
+{
+  set_coefficients(c0,c1,c2,c3);
+}
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+void
+Hyperbolic_isometry_2<Traits>::
+set_to_identity()
+{
+  set_coefficients(Complex_number(FT(1)),
+                   Complex_number(FT(0)),
+                   Complex_number(FT(0)),
+                   Complex_number(FT(1)));
+}
+
+template<class Traits>
+void
+Hyperbolic_isometry_2<Traits>::
+set_coefficients(const Complex_number& c0,
+                 const Complex_number& c1,
+                 const Complex_number& c2,
+                 const Complex_number& c3)
+{
+  set_coefficient(0, c0);
+  set_coefficient(1, c1);
+  set_coefficient(2, c2);
+  set_coefficient(3, c3);
+}
+
+template<class Traits>
+void
+Hyperbolic_isometry_2<Traits>::
+set_coefficient(int index, const Complex_number& coefficient)
+{
+  coefficients_[index] = coefficient;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+const typename Traits::Complex&
+Hyperbolic_isometry_2<Traits>::
+get_coefficient(int index) const
+{
+  return coefficients_[index];
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+typename Traits::Hyperbolic_point_2
+Hyperbolic_isometry_2<Traits>::
+evaluate(const Point& point) const
+{
+  Complex_number z(point.x(), point.y());
+  Complex_number numerator_of_the_result = coefficients_[0] * z + coefficients_[1];
+  Complex_number denominator_of_the_result = coefficients_[2] * z + coefficients_[3];
+  Complex_number result = numerator_of_the_result / denominator_of_the_result;
+  return Point(result.real(), result.imag());
+}
+
+template<class Traits>
+typename Traits::Hyperbolic_point_2
+Hyperbolic_isometry_2<Traits>::
+operator()(const Point& point) const
+{
+  return evaluate(point);
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits> operator*(const Hyperbolic_isometry_2<Traits>& iso1,
+                                        const Hyperbolic_isometry_2<Traits>& iso2)
+{
+  Hyperbolic_isometry_2<Traits> result;
+  for (int i=0; i<2; i++) {
+    for (int j=0; j<2; j++) {
+      result.set_coefficient(2*i+j,
+        iso1.get_coefficient(2*i) * iso2.get_coefficient(j) + iso1.get_coefficient(2*i+1) * iso2.get_coefficient(2+j));
+    }
+  }
+  return result;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits> hyperbolic_translation(const typename Traits::Hyperbolic_point_2& p,
+                                                     bool inverse)
+{
+  typename Traits::Complex one (typename Traits::FT(1));
+  typename Traits::Complex z;
+  if (inverse) {
+    z = typename Traits::Complex(p.x(), p.y());
+  } else {
+    z = - typename Traits::Complex(p.x(), p.y());
+  }
+  Hyperbolic_isometry_2<Traits> result;
+  result.set_coefficients(one, z, conj(z), one);
+  return result;
+}
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits> hyperbolic_rotation(const typename Traits::Hyperbolic_point_2& p,
+                                                  const typename Traits::Hyperbolic_point_2& q,
+                                                  bool inverse)
+{
+  typename Traits::Complex zero (typename Traits::FT(0));
+
+  Hyperbolic_isometry_2<Traits> result;
+  if (inverse) {
+    result.set_coefficients(typename Traits::Complex(p.x(), p.y()), zero, zero, typename Traits::Complex(q.x(), q.y()));
+  } else {
+    result.set_coefficients(typename Traits::Complex(q.x(), q.y()), zero, zero, typename Traits::Complex(p.x(), p.y()));
+  }
+  return result;
+}
+
+template<class Traits>
+Hyperbolic_isometry_2<Traits> isometry_pairing_the_sides(const typename Traits::Hyperbolic_point_2& p1,
+                                                         const typename Traits::Hyperbolic_point_2& p2,
+                                                         const typename Traits::Hyperbolic_point_2& q1,
+                                                         const typename Traits::Hyperbolic_point_2& q2)
+{
+  Hyperbolic_isometry_2<Traits> A,B,Binv,C;
+  A = hyperbolic_translation<Traits>(p1);
+  B = hyperbolic_translation<Traits>(q1);
+  Binv = hyperbolic_translation<Traits>(q1, true);
+  C = hyperbolic_rotation<Traits>(A.evaluate(p2), B.evaluate(q2));
+  return (Binv*C)*A;
+}
+
+} // namespace CGAL
+
+#endif // CGAL_HYPERBOLIC_ISOMETRY_2_H
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_surface_traits_2.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_surface_traits_2.h
new file mode 100644
index 00000000000..8337dec897d
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Hyperbolic_surface_traits_2.h
@@ -0,0 +1,34 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_HYPERBOLIC_SURFACE_TRAITS_2
+#define CGAL_HYPERBOLIC_SURFACE_TRAITS_2
+
+#include <CGAL/license/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/Complex_number.h>
+
+namespace CGAL {
+
+template<class HyperbolicTraitsClass>
+class Hyperbolic_surface_traits_2
+  : public HyperbolicTraitsClass
+{
+public:
+  typedef typename HyperbolicTraitsClass::FT                          FT;
+  typedef typename HyperbolicTraitsClass::Hyperbolic_point_2          Hyperbolic_point_2;
+  typedef Complex_number<FT>                                          Complex;
+};
+
+} // namespace CGAL
+
+#endif // CGAL_HYPERBOLIC_SURFACE_TRAITS_2
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Triangulation_on_hyperbolic_surface_2.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Triangulation_on_hyperbolic_surface_2.h
new file mode 100644
index 00000000000..c592f4d17a2
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Triangulation_on_hyperbolic_surface_2.h
@@ -0,0 +1,835 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_H
+#define CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_H
+
+#include <CGAL/license/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/Combinatorial_map.h>
+#include <CGAL/Hyperbolic_fundamental_domain_2.h>
+
+#include <CGAL/assertions.h>
+
+#include <fstream>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <vector>
+#include <tuple>
+#include <unordered_map>
+#include <utility>
+
+namespace CGAL {
+
+/*
+Represents a geodesic triangulation of a closed orientable hyperbolic surface.
+The triangulation is stored as combinatorial map decorated with one cross-ratio per edge.
+It is also possible to specify an anchor for the triangulation. An anchor consists in 1) a dart of the combinatorial map, belonging by definition to a vertex V and a triangle T, together with
+2) three points A,B,C in the hyperbolic plane. The points A,B,C are the three vertices in counter-clockwise order of a triangle. This triangle is a lift
+of T, and A is a lift of V.
+*/
+template<class Traits>
+struct Combinatorial_map_with_cross_ratios_item
+{
+  template <class CMap>
+  struct Dart_wrapper
+  {
+    typedef Cell_attribute<CMap, Complex_number<typename Traits::FT> >    Edge_attrib;
+    typedef std::tuple<void, Edge_attrib, void>                           Attributes;
+  };
+};
+
+template<class Traits, class Attributes = Combinatorial_map_with_cross_ratios_item<Traits> >
+class Triangulation_on_hyperbolic_surface_2
+{
+public:
+  typedef Combinatorial_map<2, Attributes> Combinatorial_map_with_cross_ratios;
+
+  struct Anchor
+  {
+    typename Combinatorial_map_with_cross_ratios::Dart_descriptor dart;
+    typename Traits::Hyperbolic_point_2 vertices[3];
+
+    Anchor(){};
+
+    Anchor(typename Combinatorial_map_with_cross_ratios::Dart_descriptor dart,
+           typename Traits::Hyperbolic_point_2 a, typename Traits::Hyperbolic_point_2 b, typename Traits::Hyperbolic_point_2 c)
+    {
+      this->dart = dart;
+      vertices[0] = a;
+      vertices[1] = b;
+      vertices[2] = c;
+    }
+  };
+
+  typedef typename Combinatorial_map_with_cross_ratios::Dart_descriptor                           Dart_descriptor;
+  // typedef typename Combinatorial_map_with_cross_ratios::Dart_range                               Dart_range;
+  // typedef typename Combinatorial_map_with_cross_ratios::Dart_range::iterator                     Dart_iterator;
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_range<0>       Vertex_range;
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_range<1>       Edge_range;
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_range<2>       Face_range;
+
+  typedef typename Combinatorial_map_with_cross_ratios::Dart_const_descriptor                     Dart_const_descriptor;
+  typedef typename Combinatorial_map_with_cross_ratios::Dart_const_range                          Dart_const_range;
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_const_range<0> Vertex_const_range;
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_const_range<1> Edge_const_range;
+  typedef typename Combinatorial_map_with_cross_ratios::template One_dart_per_cell_const_range<2> Face_const_range;
+
+  typedef typename Traits::FT                                                                     Number;
+  typedef typename Traits::Complex                                                                Complex_number;
+  typedef typename Traits::Hyperbolic_point_2                                                     Point;
+  typedef Hyperbolic_isometry_2<Traits>                                                           Isometry;
+  typedef Hyperbolic_fundamental_domain_2<Traits>                                                 Domain;
+
+  Triangulation_on_hyperbolic_surface_2() {};
+  Triangulation_on_hyperbolic_surface_2(const Hyperbolic_fundamental_domain_2<Traits>& domain);
+// Triangulation_on_hyperbolic_surface_2(Combinatorial_map_with_cross_ratios& cmap);
+  Triangulation_on_hyperbolic_surface_2(Combinatorial_map_with_cross_ratios& cmap, Anchor& anchor);
+
+  Combinatorial_map_with_cross_ratios& combinatorial_map();
+  bool has_anchor() const;
+  Anchor& anchor();
+  const Anchor& anchor() const;
+
+  void to_stream(std::ostream& s) const;
+  void from_stream(std::istream& s);
+
+  bool is_Delaunay_flippable(Dart_const_descriptor dart) const;
+  void flip(Dart_descriptor dart);
+  bool is_Delaunay() const;
+  int make_Delaunay();
+  std::vector<std::tuple<Dart_const_descriptor, Point, Point, Point> > lift(bool center=true) const;
+
+  bool is_valid() const;
+
+  // The following methods are not documented but they are non private for internal future use.
+  Dart_descriptor ccw(Dart_descriptor dart);
+  Dart_descriptor cw(Dart_descriptor dart);
+  Dart_descriptor opposite(Dart_descriptor dart);
+  Dart_const_descriptor const_ccw(Dart_const_descriptor dart) const;
+  Dart_const_descriptor const_cw(Dart_const_descriptor dart) const;
+  Dart_const_descriptor const_opposite(Dart_const_descriptor dart) const;
+
+  Complex_number get_cross_ratio(Dart_const_descriptor dart) const;
+
+  // returns the cross ratio of the points a,b,c,d
+  Complex_number cross_ratio(const Point& a, const Point& b, const Point& c, const Point& d) const;
+  // returns the point d such that the cross ratio of a,b,c,d is cratio
+  Point fourth_point_from_cross_ratio(const Point& a, const Point& b, const Point& c, const Complex_number& cratio) const;
+
+// Wrapper around the Cmap for iterating over vertices, edges or faces.
+Vertex_range vertices_range() {
+  return combinatorial_map_.template one_dart_per_cell<0>();
+}
+Edge_range edges_range() {
+  return combinatorial_map_.template one_dart_per_cell<1>();
+}
+Face_range faces_range() {
+  return combinatorial_map_.template one_dart_per_cell<2>();
+}
+Vertex_const_range vertices_const_range() const {
+  return combinatorial_map_.template one_dart_per_cell<0>();
+}
+Edge_const_range edges_const_range() const {
+  return combinatorial_map_.template one_dart_per_cell<1>();
+}
+Face_const_range faces_const_range() const {
+  return combinatorial_map_.template one_dart_per_cell<2>();
+}
+
+protected:
+  Combinatorial_map_with_cross_ratios combinatorial_map_;
+  bool has_anchor_ = false;
+  Anchor anchor_;
+
+  Dart_descriptor pick_edge_to_flip();
+  Dart_const_descriptor pick_edge_to_flip() const;
+
+  void copy_from(Combinatorial_map_with_cross_ratios& cmap);
+  void copy_from(Combinatorial_map_with_cross_ratios& cmap, const Anchor& anchor);
+};
+
+// template<class Traits, class Attributes> std::ostream& operator<<(std::ostream& s, const Triangulation_on_hyperbolic_surface_2<Traits, Attributes>& triangulation);
+// template<class Traits, class Attributes> void operator>>(std::istream& s, Triangulation_on_hyperbolic_surface_2<Traits, Attributes>& triangulation);
+
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+Triangulation_on_hyperbolic_surface_2<Traits,Attributes>::
+Triangulation_on_hyperbolic_surface_2(const Domain& domain)
+{
+  // (Triangulates by adding an internal edge between domain.vertex(size-1) and the other vertices)
+  combinatorial_map_.clear();
+  std::size_t size = domain.size();
+
+  // Make the triangles
+  std::vector<Dart_descriptor> dart_of_triangle(size-2);
+  for (std::size_t  k=0; k<size-2; ++k) {
+    dart_of_triangle[k] = combinatorial_map_.make_combinatorial_polygon(3);
+  }
+
+  // Sew the internal edges and set their cross ratios
+  Dart_descriptor dart_1, dart_2;
+  Point p0, p1, p2, p3;
+
+  for (std::size_t  k=1; k<size-2; ++k) {
+    dart_1 = dart_of_triangle[k];
+    dart_2 = cw(dart_of_triangle[k-1]);
+
+    p0 = domain.vertex(size-1);
+    p1 = domain.vertex(k-1);
+    p2 = domain.vertex(k);
+    p3 = domain.vertex(k+1);
+
+    combinatorial_map_.template sew<2>(dart_1, dart_2);
+    combinatorial_map_.template set_attribute<1>(dart_1, combinatorial_map_.template create_attribute<1>(cross_ratio(p0,p1,p2,p3)));
+  }
+
+  // Sew the boundary edges and set their cross ratios
+  for (std::size_t  k1=0; k1<size; k1++) {
+    std::size_t k2 = domain.paired_side(k1);
+
+    p0 = domain.vertex((k1+1)%size);
+    p2 = domain.vertex(k1);
+
+    if (k1 == size-1) {
+      dart_1 = dart_of_triangle[0];
+      p1 = domain.vertex(1);
+    } else if (k1 == size-2) {
+      dart_1 = cw(dart_of_triangle[size-3]);
+      p1 = domain.vertex(size-3);
+    } else {
+      dart_1 = ccw(dart_of_triangle[k1]);
+      p1 = domain.vertex(size-1);
+    }
+
+    if (k2 == size-1) {
+      dart_2 = dart_of_triangle[0];
+      p3 = domain.vertex(1);
+    } else if (k2 == size-2) {
+      dart_2 = cw(dart_of_triangle[size-3]);
+      p3 = domain.vertex(size-3);
+    } else {
+      dart_2 = ccw(dart_of_triangle[k2]);
+      p3 = domain.vertex(size-1);
+    }
+
+    p3 = domain.side_pairing(k1).evaluate(p3);
+
+    if (combinatorial_map_.template is_sewable<2>(dart_1, dart_2)) {
+      combinatorial_map_.template sew<2>(dart_1, dart_2);
+      combinatorial_map_.template set_attribute<1>(dart_1, combinatorial_map_.template create_attribute<1>(cross_ratio(p0,p1,p2,p3)));
+    }
+  }
+
+  // Set the anchor
+  anchor_.dart = dart_of_triangle[0];
+  anchor_.vertices[0] = domain.vertex(size-1);
+  anchor_.vertices[1] = domain.vertex(0);
+  anchor_.vertices[2] = domain.vertex(1);
+  has_anchor_ = true;
+}
+
+/* template<class Traits, class Attributes> */
+/*   Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Triangulation_on_hyperbolic_surface_2(Combinatorial_map_with_cross_ratios& cmap) { */
+/*   copy_from(cmap); */
+/* } */
+
+template<class Traits, class Attributes>
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+Triangulation_on_hyperbolic_surface_2(Combinatorial_map_with_cross_ratios& cmap,
+                                      Anchor& anchor)
+{
+  copy_from(cmap, anchor);
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Combinatorial_map_with_cross_ratios&
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+combinatorial_map()
+{
+  return combinatorial_map_;
+}
+
+template<class Traits, class Attributes>
+bool
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+has_anchor() const
+{
+  CGAL_precondition(is_valid());
+  return has_anchor_;
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Anchor&
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+anchor()
+{
+  CGAL_precondition(is_valid() && has_anchor());
+  return anchor_;
+}
+
+template<class Traits, class Attributes>
+const typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Anchor&
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+anchor() const
+{
+  CGAL_precondition(is_valid() && has_anchor());
+  return anchor_;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+bool
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+is_Delaunay_flippable(Dart_const_descriptor dart) const
+{
+  CGAL_precondition(is_valid());
+  return (get_cross_ratio(dart).imag() > Number(0));
+}
+
+template<class Traits, class Attributes>
+void
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+flip(Dart_descriptor dart)
+{
+  CGAL_precondition(is_valid());
+
+  // First gather all the information needed
+
+   Dart_descriptor a = opposite(dart); // Get a fresh descriptor
+   Dart_descriptor b = ccw(a);
+   Dart_descriptor c = cw(a);
+
+   Dart_descriptor d = opposite(a);
+   Dart_descriptor e = ccw(d);
+   Dart_descriptor f = cw(d);
+
+   Complex_number cross_ratio_AB = get_cross_ratio(e);
+   Complex_number cross_ratio_BC = get_cross_ratio(f);
+   Complex_number cross_ratio_CD = get_cross_ratio(b);
+   Complex_number cross_ratio_DA = get_cross_ratio(c);
+   Complex_number cross_ratio_AC = get_cross_ratio(a);
+
+   // Modify the anchor
+
+   if (anchor_.dart == a) {
+     anchor_.dart = e;
+     anchor_.vertices[1] = Point(fourth_point_from_cross_ratio(anchor_.vertices[1], anchor_.vertices[2], anchor_.vertices[0], cross_ratio_AC));
+   } else if (anchor_.dart == b) {
+     anchor_.vertices[2] = Point(fourth_point_from_cross_ratio(anchor_.vertices[0], anchor_.vertices[1], anchor_.vertices[2], cross_ratio_AC));
+   } else if (anchor_.dart == c) {
+     anchor_.vertices[2] = Point(fourth_point_from_cross_ratio(anchor_.vertices[2], anchor_.vertices[0], anchor_.vertices[1], cross_ratio_AC));
+   } else if (anchor_.dart == d) {
+     anchor_.dart = b;
+     anchor_.vertices[1] = Point(fourth_point_from_cross_ratio(anchor_.vertices[1], anchor_.vertices[2], anchor_.vertices[0], cross_ratio_AC));
+   } else if (anchor_.dart == e) {
+     anchor_.vertices[2] = Point(fourth_point_from_cross_ratio(anchor_.vertices[0], anchor_.vertices[1], anchor_.vertices[2], cross_ratio_AC));
+   } else if (anchor_.dart == f) {
+     anchor_.vertices[2] = Point(fourth_point_from_cross_ratio(anchor_.vertices[2], anchor_.vertices[0], anchor_.vertices[1], cross_ratio_AC));
+   }
+
+   // Compute the new cross ratios
+
+   Complex_number one (Number(1), Number(0));
+   Complex_number cross_ratio_BD = (cross_ratio_AC) / ((cross_ratio_AC) - one);
+   Complex_number cross_ratio_AB_2 = one - (one - (cross_ratio_AB)) * (cross_ratio_AC);
+   Complex_number cross_ratio_BC_2 = one - (one - (cross_ratio_BC)) / (cross_ratio_BD);
+   Complex_number cross_ratio_CD_2 = one - (one - (cross_ratio_CD)) * (cross_ratio_AC);
+   Complex_number cross_ratio_DA_2 = one - (one - (cross_ratio_DA)) / (cross_ratio_BD);
+
+   // Make the topological flip
+
+   combinatorial_map_.template unlink_beta<1>(a);
+   combinatorial_map_.template unlink_beta<1>(b);
+   combinatorial_map_.template unlink_beta<1>(c);
+
+   combinatorial_map_.template unlink_beta<1>(d);
+   combinatorial_map_.template unlink_beta<1>(e);
+   combinatorial_map_.template unlink_beta<1>(f);
+
+
+   combinatorial_map_.template link_beta<1>(b, a);
+   combinatorial_map_.template link_beta<1>(a, f);
+   combinatorial_map_.template link_beta<1>(f, b);
+
+   combinatorial_map_.template link_beta<1>(e, d);
+   combinatorial_map_.template link_beta<1>(d, c);
+   combinatorial_map_.template link_beta<1>(c, e);
+
+   // And give the new cross ratios to the edges
+
+   combinatorial_map_.template info<1>(a) = cross_ratio_BD;
+   combinatorial_map_.template info<1>(e) = cross_ratio_AB_2;
+   combinatorial_map_.template info<1>(f) = cross_ratio_BC_2;
+   combinatorial_map_.template info<1>(b) = cross_ratio_CD_2;
+   combinatorial_map_.template info<1>(c) = cross_ratio_DA_2;
+
+   // Take care of the particular cases where we need to "flip again"
+
+   if (opposite(e) == b) {
+     combinatorial_map_.template info<1>(e) = one - (one - cross_ratio_AB_2) * (cross_ratio_AC);
+   }
+
+   if (opposite(f) == c) {
+     combinatorial_map_.template info<1>(f) = one - (one - cross_ratio_BC_2) / (cross_ratio_BD);
+   }
+}
+
+template<class Traits, class Attributes>
+bool
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+is_Delaunay() const
+{
+  if (! is_valid()) {
+    return false;
+  }
+  return (pick_edge_to_flip() == nullptr);
+}
+
+template<class Traits, class Attributes>
+int
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+make_Delaunay()
+{
+  CGAL_precondition(is_valid());
+  int number_of_flips_done = 0;
+
+  Dart_descriptor edge_to_flip = pick_edge_to_flip();
+  while (edge_to_flip != nullptr) {
+    flip(edge_to_flip);
+    edge_to_flip = pick_edge_to_flip();
+    number_of_flips_done++;
+  }
+
+  return number_of_flips_done;
+}
+
+
+template<class Traits, class Attributes>
+std::vector<std::tuple<typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_const_descriptor,
+                       typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Point,
+                       typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Point,
+                       typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Point> >
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+lift(bool center) const
+{
+  CGAL_precondition(is_valid() && has_anchor());
+
+  std::vector<std::tuple<Dart_const_descriptor, Point, Point, Point> > realizations;
+
+  size_t visited_darts_mark = combinatorial_map_.get_new_mark();
+  combinatorial_map_.unmark_all(visited_darts_mark);
+
+  struct Compare
+  {
+    bool operator()(const std::pair<Dart_const_descriptor,double>& x,
+                    const std::pair<Dart_const_descriptor,double>& y)
+    {
+      return x.second > y.second;
+    }
+  };
+
+  std::priority_queue<std::pair<Dart_const_descriptor, double>,
+                      std::vector<std::pair<Dart_const_descriptor, double> >, Compare> queue;
+
+  std::unordered_map<Dart_const_descriptor, Point> positions;
+
+  Dart_const_range darts = combinatorial_map_.darts();
+
+  combinatorial_map_.mark(anchor_.dart, visited_darts_mark);
+  combinatorial_map_.mark(const_ccw(anchor_.dart), visited_darts_mark);
+  combinatorial_map_.mark(const_cw(anchor_.dart), visited_darts_mark);
+
+  if (center) {
+    Isometry center_the_drawing = hyperbolic_translation<Traits>(anchor_.vertices[0]);
+    positions[anchor_.dart] = center_the_drawing.evaluate(anchor_.vertices[0]);
+    positions[const_ccw(anchor_.dart)] = center_the_drawing.evaluate(anchor_.vertices[1]);
+    positions[const_cw(anchor_.dart)] = center_the_drawing.evaluate(anchor_.vertices[2]);
+  } else {
+    positions[anchor_.dart] = anchor_.vertices[0];
+    positions[const_ccw(anchor_.dart)] = anchor_.vertices[1];
+    positions[const_cw(anchor_.dart)] = anchor_.vertices[2];
+  }
+
+  std::tuple<Dart_const_descriptor, Point, Point, Point> value =
+    std::make_tuple(anchor_.dart,
+                    positions[anchor_.dart],
+                    positions[const_ccw(anchor_.dart)],
+                    positions[const_cw(anchor_.dart)]);
+  realizations.push_back(value);
+
+  Complex_number anchor_z0(anchor_.vertices[0].x(), anchor_.vertices[0].y());
+  Complex_number anchor_z1(anchor_.vertices[1].x(), anchor_.vertices[1].y());
+  Complex_number anchor_z2(anchor_.vertices[2].x(), anchor_.vertices[2].y());
+
+  double weight_of_anchor_dart = CGAL::to_double(norm(anchor_z0) + norm(anchor_z1));
+  double weight_of_ccw_anchor_dart = CGAL::to_double(norm(anchor_z1) + norm(anchor_z2));
+  double weight_of_cw_anchor_dart = CGAL::to_double(norm(anchor_z2) + norm(anchor_z0));
+
+  queue.push(std::make_pair(anchor_.dart, weight_of_anchor_dart));
+  queue.push(std::make_pair(const_ccw(anchor_.dart), weight_of_ccw_anchor_dart));
+  queue.push(std::make_pair(const_cw(anchor_.dart), weight_of_cw_anchor_dart));
+
+  while (! queue.empty()) {
+    Dart_const_descriptor invader = queue.top().first;
+    queue.pop();
+
+    Dart_const_descriptor invaded = const_opposite(invader);
+
+    if (!combinatorial_map_.is_marked(invaded, visited_darts_mark)) {
+      combinatorial_map_.mark(invaded, visited_darts_mark);
+      combinatorial_map_.mark(const_ccw(invaded), visited_darts_mark);
+      combinatorial_map_.mark(const_cw(invaded), visited_darts_mark);
+
+      const Point& a = positions[const_ccw(invader)];
+      const Point& b = positions[const_cw(invader)];
+      const Point& c = positions[invader];
+      Complex_number cross_ratio = get_cross_ratio(invader);
+
+      positions[invaded] = a;
+      positions[const_ccw(invaded)] = c;
+      Point d = fourth_point_from_cross_ratio(a, b, c, cross_ratio);
+      positions[const_cw(invaded)] = d;
+
+      Complex_number za(a.x(), a.y());
+      Complex_number zc(c.x(), c.y());
+      double invaded_distance_to_zero = CGAL::to_double(norm(za));
+      double invaded_ccw_distance_to_zero = CGAL::to_double(norm(zc));
+      Complex_number znew(positions[const_cw(invaded)].x(), positions[const_cw(invaded)].y());
+      double invaded_cw_distance_to_zero = CGAL::to_double(norm(znew));
+
+      double invaded_ccw_weight = invaded_ccw_distance_to_zero + invaded_cw_distance_to_zero;
+      double invaded_cw_weight = invaded_cw_distance_to_zero + invaded_distance_to_zero;
+
+      queue.push(std::make_pair(const_ccw(invaded), invaded_ccw_weight));
+      queue.push(std::make_pair(const_cw(invaded), invaded_cw_weight));
+
+      value = std::make_tuple(invaded, Point(a), Point(c), Point(d));
+      realizations.push_back(value);
+    }
+  }
+
+  combinatorial_map_.free_mark(visited_darts_mark);
+
+  return realizations;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+bool
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+is_valid() const
+{
+  // 1. Check the combinatorial map
+
+  // Check that the combinatorial map is valid
+  if (!combinatorial_map_.is_valid()) {
+    return false;
+  }
+
+  // Check that the combinatorial map has no 1,2-boundary
+  for (int k=1; k<3; ++k) {
+    if (!combinatorial_map_.is_without_boundary(k)) {
+      return false;
+    }
+  }
+
+  // 2. Check the anchor, if any
+
+  if (has_anchor_) {
+    // Check that the dart descriptor of the anchor points to a dart of the combinatorial map
+    if (!combinatorial_map_.is_dart_used(anchor_.dart)) {
+      return false;
+    }
+
+    // Check that the three vertices of the anchor lie within the open unit disk
+    for (int k=0; k<3; ++k) {
+      // if (anchor_.vertices[k].get_z() >= Number(1)) {
+      if (norm(Complex_number(anchor_.vertices[k].x(),anchor_.vertices[k].y())) >= Number(1)) {
+        return false;
+      }
+    }
+  }
+
+  return true;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+void
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+to_stream(std::ostream& s) const
+{
+  CGAL_precondition(is_valid() && has_anchor());
+
+  // Give indices to the darts
+  std::map<Dart_const_descriptor, int> darts_indices;
+  int current_dart_index = 0;
+  for (typename Dart_const_range::const_iterator it=combinatorial_map_.darts().begin(); it!=combinatorial_map_.darts().end(); ++it) {
+    darts_indices[it] = current_dart_index;
+    current_dart_index++;
+  }
+
+  // Store the number of darts
+  s << current_dart_index << std::endl;
+
+  // Store the anchor, if any
+  if (has_anchor_) {
+    s << "yes" << std::endl;
+    s << darts_indices[anchor_.dart] << std::endl;
+    s << anchor_.vertices[0] << std::endl;
+    s << anchor_.vertices[1] << std::endl;
+    s << anchor_.vertices[2] << std::endl;
+  } else {
+    s << "no" << std::endl;
+  }
+
+  // Store the triangles
+  for (typename Face_const_range::const_iterator it = faces_const_range().begin(); it != faces_const_range().end(); ++it) {
+    s << darts_indices[it] << std::endl;
+    s << darts_indices[const_cw(it)] << std::endl;
+    s << darts_indices[const_ccw(it)] << std::endl;
+  }
+
+  // Store the edges
+  for (typename Edge_const_range::const_iterator it = edges_const_range().begin(); it != edges_const_range().end(); ++it) {
+    s << darts_indices[it] << std::endl;
+    s << darts_indices[const_opposite(it)] << std::endl;
+    s << get_cross_ratio(it);
+  }
+}
+
+template<class Traits, class Attributes>
+void
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+from_stream(std::istream& s)
+{
+  combinatorial_map_.clear();
+
+  // Load the number of darts
+  std::string line;
+  s >> line;
+  int nb_darts = std::stoi(line);
+
+  // Load the anchor
+  int anchor_dart_id = 0;
+  s >> line;
+  if (!line.compare("yes")) {
+    has_anchor_ = true;
+
+    s >> line;
+    anchor_dart_id = std::stoi(line); // (*) anchor_.dart_id is set at the end of the function
+
+    s >> anchor_.vertices[0];
+    s >> anchor_.vertices[1];
+    s >> anchor_.vertices[2];
+  } else {
+    has_anchor_ = false;
+  }
+
+  // Load the triangles
+  std::vector<Dart_descriptor> darts_by_id (nb_darts);
+  int index1, index2, index3;
+  for (int k=0; k<nb_darts/3; ++k) {
+    Dart_descriptor triangle_dart = combinatorial_map_.make_combinatorial_polygon(3);
+
+    s >> line;
+    index1 = std::stoi(line);
+    s >> line;
+    index2 = std::stoi(line);
+    s >> line;
+    index3 = std::stoi(line);
+
+    darts_by_id[index1] = triangle_dart;
+    darts_by_id[index2] = cw(triangle_dart);
+    darts_by_id[index3] = ccw(triangle_dart);
+  }
+
+  // Load the edges
+  Dart_descriptor dart_1, dart_2;
+  Complex_number cross_ratio;
+  for (int k=0; k<nb_darts/2; ++k) {
+    s >> line;
+    index1 = std::stoi(line);
+    s >> line;
+    index2 = std::stoi(line);
+    dart_1 = darts_by_id[index1];
+    dart_2 = darts_by_id[index2];
+    combinatorial_map_.template sew<2>(dart_1, dart_2);
+    s >> cross_ratio;
+    combinatorial_map_.template set_attribute<1>(dart_1, combinatorial_map_.template create_attribute<1>(cross_ratio));
+  }
+
+  // (*) here
+  if (has_anchor_) {
+    anchor_.dart = darts_by_id[anchor_dart_id];
+  }
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::ccw(Dart_descriptor dart) {
+  return combinatorial_map_.beta(dart, 1);
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::cw(Dart_descriptor dart) {
+  return combinatorial_map_.beta(dart, 0);
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::opposite(Dart_descriptor dart) {
+  return combinatorial_map_.opposite(dart);
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_const_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::const_ccw(Dart_const_descriptor dart) const {
+  return combinatorial_map_.beta(dart, 1);
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_const_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::const_cw(Dart_const_descriptor dart) const {
+  return combinatorial_map_.beta(dart, 0);
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_const_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::const_opposite(Dart_const_descriptor dart) const {
+  return combinatorial_map_.opposite(dart);
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Complex_number Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::get_cross_ratio(Dart_const_descriptor dart) const {
+  return combinatorial_map_.template info_of_attribute<1>(combinatorial_map_.template attribute<1>(dart));
+}
+
+////////////////////////////////////////////////////////////////////////////////
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_descriptor Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+pick_edge_to_flip()
+{
+  auto& cm = combinatorial_map_.darts();
+  for (auto it=cm.begin(); it!=cm.end(); ++it) {
+    if (is_Delaunay_flippable(it)) {
+      return it;
+    }
+  }
+  return nullptr;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Dart_const_descriptor
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+pick_edge_to_flip() const
+{
+  const auto& cm = combinatorial_map_.darts();
+  for (auto it=cm.begin(); it!=cm.end(); ++it) {
+    if (is_Delaunay_flippable(it) ) {
+      return it;
+    }
+  }
+  return nullptr;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+void
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+copy_from(Combinatorial_map_with_cross_ratios& cmap)
+{
+  //combinatorial_map_.copy_from_const(cmap);
+  combinatorial_map_.copy(cmap);
+  has_anchor_ = false;
+}
+
+template<class Traits, class Attributes>
+void
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+copy_from(Combinatorial_map_with_cross_ratios& cmap,
+          const Anchor& anchor)
+{
+  // Because of the anchor, we must operate the copy ourself
+  combinatorial_map_.clear();
+
+  // Copy the triangles and fill the darts conversion table
+  std::map<Dart_const_descriptor, Dart_descriptor> darts_table;
+  for (typename Face_const_range::const_iterator it=cmap.template one_dart_per_cell<2>().begin(); it!=cmap.template one_dart_per_cell<2>().end(); ++it) {
+    Dart_descriptor new_dart = combinatorial_map_.make_combinatorial_polygon(3);
+    darts_table[it] = new_dart;
+    darts_table[cmap.beta(it,0)] = combinatorial_map_.beta(new_dart,0);
+    darts_table[cmap.beta(it,1)] = combinatorial_map_.beta(new_dart,1);
+  }
+
+  // Sew the edges and set their cross-ratios
+  for (typename Edge_const_range::const_iterator it=cmap.template one_dart_per_cell<1>().begin(); it!=cmap.template one_dart_per_cell<1>().end(); ++it) {
+    Dart_descriptor dart_1 = darts_table[it];
+    Dart_descriptor dart_2 = darts_table[cmap.opposite(it)];
+    Complex_number cratio = cmap.template info_of_attribute<1>(cmap.template attribute<1>(it));
+
+    combinatorial_map_.template sew<2>(dart_1, dart_2);
+    combinatorial_map_.template set_attribute<1>(dart_1, combinatorial_map_.template create_attribute<1>(cratio));
+  }
+
+  cmap.opposite(anchor.dart);
+
+  // Set the anchor
+  anchor_.dart = darts_table[anchor.dart];
+  for (int k=0; k<3; ++k) {
+    anchor_.vertices[k] = anchor.vertices[k];
+  }
+  has_anchor_ = true;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+
+template<class Traits, class Attributes>
+typename Traits::Complex
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+cross_ratio(const Point& a, const Point& b, const Point& c, const Point& d) const
+{
+  Complex_number za (a.x(), a.y());
+  Complex_number zb (b.x(), b.y());
+  Complex_number zc (c.x(), c.y());
+  Complex_number zd (d.x(), d.y());
+  return (zd-zb)*(zc-za) / ((zd-za)*(zc-zb));
+}
+
+template<class Traits, class Attributes>
+typename Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::Point
+Triangulation_on_hyperbolic_surface_2<Traits, Attributes>::
+fourth_point_from_cross_ratio(const Point& a, const Point& b, const Point& c,
+                              const Complex_number& cratio) const
+{
+  Complex_number za (a.x(), a.y());
+  Complex_number zb (b.x(), b.y());
+  Complex_number zc (c.x(), c.y());
+  Complex_number result = ( cratio*za*(zc-zb) + zb*(za-zc) ) / ( cratio*(zc-zb) + (za-zc));
+  return Point(result.real(), result.imag());
+}
+
+} // namespace CGAL
+
+#endif // CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_H
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Triangulation_on_hyperbolic_surface_2_IO.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Triangulation_on_hyperbolic_surface_2_IO.h
new file mode 100644
index 00000000000..41939c9fd28
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Triangulation_on_hyperbolic_surface_2_IO.h
@@ -0,0 +1,66 @@
+// Copyright (c) 2024
+// INRIA Nancy (France), and Université Gustave Eiffel Marne-la-Vallee (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Vincent Despré, Loïc Dubois, Marc Pouget, Monique Teillaud
+
+#ifndef CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_IO_H
+#define CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_IO_H
+
+#include <CGAL/license/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+
+#include <CGAL/assertions.h>
+
+#include <iostream>
+
+namespace CGAL {
+
+////////////////////////////////////////////////////////////////////////////////
+template<class Traits>
+std::ostream& operator<<(std::ostream& s, const Hyperbolic_fundamental_domain_2<Traits>& domain)
+{
+  CGAL_precondition(domain.is_valid());
+  return domain.to_stream(s);
+}
+
+template<class Traits>
+std::istream& operator>>(std::istream& s, Hyperbolic_fundamental_domain_2<Traits>& domain)
+{
+  return domain.from_stream(s);
+}
+
+////////////////////////////////////////////////////////////////////////////////
+template<class Traits>
+std::ostream& operator<<(std::ostream& s, const Hyperbolic_isometry_2<Traits>& isometry)
+{
+  for (int k=0; k<4; ++k) {
+    s << isometry.get_coefficient(k);
+  }
+  return s;
+}
+
+////////////////////////////////////////////////////////////////////////////////
+template<class Traits, class Attributes>
+std::ostream& operator<<(std::ostream& s, const Triangulation_on_hyperbolic_surface_2<Traits, Attributes>& triangulation)
+{
+  triangulation.to_stream(s);
+  return s;
+}
+
+template<class Traits, class Attributes>
+void operator>>(std::istream& s, Triangulation_on_hyperbolic_surface_2<Traits, Attributes>& triangulation)
+{
+  triangulation.from_stream(s);
+}
+
+} // namespace CGAL
+
+#endif // CGAL_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2_IO_H
diff --git a/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/copyright b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/copyright
new file mode 100644
index 00000000000..f6c522d5bf5
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/copyright
@@ -0,0 +1,3 @@
+INRIA Nancy -- France
+Université de Lorraine -- France
+Université Gustave Eiffel Marne-la-Vallee -- France
diff --git a/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/dependencies b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/dependencies
new file mode 100644
index 00000000000..62d19a14d67
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/dependencies
@@ -0,0 +1,26 @@
+Algebraic_foundations
+Arithmetic_kernel
+BGL
+CGAL_Core
+Cartesian_kernel
+Circulator
+Combinatorial_map
+Distance_2
+Distance_3
+Filtered_kernel
+Hash_map
+Homogeneous_kernel
+Installation
+Intersections_2
+Intersections_3
+Interval_support
+Kernel_23
+Kernel_d
+Modular_arithmetic
+Number_types
+Profiling_tools
+Property_map
+Random_numbers
+STL_Extension
+Stream_support
+Triangulation_on_hyperbolic_surface_2
diff --git a/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/description.txt b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/description.txt
new file mode 100644
index 00000000000..11623cbdb12
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/description.txt
@@ -0,0 +1,5 @@
+Package Triangulation_on_hyperbolic_surface_2 : provides
+triangulations of closed oriented hyperbolic surfaces,
+Delaunay flip algorithm on those triangulations,
+construction of the triangulations from convex geodesic fundamental domains,
+construction of such domains for genus 2 surfaces
diff --git a/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/license.txt b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/license.txt
new file mode 100644
index 00000000000..8bb8efcb72b
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/license.txt
@@ -0,0 +1 @@
+GPL (v3 or later)
diff --git a/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/maintainer b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/maintainer
new file mode 100644
index 00000000000..6f51f82623f
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/package_info/Triangulation_on_hyperbolic_surface_2/maintainer
@@ -0,0 +1,3 @@
+Vincent Despré <vincent.despre@loria.fr>
+Loïc Dubois <loic.dubois@univ-eiffel.fr>
+Monique Teillaud <monique.teillaud@inria.fr>
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt
new file mode 100644
index 00000000000..abca7b48a12
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/CMakeLists.txt
@@ -0,0 +1,16 @@
+# Created by the script cgal_create_cmake_script
+# This is the CMake script for compiling a CGAL application.
+
+cmake_minimum_required(VERSION 3.12...3.31)
+project(Triangulation_on_hyperbolic_surface_2_Tests)
+
+find_package(CGAL REQUIRED)
+
+# create a target per cppfile
+file(
+  GLOB cppfiles
+  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
+  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
+foreach(cppfile ${cppfiles})
+  create_single_source_cgal_program("${cppfile}")
+endforeach()
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_circular_kernel.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_circular_kernel.cpp
new file mode 100644
index 00000000000..ab36907ecf4
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_circular_kernel.cpp
@@ -0,0 +1,65 @@
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Cartesian.h>
+
+#include <CGAL/Algebraic_kernel_for_circles_2_2.h>
+#include <CGAL/Circular_kernel_2/Intersection_traits.h>
+#include <CGAL/Circular_kernel_2.h>
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_fundamental_domain_factory_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2_IO.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h>
+
+#include <iostream>
+#include <sstream>
+#include <vector>
+
+typedef CGAL::Circular_kernel_2<CGAL::Cartesian<CGAL::Exact_rational>,CGAL::Algebraic_kernel_for_circles_2_2<CGAL::Exact_rational>>               Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2<Kernel>         ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                     Traits;
+typedef CGAL::Hyperbolic_fundamental_domain_2<Traits>                       Domain;
+typedef CGAL::Hyperbolic_fundamental_domain_factory_2<Traits>               Factory;
+typedef CGAL::Triangulation_on_hyperbolic_surface_2<Traits>                 Triangulation;
+
+typedef typename Traits::Hyperbolic_point_2                                 Point;
+
+int main()
+{
+  Factory factory;
+  Domain domain = factory.make_hyperbolic_fundamental_domain_g2(3459);
+  Triangulation triangulation0 = Triangulation(domain);
+
+  assert(triangulation0.is_valid());
+
+  Triangulation triangulation (triangulation0);
+  assert(triangulation.has_anchor());
+
+  std::stringstream buffer;
+  buffer << triangulation;
+  buffer >> triangulation;
+
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> input_not_centered;
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> input_centered;
+
+  input_not_centered = triangulation.lift(false);
+  input_centered = triangulation.lift();
+
+  triangulation.make_Delaunay();
+
+  assert(triangulation.is_Delaunay());
+
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> output_not_centered;
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> output_centered;
+
+  output_not_centered = triangulation.lift(false);
+  output_centered = triangulation.lift();
+
+
+  Triangulation::Combinatorial_map_with_cross_ratios& cmap = triangulation.combinatorial_map();
+  Triangulation::Anchor& anchor = triangulation.anchor();
+  assert(cmap.is_dart_used(anchor.dart));
+
+  std::cout << "printing triangulation for test purposes: " << std::endl << triangulation;
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_complex.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_complex.cpp
new file mode 100644
index 00000000000..02c04d215a3
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_complex.cpp
@@ -0,0 +1,51 @@
+#include <CGAL/Complex_number.h>
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Interval_nt.h>
+
+#include <iostream>
+#include <sstream>
+
+typedef CGAL::Exact_rational                    Exact_rational;
+typedef CGAL::Interval_nt<>                     Interval;
+typedef CGAL::Complex_number<Exact_rational>    Complex_rational;
+typedef CGAL::Complex_number<Interval>          Complex_interval;
+
+int main()
+{
+  // Complex_rational tests :
+  Complex_rational zero_rational = Complex_rational ();
+  assert(zero_rational == Complex_rational(Exact_rational(0), Exact_rational(0)));
+
+  Complex_rational one_rational (Exact_rational(1));
+  assert(one_rational == Complex_rational(Exact_rational(1), Exact_rational(0)));
+
+  Complex_rational z1_rational (Exact_rational(1,2), Exact_rational(-3));
+  z1_rational = - z1_rational;
+
+  Complex_rational z2_rational;
+  z2_rational.real(Exact_rational(-5,7));
+  z2_rational.imag(Exact_rational(11,13));
+  z2_rational = conj(z2_rational) + z1_rational - one_rational;
+
+  assert(- z1_rational * z1_rational / z2_rational == -Complex_rational(Exact_rational(855491,632146), Exact_rational(844298,316073)));
+  assert(z1_rational.real() == Exact_rational(-1,2));
+  assert(z1_rational.imag() == Exact_rational(3));
+  assert(norm(z1_rational) == Exact_rational(37,4));
+  assert(z1_rational != z2_rational);
+  assert(z2_rational == z2_rational);
+  assert(z2_rational == Complex_rational(Exact_rational(-31,14), Exact_rational(28,13)));
+
+  std::cout << "printing a complex for test purposes : " << std::endl << z2_rational << std::endl;
+
+  Complex_rational z3_rational;
+  std::stringstream buffer;
+  buffer << z2_rational;
+  buffer >> z3_rational;
+  assert(z3_rational == z2_rational);
+
+  // Complex_interval test :
+  Complex_interval z_interval (Interval(1, 2), Interval(1, 2));
+  assert(norm(z_interval * z_interval / Complex_interval(Interval(5, 6))) < Interval(10,20));
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_domain.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_domain.cpp
new file mode 100644
index 00000000000..01d9f97e052
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_domain.cpp
@@ -0,0 +1,81 @@
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Cartesian.h>
+
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_fundamental_domain_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2_IO.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+
+#include <iostream>
+#include <vector>
+
+typedef CGAL::Cartesian<CGAL::Exact_rational>                                       Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>              ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                       Traits;
+typedef CGAL::Hyperbolic_fundamental_domain_2<Traits>                         Domain;
+
+typedef typename Traits::FT                                             FT;
+typedef typename Traits::Hyperbolic_point_2                             Point;
+typedef typename Traits::Complex                                        Complex;
+
+
+int main()
+{
+  std::vector<Point> vertices;
+  Point z0 = Point(FT("4881/5000"),FT("0"));
+  Point z1 = Point(FT("9211/10000"),FT("2733/10000"));
+  Point z2 = Point(FT("1709/5000"),FT("7253/10000"));
+  Point z3 = Point(FT("-427262704257582473474868322141310044732400799603/1267155016747148041260345910894159385550919570000"),FT("582571804584198065321856347012850217722442509611/1267155016747148041260345910894159385550919570000"));
+  Point z4 = Point(FT("-4881/5000"),FT("0"));
+  Point z5 = Point(FT("-9211/10000"),FT("-2733/10000"));
+  Point z6 = Point(FT("-1709/5000"),FT("-7253/10000"));
+  Point z7 = Point(FT("427262704257582473474868322141310044732400799603/1267155016747148041260345910894159385550919570000"),FT("-582571804584198065321856347012850217722442509611/1267155016747148041260345910894159385550919570000"));
+  vertices.push_back(z0);
+  vertices.push_back(z1);
+  vertices.push_back(z2);
+  vertices.push_back(z3);
+  vertices.push_back(z4);
+  vertices.push_back(z5);
+  vertices.push_back(z6);
+  vertices.push_back(z7);
+
+  std::vector<std::size_t> pairings;
+  for (std::size_t k=0; k<8; ++k) {
+    pairings.push_back((k+4)%8);
+  }
+
+  Domain domain = Domain(vertices, pairings);
+  assert(domain.size()==8);
+  for (std::size_t k=0; k<8; ++k) {
+    assert(domain.vertex(k)==vertices[k]);
+    assert(domain.paired_side(k)==(k+4)%8);
+    assert(domain.side_pairing(k).evaluate(domain.vertex((k+4)%8))==domain.vertex((k+1)%8));
+    assert(domain.side_pairing(k).evaluate(domain.vertex((k+5)%8))==domain.vertex(k));
+  }
+
+  assert(domain.is_valid());
+
+  Domain domain_prime = Domain(vertices, pairings);
+  assert(domain_prime.size()==8);
+  for (std::size_t k=0; k<8; ++k) {
+    assert(domain_prime.vertex(k)==vertices[k]);
+    assert(domain_prime.paired_side(k)==(k+4)%8);
+
+    assert(domain_prime.side_pairing(k).evaluate(domain_prime.vertex((k+4)%8))==domain_prime.vertex((k+1)%8));
+    assert(domain_prime.side_pairing(k).evaluate(domain_prime.vertex((k+5)%8))==domain_prime.vertex(k));
+  }
+
+  Domain domain_ter = Domain();
+  std::stringstream buffer;
+  buffer << domain;
+  buffer >> domain_ter;
+  assert(domain_ter.size()==8);
+  for (std::size_t k=0; k<8; ++k) {
+    assert(domain_ter.vertex(k)==vertices[k]);
+    assert(domain_ter.paired_side(k)==(k+4)%8);
+  }
+
+  std::cout << "printing a domain for test purposes : " << std::endl << domain << std::endl;
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_factory.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_factory.cpp
new file mode 100644
index 00000000000..f71c9e4bbd7
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_factory.cpp
@@ -0,0 +1,31 @@
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Cartesian.h>
+
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_fundamental_domain_factory_2.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+
+#include <iostream>
+
+typedef CGAL::Cartesian<CGAL::Exact_rational>                           Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>        ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                 Traits;
+typedef CGAL::Hyperbolic_fundamental_domain_2<Traits>                   Domain;
+typedef CGAL::Hyperbolic_fundamental_domain_factory_2<Traits>           Factory;
+
+typedef typename Traits::FT                                             FT;
+typedef typename Traits::Hyperbolic_point_2                             Point;
+typedef typename Traits::Complex                                        Complex;
+
+int main()
+{
+  Factory factory;
+  Domain domain = factory.make_hyperbolic_fundamental_domain_g2(3459);
+
+  assert(domain.size()==8);
+  for (std::size_t k=0; k<8; ++k) {
+    assert(domain.paired_side(k)==(k+4)%8);
+  }
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_isometry.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_isometry.cpp
new file mode 100644
index 00000000000..318ec450144
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_isometry.cpp
@@ -0,0 +1,88 @@
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Cartesian.h>
+
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_isometry_2.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2_IO.h>
+
+#include <iostream>
+
+typedef CGAL::Cartesian<CGAL::Exact_rational>                           Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>        ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                 Traits;
+typedef CGAL::Hyperbolic_isometry_2<Traits>                             Isometry;
+
+typedef typename Traits::FT                                             FT;
+typedef typename Traits::Hyperbolic_point_2                             Point;
+typedef typename Traits::Complex                                        Complex;
+
+int main()
+{
+  Isometry identity_1 = Isometry ();
+  assert(identity_1.get_coefficient(0)==Complex(FT(1)));
+  assert(identity_1.get_coefficient(1)==Complex(FT(0)));
+  assert(identity_1.get_coefficient(2)==Complex(FT(0)));
+  assert(identity_1.get_coefficient(3)==Complex(FT(1)));
+
+  Isometry identity_2;
+  identity_2.set_to_identity();
+  assert(identity_2.get_coefficient(0)==Complex(FT(1)));
+  assert(identity_2.get_coefficient(1)==Complex(FT(0)));
+  assert(identity_2.get_coefficient(2)==Complex(FT(0)));
+  assert(identity_2.get_coefficient(3)==Complex(FT(1)));
+
+  Isometry f;
+  f.set_coefficient(0, Complex(FT(-12,17), FT(1,3)));
+  f.set_coefficient(1, Complex(FT(56,7), FT(21,5)));
+  f.set_coefficient(2, Complex(FT(56,7), FT(-21,5)));
+  f.set_coefficient(3, Complex(FT(-12,17), FT(-1,3)));
+  assert(f.get_coefficient(0)==Complex(FT(-12,17), FT(1,3)));
+  assert(f.get_coefficient(1)==Complex(FT(56,7), FT(21,5)));
+  assert(f.get_coefficient(2)==Complex(FT(56,7), FT(-21,5)));
+  assert(f.get_coefficient(3)==Complex(FT(-12,17), FT(-1,3)));
+
+  Isometry g;
+  g.set_coefficients(Complex(FT(-12,17), FT(1,3)), Complex(FT(56,7), FT(21,5)), Complex(FT(56,7), FT(-21,5)), Complex(FT(-12,17), FT(-1,3)));
+  assert(g.get_coefficient(0)==Complex(FT(-12,17), FT(1,3)));
+  assert(g.get_coefficient(1)==Complex(FT(56,7), FT(21,5)));
+  assert(g.get_coefficient(2)==Complex(FT(56,7), FT(-21,5)));
+  assert(g.get_coefficient(3)==Complex(FT(-12,17), FT(-1,3)));
+
+  Isometry h = f*g;
+  assert(h.get_coefficient(0) == Complex(FT(5333816,65025),FT(-8,17)));
+  assert(h.get_coefficient(1) == Complex(FT(-192,17),FT(-504,85)));
+  assert(h.get_coefficient(2) == Complex(FT(-192,17),FT(504,85)));
+  assert(h.get_coefficient(3) == Complex(FT(5333816,65025),FT(8,17)));
+
+  Point point (FT(3,11),FT(-1,73));
+  Point image_point = h.evaluate(point);
+  assert(image_point==Point(FT("9146011623056232") /
+                            FT("66567955527962869"),
+                            -FT("12617302915955411") /
+                            FT("133135911055925738")));
+
+  std::cout << "printing an isometry for test purposes : " << std::endl << h;
+
+  Isometry tau_1 = CGAL::hyperbolic_translation<Traits>(point);
+  Isometry tau_1_prime = CGAL::hyperbolic_translation<Traits>(Point (FT(-3,11),FT(1,73)), true);
+  Isometry tau_1_inv = CGAL::hyperbolic_translation<Traits>(point, true);
+  assert(tau_1.evaluate(image_point) == tau_1_prime.evaluate(image_point));
+  assert((tau_1*tau_1_inv).evaluate(image_point) == image_point);
+
+  Point p (FT(2,15),FT(0));
+  Point q (FT(0),FT(17,93));
+  Isometry rotation = CGAL::hyperbolic_rotation<Traits>(p, q);
+  Isometry rotation_prime = CGAL::hyperbolic_rotation<Traits>(q, p, true);
+  Isometry rotation_inv = CGAL::hyperbolic_rotation<Traits>(p, q, true);
+  assert(rotation.evaluate(image_point) == rotation_prime.evaluate(image_point));
+  assert((rotation*rotation_inv).evaluate(image_point) == image_point);
+
+  Point p_imag = rotation.evaluate(p);
+  Point q_imag = rotation.evaluate(q);
+  Isometry pairing = CGAL::isometry_pairing_the_sides<Traits>(p, q, p_imag, q_imag);
+  assert(pairing.evaluate(p) == p_imag);
+  assert(pairing.evaluate(q) == q_imag);
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_lazy_exact_nt.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_lazy_exact_nt.cpp
new file mode 100644
index 00000000000..5f11fd2df0e
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_lazy_exact_nt.cpp
@@ -0,0 +1,63 @@
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Hyperbolic_fundamental_domain_factory_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2_IO.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Lazy_exact_nt.h>
+#include <CGAL/Cartesian.h>
+
+#include <iostream>
+#include <sstream>
+#include <tuple>
+#include <vector>
+
+typedef CGAL::Cartesian<CGAL::Lazy_exact_nt<CGAL::Exact_rational>>            Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>              ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                       Traits;
+typedef CGAL::Hyperbolic_fundamental_domain_2<Traits>                         Domain;
+typedef CGAL::Hyperbolic_fundamental_domain_factory_2<Traits>                 Factory;
+typedef CGAL::Triangulation_on_hyperbolic_surface_2<Traits>                   Triangulation;
+
+typedef typename Traits::Hyperbolic_point_2                                   Point;
+
+int main()
+{
+  Factory factory;
+  Domain domain = factory.make_hyperbolic_fundamental_domain_g2(3459);
+  Triangulation triangulation0 = Triangulation(domain);
+
+  assert(triangulation0.is_valid());
+
+  Triangulation triangulation (triangulation0);
+  assert(triangulation.has_anchor());
+
+  std::stringstream buffer;
+  buffer << triangulation;
+  buffer >> triangulation;
+
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> input_not_centered;
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> input_centered;
+
+  input_not_centered = triangulation.lift(false);
+  input_centered = triangulation.lift();
+
+  triangulation.make_Delaunay();
+
+  assert(triangulation.is_Delaunay());
+
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> output_not_centered;
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> output_centered;
+
+  output_not_centered = triangulation.lift(false);
+  output_centered = triangulation.lift();
+
+  Triangulation::Combinatorial_map_with_cross_ratios& cmap = triangulation.combinatorial_map();
+  Triangulation::Anchor& anchor = triangulation.anchor();
+  assert(cmap.is_dart_used(anchor.dart));
+
+  std::cout << "printing triangulation for test purposes: " << std::endl << triangulation;
+
+  return 0;
+}
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_triangulation.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_triangulation.cpp
new file mode 100644
index 00000000000..0ccf8b82965
--- /dev/null
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_triangulation.cpp
@@ -0,0 +1,80 @@
+#include <CGAL/Hyperbolic_surface_traits_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2.h>
+#include <CGAL/Triangulation_on_hyperbolic_surface_2_IO.h>
+#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
+
+#include <CGAL/Exact_rational.h>
+#include <CGAL/Cartesian.h>
+
+#include <iostream>
+#include <sstream>
+#include <vector>
+
+typedef CGAL::Cartesian<CGAL::Exact_rational>                           Kernel;
+typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel>        ParentTraits;
+typedef CGAL::Hyperbolic_surface_traits_2<ParentTraits>                 Traits;
+typedef CGAL::Hyperbolic_fundamental_domain_2<Traits>                   Domain;
+typedef CGAL::Triangulation_on_hyperbolic_surface_2<Traits>             Triangulation;
+
+typedef typename Traits::FT                                             FT;
+typedef typename Traits::Hyperbolic_point_2                             Point;
+typedef typename Traits::Complex                                        Complex;
+
+Domain build_domain()
+{
+  std::vector<Point> vertices;
+  vertices.push_back( Point(FT(809,10000),FT(0)));
+  vertices.push_back( Point(FT(7359,10000),FT(1877,10000)));
+  vertices.push_back( Point(FT(-999,2500),FT(881,1000)));
+  vertices.push_back( Point(FT("-22088524601252853411192791001942853611410938513/24711029456888649611435724068315791591836010000"),FT("9482675065452890527617859332378101016513362487/24711029456888649611435724068315791591836010000")));
+  vertices.push_back( Point(FT(-809,10000),FT(0)));
+  vertices.push_back( Point(FT(-7359,10000),FT(-1877,10000)));
+  vertices.push_back( Point(FT(999,2500),FT(-881,1000)));
+  vertices.push_back( Point(FT("22088524601252853411192791001942853611410938513/24711029456888649611435724068315791591836010000"),FT("-9482675065452890527617859332378101016513362487/24711029456888649611435724068315791591836010000")));
+
+  std::vector<int> pairings;
+  for (int k=0; k<8; ++k) {
+    pairings.push_back((k+4)%8);
+  }
+
+  return Domain(vertices, pairings);
+}
+
+int main()
+{
+  Domain domain = build_domain();
+  Triangulation triangulation0 = Triangulation(domain);
+
+  assert(triangulation0.is_valid());
+
+  Triangulation triangulation (triangulation0);
+  assert(triangulation.has_anchor());
+
+  std::stringstream buffer;
+  buffer << triangulation;
+  buffer >> triangulation;
+
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> input_not_centered;
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> input_centered;
+
+  input_not_centered = triangulation.lift(false);
+  input_centered = triangulation.lift();
+
+  triangulation.make_Delaunay();
+
+  assert(triangulation.is_Delaunay());
+
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> output_not_centered;
+  std::vector<std::tuple<typename Triangulation::Combinatorial_map_with_cross_ratios::Dart_const_handle,Point,Point,Point>> output_centered;
+
+  output_not_centered = triangulation.lift(false);
+  output_centered = triangulation.lift();
+
+  Triangulation::Combinatorial_map_with_cross_ratios& cmap = triangulation.combinatorial_map();
+  Triangulation::Anchor& anchor = triangulation.anchor();
+  assert(cmap.is_dart_used(anchor.dart));
+
+  std::cout << "printing triangulation for test purposes: " << std::endl << triangulation;
+
+  return 0;
+}
diff --git a/Visibility_2/doc/Visibility_2/visibility_2.txt b/Visibility_2/doc/Visibility_2/visibility_2.txt
index d0dcdc09c49..e4ab65a512d 100644
--- a/Visibility_2/doc/Visibility_2/visibility_2.txt
+++ b/Visibility_2/doc/Visibility_2/visibility_2.txt
@@ -87,7 +87,7 @@ Where \f$ n \f$ denotes the number of vertices of \f$ f \f$ and \f$ h \f$ the nu
 Example representing a cathedral.
 \cgalFigureEnd
 
-The left hand side of Figure \cgalFigureRef{cathedral-fig} depicts the outer boundary of a cathedral,
+The left hand side of \cgalFigureRef{cathedral-fig} depicts the outer boundary of a cathedral,
 which is a simple polygon with 565 vertices.
 The right hand side shows the cathedral also with its inner pillars, which is a polygon (with holes)
 with 1153 vertices.
diff --git a/Weights/include/CGAL/Weights/tangent_weights.h b/Weights/include/CGAL/Weights/tangent_weights.h
index 7788a961218..84c9587cac4 100644
--- a/Weights/include/CGAL/Weights/tangent_weights.h
+++ b/Weights/include/CGAL/Weights/tangent_weights.h
@@ -401,7 +401,7 @@ public:
       return FT(0);
 
     FT weight = FT(0);
-    if (is_border_edge(he, m_pmesh)) // ie, opp(he, pmesh) is a border halfedge
+    if (is_border_edge(he, m_pmesh)) // i.e., opp(he, pmesh) is a border halfedge
     {
       const halfedge_descriptor h1 = next(he, m_pmesh);