Related papers: The Honeycomb Problem on the Sphere
This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…
There is only one type of tilings of the sphere by $12$ congruent pentagons. These tilings are isohedral.
The problem of twelve spheres is to understand, as a function of $r \in (0,r_{max}(12)]$, the configuration space of $12$ non-overlapping equal spheres of radius $r$ touching a central unit sphere. It considers to what extent, and in what…
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
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 .
The hexagonal tiling honeycomb is a beautiful structure in 3-dimensional hyperbolic space. It is called {6,3,3} because each hexagon has 6 edges, 3 hexagons meet at each vertex in a Euclidean plane tiled by regular hexagons, and 3 such…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…
We prove that, in the limit as $k \to+ \infty$, the hexagonal honeycomb solves the optimal partition problem in which the criterion is minimizing the largest among the Cheeger constants of $k$ mutually disjoint cells in a planar domain. As…
There are exactly eight edge-to-edge tilings of the sphere by congruent equilateral pentagons: three pentagonal subdivision tilings with 12, 24, 60 tiles; four earth map tilings with 16, 20, 24, 24 tiles; and one flip modification of the…
The Honeycomb Conjecture states that among tilings with unit area cells in the Euclidean plane, the average perimeter of a cell is minimal for a regular hexagonal tiling. This conjecture was proved by L. Fejes T\'oth for convex tilings, and…
A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this…
We show that there are no edge-to-edge tilings of the sphere by congruent pentagons beyond the minimal dodecahedron tiling, such that there is a tile with all vertices having degree 3 and the edge length combinations are three of the five…
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.
We obtain uncountably many periodic solutions to the singular Yamabe problem on a round sphere, that blow up along a great circle. These are (complete) constant scalar curvature metrics on the complement of $S^1$ inside $S^m$, $m\geq 5$,…
The topic of totally separable sphere packings is surveyed with a focus on regular constructions, uniform tilings, and contact number problems. An enumeration of all regular totally separable sphere packings in $\mathbb{R}^2$,…
This paper shows that constraint programming techniques can successfully be used to solve challenging hex-meshing problems. Schneiders' pyramid is a square-based pyramid whose facets are subdivided into three or four quadrangles by adding…