Jump to content

Truncated octahedron

From Wikipedia, the free encyclopedia
Truncated octahedron
TypeArchimedean solid,
Parallelohedron,
Permutohedron,
Plesiohedron,
Zonohedron
Faces14
Edges36
Vertices24
Symmetry groupoctahedral symmetry
Dual polyhedrontetrakis hexahedron
Vertex figure
Net

In geometry, the truncated octahedron is the Archimedean solid that arises from a regular octahedron by removing six pyramids, one at each of the octahedron's vertices. The truncated octahedron has 14 faces (8 regular hexagons and 6 squares), 36 edges, and 24 vertices. Since each of its faces has point symmetry the truncated octahedron is a 6-zonohedron. It is also the Goldberg polyhedron GIV(1,1), containing square and hexagonal faces. Like the cube, it can tessellate (or "pack") 3-dimensional space, as a permutohedron.

The truncated octahedron was called the "mecon" by Buckminster Fuller.[1]

Its dual polyhedron is the tetrakis hexahedron. If the original truncated octahedron has unit edge length, its dual tetrakis hexahedron has edge lengths 9/82 and 3/22.

As an Archimedean solid

[edit]

A truncated octahedron is constructed from a regular octahedron by cutting off all vertices. This resulting polyhedron has six squares and eight hexagons, leaving out six square pyramids. Considering that each length of the regular octahedron is , and the edge length of a square pyramid is (the square pyramid is an equilateral, the first Johnson solid). From the equilateral square pyramid's property, its volume is . Because six equilateral square pyramids are removed by truncation, the volume of a truncated octahedron is obtained by subtracting the volume of a regular octahedron from those six:[2] The surface area of a truncated octahedron can be obtained by summing all polygonals' area, six squares and eight hexagons. Considering the edge length , this is:[2]

3D model of a truncated octahedron

The truncated octahedron is one of the thirteen Archimedean solids. In other words, it has a highly symmetric and semi-regular polyhedron with two or more different regular polygonal faces that meet in a vertex.[3] The dual polyhedron of a truncated octahedron is the tetrakis hexahedron. They both have the same three-dimensional symmetry group as the regular octahedron does, the octahedral symmetry .[4] A square and two hexagons surround each of its vertex, denoting its vertex figure as .[5]

The dihedral angle of a truncated octahedron between square-to-hexagon is , and that between adjacent hexagonal faces is .

As a tilling space polyhedron

[edit]
Truncated octahedron as a permutahedron of order 4
Truncated octahedron in tilling space

The truncated octahedron can be described as a permutohedron of order 4 or 4-permutohedron, meaning it can be represented with even more symmetric coordinates in four dimensions: all permutations of form the vertices of a truncated octahedron in the three-dimensional subspace .[6] Therefore, each vertex corresponds to a permutation of and each edge represents a single pairwise swap of two elements. It has the symmetric group .[7]

The truncated octahedron can be used as a tilling space. It is classified as plesiohedron, meaning it can be defined as the Voronoi cell of a symmetric Delone set.[8] The plesiohedron includes the parallelohedron, a polyhedron can be translated without rotating and tilling space so that it fills the entire face. There are five three-dimensional primary parallelohedrons, one of which is the truncated octahedron.[9] More generally, every permutohedron and parallelohedron is zonohedron, a polyhedron that is centrally symmetric that can be defined by using Minkowski sum.[10]

Applications

[edit]

In zeolite chemistry, the truncated octahedron occurs as the sodalite cage structure in the framework of faujasite crystals.

In solid-state physics, the 1st Brillouin zone of the face-centered cubic (fcc) lattice is a truncated octahedron.

The structure of the faujasite framework.
First Brillouin zone of FCC lattice, showing symmetry labels for high symmetry lines and points.

The truncated octahedron (in fact, the generalized truncated octahedron) appears in the error analysis of quantization index modulation (QIM) in conjunction with repetition coding.[11]

Dissection

[edit]

The truncated octahedron can be dissected into a central octahedron, surrounded by 8 triangular cupolae on each face, and 6 square pyramids above the vertices.[12]

Removing the central octahedron and 2 or 4 triangular cupolae creates two Stewart toroids, with dihedral and tetrahedral symmetry:

Genus 2 Genus 3
D3d, [2+,6], (2*3), order 12 Td, [3,3], (*332), order 24

It is possible to slice a tesseract by a hyperplane so that its sliced cross-section is a truncated octahedron.[13]

The cell-transitive bitruncated cubic honeycomb can also be seen as the Voronoi tessellation of the body-centered cubic lattice. The truncated octahedron is one of five three-dimensional primary parallelohedra.

Objects

[edit]
Jungle gym nets often include truncated octahedra.

Truncated octahedral graph

[edit]
Truncated octahedral graph
3-fold symmetric Schlegel diagram
Vertices24
Edges36
Automorphisms48
Chromatic number2
Book thickness3
Queue number2
PropertiesCubic, Hamiltonian, regular, zero-symmetric
Table of graphs and parameters

In the mathematical field of graph theory, a truncated octahedral graph is the graph of vertices and edges of the truncated octahedron. It has 24 vertices and 36 edges, and is a cubic Archimedean graph.[14] It has book thickness 3 and queue number 2.[15]

As a Hamiltonian cubic graph, it can be represented by LCF notation in multiple ways: [3, −7, 7, −3]6, [5, −11, 11, 7, 5, −5, −7, −11, 11, −5, −7, 7]2, and [−11, 5, −3, −7, −9, 3, −5, 5, −3, 9, 7, 3, −5, 11, −3, 7, 5, −7, −9, 9, 7, −5, −7, 3].[16]

Three different Hamiltonian cycles described by the three different LCF notations for the truncated octahedral graph

References

[edit]
  1. ^ "Truncated Octahedron". Wolfram Mathworld.
  2. ^ a b Berman, Martin (1971), "Regular-faced convex polyhedra", Journal of the Franklin Institute, 291 (5): 329–352, doi:10.1016/0016-0032(71)90071-8, MR 0290245
  3. ^ Diudea, M. V. (2018), Multi-shell Polyhedral Clusters, Springer, p. 39, doi:10.1007/978-3-319-64123-2, ISBN 978-3-319-64123-2
  4. ^ Koca, M.; Koca, N. O. (2013), "Coxeter groups, quaternions, symmetries of polyhedra and 4D polytopes", Mathematical Physics: Proceedings of the 13th Regional Conference, Antalya, Turkey, 27–31 October 2010, World Scientific, p. 48
  5. ^ Williams, Robert (1979), The Geometrical Foundation of Natural Structure: A Source Book of Design, Dover Publications, Inc., p. 78
  6. ^ Johnson, Tom; Jedrzejewski, Franck (2014), Looking at Numbers, Springer, p. 15, doi:10.1007/978-3-0348-0554-4, ISBN 978-3-0348-0554-4
  7. ^ Crisman, Karl-Dieter (2011), "The Symmetry Group of the Permutahedron", The College Mathematics Journal, 42 (2): 135–139, doi:10.4169/college.math.j.42.2.135, JSTOR college.math.j.42.2.135
  8. ^ Erdahl, R. M. (1999), "Zonotopes, dicings, and Voronoi's conjecture on parallelohedra", European Journal of Combinatorics, 20 (6): 527–549, doi:10.1006/eujc.1999.0294, MR 1703597. Voronoi conjectured that all tilings of higher dimensional spaces by translates of a single convex polytope are combinatorially equivalent to Voronoi tilings, and Erdahl proves this in the special case of zonotopes. But as he writes (p. 429), Voronoi's conjecture for dimensions at most four was already proven by Delaunay. For the classification of three-dimensional parallelohedra into these five types, see Grünbaum, Branko; Shephard, G. C. (1980). "Tilings with congruent tiles". Bulletin of the American Mathematical Society. New Series. 3 (3): 951–973. doi:10.1090/S0273-0979-1980-14827-2. MR 0585178.
  9. ^ Alexandrov, A. D. (2005), "8.1 Parallelohedra", Convex Polyhedra, Springer, pp. 349–359
  10. ^ Jensen, Patrick M.; Trinderup, Camilia H.; Dahl, Anders B.; Dahl, Vedrana A. (2019), "Zonohedral Approximation of Spherical Structuring Element for Volumetric Morphology", in Felsberg, Michael; Forssén, Per-Erik; Sintorn, Ida-Maria; Unger, Jonas (eds.), Image Analysis: 21st Scandinavian Conference, SCIA 2019, Norrköping, Sweden, June 11–13, 2019, Proceedings, Springer, p. 131–132, doi:10.1007/978-3-030-20205-7, ISBN 978-3-030-20205-7
  11. ^ Perez-Gonzalez, F.; Balado, F.; Martin, J.R.H. (2003). "Performance analysis of existing and new methods for data hiding with known-host information in additive channels". IEEE Transactions on Signal Processing. 51 (4): 960–980. Bibcode:2003ITSP...51..960P. doi:10.1109/TSP.2003.809368.
  12. ^ Doskey, Alex. "Adventures Among the Toroids – Chapter 5 – Simplest (R)(A)(Q)(T) Toroids of genus p=1". www.doskey.com.
  13. ^ Borovik, Alexandre V.; Borovik, Anna (2010), "Exercise 14.4", Mirrors and Reflections, Universitext, New York: Springer, p. 109, doi:10.1007/978-0-387-79066-4, ISBN 978-0-387-79065-7, MR 2561378
  14. ^ Read, R. C.; Wilson, R. J. (1998), An Atlas of Graphs, Oxford University Press, p. 269
  15. ^ Wolz, Jessica; Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018
  16. ^ Weisstein, Eric W. "Truncated octahedral graph". MathWorld.
[edit]