Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/trunk/src/external/bullet/BulletCollision/CollisionShapes/btConvexHullShape.h @ 10204

Last change on this file since 10204 was 8393, checked in by rgrieder, 14 years ago

Updated Bullet from v2.77 to v2.78.
(I'm not going to make a branch for that since the update from 2.74 to 2.77 hasn't been tested that much either).

You will HAVE to do a complete RECOMPILE! I tested with MSVC and MinGW and they both threw linker errors at me.

  • Property svn:eol-style set to native
File size: 4.0 KB
RevLine 
[1963]1/*
2Bullet Continuous Collision Detection and Physics Library
[8351]3Copyright (c) 2003-2009 Erwin Coumans  http://bulletphysics.org
[1963]4
5This software is provided 'as-is', without any express or implied warranty.
6In no event will the authors be held liable for any damages arising from the use of this software.
7Permission is granted to anyone to use this software for any purpose,
8including commercial applications, and to alter it and redistribute it freely,
9subject to the following restrictions:
10
111. 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.
122. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
133. This notice may not be removed or altered from any source distribution.
14*/
15
[8393]16#ifndef BT_CONVEX_HULL_SHAPE_H
17#define BT_CONVEX_HULL_SHAPE_H
[1963]18
19#include "btPolyhedralConvexShape.h"
20#include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h" // for the types
21#include "LinearMath/btAlignedObjectArray.h"
22
[8351]23
[1963]24///The btConvexHullShape implements an implicit convex hull of an array of vertices.
25///Bullet provides a general and fast collision detector for convex shapes based on GJK and EPA using localGetSupportingVertex.
[8351]26ATTRIBUTE_ALIGNED16(class) btConvexHullShape : public btPolyhedralConvexAabbCachingShape
[1963]27{
[2430]28        btAlignedObjectArray<btVector3> m_unscaledPoints;
[1963]29
30public:
31        BT_DECLARE_ALIGNED_ALLOCATOR();
32
33       
34        ///this constructor optionally takes in a pointer to points. Each point is assumed to be 3 consecutive btScalar (x,y,z), the striding defines the number of bytes between each point, in memory.
35        ///It is easier to not pass any points in the constructor, and just add one point at a time, using addPoint.
36        ///btConvexHullShape make an internal copy of the points.
[2430]37        btConvexHullShape(const btScalar* points=0,int numPoints=0, int stride=sizeof(btVector3));
[1963]38
[2430]39        void addPoint(const btVector3& point);
[1963]40
[2430]41       
42        btVector3* getUnscaledPoints()
[1963]43        {
[2430]44                return &m_unscaledPoints[0];
[1963]45        }
46
[2430]47        const btVector3* getUnscaledPoints() const
[1963]48        {
[2430]49                return &m_unscaledPoints[0];
[1963]50        }
51
[2430]52        ///getPoints is obsolete, please use getUnscaledPoints
53        const btVector3* getPoints() const
[1963]54        {
[2430]55                return getUnscaledPoints();
[1963]56        }
57
[2430]58       
59
60
61        SIMD_FORCE_INLINE       btVector3 getScaledPoint(int i) const
62        {
63                return m_unscaledPoints[i] * m_localScaling;
64        }
65
66        SIMD_FORCE_INLINE       int getNumPoints() const 
67        {
68                return m_unscaledPoints.size();
69        }
70
[1963]71        virtual btVector3       localGetSupportingVertex(const btVector3& vec)const;
72        virtual btVector3       localGetSupportingVertexWithoutMargin(const btVector3& vec)const;
73        virtual void    batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const;
74       
75
76
77        //debugging
78        virtual const char*     getName()const {return "Convex";}
79
80       
81        virtual int     getNumVertices() const;
82        virtual int getNumEdges() const;
[2430]83        virtual void getEdge(int i,btVector3& pa,btVector3& pb) const;
84        virtual void getVertex(int i,btVector3& vtx) const;
[1963]85        virtual int     getNumPlanes() const;
[2430]86        virtual void getPlane(btVector3& planeNormal,btVector3& planeSupport,int i ) const;
87        virtual bool isInside(const btVector3& pt,btScalar tolerance) const;
[1963]88
89        ///in case we receive negative scaling
90        virtual void    setLocalScaling(const btVector3& scaling);
91
[8351]92        virtual int     calculateSerializeBufferSize() const;
93
94        ///fills the dataBuffer and returns the struct name (and 0 on failure)
95        virtual const char*     serialize(void* dataBuffer, btSerializer* serializer) const;
96
[1963]97};
98
[8351]99///do not change those serialization structures, it requires an updated sBulletDNAstr/sBulletDNAstr64
100struct  btConvexHullShapeData
101{
102        btConvexInternalShapeData       m_convexInternalShapeData;
[1963]103
[8351]104        btVector3FloatData      *m_unscaledPointsFloatPtr;
105        btVector3DoubleData     *m_unscaledPointsDoublePtr;
106
107        int             m_numUnscaledPoints;
108        char m_padding3[4];
109
110};
111
112
113SIMD_FORCE_INLINE       int     btConvexHullShape::calculateSerializeBufferSize() const
114{
115        return sizeof(btConvexHullShapeData);
116}
117
118
[8393]119#endif //BT_CONVEX_HULL_SHAPE_H
[1963]120
Note: See TracBrowser for help on using the repository browser.