Approximation of Partitions of Least Perimeter by Γ-Convergence: Around Kelvin’s Conjecture

2011/08/22 by Édouard Oudet · 1 citation
Mathematics · Computer Science · #Mathematical Approximation and Integration #Matrix Theory and Algorithms #Mathematical functions and polynomials #Mathematics #Perimeter #Conjecture #Convergence (economics) #Combinatorics #Mathematical analysis #Geometry

paper · doi:10.1080/10586458.2011.565233

openalex publication_date 2011/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

A numerical process to approximate optimal partitions in any dimension is reported. The key idea of the method is to relax the problem into a functional framework based on the famous result of Γ-convergence obtained by Modica and Mortolla.

Citations

• LXIII. On the division of space with minimum partitional area

Cited by

• Weaire–Phelan structure [wikipedia]

Related

• Numerical study of optimal partitioning problems in relation to an anisotropic perimeter
• Gamma-convergence of nonlocal energies for partitions
• Longest minimal length partitions
• A note on non lower semicontinuous perimeter functionals on partitions
• Partitions of Minimal Length on Manifolds