Abstract. The question of how many regular unit tetrahedra with a vertex at the origin can be packed into the unit sphere is a well-known and difficult problem. The answer is between 20 and 22, and these results are reproduced-here. The classical method for calculating such bounds involves projecting the tetrahedra onto the surface of the sphere, yielding equilateral spherical triangles. Motivated by this, we search for upper and lower bounds on how many equilateral spherical triangles may be arranged on the unit sphere as a function of the spherical angle α between two sides. For α ≥ 2pi 5, we describe some possible arrangements of equilateral spherical triangles on the sphere, but the primary focus of this paper is on pi 3 < α ≤ 2p
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The problem of uniformly placing N points onto a sphere finds applications in many areas. An online ...
Amongst the convex polyhedra with n faces circumscribed about the unit sphere, which has the minimum...
AbstractIn [Covering a triangle with triangles, Amer. Math. Monthly 112 (1) (2005) 78; Cover-up, Geo...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
The tilings of the sphere by polygons have been studied by mathematicians for more than a century. O...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an ed...
This paper describes an algorithm for the generation of tetrahedral mesh of specified element size o...
We consider generalizations of the honeycomb problem to the sphere S2 and seek the perimeter-minim...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an ed...
In an n-dimensional Euclidean, spherical or hyperbolic space consider a packing of at least four sph...
If one has three sticks (lengths), when can you make a triangle with the sticks? As long as any two...
We show that the number of unit-area triangles determined by a set S of n points in the plane is O(n...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The problem of uniformly placing N points onto a sphere finds applications in many areas. An online ...
Amongst the convex polyhedra with n faces circumscribed about the unit sphere, which has the minimum...
AbstractIn [Covering a triangle with triangles, Amer. Math. Monthly 112 (1) (2005) 78; Cover-up, Geo...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
The tilings of the sphere by polygons have been studied by mathematicians for more than a century. O...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an ed...
This paper describes an algorithm for the generation of tetrahedral mesh of specified element size o...
We consider generalizations of the honeycomb problem to the sphere S2 and seek the perimeter-minim...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an ed...
In an n-dimensional Euclidean, spherical or hyperbolic space consider a packing of at least four sph...
If one has three sticks (lengths), when can you make a triangle with the sticks? As long as any two...
We show that the number of unit-area triangles determined by a set S of n points in the plane is O(n...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The problem of uniformly placing N points onto a sphere finds applications in many areas. An online ...
Amongst the convex polyhedra with n faces circumscribed about the unit sphere, which has the minimum...