Rigidity controllable as-rigid-as-possible shape deformation

被引:20
|
作者
Chen, Shu-Yu [1 ,2 ]
Gao, Lin [1 ]
Lai, Yu-Kun [3 ]
Xia, Shihong [1 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Beijing Key Lab Mobile Comp & Pervas Device, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Beijing, Peoples R China
[3] Cardiff Univ, Sch Comp Sci & Informat, Cardiff, S Glam, Wales
基金
中国国家自然科学基金;
关键词
Shape deformation; Rigidity; Neighborhood; Geometric modeling; As rigid as possible; SKELETON;
D O I
10.1016/j.gmod.2017.02.005
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Shape deformation is one of the fundamental techniques in geometric processing. One principle of deformation is to preserve the geometric details while distributing the necessary distortions uniformly. To achieve this, state-of-the-art techniques deform shapes in a locally as-rigid-as-possible (ARAP) manner. Existing ARAP deformation methods optimize rigid transformations in the 1-ring neighborhoods and maintain the consistency between adjacent pairs of rigid transformations by single overlapping edges. In this paper, we make one step further and propose to use larger local neighborhoods to enhance the consistency of adjacent rigid transformations. This is helpful to keep the geometric details better and distribute the distortions more uniformly. Moreover, the size of the expanded local neighborhoods provides an intuitive parameter to adjust physical stiffness. The larger the neighborhood is, the more rigid the material is. Based on these, we propose a novel rigidity controllable mesh deformation method where shape rigidity can be flexibly adjusted. The size of the local neighborhoods can be learned from datasets of deforming objects automatically or specified by the user, and may vary over the surface to simulate shapes composed of mixed materials. Various examples are provided to demonstrate the effectiveness of our method. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:13 / 21
页数:9
相关论文
共 50 条
  • [21] Hierarchical mesh-to-points as-rigid-as-possible registration
    Bourquat, Pierre
    Coeurjolly, David
    Damiand, Guillaume
    Dupont, Florent
    [J]. COMPUTERS & GRAPHICS-UK, 2022, 102 : 320 - 328
  • [22] As-rigid-as-possible solid simulation with oriented particles
    Choi, Min Gyu
    Lee, Jehee
    [J]. COMPUTERS & GRAPHICS-UK, 2018, 70 : 1 - 7
  • [23] Smooth Rotation Enhanced As-Rigid-As-Possible Mesh Animation
    Levi, Zohar
    Gotsman, Craig
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2015, 21 (02) : 264 - 277
  • [24] As-rigid-as-possible volume tracking for time-varying surfaces
    Dvorak, Jan
    Kacerekova, Zuzana
    Vanecek, Petr
    Hruda, Lukas
    Vasa, Libor
    [J]. COMPUTERS & GRAPHICS-UK, 2022, 102 : 329 - 338
  • [25] As-rigid-as-possible volume tracking for time-varying surfaces
    Dvořák, Jan
    Káčereková, Zuzana
    Vaněček, Petr
    Hruda, Lukáš
    Váša, Libor
    [J]. Computers and Graphics (Pergamon), 2022, 102 : 329 - 338
  • [26] As-rigid-as-possible mosaicking and serial section registration of large ssTEM datasets
    Saalfeld, Stephan
    Cardona, Albert
    Hartenstein, Volker
    Tomancak, Pavel
    [J]. BIOINFORMATICS, 2010, 26 (12) : i57 - i63
  • [27] ART-RRT: As-Rigid-As-Possible exploration of ligand unbinding pathways
    Nguyen, Minh Khoa
    Jaillet, Leonard
    Redon, Stephane
    [J]. JOURNAL OF COMPUTATIONAL CHEMISTRY, 2018, 39 (11) : 665 - 678
  • [28] As-Rigid-As-Possible Stereo under Second Order Smoothness Priors
    Zhang, Chi
    Li, Zhiwei
    Cai, Rui
    Chao, Hongyang
    Rui, Yong
    [J]. COMPUTER VISION - ECCV 2014, PT II, 2014, 8690 : 112 - 126
  • [29] ART–RRT: As-Rigid-As-Possible search for protein conformational transition paths
    Minh Khoa Nguyen
    Léonard Jaillet
    Stéphane Redon
    [J]. Journal of Computer-Aided Molecular Design, 2019, 33 : 705 - 727
  • [30] ART-RRT: As-Rigid-As-Possible search for protein conformational transition paths
    Minh Khoa Nguyen
    Jaillet, Leonard
    Redon, Stephane
    [J]. JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 2019, 33 (08) : 705 - 727