Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Longest minimal length partitions

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03132237
Contributor : Beniamin Bogosel <>
Submitted on : Monday, June 7, 2021 - 11:25:43 AM
Last modification on : Wednesday, June 9, 2021 - 3:34:04 AM

File

max_rel_per.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03132237, version 2

Collections

Citation

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

Share

Metrics

Record views

10

Files downloads

4