2013-08-29 02:34:34 -03:00
|
|
|
/*
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
2010-09-08 05:21:46 -03:00
|
|
|
|
|
|
|
// Copyright 2010 Michael Smith, all rights reserved.
|
|
|
|
|
|
|
|
// Inspired by:
|
|
|
|
/****************************************
|
|
|
|
* 3D Vector Classes
|
|
|
|
* By Bill Perone (billperone@yahoo.com)
|
|
|
|
*/
|
|
|
|
|
2010-09-08 05:41:29 -03:00
|
|
|
//
|
|
|
|
// 3x3 matrix implementation.
|
|
|
|
//
|
|
|
|
// Note that the matrix is organised in row-normal form (the same as
|
|
|
|
// applies to array indexing).
|
|
|
|
//
|
|
|
|
// In addition to the template, this header defines the following types:
|
|
|
|
//
|
|
|
|
// Matrix3i 3x3 matrix of signed integers
|
|
|
|
// Matrix3ui 3x3 matrix of unsigned integers
|
|
|
|
// Matrix3l 3x3 matrix of signed longs
|
|
|
|
// Matrix3ul 3x3 matrix of unsigned longs
|
|
|
|
// Matrix3f 3x3 matrix of signed floats
|
|
|
|
//
|
2016-02-17 21:25:33 -04:00
|
|
|
#pragma once
|
2010-09-08 05:21:46 -03:00
|
|
|
|
|
|
|
#include "vector3.h"
|
|
|
|
|
|
|
|
// 3x3 matrix with elements of type T
|
|
|
|
template <typename T>
|
|
|
|
class Matrix3 {
|
|
|
|
public:
|
|
|
|
|
2012-08-17 03:20:14 -03:00
|
|
|
// Vectors comprising the rows of the matrix
|
|
|
|
Vector3<T> a, b, c;
|
|
|
|
|
|
|
|
// trivial ctor
|
|
|
|
// note that the Vector3 ctor will zero the vector elements
|
2016-04-22 09:59:24 -03:00
|
|
|
constexpr Matrix3<T>() {}
|
2012-08-17 03:20:14 -03:00
|
|
|
|
|
|
|
// setting ctor
|
2016-04-22 09:59:24 -03:00
|
|
|
constexpr Matrix3<T>(const Vector3<T> &a0, const Vector3<T> &b0, const Vector3<T> &c0)
|
|
|
|
: a(a0)
|
|
|
|
, b(b0)
|
|
|
|
, c(c0) {}
|
2012-08-17 03:20:14 -03:00
|
|
|
|
|
|
|
// setting ctor
|
2016-04-22 09:59:24 -03:00
|
|
|
constexpr Matrix3<T>(const T ax, const T ay, const T az,
|
|
|
|
const T bx, const T by, const T bz,
|
|
|
|
const T cx, const T cy, const T cz)
|
|
|
|
: a(ax,ay,az)
|
|
|
|
, b(bx,by,bz)
|
|
|
|
, c(cx,cy,cz) {}
|
2012-08-17 03:20:14 -03:00
|
|
|
|
|
|
|
// function call operator
|
2014-08-07 11:41:52 -03:00
|
|
|
void operator () (const Vector3<T> &a0, const Vector3<T> &b0, const Vector3<T> &c0)
|
2012-08-17 03:20:14 -03:00
|
|
|
{
|
|
|
|
a = a0; b = b0; c = c0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// test for equality
|
|
|
|
bool operator == (const Matrix3<T> &m)
|
|
|
|
{
|
|
|
|
return (a==m.a && b==m.b && c==m.c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// test for inequality
|
|
|
|
bool operator != (const Matrix3<T> &m)
|
|
|
|
{
|
|
|
|
return (a!=m.a || b!=m.b || c!=m.c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// negation
|
|
|
|
Matrix3<T> operator - (void) const
|
|
|
|
{
|
|
|
|
return Matrix3<T>(-a,-b,-c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// addition
|
|
|
|
Matrix3<T> operator + (const Matrix3<T> &m) const
|
|
|
|
{
|
|
|
|
return Matrix3<T>(a+m.a, b+m.b, c+m.c);
|
|
|
|
}
|
|
|
|
Matrix3<T> &operator += (const Matrix3<T> &m)
|
|
|
|
{
|
|
|
|
return *this = *this + m;
|
|
|
|
}
|
|
|
|
|
|
|
|
// subtraction
|
|
|
|
Matrix3<T> operator - (const Matrix3<T> &m) const
|
|
|
|
{
|
|
|
|
return Matrix3<T>(a-m.a, b-m.b, c-m.c);
|
|
|
|
}
|
|
|
|
Matrix3<T> &operator -= (const Matrix3<T> &m)
|
|
|
|
{
|
|
|
|
return *this = *this - m;
|
|
|
|
}
|
|
|
|
|
|
|
|
// uniform scaling
|
|
|
|
Matrix3<T> operator * (const T num) const
|
|
|
|
{
|
|
|
|
return Matrix3<T>(a*num, b*num, c*num);
|
|
|
|
}
|
|
|
|
Matrix3<T> &operator *= (const T num)
|
|
|
|
{
|
|
|
|
return *this = *this * num;
|
|
|
|
}
|
|
|
|
Matrix3<T> operator / (const T num) const
|
|
|
|
{
|
|
|
|
return Matrix3<T>(a/num, b/num, c/num);
|
|
|
|
}
|
|
|
|
Matrix3<T> &operator /= (const T num)
|
|
|
|
{
|
|
|
|
return *this = *this / num;
|
|
|
|
}
|
|
|
|
|
2013-12-29 03:37:14 -04:00
|
|
|
// allow a Matrix3 to be used as an array of vectors, 0 indexed
|
|
|
|
Vector3<T> & operator[](uint8_t i) {
|
|
|
|
Vector3<T> *_v = &a;
|
2016-02-14 18:22:23 -04:00
|
|
|
#if MATH_CHECK_INDEXES
|
2013-12-29 22:24:33 -04:00
|
|
|
assert(i >= 0 && i < 3);
|
|
|
|
#endif
|
2013-12-29 22:24:33 -04:00
|
|
|
return _v[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
const Vector3<T> & operator[](uint8_t i) const {
|
|
|
|
const Vector3<T> *_v = &a;
|
2016-02-14 18:22:23 -04:00
|
|
|
#if MATH_CHECK_INDEXES
|
2013-12-29 22:24:33 -04:00
|
|
|
assert(i >= 0 && i < 3);
|
|
|
|
#endif
|
2013-12-29 03:37:14 -04:00
|
|
|
return _v[i];
|
|
|
|
}
|
|
|
|
|
2012-08-17 03:20:14 -03:00
|
|
|
// multiplication by a vector
|
|
|
|
Vector3<T> operator *(const Vector3<T> &v) const;
|
|
|
|
|
|
|
|
// multiplication of transpose by a vector
|
|
|
|
Vector3<T> mul_transpose(const Vector3<T> &v) const;
|
|
|
|
|
2013-05-05 00:47:23 -03:00
|
|
|
// multiplication by a vector giving a Vector2 result (XY components)
|
|
|
|
Vector2<T> mulXY(const Vector3<T> &v) const;
|
|
|
|
|
2012-08-17 03:20:14 -03:00
|
|
|
// extract x column
|
|
|
|
Vector3<T> colx(void) const
|
|
|
|
{
|
2014-04-03 19:44:56 -03:00
|
|
|
return Vector3<T>(a.x, b.x, c.x);
|
2012-08-17 03:20:14 -03:00
|
|
|
}
|
|
|
|
|
|
|
|
// extract y column
|
|
|
|
Vector3<T> coly(void) const
|
|
|
|
{
|
2014-04-03 19:44:56 -03:00
|
|
|
return Vector3<T>(a.y, b.y, c.y);
|
2012-08-17 03:20:14 -03:00
|
|
|
}
|
|
|
|
|
|
|
|
// extract z column
|
|
|
|
Vector3<T> colz(void) const
|
|
|
|
{
|
2014-04-03 19:44:56 -03:00
|
|
|
return Vector3<T>(a.z, b.z, c.z);
|
2012-08-17 03:20:14 -03:00
|
|
|
}
|
|
|
|
|
|
|
|
// multiplication by another Matrix3<T>
|
|
|
|
Matrix3<T> operator *(const Matrix3<T> &m) const;
|
|
|
|
|
|
|
|
Matrix3<T> &operator *=(const Matrix3<T> &m)
|
|
|
|
{
|
|
|
|
return *this = *this * m;
|
|
|
|
}
|
|
|
|
|
|
|
|
// transpose the matrix
|
|
|
|
Matrix3<T> transposed(void) const;
|
|
|
|
|
2013-12-29 23:07:32 -04:00
|
|
|
void transpose(void)
|
2012-08-17 03:20:14 -03:00
|
|
|
{
|
2013-12-29 23:07:32 -04:00
|
|
|
*this = transposed();
|
2012-08-17 03:20:14 -03:00
|
|
|
}
|
|
|
|
|
2016-04-07 19:57:57 -03:00
|
|
|
/**
|
|
|
|
* Calculate the determinant of this matrix.
|
|
|
|
*
|
|
|
|
* @return The value of the determinant.
|
|
|
|
*/
|
|
|
|
T det() const;
|
|
|
|
|
2016-04-08 10:02:46 -03:00
|
|
|
/**
|
|
|
|
* Calculate the inverse of this matrix.
|
|
|
|
*
|
|
|
|
* @param inv[in] Where to store the result.
|
|
|
|
*
|
|
|
|
* @return If this matrix is invertible, then true is returned. Otherwise,
|
|
|
|
* \p inv is unmodified and false is returned.
|
|
|
|
*/
|
|
|
|
bool inverse(Matrix3<T>& inv) const;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Invert this matrix if it is invertible.
|
|
|
|
*
|
|
|
|
* @return Return true if this matrix could be successfully inverted and
|
|
|
|
* false otherwise.
|
|
|
|
*/
|
|
|
|
bool invert();
|
|
|
|
|
2012-08-17 03:20:14 -03:00
|
|
|
// zero the matrix
|
|
|
|
void zero(void);
|
|
|
|
|
|
|
|
// setup the identity matrix
|
|
|
|
void identity(void) {
|
|
|
|
a.x = b.y = c.z = 1;
|
|
|
|
a.y = a.z = 0;
|
|
|
|
b.x = b.z = 0;
|
|
|
|
c.x = c.y = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// check if any elements are NAN
|
|
|
|
bool is_nan(void)
|
|
|
|
{
|
|
|
|
return a.is_nan() || b.is_nan() || c.is_nan();
|
|
|
|
}
|
|
|
|
|
2012-03-10 02:06:35 -04:00
|
|
|
// create a rotation matrix from Euler angles
|
2012-08-17 03:20:14 -03:00
|
|
|
void from_euler(float roll, float pitch, float yaw);
|
2012-03-10 02:06:35 -04:00
|
|
|
|
2018-07-16 05:19:54 -03:00
|
|
|
// create eulers from a rotation matrix.
|
|
|
|
// roll is from -Pi to Pi
|
|
|
|
// pitch is from -Pi/2 to Pi/2
|
|
|
|
// yaw is from -Pi to Pi
|
2014-01-04 00:58:27 -04:00
|
|
|
void to_euler(float *roll, float *pitch, float *yaw) const;
|
2012-03-19 03:22:11 -03:00
|
|
|
|
2017-11-22 23:19:29 -04:00
|
|
|
// create matrix from rotation enum
|
|
|
|
void from_rotation(enum Rotation rotation);
|
|
|
|
|
2015-05-24 20:02:42 -03:00
|
|
|
/*
|
|
|
|
calculate Euler angles (312 convention) for the matrix.
|
|
|
|
See http://www.atacolorado.com/eulersequences.doc
|
|
|
|
vector is returned in r, p, y order
|
|
|
|
*/
|
|
|
|
Vector3<T> to_euler312() const;
|
|
|
|
|
|
|
|
/*
|
|
|
|
fill the matrix from Euler angles in radians in 312 convention
|
|
|
|
*/
|
|
|
|
void from_euler312(float roll, float pitch, float yaw);
|
|
|
|
|
2012-03-19 03:22:11 -03:00
|
|
|
// apply an additional rotation from a body frame gyro vector
|
|
|
|
// to a rotation matrix.
|
2013-09-19 03:26:32 -03:00
|
|
|
void rotate(const Vector3<T> &g);
|
|
|
|
|
2016-04-21 20:54:59 -03:00
|
|
|
// create rotation matrix for rotation about the vector v by angle theta
|
|
|
|
// See: https://en.wikipedia.org/wiki/Rotation_matrix#General_rotations
|
|
|
|
// "Rotation matrix from axis and angle"
|
|
|
|
void from_axis_angle(const Vector3<T> &v, float theta);
|
|
|
|
|
2015-05-02 05:10:00 -03:00
|
|
|
// normalize a rotation matrix
|
|
|
|
void normalize(void);
|
2010-09-08 05:21:46 -03:00
|
|
|
};
|
|
|
|
|
2012-08-17 03:20:14 -03:00
|
|
|
typedef Matrix3<int16_t> Matrix3i;
|
|
|
|
typedef Matrix3<uint16_t> Matrix3ui;
|
|
|
|
typedef Matrix3<int32_t> Matrix3l;
|
|
|
|
typedef Matrix3<uint32_t> Matrix3ul;
|
|
|
|
typedef Matrix3<float> Matrix3f;
|
2015-11-03 09:46:39 -04:00
|
|
|
typedef Matrix3<double> Matrix3d;
|