Longest minimal length partitions

Beniamin Bogosel (1) , Edouard Oudet

1 CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique

This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which performs multiple optimizations steps at each iteration to approximate minimal partitions. Using these partitions we compute perturbations of the domain which increase the minimal perimeter. The initialization of the optimal partitioning algorithm uses capacity-constrained Voronoi diagrams. A new algorithm is proposed to identify such diagrams, by computing the gradients of areas and perimeters for the Voronoi cells with respect to the Voronoi points.

Domaines: Optimisation et contrôle [math.OC]

Beniamin Bogosel, Edouard Oudet. Longest minimal length partitions. 2021. ⟨hal-03132237v1⟩