16 #ifndef _BT_TRIANGLE_INFO_MAP_H
17 #define _BT_TRIANGLE_INFO_MAP_H
25 #define TRI_INFO_V0V1_CONVEX 1
26 #define TRI_INFO_V1V2_CONVEX 2
27 #define TRI_INFO_V2V0_CONVEX 4
29 #define TRI_INFO_V0V1_SWAP_NORMALB 8
30 #define TRI_INFO_V1V2_SWAP_NORMALB 16
31 #define TRI_INFO_V2V0_SWAP_NORMALB 32
138 int sz =
sizeof(int);
141 int* memPtr = (
int*)chunk->
m_oldPtr;
142 for (
int i=0;i<numElem;i++,memPtr++)
154 int sz =
sizeof(int);
157 int* memPtr = (
int*)chunk->
m_oldPtr;
158 for (
int i=0;i<numElem;i++,memPtr++)
173 for (
int i=0;i<numElem;i++,memPtr++)
187 int sz =
sizeof(int);
190 int* memPtr = (
int*)chunk->
m_oldPtr;
191 for (
int i=0;i<numElem;i++,memPtr++)
198 return "btTriangleInfoMapData";
241 #endif //_BT_TRIANGLE_INFO_MAP_H
btAlignedObjectArray< int > m_hashTable
btScalar m_zeroAreaThreshold
btAlignedObjectArray< int > m_next
btScalar m_maxEdgeAngleThreshold
used to determine edge contacts: if the closest distance between a contact point and an edge is small...
virtual void * getUniquePointer(void *oldPtr)=0
#define SIMD_FORCE_INLINE
btAlignedObjectArray< Key > m_keyArray
btScalar m_equalVertexThreshold
used to determine if a triangle edge is planar with zero angle
those fields have to be float and not btScalar for the serialization to work properly ...
The btHashMap template class implements a generic and lightweight hashmap.
float m_equalVertexThreshold
int size() const
return the number of elements in the array
btScalar m_edgeDistanceThreshold
used to compute connectivity: if the distance between two vertices is smaller than m_equalVertexThres...
btHashMap< btHashInt, btTriangleInfo > btInternalTriangleInfoMap
The btTriangleInfo structure stores information to adjust collision normals to avoid collisions again...
btAlignedObjectArray< Value > m_valueArray
virtual void finalizeChunk(btChunk *chunk, const char *structType, int chunkCode, void *oldPtr)=0
float m_edgeDistanceThreshold
void resize(int newsize, const T &fillData=T())
btTriangleInfoMap()
used to determine if a triangle is degenerate (length squared of cross product of 2 triangle edges < ...
virtual int calculateSerializeBufferSize() const
virtual const char * serialize(void *dataBuffer, btSerializer *serializer) const
fills the dataBuffer and returns the struct name (and 0 on failure)
void deSerialize(struct btTriangleInfoMapData &data)
fills the dataBuffer and returns the struct name (and 0 on failure)
virtual ~btTriangleInfoMap()
The btTriangleInfoMap stores edge angle information for some triangles. You can compute this informat...
btTriangleInfoData * m_valueArrayPtr
float m_zeroAreaThreshold
virtual btChunk * allocate(size_t size, int numElements)=0
float btScalar
The btScalar type abstracts floating point numbers, to easily switch between double and single floati...
btScalar m_planarEpsilon
used to determine if an edge or contact normal is convex, using the dot product