Geometric computing with Clifford algebras: theoretical foundations and applications in computer vision and robotics
Computer Vision
Geometric Algebra for Computer Science: An Object-Oriented Approach to Geometry (The Morgan Kaufmann Series in Computer Graphics)
Computing Helmert transformations
Journal of Computational and Applied Mathematics
Exact, robust and efficient full visibility computation in Plücker space
The Visual Computer: International Journal of Computer Graphics
Computing upper and lower bounds of rotation angles from digital images
Pattern Recognition
Properties and applications of the simplified generalized perpendicular bisector
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
An algorithm to decompose n-dimensional rotations into planar rotations
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Properties and applications of the simplified generalized perpendicular bisector
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Hi-index | 0.00 |
In this paper, the decomposition of nD-rotations is studied. Using this decomposition, nD-rotations are classified and properties are underlined. A generalization of the algorithm previously presented by the authors to decompose nD-rotation into planar rotations is proposed. Since our framework includes experimental applications, we designed a method that is somewhat robust to noise. An alternate algorithm based on the Schur decomposition is investigated. A comparison between both methods is finally provided.