Aperiodic set of prototiles seen on the list of aperiodic sets of tiles. The underlying undecidability of the domino problem implies that there exists no systematic procedure for deciding whether a given set of tiles can tile the plane. Polygons are plane figures which are bounded by straight line segments. Regular polygons have all sides of equal length as well as all angles of equal measure. As early as AD 325, Pappus of Alexandria knew that only 3 types of regular polygons (the square, equilateral triangle, and hexagon) can fit perfectly together in repeating tessellations on a Euclidean plane. Within that plane, every triangle,
Coxeter decompositions of hyperbolic polygons 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 formula_1, where formula_2 is the number of times the formula_3th angle is broken up, the triangle ABC can be written as formula_4. Several properties of these fundamental polygons are known for hyperbolic triangles. Quadrilaterals may also have Coxeter decompositions. Coxeter decompositions of hyperbolic polygons A Coxeter decomposition of a polygon is