|
|
PX_FORCE_INLINE | ConvexHullData (const PxEMPTY) |
| |
|
PX_FORCE_INLINE const CenterExtentsPadded & | getPaddedBounds () const |
| |
|
PX_FORCE_INLINE const PxVec3 * | getHullVertices () const |
| | < Convex hull vertices
|
| |
|
PX_FORCE_INLINE const PxU8 * | getFacesByEdges8 () const |
| | < for each edge, gives 2 adjacent polygons; used by convex-convex code to come up with all the convex' edge normals.
|
| |
|
PX_FORCE_INLINE const PxU8 * | getFacesByVertices8 () const |
| | < for each edge, gives 2 adjacent polygons; used by convex-convex code to come up with all the convex' edge normals.
|
| |
|
PX_FORCE_INLINE const PxU16 * | getVerticesByEdges16 () const |
| | < Vertex indices indexed by unique edges
|
| |
|
PX_FORCE_INLINE const PxU8 * | getVertexData8 () const |
| | < Vertex indices indexed by hull polygons
|
| |
|
|
CenterExtents | mAABB |
| | bounds TODO: compute this on the fly from first 6 vertices in the vertex array. We'll of course need to sort the most extreme ones to the front.
|
| |
|
PxVec3 | mCenterOfMass |
| |
|
PxBitAndWord | mNbEdges |
| | the highest bit indicate whether we have grb data, the other 15 bits indicate the number of edges in this convex hull
|
| |
|
PxU8 | mNbHullVertices |
| | Number of vertices in the convex hull.
|
| |
|
PxU8 | mNbPolygons |
| | Number of planar polygons composing the hull.
|
| |
|
HullPolygonData * | mPolygons |
| | Array of mNbPolygons structures.
|
| |
|
BigConvexRawData * | mBigConvexRawData |
| | Hill climbing data, only for large convexes! else NULL.
|
| |
|
SDF * | mSdfData |
| |
|
InternalObjectsData | mInternal |
| |
The documentation for this struct was generated from the following file: