Exploring Local Modifications for Constrained Meshes

被引:61
作者
Deng, Bailin [1 ,2 ]
Bouaziz, Sofien [1 ]
Deuss, Mario [1 ]
Zhang, Juyong [3 ]
Schwartzburg, Yuliy [1 ]
Pauly, Mark [1 ]
机构
[1] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland
[2] Tech Univ Wien, Vienna, Austria
[3] Univ Sci & Technol China, Hefei, Peoples R China
基金
瑞士国家科学基金会; 奥地利科学基金会;
关键词
RECONSTRUCTION; SIGNALS;
D O I
10.1111/cgf.12021
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Mesh editing under constraints is a challenging task with numerous applications in geometric modeling, industrial design, and architectural form finding. Recent methods support constraint-based exploration of meshes with fixed connectivity, but commonly lack local control. Because constraints are often globally coupled, a local modification by the user can have global effects on the surface, making iterative design exploration and refinement difficult. Simply fixing a local region of interest a priori is problematic, as it is not clear in advance which parts of the mesh need to be modified to obtain an aesthetically pleasing solution that satisfies all constraints. We propose a novel framework for exploring local modifications of constrained meshes. Our solution consists of three steps. First, a user specifies target positions for one or more vertices. Our algorithm computes a sparse set of displacement vectors that satisfies the constraints and yields a smooth deformation. Then we build a linear subspace to allow realtime exploration of local variations that satisfy the constraints approximately. Finally, after interactive exploration, the result is optimized to fully satisfy the set of constraints. We evaluate our framework on meshes where each face is constrained to be planar.
引用
收藏
页码:11 / 20
页数:10
相关论文
共 34 条
[1]  
ALLIEZ P., 2003, ACM T GRAPH, V22, P2
[2]   ON AUGMENTED LAGRANGIAN METHODS WITH GENERAL LOWER-LEVEL CONSTRAINTS [J].
Andreani, R. ;
Birgin, E. G. ;
Martinez, J. M. ;
Schuverdt, M. L. .
SIAM JOURNAL ON OPTIMIZATION, 2008, 18 (04) :1286-1309
[3]  
[Anonymous], IEEE SIGNAL PROCESS
[4]  
[Anonymous], 1989, THESIS
[5]  
[Anonymous], 2011, FIXED POINT ALGORITH
[6]   l1-Sparse Reconstruction of Sharp Point Set Surfaces [J].
Avron, Haim ;
Sharf, Andrei ;
Greif, Chen ;
Cohen-Or, Daniel .
ACM TRANSACTIONS ON GRAPHICS, 2010, 29 (05)
[7]   Optimization with Sparsity-Inducing Penalties [J].
Bach, Francis ;
Jenatton, Rodolphe ;
Mairal, Julien ;
Obozinski, Guillaume .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 4 (01) :1-106
[8]  
Bertsekas D. P., 1996, Constrained Optimization and Lagrange Multiplier Methods, V1
[9]   Mixed-Integer Quadrangulation [J].
Bommes, David ;
Zimmer, Henrik ;
Kobbelt, Leif .
ACM TRANSACTIONS ON GRAPHICS, 2009, 28 (03)
[10]   Shape-Up: Shaping Discrete Geometry with Projections [J].
Bouaziz, Sofien ;
Deuss, Mario ;
Schwartzburg, Yuliy ;
Weise, Thibaut ;
Pauly, Mark .
COMPUTER GRAPHICS FORUM, 2012, 31 (05) :1657-1667