The Honeycomb Problem on the Sphere

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Metric Geometry

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/65665

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0211234
 http://arxiv.org/abs/math/0211234

Collections

arXiv