有没有一个CGAL函数可以检查一个点是否在有洞的线性多边形内？

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Polygon_with_holes_2.h>
#include <CGAL/Boolean_set_operations_2.h>

typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Polygon_with_holes_2<K> Polygon_with_holes_2;
typedef K::Point_2 Point_2;

bool isPointInsidePolygon(const Point_2& point, const Polygon_with_holes_2& polygon) {
    return CGAL::bounded_side_2(polygon.outer_boundary().vertices_begin(),
                                polygon.outer_boundary().vertices_end(),
                                point) == CGAL::ON_BOUNDED_SIDE;
}

int main() {
    // 构建一个有洞的线性多边形
    Polygon_with_holes_2 polygon;
    polygon.outer_boundary().push_back(Point_2(0, 0));
    polygon.outer_boundary().push_back(Point_2(0, 4));
    polygon.outer_boundary().push_back(Point_2(4, 4));
    polygon.outer_boundary().push_back(Point_2(4, 0));
    polygon.add_hole();
    polygon.add_hole().push_back(Point_2(1, 1));
    polygon.add_hole().push_back(Point_2(1, 3));
    polygon.add_hole().push_back(Point_2(3, 3));
    polygon.add_hole().push_back(Point_2(3, 1));

    // 检查点是否在多边形内部
    Point_2 point(2, 2);
    bool isInside = isPointInsidePolygon(point, polygon);

    if (isInside) {
        std::cout << "The point is inside the polygon." << std::endl;
    } else {
        std::cout << "The point is outside the polygon." << std::endl;
    }

    return 0;
}