z-logo
open-access-imgOpen Access
Linear geometric algebra rotor estimator for efficient mesh deformation
Author(s) -
Wu Jin,
Lopez Mauricio,
Liu Ming,
Zhu Yilong
Publication year - 2020
Publication title -
iet cyber‐systems and robotics
Language(s) - English
Resource type - Journals
ISSN - 2631-6315
DOI - 10.1049/iet-csr.2020.0010
Subject(s) - point cloud , linear algebra , rotation (mathematics) , rotor (electric) , computer science , deformation (meteorology) , kernel (algebra) , algorithm , geometric algebra , mathematics , mathematical optimization , algebra over a field , geometry , artificial intelligence , algebra representation , engineering , pure mathematics , mechanical engineering , physics , meteorology
The authors solve the problem of estimating the best rotation aligning two sets of corresponding vectors (also known as Wahba's problem or point cloud registration). The proposed method is among the fastest methods reported in recent literatures, moreover it is robust to noise, accurate and simpler than most other methods. It is based on solving the linear equations derived from the formulation of the problem in Euclidean Geometric Algebra. The authors show its efficiency in two applications: the as‐rigid‐as‐possible (ARAP) surface modelling and the more smooth rotation enhanced ARAP mesh animation which is the only method capable of deforming surface modes with quality of tetrahedral models. Mesh deformation is a key technique in games, automated construction and robotics. The ARAP technique along with its improved variants, although have been extensively studied, can still not be achieved efficiently. Linear geometric algebra based rotor solution proposed in this study gives another perspective of the kernel problem. This, however, not only improves the real performance of the three‐dimensional mesh deformation, but also provides a brand new computationally efficient solution to the Wahba's problem and point cloud registration, which has been closely related to the automation science and engineering.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here