distance result
More...
#include <coal/collision_data.h>
|
| | DistanceResult (CoalScalar min_distance_=(std::numeric_limits< CoalScalar >::max)()) |
| void | update (CoalScalar distance, const CollisionGeometry *o1_, const CollisionGeometry *o2_, int b1_, int b2_) |
| | add distance information into the result
|
| void | update (CoalScalar distance, const CollisionGeometry *o1_, const CollisionGeometry *o2_, int b1_, int b2_, const Vec3s &p1, const Vec3s &p2, const Vec3s &normal_) |
| | add distance information into the result
|
| void | update (const DistanceResult &other_result) |
| | add distance information into the result
|
| void | clear () |
| | clear the result
|
| bool | operator== (const DistanceResult &other) const |
| | whether two DistanceResult are the same or not
|
| | QueryResult () |
|
| CoalScalar | min_distance |
| | minimum distance between two objects. If two objects are in collision and DistanceRequest::enable_signed_distance is activated, min_distance <= 0.
|
| Vec3s | normal |
| | normal.
|
| std::array< Vec3s, 2 > | nearest_points |
| | nearest points. See CollisionResult::nearest_points.
|
| const CollisionGeometry * | o1 |
| | collision object 1
|
| const CollisionGeometry * | o2 |
| | collision object 2
|
| int | b1 |
| | information about the nearest point in object 1 if object 1 is mesh or point cloud, it is the triangle or point id if object 1 is geometry shape, it is NONE (-1), if object 1 is octree, it is the id of the cell
|
| int | b2 |
| | information about the nearest point in object 2 if object 2 is mesh or point cloud, it is the triangle or point id if object 2 is geometry shape, it is NONE (-1), if object 2 is octree, it is the id of the cell
|
| Vec3s | cached_gjk_guess |
| | stores the last GJK ray when relevant.
|
| support_func_guess_t | cached_support_func_guess |
| | stores the last support function vertex index, when relevant.
|
| CPUTimes | timings |
| | timings for the given request
|
|
| static const int | NONE = -1 |
| | invalid contact primitive information
|
◆ DistanceResult()
| coal::DistanceResult::DistanceResult | ( | CoalScalar | min_distance_ = (std::numeric_limits<CoalScalar>::max)() | ) | |
| inline |
◆ clear()
| void coal::DistanceResult::clear | ( | | ) | |
| inline |
◆ operator==()
| bool coal::DistanceResult::operator== | ( | const DistanceResult & | other | ) | const |
| inline |
◆ update() [1/3]
add distance information into the result
◆ update() [2/3]
add distance information into the result
◆ update() [3/3]
add distance information into the result
◆ b1
| int coal::DistanceResult::b1 |
information about the nearest point in object 1 if object 1 is mesh or point cloud, it is the triangle or point id if object 1 is geometry shape, it is NONE (-1), if object 1 is octree, it is the id of the cell
◆ b2
| int coal::DistanceResult::b2 |
information about the nearest point in object 2 if object 2 is mesh or point cloud, it is the triangle or point id if object 2 is geometry shape, it is NONE (-1), if object 2 is octree, it is the id of the cell
◆ min_distance
◆ nearest_points
| std::array<Vec3s, 2> coal::DistanceResult::nearest_points |
◆ NONE
| const int coal::DistanceResult::NONE = -1 |
| static |
invalid contact primitive information
◆ normal
| Vec3s coal::DistanceResult::normal |
◆ o1
◆ o2
The documentation for this struct was generated from the following file: