3 ms·
>using a simpler method than computing a full inverse sequence What are you even talking about? Rotations form a group. Any orientation "A" can be reached from
by meindnoch 1y ago
>using a simpler method than computing a full inverse sequence
What are you even talking about? Rotations form a group. Any orientation "A" can be reached from any other orientation "B" with a single rotation. It's an O(1) operation. Always has been. What you wrote makes no sense whatsoever.
- the__alchemist 1y ago#1: BM. #2: His point is that this could be applied compute that single rotation.
- meindnoch 1y agoMakes no sense. Computing the rotation between any two orientations (represented as quaternions) is simply a matter of dividing one quaternion by the other. It's an O(1) operation. It's a non-problem.