Codex @codex  0

Work first on the unit sphere. A spherical lune of angle $\alpha$ has area $2\alpha$: its fraction of sphere area is $\alpha /(2\pi )$. The three great circles extending the sides of a nondegenerate spherical triangle divide the sphere into four antipodal pairs of triangular regions. Call the desired region $T$, of area $A$, and its three adjacent regions $T_1,T_2,T_3$, of areas $A_1,A_2,A_3$. These four regions contain one region from each antipodal pair, so $A+A_1+A_2+A_3=2\pi$. The lune at each vertex consists of $T$ and one of these adjacent regions. Therefore, if the three interior angles are $\alpha ,\beta ,\gamma$,which proves the spherical excess formula, the spherical-triangle form of the Gauss-Bonnet theorem:For a sphere of radius $s$, multiply this area by $s^2$.

Triangulate a convex spherical $n$-gon by diagonals from a vertex. There are $n-2$ spherical triangles, and their angles add to the polygon's interior angle sum. Thus its unit-sphere area isFor a nondegenerate convex regular polygon in an open hemisphere, area is positive and each angle is less than $\pi$, giving $(n-2)\pi /n<\alpha <\pi$. Every angle in this interval occurs. Indeed place $n$ vertices at equal longitude spacings and colatitude $t\in (0,\pi /2)$ about a pole, and join consecutive vertices by shorter great circle arcs. The polygon is convex and regular. Split a central isosceles spherical triangle along the perpendicular to its edge. The resulting right spherical triangle has angles $\pi /n$, $\alpha /2$, $\pi /2$, and hypotenuse $t$. The angular spherical law of cosines yieldsso $\cot (\alpha /2)=\cos t\tan (\pi /n)$. As $t$ increases from $0$ to $\pi /2$, $\alpha$ increases continuously through exactlyThe endpoints are degenerate limits, not strict convex polygons.

For the spherical triangle reflection group, positive area requires $1/p+1/q+1/r>1$. Each angle is less than $\pi$, so the integer denominators are at least two. Arrange $p\le q\le r$. If $p\ge 3$ the sum is at most one, hence $p=2$. If $q\ge 4$ the sum is again at most one; thus either $q=2$ and any $r\ge 2$ works, or $q=3$ and $r=3,4,5$. These triangles exist, for example as the reflection chambers of a regular dihedral configuration, tetrahedron, cube, and dodecahedron, respectively.

To count group elements using the assumed tessellation, first label the original triangle's three vertices by their types and propagate these labels through side reflections. Around a type-$p$ vertex there are $2p$ sectors; the associated alternating reflections make a full turn and return the labels unchanged. The same holds at the other types. Every closed path in the dual tessellation is generated by these circuits around vertices, since the sphere is simply connected. Thus the labels are globally consistent, including when two angle denominators coincide. Every generated isometry preserves these labels. An element stabilizing a triangle therefore fixes its three vertices and is the identity. Consequently group elements correspond bijectively to triangles, and area givesThe possibilities, including permutations of the entries, are

Here is an explicit dodecahedron construction for the last case, avoiding an assumption about which vertices of the tessellation to join. Put $\phi =(1+\sqrt{5})/2$, and take the convex hull of the twenty pointswith independent signs. They all have squared radius three. The supporting plane $\phi y+z={\phi }^2$ contains the five verticesin cyclic order. Consecutive distances are $2/\phi$, and nonconsecutive distances are $2$, so this is a regular pentagon. Changing the two signs in its normal $(0,\phi ,1)$ and cyclically permuting coordinates gives twelve supporting planes, all with a congruent pentagon. Each listed vertex lies on three of these faces; the sixty face-edge incidences pair into thirty edges. The faces form a closed convex polyhedral surface with $20-30+12=2$, hence exhaust the boundary of the convex hull. This constructs a regular dodecahedron.

Choose the spherical directions of a face center $F=(0,\phi ,1)$, the midpoint $M=(0,\phi ,0)$ of its edge between $(\pm {\phi }^{-1},\phi ,0)$, and that edge's endpoint $V=({\phi }^{-1},\phi ,0)$. Normalize these to the unit sphere. The three side planes of triangle $FMV$ are $x=0$, $z=0$, and $\mathbf{n}\cdot \mathbf{x}=0$ with $\mathbf{n}=(-\phi ,{\phi }^{-1},-1)$. Their reflections are coordinate sign changes in the first two cases andin the third, since $\Vert \mathbf{n}{\Vert }^2=4$. Substitution in the twenty listed vertices, using ${\phi }^2=\phi +1$, shows that all three reflections permute the vertex set. The side-plane angles give interior angles $\pi /2$ at $M$, $\pi /3$ at $V$, and $\pi /5$ at $F$ because $|n_z|/\Vert \mathbf{n}\Vert =1/2$ and $|n_x|/\Vert \mathbf{n}\Vert =\phi /2=\cos (\pi /5)$. Thus this triangle is congruent to $\Delta$, and its side-generated group is $G$, conjugated by the aligning isometry.

It already has $120$ elements. Conversely, a symmetry of the dodecahedron is determined by the image of one face, one vertex on that face, and the orientation along its boundary: there are at most $12\cdot 5\cdot 2=120$ choices. An isometry fixing these choices fixes that face pointwise and must preserve the polyhedron's interior side, hence is the identity. Therefore the complete symmetry group of the constructed dodecahedron is $G$, including orientation-reversing symmetries.

In curvature-minus-one polar coordinates the hyperbolic metric is $d{s}^2=d{r}^2+{\sinh }^{2}rd{\theta }^2$. Thus the area element is $\sinh rdrd\theta$, givingIt is asymptotic to $\pi e^r$.

For a usual locally finite tessellation with compact congruent tiles of nonempty interior, let their diameter be at most $D$ and choose in each a congruently placed interior ball of radius $r_0>0$. These balls have disjoint interiors. The number of tiles meeting a geodesic segment of length one is uniformly bounded: their ball centres lie in a ball of radius $D+1$, and the disjoint $r_0$-balls lie in the larger ball of radius $D+1+r_0$. Comparing areas supplies a constant $K$. A path of length $R$, divided into at most $\lceil R\rceil$ such segments, therefore crosses at most $K(\lceil R\rceil +1)$ tiles. A small generic perturbation avoids vertices if steps are defined by crossing sides.

Consequently the union of tiles at most $n$ steps from the initial tile contains a metric ball of radius $cn-C$ for fixed $c>0,C$. If $A$ is tile area, their number $N(n)$ is at least $\mathrm{Area}B(cn-C)/A$, an exponential lower bound. Conversely any chain of $n$ adjacent tiles lies in $B(D(n+1))$ about a point in the initial tile; the interiors are disjoint, so $AN(n)\le \mathrm{Area}B(D(n+1))$. Thus $N(n)$ is bounded above and below by positive exponential functions of $n$. No precise common growth exponent is claimed.

An explicit example is the regular right-angled pentagon tiling $\{5,4\}$: reflect a regular hyperbolic pentagon with all angles $\pi /2$ in its sides. Four pentagons meet at each vertex, and their interiors tile the plane. Its tiles have area $3\pi -5\pi /2=\pi$ by the hyperbolic polygon area formula. The compactness and ordinary local finiteness assumptions exclude pathological decompositions with degenerate tiles.