Jump to content

Tessellation

This is a good article. Click here for more information.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Legobot (talk | contribs) at 17:02, 31 May 2015 (Adding Good Article icon). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

"Tessellate" redirects here. For the song by Alt-J, see Tessellate (song). For the computer graphics technique, see Tessellation (computer graphics).
Ceramic Tiles in Marrakech, forming edge-to-edge, regular and other tessellations
A wall sculpture at Leeuwarden celebrating the artistic tessellations of M. C. Escher

A tessellation of a flat surface is the tiling of a plane using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellations can be generalized to higher dimensions and a variety of geometries.

A periodic tiling has a repeating pattern. Some special kinds include regular tilings with regular polygonal tiles all of the same shape, and semi-regular tilings with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An aperiodic tiling uses a small set of tile shapes that cannot form a repeating pattern. In the geometry of higher dimensions, a space filling or honeycomb is also called a tessellation of space.

A real physical tessellation is a tiling made of materials such as cemented ceramic squares or hexagons. Such tilings may be decorative patterns, or may have functions such as providing durable and water-resistant pavement, floor or wall coverings. Historically, tessellations were used in Ancient Rome and in Islamic art such as in the decorative tiling of the Alhambra palace. In the twentieth century, the work of M. C. Escher often made use of tessellations, both in ordinary Euclidean geometry and in hyperbolic geometry, for artistic effect. Tessellations are sometimes employed for decorative effect in quilting. Tessellations form a class of patterns in nature, for example in the arrays of hexagonal cells found in honeycombs.

History

A temple mosaic from the ancient Sumerian city of Uruk IV (3400–3100 BC), showing a tessellation pattern in coloured tiles

Tessellations were used by the Sumerians (about 4000 BC) in building wall decorations formed by patterns of clay tiles.[1]

Decorative mosaic tilings made of small squared blocks called tesserae were widely employed in classical antiquity,[2] sometimes displaying geometric patterns.[3][4]

In 1619 Johannes Kepler made an early documented study of tessellations. He wrote about regular and semiregular tessellations in his Harmonices Mundi; he was possibly the first to explore and to explain the hexagonal structures of honeycomb and snowflakes.[5][6][7]

Roman geometric mosaic

Some two hundred years later in 1891, the Russian crystallographer Yevgraf Fyodorov proved that every periodic tiling of the plane features one of seventeen different groups of isometries.[8][9] Fyodorov's work marked the unofficial beginning of the mathematical study of tessellations. Other prominent contributors include Shubnikov and Belov (1964),[10] and Heinrich Heesch and Otto Kienzle (1963).[11]

Etymology

In Latin, tessella is a small cubical piece of clay, stone or glass used to make mosaics.[12] The word "tessella" means "small square" (from "tessera", square, which in its turn is from the Greek word "τέσσερα" for "four"). It corresponds with the everyday term tiling which refers to applications of tessellations, often made of glazed clay.

Overview

A rhombitrihexagonal tiling: tiled floor of a church in Seville, Spain, using square, triangle and hexagon prototiles

Tessellation or tiling in two dimensions is a topic in geometry that studies how shapes, known as tiles, can be arranged to fill a plane without any gaps, according to a given set of rules. These rules can be varied. Common ones are that there must be no gaps between tiles, and that no corner of one tile can lie along the edge of another.[13] The tessellations created by bonded brickwork do not obey this rule. Among those which do, a regular tessellation has both identical[a] regular tiles and identical regular corners or vertices, having the same angle between adjacent edges for every tile.[14] There are only three shapes that can form such regular tessellations: the equilateral triangle, square, and regular hexagon. Any one of these three shapes can be duplicated infinitely to fill a plane with no gaps.[6]

Many other types of tessellation are possible under different constraints. For example, there are eight types of semi-regular tessellation, made with more than one kind of regular polygon but still having the same arrangement of polygons at every corner.[15] Irregular tessellations can also be made from other shapes such as pentagons, polyominoes and in fact almost any kind of geometric shape. The artist M. C. Escher is famous for making tessellations with irregular interlocking tiles, shaped like animals and other natural objects.[16] If suitable contrasting colours are chosen for the tiles of differing shape, striking patterns are formed, and these can be used to decorate physical surfaces such as church floors.[17]

Elaborate and colourful tessellations of glazed tiles at the Alhambra in Spain

More formally, a tessellation or tiling is a cover of the Euclidean plane by a countable number of closed sets, called tiles, such that the tiles intersect only on their boundaries. These tiles may be polygons or any other shapes.[b] Many tessellations are formed from a finite number of prototiles in which all tiles in the tessellation are congruent to the given prototiles. If a geometric shape can be used as a prototile to create a tessellation, the shape is said to tessellate or to tile the plane. The Conway criterion is a sufficient but not necessary set of rules for deciding if a given shape will tile the plane periodically without reflections: some tiles fail the criterion but still tile the plane.[19] No general rule has been found for determining if a given shape can tile the plane or not, which means there are many unsolved problems concerning tessellations.[18] For example, the types of convex pentagon that can tile the plane remains an unsolved problem.[20]

Mathematically, tessellations can be extended to spaces other than the Euclidean plane.[6] The Swiss geometer Ludwig Schläfli pioneered this by defining polyschemes, which mathematicians nowadays call polytopes; these are the analogues to polygons and polyhedra in spaces with more dimensions. He further defined the Schläfli symbol notation to make it easy to describe polytopes. For example, the Schläfli symbol for an equilateral triangle is {3}, while that for a square is {4}.[21] The Schläfli notation makes it possible to describe tilings compactly. For example, a tiling of regular hexagons has three six-sided polygons at each vertex, so its Schläfli symbol is {6,3}.[22]

Other methods also exist for describing polygonal tilings. When the tessellation is made of regular polygons, the most common notation is the vertex configuration, which is simply a list of the number of sides of the polygons around a vertex. The square tiling has a vertex configuration of 4.4.4.4, or 44. The tiling of regular hexagons is noted 6.6.6, or 63.[18]

In mathematics

Introduction to tessellations

Further information: Tiling by regular polygons, Uniform tiling, and List of convex uniform tilings
The 3.4.6.4 semi-regular tessellation is made with three prototiles: a triangle, a square and a hexagon. Every vertex has a triangle, square, hexagon, square around it, in that order.

Mathematicians use some technical terms when discussing tilings. An edge is the intersection between two bordering tiles; it is often a straight line. A vertex is the point of intersection of three or more bordering tiles. Using these terms, an isogonal or vertex-transitive tiling is a tiling where every vertex point is identical; that is, the arrangement of polygons about each vertex is the same.[18] The fundamental region is a shape such as a rectangle that is repeated to form the tessellation.[23] 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. An edge-to-edge tessellation is any polygonal tessellation where adjacent tiles only share one full side, i.e., no tile shares a partial side or more than one side with any other tile. In an edge-to-edge tessellation, the sides of the polygons and the edges of the tiles are the same. The familiar "brick wall" tiling is not edge-to-edge because the long side of each rectangular brick is shared with two bordering bricks.[18]

A normal tiling is a tessellation for which every tile is topologically equivalent to a disk, the intersection of any two tiles is a single connected set or the empty set, and all tiles are uniformly bounded. This means that a single circumscribing radius and a single inscribing radius can be used for all the tiles in the whole tiling; the condition disallows tiles that are pathologically long or thin.[24]

A monohedral tiling is a tessellation in which all tiles are congruent; it has only one prototile. A particularly interesting type of monohedral tessellation is the spiral monohedral tiling. The first spiral monohedral tiling was discovered by Heinz Voderberg in 1936; the Voderberg tiling has a unit tile that is a nonconvex enneagon.[1] The Hirschhorn tiling, published by Michael D. Hirschhorn and D. C. Hunt in 1985, is a pentagon tiling using irregular pentagons: regular pentagons cannot tile the Euclidean plane as the internal angle of a regular pentagon, 3π/5, is not a divisor of 2π.[25][26][27]

An isohedral tiling is a special variation of a monohedral tiling in which all tiles belong to the same transitivity class, that is, all tiles are transforms of the same prototile under the symmetry group of the tiling.[24] If a prototile admits a tiling, but no such tiling is isohedral, then the prototile is called anisohedral and forms anisohedral tilings.

A regular tessellation is a highly symmetric, edge-to-edge tiling made up of regular polygons, all of the same shape. There are only three regular tessellations: those made up of equilateral triangles, squares, or regular hexagons. All three of these tilings are isogonal and monohedral.[28]

A Pythagorean tiling

A semi-regular (or Archimedean) tessellation uses more than one type of regular polygon in an isogonal arrangement. There are eight semi-regular tilings (or nine if the mirror-image pair of tilings counts as two).[29] These can be described by their vertex configuration; for example, a semi-regular tiling using squares and regular octagons has the vertex configuration 4.82 (each vertex has one square and two octagons).[30] Many non-edge-to-edge tilings of the Euclidean plane are possible, including the family of Pythagorean tilings, tessellations that use two (parameterised) sizes of square, each square touching four squares of the other size.[31]

This tessellated, monohedral street pavement uses curved shapes instead of polygons. It belongs to wallpaper group p3m1.

Wallpaper groups

Main article: Wallpaper group

Tilings with translational symmetry in two independent directions can be categorized by wallpaper groups, of which 17 exist.[32] It has been claimed that all seventeen of these groups are represented in the Alhambra palace in Granada, Spain. Though this is disputed,[33][34] the variety and sophistication of the Alhambra tilings have surprised modern researchers.[35] Of the three regular tilings two are in the p6m wallpaper group and one is in p4m. Tilings in 2D with translational symmetry in just one direction can be categorized by the seven frieze groups describing the possible frieze patterns.[36] Orbifold notation can be used to describe wallpaper groups of the Euclidean plane.[37]

Penrose tilings are aperiodic, lacking translational symmetry.

Aperiodic tilings

Main articles: Aperiodic tiling and List of aperiodic sets of tiles

Penrose tilings, which use two different quadrilaterals, are the best known example of tiles that forcibly create non-periodic patterns. They belong to a general class of aperiodic tilings, which use tiles that cannot tessellate periodically. The recursive process of substitution tiling is a method of generating aperiodic tilings. One class that can be generated in this way is the rep-tiles; these tilings have surprising self-replicating properties.[38] Pinwheel tilings are non-periodic, using a rep-tile construction; the tiles appear in infinitely many orientations.[39] It might be thought that a non-periodic pattern would be entirely without symmetry, but this is not so. Aperiodic tilings, while lacking in translational symmetry, do have symmetries of other types, by infinite repetition of any bounded patch of the tiling and in certain finite groups of rotations or reflections of those patches.[40] A substitution rule, such as can be used to generate some Penrose patterns using assemblies of tiles called rhombs, illustrates scaling symmetry.[41] A Fibonacci word can be used to build an aperiodic tiling, and to study quasicrystals, which are structures with aperiodic order.[42]

A set of 13 Wang tiles that tile the plane only aperiodically

Wang tiles are squares coloured on each edge, and placed so that abutting edges of adjacent tiles have the same colour; hence they are sometimes called Wang dominoes. A suitable set of Wang dominoes can tile the plane, but only aperiodically. This is known because any Turing machine can be represented as a set of Wang dominoes that tile the plane if and only if the Turing machine does not halt. Since the halting problem is undecidable, the problem of deciding whether a Wang domino set can tile the plane is also undecidable.[43][44][45][46][47]

Random Truchet tiling

Truchet tiles are square tiles decorated with patterns so they do not have rotational symmetry; in 1704, Sébastien Truchet used a square tile split into two triangles of contrasting colours. These can tile the plane either periodically or randomly.[48][49]

Tessellations and colour

Further information: four colour theorem
If the colours of this tiling are to form a pattern by repeating this rectangle as the fundamental domain, at least seven colours are required; more generally, at least four colours are needed.

Sometimes the colour of a tile is understood as part of the tiling; at other times arbitrary colours may be applied later. When discussing a tiling that is displayed in colours, to avoid ambiguity one needs to specify whether the colours are part of the tiling or just part of its illustration. This affects whether tiles with the same shape but different colours are considered identical, which in turn affects questions of symmetry. The four colour theorem states that for every tessellation of a normal Euclidean plane, with a set of four available colours, each tile can be coloured in one colour such that no tiles of equal colour meet at a curve of positive length. The colouring guaranteed by the four-colour theorem will not in general respect the symmetries of the tessellation. To produce a colouring which does, it is necessary to treat the colours as part of the tessellation. Here, as many as seven colours may be needed, as in the picture at right.[50]

Tessellations with triangles, quadrilaterals and hexagons

Any triangle or quadrilateral (even non-convex) can be used as a prototile to form a monohedral tessellation, often in more than one way. Copies of an arbitrary quadrilateral can form a tessellation with translational symmetry and 2-fold rotational symmetry with centres at the midpoints of all sides. For an asymmetric quadrilateral this tiling belongs to wallpaper group p2. As fundamental domain we have the quadrilateral. Equivalently, we can construct a parallelogram subtended by a minimal set of translation vectors, starting from a rotational centre. We can divide this by one diagonal, and take one half (a triangle) as fundamental domain. Such a triangle has the same area as the quadrilateral and can be constructed from it by cutting and pasting.[51]

A Voronoi tiling

Voronoi tilings

Voronoi or Dirichlet tilings are tessellations where each tile is defined as the set of points closest to one of the points in a discrete set of defining points. (Think of geographical regions where each region is defined as all the points closest to a given city or post office.)[52][53] The Voronoi cell for each defining point is a convex polygon. The Delaunay triangulation is a tessellation that is the dual graph of a Voronoi tessellation. Delaunay triangulations are useful in numerical simulation, in part because among all possible triangulations of the defining points, Delaunay triangulations maximize the minimum of the angles formed by the edges.[54] Voronoi tilings with randomly-placed points can be used to construct random tilings of the plane.[55]

Tessellating three-dimensional space: the rhombic dodecahedron is one of the solids that can be stacked to fill space exactly.

Tessellations in higher dimensions

Main article: Honeycomb (geometry)
Illustration of a Schmitt-Conway biprism, also called a Schmitt–Conway–Danzer tile.

Tessellation can be extended to three dimensions. Certain polyhedra can be stacked in a regular crystal pattern to fill (or tile) three-dimensional space, including the cube (the only regular polyhedron to do so), the rhombic dodecahedron, and the truncated octahedron.[56] Naturally-occurring rhombic dodecahedra are found as crystals of Andradite (a kind of Garnet) and Fluorite.[57][58]

A Schwarz triangle is a spherical triangle that can be used to tile a sphere.[59]

Tessellations in three or more dimensions are called honeycombs. In three dimensions there is just one regular honeycomb, which has eight cubes at each polyhedron vertex. Similarly, in three dimensions there is just one quasiregular[c] honeycomb, which has eight tetrahedra and six octahedra at each polyhedron vertex. However there are many possible semiregular honeycombs in three dimensions.[60] Uniform polyhedra can be constructed using the Wythoff construction.[61]

The Schmitt-Conway biprism is a convex polyhedron which has the property of tiling space only aperiodically.[62]

Tessellations in non-Euclidean geometries

The regular {3,5,3} icosahedral honeycomb, one of four regular compact honeycombs in hyperbolic 3-space

It is possible to tessellate in non-Euclidean geometries such as hyperbolic geometry. A uniform tiling in the hyperbolic plane (which may be regular, quasiregular or semiregular) is an edge-to-edge filling of the hyperbolic plane, with regular polygons as faces; these are vertex-transitive (transitive on its vertices), and isogonal (there is an isometry mapping any vertex onto any other).[63][64]

A uniform honeycomb in hyperbolic space is a uniform tessellation of uniform polyhedral cells. In 3-dimensional hyperbolic space there are nine Coxeter group families of compact convex uniform honeycombs, generated as Wythoff constructions, and represented by permutations of rings of the Coxeter diagrams for each family.[65]

In art

Further information: Mathematics and fiber arts, Trianglepoint, Quilt, and Quilt block
A quilt showing a regular tessellation pattern.
Roman mosaic floor panel of stone, tile and glass, from a villa near Antioch in Roman Syria. 2nd century A.D.

In architecture, tessellations have been used to create decorative motifs since ancient times. Mosaic tilings often had geometric patterns.[4] Later civilisations also used larger tiles, either plain or individually decorated. Some of the most decorative were the Moorish wall tilings of Islamic architecture, using Girih tiles in buildings such as the Alhambra[66] and La Mezquita.[67]

Tessellations frequently appeared in the graphic art of M. C. Escher; he was inspired by the Moorish use of symmetry in places such as the Alhambra when he visited Spain in 1936.[68] Escher made four "Circle Limit" drawings of tilings which use hyperbolic geometry.[69][70] For his woodcut "Circle Limit IV" (1960), Escher prepared a pencil and ink study showing the required geometry.[71] Escher explained that "No single component of all the series, which from infinitely far away rise like rockets perpendicularly from the limit and are at last lost in it, ever reaches the boundary line."[72]

Tessellated designs often appear on textiles, whether woven, stitched in or printed. Tessellation patterns have been used to design interlocking motifs of patch shapes in quilts.[73][74]

In manufacturing

Tessellation is used in manufacturing industry to reduce the wastage of material (yield losses) such as sheet metal when cutting out shapes for objects like car doors or drinks cans.[75]

In nature

Tessellate pattern in a Colchicum flower
Main article: Patterns in nature

The honeycomb provides a well-known example of tessellation in nature with its hexagonal cells.[76]

In botany, the term "tessellate" describes a checkered pattern, for example on a flower petal, tree bark, or fruit. Flowers including the Fritillary[77] and some species of Colchicum are characteristically tessellate.[78]

Many patterns in nature are formed by cracks in sheets of materials. These patterns can be described by Gilbert tessellations,[79] also known as random crack networks.[80] The Gilbert tessellation is a mathematical model for the formation of mudcracks, needle-like crystals, and similar structures. The model, named after Edgar Gilbert, allows cracks to form starting from randomly scattered over the plane; each crack propagates in two opposite directions along a line through the initiation point, its slope chosen at random, creating a tessellation of irregular convex polygons.[81] Basaltic lava flows often display columnar jointing as a result of contraction forces causing cracks as the lava cools. The extensive crack networks that develop often produce hexagonal columns of lava. One example of such an array of columns is the Giant's Causeway in Northern Ireland.[82] Tessellated pavement, a characteristic example of which is found at Eaglehawk Neck on the Tasman Peninsula of Tasmania, is a rare sedimentary rock formation where the rock has fractured into rectangular blocks.[83]

Other natural patterns occur in foams; these are packed according to Plateau's laws, which require minimal surfaces. Such foams present a problem in how to pack cells as tightly as possible: in 1887, Lord Kelvin proposed a packing using only one solid, the bitruncated cubic honeycomb with very slightly curved faces. In 1993, Denis Weaire and Robert Phelan proposed the Weaire–Phelan structure which uses less surface area to separate cells of equal volume than Kelvin's foam.[84]

Traditional tangram dissection puzzle

Puzzles and recreational mathematics

Main articles: Tiling puzzle and recreational mathematics

Tessellations have given rise to many types of tiling puzzle, from traditional jigsaw puzzles (with irregular pieces of wood or cardboard)[85] and the tangram[86] to more modern puzzles which often have a mathematical basis. For example, polyiamonds and polyominoes are figures of regular triangles and squares, often used in tiling puzzles.[87][88] Authors such as Henry Dudeney and Martin Gardner have made many uses of tessellation in recreational mathematics. For example, Dudeney invented the hinged dissection,[89] while Gardner wrote about the rep-tile, a shape that can be dissected into smaller copies of the same shape.[90][91] Squaring the square is the problem of tiling an integral square (one whose sides have integer length) using only other integral squares.[92][93] An extension is squaring the plane, tiling it by squares whose sizes are all natural numbers without repetitions; James and Frederick Henle proved that this was possible.[94]

Examples

Footnotes

  1. ^ The mathematical term for identical shapes is "congruent" - in mathematics, "identical" means they are the same tile.
  2. ^ The tiles are usually required to be homeomorphic (topologically equivalent) to a closed disk, which means bizarre shapes with holes, dangling line segments or infinite areas are excluded.[18]
  3. ^ In this context, quasiregular means that the cells are regular (solids), and the vertex figures are semiregular.

References

  1. ^ a b Pickover, Clifford A. (2009). The Math Book: From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics. Sterling. p. 372. ISBN 9781402757969.
  2. ^ Dunbabin, Katherine M. D. (2006). Mosaics of the Greek and Roman world. Cambridge University Press. p. 280.
  3. ^ "The Brantingham Geometric Mosaics". Hull City Council. 2008. Retrieved 26 May 2015.
  4. ^ a b Field, Robert (1988). Geometric Patterns from Roman Mosaics. Tarquin. ISBN 978-0-906-21263-9.
  5. ^ Kepler, Johannes (1619). Harmonices Mundi [Harmony of the Worlds]. {{cite book}}: Unknown parameter |titlelink= ignored (|title-link= suggested) (help)
  6. ^ a b c Gullberg 1997, p. 395.
  7. ^ Stewart 2001, p. 13.
  8. ^ Djidjev, Hristo; Potkonjak, Miodrag (2012). "Dynamic Coverage Problems in Sensor Networks" (PDF). Los Alamos National Laboratory. p. 2. Retrieved 6 April 2013.{{cite web}}: CS1 maint: multiple names: authors list (link)
  9. ^ Fyodorov, Y. (1891). "Simmetrija na ploskosti [Symmetry in the plane]". Zapiski Imperatorskogo Sant-Petersburgskogo Mineralogicheskogo Obshchestva [Proceedings of the Imperial St. Petersburg Mineralogical Society], series 2 (in Russian). 28: 245–291.
  10. ^ Shubnikov, Alekseĭ Vasilʹevich; Belov, Nikolaĭ Vasilʹevich (1964). Colored Symmetry. Macmillan.
  11. ^ Heesch, H.; Kienzle, O. (1963). Flächenschluss: System der Formen lückenlos aneinanderschliessender Flächteile (in German). Springer.
  12. ^ "Tessellate". Merriam-Webster Online. Retrieved 26 May 2015.
  13. ^ Conway, R.; Burgiel, H.; Goodman-Strauss, G. (2008). The Symmetries of Things. Peters.{{cite book}}: CS1 maint: multiple names: authors list (link)
  14. ^ Coxeter, H. S. M. (1973). Regular Polytopes (3rd ed.). Dover.
  15. ^ Cundy and Rollett (1961). Mathematical Models (2nd ed.). Oxford. pp. 61–62.
  16. ^ Escher 1974, pp. 11–12, 15–16.
  17. ^ "Basilica di San Marco". Section: Tessellated floor. Basilica di San Marco. Retrieved 26 April 2013.
  18. ^ a b c d e f Grünbaum, Branko; Shephard, G. C. (1987). Tilings and Patterns. New York: W. H. Freeman. p. 59.
  19. ^ Schattschneider, Doris (September 1980). "Will It Tile? Try the Conway Criterion!". Mathematics Magazine. 53 (4): 224–233.
  20. ^ Sugimoto, Teruhisa; Ogawa, Tohru (2000). "Tiling Problem of Convex Pentagon". Forma. 15: 75–79.
  21. ^ Coxeter, H. S. M. (1948). Regular Polytopes. Methuen. pp. 14, 69, 149.
  22. ^ Weisstein, Eric W. "Tessellation". MathWorld.
  23. ^ Emmer, Michele; Schattschneider, Doris (8 May 2007). M.C. Escher’s Legacy: A Centennial Celebration. Springer Berlin Heidelberg. p. 325. ISBN 978-3-540-28849-7.
  24. ^ a b Horne, Clare E. (2000). Geometric Symmetry in Patterns and Tilings. Woodhead Publishing. pp. 172, 175. ISBN 9781855734920.
  25. ^ Dutch, Steven (29 July 1999). "Some Special Radial and Spiral Tilings". University of Wisconsin. Retrieved 6 April 2013.
  26. ^ Hirschhorn, M. D.; Hunt, D. C. (1985). "Equilateral convex pentagons which tile the plane". Journal of Combinatorial Theory, Series A. 39 (1): 1–18. doi:10.1016/0097-3165(85)90078-0. Retrieved 29 April 2013.
  27. ^ Weisstein, Eric W. "Pentagon Tiling". MathWorld.
  28. ^ Weisstein, Eric W. "Regular Tessellations". MathWorld.
  29. ^ Stewart 2001, p. 75.
  30. ^ NRICH (Millennium Maths Project) (1997–2012). "Schläfli Tessellations". University of Cambridge. Retrieved 26 April 2013.
  31. ^ Wells, David (1991). "two squares tessellation". The Penguin Dictionary of Curious and Interesting Geometry. New York: Penguin Books. pp. 260–261. ISBN 0-14-011813-6.
  32. ^ Armstrong, M.A. (1988). Groups and Symmetry. New York: Springer-Verlag. ISBN 978-3-540-96675-3.
  33. ^ Grünbaum, Branko (June–July 2006). "What symmetry groups are present in the Alhambra?" (PDF). Notices of the American Mathematical Society. 53 (6): 670–673.
  34. ^ Jaworski, J. "A mathematician's guide to the Alhambra" (PDF). Retrieved September 1, 2011.
  35. ^ Lu, Peter J.; Steinhardt (23 February 2007). "Decagonal and quasi-crystalline tilings in medieval Islamic architecture". Science. 315: 1106–10. doi:10.1126/science.1135491. PMID 17322056.
  36. ^ Weisstein, Eric W. "Frieze Group". MathWorld.
  37. ^ Huson, Daniel H. (1991). "Two-Dimensional Symmetry Mutation". CiteSeer. Retrieved 29 May 2015.
  38. ^ Gardner 1989, pp. 1–18.
  39. ^ Radin, C. (May 1994). "The Pinwheel Tilings of the Plane". Annals of Mathematics. 139 (3): pp.661–702. doi:10.2307/2118575. JSTOR 2118575. {{cite journal}}: |pages= has extra text (help)
  40. ^ Austin, David. "Penrose Tiles Talk Across Miles". American Mathematical Society. Retrieved 29 May 2015.
  41. ^ Harriss, E. O. "Aperiodic Tiling" (PDF). University of London and EPSRC. Retrieved 29 May 2015.
  42. ^ Dharma-wardana, M. W. C.; MacDonald, A. H.; Lockwood, D. J.; Baribeau, J.-M.; Houghton, D. C. (1987). "Raman scattering in Fibonacci superlattices". Physical Review Letters. 58: 1761–1765. doi:10.1103/physrevlett.58.1761.
  43. ^ Wang, Hao (1961). "Proving theorems by pattern recognition—II". Bell System Technical Journal. 40 (1): 1–41. doi:10.1002/j.1538-7305.1961.tb03975.x.
  44. ^ Wang, Hao (November 1965). "Games, logic and computers". Scientific American: 98–106.
  45. ^ Berger, Robert (1966). "The undecidability of the domino problem". Memoirs of the American Mathematical Society. 66: 72.
  46. ^ Robinson, Raphael M. (1971). "Undecidability and nonperiodicity for tilings of the plane". Inventiones Mathematicae. 12: 177–209. doi:10.1007/bf01418780. MR 0297572.
  47. ^ Culik, Karel, II (1996). "An aperiodic set of 13 Wang tiles". Discrete Mathematics. 160 (1–3): 245–251. doi:10.1016/S0012-365X(96)00118-5. MR 1417576.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  48. ^ Browne, Cameron (2008). "Truchet curves and surfaces". Computers & Graphics. 32 (2): 268–281. doi:10.1016/j.cag.2007.10.001.
  49. ^ Smith, Cyril Stanley (1987). "The tiling patterns of Sebastian Truchet and the topology of structural hierarchy". Leonardo. 20 (4): 373–385. doi:10.2307/1578535.
  50. ^ "Four-colour problem", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
  51. ^ Jones, Owen (1910) [1856]. The Grammar of Ornament (folio ed.). Bernard Quaritch.
  52. ^ Aurenhammer, Franz (1991). "Voronoi Diagrams – A Survey of a Fundamental Geometric Data Structure". ACM Computing Surveys. 23 issue=3: 345–405. {{cite journal}}: Missing pipe in: |volume= (help)
  53. ^ Okabe, Atsuyuki; Boots, Barry; Sugihara, Kokichi; Chiu, Sung Nok (2000). Spatial Tessellations – Concepts and Applications of Voronoi Diagrams (2nd ed.). John Wiley. ISBN 0-471-98635-6.{{cite book}}: CS1 maint: multiple names: authors list (link)
  54. ^ George, Paul Louis; Borouchaki, Houman (1998). Delaunay Triangulation and Meshing: Application to Finite Elements. Hermes. pp. 34–35. ISBN 2-86601-692-0.{{cite book}}: CS1 maint: multiple names: authors list (link)
  55. ^ Moller, Jesper (1994). Lectures on Random Voronoi Tessellations. Springer. ISBN 978-1-4612-2652-9.
  56. ^ Grünbaum, Branko (1994). "Uniform tilings of 3-space". Geombinatorics. 4 (2): 49–56.
  57. ^ Oldershaw, Cally (2003). Firefly Guide to Gems. Firefly Books. p. 107. ISBN 978-1-55297-814-6.
  58. ^ Kirkaldy, J. F. (1968). Minerals and Rocks in Colour (2nd ed.). Blandford. pp. 138–139.
  59. ^ Schwarz, H. A. (1873). "Ueber diejenigen Fälle in welchen die Gaussichen hypergeometrische Reihe eine algebraische Function ihres vierten Elementes darstellt". Journal für die reine und angewandte Mathematik. 75: 292–335. doi:10.1515/crll.1873.75.292. ISSN 0075-4102.
  60. ^ Coxeter, Harold Scott Macdonald; Sherk, F. Arthur; Canadian Mathematical Society (1995). Kaleidoscopes: Selected Writings of H.S.M. Coxeter. John Wiley & Sons. pp. 3 and passim. ISBN 978-0-471-01003-6.
  61. ^ Weisstein, Eric W. "Wythoff construction". MathWorld.
  62. ^ Senechal, Marjorie (26 September 1996). Quasicrystals and Geometry. CUP Archive. p. 209. ISBN 978-0-521-57541-6.
  63. ^ Margenstern, Maurice (4 January 2011). "Coordinates for a new triangular tiling of the hyperbolic plane (arXiv:1101.0530 [cs.FL])" (PDF). arXiv.org. Retrieved 27 May 2015.
  64. ^ Zadnik, Gašper. "Tiling the Hyperbolic Plane with Regular Polygons". Wolfram. Retrieved 27 May 2015.
  65. ^ Coxeter, H.S.M. (1999). Chapter 10: Regular honeycombs in hyperbolic space. Dover Publications. pp. 212–213. ISBN 0-486-40919-8. {{cite book}}: |work= ignored (help)
  66. ^ "Mathematics in Art and Architecture". National University of Singapore. Retrieved 17 May 2015.
  67. ^ Whittaker, Andrew (2008). Speak the Culture: Spain. Thorogood Publishing. p. 153. ISBN 978-1-85418-605-8.
  68. ^ Escher 1974, pp. 5, 17.
  69. ^ Gersten, S. M. "Introduction to Hyperbolic and Automatic Groups" (PDF). University of Utah. Retrieved 27 May 2015. Figure 1 is part of a tiling of the Euclidean plane, which we imagine as continued in all directions, and Figure 2 [Circle Limit IV] is a beautiful tesselation of the Poincaré unit disc model of the hyperbolic plane by white tiles representing angels and black tiles representing devils. An important feature of the second is that all white tiles are mutually congruent as are all black tiles; of course this is not true for the Euclidean metric, but holds for the Poincaré metric
  70. ^ Leys, Jos (2015). "Hyperbolic Escher". Retrieved 27 May 2015.
  71. ^ Escher 1974, pp. 142–143.
  72. ^ Escher 1974, p. 16.
  73. ^ Porter, Christine (2006). Tessellation Quilts: Sensational Designs From Interlocking Patterns. F+W Media. pp. 4–8. ISBN 9780715319413.
  74. ^ Beyer, Jinny (1999). Designing tessellations: the secrets of interlocking patterns. Contemporary Book. pp. Ch. 7. ISBN 9780809228669.
  75. ^ "Reducing yield losses: using less metal to make the same thing". UIT Cambridge. Retrieved 29 May 2015.
  76. ^ Ball, Philip. "How honeycombs can build themselves". Nature.com. Nature. Retrieved 7 November 2014.
  77. ^ Shorter Oxford English dictionary (6th ed.). United Kingdom: Oxford University Press. 2007. p. 3804. ISBN 0199206872.
  78. ^ Purdy, Kathy (2007). "Colchicums: autumn's best-kept secret". American Gardener (September/October): 18–22.
  79. ^ Schreiber, Tomasz; Soja, Natalia (2010). "Limit theory for planar Gilbert tessellations". arXiv:1005.0023. {{cite journal}}: Cite journal requires |journal= (help)
  80. ^ Gray, N. H.; Anderson, J. B.; Devine, J. D.; Kwasnik, J. M. (1976). "Topological properties of random crack networks". Mathematical Geology. 8 (6): 617–626. doi:10.1007/BF01031092.
  81. ^ Gilbert, E. N. (1967). "Random plane networks and needle-shaped crystals". In Noble, B. (ed.). Applications of Undergraduate Mathematics in Engineering. New York: Macmillan.
  82. ^ Weaire, D.; Rivier, N. (1984). "Soap, cells and statistics: Random patterns in two dimensions". Contemporary Physics. 25 (1): 59–99. doi:10.1080/00107518408210979.
  83. ^ Branagan, D.F. (1983). Young, R.W.; Nanson, G.C. (ed.). Tesselated pavements. University of Wollongong. pp. 11–20. ISBN 0-864-18001-2. {{cite book}}: |work= ignored (help)CS1 maint: multiple names: editors list (link)
  84. ^ Ball, Philip (2009). Shapes. Oxford University Press. pp. 73–76. ISBN 978-0-199-60486-9.
  85. ^ McAdam, Daniel. "History of Jigsaw Puzzles". American Jigsaw Puzzle Society. Retrieved 28 May 2015.
  86. ^ Slocum, Jerry (2001). The Tao of Tangram. Barnes & Noble. p. 9. ISBN 978-1-4351-0156-2.
  87. ^ Golomb, Solomon W. (1994). Polyominoes (2nd ed.). Princeton University Press. ISBN 0-691-02444-8.
  88. ^ Martin, George E. (1991). Polyominoes: A guide to puzzles and problems in tiling. Mathematical Association of America.
  89. ^ Frederickson, Greg N. (2002). Hinged Dissections: Swinging and Twisting. Cambridge University Press. ISBN 0521811929.
  90. ^ Gardner, Martin (May 1963). "On 'Rep-tiles,' Polygons that can make larger and smaller copies of themselves". Scientific American. 208 (May): 154–164.
  91. ^ Gardner, Martin (14 December 2006). Aha! A Two Volume Collection: Aha! Gotcha Aha! Insight. MAA. p. 48. ISBN 978-0-88385-551-5.
  92. ^ Tutte, W. T. "Squaring the Square". Squaring.net. Retrieved 29 May 2015.
  93. ^ Gardner, Martin; Tutte, William T. (November 1958). "Mathematical Games". Scientific American.
  94. ^ Henle, Frederick V.; Henle, James M. (2008). "Squaring the plane" (PDF). American Mathematical Monthly. 115: 3–12.

Sources


Wikimedia Commons has media related to Tessellation.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Tessellation&oldid=664884194"