Omnitruncation

Last updated

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. [1] Because the barycentric subdivision of any polytope can be realized as another polytope, [2] the same is true for the omnitruncation of any polytope.

Contents

When omnitruncation is applied to a regular polytope (or honeycomb) it can be described geometrically as a Wythoff construction that creates a maximum number of facets. It is represented in a Coxeter–Dynkin diagram with all nodes ringed.

It is a shortcut term which has a different meaning in progressively-higher-dimensional polytopes:

See also

Related Research Articles

<span class="mw-page-title-main">Uniform 4-polytope</span> Class of 4-dimensional polytopes

In geometry, a uniform 4-polytope is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons.

<span class="mw-page-title-main">Quarter cubic honeycomb</span>

The quarter cubic honeycomb, quarter cubic cellulation or bitruncated alternated cubic honeycomb is a space-filling tessellation in Euclidean 3-space. It is composed of tetrahedra and truncated tetrahedra in a ratio of 1:1. It is called "quarter-cubic" because its symmetry unit – the minimal block from which the pattern is developed by reflections – is four times that of the cubic honeycomb.

<span class="mw-page-title-main">Truncation (geometry)</span> Operation that cuts polytope vertices, creating a new facet in place of each vertex

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.

<span class="mw-page-title-main">Coxeter–Dynkin diagram</span> Pictorial representation of symmetry

In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors. It describes a kaleidoscopic construction: each graph "node" represents a mirror and the label attached to a branch encodes the dihedral angle order between two mirrors, that is, the amount by which the angle between the reflective planes can be multiplied to get 180 degrees. An unlabeled branch implicitly represents order-3, and each pair of nodes that is not connected by a branch at all represents a pair of mirrors at order-2.

<span class="mw-page-title-main">Cantellation (geometry)</span> Geometric operation on a regular polytope

In geometry, a cantellation is a 2nd-order truncation in any dimension that bevels a regular polytope at its edges and at its vertices, creating a new facet in place of each edge and of each vertex. Cantellation also applies to regular tilings and honeycombs. Cantellating a polyhedron is also rectifying its rectification.

<span class="mw-page-title-main">Expansion (geometry)</span> Geometric operation on convex polytopes

In geometry, expansion is a polytope operation where facets are separated and moved radially apart, and new facets are formed at separated elements. Equivalently this operation can be imagined by keeping facets in the same position but reducing their size.

<span class="mw-page-title-main">Runcination</span>

In geometry, runcination is an operation that cuts a regular polytope simultaneously along the faces, edges, and vertices, creating new facets in place of the original face, edge, and vertex centers.

<span class="mw-page-title-main">Uniform 8-polytope</span>

In 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.

<span class="mw-page-title-main">Uniform 7-polytope</span>

In 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.

<span class="mw-page-title-main">Uniform 9-polytope</span>

In nine-dimensional geometry, a nine-dimensional polytope or 9-polytope is a polytope contained by 8-polytope facets. Each 7-polytope ridge being shared by exactly two 8-polytope facets.

<span class="mw-page-title-main">Uniform 6-polytope</span>

In six-dimensional geometry, a uniform 6-polytope is a six-dimensional uniform polytope. A uniform polypeton is vertex-transitive, and all facets are uniform 5-polytopes.

<span class="mw-page-title-main">Uniform polytope</span> Isogonal polytope with uniform facets

In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform facets. The uniform polytopes in two dimensions are the regular polygons.

<span class="mw-page-title-main">Snub (geometry)</span> Geometric operation applied to a polyhedron

In geometry, a snub is an operation applied to a polyhedron. The term originates from Kepler's names of two Archimedean solids, for the snub cube and snub dodecahedron. In general, snubs have chiral symmetry with two forms: with clockwise or counterclockwise orientation. By Kepler's names, a snub can be seen as an expansion of a regular polyhedron: moving the faces apart, twisting them about their centers, adding new polygons centered on the original vertices, and adding pairs of triangles fitting between the original edges.

<span class="mw-page-title-main">Uniform 10-polytope</span>

In ten-dimensional geometry, a 10-polytope is a 10-dimensional polytope whose boundary consists of 9-polytope facets, exactly two such facets meeting at each 8-polytope ridge.

<span class="mw-page-title-main">Stericated 5-simplexes</span>

In five-dimensional geometry, a stericated 5-simplex is a convex uniform 5-polytope with fourth-order truncations (sterication) of the regular 5-simplex.

<span class="mw-page-title-main">Pentellated 6-simplexes</span>

In six-dimensional geometry, a pentellated 6-simplex is a convex uniform 6-polytope with 5th order truncations of the regular 6-simplex.

<span class="mw-page-title-main">Heptellated 8-simplexes</span>

In eight-dimensional geometry, a heptellated 8-simplex is a convex uniform 8-polytope, including 7th-order truncations (heptellation) from the regular 8-simplex.

<span class="mw-page-title-main">Runcinated 5-orthoplexes</span>

In five-dimensional geometry, a runcinated 5-orthoplex is a convex uniform 5-polytope with 3rd order truncation (runcination) of the regular 5-orthoplex.

<span class="mw-page-title-main">Cyclotruncated simplectic honeycomb</span>

In geometry, the cyclotruncated simplectic honeycomb is a dimensional infinite series of honeycombs, based on the symmetry of the affine Coxeter group. It is given a Schläfli symbol t0,1{3[n+1]}, and is represented by a Coxeter-Dynkin diagram as a cyclic graph of n+1 nodes with two adjacent nodes ringed. It is composed of n-simplex facets, along with all truncated n-simplices.

<span class="mw-page-title-main">Steric 7-cubes</span>

In seven-dimensional geometry, a stericated 7-cube is a convex uniform 7-polytope, being a runcination of the uniform 7-demicube. There are 4 unique runcinations for the 7-demicube including truncation and cantellation.

References

  1. Matteo, Nicholas (2015), Convex Polytopes and Tilings with Few Flag Orbits (Doctoral dissertation), Northeastern University, ProQuest   1680014879 See p. 22, where the omnitruncation is described as a "flag graph".
  2. Ewald, G.; Shephard, G. C. (1974), "Stellar subdivisions of boundary complexes of convex polytopes", Mathematische Annalen, 210: 7–16, doi:10.1007/BF01344542, MR   0350623

Further reading

Polyhedron operators
Seed Truncation Rectification Bitruncation Dual Expansion Omnitruncation Alternations
CDel node 1.pngCDel p.pngCDel node n1.pngCDel q.pngCDel node n2.pngCDel node 1.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node.pngCDel node.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node.pngCDel node.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node 1.pngCDel node.pngCDel p.pngCDel node.pngCDel q.pngCDel node 1.pngCDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node 1.pngCDel node 1.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node 1.pngCDel node h.pngCDel p.pngCDel node.pngCDel q.pngCDel node.pngCDel node.pngCDel p.pngCDel node h.pngCDel q.pngCDel node h.pngCDel node h.pngCDel p.pngCDel node h.pngCDel q.pngCDel node h.png
Uniform polyhedron-43-t0.svg Uniform polyhedron-43-t01.svg Uniform polyhedron-43-t1.svg Uniform polyhedron-43-t12.svg Uniform polyhedron-43-t2.svg Uniform polyhedron-43-t02.png Uniform polyhedron-43-t012.png Uniform polyhedron-33-t0.png Uniform polyhedron-43-h01.svg Uniform polyhedron-43-s012.png
t0{p,q}
{p,q}
t01{p,q}
t{p,q}
t1{p,q}
r{p,q}
t12{p,q}
2t{p,q}
t2{p,q}
2r{p,q}
t02{p,q}
rr{p,q}
t012{p,q}
tr{p,q}
ht0{p,q}
h{q,p}
ht12{p,q}
s{q,p}
ht012{p,q}
sr{p,q}