33 , T m10, T m11, T m12, T m13
34 , T m20, T m21, T m22, T m23
35 , T m30, T m31, T m32, T m33);
66 bool isIdentity(T tolerance = std::numeric_limits<T>::epsilon())
const;
73 const void*
ptr(
void)
const;
131 DtMatrix4<T> DtMatrix4<T>::theIdentityMatrix = DtMatrix4<T>(1,0,0,0
148 memcpy(_m, rhs, 16*
sizeof(T));
153 , T m10, T m11, T m12, T m13
154 , T m20, T m21, T m22, T m23
155 , T m30, T m31, T m32, T m33)
157 m[0][0]=m00;m[0][1]=m01;m[0][2]=m02;m[0][3]=m03;
158 m[1][0]=m10;m[1][1]=m11;m[1][2]=m12;m[1][3]=m13;
159 m[2][0]=m20;m[2][1]=m21;m[2][2]=m22;m[2][3]=m23;
160 m[3][0]=m30;m[3][1]=m31;m[3][2]=m32;m[3][3]=m33;
166 memcpy(m, rhs, 16*
sizeof(T));
207 result.
m[0][0] = lhs.
m[0][0]*rhs.
m[0][0] + lhs.
m[0][1]*rhs.
m[1][0] + lhs.
m[0][2]*rhs.
m[2][0] + lhs.
m[0][3]*rhs.
m[3][0];
208 result.
m[0][1] = lhs.
m[0][0]*rhs.
m[0][1] + lhs.
m[0][1]*rhs.
m[1][1] + lhs.
m[0][2]*rhs.
m[2][1] + lhs.
m[0][3]*rhs.
m[3][1];
209 result.
m[0][2] = lhs.
m[0][0]*rhs.
m[0][2] + lhs.
m[0][1]*rhs.
m[1][2] + lhs.
m[0][2]*rhs.
m[2][2] + lhs.
m[0][3]*rhs.
m[3][2];
210 result.
m[0][3] = lhs.
m[0][0]*rhs.
m[0][3] + lhs.
m[0][1]*rhs.
m[1][3] + lhs.
m[0][2]*rhs.
m[2][3] + lhs.
m[0][3]*rhs.
m[3][3];
212 result.
m[1][0] = lhs.
m[1][0]*rhs.
m[0][0] + lhs.
m[1][1]*rhs.
m[1][0] + lhs.
m[1][2]*rhs.
m[2][0] + lhs.
m[1][3]*rhs.
m[3][0];
213 result.
m[1][1] = lhs.
m[1][0]*rhs.
m[0][1] + lhs.
m[1][1]*rhs.
m[1][1] + lhs.
m[1][2]*rhs.
m[2][1] + lhs.
m[1][3]*rhs.
m[3][1];
214 result.
m[1][2] = lhs.
m[1][0]*rhs.
m[0][2] + lhs.
m[1][1]*rhs.
m[1][2] + lhs.
m[1][2]*rhs.
m[2][2] + lhs.
m[1][3]*rhs.
m[3][2];
215 result.
m[1][3] = lhs.
m[1][0]*rhs.
m[0][3] + lhs.
m[1][1]*rhs.
m[1][3] + lhs.
m[1][2]*rhs.
m[2][3] + lhs.
m[1][3]*rhs.
m[3][3];
217 result.
m[2][0] = lhs.
m[2][0]*rhs.
m[0][0] + lhs.
m[2][1]*rhs.
m[1][0] + lhs.
m[2][2]*rhs.
m[2][0] + lhs.
m[2][3]*rhs.
m[3][0];
218 result.
m[2][1] = lhs.
m[2][0]*rhs.
m[0][1] + lhs.
m[2][1]*rhs.
m[1][1] + lhs.
m[2][2]*rhs.
m[2][1] + lhs.
m[2][3]*rhs.
m[3][1];
219 result.
m[2][2] = lhs.
m[2][0]*rhs.
m[0][2] + lhs.
m[2][1]*rhs.
m[1][2] + lhs.
m[2][2]*rhs.
m[2][2] + lhs.
m[2][3]*rhs.
m[3][2];
220 result.
m[2][3] = lhs.
m[2][0]*rhs.
m[0][3] + lhs.
m[2][1]*rhs.
m[1][3] + lhs.
m[2][2]*rhs.
m[2][3] + lhs.
m[2][3]*rhs.
m[3][3];
222 result.
m[3][0] = lhs.
m[3][0]*rhs.
m[0][0] + lhs.
m[3][1]*rhs.
m[1][0] + lhs.
m[3][2]*rhs.
m[2][0] + lhs.
m[3][3]*rhs.
m[3][0];
223 result.
m[3][1] = lhs.
m[3][0]*rhs.
m[0][1] + lhs.
m[3][1]*rhs.
m[1][1] + lhs.
m[3][2]*rhs.
m[2][1] + lhs.
m[3][3]*rhs.
m[3][1];
224 result.
m[3][2] = lhs.
m[3][0]*rhs.
m[0][2] + lhs.
m[3][1]*rhs.
m[1][2] + lhs.
m[3][2]*rhs.
m[2][2] + lhs.
m[3][3]*rhs.
m[3][2];
225 result.
m[3][3] = lhs.
m[3][0]*rhs.
m[0][3] + lhs.
m[3][1]*rhs.
m[1][3] + lhs.
m[3][2]*rhs.
m[2][3] + lhs.
m[3][3]*rhs.
m[3][3];
244 vResult.
x = lhs.
m[0][0]*rhs.
x + lhs.
m[0][1]*rhs.
y + lhs.
m[0][2]*rhs.
z + lhs.
m[0][3]*rhs.
w;
245 vResult.
y = lhs.
m[1][0]*rhs.
x + lhs.
m[1][1]*rhs.
y + lhs.
m[1][2]*rhs.
z + lhs.
m[1][3]*rhs.
w;
246 vResult.
z = lhs.
m[2][0]*rhs.
x + lhs.
m[2][1]*rhs.
y + lhs.
m[2][2]*rhs.
z + lhs.
m[2][3]*rhs.
w;
247 vResult.
w = lhs.
m[3][0]*rhs.
x + lhs.
m[3][1]*rhs.
y + lhs.
m[3][2]*rhs.
z + lhs.
m[3][3]*rhs.
w;
259 vResult.
x = lhs.
m[0][0] * rhs.
x + lhs.
m[1][0] * rhs.
y + lhs.
m[2][0] * rhs.
z + lhs.
m[3][0] * rhs.
w;
260 vResult.
y = lhs.
m[0][1] * rhs.
x + lhs.
m[1][1] * rhs.
y + lhs.
m[2][1] * rhs.
z + lhs.
m[3][1] * rhs.
w;
261 vResult.
z = lhs.
m[0][2] * rhs.
x + lhs.
m[1][2] * rhs.
y + lhs.
m[2][2] * rhs.
z + lhs.
m[3][2] * rhs.
w;
262 vResult.
w = lhs.
m[0][3] * rhs.
x + lhs.
m[1][3] * rhs.
y + lhs.
m[2][3] * rhs.
z + lhs.
m[3][3] * rhs.
w;
270 memset(_m, 0, 16*
sizeof(T));
277 m[0][0] = m[1][1] = m[2][2] = m[3][3] = 1;
284 m[0][0], m[1][0], m[2][0], m[3][0]
285 , m[0][1], m[1][1], m[2][1], m[3][1]
286 , m[0][2], m[1][2], m[2][2], m[3][2]
287 , m[0][3], m[1][3], m[2][3], m[3][3]
295 result[2][0] = (result[2][0] + result[3][0])*0.5f;
296 result[2][1] = (result[2][1] + result[3][1])*0.5f;
297 result[2][2] = (result[2][2] + result[3][2])*0.5f;
298 result[2][3] = (result[2][3] + result[3][3])*0.5f;
306 for(
size_t i = 0; i < 4; ++i)
308 for(
size_t j = 0; j < 4; ++j)
321 return isEqual(rhs, tolerance);
334 m[0][0] = rhs[0][0]; m[0][1] = rhs[0][1]; m[0][2] = rhs[0][2];
335 m[1][0] = rhs[1][0]; m[1][1] = rhs[1][1]; m[1][2] = rhs[1][2];
336 m[2][0] = rhs[2][0]; m[2][1] = rhs[2][1]; m[2][2] = rhs[2][2];
342 return m[3][0] == 0 && m[3][1] == 0 && m[3][2] == 0 && m[3][3] == 1;
353 m[0][0]*v.
x + m[0][1]*v.
y + m[0][2]*v.
z + + m[0][3]
354 , m[1][0]*v.
x + m[1][1]*v.
y + m[1][2]*v.
z + + m[1][3]
355 , m[2][0]*v.
x + m[2][1]*v.
y + m[2][2]*v.
z + + m[2][3]
367 m[0][0]*v.
x + m[0][1]*v.
y + m[0][2]*v.
z + + m[0][3]
368 , m[1][0]*v.
x + m[1][1]*v.
y + m[1][2]*v.
z + + m[1][3]
369 , m[2][0]*v.
x + m[2][1]*v.
y + m[2][2]*v.
z + + m[2][3]
377 T m00 = m[0][0], m01 = m[0][1], m02 = m[0][2], m03 = m[0][3];
378 T m10 = m[1][0], m11 = m[1][1], m12 = m[1][2], m13 = m[1][3];
379 T m20 = m[2][0], m21 = m[2][1], m22 = m[2][2], m23 = m[2][3];
380 T m30 = m[3][0], m31 = m[3][1], m32 = m[3][2], m33 = m[3][3];
382 T v0 = m20 * m31 - m21 * m30;
383 T v1 = m20 * m32 - m22 * m30;
384 T v2 = m20 * m33 - m23 * m30;
385 T v3 = m21 * m32 - m22 * m31;
386 T v4 = m21 * m33 - m23 * m31;
387 T v5 = m22 * m33 - m23 * m32;
389 T t00 = + (v5 * m11 - v4 * m12 + v3 * m13);
390 T t10 = - (v5 * m10 - v2 * m12 + v1 * m13);
391 T t20 = + (v4 * m10 - v2 * m11 + v0 * m13);
392 T t30 = - (v3 * m10 - v1 * m11 + v0 * m12);
394 T invDet = 1 / (t00 * m00 + t10 * m01 + t20 * m02 + t30 * m03);
396 T d00 = t00 * invDet;
397 T d10 = t10 * invDet;
398 T d20 = t20 * invDet;
399 T d30 = t30 * invDet;
401 T d01 = - (v5 * m01 - v4 * m02 + v3 * m03) * invDet;
402 T d11 = + (v5 * m00 - v2 * m02 + v1 * m03) * invDet;
403 T d21 = - (v4 * m00 - v2 * m01 + v0 * m03) * invDet;
404 T d31 = + (v3 * m00 - v1 * m01 + v0 * m02) * invDet;
406 v0 = m10 * m31 - m11 * m30;
407 v1 = m10 * m32 - m12 * m30;
408 v2 = m10 * m33 - m13 * m30;
409 v3 = m11 * m32 - m12 * m31;
410 v4 = m11 * m33 - m13 * m31;
411 v5 = m12 * m33 - m13 * m32;
413 T d02 = + (v5 * m01 - v4 * m02 + v3 * m03) * invDet;
414 T d12 = - (v5 * m00 - v2 * m02 + v1 * m03) * invDet;
415 T d22 = + (v4 * m00 - v2 * m01 + v0 * m03) * invDet;
416 T d32 = - (v3 * m00 - v1 * m01 + v0 * m02) * invDet;
418 v0 = m21 * m10 - m20 * m11;
419 v1 = m22 * m10 - m20 * m12;
420 v2 = m23 * m10 - m20 * m13;
421 v3 = m22 * m11 - m21 * m12;
422 v4 = m23 * m11 - m21 * m13;
423 v5 = m23 * m12 - m22 * m13;
425 T d03 = - (v5 * m01 - v4 * m02 + v3 * m03) * invDet;
426 T d13 = + (v5 * m00 - v2 * m02 + v1 * m03) * invDet;
427 T d23 = - (v4 * m00 - v2 * m01 + v0 * m03) * invDet;
428 T d33 = + (v3 * m00 - v1 * m01 + v0 * m02) * invDet;
442 T m10 = m[1][0], m11 = m[1][1], m12 = m[1][2];
443 T m20 = m[2][0], m21 = m[2][1], m22 = m[2][2];
445 T t00 = m22 * m11 - m21 * m12;
446 T t10 = m20 * m12 - m22 * m10;
447 T t20 = m21 * m10 - m20 * m11;
449 T m00 = m[0][0], m01 = m[0][1], m02 = m[0][2];
451 T invDet = 1 / (m00 * t00 + m01 * t10 + m02 * t20);
453 t00 *= invDet; t10 *= invDet; t20 *= invDet;
455 m00 *= invDet; m01 *= invDet; m02 *= invDet;
458 T r01 = m02 * m21 - m01 * m22;
459 T r02 = m01 * m12 - m02 * m11;
462 T r11 = m00 * m22 - m02 * m20;
463 T r12 = m02 * m10 - m00 * m12;
466 T r21 = m01 * m20 - m00 * m21;
467 T r22 = m00 * m11 - m01 * m10;
469 T m03 = m[0][3], m13 = m[1][3], m23 = m[2][3];
471 T r03 = - (r00 * m03 + r01 * m13 + r02 * m23);
472 T r13 = - (r10 * m03 + r11 * m13 + r12 * m23);
473 T r23 = - (r20 * m03 + r21 * m13 + r22 * m23);
493 m[0][3] = m[0][3] - v.
x;
494 m[1][3] = m[1][3] - v.
y;
495 m[2][3] = m[2][3] - v.
z;
501 return (memcmp(ptr(), rhs.
ptr(),
sizeof(T) * 16) == 0);
507 return (memcmp(ptr(), rhs.
ptr(),
sizeof(T) * 16) != 0);
513 for (
int i = 0; i < 4; ++i)
522 for (
int i = 0; i < 4; ++i)
531 return { m[row][0], m[row][1], m[row][2], m[row][3] };
537 return { m[0][col], m[1][col], m[2][col], m[3][col] };
554 inline std::ostream&
operator <<
557 for(
size_t i = 0; i < 4; ++i)
559 o<<mat[i][0]<<
" "<<mat[i][1]<<
" "<<mat[i][2]<<
" "<<mat[i][3]<<std::endl;
DtMatrix4< T > getInverseAffine(void) const
Get the inverse of this matrix. This matrix must be affine to.
Definition: DtMatrix4.h:438
DtVector4< T > getColumn(int col) const
get the column 4d vector
Definition: DtMatrix4.h:535
T x
Definition: DtVector4.h:118
static DtMatrix4 theIdentityMatrix
Definition: DtMatrix4.h:75
void setRow(int row, const DtVector4< T > &vec)
set the row with the given 4d vector
Definition: DtMatrix4.h:511
DtMatrix4< float > Matrix4_32
Definition: DtMatrix4.h:136
DtMatrix4()
CTOR.
Definition: DtMatrix4.h:140
~DtMatrix4()
DTOR.
Definition: DtMatrix4.h:170
void setColumn(int col, const DtVector4< T > &vec)
set the column with the given 4d vector
Definition: DtMatrix4.h:520
void translateBack(const DtVector3< T > &v)
subtract the vector from the translation column
Definition: DtMatrix4.h:491
DtMatrix4 operator*(const DtMatrix4 &rhs) const
Multiply 2 matrices. Returns this*rhs.
#define ASSERT_PREDICATE_RETURN_ZERO(p)
Definition: DtAssert.h:41
T m[4][4]
Definition: DtMatrix4.h:126
T z
Definition: DtVector3.h:135
DtMatrix4 convert_depth_gl_to_dx() const
Definition: DtMatrix4.h:292
const T * operator[](size_t iRow) const
Definition: DtMatrix4.h:182
bool isEqual(const DtMatrix4 &rhs, T tolerance) const
Check whether this matrix is equivalent to rhs within tolerance.
Definition: DtMatrix4.h:303
void zeroOutTranslation(void)
Zero out the translation column.
Definition: DtMatrix4.h:483
T x
Definition: DtVector3.h:135
4 dimensional vector
Definition: DtMath.h:22
const DtVector4< T > transposeMultiply(const DtVector4< T > &rhs) const
This is equal to: this->GetTranspose() * rhs (but potentialy faster)
Definition: DtMatrix4.h:253
bool operator==(const DtMatrix4< T > &rhs) const
equality
Definition: DtMatrix4.h:499
const void * ptr(void) const
Definition: DtMatrix4.h:176
DtMatrix4< double > Matrix4_64
Definition: DtMatrix4.h:137
T z
Definition: DtVector4.h:118
void operator=(const DtMatrix3< T > &rhs)
Assignment operator.
Definition: DtMatrix4.h:330
void multiply(const DtMatrix4< T > &lhs, const DtMatrix4< T > &rhs)
this = lhs*rhs
Definition: DtMatrix4.h:548
T _m[16]
Definition: DtMatrix4.h:125
bool isAffine(void) const
Return whether the last row is (0,0,0,1);.
Definition: DtMatrix4.h:340
T w
Definition: DtVector4.h:118
T y
Definition: DtVector3.h:135
static bool isEqual(int32 lhs, int32 rhs, int32 tolerance=std::numeric_limits< int32 >::epsilon())
Test equality with tolerance.
DtMatrix4< T > getInverse(void) const
Get the inverse of this matrix.
Definition: DtMatrix4.h:375
void setZero(void)
Set all values to zero.
Definition: DtMatrix4.h:268
3 dimensional matrix
Definition: DtMatrix3.h:20
bool operator!=(const DtMatrix4< T > &rhs) const
inequality
Definition: DtMatrix4.h:505
bool isIdentity(T tolerance=std::numeric_limits< T >::epsilon()) const
Definition: DtMatrix4.h:318
2 dimensional vector
Definition: DtMath.h:21
void transpose()
transpose in place, instead of returning a new transpose matrix
Definition: DtMatrix4.h:541
void setIdentity(void)
Set matrix to identity matrix.
Definition: DtMatrix4.h:274
DtMatrix4 getTranspose(void) const
Get the transpose of this matrix.
Definition: DtMatrix4.h:281
#define ASSERT_PREDICATE(p)
Definition: DtAssert.h:28
DtVector3< T > transformAffine(const DtVector3< T > &v) const
Definition: DtMatrix4.h:346
T y
Definition: DtVector4.h:118
4 dimensional matrix
Definition: DtMatrix4.h:22
DtVector4< T > getRow(int row) const
get the row 4d vector
Definition: DtMatrix4.h:529