| /* | |
| Bullet Continuous Collision Detection and Physics Library | |
| Copyright (c) 2003-2009 Erwin Coumans http://bulletphysics.org | |
| This software is provided 'as-is', without any express or implied warranty. | |
| In no event will the authors be held liable for any damages arising from the use of this software. | |
| Permission is granted to anyone to use this software for any purpose, | |
| including commercial applications, and to alter it and redistribute it freely, | |
| subject to the following restrictions: | |
| 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. | |
| 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. | |
| 3. This notice may not be removed or altered from any source distribution. | |
| */ | |
| #include "BulletCollision/CollisionShapes/btPolyhedralConvexShape.h" | |
| btPolyhedralConvexShape::btPolyhedralConvexShape() :btConvexInternalShape() | |
| { | |
| } | |
| btVector3 btPolyhedralConvexShape::localGetSupportingVertexWithoutMargin(const btVector3& vec0)const | |
| { | |
| btVector3 supVec(0,0,0); | |
| #ifndef __SPU__ | |
| int i; | |
| btScalar maxDot(btScalar(-BT_LARGE_FLOAT)); | |
| btVector3 vec = vec0; | |
| btScalar lenSqr = vec.length2(); | |
| if (lenSqr < btScalar(0.0001)) | |
| { | |
| vec.setValue(1,0,0); | |
| } else | |
| { | |
| btScalar rlen = btScalar(1.) / btSqrt(lenSqr ); | |
| vec *= rlen; | |
| } | |
| btVector3 vtx; | |
| btScalar newDot; | |
| for (i=0;i<getNumVertices();i++) | |
| { | |
| getVertex(i,vtx); | |
| newDot = vec.dot(vtx); | |
| if (newDot > maxDot) | |
| { | |
| maxDot = newDot; | |
| supVec = vtx; | |
| } | |
| } | |
| #endif //__SPU__ | |
| return supVec; | |
| } | |
| void btPolyhedralConvexShape::batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const | |
| { | |
| #ifndef __SPU__ | |
| int i; | |
| btVector3 vtx; | |
| btScalar newDot; | |
| for (i=0;i<numVectors;i++) | |
| { | |
| supportVerticesOut[i][3] = btScalar(-BT_LARGE_FLOAT); | |
| } | |
| for (int j=0;j<numVectors;j++) | |
| { | |
| const btVector3& vec = vectors[j]; | |
| for (i=0;i<getNumVertices();i++) | |
| { | |
| getVertex(i,vtx); | |
| newDot = vec.dot(vtx); | |
| if (newDot > supportVerticesOut[j][3]) | |
| { | |
| //WARNING: don't swap next lines, the w component would get overwritten! | |
| supportVerticesOut[j] = vtx; | |
| supportVerticesOut[j][3] = newDot; | |
| } | |
| } | |
| } | |
| #endif //__SPU__ | |
| } | |
| void btPolyhedralConvexShape::calculateLocalInertia(btScalar mass,btVector3& inertia) const | |
| { | |
| #ifndef __SPU__ | |
| //not yet, return box inertia | |
| btScalar margin = getMargin(); | |
| btTransform ident; | |
| ident.setIdentity(); | |
| btVector3 aabbMin,aabbMax; | |
| getAabb(ident,aabbMin,aabbMax); | |
| btVector3 halfExtents = (aabbMax-aabbMin)*btScalar(0.5); | |
| btScalar lx=btScalar(2.)*(halfExtents.x()+margin); | |
| btScalar ly=btScalar(2.)*(halfExtents.y()+margin); | |
| btScalar lz=btScalar(2.)*(halfExtents.z()+margin); | |
| const btScalar x2 = lx*lx; | |
| const btScalar y2 = ly*ly; | |
| const btScalar z2 = lz*lz; | |
| const btScalar scaledmass = mass * btScalar(0.08333333); | |
| inertia = scaledmass * (btVector3(y2+z2,x2+z2,x2+y2)); | |
| #endif //__SPU__ | |
| } | |
| void btPolyhedralConvexAabbCachingShape::setLocalScaling(const btVector3& scaling) | |
| { | |
| btConvexInternalShape::setLocalScaling(scaling); | |
| recalcLocalAabb(); | |
| } | |
| btPolyhedralConvexAabbCachingShape::btPolyhedralConvexAabbCachingShape() | |
| :btPolyhedralConvexShape(), | |
| m_localAabbMin(1,1,1), | |
| m_localAabbMax(-1,-1,-1), | |
| m_isLocalAabbValid(false) | |
| { | |
| } | |
| void btPolyhedralConvexAabbCachingShape::getAabb(const btTransform& trans,btVector3& aabbMin,btVector3& aabbMax) const | |
| { | |
| getNonvirtualAabb(trans,aabbMin,aabbMax,getMargin()); | |
| } | |
| void btPolyhedralConvexAabbCachingShape::recalcLocalAabb() | |
| { | |
| m_isLocalAabbValid = true; | |
| #if 1 | |
| static const btVector3 _directions[] = | |
| { | |
| btVector3( 1., 0., 0.), | |
| btVector3( 0., 1., 0.), | |
| btVector3( 0., 0., 1.), | |
| btVector3( -1., 0., 0.), | |
| btVector3( 0., -1., 0.), | |
| btVector3( 0., 0., -1.) | |
| }; | |
| btVector3 _supporting[] = | |
| { | |
| btVector3( 0., 0., 0.), | |
| btVector3( 0., 0., 0.), | |
| btVector3( 0., 0., 0.), | |
| btVector3( 0., 0., 0.), | |
| btVector3( 0., 0., 0.), | |
| btVector3( 0., 0., 0.) | |
| }; | |
| batchedUnitVectorGetSupportingVertexWithoutMargin(_directions, _supporting, 6); | |
| for ( int i = 0; i < 3; ++i ) | |
| { | |
| m_localAabbMax[i] = _supporting[i][i] + m_collisionMargin; | |
| m_localAabbMin[i] = _supporting[i + 3][i] - m_collisionMargin; | |
| } | |
| #else | |
| for (int i=0;i<3;i++) | |
| { | |
| btVector3 vec(btScalar(0.),btScalar(0.),btScalar(0.)); | |
| vec[i] = btScalar(1.); | |
| btVector3 tmp = localGetSupportingVertex(vec); | |
| m_localAabbMax[i] = tmp[i]+m_collisionMargin; | |
| vec[i] = btScalar(-1.); | |
| tmp = localGetSupportingVertex(vec); | |
| m_localAabbMin[i] = tmp[i]-m_collisionMargin; | |
| } | |
| #endif | |
| } | |