|
Icosahedral Honeycomb
In geometry, the icosahedral honeycomb is one of four compact, regular, space-filling tessellations (or honeycombs) in hyperbolic 3-space. With Schläfli symbol there are three icosahedra around each edge, and 12 icosahedra around each vertex, in a regular dodecahedral vertex figure. Description The dihedral angle of a regular icosahedron is around 138.2°, so it is impossible to fit three icosahedra around an edge in Euclidean 3-space. However, in hyperbolic space, properly scaled icosahedra can have dihedral angles of exactly 120 degrees, so three of those can fit around an edge. Related regular honeycombs There are four regular compact honeycombs in 3D hyperbolic space: Related regular polytopes and honeycombs It is a member of a sequence of regular polychora and honeycombs with deltrahedral cells: It is also a member of a sequence of regular polychora and honeycombs , with vertex figures composed of pentagons: Uniform honeycombs There are nine uniform h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
H3 353 CC Center
H3, H03 or H-3 may refer to: Entertainment * ''Happy Hustle High'', a manga series by Rie Takada, originally titled "H3 School!" * ''H3'' (film), a 2001 film about the 1981 Irish hunger strike * h3h3Productions, styled " 3, a satirical YouTube channel Science * Triatomic hydrogen (H3), an unstable molecule * Trihydrogen cation (H3+), one of the most abundant ions in the universe * Tritium (Hydrogen-3, or H-3), an isotope of hydrogen * ATC code H03 ''Thyroid therapy'', a subgroup of the Anatomical Therapeutic Chemical Classification System * British NVC community H3, a heath community of the British National Vegetation Classification system * Histamine H3 receptor, a human gene * Histone H3, a component of DNA higher structure in eukaryotic cells * , one of the three laryngeals in the reconstructed Proto-Indo-European language * Hekla 3 eruption, a huge volcanic eruption around 1000 BC Computing * , the level-3 HTML heading markup element * HTTP/3, the third revision ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Regular Polytopes And Compounds
This article 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 and hyperbolic spaces. A Schläfli symbol describing an ''n''-polytope equivalently describes a tessellation of an (''n'' − 1)-sphere. In addition, the symmetry of a regular polytope or tessellation is expressed as a Coxeter group, which Coxeter expressed identically to the Schläfli symbol, except delimiting by square brackets, a notation that is called Coxeter notation. Another related symbol is the Coxeter-Dynkin diagram which represents a symmetry group with no rings, and the represents regular polytope or tessellation with a ring on the first node. For example, the cube has Schläfli symbol , and with its octahedral symmetry, ,3or , it is represented by Coxeter diagram . The regular polytopes are grouped by dimension and subgrouped by convex, nonconvex an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncated Dodecahedron
In geometry, the truncated dodecahedron is an Archimedean solid. It has 12 regular decagonal faces, 20 regular triangular faces, 60 vertices and 90 edges. Geometric relations This polyhedron can be formed from a regular dodecahedron by truncating (cutting off) the corners so the pentagon faces become decagons and the corners become triangles. It is used in the cell-transitive hyperbolic space-filling tessellation, the bitruncated icosahedral honeycomb. Area and volume The area ''A'' and the volume ''V'' of a truncated dodecahedron of edge length ''a'' are: :\begin A &= 5 \left(\sqrt+6\sqrt\right) a^2 &&\approx 100.990\,76a^2 \\ V &= \tfrac \left(99+47\sqrt\right) a^3 &&\approx 85.039\,6646a^3 \end Cartesian coordinates Cartesian coordinates for the vertices of a truncated dodecahedron with edge length 2''φ'' − 2, centered at the origin, are all even permutations of: :(0, ±, ±(2 + ''φ'')) :(±, ±''φ'', ±2''φ'') :(±''φ'', ±2, ±(''φ'' ... [...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] |
Convex Uniform Honeycombs In Hyperbolic Space
In hyperbolic geometry, a uniform honeycomb in hyperbolic space is a uniform tessellation of uniform polyhedral cells. In 3-dimensional hyperbolic space there are nine Coxeter group families of compact convex uniform honeycombs, generated as Wythoff constructions, and represented by permutations of rings of the Coxeter diagrams for each family. Hyperbolic uniform honeycomb families Honeycombs are divided between compact and paracompact forms defined by Coxeter groups, the first category only including finite cells and vertex figures (finite subgroups), and the second includes affine subgroups. Compact uniform honeycomb families The nine compact Coxeter groups are listed here with their Coxeter diagrams, in order of the relative volumes of their fundamental simplex domains. These 9 families generate a total of 76 unique uniform honeycombs. The full list of hyperbolic uniform honeycombs has not been proven and an unknown number of non-Wythoffian forms exist. Two known ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deltahedron
In geometry, a deltahedron (plural ''deltahedra'') is a polyhedron whose face (geometry), faces are all equilateral triangles. The name is taken from the Greek language, Greek upper case delta (letter), delta (Δ), which has the shape of an equilateral triangle. There are infinitely many deltahedra, all having an even number of faces by the handshaking lemma. Of these only eight are Convex polyhedron, convex, having 4, 6, 8, 10, 12, 14, 16 and 20 faces. The number of faces, edges, and vertex (geometry), vertices is listed below for each of the eight convex deltahedra. The eight convex deltahedra There are only eight strictly-convex deltahedra: three are regular polyhedra, and five are Johnson solids. The three regular convex polyhedra are indeed Platonic solids. In the 6-faced deltahedron, some vertices have degree 3 and some degree 4. In the 10-, 12-, 14-, and 16-faced deltahedra, some vertices have degree 4 and some degree 5. These five irregular deltahedra belong to the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polychora
In mathematics, a regular 4-polytope is a regular four-dimensional polytope. They are the four-dimensional analogues of the regular polyhedra in three dimensions and the regular polygons in two dimensions. There are six convex and ten star regular 4-polytopes, giving a total of sixteen. History The convex regular 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. He discovered that there are precisely six such figures. Schläfli also found four of the regular star 4-polytopes: the grand 120-cell, great stellated 120-cell, grand 600-cell, and great grand stellated 120-cell. He skipped the remaining six because he would not allow forms that failed the Euler characteristic on cells or vertex figures (for zero-hole tori: ''F'' − ''E'' + ''V'' 2). That excludes cells and vertex figures such as the great dodecahedron and small stellated dodecahedron . Edmund Hess (1843–1903) published th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Angle
A dihedral angle is the angle between two intersecting planes or half-planes. In chemistry, it is the clockwise angle between half-planes through two sets of three atoms, having two atoms in common. In solid geometry, it is defined as the union of a line and two half-planes that have this line as a common edge. In higher dimensions, a dihedral angle represents the angle between two hyperplanes. The planes of a flying machine are said to be at positive dihedral angle when both starboard and port main planes (commonly called wings) are upwardly inclined to the lateral axis. When downwardly inclined they are said to be at a negative dihedral angle. Mathematical background When the two intersecting planes are described in terms of Cartesian coordinates by the two equations : a_1 x + b_1 y + c_1 z + d_1 = 0 :a_2 x + b_2 y + c_2 z + d_2 = 0 the dihedral angle, \varphi between them is given by: :\cos \varphi = \frac and satisfies 0\le \varphi \le \pi/2. Alternatively, if an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex Figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions Take some corner or Vertex (geometry), vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance. For example Coxeter (e.g. 1948, 1954) 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 tessellation, tilings or, by extension, to Honeycomb (geometry), space-filling tessellation with polytope Cell (geometry), cells and other higher-dimensional polytopes. As a flat slice Make a slice through the corner of the polyhedron, cutting through all the edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (geometry)
In geometry, a vertex (in plural form: vertices or vertexes) is a point (geometry), point where two or more curves, line (geometry), lines, or edge (geometry), edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedron, polyhedra are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a vertex is called "convex set, convex" if the internal an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edge (geometry)
In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. Relation to edges in graphs In graph theory, an edge is an abstract object connecting two graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges. Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitz's theore ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
