A tessellation is a covering by tiles with pairwise disjoint interiors; a locally finite tessellation meets any compact set in only finitely many tiles. In a tessellation by congruent compact hyperbolic polygons, the adjacency graph records side-crossing steps. The area growth and bounded tile diameter imply exponential growth of the number of tiles within steps: a unit geodesic segment meets a uniformly bounded number of tiles, by packing congruent interior balls, so a metric ball of radius proportional to lies in the step ball. Conversely the step ball lies in a metric ball of radius proportional to . The regular right-angled pentagons with four around every vertex give the tiling .
A tessellation by rectangular tiles in which no point is a corner of four tiles. In the common lattice version, the tiles are rectangles. The local corner restriction makes existence depend on more than the total area.
Articles by others on the same topic
Tessellation is a geometric concept that refers to the covering of a plane with one or more geometric shapes, called tiles, without any overlaps or gaps. These shapes can be regular polygons, irregular shapes, or even complex figures. The key characteristics of a tessellation are that it must fill the entire surface without leaving any spaces between the tiles and the tiles may be rotated and flipped as long as they fit together seamlessly.