[1963] | 1 | /* |
---|
| 2 | Bullet Continuous Collision Detection and Physics Library |
---|
[8351] | 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 | |
---|
[8393] | 16 | #ifndef BT_POLYHEDRAL_CONVEX_SHAPE_H |
---|
| 17 | #define BT_POLYHEDRAL_CONVEX_SHAPE_H |
---|
[1963] | 18 | |
---|
| 19 | #include "LinearMath/btMatrix3x3.h" |
---|
| 20 | #include "btConvexInternalShape.h" |
---|
[8393] | 21 | class btConvexPolyhedron; |
---|
[1963] | 22 | |
---|
| 23 | |
---|
| 24 | ///The btPolyhedralConvexShape is an internal interface class for polyhedral convex shapes. |
---|
| 25 | class btPolyhedralConvexShape : public btConvexInternalShape |
---|
| 26 | { |
---|
[8393] | 27 | |
---|
[1963] | 28 | |
---|
| 29 | protected: |
---|
[8351] | 30 | |
---|
[8393] | 31 | btConvexPolyhedron* m_polyhedron; |
---|
| 32 | |
---|
[1963] | 33 | public: |
---|
| 34 | |
---|
[2430] | 35 | btPolyhedralConvexShape(); |
---|
[1963] | 36 | |
---|
[8393] | 37 | virtual ~btPolyhedralConvexShape(); |
---|
| 38 | |
---|
| 39 | ///optional method mainly used to generate multiple contact points by clipping polyhedral features (faces/edges) |
---|
| 40 | virtual bool initializePolyhedralFeatures(); |
---|
| 41 | |
---|
| 42 | const btConvexPolyhedron* getConvexPolyhedron() const |
---|
| 43 | { |
---|
| 44 | return m_polyhedron; |
---|
| 45 | } |
---|
| 46 | |
---|
[1963] | 47 | //brute force implementations |
---|
[2430] | 48 | |
---|
[1963] | 49 | virtual btVector3 localGetSupportingVertexWithoutMargin(const btVector3& vec)const; |
---|
| 50 | virtual void batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const; |
---|
| 51 | |
---|
| 52 | virtual void calculateLocalInertia(btScalar mass,btVector3& inertia) const; |
---|
[8351] | 53 | |
---|
| 54 | |
---|
| 55 | virtual int getNumVertices() const = 0 ; |
---|
| 56 | virtual int getNumEdges() const = 0; |
---|
| 57 | virtual void getEdge(int i,btVector3& pa,btVector3& pb) const = 0; |
---|
| 58 | virtual void getVertex(int i,btVector3& vtx) const = 0; |
---|
| 59 | virtual int getNumPlanes() const = 0; |
---|
| 60 | virtual void getPlane(btVector3& planeNormal,btVector3& planeSupport,int i ) const = 0; |
---|
| 61 | // virtual int getIndex(int i) const = 0 ; |
---|
[1963] | 62 | |
---|
[8351] | 63 | virtual bool isInside(const btVector3& pt,btScalar tolerance) const = 0; |
---|
| 64 | |
---|
| 65 | }; |
---|
[1963] | 66 | |
---|
[8351] | 67 | |
---|
| 68 | ///The btPolyhedralConvexAabbCachingShape adds aabb caching to the btPolyhedralConvexShape |
---|
| 69 | class btPolyhedralConvexAabbCachingShape : public btPolyhedralConvexShape |
---|
| 70 | { |
---|
| 71 | |
---|
| 72 | btVector3 m_localAabbMin; |
---|
| 73 | btVector3 m_localAabbMax; |
---|
| 74 | bool m_isLocalAabbValid; |
---|
| 75 | |
---|
| 76 | protected: |
---|
| 77 | |
---|
[2430] | 78 | void setCachedLocalAabb (const btVector3& aabbMin, const btVector3& aabbMax) |
---|
| 79 | { |
---|
| 80 | m_isLocalAabbValid = true; |
---|
| 81 | m_localAabbMin = aabbMin; |
---|
| 82 | m_localAabbMax = aabbMax; |
---|
| 83 | } |
---|
| 84 | |
---|
| 85 | inline void getCachedLocalAabb (btVector3& aabbMin, btVector3& aabbMax) const |
---|
| 86 | { |
---|
| 87 | btAssert(m_isLocalAabbValid); |
---|
| 88 | aabbMin = m_localAabbMin; |
---|
| 89 | aabbMax = m_localAabbMax; |
---|
| 90 | } |
---|
| 91 | |
---|
[8351] | 92 | public: |
---|
| 93 | |
---|
| 94 | btPolyhedralConvexAabbCachingShape(); |
---|
| 95 | |
---|
[1963] | 96 | inline void getNonvirtualAabb(const btTransform& trans,btVector3& aabbMin,btVector3& aabbMax, btScalar margin) const |
---|
| 97 | { |
---|
| 98 | |
---|
| 99 | //lazy evaluation of local aabb |
---|
| 100 | btAssert(m_isLocalAabbValid); |
---|
| 101 | btTransformAabb(m_localAabbMin,m_localAabbMax,margin,trans,aabbMin,aabbMax); |
---|
| 102 | } |
---|
| 103 | |
---|
[8351] | 104 | virtual void setLocalScaling(const btVector3& scaling); |
---|
| 105 | |
---|
[1963] | 106 | virtual void getAabb(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax) const; |
---|
| 107 | |
---|
| 108 | void recalcLocalAabb(); |
---|
| 109 | |
---|
| 110 | }; |
---|
| 111 | |
---|
[8393] | 112 | #endif //BT_POLYHEDRAL_CONVEX_SHAPE_H |
---|