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,
Hyperbolic geometry to tessellate the hyperbolic plane with regular polygons as faces. There are an infinite number of uniform tilings based on the Schwarz triangles (p q r) where 1/p + 1/q + 1/r < 1, where p,q,r are each orders of reflection symmetry at three points of the fundamental domain triangle, the symmetry group is a hyperbolic triangle group. There are also infinitely many uniform tilings that cannot be generated from Schwarz triangles, some for example requiring quadrilaterals as fundamental domains. Though hyperbolic geometry applies for any surface with a constant negative Gaussian curvature, it is usual to assume a scale