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,
Regular polyhedron valleys, enabling them to construct three infinite folded surfaces which they called regular skew polyhedra. Coxeter offered a modified Schläfli symbol {l,m|n} for these figures, with {l,m} implying the vertex figure, with "m" regular "l"-gons around a vertex. The "n" defines "n"-gonal "holes". Their vertex figures are regular skew polygons, vertices zig-zagging between two planes. Finite regular skew polyhedra exist in 4-space. These finite regular skew polyhedra in 4-space can be seen as a subset of the faces of uniform 4-polytopes. They have planar regular polygon faces, but regular skew polygon vertex figures. Two dual solutions are related to the