Bullet Collision Detection & Physics Library
btSoftBodyConcaveCollisionAlgorithm.cpp
Go to the documentation of this file.
1/*
2Bullet Continuous Collision Detection and Physics Library
3Copyright (c) 2003-2006 Erwin Coumans https://bulletphysics.org
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
28
32
33#define BT_SOFTBODY_TRIANGLE_EXTRUSION btScalar(0.06) //make this configurable
34
37 m_isSwapped(isSwapped),
38 m_btSoftBodyTriangleCallback(ci.m_dispatcher1, body0Wrap, body1Wrap, isSwapped)
39{
40}
41
43{
44}
45
47 m_dispatchInfoPtr(0)
48{
50 m_triBody = isSwapped ? body0Wrap->getCollisionObject() : body1Wrap->getCollisionObject();
51
52 //
53 // create the manifold from the dispatcher 'manifold pool'
54 //
55 // m_manifoldPtr = m_dispatcher->getNewManifold(m_convexBody,m_triBody);
56
57 clearCache();
58}
59
61{
62 clearCache();
63 // m_dispatcher->releaseManifold( m_manifoldPtr );
64}
65
67{
68 for (int i = 0; i < m_shapeCache.size(); i++)
69 {
72 btAssert(tmp->m_childShape);
73 m_softBody->getWorldInfo()->m_sparsesdf.RemoveReferences(tmp->m_childShape); //necessary?
74 delete tmp->m_childShape;
75 }
77}
78
80{
81 //just for debugging purposes
82 //printf("triangle %d",m_triangleCount++);
83
86
89 {
90 btVector3 color(1, 1, 0);
95 }
96
99
101 if (shapeIndex)
102 {
103 btCollisionShape* tm = shapeIndex->m_childShape;
104 btAssert(tm);
105
106 //copy over user pointers to temporary shape
107 tm->setUserPointer(m_triBody->getCollisionShape()->getUserPointer());
108
110 //btCollisionObjectWrapper triBody(0,tm, ob, btTransform::getIdentity());//ob->getWorldTransform());//??
113 btCollisionAlgorithm* colAlgo = ci.m_dispatcher1->findAlgorithm(&softBody, &triBody, 0, algoType); //m_manifoldPtr);
114
116 colAlgo->~btCollisionAlgorithm();
117 ci.m_dispatcher1->freeCollisionAlgorithm(colAlgo);
118
119 return;
120 }
121
122 //aabb filter is already applied!
123
124 //btCollisionObject* colObj = static_cast<btCollisionObject*>(m_convexProxy->m_clientObject);
125
126 // if (m_softBody->getCollisionShape()->getShapeType()==
127 {
128 // btVector3 other;
129 btVector3 normal = (triangle[1] - triangle[0]).cross(triangle[2] - triangle[0]);
130 normal.normalize();
132 // other=(triangle[0]+triangle[1]+triangle[2])*0.333333f;
133 // other+=normal*22.f;
134 btVector3 pts[6] = {triangle[0] + normal,
135 triangle[1] + normal,
136 triangle[2] + normal,
137 triangle[0] - normal,
138 triangle[1] - normal,
139 triangle[2] - normal};
140
141 btConvexHullShape* tm = new btConvexHullShape(&pts[0].getX(), 6);
142
143 // btBU_Simplex1to4 tm(triangle[0],triangle[1],triangle[2],other);
144
145 //btTriangleShape tm(triangle[0],triangle[1],triangle[2]);
146 // tm.setMargin(m_collisionMarginTriangle);
147
148 //copy over user pointers to temporary shape
149 tm->setUserPointer(m_triBody->getCollisionShape()->getUserPointer());
150
152 btCollisionObjectWrapper triBody(0, tm, m_triBody, m_triBody->getWorldTransform(), partId, triangleIndex); //btTransform::getIdentity());//??
153
155 btCollisionAlgorithm* colAlgo = ci.m_dispatcher1->findAlgorithm(&softBody, &triBody, 0, algoType); //m_manifoldPtr);
156
158 colAlgo->~btCollisionAlgorithm();
159 ci.m_dispatcher1->freeCollisionAlgorithm(colAlgo);
160
161 triIndex.m_childShape = tm;
163 }
164}
165
167{
171
176
179 softTransform.setOrigin(softBodyCenter);
180
182 convexInTriangleSpace = triBodyWrap->getWorldTransform().inverse() * softTransform;
184}
185
187{
189}
190
192{
193 //btCollisionObject* convexBody = m_isSwapped ? body1 : body0;
194 const btCollisionObjectWrapper* triBody = m_isSwapped ? body0Wrap : body1Wrap;
195
196 if (triBody->getCollisionShape()->isConcave())
197 {
198 const btConcaveShape* concaveShape = static_cast<const btConcaveShape*>(triBody->getCollisionShape());
199
200 // if (convexBody->getCollisionShape()->isConvex())
201 {
203
204 // resultOut->setPersistentManifold(m_btSoftBodyTriangleCallback.m_manifoldPtr);
206
208
209 // resultOut->refreshContactPoints();
210 }
211 }
212}
213
215{
220
221 //quick approximation using raycast, todo: hook up to the continuous collision detection (one of the btConvexCast)
222
223 //only perform CCD above a certain threshold, this prevents blocking on the long run
224 //because object in a blocked ccd state (hitfraction<1) get their linear velocity halved each frame...
225 btScalar squareMot0 = (convexbody->getInterpolationWorldTransform().getOrigin() - convexbody->getWorldTransform().getOrigin()).length2();
226 if (squareMot0 < convexbody->getCcdSquareMotionThreshold())
227 {
228 return btScalar(1.);
229 }
230
231 //const btVector3& from = convexbody->m_worldTransform.getOrigin();
232 //btVector3 to = convexbody->m_interpolationWorldTransform.getOrigin();
233 //todo: only do if the motion exceeds the 'radius'
234
235 btTransform triInv = triBody->getWorldTransform().inverse();
236 btTransform convexFromLocal = triInv * convexbody->getWorldTransform();
237 btTransform convexToLocal = triInv * convexbody->getInterpolationWorldTransform();
238
240 {
244
246 btScalar m_hitFraction;
247
252 m_hitFraction(hitFraction)
253 {
254 }
255
256 virtual void processTriangle(btVector3* triangle, int partId, int triangleIndex)
257 {
258 (void)partId;
260 //do a swept sphere for now
264 castResult.m_fraction = m_hitFraction;
269 //GjkConvexCast convexCaster(&pointShape,convexShape,&simplexSolver);
270 //ContinuousConvexCollision convexCaster(&pointShape,convexShape,&simplexSolver,0);
271 //local space?
272
275 {
276 if (m_hitFraction > castResult.m_fraction)
277 m_hitFraction = castResult.m_fraction;
278 }
279 }
280 };
281
282 if (triBody->getCollisionShape()->isConcave())
283 {
285 rayAabbMin.setMin(convexToLocal.getOrigin());
287 rayAabbMax.setMax(convexToLocal.getOrigin());
288 btScalar ccdRadius0 = convexbody->getCcdSweptSphereRadius();
291
292 btScalar curHitFraction = btScalar(1.); //is this available?
294 convexbody->getCcdSweptSphereRadius(), curHitFraction);
295
296 raycastCallback.m_hitFraction = convexbody->getHitFraction();
297
299
300 btConcaveShape* triangleMesh = (btConcaveShape*)concavebody->getCollisionShape();
301
302 if (triangleMesh)
303 {
305 }
306
307 if (raycastCallback.m_hitFraction < convexbody->getHitFraction())
308 {
309 convexbody->setHitFraction(raycastCallback.m_hitFraction);
310 return raycastCallback.m_hitFraction;
311 }
312 }
313
314 return btScalar(1.);
315}
void btTransformAabb(const btVector3 &halfExtents, btScalar margin, const btTransform &t, btVector3 &aabbMinOut, btVector3 &aabbMaxOut)
ebtDispatcherQueryType
@ BT_CLOSEST_POINT_ALGORITHMS
@ BT_CONTACT_POINT_ALGORITHMS
const T & btMax(const T &a, const T &b)
Definition btMinMax.h:27
float btScalar
The btScalar type abstracts floating point numbers, to easily switch between double and single floati...
Definition btScalar.h:314
#define btAssert(x)
Definition btScalar.h:153
#define BT_SOFTBODY_TRIANGLE_EXTRUSION
btCollisionAlgorithm is an collision interface that is compatible with the Broadphase and btDispatche...
virtual void processCollision(const btCollisionObjectWrapper *body0Wrap, const btCollisionObjectWrapper *body1Wrap, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut)=0
btCollisionObject can be used to manage collision detection objects.
btTransform & getWorldTransform()
const btCollisionShape * getCollisionShape() const
The btCollisionShape class provides an interface for collision shapes that can be shared among btColl...
void * getUserPointer() const
The btConcaveShape class provides an interface for non-moving (static) concave shapes.
virtual btScalar getMargin() const
virtual void processAllTriangles(btTriangleCallback *callback, const btVector3 &aabbMin, const btVector3 &aabbMax) const =0
The btConvexHullShape implements an implicit convex hull of an array of vertices.
The btDispatcher interface class can be used in combination with broadphase to dispatch calculations ...
void insert(const Key &key, const Value &value)
Definition btHashMap.h:264
void clear()
Definition btHashMap.h:461
int size() const
Definition btHashMap.h:373
const Value * getAtIndex(int index) const
Definition btHashMap.h:378
virtual void drawLine(const btVector3 &from, const btVector3 &to, const btVector3 &color)=0
virtual int getDebugMode() const =0
btManifoldResult is a helper class to manage contact results.
btScalar m_closestPointDistanceThreshold
virtual void processCollision(const btCollisionObjectWrapper *body0Wrap, const btCollisionObjectWrapper *body1Wrap, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut)
btSoftBodyConcaveCollisionAlgorithm(const btCollisionAlgorithmConstructionInfo &ci, const btCollisionObjectWrapper *body0Wrap, const btCollisionObjectWrapper *body1Wrap, bool isSwapped)
btScalar calculateTimeOfImpact(btCollisionObject *body0, btCollisionObject *body1, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut)
virtual void processTriangle(btVector3 *triangle, int partId, int triangleIndex)
btSoftBodyTriangleCallback(btDispatcher *dispatcher, const btCollisionObjectWrapper *body0Wrap, const btCollisionObjectWrapper *body1Wrap, bool isSwapped)
btHashMap< btHashKey< btTriIndex >, btTriIndex > m_shapeCache
void setTimeStepAndCounters(btScalar collisionMarginTriangle, const btCollisionObjectWrapper *triObjWrap, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut)
The btSoftBody is an class to simulate cloth and volumetric soft bodies.
Definition btSoftBody.h:75
btSoftBodyWorldInfo * getWorldInfo()
Definition btSoftBody.h:881
virtual void getAabb(btVector3 &aabbMin, btVector3 &aabbMax) const
The btSphereShape implements an implicit sphere, centered around a local origin with radius.
btSubsimplexConvexCast implements Gino van den Bergens' paper "Ray Casting against bteral Convex Obje...
The btTransform class supports rigid transforms with only translation and rotation and no scaling/she...
Definition btTransform.h:30
btTransform inverse() const
Return the inverse of this transform.
void setIdentity()
Set this transformation to the identity.
The btTriangleCallback provides a callback for each overlapping triangle when calling processAllTrian...
btVector3 can be used to represent 3D points and vectors.
Definition btVector3.h:82
void setMax(const btVector3 &other)
Set each element to the max of the current values and the values of another btVector3.
Definition btVector3.h:609
void setMin(const btVector3 &other)
Set each element to the min of the current values and the values of another btVector3.
Definition btVector3.h:626
btVector3 & normalize()
Normalize this vector x^2 + y^2 + z^2 = 1.
Definition btVector3.h:303
btVoronoiSimplexSolver is an implementation of the closest point distance algorithm from a 1-4 points...
const btCollisionObject * getCollisionObject() const
RayResult stores the closest result alternatively, add a callback method to decide about closest/all ...
class btIDebugDraw * m_debugDraw
btSparseSdf< 3 > m_sparsesdf
Definition btSoftBody.h:57
int RemoveReferences(btCollisionShape *pcs)