Planar Clusters
度量几何
2007-05-23 v1
摘要
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 .
引用
@article{arxiv.math/0406031,
title = {Planar Clusters},
author = {Aladar Heppes and Frank Morgan},
journal= {arXiv preprint arXiv:math/0406031},
year = {2007}
}
备注
13 pages