1.
List of uniform tilings
–
This table shows the 11 convex uniform tilings of the Euclidean plane, and their dual tilings. There are three regular and eight semiregular tilings in the plane, the semiregular tilings form new tilings from their duals, each made from one type of irregular face. John Conway calls the uniform duals Archimedean tilings, in parallel to the Archimedean solid polyhedra, Uniform tilings are listed by their vertex configuration, the sequence of faces that exist on each vertex. For example 4.8.8 means one square and two octagons on a vertex and these 11 uniform tilings have 32 different uniform colorings. A uniform coloring allows identical sided polygons at a vertex to be colored differently, while still maintaining vertex-uniformity, in addition to the 11 convex uniform tilings, there are also 14 nonconvex tilings, using star polygons, and reverse orientation vertex configurations. In the 1987 book, Tilings and Patterns, Branko Grünbaum calls the vertex-uniform tilings Archimedean in parallel to the Archimedean solids and their dual tilings are called Laves tilings in honor of crystallographer Fritz Laves. Theyre also called Shubnikov–Laves tilings after Shubnikov, Alekseĭ Vasilʹevich, John Conway calls the uniform duals Catalan tilings, in parallel to the Catalan solid polyhedra. The Laves tilings have vertices at the centers of the regular polygons, the tiles of the Laves tilings are called planigons. This includes the 3 regular tiles and 8 irregular ones, each vertex has edges evenly spaced around it. Three dimensional analogues of the planigons are called stereohedrons and these dual tilings are listed by their face configuration, the number of faces at each vertex of a face. For example V4.8.8 means isosceles triangle tiles with one corner with four triangles, alternated forms such as the snub can also be represented by special markups within each system. Only one uniform tiling cant be constructed by a Wythoff process, an orthogonal mirror construction also exists, seen as two sets of parallel mirrors making a rectangular fundamental domain. If the domain is square, this symmetry can be doubled by a mirror into the family. Families, B C ~2, - Symmetry of the square tiling I ~12, G ~2, - Symmetry of the regular hexagonal tiling. Uniform tilings in hyperbolic plane Percolation threshold John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, the Geometrical Foundation of Natural Structure, A Source Book of Design. Uniform edge-c-colorings of the Archimedean Tilings, Tilings by Regular polygons, Vol.50, No.5. Dale Seymour and Jill Britton, Introduction to Tessellations,1989, ISBN 978-0866514613, pp. 50–57, 71-74 Weisstein, Uniform Tessellations on the Euclid plane Tessellations of the Plane David Baileys World of Tessellations k-uniform tilings n-uniform tilings
2.
Vertex configuration
–
In geometry, a vertex configuration is a shorthand notation for representing the vertex figure of a polyhedron or tiling as the sequence of faces around a vertex. For uniform polyhedra there is one vertex type and therefore the vertex configuration fully defines the polyhedron. A vertex configuration is given as a sequence of numbers representing the number of sides of the faces going around the vertex, the notation a. b. c describes a vertex that has 3 faces around it, faces with a, b, and c sides. For example,3.5.3.5 indicates a vertex belonging to 4 faces, alternating triangles and this vertex configuration defines the vertex-transitive icosidodecahedron. The notation is cyclic and therefore is equivalent with different starting points, the order is important, so 3.3.5.5 is different from 3.5.3.5. Repeated elements can be collected as exponents so this example is represented as 2. It has variously called a vertex description, vertex type, vertex symbol, vertex arrangement, vertex pattern. It is also called a Cundy and Rollett symbol for its usage for the Archimedean solids in their 1952 book Mathematical Models, a vertex configuration can also be represented as a polygonal vertex figure showing the faces around the vertex. Different notations are used, sometimes with a comma and sometimes a period separator, the period operator is useful because it looks like a product and an exponent notation can be used. For example,3.5.3.5 is sometimes written as 2, the notation can also be considered an expansive form of the simple Schläfli symbol for regular polyhedra. The Schläfli notation means q p-gons around each vertex, so can be written as p. p. p. or pq. For example, an icosahedron is =3.3.3.3.3 or 35 and this notation applies to polygonal tilings as well as polyhedra. A planar vertex configuration denotes a uniform tiling just like a nonplanar vertex configuration denotes a uniform polyhedron, the notation is ambiguous for chiral forms. For example, the cube has clockwise and counterclockwise forms which are identical across mirror images. Both have a 3.3.3.3.4 vertex configuration, the notation also applies for nonconvex regular faces, the star polygons. For example, a pentagram has the symbol, meaning it has 5 sides going around the centre twice, for example, there are 4 regular star polyhedra with regular polygon or star polygon vertex figures. The small stellated dodecahedron has the Schläfli symbol of which expands to a vertex configuration 5/2. 5/2. 5/2. 5/2. 5/2 or combined as 5. The great stellated dodecahedron, has a vertex figure and configuration or 3
3.
Face configuration
–
In geometry, a vertex configuration is a shorthand notation for representing the vertex figure of a polyhedron or tiling as the sequence of faces around a vertex. For uniform polyhedra there is one vertex type and therefore the vertex configuration fully defines the polyhedron. A vertex configuration is given as a sequence of numbers representing the number of sides of the faces going around the vertex, the notation a. b. c describes a vertex that has 3 faces around it, faces with a, b, and c sides. For example,3.5.3.5 indicates a vertex belonging to 4 faces, alternating triangles and this vertex configuration defines the vertex-transitive icosidodecahedron. The notation is cyclic and therefore is equivalent with different starting points, the order is important, so 3.3.5.5 is different from 3.5.3.5. Repeated elements can be collected as exponents so this example is represented as 2. It has variously called a vertex description, vertex type, vertex symbol, vertex arrangement, vertex pattern. It is also called a Cundy and Rollett symbol for its usage for the Archimedean solids in their 1952 book Mathematical Models, a vertex configuration can also be represented as a polygonal vertex figure showing the faces around the vertex. Different notations are used, sometimes with a comma and sometimes a period separator, the period operator is useful because it looks like a product and an exponent notation can be used. For example,3.5.3.5 is sometimes written as 2, the notation can also be considered an expansive form of the simple Schläfli symbol for regular polyhedra. The Schläfli notation means q p-gons around each vertex, so can be written as p. p. p. or pq. For example, an icosahedron is =3.3.3.3.3 or 35 and this notation applies to polygonal tilings as well as polyhedra. A planar vertex configuration denotes a uniform tiling just like a nonplanar vertex configuration denotes a uniform polyhedron, the notation is ambiguous for chiral forms. For example, the cube has clockwise and counterclockwise forms which are identical across mirror images. Both have a 3.3.3.3.4 vertex configuration, the notation also applies for nonconvex regular faces, the star polygons. For example, a pentagram has the symbol, meaning it has 5 sides going around the centre twice, for example, there are 4 regular star polyhedra with regular polygon or star polygon vertex figures. The small stellated dodecahedron has the Schläfli symbol of which expands to a vertex configuration 5/2. 5/2. 5/2. 5/2. 5/2 or combined as 5. The great stellated dodecahedron, has a vertex figure and configuration or 3
4.
Wythoff symbol
–
In geometry, the Wythoff symbol represents a Wythoff construction of a uniform polyhedron or plane tiling, from a Schwarz triangle. It was first used by Coxeter, Longuet-Higgins and Miller in their enumeration of the uniform polyhedra, a Wythoff symbol consists of three numbers and a vertical bar. It represents one uniform polyhedron or tiling, although the same tiling/polyhedron can have different Wythoff symbols from different symmetry generators, with a slight extension, Wythoffs symbol can be applied to all uniform polyhedra. However, the methods do not lead to all uniform tilings in euclidean or hyperbolic space. In three dimensions, Wythoffs construction begins by choosing a point on the triangle. If the distance of this point from each of the sides is non-zero, a perpendicular line is then dropped between the generator point and every face that it does not lie on. The three numbers in Wythoffs symbol, p, q and r, represent the corners of the Schwarz triangle used in the construction, the triangle is also represented with the same numbers, written. In this notation the mirrors are labeled by the reflection-order of the opposite vertex, the p, q, r values are listed before the bar if the corresponding mirror is active. The one impossible symbol | p q r implies the point is on all mirrors. This unused symbol is therefore arbitrarily reassigned to represent the case where all mirrors are active, the resulting figure has rotational symmetry only. The generator point can either be on or off each mirror and this distinction creates 8 possible forms, neglecting one where the generator point is on all the mirrors. A node is circled if the point is not on the mirror. There are seven generator points with each set of p, q, r, | p q r – Snub forms are given by this otherwise unused symbol. | p q r s – A unique snub form for U75 that isnt Wythoff-constructible, There are 4 symmetry classes of reflection on the sphere, and two in the Euclidean plane. A few of the many such patterns in the hyperbolic plane are also listed. The list of Schwarz triangles includes rational numbers, and determine the set of solutions of nonconvex uniform polyhedra. In the tilings above, each triangle is a domain, colored by even. Selected tilings created by the Wythoff construction are given below, for a more complete list, including cases where r ≠2, see List of uniform polyhedra by Schwarz triangle
5.
List of planar symmetry groups
–
This article summarizes the classes of discrete symmetry groups of the Euclidean plane. The symmetry groups are named here by three naming schemes, International notation, orbifold notation, and Coxeter notation. There are three kinds of groups of the plane,2 rosette groups – 2D point groups 7 frieze groups – 2D line groups 17 wallpaper groups – 2D space groups. There are two families of discrete point groups, and they are specified with parameter n, which is the order of the group of the rotations in the group. The 7 frieze groups, the line groups, with a direction of periodicity are given with five notational names. The Schönflies notation is given as infinite limits of 7 dihedral groups, the yellow regions represent the infinite fundamental domain in each. The p1 and p2 groups, with no symmetry, are repeated in all classes. The related pure reflectional Coxeter group are given with all classes except oblique, Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, Coxeter, Regular and Semi-Regular Polytopes III, Coxeter, H. S. M. & Moser, W. O. J. Generators and Relations for Discrete Groups. Johnson, Geometries and Transformations, Chapter 11, Finite symmetry groups Conways manuscript on Orbifold notation The 17 Wallpaper Groups
6.
632 symmetry
–
In geometry, the truncated trihexagonal tiling is one of eight semiregular tilings of the Euclidean plane. There are one square, one hexagon, and one dodecagon on each vertex and it has Schläfli symbol of tr. There is only one uniform coloring of a trihexagonal tiling. A 2-uniform coloring has two colors of hexagons, 3-uniform colorings can have 3 colors of dodecagons or 3 colors of squares. The truncated trihexagonal tiling has three related 2-uniform tilings, one being a 2-uniform coloring of the semiregular rhombitrihexagonal tiling, the first dissects the hexagons into 6 triangles. The other two dissect the dodecagons into a hexagon and surrounding triangles and square, in two different orientations. The Truncated trihexagonal tiling can be used as a packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing, circles can be alternatedly colored in this packing with an even number of sides of all the regular polygons of this tiling. The gap inside each hexagon allows for one circle, and each dodecagon allows for 7 circles, the kisrhombille tiling or 3-6 kisrhombille tiling is a tiling of the Euclidean plane. It is constructed by congruent 30-60 degree right triangles with 4,6, conway calls it a kisrhombille for his kis vertex bisector operation applied to the rhombille tiling. More specifically it can be called a 3-6 kisrhombille, to distinguish it from other similar hyperbolic tilings and it can be seen as an equilateral hexagonal tiling with each hexagon divided into 12 triangles from the center point. It is labeled V4.6.12 because each right triangle face has three types of vertices, one with 4 triangles, one with 6 triangles, and one with 12 triangles, the kisrhombille tiling triangles represent the fundamental domains of p6m, symmetry. There are a number of small index subgroups constructed from by mirror removal, creates *333 symmetry, shown as red mirror lines. The commutator subgroup is, which is 333 symmetry, a larger index 6 subgroup constructed as, also becomes, shown in blue mirror lines, and which has its own 333 rotational symmetry, index 12. There are eight uniform tilings that can be based from the hexagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. This tiling can be considered a member of a sequence of patterns with vertex figure. For p <6, the members of the sequence are omnitruncated polyhedra, for p >6, they are tilings of the hyperbolic plane, starting with the truncated triheptagonal tiling
7.
Wallpaper group
–
A wallpaper group is a mathematical classification of a two-dimensional repetitive pattern, based on the symmetries in the pattern. Such patterns occur frequently in architecture and decorative art, There are 17 possible distinct groups. Wallpaper groups are two-dimensional symmetry groups, intermediate in complexity between the simpler frieze groups and the space groups. Wallpaper groups categorize patterns by their symmetries, subtle differences may place similar patterns in different groups, while patterns that are very different in style, color, scale or orientation may belong to the same group. Consider the following examples, Examples A and B have the same group, it is called p4m in the IUC notation. Example C has a different wallpaper group, called p4g or 4*2, a complete list of all seventeen possible wallpaper groups can be found below. A symmetry of a pattern is, loosely speaking, a way of transforming the pattern so that it exactly the same after the transformation. For example, translational symmetry is present when the pattern can be translated some finite distance, think of shifting a set of vertical stripes horizontally by one stripe. Strictly speaking, a true symmetry only exists in patterns that repeat exactly, a set of only, say, five stripes does not have translational symmetry—when shifted, the stripe on one end disappears and a new stripe is added at the other end. In practice, however, classification is applied to finite patterns, sometimes two categorizations are meaningful, one based on shapes alone and one also including colors. When colors are ignored there may be more symmetry, the types of transformations that are relevant here are called Euclidean plane isometries. This type of symmetry is called a translation, Examples A and C are similar, except that the smallest possible shifts are in diagonal directions. If we turn example B clockwise by 90°, around the centre of one of the squares, Examples A and C also have 90° rotations, although it requires a little more ingenuity to find the correct centre of rotation for C. We can also flip example B across a horizontal axis that runs across the middle of the image, example B also has reflections across a vertical axis, and across two diagonal axes. The same can be said for A. However, example C is different and it only has reflections in horizontal and vertical directions, not across diagonal axes. If we flip across a line, we do not get the same pattern back. This is part of the reason that the group of A and B is different from the wallpaper group of C. A proof that there were only 17 possible patterns was first carried out by Evgraf Fedorov in 1891, the proof that the list of wallpaper groups was complete only came after the much harder case of space groups had been done
8.
Dual polyhedron
–
Such dual figures remain combinatorial or abstract polyhedra, but not all are also geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron, duality preserves the symmetries of a polyhedron. Therefore, for classes of polyhedra defined by their symmetries. Thus, the regular polyhedra – the Platonic solids and Kepler-Poinsot polyhedra – form dual pairs, the dual of an isogonal polyhedron, having equivalent vertices, is one which is isohedral, having equivalent faces. The dual of a polyhedron is also isotoxal. Duality is closely related to reciprocity or polarity, a transformation that. There are many kinds of duality, the kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality. The duality of polyhedra is often defined in terms of polar reciprocation about a concentric sphere. In coordinates, for reciprocation about the sphere x 2 + y 2 + z 2 = r 2, the vertex is associated with the plane x 0 x + y 0 y + z 0 z = r 2. The vertices of the dual are the reciprocal to the face planes of the original. Also, any two adjacent vertices define an edge, and these will reciprocate to two adjacent faces which intersect to define an edge of the dual and this dual pair of edges are always orthogonal to each other. If r 0 is the radius of the sphere, and r 1 and r 2 respectively the distances from its centre to the pole and its polar, then, r 1. R2 = r 02 For the more symmetrical polyhedra having an obvious centroid, it is common to make the polyhedron and sphere concentric, the choice of center for the sphere is sufficient to define the dual up to similarity. If multiple symmetry axes are present, they will intersect at a single point. Failing that, a sphere, inscribed sphere, or midsphere is commonly used. If a polyhedron in Euclidean space has an element passing through the center of the sphere, since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required plane at infinity. Some theorists prefer to stick to Euclidean space and say there is no dual. Meanwhile, Wenninger found a way to represent these infinite duals, the concept of duality here is closely related to the duality in projective geometry, where lines and edges are interchanged
9.
Hexagonal tiling
–
In geometry, the hexagonal tiling or hexagonal tessellation is a regular tiling of the Euclidean plane, in which three hexagons meet at each vertex. It has Schläfli symbol of or t, english mathematician Conway calls it a hextille. The internal angle of the hexagon is 120 degrees so three hexagons at a point make a full 360 degrees and it is one of three regular tilings of the plane. The other two are the triangular tiling and the square tiling, the hexagonal tiling is the densest way to arrange circles in two dimensions. The Honeycomb conjecture states that the tiling is the best way to divide a surface into regions of equal area with the least total perimeter. The optimal three-dimensional structure for making honeycomb was investigated by Lord Kelvin, however, the less regular Weaire–Phelan structure is slightly better. This structure exists naturally in the form of graphite, where each sheet of graphene resembles chicken wire, tubular graphene sheets have been synthesised, these are known as carbon nanotubes. They have many applications, due to their high tensile strength. Chicken wire consists of a lattice of wires. The hexagonal tiling appears in many crystals, in three dimensions, the face-centered cubic and hexagonal close packing are common crystal structures. They are the densest known sphere packings in three dimensions, and are believed to be optimal, structurally, they comprise parallel layers of hexagonal tilings, similar to the structure of graphite. They differ in the way that the layers are staggered from each other, pure copper, amongst other materials, forms a face-centered cubic lattice. There are three distinct uniform colorings of a tiling, all generated from reflective symmetry of Wythoff constructions. The represent the periodic repeat of one colored tile, counting hexagonal distances as h first, the 3-color tiling is a tessellation generated by the order-3 permutohedrons. A chamferred hexagonal tiling replacing edges with new hexagons and transforms into another hexagonal tiling, in the limit, the original faces disappear, and the new hexagons degenerate into rhombi, and it becomes a rhombic tiling. The hexagons can be dissected into sets of 6 triangles and this is similar to the relation of the rhombic dodecahedron and the rhombo-hexagonal dodecahedron tessellations in 3 dimensions. This tiling is related to regular polyhedra with vertex figure n3. It is similarly related to the uniform truncated polyhedra with vertex figure n.6.6 and this tiling is also a part of a sequence of truncated rhombic polyhedra and tilings with Coxeter group symmetry
10.
Vertex-transitive
–
In geometry, a polytope is isogonal or vertex-transitive if, loosely speaking, all its vertices are equivalent. That implies that each vertex is surrounded by the kinds of face in the same or reverse order. Technically, we say that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second. Other ways of saying this are that the group of automorphisms of the polytope is transitive on its vertices, all vertices of a finite n-dimensional isogonal figure exist on an -sphere. The term isogonal has long used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups, all regular polygons, apeirogons and regular star polygons are isogonal. The dual of a polygon is an isotoxal polygon. Some even-sided polygons and apeirogons which alternate two edge lengths, for example a rectangle, are isogonal, all planar isogonal 2n-gons have dihedral symmetry with reflection lines across the mid-edge points. An isogonal polyhedron and 2D tiling has a kind of vertex. An isogonal polyhedron with all faces is also a uniform polyhedron. Geometrically distorted variations of uniform polyhedra and tilings can also be given the vertex configuration, isogonal polyhedra and 2D tilings may be further classified, Regular if it is also isohedral and isotoxal, this implies that every face is the same kind of regular polygon. Quasi-regular if it is also isotoxal but not isohedral, semi-regular if every face is a regular polygon but it is not isohedral or isotoxal. Uniform if every face is a polygon, i. e. it is regular, quasiregular or semi-regular. Noble if it is also isohedral and these definitions can be extended to higher-dimensional polytopes and tessellations. Most generally, all uniform polytopes are isogonal, for example, the dual of an isogonal polytope is called an isotope which is transitive on its facets. A polytope or tiling may be called if its vertices form k transitivity classes. A more restrictive term, k-uniform is defined as a figure constructed only from regular polygons. They can be represented visually with colors by different uniform colorings, edge-transitive Face-transitive Peter R. Cromwell, Polyhedra, Cambridge University Press 1997, ISBN 0-521-55432-2, p.369 Transitivity Grünbaum, Branko, Shephard, G. C
11.
Edge-transitive
–
In geometry, a polytope, or a tiling, is isotoxal or edge-transitive if its symmetries act transitively on its edges. The term isotoxal is derived from the Greek τοξον meaning arc, an isotoxal polygon is an equilateral polygon, but not all equilateral polygons are isotoxal. The duals of isotoxal polygons are isogonal polygons, in general, an isotoxal 2n-gon will have Dn dihedral symmetry. A rhombus is a polygon with D2 symmetry. All regular polygons are isotoxal, having double the symmetry order. A regular 2n-gon is a polygon and can be marked with alternately colored vertices. An isotoxal polyhedron or tiling must be either isogonal or isohedral or both, regular polyhedra are isohedral, isogonal and isotoxal. Quasiregular polyhedra are isogonal and isotoxal, but not isohedral, their duals are isohedral and isotoxal, not every polyhedron or 2-dimensional tessellation constructed from regular polygons is isotoxal. An isotoxal polyhedron has the dihedral angle for all edges. There are nine convex isotoxal polyhedra formed from the Platonic solids,8 formed by the Kepler–Poinsot polyhedra, cS1 maint, Multiple names, authors list Coxeter, Harold Scott MacDonald, Longuet-Higgins, M. S. Miller, J. C. P. Uniform polyhedra, Philosophical Transactions of the Royal Society of London, mathematical and Physical Sciences,246, 401–450, doi,10. 1098/rsta.1954.0003, ISSN 0080-4614, JSTOR91532, MR0062446
12.
Face-transitive
–
In geometry, a polytope of dimension 3 or higher is isohedral or face-transitive when all its faces are the same. More specifically, all faces must be not merely congruent but must be transitive, in other words, for any faces A and B, there must be a symmetry of the entire solid by rotations and reflections that maps A onto B. For this reason, convex polyhedra are the shapes that will make fair dice. They can be described by their face configuration, a polyhedron which is isohedral has a dual polyhedron that is vertex-transitive. The Catalan solids, the bipyramids and the trapezohedra are all isohedral and they are the duals of the isogonal Archimedean solids, prisms and antiprisms, respectively. The Platonic solids, which are either self-dual or dual with another Platonic solid, are vertex, edge, a polyhedron which is isohedral and isogonal is said to be noble. A polyhedron is if it contains k faces within its symmetry fundamental domain. Similarly a k-isohedral tiling has k separate symmetry orbits, a monohedral polyhedron or monohedral tiling has congruent faces, as either direct or reflectively, which occur in one or more symmetry positions. An r-hedral polyhedra or tiling has r types of faces, a facet-transitive or isotopic figure is a n-dimensional polytopes or honeycomb, with its facets congruent and transitive. The dual of an isotope is an isogonal polytope, by definition, this isotopic property is common to the duals of the uniform polytopes. An isotopic 2-dimensional figure is isotoxal, an isotopic 3-dimensional figure is isohedral. An isotopic 4-dimensional figure is isochoric, edge-transitive Anisohedral tiling Peter R. Cromwell, Polyhedra, Cambridge University Press 1997, ISBN 0-521-55432-2, p.367 Transitivity Olshevsky, George. Archived from the original on 4 February 2007
13.
Geometry
–
Geometry is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. A mathematician who works in the field of geometry is called a geometer, Geometry arose independently in a number of early cultures as a practical way for dealing with lengths, areas, and volumes. Geometry began to see elements of mathematical science emerging in the West as early as the 6th century BC. By the 3rd century BC, geometry was put into a form by Euclid, whose treatment, Euclids Elements. Geometry arose independently in India, with texts providing rules for geometric constructions appearing as early as the 3rd century BC, islamic scientists preserved Greek ideas and expanded on them during the Middle Ages. By the early 17th century, geometry had been put on a solid footing by mathematicians such as René Descartes. Since then, and into modern times, geometry has expanded into non-Euclidean geometry and manifolds, while geometry has evolved significantly throughout the years, there are some general concepts that are more or less fundamental to geometry. These include the concepts of points, lines, planes, surfaces, angles, contemporary geometry has many subfields, Euclidean geometry is geometry in its classical sense. The mandatory educational curriculum of the majority of nations includes the study of points, lines, planes, angles, triangles, congruence, similarity, solid figures, circles, Euclidean geometry also has applications in computer science, crystallography, and various branches of modern mathematics. Differential geometry uses techniques of calculus and linear algebra to problems in geometry. It has applications in physics, including in general relativity, topology is the field concerned with the properties of geometric objects that are unchanged by continuous mappings. In practice, this often means dealing with large-scale properties of spaces, convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues, often using techniques of real analysis. It has close connections to convex analysis, optimization and functional analysis, algebraic geometry studies geometry through the use of multivariate polynomials and other algebraic techniques. It has applications in areas, including cryptography and string theory. Discrete geometry is concerned mainly with questions of relative position of simple objects, such as points. It shares many methods and principles with combinatorics, Geometry has applications to many fields, including art, architecture, physics, as well as to other branches of mathematics. The earliest recorded beginnings of geometry can be traced to ancient Mesopotamia, the earliest known texts on geometry are the Egyptian Rhind Papyrus and Moscow Papyrus, the Babylonian clay tablets such as Plimpton 322. For example, the Moscow Papyrus gives a formula for calculating the volume of a truncated pyramid, later clay tablets demonstrate that Babylonian astronomers implemented trapezoid procedures for computing Jupiters position and motion within time-velocity space
14.
Tessellation
–
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. 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 set of tile shapes that cannot form a repeating pattern. In the geometry of higher dimensions, a space-filling or honeycomb is called a tessellation of space. A real physical tessellation is a made of materials such as cemented ceramic squares or hexagons. Such tilings may be decorative patterns, or may have such as providing durable and water-resistant pavement. Historically, tessellations were used in Ancient Rome and in Islamic art such as in the decorative geometric 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 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. Tessellations were used by the Sumerians in building wall decorations formed by patterns of clay tiles, decorative mosaic tilings made of small squared blocks called tesserae were widely employed in classical antiquity, sometimes displaying geometric patterns. In 1619 Johannes Kepler made a 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 structures of honeycomb. Some two hundred years later in 1891, the Russian crystallographer Yevgraf Fyodorov proved that every periodic tiling of the features one of seventeen different groups of isometries. Fyodorovs work marked the beginning of the mathematical study of tessellations. Other prominent contributors include Shubnikov and Belov, and Heinrich Heesch, in Latin, tessella is a small cubical piece of clay, stone or glass used to make mosaics. The word tessella means small square and it corresponds to the everyday term tiling, which refers to applications of tessellations, often made of glazed clay. 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
15.
Euclidean plane
–
In physics and mathematics, two-dimensional space is a geometric model of the planar projection of the physical universe. The two dimensions are commonly called length and width, both directions lie in the same plane. A sequence of n numbers can be understood as a location in n-dimensional space. When n =2, the set of all locations is called two-dimensional space or bi-dimensional space. Each reference line is called an axis or just axis of the system. The coordinates can also be defined as the positions of the projections of the point onto the two axes, expressed as signed distances from the origin. The idea of system was developed in 1637 in writings by Descartes and independently by Pierre de Fermat. Both authors used a single axis in their treatments and have a length measured in reference to this axis. The concept of using a pair of axes was introduced later, after Descartes La Géométrie was translated into Latin in 1649 by Frans van Schooten and these commentators introduced several concepts while trying to clarify the ideas contained in Descartes work. Later, the plane was thought of as a field, where any two points could be multiplied and, except for 0, divided and this was known as the complex plane. The complex plane is called the Argand plane because it is used in Argand diagrams. These are named after Jean-Robert Argand, although they were first described by Norwegian-Danish land surveyor, Argand diagrams are frequently used to plot the positions of the poles and zeroes of a function in the complex plane. In mathematics, analytic geometry describes every point in space by means of two coordinates. Two perpendicular coordinate axes are given which cross each other at the origin and they are usually labeled x and y. Another widely used system is the polar coordinate system, which specifies a point in terms of its distance from the origin. In two dimensions, there are infinitely many polytopes, the polygons, the first few regular ones are shown below, The Schläfli symbol represents a regular p-gon. The regular henagon and regular digon can be considered degenerate regular polygons and they can exist nondegenerately in non-Euclidean spaces like on a 2-sphere or a 2-torus. There exist infinitely many non-convex regular polytopes in two dimensions, whose Schläfli symbols consist of rational numbers and they are called star polygons and share the same vertex arrangements of the convex regular polygons
16.
Triangle
–
A triangle is a polygon with three edges and three vertices. It is one of the shapes in geometry. A triangle with vertices A, B, and C is denoted △ A B C, in Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. This article is about triangles in Euclidean geometry except where otherwise noted, triangles can be classified according to the lengths of their sides, An equilateral triangle has all sides the same length. An equilateral triangle is also a polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length, some mathematicians define an isosceles triangle to have exactly two equal sides, whereas others define an isosceles triangle as one with at least two equal sides. The latter definition would make all equilateral triangles isosceles triangles, the 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths, equivalently, it has all angles of different measure. Hatch marks, also called tick marks, are used in diagrams of triangles, a side can be marked with a pattern of ticks, short line segments in the form of tally marks, two sides have equal lengths if they are both marked with the same pattern. In a triangle, the pattern is no more than 3 ticks. Similarly, patterns of 1,2, or 3 concentric arcs inside the angles are used to indicate equal angles, triangles can also be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°, the side opposite to the right angle is the hypotenuse, the longest side of the triangle. The other two sides are called the legs or catheti of the triangle, special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 +42 =52, in this situation,3,4, and 5 are a Pythagorean triple. The other one is a triangle that has 2 angles that each measure 45 degrees. Triangles that do not have an angle measuring 90° are called oblique triangles, a triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle. If c is the length of the longest side, then a2 + b2 > c2, a triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side, then a2 + b2 < c2, a triangle with an interior angle of 180° is degenerate
17.
John Horton Conway
–
John Horton Conway FRS is an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He has also contributed to many branches of mathematics, notably the invention of the cellular automaton called the Game of Life. Conway is currently Professor Emeritus of Mathematics at Princeton University in New Jersey, Conway was born in Liverpool, the son of Cyril Horton Conway and Agnes Boyce. He became interested in mathematics at an early age, his mother has recalled that he could recite the powers of two when he was four years old. By the age of eleven his ambition was to become a mathematician, after leaving secondary school, Conway entered Gonville and Caius College, Cambridge to study mathematics. Conway, who was a terribly introverted adolescent in school, interpreted his admission to Cambridge as an opportunity to transform himself into a new person and he was awarded his Bachelor of Arts degree in 1959 and began to undertake research in number theory supervised by Harold Davenport. Having solved the problem posed by Davenport on writing numbers as the sums of fifth powers. It appears that his interest in games began during his years studying the Cambridge Mathematical Tripos and he was awarded his doctorate in 1964 and was appointed as College Fellow and Lecturer in Mathematics at the University of Cambridge. After leaving Cambridge in 1986, he took up the appointment to the John von Neumann Chair of Mathematics at Princeton University, Conway is especially known for the invention of the Game of Life, one of the early examples of a cellular automaton. His initial experiments in that field were done with pen and paper, since the game was introduced by Martin Gardner in Scientific American in 1970, it has spawned hundreds of computer programs, web sites, and articles. It is a staple of recreational mathematics, there is an extensive wiki devoted to curating and cataloging the various aspects of the game. From the earliest days it has been a favorite in computer labs, at times Conway has said he hates the game of life–largely because it has come to overshadow some of the other deeper and more important things he has done. Nevertheless, the game did help launch a new branch of mathematics, the Game of Life is now known to be Turing complete. Conways career is intertwined with mathematics popularizer and Scientific American columnist Martin Gardner, when Gardner featured Conways Game of Life in his Mathematical Games column in October 1970, it became the most widely read of all his columns and made Conway an instant celebrity. Gardner and Conway had first corresponded in the late 1950s, for instance, he discussed Conways game of Sprouts, Hackenbush, and his angel and devil problem. In the September 1976 column he reviewed Conways book On Numbers and Games, Conway is widely known for his contributions to combinatorial game theory, a theory of partisan games. This he developed with Elwyn Berlekamp and Richard Guy, and with them also co-authored the book Winning Ways for your Mathematical Plays and he also wrote the book On Numbers and Games which lays out the mathematical foundations of CGT. He is also one of the inventors of sprouts, as well as philosophers football and he developed detailed analyses of many other games and puzzles, such as the Soma cube, peg solitaire, and Conways soldiers
18.
Conway kis operator
–
In geometry, Conway polyhedron notation, invented by John Horton Conway and promoted by George W. Hart, is used to describe polyhedra based on a seed polyhedron modified by various prefix operations. Conway and Hart extended the idea of using operators, like truncation defined by Kepler, the basic descriptive operators can generate all the Archimedean solids and Catalan solids from regular seeds. For example tC represents a cube, and taC, parsed as t, is a truncated cuboctahedron. The simplest operator dual swaps vertex and face elements, like a cube is an octahedron. Applied in a series, these allow many higher order polyhedra to be generated. A resulting polyhedron will have a fixed topology, while exact geometry is not constrained, the seed polyhedra are the Platonic solids, represented by the first letter of their name, the prisms for n-gonal forms, antiprisms, cupolae and pyramids. Any polyhedron can serve as a seed, as long as the operations can be executed on it, for example regular-faced Johnson solids can be referenced as Jn, for n=1.92. In general, it is difficult to predict the appearance of the composite of two or more operations from a given seed polyhedron. For instance ambo applied twice becomes the same as the operation, aa=e, while a truncation after ambo produces bevel. There has been no general theory describing what polyhedra can be generated in by any set of operators, instead all results have been discovered empirically. Elements are given from the seed to the new forms, assuming seed is a polyhedron, An example image is given for each operation. The basic operations are sufficient to generate the reflective uniform polyhedra, some basic operations can be made as composites of others. Special forms The kis operator has a variation, kn, which only adds pyramids to n-sided faces, the truncate operator has a variation, tn, which only truncates order-n vertices. The operators are applied like functions from right to left, for example, a cuboctahedron is an ambo cube, i. e. t = aC, and a truncated cuboctahedron is t = t = taC. Chirality operator r – reflect – makes the image of the seed. Alternately an overline can be used for picking the other chiral form, the operations are visualized here on cube seed examples, drawn on the surface of the cube, with blue faces that cross original edges, and pink faces that center at original vertices. The first row generates the Archimedean solids and the row the Catalan solids. Comparing each new polyhedron with the cube, each operation can be visually understood, the truncated icosahedron, tI or zD, which is Goldberg polyhedron G, creates more polyhedra which are neither vertex nor face-transitive
19.
Hextille
–
In geometry, the hexagonal tiling or hexagonal tessellation is a regular tiling of the Euclidean plane, in which three hexagons meet at each vertex. It has Schläfli symbol of or t, english mathematician Conway calls it a hextille. The internal angle of the hexagon is 120 degrees so three hexagons at a point make a full 360 degrees and it is one of three regular tilings of the plane. The other two are the triangular tiling and the square tiling, the hexagonal tiling is the densest way to arrange circles in two dimensions. The Honeycomb conjecture states that the tiling is the best way to divide a surface into regions of equal area with the least total perimeter. The optimal three-dimensional structure for making honeycomb was investigated by Lord Kelvin, however, the less regular Weaire–Phelan structure is slightly better. This structure exists naturally in the form of graphite, where each sheet of graphene resembles chicken wire, tubular graphene sheets have been synthesised, these are known as carbon nanotubes. They have many applications, due to their high tensile strength. Chicken wire consists of a lattice of wires. The hexagonal tiling appears in many crystals, in three dimensions, the face-centered cubic and hexagonal close packing are common crystal structures. They are the densest known sphere packings in three dimensions, and are believed to be optimal, structurally, they comprise parallel layers of hexagonal tilings, similar to the structure of graphite. They differ in the way that the layers are staggered from each other, pure copper, amongst other materials, forms a face-centered cubic lattice. There are three distinct uniform colorings of a tiling, all generated from reflective symmetry of Wythoff constructions. The represent the periodic repeat of one colored tile, counting hexagonal distances as h first, the 3-color tiling is a tessellation generated by the order-3 permutohedrons. A chamferred hexagonal tiling replacing edges with new hexagons and transforms into another hexagonal tiling, in the limit, the original faces disappear, and the new hexagons degenerate into rhombi, and it becomes a rhombic tiling. The hexagons can be dissected into sets of 6 triangles and this is similar to the relation of the rhombic dodecahedron and the rhombo-hexagonal dodecahedron tessellations in 3 dimensions. This tiling is related to regular polyhedra with vertex figure n3. It is similarly related to the uniform truncated polyhedra with vertex figure n.6.6 and this tiling is also a part of a sequence of truncated rhombic polyhedra and tilings with Coxeter group symmetry
20.
List of regular polytopes
–
This page lists the regular polytopes and regular polytope compounds in Euclidean, spherical and hyperbolic spaces. The Schläfli symbol describes every regular tessellation of an n-sphere, Euclidean, a Schläfli symbol describing an n-polytope equivalently describes a tessellation of a -sphere. Another related symbol is the Coxeter-Dynkin diagram which represents a group with no rings. For example, the cube has Schläfli symbol, and with its octahedral symmetry, the regular polytopes are grouped by dimension and subgrouped by convex, nonconvex and infinite forms. Nonconvex forms use the same vertices as the forms, but have intersecting facets. Infinite forms tessellate a one-lower-dimensional Euclidean space, infinite forms can be extended to tessellate a hyperbolic space. Hyperbolic space is like normal space at a scale. This allows vertex figures to have negative angle defects, like making a vertex with seven equilateral triangles and it cannot be done in a regular plane, but can be at the right scale of a hyperbolic plane. A more general definition of regular polytopes which do not have simple Schläfli symbols includes regular skew polytopes and this table shows a summary of regular polytope counts by dimension. *1 if the number of dimensions is of the form 2k −1,2 if the number of dimensions is a power of two,0 otherwise, There are no Euclidean regular star tessellations in any number of dimensions. A one-dimensional polytope or 1-polytope is a line segment, bounded by its two endpoints. A 1-polytope is regular by definition and is represented by Schläfli symbol, norman Johnson calls it a ditel and gives it the Schläfli symbol. Although trivial as a polytope, it appears as the edges of polygons and it is used in the definition of uniform prisms like Schläfli symbol ×, or Coxeter diagram as a Cartesian product of a line segment and a regular polygon. The two-dimensional polytopes are called polygons, Regular polygons are equilateral and cyclic. A p-gonal regular polygon is represented by Schläfli symbol, usually only convex polygons are considered regular, but star polygons, like the pentagram, can also be considered regular. They use the same vertices as the forms, but connect in an alternate connectivity which passes around the circle more than once to complete. Star polygons should be called nonconvex rather than concave because the edges do not generate new vertices. The Schläfli symbol represents a regular p-gon, the regular digon can be considered to be a degenerate regular polygon
21.
Square tiling
–
In geometry, the square tiling, square tessellation or square grid is a regular tiling of the Euclidean plane. It has Schläfli symbol of, meaning it has 4 squares around every vertex, the internal angle of the square is 90 degrees so four squares at a point make a full 360 degrees. It is one of three regular tilings of the plane, the other two are the triangular tiling and the hexagonal tiling. There are 9 distinct uniform colorings of a square tiling, naming the colors by indices on the 4 squares around a vertex,1111,1112,1112,1122,1123,1123,1212,1213,1234. Cases have simple reflection symmetry, and glide reflection symmetry, three can be seen in the same symmetry domain as reduced colorings, 1112i from 1213, 1123i from 1234, and 1112ii reduced from 1123ii. This tiling is related as a part of sequence of regular polyhedra and tilings, extending into the hyperbolic plane. Like the uniform there are eight uniform tilings that can be based from the regular square tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. However treating faces identically, there are only three distinct forms, square tiling, truncated square tiling, snub square tiling. Other quadrilateral tilings can be made with topologically equivalent to the square tiling, isohedral tilings have identical faces and vertex-transitivity, there are 17 variations, with 6 identified as triangles that do not connect edge-to-edge, or as quadrilateral with two colinear edges. Symmetry given assumes all faces are the same color, the square tiling can be used as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with 4 other circles in the packing, the packing density is π/4=78. 54% coverage. There are 4 uniform colorings of the circle packings, there are 3 regular complex apeirogons, sharing the vertices of the square tiling. Regular complex apeirogons have vertices and edges, where edges can contain 2 or more vertices, Regular apeirogons pr are contrained by, 1/p + 2/q + 1/r =1. Edges have p vertices, and vertex figures are r-gonal, checkerboard List of regular polytopes List of uniform tilings Square lattice Tilings of regular polygons Coxeter, H. S. M. Regular Polytopes, Dover edition, ISBN 0-486-61480-8 p.296, Table II, Regular honeycombs Klitzing, 2D Euclidean tilings o4o4x - squat - O1. The Geometrical Foundation of Natural Structure, A Source Book of Design, p36 Grünbaum, Branko, and Shephard, G. C. CS1 maint, Multiple names, authors list John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, ISBN 978-1-56881-220-5 Weisstein, Eric W. Square Grid
22.
Uniform coloring
–
In geometry, a uniform coloring is a property of a uniform figure that is colored to be vertex-transitive. Different symmetries can be expressed on the geometric figure with the faces following different uniform color patterns. A uniform coloring can be specified by listing the different colors with indices around a vertex figure, in addition, an n-uniform coloring is a property of a uniform figure which has n types vertex figure, that are collectively vertex transitive. A related term is Archimedean color requires one vertex figure coloring repeated in a periodic arrangement, a more general term are k-Archimedean colorings which count k distinctly colored vertex figures. For example this Archimedean coloring of a tiling has two colors, but requires 4 unique colors by symmetry positions and become a 2-uniform coloring, Grünbaum, Branko, Shephard. CS1 maint, Multiple names, authors list Uniform and Archimedean colorings, pp. 102–107 Weisstein, Uniform Tessellations on the Euclid plane Tessellations of the Plane David Baileys World of Tessellations k-uniform tilings n-uniform tilings
23.
Archimedean coloring
–
In geometry, a uniform coloring is a property of a uniform figure that is colored to be vertex-transitive. Different symmetries can be expressed on the geometric figure with the faces following different uniform color patterns. A uniform coloring can be specified by listing the different colors with indices around a vertex figure, in addition, an n-uniform coloring is a property of a uniform figure which has n types vertex figure, that are collectively vertex transitive. A related term is Archimedean color requires one vertex figure coloring repeated in a periodic arrangement, a more general term are k-Archimedean colorings which count k distinctly colored vertex figures. For example this Archimedean coloring of a tiling has two colors, but requires 4 unique colors by symmetry positions and become a 2-uniform coloring, Grünbaum, Branko, Shephard. CS1 maint, Multiple names, authors list Uniform and Archimedean colorings, pp. 102–107 Weisstein, Uniform Tessellations on the Euclid plane Tessellations of the Plane David Baileys World of Tessellations k-uniform tilings n-uniform tilings
24.
Vertex arrangement
–
In geometry, a vertex arrangement is a set of points in space described by their relative positions. They can be described by their use in polytopes, for example, a square vertex arrangement is understood to mean four points in a plane, equal distance and angles from a center point. Two polytopes share the same vertex arrangement if they share the same 0-skeleton, the same set of vertices can be connected by edges in different ways. For example, the pentagon and pentagram have the same vertex arrangement, a vertex arrangement is often described by the convex hull polytope which contains it. For example, the regular pentagram can be said to have a vertex arrangement. Infinite tilings can also share common vertex arrangements, for example, this triangular lattice of points can be connected to form either isosceles triangles or rhombic faces. Polyhedra can also share an edge arrangement while differing in their faces, for example, of the ten nonconvex regular Schläfli-Hess polychora, there are only 7 unique face arrangements. Synonyms for special cases include company for a 2-regiment and army for a 0-regiment, n-skeleton - a set of elements of dimension n and lower in a higher polytope. Vertex figure - A local arrangement of faces in a polyhedron around a single vertex, archived from the original on 4 February 2007. Archived from the original on 4 February 2007, archived from the original on 4 February 2007
25.
Simplectic honeycomb
–
In geometry, the simplectic honeycomb is a dimensional infinite series of honeycombs, based on the A ~ n affine Coxeter group symmetry. It is given a Schläfli symbol, and is represented by a Coxeter-Dynkin diagram as a graph of n+1 nodes with one node ringed. It is composed of facets, along with all rectified n-simplices. It can be thought of as an n-dimensional hypercubic honeycomb that has been subdivided along all hyperplanes x + y +, ∈ Z, then stretched along its main diagonal until the simplices on the ends of the hypercubes become regular. The vertex figure of a honeycomb is an expanded n-simplex. In 2 dimensions, the honeycomb represents the triangular tiling, with Coxeter graph filling the plane with alternately colored triangles, in 3 dimensions it represents the tetrahedral-octahedral honeycomb, with Coxeter graph filling space with alternately tetrahedral and octahedral cells. In 4 dimensions it is called the 5-cell honeycomb, with Coxeter graph, with 5-cell, in 5 dimensions it is called the 5-simplex honeycomb, with Coxeter graph, filling space by 5-simplex, rectified 5-simplex, and birectified 5-simplex facets. In 6 dimensions it is called the 6-simplex honeycomb, with Coxeter graph, filling space by 6-simplex, rectified 6-simplex, for 2 and 3 dimensions, this represents the highest kissing number for 2 and 3 dimensions, but fall short on higher dimensions. For 4 to 8 dimensions, the numbers are 20,30,42,56, and 72 spheres, while the greatest solutions are 24,40,72,126. Norman Johnson Uniform Polytopes, Manuscript Coxeter, H. S. M, Regular Polytopes, Dover edition, ISBN 0-486-61480-8 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III
26.
Circle packing
–
This article describes the packing of circles on surfaces. For the related article on circle packing with an intersection graph. In geometry, circle packing is the study of the arrangement of circles on a surface such that no overlapping occurs. The associated packing density, η, of an arrangement is the proportion of the covered by the circles. Generalisations can be made to higher dimensions – this is called sphere packing, while the circle has a relatively low maximum packing density of 0.9069 on the Euclidean plane, it does not have the lowest possible. Packing densities of concave shapes such as star polygons can be arbitrarily small, the density of this arrangement is η h = π23 ≈0.9069. Axel Thue provided the first proof that this was optimal in 1890, showing that the lattice is the densest of all possible circle packings. However, his proof was considered by some to be incomplete, the first rigorous proof is attributed to László Fejes Tóth in 1940. At the other extreme, very low density arrangements of rigidly packed circles have been identified, there are 11 circle packings based on the 11 uniform tilings of the plane. In these packings, every circle can be mapped to every other circle by reflections and rotations, the hexagonal gaps can be filled by one circle and the dodecagonal gaps can be filled with 7 circles, creating 3-uniform packings. The truncated trihexagonal tiling with both types of gaps can be filled as a 4-uniform packing, the snub hexagonal tiling has two mirror-image forms. A related problem is to determine the arrangement of identically interacting points that are constrained to lie within a given surface. The Thomson problem deals with the lowest energy distribution of electric charges on the surface of a sphere. The Tammes problem is a generalisation of this, dealing with maximising the minimum distance between circles on sphere and this is analogous to distributing non-point charges on a sphere. Packing circles in simple bounded shapes is a type of problem in recreational mathematics. The influence of the walls is important, and hexagonal packing is generally not optimal for small numbers of circles. There are also a range of problems which permit the sizes of the circles to be non-uniform, one such extension is to find the maximum possible density of a system with two specific sizes of circle. Only nine particular radius ratios permit compact packing, which is when every pair of circles in contact is in contact with two other circles
27.
Kissing number
–
In geometry, a kissing number is defined as the number of non-overlapping unit spheres that can be arranged such that they each touch another given unit sphere. For a lattice packing the kissing number is the same for every sphere, other names for kissing number that have been used are Newton number, and contact number. In general, the number problem seeks the maximum possible kissing number for n-dimensional spheres in -dimensional Euclidean space. Ordinary spheres correspond to two-dimensional closed surfaces in three-dimensional space, finding the kissing number when centers of spheres are confined to a line or a plane is trivial. Proving a solution to the case, despite being easy to conceptualise and model in the physical world. Solutions in higher dimensions are more challenging, and only a handful of cases have been solved exactly. For others investigations have determined upper and lower bounds, but not exact solutions. In one dimension, the number is 2, In two dimensions, the kissing number is 6, Proof, Consider a circle with center C that is touched by circles with centers C1. These rays all emanate from the same center C, so the sum of angles between adjacent rays is 360°, assume by contradiction that there are more than six touching circles. Then at least two adjacent rays, say C C1 and C C2, are separated by an angle of less than 60°, the segments C Ci have the same length – 2r – for all i. Therefore the triangle C C1 C2 is isosceles, and its third side – C1 C2 – has a length of less than 2r. Therefore the circles 1 and 2 intersect – a contradiction, in three dimensions, the kissing number is 12, but the correct value was much more difficult to establish than in dimensions one and two. It is easy to arrange 12 spheres so that each touches a central sphere, but there is a lot of left over. This was the subject of a disagreement between mathematicians Isaac Newton and David Gregory. Newton correctly thought that the limit was 12, Gregory thought that a 13th could fit, some incomplete proofs that Newton was correct were offered in the nineteenth century, most notably one by Reinhold Hoppe, but the first correct proof did not appear until 1953. The twelve neighbors of the sphere correspond to the maximum bulk coordination number of an atom in a crystal lattice in which all atoms have the same size. A coordination number of 12 is found in a cubic close-packed or a hexagonal close-packed structure, in four dimensions, it was known for some time that the answer is either 24 or 25. It is easy to produce a packing of 24 spheres around a central sphere, as in the three-dimensional case, there is a lot of space left over—even more, in fact, than for n = 3—so the situation was even less clear
28.
Voronoi cell
–
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set of points is specified beforehand, and for each seed there is a region consisting of all points closer to that seed than to any other. These regions are called Voronoi cells, the Voronoi diagram of a set of points is dual to its Delaunay triangulation. It is named after Georgy Voronoi, and is called a Voronoi tessellation, a Voronoi decomposition. Voronoi diagrams have practical and theoretical applications to a number of fields, mainly in science and technology. They are also known as Thiessen polygons, in the simplest case, shown in the first picture, we are given a finite set of points in the Euclidean plane. Each such cell is obtained from the intersection of half-spaces, the line segments of the Voronoi diagram are all the points in the plane that are equidistant to the two nearest sites. The Voronoi vertices are the points equidistant to three sites, let X be a metric space with distance function d. Let K be a set of indices and let k ∈ K be a tuple of nonempty subsets in the space X. In other words, if d = inf denotes the distance between the point x and the subset A, then R k = The Voronoi diagram is simply the tuple of cells k ∈ K. In principle some of the sites can intersect and even coincide, in addition, infinitely many sites are allowed in the definition, but again, in many cases only finitely many sites are considered. Sometimes the induced combinatorial structure is referred to as the Voronoi diagram, however, in general the Voronoi cells may not be convex or even connected. In the usual Euclidean space, we can rewrite the definition in usual terms. Each Voronoi polygon R k is associated with a generator point P k, let X be the set of all points in the Euclidean space. Let P1 be a point that generates its Voronoi region R1, P2 that generates R2, and P3 that generates R3, and so on. Then, as expressed by Tran et al all locations in the Voronoi polygon are closer to the point of that polygon than any other generator point in the Voronoi diagram in Euclidian plane. As a simple illustration, consider a group of shops in a city, suppose we want to estimate the number of customers of a given shop. With all else being equal, it is reasonable to assume that customers choose their preferred shop simply by distance considerations, they will go to the shop located nearest to them
29.
Hexagon
–
In geometry, a hexagon is a six sided polygon or 6-gon. The total of the angles of any hexagon is 720°. A regular hexagon has Schläfli symbol and can also be constructed as an equilateral triangle, t. A regular hexagon is defined as a hexagon that is both equilateral and equiangular and it is bicentric, meaning that it is both cyclic and tangential. The common length of the sides equals the radius of the circumscribed circle, all internal angles are 120 degrees. A regular hexagon has 6 rotational symmetries and 6 reflection symmetries, the longest diagonals of a regular hexagon, connecting diametrically opposite vertices, are twice the length of one side. Like squares and equilateral triangles, regular hexagons fit together without any gaps to tile the plane, the cells of a beehive honeycomb are hexagonal for this reason and because the shape makes efficient use of space and building materials. The Voronoi diagram of a triangular lattice is the honeycomb tessellation of hexagons. It is not usually considered a triambus, although it is equilateral, the maximal diameter, D is twice the maximal radius or circumradius, R, which equals the side length, t. The minimal diameter or the diameter of the circle, d, is twice the minimal radius or inradius. If a regular hexagon has successive vertices A, B, C, D, E, F, the regular hexagon has Dih6 symmetry, order 12. There are 3 dihedral subgroups, Dih3, Dih2, and Dih1, and 4 cyclic subgroups, Z6, Z3, Z2 and these symmetries express 9 distinct symmetries of a regular hexagon. John Conway labels these by a letter and group order, r12 is full symmetry, and a1 is no symmetry. These two forms are duals of each other and have half the order of the regular hexagon. The i4 forms are regular hexagons flattened or stretched along one symmetry direction and it can be seen as an elongated rhombus, while d2 and p2 can be seen as horizontally and vertically elongated kites. G2 hexagons, with sides parallel are also called hexagonal parallelogons. Each subgroup symmetry allows one or more degrees of freedom for irregular forms, only the g6 subgroup has no degrees of freedom but can seen as directed edges. Hexagons of symmetry g2, i4, and r12, as parallelogons can tessellate the Euclidean plane by translation, other hexagon shapes can tile the plane with different orientations
30.
Voronoi tessellation
–
In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane. That set of points is specified beforehand, and for each seed there is a region consisting of all points closer to that seed than to any other. These regions are called Voronoi cells, the Voronoi diagram of a set of points is dual to its Delaunay triangulation. It is named after Georgy Voronoi, and is called a Voronoi tessellation, a Voronoi decomposition. Voronoi diagrams have practical and theoretical applications to a number of fields, mainly in science and technology. They are also known as Thiessen polygons, in the simplest case, shown in the first picture, we are given a finite set of points in the Euclidean plane. Each such cell is obtained from the intersection of half-spaces, the line segments of the Voronoi diagram are all the points in the plane that are equidistant to the two nearest sites. The Voronoi vertices are the points equidistant to three sites, let X be a metric space with distance function d. Let K be a set of indices and let k ∈ K be a tuple of nonempty subsets in the space X. In other words, if d = inf denotes the distance between the point x and the subset A, then R k = The Voronoi diagram is simply the tuple of cells k ∈ K. In principle some of the sites can intersect and even coincide, in addition, infinitely many sites are allowed in the definition, but again, in many cases only finitely many sites are considered. Sometimes the induced combinatorial structure is referred to as the Voronoi diagram, however, in general the Voronoi cells may not be convex or even connected. In the usual Euclidean space, we can rewrite the definition in usual terms. Each Voronoi polygon R k is associated with a generator point P k, let X be the set of all points in the Euclidean space. Let P1 be a point that generates its Voronoi region R1, P2 that generates R2, and P3 that generates R3, and so on. Then, as expressed by Tran et al all locations in the Voronoi polygon are closer to the point of that polygon than any other generator point in the Voronoi diagram in Euclidian plane. As a simple illustration, consider a group of shops in a city, suppose we want to estimate the number of customers of a given shop. With all else being equal, it is reasonable to assume that customers choose their preferred shop simply by distance considerations, they will go to the shop located nearest to them
31.
Scalene triangle
–
A triangle is a polygon with three edges and three vertices. It is one of the shapes in geometry. A triangle with vertices A, B, and C is denoted △ A B C, in Euclidean geometry any three points, when non-collinear, determine a unique triangle and a unique plane. This article is about triangles in Euclidean geometry except where otherwise noted, triangles can be classified according to the lengths of their sides, An equilateral triangle has all sides the same length. An equilateral triangle is also a polygon with all angles measuring 60°. An isosceles triangle has two sides of equal length, some mathematicians define an isosceles triangle to have exactly two equal sides, whereas others define an isosceles triangle as one with at least two equal sides. The latter definition would make all equilateral triangles isosceles triangles, the 45–45–90 right triangle, which appears in the tetrakis square tiling, is isosceles. A scalene triangle has all its sides of different lengths, equivalently, it has all angles of different measure. Hatch marks, also called tick marks, are used in diagrams of triangles, a side can be marked with a pattern of ticks, short line segments in the form of tally marks, two sides have equal lengths if they are both marked with the same pattern. In a triangle, the pattern is no more than 3 ticks. Similarly, patterns of 1,2, or 3 concentric arcs inside the angles are used to indicate equal angles, triangles can also be classified according to their internal angles, measured here in degrees. A right triangle has one of its interior angles measuring 90°, the side opposite to the right angle is the hypotenuse, the longest side of the triangle. The other two sides are called the legs or catheti of the triangle, special right triangles are right triangles with additional properties that make calculations involving them easier. One of the two most famous is the 3–4–5 right triangle, where 32 +42 =52, in this situation,3,4, and 5 are a Pythagorean triple. The other one is a triangle that has 2 angles that each measure 45 degrees. Triangles that do not have an angle measuring 90° are called oblique triangles, a triangle with all interior angles measuring less than 90° is an acute triangle or acute-angled triangle. If c is the length of the longest side, then a2 + b2 > c2, a triangle with one interior angle measuring more than 90° is an obtuse triangle or obtuse-angled triangle. If c is the length of the longest side, then a2 + b2 < c2, a triangle with an interior angle of 180° is degenerate
32.
Isosceles triangle
–
In geometry, an isosceles triangle is a triangle that has two sides of equal length. By the isosceles triangle theorem, the two angles opposite the sides are themselves equal, while if the third side is different then the third angle is different. By the Steiner–Lehmus theorem, every triangle with two angle bisectors of equal length is isosceles, in an isosceles triangle that has exactly two equal sides, the equal sides are called legs and the third side is called the base. The angle included by the legs is called the vertex angle, the vertex opposite the base is called the apex. In the equilateral triangle case, since all sides are equal, any side can be called the base, if needed, and the term leg is not generally used. A triangle with two equal sides has exactly one axis of symmetry, which goes through the vertex angle. Thus the axis of symmetry coincides with the bisector of the vertex angle, the median drawn to the base, the altitude drawn from the vertex angle. Whether the isosceles triangle is acute, right or obtuse depends on the vertex angle, in Euclidean geometry, the base angles cannot be obtuse or right because their measures would sum to at least 180°, the total of all angles in any Euclidean triangle. The Euler line of any triangle goes through the orthocenter, its centroid. In an isosceles triangle with two equal sides, the Euler line coincides with the axis of symmetry. This can be seen as follows, if the vertex angle is acute, then the orthocenter, the centroid, and the circumcenter all fall inside the triangle. In an isosceles triangle the incenter lies on the Euler line, the Steiner inellipse of any triangle is the unique ellipse that is internally tangent to the triangles three sides at their midpoints. For any isosceles triangle with area T and perimeter p, we have 2 p b 3 − p 2 b 2 +16 T2 =0. By substituting the height, the formula for the area of a triangle can be derived from the general formula one-half the base times the height. This is what Herons formula reduces to in the isosceles case, if the apex angle and leg lengths of an isosceles triangle are known, then the area of that triangle is, T =2 = a 2 sin cos . This is derived by drawing a line from the base of the triangle. The bases of two right triangles are both equal to the hypotenuse times the sine of the bisected angle by definition of the term sine. For the same reason, the heights of these triangles are equal to the times the cosine of the bisected angle
33.
Right triangle
–
A right triangle or right-angled triangle is a triangle in which one angle is a right angle. The relation between the sides and angles of a triangle is the basis for trigonometry. The side opposite the angle is called the hypotenuse. The sides adjacent to the angle are called legs. Side a may be identified as the adjacent to angle B and opposed to angle A, while side b is the side adjacent to angle A. If the lengths of all three sides of a triangle are integers, the triangle is said to be a Pythagorean triangle. As with any triangle, the area is equal to one half the base multiplied by the corresponding height. In a right triangle, if one leg is taken as the then the other is height. As a formula the area T is T =12 a b where a and b are the legs of the triangle and this formula only applies to right triangles. From this, The altitude to the hypotenuse is the mean of the two segments of the hypotenuse. Each leg of the triangle is the mean proportional of the hypotenuse, in equations, f 2 = d e, b 2 = c e, a 2 = c d where a, b, c, d, e, f are as shown in the diagram. Moreover, the altitude to the hypotenuse is related to the legs of the triangle by 1 a 2 +1 b 2 =1 f 2. For solutions of this equation in integer values of a, b, f, the altitude from either leg coincides with the other leg. Since these intersect at the vertex, the right triangles orthocenter—the intersection of its three altitudes—coincides with the right-angled vertex. The Pythagorean theorem states that, In any right triangle, the area of the square whose side is the hypotenuse is equal to the sum of the areas of the squares whose sides are the two legs. This can be stated in equation form as a 2 + b 2 = c 2 where c is the length of the hypotenuse, Pythagorean triples are integer values of a, b, c satisfying this equation. The radius of the incircle of a triangle with legs a and b. The radius of the circumcircle is half the length of the hypotenuse, thus the sum of the circumradius and the inradius is half the sum of the legs, R + r = a + b 2
34.
Equilateral triangle
–
In geometry, an equilateral triangle is a triangle in which all three sides are equal. In the familiar Euclidean geometry, equilateral triangles are also equiangular and they are regular polygons, and can therefore also be referred to as regular triangles. Thus these are properties that are unique to equilateral triangles, the three medians have equal lengths. The three angle bisectors have equal lengths, every triangle center of an equilateral triangle coincides with its centroid, which implies that the equilateral triangle is the only triangle with no Euler line connecting some of the centers. For some pairs of triangle centers, the fact that they coincide is enough to ensure that the triangle is equilateral, in particular, A triangle is equilateral if any two of the circumcenter, incenter, centroid, or orthocenter coincide. It is also equilateral if its circumcenter coincides with the Nagel point, for any triangle, the three medians partition the triangle into six smaller triangles. A triangle is equilateral if and only if any three of the triangles have either the same perimeter or the same inradius. A triangle is equilateral if and only if the circumcenters of any three of the triangles have the same distance from the centroid. Morleys trisector theorem states that, in any triangle, the three points of intersection of the adjacent angle trisectors form an equilateral triangle, a version of the isoperimetric inequality for triangles states that the triangle of greatest area among all those with a given perimeter is equilateral. That is, PA, PB, and PC satisfy the inequality that any two of them sum to at least as great as the third. By Eulers inequality, the triangle has the smallest ratio R/r of the circumradius to the inradius of any triangle, specifically. The triangle of largest area of all those inscribed in a circle is equilateral. The ratio of the area of the incircle to the area of an equilateral triangle, the ratio of the area to the square of the perimeter of an equilateral triangle,1123, is larger than that for any other triangle. If a segment splits an equilateral triangle into two regions with equal perimeters and with areas A1 and A2, then 79 ≤ A1 A2 ≤97, in no other triangle is there a point for which this ratio is as small as 2. For any point P in the plane, with p, q, and t from the vertices A, B. For any point P on the circle of an equilateral triangle, with distances p, q. There are numerous triangle inequalities that hold with equality if and only if the triangle is equilateral, an equilateral triangle is the most symmetrical triangle, having 3 lines of reflection and rotational symmetry of order 3 about its center. Its symmetry group is the group of order 6 D3
35.
Polyhedra
–
In geometry, a polyhedron is a solid in three dimensions with flat polygonal faces, straight edges and sharp corners or vertices. The word polyhedron comes from the Classical Greek πολύεδρον, as poly- + -hedron, a convex polyhedron is the convex hull of finitely many points, not all on the same plane. Cubes and pyramids are examples of convex polyhedra, a polyhedron is a 3-dimensional example of the more general polytope in any number of dimensions. Convex polyhedra are well-defined, with several equivalent standard definitions, however, the formal mathematical definition of polyhedra that are not required to be convex has been problematic. Many definitions of polyhedron have been given within particular contexts, some more rigorous than others, some of these definitions exclude shapes that have often been counted as polyhedra or include shapes that are often not considered as valid polyhedra. As Branko Grünbaum observed, The Original Sin in the theory of polyhedra goes back to Euclid, the writers failed to define what are the polyhedra. Nevertheless, there is agreement that a polyhedron is a solid or surface that can be described by its vertices, edges, faces. Natural refinements of this definition require the solid to be bounded, to have a connected interior, and possibly also to have a connected boundary. However, the polyhedra defined in this way do not include the self-crossing star polyhedra, their faces may not form simple polygons, definitions based on the idea of a bounding surface rather than a solid are also common. If a planar part of such a surface is not itself a convex polygon, ORourke requires it to be subdivided into smaller convex polygons, cromwell gives a similar definition but without the restriction of three edges per vertex. Again, this type of definition does not encompass the self-crossing polyhedra, however, there exist topological polyhedra that cannot be realized as acoptic polyhedra. One modern approach is based on the theory of abstract polyhedra and these can be defined as partially ordered sets whose elements are the vertices, edges, and faces of a polyhedron. A vertex or edge element is less than an edge or face element when the vertex or edge is part of the edge or face, additionally, one may include a special bottom element of this partial order and a top element representing the whole polyhedron. However, these requirements are relaxed, to instead require only that the sections between elements two levels apart from line segments. Geometric polyhedra, defined in other ways, can be described abstractly in this way, a realization of an abstract polyhedron is generally taken to be a mapping from the vertices of the abstract polyhedron to geometric points, such that the points of each face are coplanar. A geometric polyhedron can then be defined as a realization of an abstract polyhedron, realizations that forgo the requirement of planarity, that impose additional requirements of symmetry, or that map the vertices to higher dimensional spaces have also been considered. Unlike the solid-based and surface-based definitions, this perfectly well for star polyhedra. However, without restrictions, this definition allows degenerate or unfaithful polyhedra
36.
Pyramid (geometry)
–
In geometry, a pyramid is a polyhedron formed by connecting a polygonal base and a point, called the apex. Each base edge and apex form a triangle, called a lateral face and it is a conic solid with polygonal base. A pyramid with a base has n +1 vertices, n +1 faces. A right pyramid has its apex directly above the centroid of its base, nonright pyramids are called oblique pyramids. A regular pyramid has a polygon base and is usually implied to be a right pyramid. When unspecified, a pyramid is usually assumed to be a square pyramid. A triangle-based pyramid is often called a tetrahedron. Among oblique pyramids, like acute and obtuse triangles, a pyramid can be called if its apex is above the interior of the base and obtuse if its apex is above the exterior of the base. A right-angled pyramid has its apex above an edge or vertex of the base, in a tetrahedron these qualifiers change based on which face is considered the base. Pyramids are a subclass of the prismatoids, pyramids can be doubled into bipyramids by adding a second offset point on the other side of the base plane. A right pyramid with a base has isosceles triangle sides, with symmetry is Cnv or. It can be given an extended Schläfli symbol ∨, representing a point, a join operation creates a new edge between all pairs of vertices of the two joined figures. The trigonal or triangular pyramid with all equilateral triangles faces becomes the regular tetrahedron, a lower symmetry case of the triangular pyramid is C3v, which has an equilateral triangle base, and 3 identical isosceles triangle sides. The square and pentagonal pyramids can also be composed of convex polygons. Right pyramids with regular star polygon bases are called star pyramids, for example, the pentagrammic pyramid has a pentagram base and 5 intersecting triangle sides. A right pyramid can be named as ∨P, where is the point, ∨ is a join operator. It has C1v symmetry from two different base-apex orientations, and C2v in its full symmetry, a rectangular right pyramid, written as ∨, and a rhombic pyramid, as ∨, both have symmetry C2v. The volume of a pyramid is V =13 b h and this works for any polygon, regular or non-regular, and any location of the apex, provided that h is measured as the perpendicular distance from the plane containing the base
37.
Platonic solid
–
In three-dimensional space, a Platonic solid is a regular, convex polyhedron. It is constructed by congruent regular polygonal faces with the number of faces meeting at each vertex. Five solids meet those criteria, Geometers have studied the mathematical beauty and they are named for the ancient Greek philosopher Plato who theorized in his dialogue, the Timaeus, that the classical elements were made of these regular solids. The Platonic solids have been known since antiquity, dice go back to the dawn of civilization with shapes that predated formal charting of Platonic solids. The ancient Greeks studied the Platonic solids extensively, some sources credit Pythagoras with their discovery. In any case, Theaetetus gave a description of all five. The Platonic solids are prominent in the philosophy of Plato, their namesake, Plato wrote about them in the dialogue Timaeus c.360 B. C. in which he associated each of the four classical elements with a regular solid. Earth was associated with the cube, air with the octahedron, water with the icosahedron, there was intuitive justification for these associations, the heat of fire feels sharp and stabbing. Air is made of the octahedron, its components are so smooth that one can barely feel it. Water, the icosahedron, flows out of hand when picked up. By contrast, a highly nonspherical solid, the hexahedron represents earth and these clumsy little solids cause dirt to crumble and break when picked up in stark difference to the smooth flow of water. Moreover, the cubes being the regular solid that tessellates Euclidean space was believed to cause the solidity of the Earth. Of the fifth Platonic solid, the dodecahedron, Plato obscurely remarks. the god used for arranging the constellations on the whole heaven. Aristotle added an element, aithēr and postulated that the heavens were made of this element. Euclid completely mathematically described the Platonic solids in the Elements, the last book of which is devoted to their properties, propositions 13–17 in Book XIII describe the construction of the tetrahedron, octahedron, cube, icosahedron, and dodecahedron in that order. For each solid Euclid finds the ratio of the diameter of the sphere to the edge length. In Proposition 18 he argues there are no further convex regular polyhedra. Andreas Speiser has advocated the view that the construction of the 5 regular solids is the goal of the deductive system canonized in the Elements
38.
Icosahedron
–
In geometry, an icosahedron is a polyhedron with 20 faces. The name comes from Greek εἴκοσι, meaning twenty, and ἕδρα, the plural can be either icosahedra or icosahedrons. There are many kinds of icosahedra, with some being more symmetrical than others, the best known is the Platonic, convex regular icosahedron. There are two objects, one convex and one concave, that can both be called regular icosahedra, each has 30 edges and 20 equilateral triangle faces with five meeting at each of its twelve vertices. The term regular icosahedron generally refers to the variety, while the nonconvex form is called a great icosahedron. Its dual polyhedron is the dodecahedron having three regular pentagonal faces around each vertex. The great icosahedron is one of the four regular star Kepler-Poinsot polyhedra, like the convex form, it also has 20 equilateral triangle faces, but its vertex figure is a pentagram rather than a pentagon, leading to geometrically intersecting faces. The intersections of the triangles do not represent new edges and its dual polyhedron is the great stellated dodecahedron, having three regular star pentagonal faces around each vertex. Stellation is the process of extending the faces or edges of a polyhedron until they meet to form a new polyhedron and it is done symmetrically so that the resulting figure retains the overall symmetry of the parent figure. In their book The Fifty-Nine Icosahedra, Coxeter et al. enumerated 58 such stellations of the regular icosahedron, of these, many have a single face in each of the 20 face planes and so are also icosahedra. The great icosahedron is among them, other stellations have more than one face in each plane or form compounds of simpler polyhedra. These are not strictly icosahedra, although they are referred to as such. A regular icosahedron can be distorted or marked up as a lower symmetry, and is called a snub octahedron, snub tetratetrahedron, snub tetrahedron. This can be seen as a truncated octahedron. If all the triangles are equilateral, the symmetry can also be distinguished by colouring the 8 and 12 triangle sets differently, pyritohedral symmetry has the symbol, with order 24. Tetrahedral symmetry has the symbol, +, with order 12 and these lower symmetries allow geometric distortions from 20 equilateral triangular faces, instead having 8 equilateral triangles and 12 congruent isosceles triangles. These symmetries offer Coxeter diagrams, and respectively, each representing the lower symmetry to the regular icosahedron, the coordinates of the 12 vertices can be defined by the vectors defined by all the possible cyclic permutations and sign-flips of coordinates of the form. These coordinates represent the truncated octahedron with alternated vertices deleted and this construction is called a snub tetrahedron in its regular icosahedron form, generated by the same operations carried out starting with the vector, where ϕ is the golden ratio
39.
Octahedron
–
In geometry, an octahedron is a polyhedron with eight faces, twelve edges, and six vertices. A regular octahedron is a Platonic solid composed of eight equilateral triangles, a regular octahedron is the dual polyhedron of a cube. It is a square bipyramid in any of three orthogonal orientations and it is also a triangular antiprism in any of four orientations. An octahedron is the case of the more general concept of a cross polytope. A regular octahedron is a 3-ball in the Manhattan metric, the second and third correspond to the B2 and A2 Coxeter planes. The octahedron can also be represented as a tiling. This projection is conformal, preserving angles but not areas or lengths, straight lines on the sphere are projected as circular arcs on the plane. An octahedron with edge length √2 can be placed with its center at the origin and its vertices on the coordinate axes, the Cartesian coordinates of the vertices are then. In an x–y–z Cartesian coordinate system, the octahedron with center coordinates, additionally the inertia tensor of the stretched octahedron is I =. These reduce to the equations for the regular octahedron when x m = y m = z m = a 22, the interior of the compound of two dual tetrahedra is an octahedron, and this compound, called the stella octangula, is its first and only stellation. Correspondingly, an octahedron is the result of cutting off from a regular tetrahedron. One can also divide the edges of an octahedron in the ratio of the mean to define the vertices of an icosahedron. There are five octahedra that define any given icosahedron in this fashion, octahedra and tetrahedra can be alternated to form a vertex, edge, and face-uniform tessellation of space, called the octet truss by Buckminster Fuller. This is the only such tiling save the regular tessellation of cubes, another is a tessellation of octahedra and cuboctahedra. The octahedron is unique among the Platonic solids in having a number of faces meeting at each vertex. Consequently, it is the member of that group to possess mirror planes that do not pass through any of the faces. Using the standard nomenclature for Johnson solids, an octahedron would be called a square bipyramid, truncation of two opposite vertices results in a square bifrustum. The octahedron is 4-connected, meaning that it takes the removal of four vertices to disconnect the remaining vertices and it is one of only four 4-connected simplicial well-covered polyhedra, meaning that all of the maximal independent sets of its vertices have the same size
40.
Tetrahedron
–
In geometry, a tetrahedron, also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra, the tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a polygon base. In the case of a tetrahedron the base is a triangle, like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. For any tetrahedron there exists a sphere on which all four vertices lie, a regular tetrahedron is one in which all four faces are equilateral triangles. It is one of the five regular Platonic solids, which have known since antiquity. In a regular tetrahedron, not only are all its faces the same size and shape, regular tetrahedra alone do not tessellate, but if alternated with regular octahedra they form the alternated cubic honeycomb, which is a tessellation. The regular tetrahedron is self-dual, which means that its dual is another regular tetrahedron, the compound figure comprising two such dual tetrahedra form a stellated octahedron or stella octangula. This form has Coxeter diagram and Schläfli symbol h, the tetrahedron in this case has edge length 2√2. Inverting these coordinates generates the dual tetrahedron, and the together form the stellated octahedron. In other words, if C is the centroid of the base and this follows from the fact that the medians of a triangle intersect at its centroid, and this point divides each of them in two segments, one of which is twice as long as the other. The vertices of a cube can be grouped into two groups of four, each forming a regular tetrahedron, the symmetries of a regular tetrahedron correspond to half of those of a cube, those that map the tetrahedra to themselves, and not to each other. The tetrahedron is the only Platonic solid that is not mapped to itself by point inversion, the regular tetrahedron has 24 isometries, forming the symmetry group Td, isomorphic to the symmetric group, S4. The first corresponds to the A2 Coxeter plane, the two skew perpendicular opposite edges of a regular tetrahedron define a set of parallel planes. When one of these intersects the tetrahedron the resulting cross section is a rectangle. When the intersecting plane is one of the edges the rectangle is long. When halfway between the two edges the intersection is a square, the aspect ratio of the rectangle reverses as you pass this halfway point. For the midpoint square intersection the resulting boundary line traverses every face of the tetrahedron similarly, if the tetrahedron is bisected on this plane, both halves become wedges
41.
Hyperbolic space
–
In mathematics, hyperbolic space is a homogeneous space that has a constant negative curvature, where in this case the curvature is the sectional curvature. When embedded to a Euclidean space, every point of a space is a saddle point. Hyperbolic n-space, denoted Hn, is the symmetric, simply connected. Hyperbolic space is a space exhibiting hyperbolic geometry and it is the negative-curvature analogue of the n-sphere. Although hyperbolic space Hn is diffeomorphic to Rn, its negative-curvature metric gives it very different geometric properties, hyperbolic 2-space, H2, is also called the hyperbolic plane. Instead, the postulate is replaced by the following alternative, Given any line L and point P not on L. It is then a theorem that there are many such lines through P. This axiom still does not uniquely characterize the hyperbolic plane up to isometry, there is a constant, the curvature K <0. However, it does uniquely characterize it up to homothety, meaning up to bijections which only change the notion of distance by an overall constant, by choosing an appropriate length scale, one can thus assume, without loss of generality, that K = −1. Models of hyperbolic spaces that can be embedded in a flat spaces may be constructed, in particular, the existence of model spaces implies that the parallel postulate is logically independent of the other axioms of Euclidean geometry. There are several important models of space, the Klein model, the hyperboloid model, the Poincaré ball model. These all model the same geometry in the sense that any two of them can be related by a transformation that preserves all the properties of the space. The hyperboloid model realizes hyperbolic space as a hyperboloid in Rn+1 =, the hyperboloid is the locus Hn of points whose coordinates satisfy x 02 − x 12 − ⋯ − x n 2 =1, x 0 >0. In this model a line is the curve formed by the intersection of Hn with a plane through the origin in Rn+1, the hyperboloid model is closely related to the geometry of Minkowski space. The space Rn+1, equipped with the bilinear form B, is an -dimensional Minkowski space Rn,1, one can associate a distance on the hyperboloid model by defining the distance between two points x and y on H to be d = arcosh B. This function satisfies the axioms of a metric space and it is preserved by the action of the Lorentz group on Rn,1. Hence the Lorentz group acts as a group preserving isometry on Hn. An alternative model of geometry is on a certain domain in projective space
42.
Dihedron
–
A dihedron is a type of polyhedron, made of two polygon faces which share the same set of edges. Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons, a regular dihedron is the dihedron formed by two regular polygons, which may be described by the Schläfli symbol. As a spherical polyhedron, each polygon of such a dihedron fills a hemisphere, the dual of a n-gonal dihedron is the n-gonal hosohedron, where n digon faces share two vertices. A dihedron can be considered a degenerate prism consisting of two n-sided polygons connected back-to-back, so that the object has no depth. The polygons must be congruent, but glued in such a way one is the mirror image of the other. This characterization holds also for the distances on the surface of a dihedron, as a spherical tiling, a dihedron can exist as nondegenerate form, with two n-sided faces covering the sphere, each face being a hemisphere, and vertices around a great circle. The regular polyhedron is self-dual, and is both a hosohedron and a dihedron, in the limit the dihedron becomes an apeirogonal dihedron as a 2-dimensional tessellation, A regular ditope is an n-dimensional analogue of a dihedron, with Schläfli symbol. It has two facets, which share all ridges, in common, polyhedron Polytope Weisstein, Eric W. Dihedron
43.
Order-7 triangular tiling
–
In geometry, the order-7 triangular tiling is a regular tiling of the hyperbolic plane with a Schläfli symbol of. The symmetry group of the tiling is the group. The resulting surface can in turn be polyhedrally immersed into Euclidean 3-space, the dual order-3 heptagonal tiling has the same symmetry group, and thus yields heptagonal tilings of Hurwitz surfaces. It is related to two star-tilings by the vertex arrangement, the order-7 heptagrammic tiling, and heptagrammic-order heptagonal tiling. This tiling is related as a part of sequence of regular polyhedra with Schläfli symbol. From a Wythoff construction there are eight uniform tilings that can be based from the regular heptagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. Weisstein, Eric W. Poincaré hyperbolic disk, Hyperbolic and Spherical Tiling Gallery KaleidoTile 3, Educational software to create spherical, planar and hyperbolic tilings Hyperbolic Planar Tessellations, Don Hatch
44.
Order-8 triangular tiling
–
In geometry, the order-8 triangular tiling is a regular tiling of the hyperbolic plane. It is represented by Schläfli symbol of, having eight regular triangles around each vertex, the half symmetry = can be shown with alternating two colors of triangles, From symmetry, there are 15 small index subgroups by mirror removal and alternation operators. Mirrors can be removed if its branch orders are all even, removing two mirrors leaves a half-order gyration point where the removed mirrors met. In these images fundamental domains are alternately colored black and white, adding 3 bisecting mirrors across each fundamental domains creates 832 symmetry. The subgroup index-8 group, is the subgroup of. A larger subgroup is constructed, index 8, as with gyration points removed, the symmetry can be doubled to 842 symmetry by adding a bisecting mirror across the fundamental domains. The symmetry can be extended by 6, as 832 symmetry, from a Wythoff construction there are ten hyperbolic uniform tilings that can be based from the regular octagonal and order-8 triangular tilings. Drawing the tiles colored as red on the faces, yellow at the original vertices. Weisstein, Eric W. Poincaré hyperbolic disk, Hyperbolic and Spherical Tiling Gallery KaleidoTile 3, Educational software to create spherical, planar and hyperbolic tilings Hyperbolic Planar Tessellations, Don Hatch
45.
Infinite-order triangular tiling
–
In geometry, the infinite-order triangular tiling is a regular tiling of the hyperbolic plane with a Schläfli symbol of. All vertices are ideal, located at infinity and seen on the boundary of the Poincaré hyperbolic disk projection, a lower symmetry form has alternating colors, and represented by cyclic symbol. The tiling also represents the fundamental domains of the *∞∞∞ symmetry and this tiling is topologically related as part of a sequence of regular polyhedra with Schläfli symbol. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, ISBN 978-1-56881-220-5 Chapter 10, the Beauty of Geometry, Twelve Essays. Weisstein, Eric W. Poincaré hyperbolic disk
46.
Catalan solid
–
In mathematics, a Catalan solid, or Archimedean dual, is a dual polyhedron to an Archimedean solid. The Catalan solids are named for the Belgian mathematician, Eugène Catalan, the Catalan solids are all convex. They are face-transitive but not vertex-transitive and this is because the dual Archimedean solids are vertex-transitive and not face-transitive. Note that unlike Platonic solids and Archimedean solids, the faces of Catalan solids are not regular polygons, however, the vertex figures of Catalan solids are regular, and they have constant dihedral angles. Being face-transitive, Catalan solids are isohedra, additionally, two of the Catalan solids are edge-transitive, the rhombic dodecahedron and the rhombic triacontahedron. These are the duals of the two quasi-regular Archimedean solids, just as prisms and antiprisms are generally not considered Archimedean solids, so bipyramids and trapezohedra are generally not considered Catalan solids, despite being face-transitive. Two of the Catalan solids are chiral, the pentagonal icositetrahedron and these each come in two enantiomorphs. Not counting the enantiomorphs, bipyramids, and trapezohedra, there are a total of 13 Catalan solids, the Catalan solids, along with their dual Archimedean solids, can be grouped by their symmetry, tetrahedral, octahedral, and icosahedral. There are 6 forms per symmetry, while the self-symmetric tetrahedral group only has three forms and two of those are duplicated with octahedral symmetry. J. lÉcole Polytechnique 41, 1-71,1865, alan Holden Shapes, Space, and Symmetry. Wenninger, Magnus, Dual Models, Cambridge University Press, ISBN 978-0-521-54325-5, MR730208 Williams, the Geometrical Foundation of Natural Structure, A Source Book of Design. California, University of California Press Berkeley, chapter 4, Duals of the Archimedean polyhedra, prisma and antiprisms Weisstein, Eric W. Catalan Solids. Archived from the original on 4 February 2007, Archimedean duals – at Virtual Reality Polyhedra Interactive Catalan Solid in Java
47.
Triakis tetrahedron
–
In geometry, a triakis tetrahedron is an Archimedean dual solid, or a Catalan solid. Its dual is the truncated tetrahedron and it can be seen as a tetrahedron with triangular pyramids added to each face, that is, it is the Kleetope of the tetrahedron. This interpretation is expressed in the name, the length of the shorter edges is 3/5 that of the longer edges. If the triakis tetrahedron has shorter edge length 1, it has area 5/3√11, a triakis tetrahedron with equilateral triangle faces represents a net of the four-dimensional regular polytope known as the 5-cell. If the triangles are right-angled isosceles, the faces will be coplanar and this can be seen by adding the 6 edges of tetrahedron inside of a cube. This chiral figure is one of thirteen stellations allowed by Millers rules, the triakis tetrahedron is a part of a sequence of polyhedra and tilings, extending into the hyperbolic plane. These face-transitive figures have reflectional symmetry, the Geometrical Foundation of Natural Structure, A Source Book of Design
48.
Tetrakis hexahedron
–
In geometry, a tetrakis hexahedron is a Catalan solid. Its dual is the octahedron, an Archimedean solid. It also can be called a disdyakis hexahedron as the dual of an omnitruncated tetrahedron, the tetrakis hexahedron, dual of the truncated octahedron has 3 symmetry positions, two located on vertices and one mid-edge. Naturally occurring formations of tetrahexahedra are observed in copper and fluorite systems, polyhedral dice shaped like the tetrakis hexahedron are occasionally used by gamers. The tetrakis hexahedron appears as one of the simplest examples in building theory, consider the Riemannian symmetric space associated to the group SL4. Its Tits boundary has the structure of a building whose apartments are 2-dimensional spheres. The partition of this sphere into spherical simplices can be obtained by taking the radial projection of a tetrakis hexahedron, with Td, tetrahedral symmetry, the triangular faces represent the 24 fundamental domains of tetrahedral symmetry. This polyhedron can be constructed from 6 great circles on a sphere and it can also be seen by a cube with its square faces triangulated by their vertices and face centers and a tetrahedron with its faces divided by vertices, mid-edges, and a central point. The edges of the tetrakis hexahedron form 6 circles in the plane, each of these 6 circles represent a mirror line in tetrahedral symmetry. The 6 circles can be grouped into 3 sets of 2 pairs of orthogonal circles and these edges can also be seen as a compound of 3 orthogonal square hosohedrons. If we denote the length of the base cube by a. The inclination of each face of the pyramid versus the cube face is arctan. One edge of the triangles has length a, the other two have length 3a/4, which follows by applying the Pythagorean theorem to height and base length. This yields an altitude of √5a/4 in the triangle and its area is √5a/8, and the internal angles are arccos and the complementary 180° −2 arccos. The volume of the pyramid is a3/12, so the volume of the six pyramids. It can be seen as a cube with square pyramids covering each square face and it is a polyhedra in a sequence defined by the face configuration V4.6. 2n. With an even number of faces at every vertex, these polyhedra, each face on these domains also corresponds to the fundamental domain of a symmetry group with order 2,3, n mirrors at each triangle face vertex. Disdyakis triacontahedron Disdyakis dodecahedron Kisrhombille tiling Compound of three octahedra Deltoidal icositetrahedron, another 24-face Catalan solid, the Geometrical Foundation of Natural Structure, A Source Book of Design
49.
Pentakis dodecahedron
–
In geometry, a pentakis dodecahedron or kisdodecahedron is a dodecahedron with a pentagonal pyramid covering each face, that is, it is the Kleetope of the dodecahedron. This interpretation is expressed in its name, there are in fact several topologically equivalent but geometrically distinct kinds of pentakis dodecahedron, depending on the height of the pentagonal pyramids. These include, The usual Catalan pentakis dodecahedron, a convex hexecontahedron with sixty isosceles triangular faces illustrated in the sidebar figure and it is a Catalan solid, dual to the truncated icosahedron, an Archimedean solid. As the heights of the pyramids are raised, at a certain point adjoining pairs of triangular faces merge to become rhombi. As the height is raised further, the shape becomes non-convex, other more non-convex geometric variants include, The small stellated dodecahedron. Great pentakis dodecahedron Wenningers third stellation of icosahedron, if one affixes pentagrammic pyramids into Wenningers third stellation of icosahedron one obtains the great icosahedron. The pentakis dodecahedron in a model of buckminsterfullerene, each surface segment represents a carbon atom, equivalently, a truncated icosahedron is a model of buckminsterfullerene, with each vertex representing a carbon atom. The pentakis dodecahedron is also a model of some icosahedrally symmetric viruses and these have 60 symmetry related capsid proteins, which combine to make the 60 symmetrical faces of a pentakis dodecahedron. The pentakis dodecahedron has three positions, two on vertices, and one on a midedge, The Spaceship Earth structure at Walt Disney Worlds Epcot is a derivative of a pentakis dodecahedron. The model for a campus arts workshop designed by Jeffrey Lindsay was actually a hemispherical pentakis dodecahedron https, in Doctor Atomic, the shape of the first atomic bomb detonated in New Mexico was a pentakis dodecahedron. In De Blob 2 in the Prison Zoo, domes are made up of parts of a Pentakis Dodecahedron and these Domes also appear whenever the player transforms on a dome in the Hypno Ray level. Some Geodomes in which play on are Pentakis Dodecahedra. The Geometrical Foundation of Natural Structure, A Source Book of Design, the Symmetries of Things 2008, John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, ISBN 978-1-56881-220-5 Eric W. Weisstein, Pentakis dodecahedron at MathWorld. Pentakis Dodecahedron – Interactive Polyhedron Model
50.
Order-7 truncated triangular tiling
–
In geometry, the Order-7 truncated triangular tiling, sometimes called the hyperbolic soccerball, is a semiregular tiling of the hyperbolic plane. There are two hexagons and one heptagon on each vertex, forming a similar to a conventional soccer ball with heptagons in place of pentagons. It has Schläfli symbol of t and this tiling is called a hyperbolic soccerball for its similarity to the truncated icosahedron pattern used on soccer balls. Small portions of it as a surface can be constructed in 3-space. The dual tiling is called a heptakis heptagonal tiling, named for being constructible as a heptagonal tiling with every heptagon divided into seven triangles by the center point. This hyperbolic tiling is related as a part of sequence of uniform truncated polyhedra with vertex configurations. From a Wythoff construction there are eight uniform tilings that can be based from the regular heptagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. The Beauty of Geometry, Twelve Essays, weisstein, Eric W. Poincaré hyperbolic disk
51.
Uniform polyhedron
–
A uniform polyhedron is a polyhedron which has regular polygons as faces and is vertex-transitive. It follows that all vertices are congruent, Uniform polyhedra may be regular, quasi-regular or semi-regular. The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra, there are two infinite classes of uniform polyhedra together with 75 others. Dual polyhedra to uniform polyhedra are face-transitive and have regular vertex figures, the dual of a regular polyhedron is regular, while the dual of an Archimedean solid is a Catalan solid. The concept of uniform polyhedron is a case of the concept of uniform polytope. Coxeter, Longuet-Higgins & Miller define uniform polyhedra to be vertex-transitive polyhedra with regular faces, by a polygon they implicitly mean a polygon in 3-dimensional Euclidean space, these are allowed to be non-convex and to intersect each other. There are some generalizations of the concept of a uniform polyhedron, if the connectedness assumption is dropped, then we get uniform compounds, which can be split as a union of polyhedra, such as the compound of 5 cubes. If we drop the condition that the realization of the polyhedron is non-degenerate and these require a more general definition of polyhedra. Some of the ways they can be degenerate are as follows, some polyhedra have faces that are hidden, in the sense that no points of their interior can be seen from the outside. These are usually not counted as uniform polyhedra, some polyhedra have multiple edges and their faces are the faces of two or more polyhedra, though these are not compounds in the previous sense since the polyhedra share edges. There are some non-orientable polyhedra that have double covers satisfying the definition of a uniform polyhedron, there double covers have doubled faces, edges and vertices. They are usually not counted as uniform polyhedra, there are several polyhedra with doubled faces produced by Wythoffs construction. Most authors do not allow doubled faces and remove them as part of the construction, skillings figure has the property that it has double edges but its faces cannot be written as a union of two uniform polyhedra. Regular convex polyhedra, The Platonic solids date back to the classical Greeks and were studied by the Pythagoreans, Plato, Theaetetus, Timaeus of Locri, the Etruscans discovered the regular dodecahedron before 500 BC. Nonregular uniform convex polyhedra, The cuboctahedron was known by Plato, Archimedes discovered all of the 13 Archimedean solids. His original book on the subject was lost, but Pappus of Alexandria mentioned Archimedes listed 13 polyhedra, piero della Francesca rediscovered the five truncation of the Platonic solids, truncated tetrahedron, truncated octahedron, truncated cube, truncated dodecahedron, and truncated icosahedron. Luca Pacioli republished Francescas work in De divina proportione in 1509, adding the rhombicuboctahedron, calling it a icosihexahedron for its 26 faces, which was drawn by Leonardo da Vinci. Johannes Kepler was the first to publish the complete list of Archimedean solids, in 1619, regular star polyhedra, Kepler discovered two of the regular Kepler–Poinsot polyhedra and Louis Poinsot discovered the other two
52.
Uniform tiling
–
In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex-transitive. Uniform tilings can exist in both the Euclidean plane and hyperbolic plane, Uniform tilings are related to the finite uniform polyhedra which can be considered uniform tilings of the sphere. Most uniform tilings can be made from a Wythoff construction starting with a symmetry group, a planar symmetry group has a polygonal fundamental domain and can be represented by the group name represented by the order of the mirrors in sequential vertices. A fundamental domain triangle is, and a triangle, where p, q, r are whole numbers greater than 1. The triangle may exist as a triangle, a Euclidean plane triangle, or a hyperbolic plane triangle. There are a number of schemes for naming these figures, from a modified Schläfli symbol for right triangle domains. The Coxeter-Dynkin diagram is a graph with p, q, r labeled on the edges. If r =2, the graph is linear since order-2 domain nodes generate no reflections, the Wythoff symbol takes the 3 integers and separates them by a vertical bar. If the generator point is off the mirror opposite a domain node, finally tilings can be described by their vertex configuration, the sequence of polygons around each vertex. All uniform tilings can be constructed from various operations applied to regular tilings and these operations as named by Norman Johnson are called truncation, rectification, and Cantellation. Omnitruncation is an operation that combines truncation and cantellation, snubbing is an operation of Alternate truncation of the omnitruncated form. Each is represented by a set of lines of reflection that divide the plane into fundamental triangles and these symmetry groups create 3 regular tilings, and 7 semiregular ones. A number of the tilings are repeated from different symmetry constructors. A prismatic symmetry group represented by represents by two sets of mirrors, which in general can have a rectangular fundamental domain. A further prismatic symmetry group represented by which has a fundamental domain. It constructs two uniform tilings, the prism and apeirogonal antiprism. The stacking of the faces of these two prismatic tilings constructs one non-Wythoffian uniform tiling of the plane. It is called the triangular tiling, composed of alternating layers of squares and triangles
53.
Truncated hexagonal tiling
–
In geometry, the truncated hexagonal tiling is a semiregular tiling of the Euclidean plane. There are 2 dodecagons and one triangle on each vertex and it is given an extended Schläfli symbol of t. Conway calls it a truncated hextille, constructed as a truncation operation applied to a hexagonal tiling. There are 3 regular and 8 semiregular tilings in the plane, there is only one uniform coloring of a truncated hexagonal tiling. The dodecagonal faces can be distorted into different geometries, like, Like the uniform there are eight uniform tilings that can be based from the regular hexagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. This tiling is related as a part of sequence of uniform truncated polyhedra with vertex configurations. Two 2-uniform tilings are related by dissected the dodecagons into a hexagonal and 6 surrounding triangles and squares. The truncated hexagonal tiling can be used as a packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing and this is the lowest density packing that can be created from a uniform tiling. The dodecagonal gaps can be filled perfectly with 7 circles, creating a denser 3-uniform packing, the triakis triangular tiling is a tiling of the Euclidean plane. It is a triangular tiling with each triangle divided into three obtuse triangles from the center point. It is labeled by face configuration V3.12.12 because each isosceles triangle face has two types of vertices, one with 3 triangles, and two with 12 triangles, Conway calls it a kisdeltille, constructed as a kis operation applied to a triangular tiling. In Japan the pattern is called asanoha for hemp leaf, although the name applies to other triakis shapes like the triakis icosahedron. It is the tessellation of the truncated hexagonal tiling which has one triangle. It is one of 7 dual uniform tilings in hexagonal symmetry, tilings of regular polygons List of uniform tilings John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, ISBN 978-1-56881-220-5 Grünbaum, Branko, and Shephard, G. C. CS1 maint, Multiple names, authors list Williams, Robert, the Geometrical Foundation of Natural Structure, A Source Book of Design. 2D Euclidean tilings o3x6x - toxat - O7
54.
Trihexagonal tiling
–
In geometry, the trihexagonal tiling is one of 11 uniform tilings of the Euclidean plane by regular polygons. It consists of triangles and regular hexagons, arranged so that each hexagon is surrounded by triangles. The name derives from the fact that it combines a hexagonal tiling. Two hexagons and two triangles alternate around each vertex, and its edges form an arrangement of lines. Its dual is the rhombille tiling and this pattern, and its place in the classification of uniform tilings, was already known to Johannes Kepler in his 1619 book Harmonices Mundi. The pattern has long used in Japanese basketry, where it is called kagome. The Japanese term for this pattern has taken up in physics. It occurs also in the structures of certain minerals. Conway calls it a hexadeltille, combining elements from a hexagonal tiling. Kagome is a traditional Japanese woven bamboo pattern, its name is composed from the words kago, meaning basket, and me, meaning eye, referring to the pattern of holes in a woven basket. It is an arrangement of laths composed of interlaced triangles such that each point where two laths cross has four neighboring points, forming the pattern of a trihexagonal tiling. The weaved process gives the Kagome a chiral wallpaper group symmetry, the term kagome lattice was coined by Japanese physicist Kôdi Husimi, and first appeared in a 1951 paper by his assistant Ichirō Shōji. The kagome lattice in this sense consists of the vertices and edges of the trihexagonal tiling, despite the name, these crossing points do not form a mathematical lattice. It is represented by the vertices and edges of the cubic honeycomb, filling space by regular tetrahedra. It contains four sets of planes of points and lines. A second expression in three dimensions has parallel layers of two dimensional lattices and is called an orthorhombic-kagome lattice, the trihexagonal prismatic honeycomb represents its edges and vertices. Some minerals, namely jarosites and herbertsmithite, contain two layers or three dimensional kagome lattice arrangement of atoms in their crystal structure. These minerals display novel physical properties connected with geometrically frustrated magnetism, for instance, the spin arrangement of the magnetic ions in Co3V2O8 rests in a kagome lattice which exhibits fascinating magnetic behavior at low temperatures
55.
Rhombitrihexagonal tiling
–
In geometry, the rhombitrihexagonal tiling is a semiregular tiling of the Euclidean plane. There are one triangle, two squares, and one hexagon on each vertex and it has Schläfli symbol of rr. John Conway calls it a rhombihexadeltille and it can be considered a cantellated by Norman Johnsons terminology or an expanded hexagonal tiling by Alicia Boole Stotts operational language. There are 3 regular and 8 semiregular tilings in the plane, there is only one uniform coloring in a rhombitrihexagonal tiling. With edge-colorings there is a half symmetry form orbifold notation, the hexagons can be considered as truncated triangles, t with two types of edges. It has Coxeter diagram, Schläfli symbol s2, the bicolored square can be distorted into isosceles trapezoids. In the limit, where the rectangles degenerate into edges, a triangular tiling results, there is one related 2-uniform tilings, having hexagons dissected into 6 triangles. Every circle is in contact with 4 other circles in the packing, the translational lattice domain contains 6 distinct circles. The gap inside each hexagon allows for one circle, related to a 2-uniform tiling with the hexagons divided into 6 triangles, there are eight uniform tilings that can be based from the regular hexagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. This tiling is related as a part of sequence of cantellated polyhedra with vertex figure. These vertex-transitive figures have reflectional symmetry, the deltoidal trihexagonal tiling is a dual of the semiregular tiling known as the rhombitrihexagonal tiling. The edges of this tiling can be formed by the overlay of the regular triangular tiling. Each kite face of this tiling has angles 120°, 90°, 60° and 90° and it is one of only eight tilings of the plane in which every edge lies on a line of symmetry of the tiling. The deltoidal trihexagonal tiling is a dual of the semiregular tiling rhombitrihexagonal tiling and its faces are deltoids or kites. It is one of 7 dual uniform tilings in hexagonal symmetry and this tiling has face transitive variations, that can distort the kites into bilateral trapezoids or more general quadrillaterals. Ignoring the face colors below, the symmetry is p6m, and the lower symmetry is p31m with 3 mirrors meeting at a point. This tiling is related to the tiling by dividing the triangles and hexagons into central triangles
56.
Truncated trihexagonal tiling
–
In geometry, the truncated trihexagonal tiling is one of eight semiregular tilings of the Euclidean plane. There are one square, one hexagon, and one dodecagon on each vertex and it has Schläfli symbol of tr. There is only one uniform coloring of a trihexagonal tiling. A 2-uniform coloring has two colors of hexagons, 3-uniform colorings can have 3 colors of dodecagons or 3 colors of squares. The truncated trihexagonal tiling has three related 2-uniform tilings, one being a 2-uniform coloring of the semiregular rhombitrihexagonal tiling, the first dissects the hexagons into 6 triangles. The other two dissect the dodecagons into a hexagon and surrounding triangles and square, in two different orientations. The Truncated trihexagonal tiling can be used as a packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing, circles can be alternatedly colored in this packing with an even number of sides of all the regular polygons of this tiling. The gap inside each hexagon allows for one circle, and each dodecagon allows for 7 circles, the kisrhombille tiling or 3-6 kisrhombille tiling is a tiling of the Euclidean plane. It is constructed by congruent 30-60 degree right triangles with 4,6, conway calls it a kisrhombille for his kis vertex bisector operation applied to the rhombille tiling. More specifically it can be called a 3-6 kisrhombille, to distinguish it from other similar hyperbolic tilings and it can be seen as an equilateral hexagonal tiling with each hexagon divided into 12 triangles from the center point. It is labeled V4.6.12 because each right triangle face has three types of vertices, one with 4 triangles, one with 6 triangles, and one with 12 triangles, the kisrhombille tiling triangles represent the fundamental domains of p6m, symmetry. There are a number of small index subgroups constructed from by mirror removal, creates *333 symmetry, shown as red mirror lines. The commutator subgroup is, which is 333 symmetry, a larger index 6 subgroup constructed as, also becomes, shown in blue mirror lines, and which has its own 333 rotational symmetry, index 12. There are eight uniform tilings that can be based from the hexagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. This tiling can be considered a member of a sequence of patterns with vertex figure. For p <6, the members of the sequence are omnitruncated polyhedra, for p >6, they are tilings of the hyperbolic plane, starting with the truncated triheptagonal tiling
57.
Snub trihexagonal tiling
–
In geometry, the snub hexagonal tiling is a semiregular tiling of the Euclidean plane. There are four triangles and one hexagon on each vertex and it has Schläfli symbol of sr. The snub tetrahexagonal tiling is a hyperbolic tiling with Schläfli symbol sr. Conway calls it a snub hextille. There are 3 regular and 8 semiregular tilings in the plane and this is the only one which does not have a reflection as a symmetry. There is only one uniform coloring of a trihexagonal tiling. The snub trihexagonal tiling can be used as a packing, placing equal diameter circles at the center of every point. Every circle is in contact with 5 other circles in the packing, the lattice domain repeats 6 distinct circles. The hexagonal gaps can be filled by one circle, leading to the densest packing from the triangular tiling#circle packing. This semiregular tiling is a member of a sequence of snubbed polyhedra and tilings with vertex figure and these figures and their duals have rotational symmetry, being in the Euclidean plane for n=6, and hyperbolic plane for any higher n. The series can be considered to begin with n=2, with one set of faces degenerated into digons, in geometry, the floret pentagonal tiling or rosette pentagonal tiling is a dual semiregular tiling of the Euclidean plane. It is one of 15 known isohedral pentagon tilings and it is given its name because its six pentagonal tiles radiate out from a central point, like petals on a flower. Conway calls it a 6-fold pentille, each of its pentagonal faces has four 120° and one 60° angle. It is the dual of the tiling, snub trihexagonal tiling. The floret pentagonal tiling has geometric variations with unequal edge lengths and rotational symmetry, in one limit, an edge-length goes to zero and it becomes a deltoidal trihexagonal tiling. Tilings of regular polygons List of uniform tilings John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, ISBN 978-1-56881-220-5 Grünbaum, Branko, cS1 maint, Multiple names, authors list Williams, Robert. The Geometrical Foundation of Natural Structure, A Source Book of Design, 2D Euclidean tilings s3s6s - snathat - O11
58.
Vertex figure
–
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Take some vertex of a polyhedron, mark a point somewhere along each connected edge. Draw lines across the faces, joining adjacent points. When done, these form a complete circuit, i. e. a polygon. This polygon is the vertex figure, more precise formal definitions can vary quite widely, according to circumstance. For example Coxeter varies his definition as convenient for the current area of discussion, most of the following definitions of a vertex figure apply equally well to infinite tilings, or space-filling tessellation with polytope cells. Make a slice through the corner of the polyhedron, cutting all the edges connected to the vertex. The cut surface is the vertex figure and this is perhaps the most common approach, and the most easily understood. Different authors make the slice in different places, Wenninger cuts each edge a unit distance from the vertex, as does Coxeter. For uniform polyhedra the Dorman Luke construction cuts each connected edge at its midpoint, other authors make the cut through the vertex at the other end of each edge. For irregular polyhedra, these approaches may produce a figure that does not lie in a plane. A more general approach, valid for convex polyhedra, is to make the cut along any plane which separates the given vertex from all the other vertices. Cromwell makes a cut or scoop, centered on the vertex. The cut surface or vertex figure is thus a spherical polygon marked on this sphere, many combinatorial and computational approaches treat a vertex figure as the ordered set of points of all the neighboring vertices to the given vertex. In the theory of polytopes, the vertex figure at a given vertex V comprises all the elements which are incident on the vertex, edges, faces. More formally it is the -section Fn/V, where Fn is the greatest face and this set of elements is elsewhere known as a vertex star. A vertex figure for an n-polytope is an -polytope, for example, a vertex figure for a polyhedron is a polygon figure, and the vertex figure for a 4-polytope is a polyhedron. Each edge of the vertex figure exists on or inside of a face of the original polytope connecting two vertices from an original face
59.
Laves tiling
–
This table shows the 11 convex uniform tilings of the Euclidean plane, and their dual tilings. There are three regular and eight semiregular tilings in the plane, the semiregular tilings form new tilings from their duals, each made from one type of irregular face. John Conway calls the uniform duals Archimedean tilings, in parallel to the Archimedean solid polyhedra, Uniform tilings are listed by their vertex configuration, the sequence of faces that exist on each vertex. For example 4.8.8 means one square and two octagons on a vertex and these 11 uniform tilings have 32 different uniform colorings. A uniform coloring allows identical sided polygons at a vertex to be colored differently, while still maintaining vertex-uniformity, in addition to the 11 convex uniform tilings, there are also 14 nonconvex tilings, using star polygons, and reverse orientation vertex configurations. In the 1987 book, Tilings and Patterns, Branko Grünbaum calls the vertex-uniform tilings Archimedean in parallel to the Archimedean solids and their dual tilings are called Laves tilings in honor of crystallographer Fritz Laves. Theyre also called Shubnikov–Laves tilings after Shubnikov, Alekseĭ Vasilʹevich, John Conway calls the uniform duals Catalan tilings, in parallel to the Catalan solid polyhedra. The Laves tilings have vertices at the centers of the regular polygons, the tiles of the Laves tilings are called planigons. This includes the 3 regular tiles and 8 irregular ones, each vertex has edges evenly spaced around it. Three dimensional analogues of the planigons are called stereohedrons and these dual tilings are listed by their face configuration, the number of faces at each vertex of a face. For example V4.8.8 means isosceles triangle tiles with one corner with four triangles, alternated forms such as the snub can also be represented by special markups within each system. Only one uniform tiling cant be constructed by a Wythoff process, an orthogonal mirror construction also exists, seen as two sets of parallel mirrors making a rectangular fundamental domain. If the domain is square, this symmetry can be doubled by a mirror into the family. Families, B C ~2, - Symmetry of the square tiling I ~12, G ~2, - Symmetry of the regular hexagonal tiling. Uniform tilings in hyperbolic plane Percolation threshold John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, the Geometrical Foundation of Natural Structure, A Source Book of Design. Uniform edge-c-colorings of the Archimedean Tilings, Tilings by Regular polygons, Vol.50, No.5. Dale Seymour and Jill Britton, Introduction to Tessellations,1989, ISBN 978-0866514613, pp. 50–57, 71-74 Weisstein, Uniform Tessellations on the Euclid plane Tessellations of the Plane David Baileys World of Tessellations k-uniform tilings n-uniform tilings
60.
Kisrhombille tiling
–
In geometry, the truncated trihexagonal tiling is one of eight semiregular tilings of the Euclidean plane. There are one square, one hexagon, and one dodecagon on each vertex and it has Schläfli symbol of tr. There is only one uniform coloring of a trihexagonal tiling. A 2-uniform coloring has two colors of hexagons, 3-uniform colorings can have 3 colors of dodecagons or 3 colors of squares. The truncated trihexagonal tiling has three related 2-uniform tilings, one being a 2-uniform coloring of the semiregular rhombitrihexagonal tiling, the first dissects the hexagons into 6 triangles. The other two dissect the dodecagons into a hexagon and surrounding triangles and square, in two different orientations. The Truncated trihexagonal tiling can be used as a packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing, circles can be alternatedly colored in this packing with an even number of sides of all the regular polygons of this tiling. The gap inside each hexagon allows for one circle, and each dodecagon allows for 7 circles, the kisrhombille tiling or 3-6 kisrhombille tiling is a tiling of the Euclidean plane. It is constructed by congruent 30-60 degree right triangles with 4,6, conway calls it a kisrhombille for his kis vertex bisector operation applied to the rhombille tiling. More specifically it can be called a 3-6 kisrhombille, to distinguish it from other similar hyperbolic tilings and it can be seen as an equilateral hexagonal tiling with each hexagon divided into 12 triangles from the center point. It is labeled V4.6.12 because each right triangle face has three types of vertices, one with 4 triangles, one with 6 triangles, and one with 12 triangles, the kisrhombille tiling triangles represent the fundamental domains of p6m, symmetry. There are a number of small index subgroups constructed from by mirror removal, creates *333 symmetry, shown as red mirror lines. The commutator subgroup is, which is 333 symmetry, a larger index 6 subgroup constructed as, also becomes, shown in blue mirror lines, and which has its own 333 rotational symmetry, index 12. There are eight uniform tilings that can be based from the hexagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. This tiling can be considered a member of a sequence of patterns with vertex figure. For p <6, the members of the sequence are omnitruncated polyhedra, for p >6, they are tilings of the hyperbolic plane, starting with the truncated triheptagonal tiling
61.
Tetrakis square tiling
–
In geometry, the tetrakis square tiling is a tiling of the Euclidean plane. It is a square tiling with each divided into four isosceles right triangles from the center point. Conway calls it a kisquadrille, represented by a kis operation that adds a center point and it is also called the Union Jack lattice because of the resemblance to the UK flag of the triangles surrounding its degree-8 vertices. It is labeled V4.8.8 because each isosceles triangle face has two types of vertices, one with 4 triangles, and two with 8 triangles and it is the dual tessellation of the truncated square tiling which has one square and two octagons at each vertex. A5 ×9 portion of the square tiling is used to form the board for the Malagasy board game Fanorona. In this game, pieces are placed on the vertices of the tiling, a similar board is also used for the Brazilian game Adugo, and for the game of Hare and Hounds. The tetrakis square tiling was used for a set of postage stamps issued by the United States Postal Service in 1997. This tiling also forms the basis for a commonly used pinwheel, windmill and these lines form the axes of symmetry of a reflection group, which has the triangles of the tiling as its fundamental domains. Rotational symmetry is shown by white and blue colored areas with a single fundamental domain for each subgroup is filled in yellow. Glide reflections are given with dashed lines, subgroups can be expressed as Coxeter diagrams, along with fundamental domain diagrams. It is topologically related to a series of polyhedra and tilings with face configuration Vn.6.6, tilings of regular polygons List of uniform tilings Percolation threshold Grünbaum, Branko, and Shephard, G. C. CS1 maint, Multiple names, authors list Williams, Robert, the Geometrical Foundation of Natural Structure, A Source Book of Design. Keith Critchlow, Order in Space, A design source book,1970, p. 77-76, pattern 8
62.
Triakis triangular tiling
–
In geometry, the truncated hexagonal tiling is a semiregular tiling of the Euclidean plane. There are 2 dodecagons and one triangle on each vertex and it is given an extended Schläfli symbol of t. Conway calls it a truncated hextille, constructed as a truncation operation applied to a hexagonal tiling. There are 3 regular and 8 semiregular tilings in the plane, there is only one uniform coloring of a truncated hexagonal tiling. The dodecagonal faces can be distorted into different geometries, like, Like the uniform there are eight uniform tilings that can be based from the regular hexagonal tiling. Drawing the tiles colored as red on the faces, yellow at the original vertices. This tiling is related as a part of sequence of uniform truncated polyhedra with vertex configurations. Two 2-uniform tilings are related by dissected the dodecagons into a hexagonal and 6 surrounding triangles and squares. The truncated hexagonal tiling can be used as a packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing and this is the lowest density packing that can be created from a uniform tiling. The dodecagonal gaps can be filled perfectly with 7 circles, creating a denser 3-uniform packing, the triakis triangular tiling is a tiling of the Euclidean plane. It is a triangular tiling with each triangle divided into three obtuse triangles from the center point. It is labeled by face configuration V3.12.12 because each isosceles triangle face has two types of vertices, one with 3 triangles, and two with 12 triangles, Conway calls it a kisdeltille, constructed as a kis operation applied to a triangular tiling. In Japan the pattern is called asanoha for hemp leaf, although the name applies to other triakis shapes like the triakis icosahedron. It is the tessellation of the truncated hexagonal tiling which has one triangle. It is one of 7 dual uniform tilings in hexagonal symmetry, tilings of regular polygons List of uniform tilings John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, ISBN 978-1-56881-220-5 Grünbaum, Branko, and Shephard, G. C. CS1 maint, Multiple names, authors list Williams, Robert, the Geometrical Foundation of Natural Structure, A Source Book of Design. 2D Euclidean tilings o3x6x - toxat - O7
63.
Triangular tiling honeycomb
–
The triangular tiling honeycomb is one of 11 paracompact regular space-filling tessellations in hyperbolic 3-space. It is called paracompact because it has infinite cells and vertex figures and it has Schläfli symbol, being composed of triangular tiling cells. Each edge of the honeycomb is surrounded by three cells, and each vertex is ideal with infinitely many cells meeting there and its vertex figure is a hexagonal tiling. A geometric honeycomb is a space-filling of polyhedral or higher-dimensional cells and it is an example of the more general mathematical tiling or tessellation in any number of dimensions. Honeycombs are usually constructed in ordinary Euclidean space, like the uniform honeycombs. They may also be constructed in non-Euclidean spaces, such as hyperbolic uniform honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. It has two lower symmetry constructions, as an alternated order-6 hexagonal tiling honeycomb, ↔, and as from. In Coxeter notation, the removal of the 3rd and 4th mirrors, the fundamental domain is 6 times larger. By Coxeter diagram there are 3 copies of the first original mirror in the new fundamental domain and it is similar to the 2D hyperbolic infinite-order apeirogonal tiling, with infinite apeirogonal faces and all vertices are on the ideal surface. It is one of 15 regular hyperbolic honeycombs in 3-space,11 of which like this one are paracompact, with infinite cells or vertex figures. There are nine uniform honeycombs in the Coxeter group family, including this regular form as well as the form, t1,2. The rectified triangular tiling honeycomb, has alternating trihexagonal tiling and hexagonal tiling cells, a lower symmetry of this honeycomb can be constructed as a cantic order-6 hexagonal tiling honeycomb, ↔. A second lower construction, index is ↔, the truncated triangular tiling honeycomb, is the same as the hexagonal tiling honeycomb. The bitruncated triangular tiling honeycomb, has truncated hexagonal tiling cells, the cantellated triangular tiling honeycomb, has truncated hexagonal tiling and triangular prism cells, with a triangular prism vertex figure. It can also be constructed as a form, cantic snub triangular tiling honeycomb. The cantitruncated triangular tiling honeycomb, has rhombitrihexagonal tiling and hexagonal prism cells, the runcinated triangular tiling honeycomb, has hexagonal tiling and triangular prism cells, with a hexagonal antiprism vertex figure. The runcitruncated triangular tiling honeycomb, has hexagonal tiling, rhombitrihexagonal tiling, triangular prism, the omnitruncated triangular tiling honeycomb, has truncated trihexagonal tiling and hexagonal prism cells, with a tetrahedron vertex figure. The runcisnub triangular tiling honeycomb, has trihexagonal tiling, triangular tiling, triangular prism and it is vertex-transitive, but not uniform, since it contains Johnson solid triangular cupola cells
64.
Tilings of regular polygons
–
Euclidean plane tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in his Harmonices Mundi and this means that, for every pair of flags, there is a symmetry operation mapping the first flag to the second. This is equivalent to the tiling being an edge-to-edge tiling by congruent regular polygons, There must be six equilateral triangles, four squares or three regular hexagons at a vertex, yielding the three regular tessellations. Vertex-transitivity means that for pair of vertices there is a symmetry operation mapping the first vertex to the second. Note that there are two mirror forms of 34.6 tiling, only one of which is shown in the following table. All other regular and semiregular tilings are achiral, though these yield the same set of tilings in the plane, in other spaces there are Archimedean tilings which are not uniform. Such periodic tilings may be classified by the number of orbits of vertices, edges and tiles. If there are k orbits of vertices, a tiling is known as k -uniform or k -isogonal, if there are t orbits of tiles, as t -isohedral, if there are e orbits of edges, as e -isotoxal. K-uniform tilings with the vertex figures can be further identified by their wallpaper group symmetry. 1-uniform tilings include 3 regular tilings, and 8 semiregular ones, There are 20 2-uniform tilings,61 3-uniform tilings,151 4-uniform tilings,332 5-uniform tilings and 673 6-uniform tilings. Each can be grouped by the m of distinct vertex figures. For edge-to-edge Euclidean tilings, the angles of the polygons meeting at a vertex must add to 360 degrees. A regular n -gon has internal angle 180 degrees, only eleven of these can occur in a uniform tiling of regular polygons, given in previous sections. In particular, if three polygons meet at a vertex and one has an odd number of sides, the two polygons must be the same. If they are not, they would have to alternate around the first polygon, vertex types are listed for each. If two tilings share the two vertex types, they are given subscripts 1,2. There are 61 3-uniform tilings of the Euclidean plane,39 are 3-Archimedean with 3 distinct vertex types, while 22 have 2 identical vertex types in different symmetry orbits. Chavey There are 151 4-uniform tilings of the Euclidean plane, Brian Galebachs search reproduced Krotenheerdts list of 33 4-uniform tilings with 4 distinct vertex types, as well as finding 85 of them with 3 vertex types, and 33 with 2 vertex types
65.
Isogrid
–
Isogrid is a type of partially hollowed-out structure formed usually from a single metal plate with triangular integral stiffening ribs. It is extremely light and stiff, compared to other materials, it is expensive to manufacture, and so it is restricted to spaceflight applications and some particularly critical parts of more general aerospace use. The triangular pattern is very efficient because it retains rigidity while saving material, the term isogrid is used because the structure acts like an isotropic material, with equal properties measured in any direction, and grid, referring to the sheet and stiffeners structure. A similar variant is the Orthogrid which uses rather than triangular openings. This is not isotropic but matches many use cases well and is easier to manufacture, traditionally, the equilateral triangle pattern was used because it was amenable to simplified analysis. Since the equilateral triangle pattern has isotropic strength characteristics, it was named isogrid, the stiffeners of an isogrid are generally machined from a single sheet of material with a CNC milling machine, but a thickness less than 0.040 in. requires chemical milling processes. Metal isogrids, are constructed by milling material from one face of a sheet or plate, composite isogrids are rib-skin configurations formed by various manual or automated processes, and can give extremely high strength-weight ratios. Isogrid panels form self-stiffened structures where low weight, stiffness, strength and damage tolerance are important, aerospace isogrid structures include payload shrouds and boosters, which must support the full weight of upper stages and payloads under high G loads
66.
Coxeter
–
Harold Scott MacDonald Donald Coxeter, FRS, FRSC, CC was a British-born Canadian geometer. Coxeter is regarded as one of the greatest geometers of the 20th century and he was born in London but spent most of his adult life in Canada. He was always called Donald, from his third name MacDonald, in his youth, Coxeter composed music and was an accomplished pianist at the age of 10. He felt that mathematics and music were intimately related, outlining his ideas in a 1962 article on Mathematics and he worked for 60 years at the University of Toronto and published twelve books. He was most noted for his work on regular polytopes and higher-dimensional geometries and he was a champion of the classical approach to geometry, in a period when the tendency was to approach geometry more and more via algebra. Coxeter went up to Trinity College, Cambridge in 1926 to read mathematics, there he earned his BA in 1928, and his doctorate in 1931. In 1932 he went to Princeton University for a year as a Rockefeller Fellow, where he worked with Hermann Weyl, Oswald Veblen, returning to Trinity for a year, he attended Ludwig Wittgensteins seminars on the philosophy of mathematics. In 1934 he spent a year at Princeton as a Procter Fellow. In 1936 Coxeter moved to the University of Toronto, flather, and John Flinders Petrie published The Fifty-Nine Icosahedra with University of Toronto Press. In 1940 Coxeter edited the eleventh edition of Mathematical Recreations and Essays and he was elevated to professor in 1948. Coxeter was elected a Fellow of the Royal Society of Canada in 1948 and he also inspired some of the innovations of Buckminster Fuller. Coxeter, M. S. Longuet-Higgins and J. C. P. Miller were the first to publish the full list of uniform polyhedra, since 1978, the Canadian Mathematical Society have awarded the Coxeter–James Prize in his honor. He was made a Fellow of the Royal Society in 1950, in 1990, he became a Foreign Member of the American Academy of Arts and Sciences and in 1997 was made a Companion of the Order of Canada. In 1973 he got the Jeffery–Williams Prize,1940, Regular and Semi-Regular Polytopes I, Mathematische Zeitschrift 46, 380-407, MR2,10 doi,10. 1007/BF011814491942, Non-Euclidean Geometry, University of Toronto Press, MAA. 1954, Uniform Polyhedra, Philosophical Transactions of the Royal Society A246, arthur Sherk, Peter McMullen, Anthony C. Thompson and Asia Ivić Weiss, editors, Kaleidoscopes — Selected Writings of H. S. M. John Wiley and Sons ISBN 0-471-01003-01999, The Beauty of Geometry, Twelve Essays, Dover Publications, LCCN 99-35678, ISBN 0-486-40919-8 Davis, Chandler, Ellers, Erich W, the Coxeter Legacy, Reflections and Projections. King of Infinite Space, Donald Coxeter, the Man Who Saved Geometry, www. donaldcoxeter. com www. math. yorku. ca/dcoxeter webpages dedicated to him Jarons World, Shapes in Other Dimensions, Discover mag. Apr 2007 The Mathematics in the Art of M. C, escher video of a lecture by H. S. M
67.
Regular Polytopes (book)
–
Regular Polytopes is a mathematical geometry book written by Canadian mathematician Harold Scott MacDonald Coxeter. Originally published in 1947, the book was updated and republished in 1963 and 1973, the book is a comprehensive survey of the geometry of regular polytopes, the generalisation of regular polygons and regular polyhedra to higher dimensions. Originating with an essay entitled Dimensional Analogy written in 1923, the first edition of the book took Coxeter twenty-four years to complete, regular Polytopes is a standard reference work on regular polygons, polyhedra and their higher dimensional analogues. It is unusual in the breadth of its coverage, its combination of mathematical rigour with geometric insight, Coxeter starts by introducing two-dimensional polygons and three-dimensional polyhedra. He then gives a rigorous definition of regularity and uses it to show that there are no other convex regular polyhedra apart from the five Platonic solids. The concept of regularity is extended to non-convex shapes such as star polygons and star polyhedra, to tessellations and honeycombs, Coxeter introduces and uses the groups generated by reflections that became known as Coxeter groups. The book combines algebraic rigour with clear explanations, many of which are illustrated with diagrams, the black and white plates in the book show solid models of three-dimensional polyhedra, and wire-frame models of projections of some higher-dimensional polytopes. At the end of each chapter Coxeter includes an Historical remarks section which provides a perspective of the development of the subject. The first two have been expounded by Sommerville and Neville, and we shall presuppose some familiarity with such treatises. Concerning the third, Poincaré wrote, A man who pursues it, will end up holding on to the fourth dimension. ”The original 1948 edition received a more complete review by M. Goldberg in MR0027148
68.
International Standard Book Number
–
The International Standard Book Number is a unique numeric commercial book identifier. An ISBN is assigned to each edition and variation of a book, for example, an e-book, a paperback and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, the method of assigning an ISBN is nation-based and varies from country to country, often depending on how large the publishing industry is within a country. The initial ISBN configuration of recognition was generated in 1967 based upon the 9-digit Standard Book Numbering created in 1966, the 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108. Occasionally, a book may appear without a printed ISBN if it is printed privately or the author does not follow the usual ISBN procedure, however, this can be rectified later. Another identifier, the International Standard Serial Number, identifies periodical publications such as magazines, the ISBN configuration of recognition was generated in 1967 in the United Kingdom by David Whitaker and in 1968 in the US by Emery Koltay. The 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108, the United Kingdom continued to use the 9-digit SBN code until 1974. The ISO on-line facility only refers back to 1978, an SBN may be converted to an ISBN by prefixing the digit 0. For example, the edition of Mr. J. G. Reeder Returns, published by Hodder in 1965, has SBN340013818 -340 indicating the publisher,01381 their serial number. This can be converted to ISBN 0-340-01381-8, the check digit does not need to be re-calculated, since 1 January 2007, ISBNs have contained 13 digits, a format that is compatible with Bookland European Article Number EAN-13s. An ISBN is assigned to each edition and variation of a book, for example, an ebook, a paperback, and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, a 13-digit ISBN can be separated into its parts, and when this is done it is customary to separate the parts with hyphens or spaces. Separating the parts of a 10-digit ISBN is also done with either hyphens or spaces, figuring out how to correctly separate a given ISBN number is complicated, because most of the parts do not use a fixed number of digits. ISBN issuance is country-specific, in that ISBNs are issued by the ISBN registration agency that is responsible for country or territory regardless of the publication language. Some ISBN registration agencies are based in national libraries or within ministries of culture, in other cases, the ISBN registration service is provided by organisations such as bibliographic data providers that are not government funded. In Canada, ISBNs are issued at no cost with the purpose of encouraging Canadian culture. In the United Kingdom, United States, and some countries, where the service is provided by non-government-funded organisations. Australia, ISBNs are issued by the library services agency Thorpe-Bowker
69.
Robert Williams (geometer)
–
Robert Edward Williams is an American designer, mathematician, and architect. Robert Williams was born in Cincinnati, Ohio, the son of Robert Finley Williams and his father was the oldest member of the Williams Brothers, a quartet of musical entertainers, who appeared on recordings, radio, and television, from the late 1930s to the present. Williamss work was inspired by the design principles in natural structure systems promoted by R. Buckminster Fuller. He was introduced to the work of Fuller by designer Peter Pearce in 1963 and he finished graduate studies in structural design at Southern Illinois University in 1967, where Fuller was University Professor. Williams met astronomer, Albert George Wilson at the Rand Corporation in 1966, Wilson invited him to conduct research at the McDonnell-Douglas Corporation Advanced Research Laboratories in Huntington Beach, California, USA. After graduate studies, he joined Dr. Wilson in September 1967 and he was the geometry and structure consultant to NASA engineer, Charles A. Willits, on the initiatory work in the development of large scale structure systems for space stations. The first of four editions of his geometry research was published by DARL in 1969, with the title. His paper in the journal Science proposed that his discovery of the β-tetrakaidecahedron is the most reasonable alternative to Lord Kelvin’s α-tetrakaidecahedron, in the spring of 1970, Williams became a visiting lecturer in Design at Southern Illinois University. A year later he returned to California, and started the design company Mandala Design Associates, in 1972, Eudaemon Press published Natural Structure, Toward a Form Language, an expanded edition of the original Handbook of Structure. In 1979, Dover Publications published the third edition titled, The Geometrical Foundation of Natural Structure and these works are cited in many books on geometry, science, and design. Williams uses the geometry of Natural Structure, Catenatic Geometry principles, and Symbolic analysis as fundamental components of his architectural, environmental design, and cosmology work. In 1967, he became a member of Experiments in Art and Technology founded by engineers Billy Klüver and Fred Waldhauer and artists Robert Rauschenberg. In addition to work, Williams was awarded U. S. Patent No.6,532, 701] in 2003 for a system of clustered modular enclosures. In both his books and lectures, Williams is a keen popularizer of the geometries in natural structures and his current work focuses on two concepts first introduced in Natural Structure, Toward a Form Language. Following the lead of mathematicians L. Fejes Toth and C. A. Rogers, in The Kiss Catenatic he expanded the concept of small circles covering a sphere to include interconnected platen circuits that model multi-level linked units of the 3-dimensional matrix chain. He presented examples of the use of Catenatic Geometry in discussions of matter and dark energy, red-shift, fundamental forces, discrete units of space. From the beginning of his research, Williams considered polyhedral geometry as the basis of a Form Language comprising three levels, the Formative, the Purportive, and the Symbolic
70.
Regular honeycomb
–
This page lists the regular polytopes and regular polytope compounds in Euclidean, spherical and hyperbolic spaces. The Schläfli symbol describes every regular tessellation of an n-sphere, Euclidean, a Schläfli symbol describing an n-polytope equivalently describes a tessellation of a -sphere. Another related symbol is the Coxeter-Dynkin diagram which represents a group with no rings. For example, the cube has Schläfli symbol, and with its octahedral symmetry, the regular polytopes are grouped by dimension and subgrouped by convex, nonconvex and infinite forms. Nonconvex forms use the same vertices as the forms, but have intersecting facets. Infinite forms tessellate a one-lower-dimensional Euclidean space, infinite forms can be extended to tessellate a hyperbolic space. Hyperbolic space is like normal space at a scale. This allows vertex figures to have negative angle defects, like making a vertex with seven equilateral triangles and it cannot be done in a regular plane, but can be at the right scale of a hyperbolic plane. A more general definition of regular polytopes which do not have simple Schläfli symbols includes regular skew polytopes and this table shows a summary of regular polytope counts by dimension. *1 if the number of dimensions is of the form 2k −1,2 if the number of dimensions is a power of two,0 otherwise, There are no Euclidean regular star tessellations in any number of dimensions. A one-dimensional polytope or 1-polytope is a line segment, bounded by its two endpoints. A 1-polytope is regular by definition and is represented by Schläfli symbol, norman Johnson calls it a ditel and gives it the Schläfli symbol. Although trivial as a polytope, it appears as the edges of polygons and it is used in the definition of uniform prisms like Schläfli symbol ×, or Coxeter diagram as a Cartesian product of a line segment and a regular polygon. The two-dimensional polytopes are called polygons, Regular polygons are equilateral and cyclic. A p-gonal regular polygon is represented by Schläfli symbol, usually only convex polygons are considered regular, but star polygons, like the pentagram, can also be considered regular. They use the same vertices as the forms, but connect in an alternate connectivity which passes around the circle more than once to complete. Star polygons should be called nonconvex rather than concave because the edges do not generate new vertices. The Schläfli symbol represents a regular p-gon, the regular digon can be considered to be a degenerate regular polygon
71.
Uniform honeycomb
–
In geometry, a uniform honeycomb or uniform tessellation or infinite uniform polytope, is a vertex-transitive honeycomb made from uniform polytope facets. All of its vertices are identical and there is the same combination and its dimension can be clarified as n-honeycomb for an n-dimensional honeycomb. An n-dimensional uniform honeycomb can be constructed on the surface of n-spheres, in n-dimensional Euclidean space, a 2-dimensional uniform honeycomb is more often called a uniform tiling or uniform tessellation. Nearly all uniform tessellations can be generated by a Wythoff construction, wythoffian tessellations can be defined by a vertex figure. For 2-dimensional tilings, they can be given by a vertex configuration listing the sequence of faces around every vertex, for example 4.4.4.4 represents a regular tessellation, a square tiling, with 4 squares around each vertex. Norman Johnson Uniform Polytopes, Manuscript Williams, Robert, the Geometrical Foundation of Natural Structure, A Source Book of Design. CS1 maint, Multiple names, authors list H. S. M. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Critchlow, order in Space, A design source book. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, dissertation, University of Toronto,1966 A. Andreini, Sulle reti di poliedri regolari e semiregolari e sulle corrispondenti reti correlative, Mem. Società Italiana della Scienze, Ser.3,14 75–129, tessellations of the Plane Klitzing, Richard
72.
Coxeter group
–
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups, however, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced as abstractions of reflection groups, and finite Coxeter groups were classified in 1935, Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the groups of regular polytopes. The condition m i j = ∞ means no relation of the form m should be imposed, the pair where W is a Coxeter group with generators S = is called a Coxeter system. Note that in general S is not uniquely determined by W, for example, the Coxeter groups of type B3 and A1 × A3 are isomorphic but the Coxeter systems are not equivalent. A number of conclusions can be drawn immediately from the above definition, the relation m i i =1 means that 1 =2 =1 for all i, as such the generators are involutions. If m i j =2, then the r i and r j commute. This follows by observing that x x = y y =1, in order to avoid redundancy among the relations, it is necessary to assume that m i j = m j i. This follows by observing that y y =1, together with m =1 implies that m = m y y = y m y = y y =1. Alternatively, k and k are elements, as y k y −1 = k y y −1 = k. The Coxeter matrix is the n × n, symmetric matrix with entries m i j, indeed, every symmetric matrix with positive integer and ∞ entries and with 1s on the diagonal such that all nondiagonal entries are greater than 1 serves to define a Coxeter group. The Coxeter matrix can be encoded by a Coxeter diagram. The vertices of the graph are labelled by generator subscripts, vertices i and j are adjacent if and only if m i j ≥3. An edge is labelled with the value of m i j whenever the value is 4 or greater, in particular, two generators commute if and only if they are not connected by an edge. Furthermore, if a Coxeter graph has two or more connected components, the group is the direct product of the groups associated to the individual components. Thus the disjoint union of Coxeter graphs yields a product of Coxeter groups. The Coxeter matrix, M i j, is related to the n × n Schläfli matrix C with entries C i j = −2 cos , but the elements are modified, being proportional to the dot product of the pairwise generators
73.
Uniform convex honeycomb
–
In geometry, a convex uniform honeycomb is a uniform tessellation which fills three-dimensional Euclidean space with non-overlapping convex uniform polyhedral cells. They can be considered the three-dimensional analogue to the uniform tilings of the plane, the Voronoi diagram of any lattice forms a convex uniform honeycomb in which the cells are zonohedra. 1905, Alfredo Andreini enumerated 25 of these tessellations,1991, Norman Johnsons manuscript Uniform Polytopes identified the complete list of 28. 1994, Branko Grünbaum, in his paper Uniform tilings of 3-space, also independently enumerated all 28 and he found the 1905 paper, which listed 25, had 1 wrong, and 4 being missing. Grünbaum states in this paper that Norman Johnson deserves priority for achieving the same enumeration in 1991, alexeyev of Russia had contacted him regarding a putative enumeration of these forms, but that Grünbaum was unable to verify this at the time. Only 14 of the uniform polyhedra appear in these patterns. This set can be called the regular and semiregular honeycombs and it has been called the Archimedean honeycombs by analogy with the convex uniform polyhedra, commonly called Archimedean solids. Recently Conway has suggested naming the set as the Architectonic tessellations, the individual honeycombs are listed with names given to them by Norman Johnson. For cross-referencing, they are given with list indices from Andreini, Williams, Johnson, and Grünbaum. Coxeter uses δ4 for a honeycomb, hδ4 for an alternated cubic honeycomb, qδ4 for a quarter cubic honeycomb. The fundamental infinite Coxeter groups for 3-space are, The C ~3, cubic, The B ~3, alternated cubic, The A ~3 cyclic group, or, There is a correspondence between all three families. Removing one mirror from C ~3 produces B ~3 and this allows multiple constructions of the same honeycombs. If cells are colored based on positions within each Wythoff construction. In addition there are 5 special honeycombs which dont have pure reflectional symmetry and are constructed from reflectional forms with elongation and gyration operations, the total unique honeycombs above are 18. The total unique honeycombs above are 10. Combining these counts,18 and 10 gives us the total 28 uniform honeycombs, the regular cubic honeycomb, represented by Schläfli symbol, offers seven unique derived uniform honeycombs via truncation operations. The reflectional symmetry is the affine Coxeter group, There are four index 2 subgroups that generate alternations, and +, with the first two generated repeated forms, and the last two are nonuniform. The B ~4, group offers 11 derived forms via truncation operations, There are 3 index 2 subgroups that generate alternations, and +
74.
Tetrahedral-octahedral honeycomb
–
The tetrahedral-octahedral honeycomb, alternated cubic honeycomb is a quasiregular space-filling tessellation in Euclidean 3-space. It is composed of alternating octahedra and tetrahedra in a ratio of 1,2, other names include half cubic honeycomb, half cubic cellulation, or tetragonal disphenoidal cellulation. John Horton Conway calls this honeycomb a tetroctahedrille, and its dual dodecahedrille and it is vertex-transitive with 8 tetrahedra and 6 octahedra around each vertex. It is edge-transitive with 2 tetrahedra and 2 octahedra alternating on each edge, a geometric honeycomb is a space-filling of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the general mathematical tiling or tessellation in any number of dimensions. Honeycombs are usually constructed in ordinary Euclidean space, like the uniform honeycombs. They may also be constructed in non-Euclidean spaces, such as hyperbolic uniform honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. It is also part of another family of uniform honeycombs called simplectic honeycombs. In this case of 3-space, the honeycomb is alternated, reducing the cubic cells to tetrahedra. As such it can be represented by an extended Schläfli symbol h as containing half the vertices of the cubic honeycomb, theres a similar honeycomb called gyrated tetrahedral-octahedral honeycomb which has layers rotated 60 degrees so half the edges have neighboring rather than alternating tetrahedra and octahedra. Each slice will contain up and downward facing square pyramids and tetrahedra sitting on their edges, a second slice direction needs no new faces and includes alternating tetrahedral and octahedral. This slab honeycomb is a scaliform honeycomb rather than uniform because it has nonuniform cells, the alternated cubic honeycomb can be orthogonally projected into the planar square tiling by a geometric folding operation that maps one pairs of mirrors into each other. The projection of the cubic honeycomb creates two offset copies of the square tiling vertex arrangement of the plane, Its vertex arrangement represents an A3 lattice or D3 lattice. It is the 3-dimensional case of a simplectic honeycomb and its Voronoi cell is a rhombic dodecahedron, the dual of the cuboctahedron vertex figure for the tet-oct honeycomb. The D+3 packing can be constructed by the union of two D3 lattices, the D+ n packing is only a lattice for even dimensions. The kissing number of the D*3 lattice is 8 and its Voronoi tessellation is a cubic honeycomb. The, Coxeter group generates 15 permutations of uniform honeycombs,9 with distinct geometry including the cubic honeycomb. The expanded cubic honeycomb is geometrically identical to the cubic honeycomb, the, Coxeter group generates 9 permutations of uniform honeycombs,4 with distinct geometry including the alternated cubic honeycomb
75.
Cubic honeycomb
–
The cubic honeycomb or cubic cellulation is the only regular space-filling tessellation in Euclidean 3-space, made up of cubic cells. It has 4 cubes around every edge, and 8 cubes around each vertex and its vertex figure is a regular octahedron. It is a tessellation with Schläfli symbol. John Horton Conway calls this honeycomb a cubille, a geometric honeycomb is a space-filling of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the general mathematical tiling or tessellation in any number of dimensions. Honeycombs are usually constructed in ordinary Euclidean space, like the uniform honeycombs. They may also be constructed in non-Euclidean spaces, such as hyperbolic uniform honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. The Cartesian coordinates of the vertices are, for all values, i, j, k, with edges parallel to the axes. It is part of a family of hypercube honeycombs, with Schläfli symbols of the form, starting with the square tiling. It is one of 28 uniform honeycombs using convex uniform polyhedral cells, simple cubic lattices can be distorted into lower symmetries, represented by lower crystal systems, There is a large number of uniform colorings, derived from different symmetries. These include, It is related to the regular 4-polytope tesseract, Schläfli symbol, which exists in 4-space and its also related to the order-5 cubic honeycomb, Schläfli symbol, of hyperbolic space with 5 cubes around each edge. It is in a sequence of polychora and honeycomb with octahedral vertex figures and it in a sequence of regular polytopes and honeycombs with cubic cells. The, Coxeter group generates 15 permutations of uniform tessellations,9 with distinct geometry including the cubic honeycomb. The expanded cubic honeycomb is geometrically identical to the cubic honeycomb, the, Coxeter group generates 9 permutations of uniform tessellations,4 with distinct geometry including the alternated cubic honeycomb. This honeycomb is one of five distinct uniform honeycombs constructed by the A ~3 Coxeter group and it is composed of octahedra and cuboctahedra in a ratio of 1,1. John Horton Conway calls this honeycomb a cuboctahedrille, and its dual oblate octahedrille, There are four uniform colorings for the cells of this honeycomb with reflective symmetry, listed by their Coxeter group, and Wythoff construction name, and the Coxeter diagram below. This honeycomb can be divided on trihexagonal tiling planes, using the hexagon centers of the cuboctahedra and this scaliform honeycomb is represented by Coxeter diagram, and symbol s3, with coxeter notation symmetry. The truncated cubic honeycomb or truncated cubic cellulation is a uniform space-filling tessellation in Euclidean 3-space and it is composed of truncated cubes and octahedra in a ratio of 1,1
76.
Quarter cubic honeycomb
–
The quarter cubic honeycomb, quarter cubic cellulation or bitruncated alternated cubic honeycomb is a space-filling tessellation in Euclidean 3-space. It is composed of tetrahedra and truncated tetrahedra in a ratio of 1,1 and it is called quarter-cubic because its symmetry unit – the minimal block from which the pattern is developed by reflections – consists of four such units of the cubic honeycomb. It is vertex-transitive with 6 truncated tetrahedra and 2 tetrahedra around each vertex, a geometric honeycomb is a space-filling of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the general mathematical tiling or tessellation in any number of dimensions. Honeycombs are usually constructed in ordinary Euclidean space, like the uniform honeycombs. They may also be constructed in non-Euclidean spaces, such as hyperbolic uniform honeycombs, any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. It is one of the 28 convex uniform honeycombs, the faces of this honeycombs cells form four families of parallel planes, each with a 3.6.3.6 tiling. Its vertex figure is an isosceles antiprism, two triangles joined by six isosceles triangles. John Horton Conway calls this honeycomb a truncated tetrahedrille, and its dual oblate cubille, the vertices and edges represent a Kagome lattice in three dimensions. The quarter cubic honeycomb can be constructed in layers of truncated tetrahedra and tetrahedral cells. Two tetrahedra are stacked by a vertex and a central inversion, in each trihexagonal tiling, half of the triangles belong to tetrahedra, and half belong to truncated tetrahedra. These slab layers must be stacked with tetrahedra triangles to truncated tetrahedral triangles to construct the uniform quarter cubic honeycomb, slab layers of hexagonal prisms and triangular prisms can be alternated for elongated honeycombs, but these are also not uniform. Cells can be shown in two different symmetries, the reflection generated form represented by its Coxeter-Dynkin diagram has two colors of truncated cuboctahedra. The symmetry can be doubled by relating the pairs of ringed and unringed nodes of the Coxeter-Dynkin diagram and this honeycomb is one of five distinct uniform honeycombs constructed by the A ~3 Coxeter group. Conway, Heidi Burgiel, Chaim Goodman-Strauss, The Symmetries of Things, ISBN 978-1-56881-220-5 George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Branko Grünbaum, norman Johnson Uniform Polytopes, Manuscript Williams, Robert. The Geometrical Foundation of Natural Structure, A Source Book of Design, order in Space, A design source book. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, A. Andreini, Sulle reti di poliedri regolari e semiregolari e sulle corrispondenti reti correlative, società Italiana della Scienze, Ser.3,14 75–129
77.
5-cell honeycomb
–
In four-dimensional Euclidean geometry, the 4-simplex honeycomb, 5-cell honeycomb or pentachoric-dispentachoric honeycomb is a space-filling tessellation honeycomb. It is composed of 5-cells and rectified 5-cells facets in a ratio of 1,1, cells of the vertex figure are ten tetrahedrons and 20 triangular prisms, corresponding to the ten 5-cells and 20 rectified 5-cells that meet at each vertex. The 20 vertices of its figure, the runcinated 5-cell represent the 20 roots of the A ~4 Coxeter group. It is the 4-dimensional case of a simplectic honeycomb and this inversion results in another non-Wythoffian uniform convex honeycomb. Octahedral prisms and tetrahedral prisms may be inserted in between alternated laminae as well, resulting in two more non-Wythoffian elongated uniform honeycombs and this honeycomb is one of seven unique uniform honeycombs constructed by the A ~4 Coxeter group. The symmetry can be multiplied by the symmetry of rings in the Coxeter–Dynkin diagrams, Small cyclorhombated pentachoric tetracomb small prismatodispentachoric tetracomb The cyclotruncated 4-simplex honeycomb or cyclotruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a birectified 5-cell honeycomb and it is composed of 5-cells, truncated 5-cells, and bitruncated 5-cells facets in a ratio of 2,2,1. Its vertex figure is an Elongated tetrahedral antiprism, with 8 equilateral triangle and 24 isosceles triangle faces and it can be constructed as five sets of parallel hyperplanes that divide space into two half-spaces. The 3-space hyperplanes contain quarter cubic honeycombs as a collection facets, cyclotruncated pentachoric tetracomb Small truncated-pentachoric tetracomb The truncated 4-simplex honeycomb or truncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cyclocantitruncated 5-cell honeycomb, Great cyclorhombated pentachoric tetracomb Great truncated-pentachoric tetracomb The cantellated 4-simplex honeycomb or cantellated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncitruncated 5-cell honeycomb, cycloprismatorhombated pentachoric tetracomb Great prismatodispentachoric tetracomb The bitruncated 4-simplex honeycomb or bitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be called a cycloruncicantitruncated 5-cell honeycomb, Great cycloprismated pentachoric tetracomb Grand prismatodispentachoric tetracomb The omnitruncated 4-simplex honeycomb or omnitruncated 5-cell honeycomb is a space-filling tessellation honeycomb. It can also be seen as a cantitruncated 5-cell honeycomb and also a cyclosteriruncicantitruncated 5-cell honeycomb and it is composed entirely of omnitruncated 5-cell facets. Coxeter calls this Hintons honeycomb after C. H. Hinton, the facets of all omnitruncated simplectic honeycombs are called permutahedra and can be positioned in n+1 space with integral coordinates, permutations of the whole numbers. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, Coxeter, Regular and Semi-Regular Polytopes III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Model 134 Klitzing, Richard
78.
Tesseractic honeycomb
–
Its vertex figure is a 16-cell. Two tesseracts meet at each cell, four meet at each square face, eight meet on each edge. It is an analog of the tiling, of the plane. These are all part of the hypercubic honeycomb family of tessellations of the form, tessellations in this family are Self-dual. Vertices of this honeycomb can be positioned in 4-space in all integer coordinates, there are many different Wythoff constructions of this honeycomb. The most symmetric form is regular, with Schläfli symbol, another form has two alternating tesseract facets with Schläfli symbol. The lowest symmetry Wythoff construction has 16 types of facets around each vertex, one can be made by stericating another. The, Coxeter group generates 31 permutations of uniform tessellations,21 with distinct symmetry and 20 with distinct geometry, the expanded tesseractic honeycomb is geometrically identical to the tesseractic honeycomb. Three of the symmetric honeycombs are shared in the family, two alternations and, and the quarter tesseractic are repeated in other families. The, Coxeter group generates 31 permutations of uniform tessellations,23 with distinct symmetry and 4 with distinct geometry, there are two alternated forms, the alternations and have the same geometry as the 16-cell honeycomb and snub 24-cell honeycomb respectively. The 24-cell honeycomb is similar, but as a body centered cubic, it has vertices positioned at integers, the tesseract can make a regular tessellation of the 4-sphere, with three tesseracts per face, with Schläfli symbol, called an order-3 tesseractic honeycomb. It is topologically equivalent to the regular polytope penteract in 5-space, the tesseract can make a regular tessellation of 4-dimensional hyperbolic space, with 5 tesseracts around each face, with Schläfli symbol, called an order-5 tesseractic honeycomb. A birectified tesseractic honeycomb, contains all rectified 16-cell facets and is the Voronoi tessellation of the D4* lattice. Facets can be colored from a doubled C ~4 ×2, symmetry, alternately colored from C ~4, symmetry, three colors from B ~4, symmetry, and 4 colors from D ~4. Regular and uniform honeycombs in 4-space, 16-cell honeycomb 24-cell honeycomb 5-cell honeycomb Truncated 5-cell honeycomb Omnitruncated 5-cell honeycomb Coxeter, Regular Polytopes, Dover edition, ISBN 0-486-61480-8 p.296, Table II, Regular honeycombs Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript - Model 1 Klitzing, Richard
79.
16-cell honeycomb
–
In four-dimensional Euclidean geometry, the 16-cell honeycomb is one of the three regular space-filling tessellations in Euclidean 4-space. The other two are its dual the 24-cell honeycomb, and the tesseractic honeycomb and this honeycomb is constructed from 16-cell facets, three around every face. It has a 24-cell vertex figure and this vertex arrangement or lattice is called the B4, D4, or F4 lattice. Vertices can be placed at all integer coordinates, such that the sum of the coordinates is even, the vertex arrangement of the 16-cell honeycomb is called the D4 lattice or F4 lattice. The D+4 lattice can be constructed by the union of two D4 lattices, and is identical to the honeycomb, ∪ = = This packing is only a lattice for even dimensions. The kissing number is 23 =8, the kissing number of the D*4 lattice is 24 and its Voronoi tessellation is a 24-cell honeycomb, containing all rectified 16-cells Voronoi cells, or. There are three different symmetry constructions of this tessellation, each symmetry can be represented by different arrangements of colored 16-cell facets. It is related to the regular hyperbolic 5-space 5-orthoplex honeycomb, with 5-orthoplex facets, the regular 4-polytope 24-cell, with octahedral cell, and cube, with square faces. S. M. Regular Polytopes, Dover edition, ISBN 0-486-61480-8 pp. 154–156, Partial truncation or alternation, represented by h prefix, coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, coxeter, Regular and Semi-Regular Polytopes III, George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Klitzing, Richard. X3o3o4o3o - hext - O104 Conway JH, Sloane NJH
80.
Rectified tesseractic honeycomb
–
In four-dimensional Euclidean geometry, the rectified tesseractic honeycomb is a uniform space-filling tessellation in Euclidean 4-space. Its vertex figure is a prism, ×. It is also called a quarter tesseractic honeycomb since it has half the vertices of the 4-demicubic honeycomb, the, Coxeter group generates 31 permutations of uniform tessellations,21 with distinct symmetry and 20 with distinct geometry. The expanded tesseractic honeycomb is geometrically identical to the tesseractic honeycomb, three of the symmetric honeycombs are shared in the family. Two alternations and, and the quarter tesseractic are repeated in other families, the, Coxeter group generates 31 permutations of uniform tessellations,23 with distinct symmetry and 4 with distinct geometry. There are two alternated forms, the alternations and have the same geometry as the 16-cell honeycomb and snub 24-cell honeycomb respectively. There are ten uniform honeycombs constructed by the D ~4 Coxeter group, all repeated in other families by extended symmetry, the 10th is constructed as an alternation. As subgroups in Coxeter notation, are all isomorphic to, S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi-Regular Polytopes III, See p318 George Olshevsky, Uniform Panoploid Tetracombs, Manuscript Klitzing, Richard. O4x3o3o4o, o3o3o *b3x4o, x3o3x *b3o4o, x3o3x *b3o *b3o - rittit - O87 Conway JH, Sloane NJH
81.
24-cell honeycomb
–
In four-dimensional Euclidean geometry, the 24-cell honeycomb, or icositetrachoric honeycomb is a regular space-filling tessellation of 4-dimensional Euclidean space by regular 24-cells. It can be represented by Schläfli symbol, the dual tessellation by regular 16-cell honeycomb has Schläfli symbol. Together with the tesseractic honeycomb these are the regular tessellations of Euclidean 4-space. If a 3-sphere is inscribed in each hypercell of this tessellation, the packing density of this arrangement is π216 ≅0.61685. The 24-cell honeycomb can be constructed as the Voronoi tessellation of the D4 or F4 root lattice, each 24-cell is then centered at a D4 lattice point, i. e. one of. These points can also be described as Hurwitz quaternions with even square norm, the vertices of the honeycomb lie at the deep holes of the D4 lattice. These are the Hurwitz quaternions with odd square norm and it can be constructed as a birectified tesseractic honeycomb, by taking a tesseractic honeycomb and placing vertices at the centers of all the square faces. The 24-cell facets exist between these vertices as rectified 16-cells, if the coordinates of the tesseractic honeycomb are integers, the birectified tesseractic honeycomb vertices can be placed at all permutations of half-unit shifts in two of the four dimensions, thus. Each 24-cell in the 24-cell honeycomb has 24 neighboring 24-cells, with each neighbor it shares exactly one octahedral cell. It has 24 more neighbors such that each of these it shares a single vertex. It has no neighbors with which it only an edge or only a face. The vertex figure of the 24-cell honeycomb is a tesseract, so there are 16 edges,32 triangles,24 octahedra, and 8 24-cells meeting at every vertex. The edge figure is a tetrahedron, so there are 4 triangles,6 octahedra, finally, the face figure is a triangle, so there are 3 octahedra and 3 24-cells meeting at every face. One way to visualize a 4-dimensional figure is to consider various 3-dimensional cross-sections and that is, the intersection of various hyperplanes with the figure in question. Applying this technique to the 24-cell honeycomb gives rise to various 3-dimensional honeycombs with varying degrees of regularity, a vertex-first cross-section uses some hyperplane orthogonal to a line joining opposite vertices of one of the 24-cells. For instance, one could take any of the hyperplanes in the coordinate system given above. The cross-section of by one of these gives a rhombic dodecahedral honeycomb. Each of the rhombic dodecahedra corresponds to a maximal cross-section of one of the 24-cells intersecting the hyperplane, accordingly, the rhombic dodecahedral honeycomb is the Voronoi tessellation of the D3 root lattice
82.
Uniform 5-honeycomb
–
In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope facets, the complete set of convex uniform 5-polytopes has not been determined, but most can be made as Wythoff constructions from a small set of symmetry groups. These construction operations are represented by the permutations of rings of the Coxeter diagrams, Regular polytopes,1852, Ludwig Schläfli proved in his manuscript Theorie der vielfachen Kontinuität that there are exactly 3 regular polytopes in 5 or more dimensions. Convex uniform polytopes, 1940-1988, The search was expanded systematically by H. S. M, Coxeter in his publication Regular and Semi-Regular Polytopes I, II, and III. 1966, Norman W. Johnson completed his Ph. D, There are exactly three such regular polytopes, all convex, - 5-simplex - 5-cube - 5-orthoplex There are no nonconvex regular polytopes in 5 or more dimensions. There are 104 known convex uniform 5-polytopes, plus a number of families of duoprism prisms. All except the grand antiprism prism are based on Wythoff constructions, the 5-simplex is the regular form in the A5 family. The 5-cube and 5-orthoplex are the forms in the B5 family. The bifurcating graph of the D6 family contains the pentacross, as well as a 5-demicube which is an alternated 5-cube, one non-Wythoffian - The grand antiprism prism is the only known non-Wythoffian convex uniform 5-polytope, constructed from two grand antiprisms connected by polyhedral prisms. That brings the tally to, 19+31+8+46+1=105 In addition there are, Infinitely many uniform 5-polytope constructions based on duoprism prismatic families, Infinitely many uniform 5-polytope constructions based on duoprismatic families, ×, ×, ×. There are 19 forms based on all permutations of the Coxeter diagrams with one or more rings and they are named by Norman Johnson from the Wythoff construction operations upon regular 5-simplex. The A5 family has symmetry of order 720,7 of the 19 figures, with symmetrically ringed Coxeter diagrams have doubled symmetry, order 1440. The coordinates of uniform 5-polytopes with 5-simplex symmetry can be generated as permutations of simple integers in 6-space, the B5 family has symmetry of order 3840. This family has 25−1=31 Wythoffian uniform polytopes generated by marking one or more nodes of the Coxeter diagram, for simplicity it is divided into two subgroups, each with 12 forms, and 7 middle forms which equally belong in both. The 5-cube family of 5-polytopes are given by the hulls of the base points listed in the following table, with all permutations of coordinates. Each base point generates a distinct uniform 5-polytope, all coordinates correspond with uniform 5-polytopes of edge length 2. The D5 family has symmetry of order 1920 and this family has 23 Wythoffian uniform polyhedra, from 3x8-1 permutations of the D5 Coxeter diagram with one or more rings. 15 are repeated from the B5 family and 8 are unique to this family, There are 5 finite categorical uniform prismatic families of polytopes based on the nonprismatic uniform 4-polytopes, This prismatic family has 9 forms, The A1 x A4 family has symmetry of order 240