In geometry, the hexagonal prism is a prism with hexagonal base. Prisms are polyhedrons; this polyhedron has 8 faces, 18 edges, and 12 vertices. Since it has 8 faces, it is an octahedron. However, the term octahedron is primarily used to refer to the regular octahedron, which has eight triangular faces. Because of the ambiguity of the term octahedron and tilarity of the various eight-sided figures, the term is rarely used without clarification. Before sharpening, many pencils take the shape of a long hexagonal prism. If faces are all regular, the hexagonal prism is a semiregular polyhedron, more generally, a uniform polyhedron, and the fourth in an infinite set of prisms formed by square sides and two regular polygon caps. It can be seen as a truncated hexagonal hosohedron, represented by Schläfli symbol t{2,6}. Alternately it can be seen as the Cartesian product of a regular hexagon and a line segment, and represented by the product {6}×{}. The dual of a hexagonal prism is a hexagonal bipyramid. The symmetry group of a right hexagonal prism is D6h of order 24. The rotation group is D6 of order 12. As in most prisms, the volume is found by taking the area of the base, with a side length of , and multiplying it by the height , giving the formula: and its surface area can be The topology of a uniform hexagonal prism can have geometric variations of lower symmetry, including: It exists as cells of four prismatic uniform convex honeycombs in 3 dimensions: It also exists as cells of a number of four-dimensional uniform 4-polytopes, including: This polyhedron can be considered a member of a sequence of uniform patterns with vertex figure (4.6.2p) and Coxeter-Dynkin diagram . For p < 6, the members of the sequence are omnitruncated polyhedra (zonohedrons), shown below as spherical tilings. For p > 6, they are tilings of the hyperbolic plane, starting with the truncated triheptagonal tiling.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (1)
HUM-402: Experimental history of science I
The course allows students to learn by doing about the history of science, and the role played by experimentation, technical skills or material objects in the production of knowledge. Students will ex
Related publications (25)
Related concepts (13)
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.
Uniform tilings in hyperbolic plane
In hyperbolic geometry, a uniform hyperbolic tiling (or regular, quasiregular or semiregular hyperbolic tiling) is an edge-to-edge filling of the hyperbolic plane which has regular polygons as faces and is vertex-transitive (transitive on its vertices, isogonal, i.e. there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent, and the tiling has a high degree of rotational and translational symmetry.
Truncation (geometry)
In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex. The term originates from Kepler's names for the Archimedean solids. In general any polyhedron (or polytope) can also be truncated with a degree of freedom as to how deep the cut is, as shown in Conway polyhedron notation truncation operation. A special kind of truncation, usually implied, is a uniform truncation, a truncation operator applied to a regular polyhedron (or regular polytope) which creates a resulting uniform polyhedron (uniform polytope) with equal edge lengths.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.