BitruncationIn 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 t_1,2{p,q,...} or 2t{p,q,...}. For regular polyhedra (i.e. regular 3-polytopes), a bitruncated form is the truncated dual. For example, a bitruncated cube is a truncated octahedron.
RuncinationIn geometry, runcination is an operation that cuts a regular polytope (or honeycomb) simultaneously along the faces, edges, and vertices, creating new facets in place of the original face, edge, and vertex centers. It is a higher order truncation operation, following cantellation, and truncation. It is represented by an extended Schläfli symbol t0,3{p,q,...}. This operation only exists for 4-polytopes {p,q,r} or higher. This operation is dual-symmetric for regular uniform 4-polytopes and 3-space convex uniform honeycombs.
5-polytopeIn geometry, a five-dimensional polytope (or 5-polytope) is a polytope in five-dimensional space, bounded by (4-polytope) facets, pairs of which share a polyhedral cell. A 5-polytope is a closed five-dimensional figure with vertices, edges, faces, and cells, and 4-faces. A vertex is a point where five or more edges meet. An edge is a line segment where four or more faces meet, and a face is a polygon where three or more cells meet. A cell is a polyhedron, and a 4-face is a 4-polytope.
Demi-hypercubevignette|Les deux demi-hypercubes du cube de dimension 3 sont des tétraèdres. En géométrie, un demi-hypercube est un polytope de dimension n formé en les sommets d'un hypercube de dimension n, c'est-à-dire en ne conservant qu'un sommet sur deux. Il est également appelé polytope de demi-mesure. À partir d'un hypercube donné, on peut obtenir deux demi-hypercubes distincts, en fonction des sommets que l'on élimine et de ceux que l'on garde (il y a deux choix possibles).
Convex uniform honeycombIn 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.
Diagramme de Coxeter-DynkinEn géométrie, un diagramme de Coxeter-Dynkin est un graphe représentant un ensemble relationnel de miroirs (ou d'hyperplans de réflexion) dans l'espace pour une construction kaléidoscopique. En tant que graphe lui-même, le diagramme représente les groupes de Coxeter, chaque nœud du graphe représente un miroir (facette du domaine) et chaque branche du graphe représente l'ordre de l'angle diédral entre deux miroirs (sur une arête du domaine). En plus, les graphes ont des anneaux (cercles) autour des nœuds pour les miroirs actifs représentant un polytope précis.
Figure de sommetEn géométrie, une figure de sommet d'un sommet donné d'un polytope est, de façon intuitive, l'ensemble des points directement reliés à ce sommet par une arête. Ceci s’applique également aux pavages infinis, ou pavages remplissant l’espace avec des cellules polytopiques. De façon plus précise, une figure de sommet pour un n-polytope est un (n-1)-polytope. Ainsi, une figure de sommet pour un polyèdre est une figure polygonale, et la figure de sommet pour un polychore est une figure polyèdrique.
Uniform 8-polytopeIn eight-dimensional geometry, an eight-dimensional polytope or 8-polytope is a polytope contained by 7-polytope facets. Each 6-polytope ridge being shared by exactly two 7-polytope facets. A uniform 8-polytope is one which is vertex-transitive, and constructed from uniform 7-polytope facets. Regular 8-polytopes can be represented by the Schläfli symbol {p,q,r,s,t,u,v}, with v {p,q,r,s,t,u} 7-polytope facets around each peak.
Uniform 7-polytopeIn seven-dimensional geometry, a 7-polytope is a polytope contained by 6-polytope facets. Each 5-polytope ridge being shared by exactly two 6-polytope facets. A uniform 7-polytope is one whose symmetry group is transitive on vertices and whose facets are uniform 6-polytopes. Regular 7-polytopes are represented by the Schläfli symbol {p,q,r,s,t,u} with u {p,q,r,s,t} 6-polytopes facets around each 4-face. There are exactly three such convex regular 7-polytopes: {3,3,3,3,3,3} - 7-simplex {4,3,3,3,3,3} - 7-cube {3,3,3,3,3,4} - 7-orthoplex There are no nonconvex regular 7-polytopes.
Uniform tilingIn 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 which 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.
