Concept

Honeycomb (geometry)

Related concepts (27)

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.

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 corner or 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.

Hexahedron

A hexahedron (plural: hexahedra or hexahedrons) or sexahedron (plural: sexahedra or sexahedrons) is any polyhedron with six faces. A cube, for example, is a regular hexahedron with all its faces square, and three squares around each vertex. There are seven topologically distinct convex hexahedra, one of which exists in two mirror image forms. There are three topologically distinct concave hexahedra.

Rhombohedron

In geometry, a rhombohedron (also called a rhombic hexahedron or, inaccurately, a rhomboid) is a three-dimensional figure with six faces which are rhombi. It is a special case of a parallelepiped where all edges are the same length. It can be used to define the rhombohedral lattice system, a honeycomb with rhombohedral cells. A cube is a special case of a rhombohedron with all sides square. In general a rhombohedron can have up to three types of rhombic faces in congruent opposite pairs, Ci symmetry, order 2.

Dissection problem

In geometry, a dissection problem is the problem of partitioning a geometric figure (such as a polytope or ball) into smaller pieces that may be rearranged into a new figure of equal content. In this context, the partitioning is called simply a dissection (of one polytope into another). It is usually required that the dissection use only a finite number of pieces. Additionally, to avoid set-theoretic issues related to the Banach–Tarski paradox and Tarski's circle-squaring problem, the pieces are typically required to be well-behaved.

Trapezo-rhombic dodecahedron

In geometry, the trapezo-rhombic dodecahedron or rhombo-trapezoidal dodecahedron is a convex dodecahedron with 6 rhombic and 6 trapezoidal faces. It has D_3h symmetry. A concave form can be constructed with an identical net, seen as excavating trigonal trapezohedra from the top and bottom. It is also called the trapezoidal dodecahedron. This polyhedron could be constructed by taking a tall uniform hexagonal prism, and making 3 angled cuts on the top and bottom.

Isohedral figure

In geometry, a tessellation of dimension 2 (a plane tiling) or higher, or a polytope of dimension 3 (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 A and B, there must be a symmetry of the entire figure by translations, rotations, and/or reflections that maps A onto B.

Zonohedron

In geometry, a zonohedron is a convex polyhedron that is centrally symmetric, every face of which is a polygon that is centrally symmetric (a zonogon). Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three-dimensional space, or as a three-dimensional projection of a hypercube. Zonohedra were originally defined and studied by E. S. Fedorov, a Russian crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope.

Convex uniform honeycomb

In geometry, a convex uniform honeycomb is a uniform tessellation which fills three-dimensional Euclidean space with non-overlapping convex uniform polyhedral cells. Twenty-eight such honeycombs are known: the familiar cubic honeycomb and 7 truncations thereof; the alternated cubic honeycomb and 4 truncations thereof; 10 prismatic forms based on the uniform plane tilings (11 if including the cubic honeycomb); 5 modifications of some of the above by elongation and/or gyration.

Hilbert's third problem

The third of Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedra of equal volume, is it always possible to cut the first into finitely many polyhedral pieces which can be reassembled to yield the second? Based on earlier writings by Carl Friedrich Gauss, David Hilbert conjectured that this is not always possible. This was confirmed within the year by his student Max Dehn, who proved that the answer in general is "no" by producing a counterexample.

Uniform polyhedron

In geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive (i.e., there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent. Uniform polyhedra may be regular (if also face- and edge-transitive), quasi-regular (if also edge-transitive but not face-transitive), or semi-regular (if neither edge- nor face-transitive). The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra.