adding do_intersect_circle_iso_rectangle_2 to AABB_traits_2

AABB_tree/include/CGAL/AABB_traits_2.h

@@ -395,15 +395,15 @@ public:
   public:
       CGAL::Comparison_result operator()(const Point& p, const Bounding_box& bb, const Point& bound, Tag_true) const
       {
-          return GeomTraits().do_intersect_2_object()
+          return do_intersect_circle_iso_rectangle_2
           (GeomTraits().construct_circle_2_object()
-           (p, GeomTraits().compute_squared_distance_2_object()(p, bound)), bb,true)?
+           (p, GeomTraits().compute_squared_distance_2_object()(p, bound)), bb)?
           CGAL::SMALLER : CGAL::LARGER;
       }
 
       CGAL::Comparison_result operator()(const Point& p, const Bounding_box& bb, const Point& bound, Tag_false) const
       {
-          return GeomTraits().do_intersect_2_object()
+          return do_intersect_circle_iso_rectangle_2
           (GeomTraits().construct_circle_2_object()
            (p, GeomTraits().compute_squared_distance_2_object()(p, bound)), bb)?
           CGAL::SMALLER : CGAL::LARGER;
@@ -433,6 +433,45 @@ public:
           CGAL::SMALLER :
           CGAL::LARGER;
       }
+
+      typename GeomTraits::Boolean do_intersect_circle_iso_rectangle_2(const typename GeomTraits::Circle_2& circle,
+        const typename GeomTraits::Iso_rectangle_2& rec) const
+      {
+        typedef typename GeomTraits::FT       FT;
+        typedef typename GeomTraits::Point_2  Point;
+
+        Point center = circle.center();
+
+        // Check that the minimum distance to the box is smaller than the radius, otherwise there is
+        // no intersection. `distance` stays at 0 if the center is inside or on `rec`.
+        FT distance = FT(0);
+        if (center.x() < rec.xmin())
+        {
+          FT d = rec.xmin() - center.x();
+          distance += d * d;
+        }
+        else if (center.x() > rec.xmax())
+        {
+          FT d = center.x() - rec.xmax();
+          distance += d * d;
+        }
+
+        if (center.y() < rec.ymin())
+        {
+          FT d = rec.ymin() - center.y();
+          distance += d * d;
+        }
+        else if (center.y() > rec.ymax())
+        {
+          FT d = center.y() - rec.ymax();
+          distance += d * d;
+        }
+
+        if (distance <= circle.squared_radius())
+          return true;
+
+        return false;
+      }
   };
 
   Closest_point closest_point_object() const {return Closest_point(*this);}

AABB_tree/test/AABB_tree/aabb_test_closest_point_2.cpp

@@ -0,0 +1,80 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Exact_rational.h>
+
+#include <CGAL/AABB_tree.h>
+#include <CGAL/AABB_traits_2.h>
+#include <CGAL/AABB_triangle_primitive_2.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <array>
+#include <iostream>
+#include <string>
+#include <vector>
+
+template<typename Kernel>
+void test(const std::vector<CGAL::Simple_cartesian<double>::Point_2> &points, const std::vector<std::array<std::size_t, 3> > &faces) {
+  using Point_2 = typename Kernel::Point_2;
+  using Triangle_2 = typename Kernel::Triangle_2;
+  using Iterator = typename std::vector<Triangle_2>::const_iterator;
+  using Primitive = CGAL::AABB_triangle_primitive_2<Kernel, Iterator>;
+  using Tree_traits = CGAL::AABB_traits_2<Kernel, Primitive>;
+  using Tree = CGAL::AABB_tree<Tree_traits>;
+
+  std::vector<Triangle_2> triangles(faces.size());
+  for (std::size_t i = 0; i < faces.size(); ++i) {
+    const auto& f = faces[i];
+    triangles[i] = Triangle_2(Point_2(points[f[0]].x(), points[f[0]].y()), Point_2(points[f[1]].x(), points[f[1]].y()), Point_2(points[f[2]].x(), points[f[2]].y()));
+  }
+
+  Tree tree(triangles.begin(), triangles.end());
+
+  // Without hint
+  Point_2 query(-0.092372499264859229, -0.5067061545706153);
+  Point_2 closest_point = tree.closest_point(query);
+  std::cout << "Closest point to " << query << " is " << closest_point << std::endl;
+
+  // With hint
+  Point_2 hint(-0.077185400000000001, -0.42269299999999999);
+  Point_2 closest_point_hint = tree.closest_point(query, hint);
+  std::cout << "Closest point to " << query << " with hint " << hint << " is " << closest_point_hint << std::endl << std::endl;
+
+  assert(closest_point == closest_point_hint);
+}
+
+int main(int argc, char** argv)
+{
+  std::cout.precision(17);
+
+  // Read the input
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/camel.off");
+  std::cout << "Reading " << filename << "..." << std::endl;
+
+  std::vector<CGAL::Simple_cartesian<double>::Point_3> points;
+  std::vector<std::array<std::size_t, 3> > faces;
+  if (!CGAL::IO::read_polygon_soup(filename, points, faces) || faces.empty())
+  {
+    std::cerr << "Invalid input:" << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Input: " << points.size() << " points, " << faces.size() << " faces" << std::endl;
+
+  // Project onto the XY plane
+  std::vector<CGAL::Simple_cartesian<double>::Point_2> points_2(points.size());
+  for (std::size_t i = 0; i < points.size(); ++i)
+    points_2[i] = CGAL::Simple_cartesian<double>::Point_2(points[i].x(), points[i].y());
+
+  std::cout << "Testing closest point with Simple_cartesian<double>:" << std::endl;
+  test<CGAL::Simple_cartesian<double> >(points_2, faces);
+  std::cout << "Testing closest point with Epick:" << std::endl;
+  test<CGAL::Exact_predicates_inexact_constructions_kernel>(points_2, faces);
+  std::cout << "Testing closest point with Epeck:" << std::endl;
+  test<CGAL::Exact_predicates_exact_constructions_kernel>(points_2, faces);
+  std::cout << "Testing closest point with Simple_cartesian<Exact_rational>:" << std::endl;
+  test<CGAL::Simple_cartesian<CGAL::Exact_rational>>(points_2, faces);
+
+  std::cout << "Done." << std::endl;
+
+  return EXIT_SUCCESS;
+}