1
#ifndef BT_BASIC_GEOMETRY_OPERATIONS_H_INCLUDED
2
#define BT_BASIC_GEOMETRY_OPERATIONS_H_INCLUDED
4
/*! \file btGeometryOperations.h
5
*\author Francisco Len N�jera
9
This source file is part of GIMPACT Library.
11
For the latest info, see http://gimpact.sourceforge.net/
13
Copyright (c) 2007 Francisco Leon Najera. C.C. 80087371.
14
email: projectileman@yahoo.com
17
This software is provided 'as-is', without any express or implied warranty.
18
In no event will the authors be held liable for any damages arising from the use of this software.
19
Permission is granted to anyone to use this software for any purpose,
20
including commercial applications, and to alter it and redistribute it freely,
21
subject to the following restrictions:
23
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.
24
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
25
3. This notice may not be removed or altered from any source distribution.
28
#include "btBoxCollision.h"
32
/*! \defgroup GEOMETRIC_OPERATIONS
37
#define PLANEDIREPSILON 0.0000001f
38
#define PARALELENORMALS 0.000001f
41
#define BT_CLAMP(number,minval,maxval) (number<minval?minval:(number>maxval?maxval:number))
43
/// Calc a plane from a triangle edge an a normal. plane is a vec4f
44
SIMD_FORCE_INLINE void bt_edge_plane(const btVector3 & e1,const btVector3 & e2, const btVector3 & normal,btVector4 & plane)
46
btVector3 planenormal = (e2-e1).cross(normal);
47
planenormal.normalize();
48
plane.setValue(planenormal[0],planenormal[1],planenormal[2],e2.dot(planenormal));
53
//***************** SEGMENT and LINE FUNCTIONS **********************************///
55
/*! Finds the closest point(cp) to (v) on a segment (e1,e2)
57
SIMD_FORCE_INLINE void bt_closest_point_on_segment(
58
btVector3 & cp, const btVector3 & v,
59
const btVector3 &e1,const btVector3 &e2)
63
btScalar _scalar = cp.dot(n)/n.dot(n);
68
else if(_scalar >1.0f)
79
//! line plane collision
82
-0 if the ray never intersects
83
-1 if the ray collides in front
84
-2 if the ray collides in back
87
SIMD_FORCE_INLINE int bt_line_plane_collision(
88
const btVector4 & plane,
89
const btVector3 & vDir,
90
const btVector3 & vPoint,
93
btScalar tmin, btScalar tmax)
96
btScalar _dotdir = vDir.dot(plane);
98
if(btFabs(_dotdir)<PLANEDIREPSILON)
104
btScalar _dis = bt_distance_point_plane(plane,vPoint);
105
char returnvalue = _dis<0.0f? 2:1;
106
tparam = -_dis/_dotdir;
118
pout = tparam*vDir + vPoint;
123
//! Find closest points on segments
124
SIMD_FORCE_INLINE void bt_segment_collision(
125
const btVector3 & vA1,
126
const btVector3 & vA2,
127
const btVector3 & vB1,
128
const btVector3 & vB2,
132
btVector3 AD = vA2 - vA1;
133
btVector3 BD = vB2 - vB1;
134
btVector3 N = AD.cross(BD);
135
btScalar tp = N.length2();
139
if(tp<SIMD_EPSILON)//ARE PARALELE
142
bool invert_b_order = false;
148
invert_b_order = true;
149
BT_SWAP_NUMBERS(_M[0],_M[1]);
154
N[0] = (_M[0]+_M[1])*0.5f;
155
N[1] = (_M[2]+_M[3])*0.5f;
161
vPointB = invert_b_order?vB1:vB2;
166
vPointB = invert_b_order?vB1:vB2;
167
bt_closest_point_on_segment(vPointA,vPointB,vA1,vA2);
172
bt_closest_point_on_segment(vPointB,vPointA,vB1,vB2);
179
vPointB = invert_b_order?vB2:vB1;
185
bt_closest_point_on_segment(vPointB,vPointA,vB1,vB2);
189
vPointB = invert_b_order?vB1:vB2;
190
bt_closest_point_on_segment(vPointA,vPointB,vA1,vA2);
197
_M.setValue(N[0],N[1],N[2],vB1.dot(N));
199
// get point A as the plane collision point
200
bt_line_plane_collision(_M,AD,vA1,vPointA,tp,btScalar(0), btScalar(1));
202
/*Closest point on segment*/
203
vPointB = vPointA - vB1;
204
tp = vPointB.dot(BD);
206
tp = BT_CLAMP(tp,0.0f,1.0f);
208
vPointB = tp*BD + vB1;
216
#endif // GIM_VECTOR_H_INCLUDED
1
#ifndef BT_BASIC_GEOMETRY_OPERATIONS_H_INCLUDED
2
#define BT_BASIC_GEOMETRY_OPERATIONS_H_INCLUDED
4
/*! \file btGeometryOperations.h
5
*\author Francisco Len N�jera
9
This source file is part of GIMPACT Library.
11
For the latest info, see http://gimpact.sourceforge.net/
13
Copyright (c) 2007 Francisco Leon Najera. C.C. 80087371.
14
email: projectileman@yahoo.com
17
This software is provided 'as-is', without any express or implied warranty.
18
In no event will the authors be held liable for any damages arising from the use of this software.
19
Permission is granted to anyone to use this software for any purpose,
20
including commercial applications, and to alter it and redistribute it freely,
21
subject to the following restrictions:
23
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.
24
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
25
3. This notice may not be removed or altered from any source distribution.
28
#include "btBoxCollision.h"
34
#define PLANEDIREPSILON 0.0000001f
35
#define PARALELENORMALS 0.000001f
38
#define BT_CLAMP(number,minval,maxval) (number<minval?minval:(number>maxval?maxval:number))
40
/// Calc a plane from a triangle edge an a normal. plane is a vec4f
41
SIMD_FORCE_INLINE void bt_edge_plane(const btVector3 & e1,const btVector3 & e2, const btVector3 & normal,btVector4 & plane)
43
btVector3 planenormal = (e2-e1).cross(normal);
44
planenormal.normalize();
45
plane.setValue(planenormal[0],planenormal[1],planenormal[2],e2.dot(planenormal));
50
//***************** SEGMENT and LINE FUNCTIONS **********************************///
52
/*! Finds the closest point(cp) to (v) on a segment (e1,e2)
54
SIMD_FORCE_INLINE void bt_closest_point_on_segment(
55
btVector3 & cp, const btVector3 & v,
56
const btVector3 &e1,const btVector3 &e2)
60
btScalar _scalar = cp.dot(n)/n.dot(n);
65
else if(_scalar >1.0f)
76
//! line plane collision
79
-0 if the ray never intersects
80
-1 if the ray collides in front
81
-2 if the ray collides in back
84
SIMD_FORCE_INLINE int bt_line_plane_collision(
85
const btVector4 & plane,
86
const btVector3 & vDir,
87
const btVector3 & vPoint,
90
btScalar tmin, btScalar tmax)
93
btScalar _dotdir = vDir.dot(plane);
95
if(btFabs(_dotdir)<PLANEDIREPSILON)
101
btScalar _dis = bt_distance_point_plane(plane,vPoint);
102
char returnvalue = _dis<0.0f? 2:1;
103
tparam = -_dis/_dotdir;
115
pout = tparam*vDir + vPoint;
120
//! Find closest points on segments
121
SIMD_FORCE_INLINE void bt_segment_collision(
122
const btVector3 & vA1,
123
const btVector3 & vA2,
124
const btVector3 & vB1,
125
const btVector3 & vB2,
129
btVector3 AD = vA2 - vA1;
130
btVector3 BD = vB2 - vB1;
131
btVector3 N = AD.cross(BD);
132
btScalar tp = N.length2();
136
if(tp<SIMD_EPSILON)//ARE PARALELE
139
bool invert_b_order = false;
145
invert_b_order = true;
146
BT_SWAP_NUMBERS(_M[0],_M[1]);
151
N[0] = (_M[0]+_M[1])*0.5f;
152
N[1] = (_M[2]+_M[3])*0.5f;
158
vPointB = invert_b_order?vB1:vB2;
163
vPointB = invert_b_order?vB1:vB2;
164
bt_closest_point_on_segment(vPointA,vPointB,vA1,vA2);
169
bt_closest_point_on_segment(vPointB,vPointA,vB1,vB2);
176
vPointB = invert_b_order?vB2:vB1;
182
bt_closest_point_on_segment(vPointB,vPointA,vB1,vB2);
186
vPointB = invert_b_order?vB1:vB2;
187
bt_closest_point_on_segment(vPointA,vPointB,vA1,vA2);
194
_M.setValue(N[0],N[1],N[2],vB1.dot(N));
196
// get point A as the plane collision point
197
bt_line_plane_collision(_M,AD,vA1,vPointA,tp,btScalar(0), btScalar(1));
199
/*Closest point on segment*/
200
vPointB = vPointA - vB1;
201
tp = vPointB.dot(BD);
203
tp = BT_CLAMP(tp,0.0f,1.0f);
205
vPointB = tp*BD + vB1;
212
#endif // GIM_VECTOR_H_INCLUDED