74
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

Planar clusters and perimeter bounds

&
Pages 1333-1345 | Received 28 Jun 2004, Accepted 25 Aug 2004, Published online: 21 Feb 2007
 

Abstract

We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane (theorem 3.1). Along the way, inside the hexagonal honeycomb, we provide minimizers for each n (theorem 2.7).

Acknowledgments

Heppes thanks the Hungarian Research Foundation OTKA (grant numbers T037752 and T038397) for partial support of his research. Morgan thanks the Rényi Institute (December, 2002) and the National Science Foundation for partial support.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.