1
/*! \file btGImpactShape.h
2
\author Francisco Len N�jera
5
This source file is part of GIMPACT Library.
7
For the latest info, see http://gimpact.sourceforge.net/
9
Copyright (c) 2007 Francisco Leon Najera. C.C. 80087371.
10
email: projectileman@yahoo.com
13
This software is provided 'as-is', without any express or implied warranty.
14
In no event will the authors be held liable for any damages arising from the use of this software.
15
Permission is granted to anyone to use this software for any purpose,
16
including commercial applications, and to alter it and redistribute it freely,
17
subject to the following restrictions:
19
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.
20
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
21
3. This notice may not be removed or altered from any source distribution.
25
#ifndef TRIANGLE_SHAPE_EX_H
26
#define TRIANGLE_SHAPE_EX_H
28
#include "BulletCollision/CollisionShapes/btCollisionShape.h"
29
#include "BulletCollision/CollisionShapes/btTriangleShape.h"
30
#include "btBoxCollision.h"
31
#include "btClipPolygon.h"
32
#include "btGeometryOperations.h"
35
#define MAX_TRI_CLIPPING 16
37
//! Structure for collision
38
struct BT_TRIANGLE_CONTACT
40
btScalar m_penetration_depth;
42
btVector4 m_separating_normal;
43
btVector3 m_points[MAX_TRI_CLIPPING];
45
SIMD_FORCE_INLINE void copy_from(const BT_TRIANGLE_CONTACT& other)
47
m_penetration_depth = other.m_penetration_depth;
48
m_separating_normal = other.m_separating_normal;
49
m_point_count = other.m_point_count;
50
int i = m_point_count;
53
m_points[i] = other.m_points[i];
61
BT_TRIANGLE_CONTACT(const BT_TRIANGLE_CONTACT& other)
66
//! classify points that are closer
67
void merge_points(const btVector4 & plane,
68
btScalar margin, const btVector3 * points, int point_count);
74
class btPrimitiveTriangle
77
btVector3 m_vertices[3];
81
btPrimitiveTriangle():m_margin(0.01f)
87
SIMD_FORCE_INLINE void buildTriPlane()
89
btVector3 normal = (m_vertices[1]-m_vertices[0]).cross(m_vertices[2]-m_vertices[0]);
91
m_plane.setValue(normal[0],normal[1],normal[2],m_vertices[0].dot(normal));
94
//! Test if triangles could collide
95
bool overlap_test_conservative(const btPrimitiveTriangle& other);
97
//! Calcs the plane which is paralele to the edge and perpendicular to the triangle plane
99
\pre this triangle must have its plane calculated.
101
SIMD_FORCE_INLINE void get_edge_plane(int edge_index, btVector4 &plane) const
103
const btVector3 & e0 = m_vertices[edge_index];
104
const btVector3 & e1 = m_vertices[(edge_index+1)%3];
105
bt_edge_plane(e0,e1,m_plane,plane);
108
void applyTransform(const btTransform& t)
110
m_vertices[0] = t(m_vertices[0]);
111
m_vertices[1] = t(m_vertices[1]);
112
m_vertices[2] = t(m_vertices[2]);
115
//! Clips the triangle against this
117
\pre clipped_points must have MAX_TRI_CLIPPING size, and this triangle must have its plane calculated.
118
\return the number of clipped points
120
int clip_triangle(btPrimitiveTriangle & other, btVector3 * clipped_points );
122
//! Find collision using the clipping method
124
\pre this triangle and other must have their triangles calculated
126
bool find_triangle_collision_clip_method(btPrimitiveTriangle & other, BT_TRIANGLE_CONTACT & contacts);
131
//! Helper class for colliding Bullet Triangle Shapes
133
This class implements a better getAabb method than the previous btTriangleShape class
135
class btTriangleShapeEx: public btTriangleShape
139
btTriangleShapeEx():btTriangleShape(btVector3(0,0,0),btVector3(0,0,0),btVector3(0,0,0))
143
btTriangleShapeEx(const btVector3& p0,const btVector3& p1,const btVector3& p2): btTriangleShape(p0,p1,p2)
147
btTriangleShapeEx(const btTriangleShapeEx & other): btTriangleShape(other.m_vertices1[0],other.m_vertices1[1],other.m_vertices1[2])
151
virtual void getAabb(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax)const
153
btVector3 tv0 = t(m_vertices1[0]);
154
btVector3 tv1 = t(m_vertices1[1]);
155
btVector3 tv2 = t(m_vertices1[2]);
157
btAABB trianglebox(tv0,tv1,tv2,m_collisionMargin);
158
aabbMin = trianglebox.m_min;
159
aabbMax = trianglebox.m_max;
162
void applyTransform(const btTransform& t)
164
m_vertices1[0] = t(m_vertices1[0]);
165
m_vertices1[1] = t(m_vertices1[1]);
166
m_vertices1[2] = t(m_vertices1[2]);
169
SIMD_FORCE_INLINE void buildTriPlane(btVector4 & plane) const
171
btVector3 normal = (m_vertices1[1]-m_vertices1[0]).cross(m_vertices1[2]-m_vertices1[0]);
173
plane.setValue(normal[0],normal[1],normal[2],m_vertices1[0].dot(normal));
176
bool overlap_test_conservative(const btTriangleShapeEx& other);
180
#endif //TRIANGLE_MESH_SHAPE_H