Lably
Skip to content

Truncation (geometry)

Operation that cuts polytope vertices, creating a new facet in place of each vertex

  • 4 min read
  • 6 chapters

Related on Lably

Through Geometry, Johannes Kepler and Surface (mathematics)

A different truncation is defined for otherwise infinite surfaces via the intersection with another surface, particularly a plane, such as in a truncated cone.

Uniform truncation

In general any polyhedron (or polytope) can also be truncated with a degree of freedom as to how deep the cut is, as shown in Conway polyhedron notation truncation operation.

A special kind of truncation, usually implied, is a uniform truncation, a truncation operator applied to a regular polyhedron (or regular polytope) which creates a resulting uniform polyhedron (uniform polytope) with equal edge lengths. There are no degrees of freedom, and it represents a fixed geometric, just like the regular polyhedra.

In general all single ringed uniform polytopes have a uniform truncation. For example, the icosidodecahedron, represented as Schläfli symbols r{5,3} or {53}, and Coxeter-Dynkin diagram or has a uniform truncation, the truncated icosidodecahedron, represented as tr{5,3} or t{53}, . In the Coxeter-Dynkin diagram, the effect of a truncation is to ring all the nodes adjacent to the ringed node.

A uniform truncation performed on the regular triangular tiling {3,6} results in the regular hexagonal tiling {6,3}.

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Geometry