[1963] | 1 | /* |
---|
| 2 | Bullet Continuous Collision Detection and Physics Library |
---|
[8284] | 3 | Copyright (c) 2003-2009 Erwin Coumans http://bulletphysics.org |
---|
[1963] | 4 | |
---|
| 5 | This software is provided 'as-is', without any express or implied warranty. |
---|
| 6 | In no event will the authors be held liable for any damages arising from the use of this software. |
---|
| 7 | Permission is granted to anyone to use this software for any purpose, |
---|
| 8 | including commercial applications, and to alter it and redistribute it freely, |
---|
| 9 | subject to the following restrictions: |
---|
| 10 | |
---|
| 11 | 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. |
---|
| 12 | 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. |
---|
| 13 | 3. This notice may not be removed or altered from any source distribution. |
---|
| 14 | */ |
---|
| 15 | |
---|
[8284] | 16 | |
---|
[1963] | 17 | #include "btMinkowskiSumShape.h" |
---|
| 18 | |
---|
| 19 | |
---|
| 20 | btMinkowskiSumShape::btMinkowskiSumShape(const btConvexShape* shapeA,const btConvexShape* shapeB) |
---|
| 21 | : btConvexInternalShape (), |
---|
| 22 | m_shapeA(shapeA), |
---|
| 23 | m_shapeB(shapeB) |
---|
| 24 | { |
---|
| 25 | m_shapeType = MINKOWSKI_DIFFERENCE_SHAPE_PROXYTYPE; |
---|
| 26 | m_transA.setIdentity(); |
---|
| 27 | m_transB.setIdentity(); |
---|
| 28 | } |
---|
| 29 | |
---|
| 30 | btVector3 btMinkowskiSumShape::localGetSupportingVertexWithoutMargin(const btVector3& vec)const |
---|
| 31 | { |
---|
[2882] | 32 | btVector3 supVertexA = m_transA(m_shapeA->localGetSupportingVertexWithoutMargin(vec*m_transA.getBasis())); |
---|
| 33 | btVector3 supVertexB = m_transB(m_shapeB->localGetSupportingVertexWithoutMargin(-vec*m_transB.getBasis())); |
---|
[1963] | 34 | return supVertexA - supVertexB; |
---|
| 35 | } |
---|
| 36 | |
---|
| 37 | void btMinkowskiSumShape::batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const |
---|
| 38 | { |
---|
[2430] | 39 | ///@todo: could make recursive use of batching. probably this shape is not used frequently. |
---|
[1963] | 40 | for (int i=0;i<numVectors;i++) |
---|
| 41 | { |
---|
| 42 | supportVerticesOut[i] = localGetSupportingVertexWithoutMargin(vectors[i]); |
---|
| 43 | } |
---|
| 44 | |
---|
| 45 | } |
---|
| 46 | |
---|
| 47 | |
---|
| 48 | |
---|
| 49 | btScalar btMinkowskiSumShape::getMargin() const |
---|
| 50 | { |
---|
| 51 | return m_shapeA->getMargin() + m_shapeB->getMargin(); |
---|
| 52 | } |
---|
| 53 | |
---|
| 54 | |
---|
| 55 | void btMinkowskiSumShape::calculateLocalInertia(btScalar mass,btVector3& inertia) const |
---|
| 56 | { |
---|
| 57 | (void)mass; |
---|
| 58 | btAssert(0); |
---|
| 59 | inertia.setValue(0,0,0); |
---|
| 60 | } |
---|