Is there an existing algorithm for converting a quaternion representation of a rotation to an Euler angle representation? The rotation order for the Euler representation is known and can be any of the six permutations (i.e. xyz, xzy, yxz, yzx, zxy, zyx). I've seen algorithms for a fixed rotation order (usually the NASA heading, bank, roll convention) but not for arbitrary rotation order.Is there an existing algorithm for converting a
阅读背景：
是否有将四元数旋转转换为欧拉角旋转的算法？
来源：互联网
分享到：
