Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization

被引:0
作者
Claudia D’Ambrosio
Jon Lee
Leo Liberti
Maks Ovsjanikov
机构
[1] CNRS LIX,École Polytechnique
[2] University of Michigan,Department of IOE
来源
Optimization and Engineering | 2019年 / 20卷
关键词
Mixed-integer nonlinear optimization; Mixed-integer linear optimization; Computer graphics; Sketching; 90C11; 90C26;
D O I
暂无
中图分类号
学科分类号
摘要
We present several mathematical-optimization formulations for a problem that commonly occurs in geometry processing and specifically in the design of so-called smooth direction fields on surfaces. This problem has direct applications in 3D shape parameterization, texture mapping, and shape design via rough concept sketches, among many others. A key challenge in this setting is to design a set of unit-norm directions, on a given surface, that satisfy some prescribed constraints and vary smoothly. This naturally leads to mixed-integer optimization formulations, because the smoothness needs to be formulated with respect to angle-valued variables, which to compare one needs to fix the discrete jump between nearby points. Previous works have primarily attacked this problem via a greedy ad-hoc strategy with a specialized solver. We demonstrate how the problem can be cast in a standard mathematical-optimization form, and we suggest several relaxations that are especially adapted to modern mathematical-optimization solvers.
引用
收藏
页码:337 / 347
页数:10
相关论文
共 51 条
  • [1] Bonami P(2008)An algorithmic framework for convex mixed integer nonlinear programs Discrete Optim 5 186-204
  • [2] Biegler LT(1995)A new method for large-scale box constrained convex quadratic minimization problems Optim Methods Softw 5 57-74
  • [3] Conn AR(2017)Robust hex-dominant mesh generation using field-guided polyhedral agglomeration ACM Trans Graph (TOG) 36 114-24:16
  • [4] Cornuéjols G(2015)Bendfields: regularized curvature fields from rough concept sketches ACM Trans Graph 34 24:1-415
  • [5] Grossmann IE(2015)Instant field-aligned meshes ACM Trans Graph 34 189-67
  • [6] Laird CD(2013)Globally optimal direction fields ACM Trans Graph (TOG) 32 59-140
  • [7] Lee J(2007)On a binary-encoded ILP coloring formulation INFORMS J Comput 19 406-175
  • [8] Lodi A(2005)Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation J Comb Optim 9 59-660
  • [9] Margot F(2018)Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations Math Program. Ser. B 170 121-1485
  • [10] Sawaya N(1976)Computability of global solutions to factorable nonconvex programs: part I—convex underestimating problems Math. Program. 10 147-1253