1 #ifndef CPP_COLLISION_INCLUDE_COLLISION_SOLVERS_BOOST_BOOST_COLLISION_QUERIES_H_ 2 #define CPP_COLLISION_INCLUDE_COLLISION_SOLVERS_BOOST_BOOST_COLLISION_QUERIES_H_ 8 namespace solverBoost {
10 bool boost_within(
const BoostPolygon& polyg1,
const BoostPolygon& polyg2);
16 const RectangleOBB& pos1,
17 const RectangleOBB& pos2,
bool& res);
20 const RectangleOBB& pos2,
bool& res);
27 AABB& aabb,
const BoostPolygon* obj_poly,
31 const RectangleOBB& pos1,
32 const RectangleOBB& pos2,
35 const RectangleOBB& pos1,
36 const RectangleOBB& pos2,
bool& res);
int boost_ccd_obb_sum_collision(const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res)
int boost_ccd_convex_hull_polygon_enclosure(const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res)
int boost_polygon_enclosure(const ShapeGroup &sg, const RectangleOBB &obb, bool &res)
int boost_ccd_convex_hull_collision(const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res)
Checks if the convex hull of the Boolean union of two given OBB boxes collides with any of the ShapeG...
std::shared_ptr< const Polygon > PolygonConstPtr
int boost_polygon_enclosure_grid(T &grid, std::vector< BoostPolygon *> polygons, AABB &aabb, const BoostPolygon *obj_poly, bool &res)
int boost_ccd_obb_sum_polygon_enclosure(const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res)
int boost_poly_poly_convex_hull(const Polygon &pos1, const Polygon &pos2, collision::PolygonConstPtr &resPoly)
Creates a collision Polygon of two RectangleOBB objects. The convex hull of the boolean union of the ...
bool boost_within(const BoostPolygon &polyg1, const BoostPolygon &polyg2)
Returns true if the BoostPolygon polyg1 is completely contained within the other BoostPolygon object ...