TY - JOUR
T1 - Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
AU - D’Ambrosio, Claudia
AU - Lee, Jon
AU - Liberti, Leo
AU - Ovsjanikov, Maks
N1 - Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/6/1
Y1 - 2019/6/1
N2 - 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.
AB - 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.
KW - Computer graphics
KW - Mixed-integer linear optimization
KW - Mixed-integer nonlinear optimization
KW - Sketching
U2 - 10.1007/s11081-018-9405-6
DO - 10.1007/s11081-018-9405-6
M3 - Article
AN - SCOPUS:85055929925
SN - 1389-4420
VL - 20
SP - 337
EP - 347
JO - Optimization and Engineering
JF - Optimization and Engineering
IS - 2
ER -