|
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; these can be considered uniform tilings of the sphere. Most uniform tilings can be made from a Wythoff construction starting with a symmetry group and a singular generator point inside of the fundamental domain. A planar symmetry group has a polygonal fundamental domain and can be represented by its group notation: the sequence of the reflection orders of the fundamental domain vertices. A fundamental domain triangle is denoted (''p q r''), where ''p'', ''q'', ''r'' are whole numbers > 1, i.e. ≥ 2; a fundamental domain right triangle is denoted (''p q'' 2). The triangle may exist as a spherical triangle, a Euclidean plane triangle, or a hyperbolic plane triangle, depending on the values of ''p'', ''q'', ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Tiling
Euclidean Plane (mathematics), plane Tessellation, tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Johannes Kepler, Kepler in his (Latin language, Latin: ''The Harmony of the World'', 1619). Notation of Euclidean tilings Euclidean tilings are usually named after Cundy & Rollett’s notation. This notation represents (i) the number of vertices, (ii) the number of polygons around each vertex (arranged clockwise) and (iii) the number of sides to each of those polygons. For example: 36; 36; 34.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3-uniform (2-vertex types)’ tiling. Broken down, 36; 36 (both of different transitivity class), or (36)2, tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided polygons (triangles). With a final vertex 34.6, 4 more contiguous equilateral triangles and a single re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Norman Johnson (mathematician)
Norman Woodason Johnson (November 12, 1930 – July 13, 2017) was an American mathematician at Wheaton College, Norton, Massachusetts. Early life and education Norman Johnson was born on in Chicago. His father had a bookstore and published a local newspaper. Johnson earned his undergraduate mathematics degree in 1953 at Carleton College in Northfield, Minnesota followed by a master's degree from the University of Pittsburgh. After graduating in 1953, Johnson did alternative civilian service as a conscientious objector. He earned his PhD from the University of Toronto in 1966 with a dissertation title of ''The Theory of Uniform Polytopes and Honeycombs'' under the supervision of H. S. M. Coxeter. From there, he accepted a position in the Mathematics Department of Wheaton College in Massachusetts and taught until his retirement in 1998. Career In 1966, he enumerated 92 convex non-uniform polyhedra with regular faces. Victor Zalgaller later proved (1969) that Johnson's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-Wythoffian
In geometry, a Wythoff construction, named after mathematician Willem Abraham Wythoff, is a method for constructing a uniform polyhedron or plane tiling. It is often referred to as Wythoff's kaleidoscopic construction. Construction process The method is based on the idea of tiling a sphere, with spherical triangles – see Schwarz triangles. This construction arranges three mirrors at the sides of a triangle, like in a kaleidoscope. However, different from a kaleidoscope, the mirrors are not parallel, but intersect at a single point. They therefore enclose a spherical triangle on the surface of any sphere centered on that point and repeated reflections produce a multitude of copies of the triangle. If the angles of the spherical triangle are chosen appropriately, the triangles will tile the sphere, one or more times. If one places a vertex at a suitable point inside the spherical triangle enclosed by the mirrors, it is possible to ensure that the reflections of that point ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Apeirogonal Antiprism
In geometry, an apeirogonal antiprism or infinite antiprismConway (2008), p. 263 is the arithmetic limit of the family of antiprisms; it can be considered an infinite polyhedron or a tiling of the plane. If the sides are equilateral triangles, it is a uniform tiling. In general, it can have two sets of alternating congruent isosceles triangles, surrounded by two half-planes. Related tilings and polyhedra The apeirogonal antiprism is the arithmetic limit of the family of antiprisms sr or ''p''.3.3.3, as ''p'' tends to infinity, thereby turning the antiprism into a Euclidean tiling. File:Infinite prism.svg, The apeirogonal antiprism can be constructed by applying an alternation operation to an apeirogonal prism. File:Apeirogonal trapezohedron.svg, The dual tiling of an apeirogonal antiprism is an ''apeirogonal deltohedron''. Similarly to the uniform polyhedra and the uniform tilings, eight uniform tilings may be based from the regular apeirogonal tiling. The rectified and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Apeirogonal Prism
In geometry, an apeirogonal prism or infinite prism is the arithmetic limit of the family of prisms; it can be considered an infinite polyhedron or a tiling of the plane.Conway (2008), p.263 Thorold Gosset called it a ''2-dimensional semi-check'', like a single row of a checkerboard. If the sides are squares, it is a uniform tiling. If colored with two sets of alternating squares it is still uniform. File:Infinite prism alternating.svg, Uniform variant with alternate colored square faces. File:Infinite_bipyramid.svg, Its dual tiling is an ''apeirogonal bipyramid''. Related tilings and polyhedra The apeirogonal tiling is the arithmetic limit of the family of prisms t or ''p''.4.4, as ''p'' tends to infinity, thereby turning the prism into a Euclidean tiling. An alternation operation can create an apeirogonal antiprism composed of three triangles and one apeirogon at each vertex. : Similarly to the uniform polyhedra and the uniform tilings, eight uniform tilings may b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elongated Triangular Tiling 1
Elongation may refer to: * Elongation (astronomy) * Elongation (geometry) * Elongation (plasma physics) * Part of transcription of DNA into RNA of all types, including mRNA, tRNA, rRNA, etc. * Part of translation (biology) of mRNA into proteins * Elongated organisms * Elongation (mechanics) In physics and continuum mechanics, deformation is the change in the shape or size of an object. It has dimension of length with SI unit of metre (m). It is quantified as the residual displacement of particles in a non- rigid body, from an con ..., linear deformation See also * {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frieze Group
In mathematics, a frieze or frieze pattern is a two-dimensional design that repeats in one direction. The term is derived from friezes in architecture and decorative arts, where such repeating patterns are often used. Frieze patterns can be classified into seven types according to their symmetries. The set of symmetry, symmetries of a frieze pattern is called a frieze group. Frieze groups are two-dimensional line groups, having repetition in only one direction. They are related to the more complex wallpaper groups, which classify patterns that are repetitive in two directions, and crystallographic groups, which classify patterns that are repetitive in three directions. History Mathematical friezes have their origins in the formulas for the '' pentagramma mirificum'' found by Carl Friedrich Gauss in 1843 and Harold Scott MacDonald Coxeter's study of symmetries in the mid-20th century. Frieze patterns were formally introduced by Coxeter in 1971. In the 1970s to 1980s, frieze patte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orbifold Notation
In geometry, orbifold notation (or orbifold signature) is a system, invented by the mathematician William Thurston and promoted by John Horton Conway, John Conway, for representing types of symmetry groups in two-dimensional spaces of constant curvature. The advantage of the notation is that it describes these groups in a way which indicates many of the groups' properties: in particular, it follows William Thurston in describing the orbifold obtained by taking the quotient of Euclidean space by the group under consideration. Groups representable in this notation include the point groups in three dimensions, point groups on the sphere (S^2), the frieze groups and wallpaper groups of the Euclidean plane (E^2), and their analogues on the hyperbolic geometry, hyperbolic plane (H^2). Definition of the notation The following types of Euclidean transformation can occur in a group described by orbifold notation: * reflection through a line (or plane) * translation by a vector * rotati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; for example, the symmetry group of each regular polyhedron is a finite Coxeter group. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 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 symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Polyhedron
In geometry, a uniform polyhedron has regular polygons as Face (geometry), faces and is vertex-transitive—there is an isometry mapping any vertex onto any other. It follows that all vertices are congruence (geometry), congruent. Uniform polyhedra may be Regular polyhedron, regular (if also Isohedral figure, face- and Isotoxal figure, edge-transitive), Quasiregular polyhedron, quasi-regular (if also edge-transitive but not face-transitive), or Semiregular polyhedron, semi-regular (if neither edge- nor face-transitive). The faces and vertices don't need to be Convex polyhedron, convex, so many of the uniform polyhedra are also Star polyhedron, star polyhedra. There are two infinite classes of uniform polyhedra, together with 75 other polyhedra. They are 2 infinite classes of Prism (geometry), prisms and antiprisms, the convex polyhedrons as in 5 Platonic solids and 13 Archimedean solids—2 Quasiregular polyhedron, quasiregular and 11 Semiregular polyhedron, semiregular&m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alternation (geometry)
In geometry, an alternation or ''partial truncation'', is an operation on a polygon, polyhedron, tessellation, tiling, or higher dimensional polytope that removes alternate vertices.Coxeter, Regular polytopes, pp. 154–156 8.6 Partial truncation, or alternation Coxeter labels an ''alternation'' by a prefixed ''h'', standing for ''hemi'' or ''half''. Because alternation reduces all polygon faces to half as many sides, it can only be applied to polytopes with all even-sided faces. An alternated square face becomes a digon, and being degenerate, is usually reduced to a single edge. More generally any vertex-uniform polyhedron or tiling with a vertex configuration consisting of all even-numbered elements can be ''alternated''. For example, the alternation of a vertex figure with ''2a.2b.2c'' is ''a.3.b.3.c.3'' where the three is the number of elements in this vertex figure. A special case is square faces whose order divides in half into degenerate digons. So for example, the cu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Omnitruncation
In geometry, an omnitruncation of a convex polytope is a simple polytope of the same dimension, having a vertex for each flag of the original polytope and a facet for each face of any dimension of the original polytope. Omnitruncation is the dual operation to barycentric subdivision. Because the barycentric subdivision of any polytope can be realized as another polytope, the same is true for the omnitruncation of any polytope. When omnitruncation is applied to a regular polytope (or honeycomb) it can be described geometrically as a Wythoff construction that creates a maximum number of facets. It is represented in a Coxeter–Dynkin diagram with all nodes ringed. It is a ''shortcut'' term which has a different meaning in progressively-higher-dimensional polytopes: * Uniform polytope truncation operators ** For regular polygons: An ordinary truncation, t_\ = t\ = \. *** Coxeter-Dynkin diagram ** For uniform polyhedra (3-polytopes): A cantitruncation, t_\ = tr\. (Application ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
