x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
btBoxShape.h - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\DarkPuzzle\libs\bullet_sdk\src\BulletCollision\CollisionShapes\btBoxShape.h
旋转
特效
属性
历史版本
/* Bullet Continuous Collision Detection and Physics Library Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/ 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. */ #ifndef OBB_BOX_MINKOWSKI_H #define OBB_BOX_MINKOWSKI_H #include "btPolyhedralConvexShape.h" #include "btCollisionMargin.h" #include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h" #include "LinearMath/btPoint3.h" #include "LinearMath/btMinMax.h" ///btBoxShape implements both a feature based (vertex/edge/plane) and implicit (getSupportingVertex) Box class btBoxShape: public btPolyhedralConvexShape { //btVector3 m_boxHalfExtents1; //use m_implicitShapeDimensions instead public: btVector3 getHalfExtentsWithMargin() const { btVector3 halfExtents = getHalfExtentsWithoutMargin(); btVector3 margin(getMargin(),getMargin(),getMargin()); halfExtents += margin; return halfExtents; } const btVector3& getHalfExtentsWithoutMargin() const { return m_implicitShapeDimensions;//changed in Bullet 2.63: assume the scaling and margin are included } virtual int getShapeType() const { return BOX_SHAPE_PROXYTYPE;} virtual btVector3 localGetSupportingVertex(const btVector3& vec) const { btVector3 halfExtents = getHalfExtentsWithoutMargin(); btVector3 margin(getMargin(),getMargin(),getMargin()); halfExtents += margin; return btVector3(btFsels(vec.x(), halfExtents.x(), -halfExtents.x()), btFsels(vec.y(), halfExtents.y(), -halfExtents.y()), btFsels(vec.z(), halfExtents.z(), -halfExtents.z())); } SIMD_FORCE_INLINE btVector3 localGetSupportingVertexWithoutMargin(const btVector3& vec)const { const btVector3& halfExtents = getHalfExtentsWithoutMargin(); return btVector3(btFsels(vec.x(), halfExtents.x(), -halfExtents.x()), btFsels(vec.y(), halfExtents.y(), -halfExtents.y()), btFsels(vec.z(), halfExtents.z(), -halfExtents.z())); } virtual void batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const { const btVector3& halfExtents = getHalfExtentsWithoutMargin(); for (int i=0;i
>1)) - halfExtents.y() * ((i&2)>>1), halfExtents.z() * (1-((i&4)>>2)) - halfExtents.z() * ((i&4)>>2)); } virtual void getPlaneEquation(btVector4& plane,int i) const { btVector3 halfExtents = getHalfExtentsWithoutMargin(); switch (i) { case 0: plane.setValue(btScalar(1.),btScalar(0.),btScalar(0.)); plane[3] = -halfExtents.x(); break; case 1: plane.setValue(btScalar(-1.),btScalar(0.),btScalar(0.)); plane[3] = -halfExtents.x(); break; case 2: plane.setValue(btScalar(0.),btScalar(1.),btScalar(0.)); plane[3] = -halfExtents.y(); break; case 3: plane.setValue(btScalar(0.),btScalar(-1.),btScalar(0.)); plane[3] = -halfExtents.y(); break; case 4: plane.setValue(btScalar(0.),btScalar(0.),btScalar(1.)); plane[3] = -halfExtents.z(); break; case 5: plane.setValue(btScalar(0.),btScalar(0.),btScalar(-1.)); plane[3] = -halfExtents.z(); break; default: assert(0); } } virtual void getEdge(int i,btPoint3& pa,btPoint3& pb) const //virtual void getEdge(int i,Edge& edge) const { int edgeVert0 = 0; int edgeVert1 = 0; switch (i) { case 0: edgeVert0 = 0; edgeVert1 = 1; break; case 1: edgeVert0 = 0; edgeVert1 = 2; break; case 2: edgeVert0 = 1; edgeVert1 = 3; break; case 3: edgeVert0 = 2; edgeVert1 = 3; break; case 4: edgeVert0 = 0; edgeVert1 = 4; break; case 5: edgeVert0 = 1; edgeVert1 = 5; break; case 6: edgeVert0 = 2; edgeVert1 = 6; break; case 7: edgeVert0 = 3; edgeVert1 = 7; break; case 8: edgeVert0 = 4; edgeVert1 = 5; break; case 9: edgeVert0 = 4; edgeVert1 = 6; break; case 10: edgeVert0 = 5; edgeVert1 = 7; break; case 11: edgeVert0 = 6; edgeVert1 = 7; break; default: btAssert(0); } getVertex(edgeVert0,pa ); getVertex(edgeVert1,pb ); } virtual bool isInside(const btPoint3& pt,btScalar tolerance) const { btVector3 halfExtents = getHalfExtentsWithoutMargin(); //btScalar minDist = 2*tolerance; bool result = (pt.x() <= (halfExtents.x()+tolerance)) && (pt.x() >= (-halfExtents.x()-tolerance)) && (pt.y() <= (halfExtents.y()+tolerance)) && (pt.y() >= (-halfExtents.y()-tolerance)) && (pt.z() <= (halfExtents.z()+tolerance)) && (pt.z() >= (-halfExtents.z()-tolerance)); return result; } //debugging virtual const char* getName()const { return "Box"; } virtual int getNumPreferredPenetrationDirections() const { return 6; } virtual void getPreferredPenetrationDirection(int index, btVector3& penetrationVector) const { switch (index) { case 0: penetrationVector.setValue(btScalar(1.),btScalar(0.),btScalar(0.)); break; case 1: penetrationVector.setValue(btScalar(-1.),btScalar(0.),btScalar(0.)); break; case 2: penetrationVector.setValue(btScalar(0.),btScalar(1.),btScalar(0.)); break; case 3: penetrationVector.setValue(btScalar(0.),btScalar(-1.),btScalar(0.)); break; case 4: penetrationVector.setValue(btScalar(0.),btScalar(0.),btScalar(1.)); break; case 5: penetrationVector.setValue(btScalar(0.),btScalar(0.),btScalar(-1.)); break; default: assert(0); } } }; #endif //OBB_BOX_MINKOWSKI_H
btBoxShape.h
网页地址
文件地址
上一页
2/58
下一页
下载
( 8 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.