arXiv · math/0211234
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Thomas C. Hales. 2002-11-15. The Honeycomb Problem on the Sphere. https://arxiv.org/abs/math/0211234
Cite the original work for its findings. Save a collection to share your selection of sources.