diff --git a/test/robustness/overlay/linear_areal/recursive_polygons_linear_areal.cpp b/test/robustness/overlay/linear_areal/recursive_polygons_linear_areal.cpp index 83ee49f7f1..88846eb08f 100644 --- a/test/robustness/overlay/linear_areal/recursive_polygons_linear_areal.cpp +++ b/test/robustness/overlay/linear_areal/recursive_polygons_linear_areal.cpp @@ -28,7 +28,7 @@ #include #include -#include +//#include #include #include @@ -213,14 +213,9 @@ public : bg::convert(segment, seg2); bg::strategy::intersection::cartesian_segments<> strategy; - bg::policies::relate::segments_intersection_points - < - bg::segment_intersection_points - > policy; - bg::detail::segment_as_subrange subrange1(seg1); bg::detail::segment_as_subrange subrange2(seg2); - bg::segment_intersection_points is + bg::segment_intersection_points is = strategy.apply(subrange1, subrange2, policy_t()); if (is.count == 2) @@ -307,6 +302,7 @@ bool verify(std::string const& caseid, MultiPolygon const& mp, Linestring const& border_check bc(mp, result); bg::for_each_segment(difference, bc); + /* commented out since it needs extensions, tests are passing without that part // 3) check also the mid-points from the difference to remove false positives for (Linestring const& d : difference) { @@ -315,11 +311,11 @@ bool verify(std::string const& caseid, MultiPolygon const& mp, Linestring const& outside_check ocm(mp, result); bg::for_each_point(difference_midpoints, ocm); } - + */ if (settings.verbose) { - std::cout << " [" << bg::area(mp) << " " << bg::length(ls) << - " " << bg::length(intersection) << + std::cout << " [" << bg::area(mp) << " " << bg::length(ls) << + " " << bg::length(intersection) << " " << bg::length(difference) << "]"; }