pith. sign in

arxiv: 1606.02873 · v1 · pith:VEMSH2SGnew · submitted 2016-06-09 · 🧮 math.OC

Partitions of Minimal Length on Manifolds

classification 🧮 math.OC
keywords resultsmanifoldspartitionsrelaxedalgorithmalreadyapproximationcase
0
0 comments X
read the original abstract

We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those already present in the literature in the case of the sphere. For general surfaces we provide an optimization algorithm on meshes which can give a good approximation of the optimal cost, starting from the results obtained using the relaxed formulation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.