The Honeycomb Problem on the Sphere

Abstract

The honeycomb problem on the sphere asks for the perimeter-minimizing partition of the sphere into N equal areas. This article solves the problem when N=12. The unique minimizer is a tiling of 12 regular pentagons in the dodecahedral arrangement.

Cited by in corpus (2)

• Nodal domains, spectral minimal partitions, and their relation to Aharonov-Bohm operators
• Why is a soap bubble like a railway?