Omnitruncation

From testwiki
Revision as of 05:08, 8 April 2023 by imported>Tamfang (typo)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description 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.

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

References

Template:Reflist

Further reading

  • Coxeter, H.S.M. Regular Polytopes, (3rd edition, 1973), Dover edition, Template:Isbn (pp. 145–154 Chapter 8: Truncation, p 210 Expansion)
  • Norman Johnson Uniform Polytopes, Manuscript (1991)
    • N.W. Johnson: The Theory of Uniform Polytopes and Honeycombs, Ph.D. Dissertation, University of Toronto, 1966

Template:Polyhedron operators

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