Longest minimal length partitions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Interfaces and Free Boundaries Année : 2022

Longest minimal length partitions

Résumé

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.
Fichier principal
Vignette du fichier
max_rel_per.pdf (5.96 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03132237 , version 1 (04-02-2021)
hal-03132237 , version 2 (07-06-2021)

Identifiants

Citer

Beniamin Bogosel, Edouard Oudet. Longest minimal length partitions. Interfaces and Free Boundaries, 2022, 24 (1), pp.95-135. ⟨10.4171/IFB/468⟩. ⟨hal-03132237v2⟩
73 Consultations
45 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More