src/math/SquareMatrix3.hpp

/*
 * Copyright (C) 2000-2004  Object Oriented Parallel Simulation Engine (OOPSE) project
 * 
 * Contact: oopse@oopse.org
 * 
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either version 2.1
 * of the License, or (at your option) any later version.
 * All we ask is that proper credit is given for our work, which includes
 * - but is not limited to - adding the above copyright notice to the beginning
 * of your source code files, and to any copyright notice that you may distribute
 * with programs based on this work.
 * 
 * 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 Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 */

/**
 * @file SquareMatrix3.hpp
 * @author Teng Lin
 * @date 10/11/2004
 * @version 1.0
 */
 #ifndef MATH_SQUAREMATRIX3_HPP
#define  MATH_SQUAREMATRIX3_HPP

#include "Quaternion.hpp"
#include "SquareMatrix.hpp"
#include "Vector3.hpp"

namespace oopse {

    template<typename Real>
    class SquareMatrix3 : public SquareMatrix<Real, 3> {
        public:

            typedef Real ElemType;
            typedef Real* ElemPoinerType;
            
            /** default constructor */
            SquareMatrix3() : SquareMatrix<Real, 3>() {
            }

            /** Constructs and initializes every element of this matrix to a scalar */ 
            SquareMatrix3(Real s) : SquareMatrix<Real,3>(s){
            }

            /** Constructs and initializes from an array */ 
            SquareMatrix3(Real* array) : SquareMatrix<Real,3>(array){
            }


            /** copy  constructor */
            SquareMatrix3(const SquareMatrix<Real, 3>& m)  : SquareMatrix<Real, 3>(m) {
            }
            
            SquareMatrix3( const Vector3<Real>& eulerAngles) {
                setupRotMat(eulerAngles);
            }
            
            SquareMatrix3(Real phi, Real theta, Real psi) {
                setupRotMat(phi, theta, psi);
            }

            SquareMatrix3(const Quaternion<Real>& q) {
                setupRotMat(q);

            }

            SquareMatrix3(Real w, Real x, Real y, Real z) {
                setupRotMat(w, x, y, z);
            }
            
            /** copy assignment operator */
            SquareMatrix3<Real>& operator =(const SquareMatrix<Real, 3>& m) {
                if (this == &m)
                    return *this;
                 SquareMatrix<Real, 3>::operator=(m);
                 return *this;
            }

            /**
             * Sets this matrix to a rotation matrix by three euler angles
             * @ param euler
             */
            void setupRotMat(const Vector3<Real>& eulerAngles) {
                setupRotMat(eulerAngles[0], eulerAngles[1], eulerAngles[2]);
            }

            /**
             * Sets this matrix to a rotation matrix by three euler angles
             * @param phi
             * @param theta
             * @psi theta
             */
            void setupRotMat(Real phi, Real theta, Real psi) {
                Real sphi, stheta, spsi;
                Real cphi, ctheta, cpsi;

                sphi = sin(phi);
                stheta = sin(theta);
                spsi = sin(psi);
                cphi = cos(phi);
                ctheta = cos(theta);
                cpsi = cos(psi);

                data_[0][0] = cpsi * cphi - ctheta * sphi * spsi;
                data_[0][1] = cpsi * sphi + ctheta * cphi * spsi;
                data_[0][2] = spsi * stheta;
                
                data_[1][0] = -spsi * ctheta - ctheta * sphi * cpsi;
                data_[1][1] = -spsi * stheta + ctheta * cphi * cpsi;
                data_[1][2] = cpsi * stheta;

                data_[2][0] = stheta * sphi;
                data_[2][1] = -stheta * cphi;
                data_[2][2] = ctheta;
            }


            /**
             * Sets this matrix to a rotation matrix by quaternion
             * @param quat
            */
            void setupRotMat(const Quaternion<Real>& quat) {
                setupRotMat(quat.w(), quat.x(), quat.y(), quat.z());
            }

            /**
             * Sets this matrix to a rotation matrix by quaternion
             * @param w the first element 
             * @param x the second element
             * @param y the third element
             * @param z the fourth element
            */
            void setupRotMat(Real w, Real x, Real y, Real z) {
                Quaternion<Real> q(w, x, y, z);
                *this = q.toRotationMatrix3();
            }

            /**
             * Returns the quaternion from this rotation matrix
             * @return the quaternion from this rotation matrix
             * @exception invalid rotation matrix
            */            
            Quaternion<Real> toQuaternion() {
                Quaternion<Real> q;
                Real t, s;
                Real ad1, ad2, ad3;    
                t = data_[0][0] + data_[1][1] + data_[2][2] + 1.0;

                if( t > 0.0 ){

                    s = 0.5 / sqrt( t );
                    q[0] = 0.25 / s;
                    q[1] = (data_[1][2] - data_[2][1]) * s;
                    q[2] = (data_[2][0] - data_[0][2]) * s;
                    q[3] = (data_[0][1] - data_[1][0]) * s;
                } else {

                    ad1 = fabs( data_[0][0] );
                    ad2 = fabs( data_[1][1] );
                    ad3 = fabs( data_[2][2] );

                    if( ad1 >= ad2 && ad1 >= ad3 ){

                        s = 2.0 * sqrt( 1.0 + data_[0][0] - data_[1][1] - data_[2][2] );
                        q[0] = (data_[1][2] + data_[2][1]) / s;
                        q[1] = 0.5 / s;
                        q[2] = (data_[0][1] + data_[1][0]) / s;
                        q[3] = (data_[0][2] + data_[2][0]) / s;
                    } else if ( ad2 >= ad1 && ad2 >= ad3 ) {
                        s = sqrt( 1.0 + data_[1][1] - data_[0][0] - data_[2][2] ) * 2.0;
                        q[0] = (data_[0][2] + data_[2][0]) / s;
                        q[1] = (data_[0][1] + data_[1][0]) / s;
                        q[2] = 0.5 / s;
                        q[3] = (data_[1][2] + data_[2][1]) / s;
                    } else {

                        s = sqrt( 1.0 + data_[2][2] - data_[0][0] - data_[1][1] ) * 2.0;
                        q[0] = (data_[0][1] + data_[1][0]) / s;
                        q[1] = (data_[0][2] + data_[2][0]) / s;
                        q[2] = (data_[1][2] + data_[2][1]) / s;
                        q[3] = 0.5 / s;
                    }
                }             

                return q;
                
            }

            /**
             * Returns the euler angles from this rotation matrix
             * @return the euler angles in a vector 
             * @exception invalid rotation matrix
             * We use so-called "x-convention", which is the most common definition. 
             * In this convention, the rotation given by Euler angles (phi, theta, psi), where the first 
             * rotation is by an angle phi about the z-axis, the second is by an angle  
             * theta (0 <= theta <= 180)about the x-axis, and thethird is by an angle psi about the
             * z-axis (again). 
            */            
            Vector3<Real> toEulerAngles() {
                Vector3<Real> myEuler;
                Real phi,theta,psi,eps;
                Real ctheta,stheta;
                
                // set the tolerance for Euler angles and rotation elements

                theta = acos(std::min(1.0, std::max(-1.0,data_[2][2])));
                ctheta = data_[2][2]; 
                stheta = sqrt(1.0 - ctheta * ctheta);

                // when sin(theta) is close to 0, we need to consider singularity
                // In this case, we can assign an arbitary value to phi (or psi), and then determine 
                // the psi (or phi) or vice-versa. We'll assume that phi always gets the rotation, and psi is 0
                // in cases of singularity.  
                // we use atan2 instead of atan, since atan2 will give us -Pi to Pi. 
                // Since 0 <= theta <= 180, sin(theta) will be always non-negative. Therefore, it never
                // change the sign of both of the parameters passed to atan2.

                if (fabs(stheta) <= oopse::epsilon){
                    psi = 0.0;
                    phi = atan2(-data_[1][0], data_[0][0]);  
                }
                // we only have one unique solution
                else{    
                    phi = atan2(data_[2][0], -data_[2][1]);
                    psi = atan2(data_[0][2], data_[1][2]);
                }

                //wrap phi and psi, make sure they are in the range from 0 to 2*Pi
                if (phi < 0)
                  phi += M_PI;

                if (psi < 0)
                  psi += M_PI;

                myEuler[0] = phi;
                myEuler[1] = theta;
                myEuler[2] = psi;

                return myEuler;
            }
            
            /** Returns the determinant of this matrix. */
            Real determinant() const {
                Real x,y,z;

                x = data_[0][0] * (data_[1][1] * data_[2][2] - data_[1][2] * data_[2][1]);
                y = data_[0][1] * (data_[1][2] * data_[2][0] - data_[1][0] * data_[2][2]);
                z = data_[0][2] * (data_[1][0] * data_[2][1] - data_[1][1] * data_[2][0]);

                return(x + y + z);
            }            

            /** Returns the trace of this matrix. */
            Real trace() const {
                return data_[0][0] + data_[1][1] + data_[2][2];
            }
            
            /**
             * Sets the value of this matrix to  the inversion of itself. 
             * @note since simple algorithm can be applied to inverse the 3 by 3 matrix, we hide the 
             * implementation of inverse in SquareMatrix class
             */
            SquareMatrix3<Real>  inverse() const {
                SquareMatrix3<Real> m;
                double det = determinant();
                if (fabs(det) <= oopse::epsilon) {
                //"The method was called on a matrix with |determinant| <= 1e-6.",
                //"This is a runtime or a programming error in your application.");
                }

                m(0, 0) = data_[1][1]*data_[2][2] - data_[1][2]*data_[2][1];
                m(1, 0) = data_[1][2]*data_[2][0] - data_[1][0]*data_[2][2];
                m(2, 0) = data_[1][0]*data_[2][1] - data_[1][1]*data_[2][0];
                m(0, 1) = data_[2][1]*data_[0][2] - data_[2][2]*data_[0][1];
                m(1, 1) = data_[2][2]*data_[0][0] - data_[2][0]*data_[0][2];
                m(2, 1) = data_[2][0]*data_[0][1] - data_[2][1]*data_[0][0];
                m(0, 2) = data_[0][1]*data_[1][2] - data_[0][2]*data_[1][1];
                m(1, 2) = data_[0][2]*data_[1][0] - data_[0][0]*data_[1][2];
                m(2, 2) = data_[0][0]*data_[1][1] - data_[0][1]*data_[1][0];

                m /= det;
                return m;
            }
            /**
             * Extract the eigenvalues and eigenvectors from a 3x3 matrix.
             * The eigenvectors (the columns of V) will be normalized. 
             * The eigenvectors are aligned optimally with the x, y, and z
             * axes respectively.
             * @param a symmetric matrix whose eigenvectors are to be computed. On return, the matrix is
             *     overwritten             
             * @param w will contain the eigenvalues of the matrix On return of this function
             * @param v the columns of this matrix will contain the eigenvectors. The eigenvectors are 
             *    normalized and mutually orthogonal.              
             * @warning a will be overwritten
             */
            static void diagonalize(SquareMatrix3<Real>& a, Vector3<Real>& w, SquareMatrix3<Real>& v); 
    };
/*=========================================================================

  Program:   Visualization Toolkit
  Module:    $RCSfile: SquareMatrix3.hpp,v $

  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
  All rights reserved.
  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.

     This software is distributed WITHOUT ANY WARRANTY; without even
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
     PURPOSE.  See the above copyright notice for more information.

=========================================================================*/
    template<typename Real>
    void SquareMatrix3<Real>::diagonalize(SquareMatrix3<Real>& a, Vector3<Real>& w, 
                                                                           SquareMatrix3<Real>& v) {
        int i,j,k,maxI;
        Real tmp, maxVal;
        Vector3<Real> v_maxI, v_k, v_j;

        // diagonalize using Jacobi
        jacobi(a, w, v);
        // if all the eigenvalues are the same, return identity matrix
        if (w[0] == w[1] && w[0] == w[2] ) {
              v = SquareMatrix3<Real>::identity();
              return;
        }

        // transpose temporarily, it makes it easier to sort the eigenvectors
        v = v.transpose(); 
        
        // if two eigenvalues are the same, re-orthogonalize to optimally line
        // up the eigenvectors with the x, y, and z axes
        for (i = 0; i < 3; i++) {
            if (w((i+1)%3) == w((i+2)%3)) {// two eigenvalues are the same
            // find maximum element of the independant eigenvector
            maxVal = fabs(v(i, 0));
            maxI = 0;
            for (j = 1; j < 3; j++) {
                if (maxVal < (tmp = fabs(v(i, j)))){
                    maxVal = tmp;
                    maxI = j;
                }
            }
            
            // swap the eigenvector into its proper position
            if (maxI != i) {
                tmp = w(maxI);
                w(maxI) = w(i);
                w(i) = tmp;

                v.swapRow(i, maxI);
            }
            // maximum element of eigenvector should be positive
            if (v(maxI, maxI) < 0) {
                v(maxI, 0) = -v(maxI, 0);
                v(maxI, 1) = -v(maxI, 1);
                v(maxI, 2) = -v(maxI, 2);
            }

            // re-orthogonalize the other two eigenvectors
            j = (maxI+1)%3;
            k = (maxI+2)%3;

            v(j, 0) = 0.0; 
            v(j, 1) = 0.0; 
            v(j, 2) = 0.0;
            v(j, j) = 1.0;

            /** @todo */
            v_maxI = v.getRow(maxI);
            v_j = v.getRow(j);
            v_k = cross(v_maxI, v_j);
            v_k.normalize();
            v_j = cross(v_k, v_maxI);
            v.setRow(j, v_j);
            v.setRow(k, v_k);


            // transpose vectors back to columns
            v = v.transpose();
            return;
            }
        }

        // the three eigenvalues are different, just sort the eigenvectors
        // to align them with the x, y, and z axes

        // find the vector with the largest x element, make that vector
        // the first vector
        maxVal = fabs(v(0, 0));
        maxI = 0;
        for (i = 1; i < 3; i++) {
            if (maxVal < (tmp = fabs(v(i, 0)))) {
                maxVal = tmp;
                maxI = i;
            }
        }

        // swap eigenvalue and eigenvector
        if (maxI != 0) {
            tmp = w(maxI);
            w(maxI) = w(0);
            w(0) = tmp;
            v.swapRow(maxI, 0);
        }
        // do the same for the y element
        if (fabs(v(1, 1)) < fabs(v(2, 1))) {
            tmp = w(2);
            w(2) = w(1);
            w(1) = tmp;
            v.swapRow(2, 1);
        }

        // ensure that the sign of the eigenvectors is correct
        for (i = 0; i < 2; i++) {
            if (v(i, i) < 0) {
                v(i, 0) = -v(i, 0);
                v(i, 1) = -v(i, 1);
                v(i, 2) = -v(i, 2);
            }
        }

        // set sign of final eigenvector to ensure that determinant is positive
        if (v.determinant() < 0) {
            v(2, 0) = -v(2, 0);
            v(2, 1) = -v(2, 1);
            v(2, 2) = -v(2, 2);
        }

        // transpose the eigenvectors back again
        v = v.transpose();
        return ;
    }

    /**
    * Return the multiplication of two matrixes  (m1 * m2). 
    * @return the multiplication of two matrixes
    * @param m1 the first matrix
    * @param m2 the second matrix
    */
    template<typename Real> 
    inline SquareMatrix3<Real> operator *(const SquareMatrix3<Real>& m1, const SquareMatrix3<Real>& m2) {
        SquareMatrix3<Real> result;

            for (unsigned int i = 0; i < 3; i++)
                for (unsigned int j = 0; j < 3; j++)
                    for (unsigned int k = 0; k < 3; k++)
                        result(i, j)  += m1(i, k) * m2(k, j);                

        return result;
    }

    template<typename Real> 
    inline SquareMatrix3<Real> outProduct(const Vector3<Real>& v1, const Vector3<Real>& v2) {
        SquareMatrix3<Real> result;

            for (unsigned int i = 0; i < 3; i++) {
                for (unsigned int j = 0; j < 3; j++) {
                        result(i, j)  = v1[i] * v2[j];                
                }
            }
            
        return result;        
    }

    
    typedef SquareMatrix3<double> Mat3x3d;
    typedef SquareMatrix3<double> RotMat3x3d;

} //namespace oopse
#endif // MATH_SQUAREMATRIX_HPP

Revision:	1822
Committed:	Thu Dec 2 02:08:29 2004 UTC (19 years, 9 months ago) by tim
File size:	17979 byte(s)
Log Message:	oopse get compiled, still has some linking problem
#	User	Rev	Content
1	tim	1563	/*
2			* Copyright (C) 2000-2004 Object Oriented Parallel Simulation Engine (OOPSE) project
3			*
4			* Contact: oopse@oopse.org
5			*
6			* This program is free software; you can redistribute it and/or
7			* modify it under the terms of the GNU Lesser General Public License
8			* as published by the Free Software Foundation; either version 2.1
9			* of the License, or (at your option) any later version.
10			* All we ask is that proper credit is given for our work, which includes
11			* - but is not limited to - adding the above copyright notice to the beginning
12			* of your source code files, and to any copyright notice that you may distribute
13			* with programs based on this work.
14			*
15			* This program is distributed in the hope that it will be useful,
16			* but WITHOUT ANY WARRANTY; without even the implied warranty of
17			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18			* GNU Lesser General Public License for more details.
19			*
20			* You should have received a copy of the GNU Lesser General Public License
21			* along with this program; if not, write to the Free Software
22			* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
23			*
24			*/
25
26			/**
27			* @file SquareMatrix3.hpp
28			* @author Teng Lin
29			* @date 10/11/2004
30			* @version 1.0
31			*/
32	tim	1616	#ifndef MATH_SQUAREMATRIX3_HPP
33	tim	1592	#define MATH_SQUAREMATRIX3_HPP
34	tim	1563
35	tim	1586	#include "Quaternion.hpp"
36	tim	1563	#include "SquareMatrix.hpp"
37	tim	1586	#include "Vector3.hpp"
38
39	tim	1563	namespace oopse {
40
41			template<typename Real>
42			class SquareMatrix3 : public SquareMatrix<Real, 3> {
43			public:
44	tim	1630
45			typedef Real ElemType;
46			typedef Real* ElemPoinerType;
47	tim	1563
48			/** default constructor */
49			SquareMatrix3() : SquareMatrix<Real, 3>() {
50			}
51
52	tim	1644	/** Constructs and initializes every element of this matrix to a scalar */
53			SquareMatrix3(Real s) : SquareMatrix<Real,3>(s){
54			}
55
56			/** Constructs and initializes from an array */
57			SquareMatrix3(Real* array) : SquareMatrix<Real,3>(array){
58			}
59
60
61	tim	1563	/** copy constructor */
62			SquareMatrix3(const SquareMatrix<Real, 3>& m) : SquareMatrix<Real, 3>(m) {
63			}
64	tim	1695
65	tim	1586	SquareMatrix3( const Vector3<Real>& eulerAngles) {
66			setupRotMat(eulerAngles);
67			}
68
69			SquareMatrix3(Real phi, Real theta, Real psi) {
70			setupRotMat(phi, theta, psi);
71			}
72
73			SquareMatrix3(const Quaternion<Real>& q) {
74	tim	1606	setupRotMat(q);
75
76	tim	1586	}
77
78			SquareMatrix3(Real w, Real x, Real y, Real z) {
79	tim	1606	setupRotMat(w, x, y, z);
80	tim	1586	}
81
82	tim	1563	/** copy assignment operator */
83			SquareMatrix3<Real>& operator =(const SquareMatrix<Real, 3>& m) {
84			if (this == &m)
85			return *this;
86			SquareMatrix<Real, 3>::operator=(m);
87	tim	1594	return *this;
88	tim	1563	}
89	tim	1569
90			/**
91			* Sets this matrix to a rotation matrix by three euler angles
92			* @ param euler
93			*/
94	tim	1586	void setupRotMat(const Vector3<Real>& eulerAngles) {
95			setupRotMat(eulerAngles[0], eulerAngles[1], eulerAngles[2]);
96			}
97	tim	1569
98			/**
99			* Sets this matrix to a rotation matrix by three euler angles
100			* @param phi
101			* @param theta
102			* @psi theta
103			*/
104	tim	1586	void setupRotMat(Real phi, Real theta, Real psi) {
105			Real sphi, stheta, spsi;
106			Real cphi, ctheta, cpsi;
107	tim	1569
108	tim	1586	sphi = sin(phi);
109			stheta = sin(theta);
110			spsi = sin(psi);
111			cphi = cos(phi);
112			ctheta = cos(theta);
113			cpsi = cos(psi);
114	tim	1569
115	tim	1586	data_[0][0] = cpsi * cphi - ctheta * sphi * spsi;
116			data_[0][1] = cpsi * sphi + ctheta * cphi * spsi;
117			data_[0][2] = spsi * stheta;
118
119			data_[1][0] = -spsi * ctheta - ctheta * sphi * cpsi;
120			data_[1][1] = -spsi * stheta + ctheta * cphi * cpsi;
121			data_[1][2] = cpsi * stheta;
122
123			data_[2][0] = stheta * sphi;
124			data_[2][1] = -stheta * cphi;
125			data_[2][2] = ctheta;
126			}
127
128
129	tim	1569	/**
130			* Sets this matrix to a rotation matrix by quaternion
131			* @param quat
132			*/
133	tim	1586	void setupRotMat(const Quaternion<Real>& quat) {
134	tim	1606	setupRotMat(quat.w(), quat.x(), quat.y(), quat.z());
135	tim	1586	}
136	tim	1569
137			/**
138			* Sets this matrix to a rotation matrix by quaternion
139	tim	1586	* @param w the first element
140			* @param x the second element
141			* @param y the third element
142	tim	1594	* @param z the fourth element
143	tim	1569	*/
144	tim	1586	void setupRotMat(Real w, Real x, Real y, Real z) {
145			Quaternion<Real> q(w, x, y, z);
146			*this = q.toRotationMatrix3();
147			}
148	tim	1569
149			/**
150			* Returns the quaternion from this rotation matrix
151			* @return the quaternion from this rotation matrix
152			* @exception invalid rotation matrix
153			*/
154	tim	1586	Quaternion<Real> toQuaternion() {
155			Quaternion<Real> q;
156			Real t, s;
157			Real ad1, ad2, ad3;
158			t = data_[0][0] + data_[1][1] + data_[2][2] + 1.0;
159	tim	1569
160	tim	1586	if( t > 0.0 ){
161
162			s = 0.5 / sqrt( t );
163			q[0] = 0.25 / s;
164			q[1] = (data_[1][2] - data_[2][1]) * s;
165			q[2] = (data_[2][0] - data_[0][2]) * s;
166			q[3] = (data_[0][1] - data_[1][0]) * s;
167			} else {
168
169			ad1 = fabs( data_[0][0] );
170			ad2 = fabs( data_[1][1] );
171			ad3 = fabs( data_[2][2] );
172
173			if( ad1 >= ad2 && ad1 >= ad3 ){
174
175			s = 2.0 * sqrt( 1.0 + data_[0][0] - data_[1][1] - data_[2][2] );
176			q[0] = (data_[1][2] + data_[2][1]) / s;
177			q[1] = 0.5 / s;
178			q[2] = (data_[0][1] + data_[1][0]) / s;
179			q[3] = (data_[0][2] + data_[2][0]) / s;
180			} else if ( ad2 >= ad1 && ad2 >= ad3 ) {
181			s = sqrt( 1.0 + data_[1][1] - data_[0][0] - data_[2][2] ) * 2.0;
182			q[0] = (data_[0][2] + data_[2][0]) / s;
183			q[1] = (data_[0][1] + data_[1][0]) / s;
184			q[2] = 0.5 / s;
185			q[3] = (data_[1][2] + data_[2][1]) / s;
186			} else {
187
188			s = sqrt( 1.0 + data_[2][2] - data_[0][0] - data_[1][1] ) * 2.0;
189			q[0] = (data_[0][1] + data_[1][0]) / s;
190			q[1] = (data_[0][2] + data_[2][0]) / s;
191			q[2] = (data_[1][2] + data_[2][1]) / s;
192			q[3] = 0.5 / s;
193			}
194			}
195
196			return q;
197
198			}
199
200	tim	1569	/**
201			* Returns the euler angles from this rotation matrix
202	tim	1586	* @return the euler angles in a vector
203	tim	1569	* @exception invalid rotation matrix
204	tim	1586	* We use so-called "x-convention", which is the most common definition.
205			* In this convention, the rotation given by Euler angles (phi, theta, psi), where the first
206			* rotation is by an angle phi about the z-axis, the second is by an angle
207			* theta (0 <= theta <= 180)about the x-axis, and thethird is by an angle psi about the
208			* z-axis (again).
209	tim	1569	*/
210	tim	1586	Vector3<Real> toEulerAngles() {
211	tim	1606	Vector3<Real> myEuler;
212	tim	1586	Real phi,theta,psi,eps;
213			Real ctheta,stheta;
214
215			// set the tolerance for Euler angles and rotation elements
216
217	tim	1606	theta = acos(std::min(1.0, std::max(-1.0,data_[2][2])));
218	tim	1586	ctheta = data_[2][2];
219			stheta = sqrt(1.0 - ctheta * ctheta);
220
221			// when sin(theta) is close to 0, we need to consider singularity
222			// In this case, we can assign an arbitary value to phi (or psi), and then determine
223			// the psi (or phi) or vice-versa. We'll assume that phi always gets the rotation, and psi is 0
224			// in cases of singularity.
225			// we use atan2 instead of atan, since atan2 will give us -Pi to Pi.
226			// Since 0 <= theta <= 180, sin(theta) will be always non-negative. Therefore, it never
227			// change the sign of both of the parameters passed to atan2.
228
229			if (fabs(stheta) <= oopse::epsilon){
230			psi = 0.0;
231			phi = atan2(-data_[1][0], data_[0][0]);
232			}
233			// we only have one unique solution
234			else{
235			phi = atan2(data_[2][0], -data_[2][1]);
236			psi = atan2(data_[0][2], data_[1][2]);
237			}
238
239			//wrap phi and psi, make sure they are in the range from 0 to 2*Pi
240			if (phi < 0)
241			phi += M_PI;
242
243			if (psi < 0)
244			psi += M_PI;
245
246			myEuler[0] = phi;
247			myEuler[1] = theta;
248			myEuler[2] = psi;
249
250			return myEuler;
251			}
252	tim	1563
253	tim	1594	/** Returns the determinant of this matrix. */
254			Real determinant() const {
255			Real x,y,z;
256
257			x = data_[0][0] * (data_[1][1] * data_[2][2] - data_[1][2] * data_[2][1]);
258			y = data_[0][1] * (data_[1][2] * data_[2][0] - data_[1][0] * data_[2][2]);
259			z = data_[0][2] * (data_[1][0] * data_[2][1] - data_[1][1] * data_[2][0]);
260
261			return(x + y + z);
262			}
263	tim	1822
264			/** Returns the trace of this matrix. */
265			Real trace() const {
266			return data_[0][0] + data_[1][1] + data_[2][2];
267			}
268	tim	1594
269	tim	1563	/**
270			* Sets the value of this matrix to the inversion of itself.
271			* @note since simple algorithm can be applied to inverse the 3 by 3 matrix, we hide the
272			* implementation of inverse in SquareMatrix class
273			*/
274	tim	1695	SquareMatrix3<Real> inverse() const {
275	tim	1594	SquareMatrix3<Real> m;
276			double det = determinant();
277			if (fabs(det) <= oopse::epsilon) {
278			//"The method was called on a matrix with \|determinant\| <= 1e-6.",
279			//"This is a runtime or a programming error in your application.");
280			}
281	tim	1563
282	tim	1594	m(0, 0) = data_[1][1]data_[2][2] - data_[1][2]data_[2][1];
283			m(1, 0) = data_[1][2]data_[2][0] - data_[1][0]data_[2][2];
284			m(2, 0) = data_[1][0]data_[2][1] - data_[1][1]data_[2][0];
285			m(0, 1) = data_[2][1]data_[0][2] - data_[2][2]data_[0][1];
286			m(1, 1) = data_[2][2]data_[0][0] - data_[2][0]data_[0][2];
287			m(2, 1) = data_[2][0]data_[0][1] - data_[2][1]data_[0][0];
288			m(0, 2) = data_[0][1]data_[1][2] - data_[0][2]data_[1][1];
289			m(1, 2) = data_[0][2]data_[1][0] - data_[0][0]data_[1][2];
290			m(2, 2) = data_[0][0]data_[1][1] - data_[0][1]data_[1][0];
291
292			m /= det;
293			return m;
294	tim	1592	}
295	tim	1616	/**
296			* Extract the eigenvalues and eigenvectors from a 3x3 matrix.
297			* The eigenvectors (the columns of V) will be normalized.
298			* The eigenvectors are aligned optimally with the x, y, and z
299			* axes respectively.
300			* @param a symmetric matrix whose eigenvectors are to be computed. On return, the matrix is
301			* overwritten
302			* @param w will contain the eigenvalues of the matrix On return of this function
303			* @param v the columns of this matrix will contain the eigenvectors. The eigenvectors are
304			* normalized and mutually orthogonal.
305			* @warning a will be overwritten
306			*/
307			static void diagonalize(SquareMatrix3<Real>& a, Vector3<Real>& w, SquareMatrix3<Real>& v);
308			};
309			/*=========================================================================
310	tim	1569
311	tim	1616	Program: Visualization Toolkit
312			Module: $RCSfile: SquareMatrix3.hpp,v $
313	tim	1592
314	tim	1616	Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
315			All rights reserved.
316			See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
317	tim	1594
318	tim	1616	This software is distributed WITHOUT ANY WARRANTY; without even
319			the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
320			PURPOSE. See the above copyright notice for more information.
321	tim	1594
322	tim	1616	=========================================================================*/
323			template<typename Real>
324			void SquareMatrix3<Real>::diagonalize(SquareMatrix3<Real>& a, Vector3<Real>& w,
325			SquareMatrix3<Real>& v) {
326			int i,j,k,maxI;
327			Real tmp, maxVal;
328			Vector3<Real> v_maxI, v_k, v_j;
329	tim	1594
330	tim	1616	// diagonalize using Jacobi
331			jacobi(a, w, v);
332			// if all the eigenvalues are the same, return identity matrix
333			if (w[0] == w[1] && w[0] == w[2] ) {
334			v = SquareMatrix3<Real>::identity();
335			return;
336			}
337	tim	1594
338	tim	1616	// transpose temporarily, it makes it easier to sort the eigenvectors
339			v = v.transpose();
340
341			// if two eigenvalues are the same, re-orthogonalize to optimally line
342			// up the eigenvectors with the x, y, and z axes
343			for (i = 0; i < 3; i++) {
344			if (w((i+1)%3) == w((i+2)%3)) {// two eigenvalues are the same
345			// find maximum element of the independant eigenvector
346			maxVal = fabs(v(i, 0));
347			maxI = 0;
348			for (j = 1; j < 3; j++) {
349			if (maxVal < (tmp = fabs(v(i, j)))){
350			maxVal = tmp;
351			maxI = j;
352			}
353			}
354
355			// swap the eigenvector into its proper position
356			if (maxI != i) {
357			tmp = w(maxI);
358			w(maxI) = w(i);
359			w(i) = tmp;
360	tim	1594
361	tim	1616	v.swapRow(i, maxI);
362			}
363			// maximum element of eigenvector should be positive
364			if (v(maxI, maxI) < 0) {
365			v(maxI, 0) = -v(maxI, 0);
366			v(maxI, 1) = -v(maxI, 1);
367			v(maxI, 2) = -v(maxI, 2);
368			}
369	tim	1594
370	tim	1616	// re-orthogonalize the other two eigenvectors
371			j = (maxI+1)%3;
372			k = (maxI+2)%3;
373	tim	1594
374	tim	1616	v(j, 0) = 0.0;
375			v(j, 1) = 0.0;
376			v(j, 2) = 0.0;
377			v(j, j) = 1.0;
378	tim	1594
379	tim	1616	/** @todo */
380			v_maxI = v.getRow(maxI);
381			v_j = v.getRow(j);
382			v_k = cross(v_maxI, v_j);
383			v_k.normalize();
384			v_j = cross(v_k, v_maxI);
385			v.setRow(j, v_j);
386			v.setRow(k, v_k);
387	tim	1594
388
389	tim	1616	// transpose vectors back to columns
390			v = v.transpose();
391			return;
392			}
393			}
394	tim	1594
395	tim	1616	// the three eigenvalues are different, just sort the eigenvectors
396			// to align them with the x, y, and z axes
397	tim	1594
398	tim	1616	// find the vector with the largest x element, make that vector
399			// the first vector
400			maxVal = fabs(v(0, 0));
401			maxI = 0;
402			for (i = 1; i < 3; i++) {
403			if (maxVal < (tmp = fabs(v(i, 0)))) {
404			maxVal = tmp;
405			maxI = i;
406			}
407			}
408	tim	1594
409	tim	1616	// swap eigenvalue and eigenvector
410			if (maxI != 0) {
411			tmp = w(maxI);
412			w(maxI) = w(0);
413			w(0) = tmp;
414			v.swapRow(maxI, 0);
415			}
416			// do the same for the y element
417			if (fabs(v(1, 1)) < fabs(v(2, 1))) {
418			tmp = w(2);
419			w(2) = w(1);
420			w(1) = tmp;
421			v.swapRow(2, 1);
422			}
423	tim	1594
424	tim	1616	// ensure that the sign of the eigenvectors is correct
425			for (i = 0; i < 2; i++) {
426			if (v(i, i) < 0) {
427			v(i, 0) = -v(i, 0);
428			v(i, 1) = -v(i, 1);
429			v(i, 2) = -v(i, 2);
430	tim	1592	}
431	tim	1616	}
432	tim	1563
433	tim	1616	// set sign of final eigenvector to ensure that determinant is positive
434			if (v.determinant() < 0) {
435			v(2, 0) = -v(2, 0);
436			v(2, 1) = -v(2, 1);
437			v(2, 2) = -v(2, 2);
438			}
439
440			// transpose the eigenvectors back again
441			v = v.transpose();
442			return ;
443			}
444	tim	1695
445			/**
446			* Return the multiplication of two matrixes (m1 * m2).
447			* @return the multiplication of two matrixes
448			* @param m1 the first matrix
449			* @param m2 the second matrix
450			*/
451			template<typename Real>
452			inline SquareMatrix3<Real> operator *(const SquareMatrix3<Real>& m1, const SquareMatrix3<Real>& m2) {
453			SquareMatrix3<Real> result;
454
455			for (unsigned int i = 0; i < 3; i++)
456			for (unsigned int j = 0; j < 3; j++)
457			for (unsigned int k = 0; k < 3; k++)
458			result(i, j) += m1(i, k) * m2(k, j);
459
460			return result;
461			}
462
463	tim	1804	template<typename Real>
464			inline SquareMatrix3<Real> outProduct(const Vector3<Real>& v1, const Vector3<Real>& v2) {
465			SquareMatrix3<Real> result;
466
467			for (unsigned int i = 0; i < 3; i++) {
468			for (unsigned int j = 0; j < 3; j++) {
469			result(i, j) = v1[i] * v2[j];
470			}
471			}
472
473			return result;
474			}
475
476
477	tim	1592	typedef SquareMatrix3<double> Mat3x3d;
478			typedef SquareMatrix3<double> RotMat3x3d;
479	tim	1586
480			} //namespace oopse
481			#endif // MATH_SQUAREMATRIX_HPP
482	tim	1616