ALGORITHMS FOR DECOMPOSING 3-D ORTHOGONAL MATRICES INTO PRIMITIVE ROTATIONS

Authors
HERTER T LOTT K
Citation
T. Herter et K. Lott, ALGORITHMS FOR DECOMPOSING 3-D ORTHOGONAL MATRICES INTO PRIMITIVE ROTATIONS, Computers & graphics, 17(5), 1993, pp. 517-527
Citations number
11
Categorie Soggetti
Computer Sciences, Special Topics","Computer Applications & Cybernetics
Journal title
Computers & graphics → ACNP
ISSN journal
00978493
Volume
17
Issue
5
Year of publication
1993
Pages
517 - 527
Database
ISI
SICI code
0097-8493(1993)17:5<517:AFD3OM>2.0.ZU;2-U
Abstract
We consider the problem of decomposing orthogonal homogeneous 4 X 4 ma trices into rotations about the coordinate axes. Based on a generic fo rm of rotation matrices, two universal decomposition algorithms are pr esented. These algorithms provide the ability to handle all possible s equences of rotations in a single, short program. The implementation o f the algorithms in ADA is also presented.