Search results
Results from the WOW.Com Content Network
Download as PDF; Printable version; In other projects Wikidata item; ... This is a list of tessellations. This list is incomplete; you can help by adding missing items.
Example tessellation based on a Type 1 hexagonal tile. In its simplest form, the criterion simply states that any hexagon with a pair of opposite sides that are parallel and congruent will tessellate the plane. [8] In Gardner's article, this is called a type 1 hexagon. [7] This is also true of parallelograms.
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.
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.
Let be a metric space with distance function .Let be a set of indices and let () be a tuple (indexed collection) of nonempty subsets (the sites) in the space .The Voronoi cell, or Voronoi region, , associated with the site is the set of all points in whose distance to is not greater than their distance to the other sites , where is any index different from .
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).
It is an example of the more general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space. Honeycombs are usually constructed in ordinary Euclidean ("flat") space.
In geometry, a domino tiling of a region in the Euclidean plane is a tessellation of the region by dominoes, shapes formed by the union of two unit squares meeting edge-to-edge. Equivalently, it is a perfect matching in the grid graph formed by placing a vertex at the center of each square of the region and connecting two vertices when they ...