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 edges and faces in orthogonal projections "m"-cubes. In particular this is true for regular polygons with evenly many sides, in which case the parallelograms are all rhombi. The list gives the number of solutions for smaller polygons. The area "A" of a convex regular "n"-sided polygon having side "s", circumradius "R", apothem "a", and perimeter "p" is given by For regular polygons with side "s" = 1, circumradius "R" = 1, or apothem "a" = 1, this produces the following table: (Note that since formula_11 as formula_12, the area when formula_13 is tending to formula_14 as formula_15 grows large.) Of