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 polygon (of order 2"n"): "D", "D", "D", ... It consists of the rotations in "C", together with reflection symmetry in "n" axes that pass through the center. If "n" is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides. If "n" is odd then all axes pass through a vertex and the midpoint of the opposite side. All regular simple polygons (a simple polygon is one that does not intersect itself anywhere) are convex. Those having the same number of sides are also similar. An "n"-sided convex regular polygon