|
| static ConvexBase * | convexHull (std::shared_ptr< std::vector< Vec3s >> &points, unsigned int num_points, bool keepTriangles, const char *qhullCommand=NULL) |
| | Build a convex hull based on Qhull library and store the vertices and optionally the triangles. More...
|
| |
| static ConvexBase * | convexHull (const Vec3s *points, unsigned int num_points, bool keepTriangles, const char *qhullCommand=NULL) |
| |
| std::shared_ptr< std::vector< PolygonT > > | polygons |
| | An array of PolygonT object. PolygonT should contains a list of vertices for each polygon, in counter clockwise order. More...
|
| |
| unsigned int | num_polygons |
| |
| std::shared_ptr< std::vector< Vec3s > > | points |
| | An array of the points of the polygon. More...
|
| |
| unsigned int | num_points |
| |
| std::shared_ptr< std::vector< Vec3s > > | normals |
| | An array of the normals of the polygon. More...
|
| |
| std::shared_ptr< std::vector< double > > | offsets |
| | An array of the offsets to the normals of the polygon. Note: there are as many offsets as normals. More...
|
| |
| unsigned int | num_normals_and_offsets |
| |
| std::shared_ptr< std::vector< Neighbors > > | neighbors |
| | Neighbors of each vertex. It is an array of size num_points. For each vertex, it contains the number of neighbors and a list of indices pointing to them. More...
|
| |
| Vec3s | center |
| | center of the convex polytope, this is used for collision: center is guaranteed in the internal of the polytope (as it is convex) More...
|
| |
| SupportWarmStartPolytope | support_warm_starts |
| | Support warm start polytopes. More...
|
| |
| Vec3s | aabb_center |
| | AABB center in local coordinate. More...
|
| |
| CoalScalar | aabb_radius |
| | AABB radius. More...
|
| |
| AABB | aabb_local |
| | AABB in local coordinate, used for tight AABB when only translation transform. More...
|
| |
| void * | user_data |
| | pointer to user defined data specific to this object More...
|
| |
| CoalScalar | cost_density |
| | collision cost for unit volume More...
|
| |
| CoalScalar | threshold_occupied |
| | threshold for occupied ( >= is occupied) More...
|
| |
| CoalScalar | threshold_free |
| | threshold for free (<= is free) More...
|
| |
| static constexpr size_t | num_vertices_large_convex_threshold = 32 |
| | Above this threshold, the convex polytope is considered large. This influcences the way the support function is computed. More...
|
| |
| static constexpr size_t | num_support_warm_starts = 14 |
| | Number of support warm starts. More...
|
| |
| void | fillNeighbors () |
| |
| | ConvexBase () |
| | Construct an uninitialized convex object Initialization is done with ConvexBase::initialize. More...
|
| |
| void | initialize (std::shared_ptr< std::vector< Vec3s >> points_, unsigned int num_points_) |
| | Initialize the points of the convex shape This also initializes the ConvexBase::center. More...
|
| |
| void | set (std::shared_ptr< std::vector< Vec3s >> points_, unsigned int num_points_) |
| | Set the points of the convex shape. More...
|
| |
| | ConvexBase (const ConvexBase &other) |
| | Copy constructor Only the list of neighbors is copied. More...
|
| |
| void | buildSupportWarmStart () |
| | Build the support points warm starts. More...
|
| |
| std::shared_ptr< std::vector< unsigned int > > | nneighbors_ |
| | Array of indices of the neighbors of each vertex. Since we don't know a priori the number of neighbors of each vertex, we store the indices of the neighbors in a single array. The neighbors attribute, an array of Neighbors, is used to point each vertex to the right indices in the nneighbors_ array. More...
|
| |
| CoalScalar | m_swept_sphere_radius {0} |
| | Radius of the sphere swept around the shape. Default value is 0. Note: this property differs from inflated method of certain derived classes (e.g. Box, Sphere, Ellipsoid, Capsule, Cone, Cylinder) in the sense that inflated returns a new shape which can be inflated but also deflated. Also, an inflated shape is not rounded. It simply has a different size. Sweeping a shape with a sphere is a different operation (a Minkowski sum), which rounds the sharp corners of a shape. The swept sphere radius is a property of the shape itself and can be manually updated between collision checks. More...
|
| |