|
Bitruncated Cubic Honeycomb
The bitruncated cubic honeycomb is a space-filling tessellation (or honeycomb) in Euclidean 3-space made up of truncated octahedra (or, equivalently, bitruncated cubes). It has 4 truncated octahedra around each vertex. Being composed entirely of truncated octahedra, it is cell-transitive. It is also edge-transitive, with 2 hexagons and one square on each edge, and vertex-transitive. It is one of 28 uniform honeycombs. John Horton Conway calls this honeycomb a truncated octahedrille in his Architectonic and catoptric tessellation list, with its dual called an ''oblate tetrahedrille'', also called a disphenoid tetrahedral honeycomb. Although a regular tetrahedron can not tessellate space alone, this dual has identical disphenoid tetrahedron cells with isosceles triangle faces. Geometry It can be realized as the Voronoi tessellation of the body-centred cubic lattice. Lord Kelvin conjectured that a variant of the ''bitruncated cubic honeycomb'' (with curved faces and edges, but the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitruncated Cubic Tiling
In geometry, a bitruncation is an operation on regular polytopes. It represents a truncation beyond rectification. The original edges are lost completely and the original faces remain as smaller copies of themselves. Bitruncated regular polytopes can be represented by an extended Schläfli symbol notation or In regular polyhedra and tilings For regular polyhedra (i.e. regular 3-polytopes), a ''bitruncated'' form is the truncated dual. For example, a bitruncated cube is a truncated octahedron. In regular 4-polytopes and honeycombs For a regular 4-polytope, a ''bitruncated'' form is a dual-symmetric operator. A bitruncated 4-polytope is the same as the bitruncated dual, and will have double the symmetry if the original 4-polytope is self-dual. A regular polytope (or honeycomb) will have its cells bitruncated into truncated cells, and the vertices are replaced by truncated cells. Self-dual 4-polytope/honeycombs An interesting result of this operation is that self-d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Disphenoid Tetrahedral Honeycomb
The tetragonal disphenoid tetrahedral honeycomb is a space-filling tessellation (or honeycomb) in Euclidean 3-space made up of identical tetragonal disphenoidal cells. Cells are face-transitive with 4 identical isosceles triangle faces. John Horton Conway calls it an ''oblate tetrahedrille'' or shortened to ''obtetrahedrille''. Symmetry of Things, Table 21.1. Prime Architectonic and Catopric tilings of space, p. 293, 295. A cell can be seen as 1/12 of a translational cube, with its vertices centered on two faces and two edges. Four of its edges belong to 6 cells, and two edges belong to 4 cells. : The tetrahedral disphenoid honeycomb is the dual of the uniform bitruncated cubic honeycomb. Its vertices form the A / D lattice, which is also known as the body-centered cubic lattice. Geometry This honeycomb's vertex figure is a tetrakis cube: 24 disphenoids meet at each vertex. The union of these 24 disphenoids forms a rhombic dodecahedron. Each edge of the tessellation is s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Horton Conway
John Horton Conway (26 December 1937 – 11 April 2020) was an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions to many branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life. Born and raised in Liverpool, Conway spent the first half of his career at the University of Cambridge before moving to the United States, where he held the John von Neumann Professorship at Princeton University for the rest of his career. On 11 April 2020, at age 82, he died of complications from COVID-19. Early life and education Conway was born on 26 December 1937 in Liverpool, the son of Cyril Horton Conway and Agnes Boyce. He became interested in mathematics at a very early age. By the time he was 11, his ambition was to become a mathematician. After leaving sixth form, he studied mathematics at Gonville and Caius College, Camb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex-transitive
In geometry, a polytope (e.g. a polygon or polyhedron) or a tiling is isogonal or vertex-transitive if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in the same or reverse order, and with the same angles between corresponding faces. Technically, one says 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 '' acts transitively'' on its vertices, or that the vertices lie within a single '' symmetry orbit''. All vertices of a finite -dimensional isogonal figure exist on an -sphere. The term isogonal has long been used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups and graph theory. The pseudorhombicuboctahedronwhich is ''not'' isogonaldemonstrates that simply asserting that "all vertices look the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edge-transitive
In geometry, a polytope (for example, a polygon or a polyhedron) or a tiling is isotoxal () or edge-transitive if its symmetries act transitively on its edges. Informally, this means that there is only one type of edge to the object: given two edges, there is a translation, rotation, and/or reflection that will move one edge to the other, while leaving the region occupied by the object unchanged. Isotoxal polygons An isotoxal polygon is an even-sided i.e. equilateral polygon, but not all equilateral polygons are isotoxal. The duals of isotoxal polygons are isogonal polygons. Isotoxal 4n-gons are centrally symmetric, so are also zonogons. In general, an isotoxal 2n-gon has \mathrm_n, (^*nn) dihedral symmetry. For example, a rhombus is an isotoxal "2×2-gon" (quadrilateral) with \mathrm_2, (^*22) symmetry. All regular polygons (equilateral triangle, square, etc.) are isotoxal, having double the minimum symmetry order: a regular n-gon has \mathrm_n, (^*nn) dihedral symmetry. An ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cell-transitive
In geometry, a tessellation of dimension (a plane tiling) or higher, or a polytope of dimension (a polyhedron) or higher, is isohedral or face-transitive if all its Face (geometry), faces are the same. More specifically, all faces must be not merely Congruence (geometry), congruent but must be ''transitive'', i.e. must lie within the same ''symmetry orbit''. In other words, for any two faces and , there must be a symmetry of the ''entire'' figure by Translation (geometry), translations, Rotation (mathematics), rotations, and/or Reflection (mathematics), reflections that maps onto . For this reason, Convex polytope, convex isohedral polyhedra are the shapes that will make fair dice. Isohedral polyhedra are called isohedra. They can be described by their face configuration. An isohedron has an Parity (mathematics), even number of faces. The Dual polyhedron, dual of an isohedral polyhedron is vertex-transitive, i.e. isogonal. The Catalan solids, the bipyramids, and the trapezo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitruncation (geometry)
In geometry, a bitruncation is an operation on regular polytopes. It represents a truncation beyond rectification. The original edges are lost completely and the original faces remain as smaller copies of themselves. Bitruncated regular polytopes can be represented by an extended Schläfli symbol notation or In regular polyhedra and tilings For regular polyhedra (i.e. regular 3-polytopes), a ''bitruncated'' form is the truncated dual. For example, a bitruncated cube is a truncated octahedron. In regular 4-polytopes and honeycombs For a regular 4-polytope, a ''bitruncated'' form is a dual-symmetric operator. A bitruncated 4-polytope is the same as the bitruncated dual, and will have double the symmetry if the original 4-polytope is self-dual. A regular polytope (or honeycomb) will have its cells bitruncated into truncated cells, and the vertices are replaced by truncated cells. Self-dual 4-polytope/honeycombs An interesting result of this operation is that self ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean 3-space
Three-dimensional space (also: 3D space, 3-space or, rarely, tri-dimensional space) is a geometric setting in which three values (called ''parameters'') are required to determine the position of an element (i.e., point). This is the informal meaning of the term dimension. In mathematics, a tuple of numbers can be understood as the Cartesian coordinates of a location in a -dimensional Euclidean space. The set of these -tuples is commonly denoted \R^n, and can be identified to the -dimensional Euclidean space. When , this space is called three-dimensional Euclidean space (or simply Euclidean space when the context is clear). It serves as a model of the physical universe (when relativity theory is not considered), in which all known matter exists. While this space remains the most compelling and useful way to model the world as it is experienced, it is only one example of a large variety of spaces in three dimensions called 3-manifolds. In this classical example, when the thre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Honeycomb (geometry)
In geometry, a honeycomb is a ''space filling'' or ''close packing'' of polyhedral or higher-dimensional ''cells'', so that there are no gaps. It is an example of the more general mathematical ''tiling'' or ''tessellation'' in any number of dimensions. Its dimension can be clarified as ''n''-honeycomb for a honeycomb of ''n''-dimensional space. Honeycombs are usually constructed in ordinary Euclidean ("flat") space. They may also be constructed in non-Euclidean spaces, such as hyperbolic honeycombs. Any finite uniform polytope can be projected to its circumsphere to form a uniform honeycomb in spherical space. Classification There are infinitely many honeycombs, which have only been partially classified. The more regular ones have attracted the most interest, while a rich and varied assortment of others continue to be discovered. The simplest honeycombs to build are formed from stacked layers or ''slabs'' of prisms based on some tessellations of the plane. In particula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tessellation
A tessellation or tiling is the covering of a surface, often a plane (mathematics), plane, using one or more geometric shapes, called ''tiles'', with no overlaps and no gaps. In mathematics, tessellation can be generalized to high-dimensional spaces, higher dimensions and a variety of geometries. A periodic tiling has a repeating pattern. Some special kinds include ''regular tilings'' with regular polygonal tiles all of the same shape, and ''semiregular tilings'' with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An ''aperiodic tiling'' uses a small set of tile shapes that cannot form a repeating pattern. A ''tessellation of space'', also known as a space filling or honeycomb, can be defined in the geometry of higher dimensions. A real physical tessellation is a tiling made of materials such a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isochoric Figure
In geometry, a tessellation of dimension (a plane tiling) or higher, or a polytope of dimension (a polyhedron) or higher, is isohedral or face-transitive if all its faces are the same. More specifically, all faces must be not merely congruent but must be ''transitive'', i.e. must lie within the same ''symmetry orbit''. In other words, for any two faces and , there must be a symmetry of the ''entire'' figure by translations, rotations, and/or reflections that maps onto . For this reason, convex isohedral polyhedra are the shapes that will make fair dice. Isohedral polyhedra are called isohedra. They can be described by their face configuration. An isohedron has an even number of faces. The dual of an isohedral polyhedron is vertex-transitive, i.e. isogonal. The Catalan solids, the bipyramids, and the trapezohedra are all isohedral. They are the duals of the (isogonal) Archimedean solids, prisms, and antiprisms, respectively. The Platonic solids, which are either self-dual ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
