The btTriangleInfoMap stores edge angle information for some triangles. You can compute this information yourself or using btGenerateInternalEdgeInfo. More...
#include <btTriangleInfoMap.h>
Public Member Functions | |
| btTriangleInfoMap () | |
| used to determine if a triangle is degenerate (length squared of cross product of 2 triangle edges < threshold) | |
| virtual int | calculateSerializeBufferSize () const |
| void | deSerialize (struct btTriangleInfoMapData &data) |
| fills the dataBuffer and returns the struct name (and 0 on failure) | |
| virtual const char * | serialize (void *dataBuffer, btSerializer *serializer) const |
| fills the dataBuffer and returns the struct name (and 0 on failure) | |
| virtual | ~btTriangleInfoMap () |
Public Attributes | |
| btScalar | m_convexEpsilon |
| btScalar | m_edgeDistanceThreshold |
| used to compute connectivity: if the distance between two vertices is smaller than m_equalVertexThreshold, they are considered to be 'shared' | |
| btScalar | m_equalVertexThreshold |
| used to determine if a triangle edge is planar with zero angle | |
| btScalar | m_maxEdgeAngleThreshold |
| used to determine edge contacts: if the closest distance between a contact point and an edge is smaller than this distance threshold it is considered to "hit the edge" | |
| btScalar | m_planarEpsilon |
| used to determine if an edge or contact normal is convex, using the dot product | |
| btScalar | m_zeroAreaThreshold |
The btTriangleInfoMap stores edge angle information for some triangles. You can compute this information yourself or using btGenerateInternalEdgeInfo.
Definition at line 58 of file btTriangleInfoMap.h.
| btTriangleInfoMap::btTriangleInfoMap | ( | ) | [inline] |
used to determine if a triangle is degenerate (length squared of cross product of 2 triangle edges < threshold)
Definition at line 68 of file btTriangleInfoMap.h.
| virtual btTriangleInfoMap::~btTriangleInfoMap | ( | ) | [inline, virtual] |
Definition at line 77 of file btTriangleInfoMap.h.
| SIMD_FORCE_INLINE int btTriangleInfoMap::calculateSerializeBufferSize | ( | ) | const [virtual] |
Definition at line 116 of file btTriangleInfoMap.h.
| SIMD_FORCE_INLINE void btTriangleInfoMap::deSerialize | ( | struct btTriangleInfoMapData & | data | ) |
fills the dataBuffer and returns the struct name (and 0 on failure)
Definition at line 203 of file btTriangleInfoMap.h.
| SIMD_FORCE_INLINE const char * btTriangleInfoMap::serialize | ( | void * | dataBuffer, |
| btSerializer * | serializer | ||
| ) | const [virtual] |
fills the dataBuffer and returns the struct name (and 0 on failure)
Definition at line 122 of file btTriangleInfoMap.h.
Definition at line 60 of file btTriangleInfoMap.h.
used to compute connectivity: if the distance between two vertices is smaller than m_equalVertexThreshold, they are considered to be 'shared'
Definition at line 63 of file btTriangleInfoMap.h.
used to determine if a triangle edge is planar with zero angle
Definition at line 62 of file btTriangleInfoMap.h.
used to determine edge contacts: if the closest distance between a contact point and an edge is smaller than this distance threshold it is considered to "hit the edge"
Definition at line 64 of file btTriangleInfoMap.h.
used to determine if an edge or contact normal is convex, using the dot product
Definition at line 61 of file btTriangleInfoMap.h.
Definition at line 65 of file btTriangleInfoMap.h.
