As-rigid-as-possible Efficient Deformation Algorithm for Point Clouds

It is a challenging problem to efficiently deform complex large point clouds in computer graphics.In this paper,a novel non-linear algorithm is presented to achieve as-rigid-as-possible deformation through constraining the rigidity of the local neighborhoods,thus preserving both detail and volume under large deformations.To guarantee the convergence of the numerical solver,the original point clouds is efficiently simplified by clustering,then the deformation is performed on the simplified point clouds and transferred to the original point clouds to obtain the initial result.Furthermore,a dynamic resampling method is introduced to eliminate the redundant points and cracks that often occur during deformations.The experiment data demonstrate that our algorithm is easy to use,efficient and effective in preventing detail distortions and volume changes.