arXiv · math/0406031
Planar Clusters
Abstract
We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane. Along the way, inside the hexagonal honeycomb, we provide minimizers for each n .
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aladar Heppes, Frank Morgan. 2004-06-02. Planar Clusters. https://arxiv.org/abs/math/0406031
Cite the original work for its findings. Save a collection to share your selection of sources.