2 Copyright (C) 1999-2006 Id Software, Inc. and contributors.
3 For a list of contributors, see the accompanying CONTRIBUTORS file.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
30 // start declarations of functions defined in C library.
39 typedef vec_t vec3_t[3];
40 typedef vec_t vec5_t[5];
41 typedef vec_t vec4_t[4];
48 // plane types are used to speed some tests
49 // 0-2 are axial planes
53 #define PLANE_NON_AXIAL 3
55 #define Q_PI 3.14159265358979323846f
57 extern const vec3_t vec3_origin;
59 extern const vec3_t g_vec3_axis_x;
60 extern const vec3_t g_vec3_axis_y;
61 extern const vec3_t g_vec3_axis_z;
63 #define EQUAL_EPSILON 0.001
65 #define DotProduct(x,y) ((x)[0]*(y)[0]+(x)[1]*(y)[1]+(x)[2]*(y)[2])
66 #define VectorSubtract(a,b,c) ((c)[0]=(a)[0]-(b)[0],(c)[1]=(a)[1]-(b)[1],(c)[2]=(a)[2]-(b)[2])
67 #define VectorAdd(a,b,c) ((c)[0]=(a)[0]+(b)[0],(c)[1]=(a)[1]+(b)[1],(c)[2]=(a)[2]+(b)[2])
68 #define VectorIncrement(a,b) ((b)[0]+=(a)[0],(b)[1]+=(a)[1],(b)[2]+=(a)[2])
69 #define VectorCopy(a,b) ((b)[0]=(a)[0],(b)[1]=(a)[1],(b)[2]=(a)[2])
70 #define VectorSet(v, a, b, c) ((v)[0]=(a),(v)[1]=(b),(v)[2]=(c))
71 #define VectorScale(a,b,c) ((c)[0]=(b)*(a)[0],(c)[1]=(b)*(a)[1],(c)[2]=(b)*(a)[2])
72 #define VectorMid(a,b,c) ((c)[0]=((a)[0]+(b)[0])*0.5f,(c)[1]=((a)[1]+(b)[1])*0.5f,(c)[2]=((a)[2]+(b)[2])*0.5f)
73 #define VectorNegate(a,b) ((b)[0]=-(a)[0],(b)[1]=-(a)[1],(b)[2]=-(a)[2])
74 #define CrossProduct(a,b,c) ((c)[0]=(a)[1]*(b)[2]-(a)[2]*(b)[1],(c)[1]=(a)[2]*(b)[0]-(a)[0]*(b)[2],(c)[2]=(a)[0]*(b)[1]-(a)[1]*(b)[0])
75 #define VectorClear(x) ((x)[0]=(x)[1]=(x)[2]=0)
77 #define FLOAT_SNAP(f,snap) ( (float)( floor( (f) / (snap) + 0.5 ) * (snap) ) )
78 #define FLOAT_TO_INTEGER(f) ( (float)( floor( (f) + 0.5 ) ) )
80 #define Q_rint(in) ((vec_t)floor(in+0.5))
82 qboolean VectorCompare (const vec3_t v1, const vec3_t v2);
84 vec_t VectorLength(const vec3_t v);
86 void VectorMA( const vec3_t va, vec_t scale, const vec3_t vb, vec3_t vc );
88 void _CrossProduct (vec3_t v1, vec3_t v2, vec3_t cross);
89 vec_t VectorNormalize (const vec3_t in, vec3_t out);
90 vec_t ColorNormalize( const vec3_t in, vec3_t out );
91 void VectorInverse (vec3_t v);
92 void VectorPolar(vec3_t v, float radius, float theta, float phi);
94 // default snapping, to 1
95 void VectorSnap(vec3_t v);
98 void VectorISnap(vec3_t point, int snap);
100 // Gef: added snap to float for sub-integer grid sizes
101 // TTimo: we still use the int version of VectorSnap when possible
102 // to avoid potential rounding issues
103 // TTimo: renaming to VectorFSnap for C implementation
104 void VectorFSnap(vec3_t point, float snap);
106 // NOTE: added these from Ritual's Q3Radiant
107 void ClearBounds (vec3_t mins, vec3_t maxs);
108 void AddPointToBounds (vec3_t v, vec3_t mins, vec3_t maxs);
111 #define PITCH 0 // up / down
112 #define YAW 1 // left / right
113 #define ROLL 2 // fall over
115 void AngleVectors (vec3_t angles, vec3_t forward, vec3_t right, vec3_t up);
116 void VectorToAngles( vec3_t vec, vec3_t angles );
118 #define ZERO_EPSILON 1.0E-6
119 #define RAD2DEGMULT 57.29577951308232f
120 #define DEG2RADMULT 0.01745329251994329f
121 #define RAD2DEG( a ) ( (a) * RAD2DEGMULT )
122 #define DEG2RAD( a ) ( (a) * DEG2RADMULT )
124 void VectorRotate (vec3_t vIn, vec3_t vRotation, vec3_t out);
125 void VectorRotateOrigin (vec3_t vIn, vec3_t vRotation, vec3_t vOrigin, vec3_t out);
127 // some function merged from tools mathlib code
129 qboolean PlaneFromPoints( vec4_t plane, const vec3_t a, const vec3_t b, const vec3_t c );
130 void NormalToLatLong( const vec3_t normal, byte bytes[2] );
131 int PlaneTypeForNormal (vec3_t normal);
132 void RotatePointAroundVector( vec3_t dst, const vec3_t dir, const vec3_t point, float degrees );
137 FIXME test calls such as intersect tests should be named test_
140 typedef vec_t m3x3_t[9];
142 m4x4 looks like this..
148 translation (12 13 14)
151 typedef vec_t m4x4_t[16];
153 #define M4X4_INDEX(m,row,col) (m[(col<<2)+row])
155 typedef enum { eXYZ, eYZX, eZXY, eXZY, eYXZ, eZYX } eulerOrder_t;
157 #define CLIP_PASS 0x00 // 000000
158 #define CLIP_LT_X 0x01 // 000001
159 #define CLIP_GT_X 0x02 // 000010
160 #define CLIP_LT_Y 0x04 // 000100
161 #define CLIP_GT_Y 0x08 // 001000
162 #define CLIP_LT_Z 0x10 // 010000
163 #define CLIP_GT_Z 0x20 // 100000
164 #define CLIP_FAIL 0x3F // 111111
165 typedef unsigned char clipmask_t;
167 extern const m4x4_t g_m4x4_identity;
169 #define M4X4_COPY(dst,src) (\
180 (dst)[10]=(src)[10],\
181 (dst)[11]=(src)[11],\
182 (dst)[12]=(src)[12],\
183 (dst)[13]=(src)[13],\
184 (dst)[14]=(src)[14],\
194 m4x4Handedness_t m4x4_handedness(const m4x4_t matrix);
196 /*! assign other m4x4 to this m4x4 */
197 void m4x4_assign(m4x4_t matrix, const m4x4_t other);
200 /*! create m4x4 as identity matrix */
201 void m4x4_identity(m4x4_t matrix);
202 /*! create m4x4 as a translation matrix, for a translation vec3 */
203 void m4x4_translation_for_vec3(m4x4_t matrix, const vec3_t translation);
204 /*! create m4x4 as a rotation matrix, for an euler angles (degrees) vec3 */
205 void m4x4_rotation_for_vec3(m4x4_t matrix, const vec3_t euler, eulerOrder_t order);
206 /*! create m4x4 as a scaling matrix, for a scale vec3 */
207 void m4x4_scale_for_vec3(m4x4_t matrix, const vec3_t scale);
208 /*! create m4x4 as a rotation matrix, for a quaternion vec4 */
209 void m4x4_rotation_for_quat(m4x4_t matrix, const vec4_t rotation);
210 /*! create m4x4 as a rotation matrix, for an axis vec3 and an angle (radians) */
211 void m4x4_rotation_for_axisangle(m4x4_t matrix, const vec3_t axis, double angle);
212 /*! generate a perspective matrix by specifying the view frustum */
213 void m4x4_frustum(m4x4_t matrix, vec_t left, vec_t right, vec_t bottom, vec_t top, vec_t nearval, vec_t farval);
215 // a valid m4x4 to access is always first argument
216 /*! extract translation vec3 from matrix */
217 void m4x4_get_translation_vec3(const m4x4_t matrix, vec3_t translation);
218 /*! extract euler rotation angles from a rotation-only matrix */
219 void m4x4_get_rotation_vec3(const m4x4_t matrix, vec3_t euler, eulerOrder_t order);
220 /*! extract scale vec3 from matrix */
221 void m4x4_get_scale_vec3(const m4x4_t matrix, vec3_t scale);
222 /*! extract translation/euler/scale from an orthogonal matrix. NOTE: requires right-handed axis-base */
223 void m4x4_get_transform_vec3(const m4x4_t matrix, vec3_t translation, vec3_t euler, eulerOrder_t order, vec3_t scale);
225 // a valid m4x4 to be modified is always first argument
226 /*! translate m4x4 by a translation vec3 */
227 void m4x4_translate_by_vec3(m4x4_t matrix, const vec3_t translation);
228 /*! rotate m4x4 by a euler (degrees) vec3 */
229 void m4x4_rotate_by_vec3(m4x4_t matrix, const vec3_t euler, eulerOrder_t order);
230 /*! scale m4x4 by a scaling vec3 */
231 void m4x4_scale_by_vec3(m4x4_t matrix, const vec3_t scale);
232 /*! rotate m4x4 by a quaternion vec4 */
233 void m4x4_rotate_by_quat(m4x4_t matrix, const vec4_t rotation);
234 /*! rotate m4x4 by an axis vec3 and an angle (radians) */
235 void m4x4_rotate_by_axisangle(m4x4_t matrix, const vec3_t axis, double angle);
236 /*! transform m4x4 by translation/eulerZYX/scaling vec3 (transform = scale * eulerZ * eulerY * eulerX * translation) */
237 void m4x4_transform_by_vec3(m4x4_t matrix, const vec3_t translation, const vec3_t euler, eulerOrder_t order, const vec3_t scale);
238 /*! rotate m4x4 around a pivot point by eulerZYX vec3 */
239 void m4x4_pivoted_rotate_by_vec3(m4x4_t matrix, const vec3_t euler, eulerOrder_t order, const vec3_t pivotpoint);
240 /*! scale m4x4 around a pivot point by scaling vec3 */
241 void m4x4_pivoted_scale_by_vec3(m4x4_t matrix, const vec3_t scale, const vec3_t pivotpoint);
242 /*! transform m4x4 around a pivot point by translation/eulerZYX/scaling vec3 */
243 void m4x4_pivoted_transform_by_vec3(m4x4_t matrix, const vec3_t translation, const vec3_t euler, eulerOrder_t order, const vec3_t scale, const vec3_t pivotpoint);
244 /*! transform m4x4 around a pivot point by translation/rotation/scaling vec3 */
245 void m4x4_pivoted_transform_by_rotation(m4x4_t matrix, const vec3_t translation, const m4x4_t rotation, const vec3_t scale, const vec3_t pivotpoint);
246 /*! rotate m4x4 around a pivot point by quaternion vec4 */
247 void m4x4_pivoted_rotate_by_quat(m4x4_t matrix, const vec4_t quat, const vec3_t pivotpoint);
248 /*! rotate m4x4 around a pivot point by axis vec3 and angle (radians) */
249 void m4x4_pivoted_rotate_by_axisangle(m4x4_t matrix, const vec3_t axis, double angle, const vec3_t pivotpoint);
251 /*! postmultiply m4x4 by another m4x4 */
252 void m4x4_multiply_by_m4x4(m4x4_t matrix, const m4x4_t matrix_src);
253 /*! premultiply m4x4 by another m4x4 */
254 void m4x4_premultiply_by_m4x4(m4x4_t matrix, const m4x4_t matrix_src);
255 /*! postmultiply orthogonal m4x4 by another orthogonal m4x4 */
256 void m4x4_orthogonal_multiply_by_m4x4(m4x4_t matrix, const m4x4_t matrix_src);
257 /*! premultiply orthogonal m4x4 by another orthogonal m4x4 */
258 void m4x4_orthogonal_premultiply_by_m4x4(m4x4_t matrix, const m4x4_t matrix_src);
260 /*! multiply a point (x,y,z,1) by matrix */
261 void m4x4_transform_point(const m4x4_t matrix, vec3_t point);
262 /*! multiply a normal (x,y,z,0) by matrix */
263 void m4x4_transform_normal(const m4x4_t matrix, vec3_t normal);
264 /*! multiply a vec4 (x,y,z,w) by matrix */
265 void m4x4_transform_vec4(const m4x4_t matrix, vec4_t vector);
267 /*! multiply a point (x,y,z,1) by matrix */
268 void m4x4_transform_point(const m4x4_t matrix, vec3_t point);
269 /*! multiply a normal (x,y,z,0) by matrix */
270 void m4x4_transform_normal(const m4x4_t matrix, vec3_t normal);
272 /*! transpose a m4x4 */
273 void m4x4_transpose(m4x4_t matrix);
274 /*! invert an orthogonal 4x3 subset of a 4x4 matrix */
275 int m4x4_orthogonal_invert(m4x4_t matrix);
277 float m4_det( m4x4_t mr );
278 /*! invert any m4x4 using Kramer's rule.. return 1 if matrix is singular, else return 0 */
279 int m4x4_invert(m4x4_t matrix);
281 /*! clip a point (x,y,z,1) by canonical matrix */
282 clipmask_t m4x4_clip_point(const m4x4_t matrix, const vec3_t point, vec4_t clipped);
283 /*! device-space polygon for clipped triangle */
284 unsigned int m4x4_clip_triangle(const m4x4_t matrix, const vec3_t p0, const vec3_t p1, const vec3_t p2, vec4_t clipped[9]);
285 /*! device-space line for clipped line */
286 unsigned int m4x4_clip_line(const m4x4_t matrix, const vec3_t p0, const vec3_t p1, vec4_t clipped[2]);
289 //! quaternion identity
290 void quat_identity(vec4_t quat);
291 //! quaternion from two unit vectors
292 void quat_for_unit_vectors(vec4_t quat, const vec3_t from, const vec3_t to);
293 //! quaternion from axis and angle (radians)
294 void quat_for_axisangle(vec4_t quat, const vec3_t axis, double angle);
295 //! concatenates two rotations.. equivalent to m4x4_multiply_by_m4x4 .. postmultiply.. the right-hand side is the first rotation performed
296 void quat_multiply_by_quat(vec4_t quat, const vec4_t other);
297 //! negate a quaternion
298 void quat_conjugate(vec4_t quat);
299 //! normalise a quaternion
300 void quat_normalise(vec4_t quat);
305 \todo object/ray intersection functions should maybe return a point rather than a distance?
309 aabb_t - "axis-aligned" bounding box...
310 origin: centre of bounding box...
311 extents: +/- extents of box from origin...
313 typedef struct aabb_s
319 extern const aabb_t g_aabb_null;
322 bbox_t - oriented bounding box...
323 aabb: axis-aligned bounding box...
324 axes: orientation axes...
326 typedef struct bbox_s
334 ray_t - origin point and direction unit-vector
343 line_t - centre point and displacement of end point from centre
345 typedef struct line_s
352 /*! Generate line from start/end points. */
353 void line_construct_for_vec3(line_t* line, const vec3_t start, const vec3_t end);
354 /*! Return 2 if line is behind plane, else return 1 if line intersects plane, else return 0. */
355 int line_test_plane(const line_t* line, const vec4_t plane);
357 /*! Generate AABB from min/max. */
358 void aabb_construct_for_vec3(aabb_t* aabb, const vec3_t min, const vec3_t max);
359 /*! Initialise AABB to negative size. */
360 void aabb_clear(aabb_t* aabb);
362 /*! Extend AABB to include point. */
363 void aabb_extend_by_point(aabb_t* aabb, const vec3_t point);
364 /*! Extend AABB to include aabb_src. */
365 void aabb_extend_by_aabb(aabb_t* aabb, const aabb_t* aabb_src);
366 /*! Extend AABB by +/- extension vector. */
367 void aabb_extend_by_vec3(aabb_t* aabb, vec3_t extension);
369 /*! Return 2 if point is inside, else 1 if point is on surface, else 0. */
370 int aabb_test_point(const aabb_t* aabb, const vec3_t point);
371 /*! Return 2 if aabb_src intersects, else 1 if aabb_src touches exactly, else 0. */
372 int aabb_test_aabb(const aabb_t* aabb, const aabb_t* aabb_src);
373 /*! Return 2 if aabb is behind plane, else 1 if aabb intersects plane, else 0. */
374 int aabb_test_plane(const aabb_t* aabb, const float* plane);
375 /*! Return 1 if aabb intersects ray, else 0... dist = closest intersection. */
376 int aabb_intersect_ray(const aabb_t* aabb, const ray_t* ray, vec3_t intersection);
377 /*! Return 1 if aabb intersects ray, else 0. Faster, but does not provide point of intersection */
378 int aabb_test_ray(const aabb_t* aabb, const ray_t* ray);
380 /*! Return 2 if oriented aabb is behind plane, else 1 if aabb intersects plane, else 0. */
381 int aabb_oriented_intersect_plane(const aabb_t* aabb, const m4x4_t transform, const vec_t* plane);
383 /*! Calculate the corners of the aabb. */
384 void aabb_corners(const aabb_t* aabb, vec3_t corners[8]);
386 /*! (deprecated) Generate AABB from oriented bounding box. */
387 void aabb_for_bbox(aabb_t* aabb, const bbox_t* bbox);
388 /*! (deprecated) Generate AABB from 2-dimensions of min/max, specified by axis. */
389 void aabb_for_area(aabb_t* aabb, vec3_t area_tl, vec3_t area_br, int axis);
390 /*! Generate AABB to contain src* transform. NOTE: transform must be orthogonal */
391 void aabb_for_transformed_aabb(aabb_t* dst, const aabb_t* src, const m4x4_t transform);
393 /*! Update bounding-sphere radius. */
394 void bbox_update_radius(bbox_t* bbox);
395 /*! Generate oriented bounding box from AABB and transformation matrix. */
396 /*!\todo Remove need to specify eulerZYX/scale. */
397 void bbox_for_oriented_aabb(bbox_t* bbox, const aabb_t* aabb,
398 const m4x4_t matrix, const vec3_t eulerZYX, const vec3_t scale);
399 /*! Return 2 if bbox is behind plane, else return 1 if bbox intersects plane, else return 0. */
400 int bbox_intersect_plane(const bbox_t* bbox, const vec_t* plane);
403 /*! Generate a ray from an origin point and a direction unit-vector */
404 void ray_construct_for_vec3(ray_t* ray, const vec3_t origin, const vec3_t direction);
406 /*! Transform a ray */
407 void ray_transform(ray_t* ray, const m4x4_t matrix);
409 /*! distance from ray origin in ray direction to point. FLT_MAX if no intersection. */
410 vec_t ray_intersect_point(const ray_t* ray, const vec3_t point, vec_t epsilon, vec_t divergence);
411 /*! distance from ray origin in ray direction to triangle. FLT_MAX if no intersection. */
412 vec_t ray_intersect_triangle(const ray_t* ray, qboolean bCullBack, const vec3_t vert0, const vec3_t vert1, const vec3_t vert2);
413 /*! distance from ray origin in ray direction to plane. */
414 vec_t ray_intersect_plane(const ray_t* ray, const vec3_t normal, vec_t dist);
417 int plane_intersect_planes(const vec4_t plane1, const vec4_t plane2, const vec4_t plane3, vec3_t intersection);
424 #endif /* __MATHLIB__ */