Go to the source code of this file.
|
| bool | collision::solvers::solverBoost::boost_within (const BoostPolygon &polyg1, const BoostPolygon &polyg2) |
| | Returns true if the BoostPolygon polyg1 is completely contained within the other BoostPolygon object polyg2. More...
|
| |
| int | collision::solvers::solverBoost::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 oriented rectangles is computed. More...
|
| |
| int | collision::solvers::solverBoost::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 ShapeGroup objects. More...
|
| |
| int | collision::solvers::solverBoost::boost_ccd_obb_sum_collision (const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res) |
| |
| int | collision::solvers::solverBoost::boost_polygon_enclosure (const ShapeGroup &sg, const RectangleOBB &obb, bool &res) |
| |
| template<typename T > |
| int | collision::solvers::solverBoost::boost_polygon_enclosure_grid (T &grid, std::vector< BoostPolygon *> polygons, AABB &aabb, const BoostPolygon *obj_poly, bool &res) |
| |
| int | collision::solvers::solverBoost::boost_ccd_convex_hull_polygon_enclosure (const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res) |
| |
| int | collision::solvers::solverBoost::boost_ccd_obb_sum_polygon_enclosure (const ShapeGroup &sg, const RectangleOBB &pos1, const RectangleOBB &pos2, bool &res) |
| |
1.8.13