Planar Clusters
classification
🧮 math.MG
keywords
alongareaboundsclustersencloseequalhexagonalhoneycomb
read the original 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 .
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.