4.6 Article

Quaternion to Euler angles conversion: A direct, general and computationally efficient method

期刊

PLOS ONE
卷 17, 期 11, 页码 -

出版社

PUBLIC LIBRARY SCIENCE
DOI: 10.1371/journal.pone.0276302

关键词

-

资金

  1. Aix Marseille university
  2. CNRS
  3. National agency for research (ANR OrigaBot project) [ANR-18-CE330008-0]

向作者/读者索取更多资源

This paper presents a general formula for converting a rotation quaternion to Euler angles, which works with all possible sequences of rotations. It also provides a comparison with a popular matrix-to-Euler angle algorithm and demonstrates a faster execution speed of 30 times. The algorithm's conciseness and straightforward implementation make it highly appealing.
Current methods of the conversion between a rotation quaternion and Euler angles are either a complicated set of multiple sequence-specific implementations, or a complicated method relying on multiple matrix multiplications. In this paper a general formula is presented for extracting the Euler angles in any desired sequence from a unit quaternion. This is a direct method, in that no intermediate conversion step is required (no quaternion-to-rotation matrix conversion, for example) and it is general because it works with all 12 possible sequences of rotations. A closed formula was first developed for extracting angles in any of the 12 possible sequences, both Proper Euler angles and Tait-Bryan angles. The resulting algorithm was compared with a popular implementation of the matrix-to-Euler angle algorithm, which involves a quaternion-to-matrix conversion in the first computational step. Lastly, a single-page pseudo-code implementation of this algorithm is presented, illustrating its conciseness and straightforward implementation. With an execution speed 30 times faster than the classical method, our algorithm can be of great interest in every aspect.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据