Loading src/csg/cgal_helper_polygon.cpp +2 −7 Original line number Diff line number Diff line #include "csg_cgal_helper.hpp" #include <CGAL/Polygon_2.h> #include <CGAL/Polygon_2_algorithms.h> namespace { typedef CGAL::Polygon_2<cgal_helper::IK> Polygon; typedef CGAL::Point_2<cgal_helper::IK> Point; typedef CGAL::Point_2<cgal_helper::CK> Point; } // namespace namespace cgal_helper { Loading @@ -32,8 +28,7 @@ Polygon create_polygon(const std::vector<std::tuple<double, double>> &points, bool inside(const Polygon &polygon, double xx, double yy) { return CGAL::bounded_side_2(polygon.begin(), polygon.end(), Point(xx, yy), IK()) == CGAL::ON_BOUNDED_SIDE; return polygon.has_on_bounded_side(Point(xx, yy)); } } // namespace cgal_helper src/csg_cgal_helper.hpp +1 −2 Original line number Diff line number Diff line Loading @@ -10,8 +10,7 @@ namespace cgal_helper { typedef CGAL::Simple_cartesian<double> CK; typedef CGAL::Polyhedron_3<CK> Polyhedron; typedef CGAL::Exact_predicates_inexact_constructions_kernel IK; typedef CGAL::Polygon_2<IK> Polygon; typedef CGAL::Polygon_2<CK> Polygon; Polyhedron create_polyhedron(const std::vector<std::tuple<double, double, double>> &points, Loading Loading
src/csg/cgal_helper_polygon.cpp +2 −7 Original line number Diff line number Diff line #include "csg_cgal_helper.hpp" #include <CGAL/Polygon_2.h> #include <CGAL/Polygon_2_algorithms.h> namespace { typedef CGAL::Polygon_2<cgal_helper::IK> Polygon; typedef CGAL::Point_2<cgal_helper::IK> Point; typedef CGAL::Point_2<cgal_helper::CK> Point; } // namespace namespace cgal_helper { Loading @@ -32,8 +28,7 @@ Polygon create_polygon(const std::vector<std::tuple<double, double>> &points, bool inside(const Polygon &polygon, double xx, double yy) { return CGAL::bounded_side_2(polygon.begin(), polygon.end(), Point(xx, yy), IK()) == CGAL::ON_BOUNDED_SIDE; return polygon.has_on_bounded_side(Point(xx, yy)); } } // namespace cgal_helper
src/csg_cgal_helper.hpp +1 −2 Original line number Diff line number Diff line Loading @@ -10,8 +10,7 @@ namespace cgal_helper { typedef CGAL::Simple_cartesian<double> CK; typedef CGAL::Polyhedron_3<CK> Polyhedron; typedef CGAL::Exact_predicates_inexact_constructions_kernel IK; typedef CGAL::Polygon_2<IK> Polygon; typedef CGAL::Polygon_2<CK> Polygon; Polyhedron create_polyhedron(const std::vector<std::tuple<double, double, double>> &points, Loading