Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we propose several improvements to a recently proposed framework based on global optimization. We identify and solve an issue with extraneous arcs in the original formulation by introducing region consistency constraints. The mesh geometry is analyzed both from a theoretical and experimental viewpoint and hexagonal meshes are shown to be superior. We demonstrate that adaptively generated meshes significantly improve the performance. Our final contribution is that we generalize the framework to handle mean curvature regularization for 3D surface completion and segmentation. 1 Curvature in Vision The problem we are interested in solving amounts to minimizing the following energy functional: E(R) = R g(x) dx + ∂R λ + γκ(x)2 dA(x), (1) where R is the 2D (or 3D) foreground region with boundary ∂R. Here g(x) is...