Search results
Results from the WOW.Com Content Network
Regular Division of the Plane III, woodcut, 1957 - 1958.. Regular Division of the Plane is a series of drawings by the Dutch artist M. C. Escher which began in 1936. These images are based on the principle of tessellation, irregular shapes or combinations of shapes that interlock completely to cover a surface or plane.
The fundamental region is a shape such as a rectangle that is repeated to form the tessellation. [22] For example, a regular tessellation of the plane with squares has a meeting of four squares at every vertex. [18] The sides of the polygons are not necessarily identical to the edges of the tiles.
Tessellations of euclidean and hyperbolic space may also be considered regular polytopes. Note that an 'n'-dimensional polytope actually tessellates a space of one dimension less. For example, the (three-dimensional) platonic solids tessellate the 'two'-dimensional 'surface' of the sphere.
For example, a regular hexagon bisects into two type 1 pentagons. Subdivision of convex hexagons is also possible with three (type 3), four (type 4) and nine (type 3) pentagons. By extension of this relation, a plane can be tessellated by a single pentagonal prototile shape in ways that generate hexagonal overlays. For example:
In geometry, the hexagonal tiling or hexagonal tessellation is a regular tiling of the Euclidean plane, in which exactly three hexagons meet at each vertex. It has Schläfli symbol of {6,3} or t {3,6} (as a truncated triangular tiling).
The union of all edges of a Cairo tiling is the same as the union of two tilings of the plane by hexagons.Each hexagon of one tiling surrounds two vertices of the other tiling, and is divided by the hexagons of the other tiling into four of the pentagons in the Cairo tiling. [4]
Similarly, a k-isohedral tiling has k separate symmetry orbits (it may contain m different face shapes, for m = k, or only for some m < k). [ 6 ] ("1-isohedral" is the same as "isohedral".) A monohedral polyhedron or monohedral tiling ( m = 1) has congruent faces, either directly or reflectively, which occur in one or more symmetry positions.
A shape that is rep-n or irrep-n is trivially also irrep-(kn − k + n) for any k > 1, by replacing the smallest tile in the rep-n dissection by n even smaller tiles. The order of a shape, whether using rep-tiles or irrep-tiles is the smallest possible number of tiles which will suffice.