Omnitruncation Explained

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, the same is true for the omnitruncation of any polytope.

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:

t0,1\{p\}=t\{p\}=\{2p\}

.

t0,1,2\{p,q\}=tr\{p,q\}

. (Application of both cantellation and truncation operations)

t0,1,2,3\{p,q,r\}

. (Application of runcination, cantellation, and truncation operations)

t0,1,2,3,4\{p,q,r,s\}

. (Application of sterication, runcination, cantellation, and truncation operations)

t0,1,...,n-1\{p1,p2,...,pn\}

.

See also

Further reading

Notes and References

  1. See p. 22, where the omnitruncation is described as a "flag graph".