A Coxeter decomposition of a polygon is a decomposition into a finite number of polygons in which any two sharing a side are reflections of each other along that side. Hyperbolic polygons are the analogues of Euclidean polygons in hyperbolic geometry. A hyperbolic n-gon is an area bounded by n segments, rays, or entire straight lines. The standard model for this geometry is the Poincaré disk model. A major difference between Euclidean and hyperbolic polygons is that the sum of internal angles of a hyperbolic polygon is not the same as Euclidean polygons. In particular, the sum of the angles of a hyperbolic triangle is less than 180 degrees. Coxeter decompositions are named after Harold Scott MacDonald Coxeter, an accomplished 20th century geometer. He introduced the Coxeter group, an abstract group generated by reflections. These groups have many uses, including producing the rotations of Platonic solids and tessellating the plane.
Given a polygon P, a group G can be generated by reflecting P around its sides. If the angles of P are /k for natural numbers k, then G will be discrete. A Coxeter decomposition of a polygon is a decomposition into a finite number of polygons in which any two sharing a side are reflections of each other along that side.
The goal of a Coxeter decomposition is to break up a polygon into a composition of congruent triangles reflected on its sides.
If triangle ABC can undergo Coxeter decomposition and has angles
k | ||||
|
ki
i
\left(
k1 | |
q1 |
,
k2 | |
q2 |
,
k3 | |
q3 |
\right)
\left(
k1 | |
q1 |
,
k2 | |
q2 |
,
k3 | |
q3 |
\right)
qi
1
3 | |
-\sum | |
i=1 |
ki | |
qi |
=N\left(1
3 | |
-\sum | |
i=1 |
1 | |
qi |
\right)
q1>q2>q3
N>1
Quadrilaterals may also have Coxeter decompositions.