Truncated dodecadodecahedron

In geometry, the truncated dodecadodecahedron (or stellatruncated dodecadodecahedron) is a nonconvex uniform polyhedron, indexed as U59. It is given a Schläfli symbol t0,1,2{53,5}. It has 54 faces (30 squares, 12 decagons, and 12 decagrams), 180 edges, and 120 vertices.[1] The central region of the polyhedron is connected to the exterior via 20 small triangular holes.

Truncated dodecadodecahedron
TypeUniform star polyhedron
ElementsF = 54, E = 180
V = 120 (χ = 6)
Faces by sides30{4}+12{10}+12{10/3}
Wythoff symbol2 5 5/3 |
Symmetry groupIh, [5,3], *532
Index referencesU59, C75, W98
Dual polyhedronMedial disdyakis triacontahedron
Vertex figure
4.10/9.10/3
Bowers acronymQuitdid
3D model of a truncated dodecadodecahedron

The name truncated dodecadodecahedron is somewhat misleading: truncation of the dodecadodecahedron would produce rectangular faces rather than squares, and the pentagram faces of the dodecahedron would turn into truncated pentagrams rather than decagrams. However, it is the quasitruncation of the dodecadodecahedron, as defined by Coxeter, Longuet-Higgins & Miller (1954).[2] For this reason, it is also known as the quasitruncated dodecadodecahedron.[3] Coxeter et al. credit its discovery to a paper published in 1881 by Austrian mathematician Johann Pitsch.[4]

Cartesian coordinates

Cartesian coordinates for the vertices of a truncated dodecadodecahedron are all the triples of numbers obtained by circular shifts and sign changes from the following points (where is the golden ratio):

Each of these five points has eight possible sign patterns and three possible circular shifts, giving a total of 120 different points.

As a Cayley graph

The truncated dodecadodecahedron forms a Cayley graph for the symmetric group on five elements, as generated by two group members: one that swaps the first two elements of a five-tuple, and one that performs a circular shift operation on the last four elements. That is, the 120 vertices of the polyhedron may be placed in one-to-one correspondence with the 5! permutations on five elements, in such a way that the three neighbors of each vertex are the three permutations formed from it by swapping the first two elements or circularly shifting (in either direction) the last four elements.[5]

Medial disdyakis triacontahedron

Medial disdyakis triacontahedron
TypeStar polyhedron
Face
ElementsF = 120, E = 180
V = 54 (χ = 6)
Symmetry groupIh, [5,3], *532
Index referencesDU59
dual polyhedronTruncated dodecadodecahedron
3D model of a medial disdyakis triacontahedron

The medial disdyakis triacontahedron is a nonconvex isohedral polyhedron. It is the dual of the uniform truncated dodecadodecahedron.

gollark: !pr pass 69
gollark: No u.
gollark: !propose Add a new rule %9ee6f60faf321bbd6d56904fe70fe4c5:> Proposal 70 is considered open on any prime-numbered day of the month.
gollark: Hi!
gollark: !propose <@!258639553357676545> wins the game. <@!160279332454006795> wins the game. <@!151149148639330304> loses the game.

See also

References

  1. Maeder, Roman. "59: truncated dodecadodecahedron". MathConsult.
  2. Coxeter, H. S. M.; Longuet-Higgins, M. S.; Miller, J. C. P. (1954), "Uniform polyhedra", Philosophical Transactions of the Royal Society of London. Series A. Mathematical and Physical Sciences, 246: 401–450, Bibcode:1954RSPTA.246..401C, doi:10.1098/rsta.1954.0003, JSTOR 91532, MR 0062446. See especially the description as a quasitruncation on p. 411 and the photograph of a model of its skeleton in Fig. 114, Plate IV.
  3. Wenninger writes "quasitruncated dodecahedron", but this appear to be a mistake. Wenninger, Magnus J. (1971), "98 Quasitruncated dodecahedron", Polyhedron Models, Cambridge University Press, pp. 152–153.
  4. Pitsch, Johann (1881), "Über halbreguläre Sternpolyeder", Zeitschrift für das Realschulwesen, 6: 9–24, 72–89, 216. According to Coxeter, Longuet-Higgins & Miller (1954), the truncated dodecadodecahedron appears as no. XII on p.86.
  5. Eppstein, David (2008), "The topology of bendless three-dimensional orthogonal graph drawing", in Tollis, Ioannis G.; Patrignani, Marizio (eds.), Proc. 16th Int. Symp. Graph Drawing, Lecture Notes in Computer Science, 5417, Heraklion, Crete: Springer-Verlag, pp. 78–89, arXiv:0709.4087, doi:10.1007/978-3-642-00219-9_9.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.