The Honeycomb Problem on the Sphere
classification
🧮 math.MG
keywords
problemspherehoneycombareasarrangementarticleasksdodecahedral
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.