On a Linear Programming Approach to the Discrete Willmore Boundary Value Problem and Generalizations

DOI10.1007/978-3-642-27413-8_42zbMath1351.49055arXiv1101.0777OpenAlexW1748086961MaRDI QIDQ3111710

Thomas Schoenemann, Simon Masnou, Daniel Cremers

Publication date: 13 January 2012

Published in: Curves and Surfaces (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.0777

zbMATH Keywords

relaxationmean curvatureinteger linear programmingWillmore functionaltotal unimodularity

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Quadratic programming (90C20) Minimal surfaces and optimization (49Q05) Discrete approximations in optimal control (49M25)

Related Items (4)

Total roto-translational variation ⋮ A unified surface geometric framework for feature-aware denoising, hole filling and context-aware completion ⋮ High-order anisotropic diffusion operators in spaces of variable exponents and application to image inpainting and restoration problems ⋮ Convex Lifting-Type Methods for Curvature Regularization

This page was built for publication: On a Linear Programming Approach to the Discrete Willmore Boundary Value Problem and Generalizations