Now we try to describe the set of all 3D rotations by following the same general template as the 2D case.
The matrix from (3.4) is extended from 2D to 3D, resulting in components:
Thus, we start with DOFs and want to determine what matrices remain as valid rotations. Follow the same three rules from the 2D case. The columns must have unit length. For example,
. This means that the components of each column must lie on a unit sphere. Thus, the unit-length rule reduces the DOFs from to . By following the second rule to ensure perpendicular axes result, the pairwise inner products of the columns must be zero. For example, by choosing the first two columns, the constraint is
We must also apply the rule to the remaining pairs: The second and third columns, and then the first and third columns. Each of these cases eliminates a DOF, resulting in only remaining DOFs. To avoid mirror images, the constraint
is applied, which does not reduce the DOFs.
Finally, we arrive at a set of matrices that must satisfy the algebraic constraints; however, they unfortunately do not fall onto a nice circle or sphere. We only know that there are degrees of rotational freedom, which implies that it should be possible to pick three independent parameters for a 3D rotation, and then derive all elements of (3.14) from them.
Steven M LaValle