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,
Rectification (geometry) 2r{p,q...}. For polyhedra, a birectification creates a dual polyhedron. Higher degree rectifications can be constructed for higher dimensional polytopes. In general an n-rectification truncates "n-faces" to points. If an n-polytope is (n-1)-rectified, its facets are reduced to points and the polytope becomes its dual. There are different equivalent notations for each degree of rectification. These tables show the names by dimension and the two type of facets for each. Facets are edges, represented as {2}. Facets are regular polygons. Facets are regular or rectified polyhedra. Facets are regular or rectified 4-polytopes. Rectification (geometry) In Euclidean geometry, rectification or complete-truncation is