#include "toolFunction.h"
void main()
{
cout<<"=====welcome to study the expressions of rotation in 3D space====="<<endl;
double phi, omiga, kappa;
phi = -0.32148229302237 ; omiga = 1.726224465189316 ; kappa = -1.4092143985971; //corresponding to Y, X and Z axis
EulerAngle eulerAngle;
eulerAngle.phi = phi;
eulerAngle.omiga = omiga;
eulerAngle.kappa = kappa;
printEulerAngle(eulerAngle);
Rmatrix rotateMatrix;
Quaternion quaternion;
cout<<"### X-Y-Z axis rotated to Rmatrix ###"<<endl;
EulerAngle2Rmatrix_X(eulerAngle, rotateMatrix);
printRmatrix(rotateMatrix);
cout<<"### Rmatrix to EulerAngle(X-Y-Z) ###"<<endl;
Rmatrix2EulerAngle_X(rotateMatrix, eulerAngle);
printEulerAngle(eulerAngle);
cout<<"### Rmatrix to Quaternion ###"<<endl;
Rmatrix2Quaternion(rotateMatrix, quaternion);
printQuaternion(quaternion);
cout<<"### Quaternion to Rmatrix ###"<<endl;
Quaternion2Rmatrix(quaternion, rotateMatrix);
printRmatrix(rotateMatrix);
cout<<"### Quaternion to EulerAngle(X-Y-Z) ###"<<endl;
Quaternion2eulerAngle_Y(quaternion, eulerAngle);
printEulerAngle(eulerAngle);
}
空间坐标系之间的旋转表达方式的相互转换
4星 · 超过85%的资源 需积分: 50 43 浏览量
2015-12-28
10:59:37
上传
评论 4
收藏 2KB ZIP 举报
snooby101
- 粉丝: 16
- 资源: 2
最新资源
- python-leetcode面试题解之第157题用Read4读取N个字符-题解.zip
- python-leetcode面试题解之第156题上下翻转二叉树-题解.zip
- python-leetcode面试题解之第155题最小栈-题解.zip
- python-leetcode面试题解之第153题寻找旋转排序数组中的最小值-题解.zip
- python-leetcode面试题解之第152题乘积最大子数组-题解.zip
- python-leetcode面试题解之第151题反转字符串中的单词-题解.zip
- python-leetcode面试题解之第150题逆波兰表达式求值-题解.zip
- python-leetcode面试题解之第149题直线上最多的点数-题解.zip
- python-leetcode面试题解之第148题排序链表-题解.zip
- python-leetcode面试题解之第147题对链表进行插入排序-题解.zip
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈