login
A339349
The number of n-faced polyhedra formed when a cuboctahedron is internally cut by all the planes defined by any three of its vertices.
5
2304, 3000, 944, 408, 48, 24
OFFSET
4,1
COMMENTS
For a cuboctahedron create all possible internal planes defined by connecting any three of its vertices. Use all the resulting planes to cut the polyhedron into individual smaller polyhedra. The sequence lists the number of resulting n-faced polyhedra, where 4 <= n <= 9.
See A339348 for the corresponding sequence for the rhombic dodecahedron, the dual polyhedron of the cuboctahedron.
LINKS
Hyung Taek Ahn and Mikhail Shashkov, Geometric Algorithms for 3D Interface Reconstruction.
Scott R. Shannon, Image of the 48 8-faced polyhedra. None of these are visible on the surface of the cuboctahedron.
Scott R. Shannon, Image of the 24 9-faced polyhedra. None of these are visible on the surface of the cuboctahedron.
Scott R. Shannon, Image of all 6728 polyhedra. The colors are the same as those used in the above images.
Eric Weisstein's World of Mathematics, Cuboctahedron.
Wikipedia, Cuboctahedron.
EXAMPLE
The cuboctahedron has 12 vertices, 14 faces, and 24 edges. It is cut by 67 internal planes defined by any three of its vertices, resulting in the creation of 6728 polyhedra. No polyhedra with ten or more faces are created.
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
Scott R. Shannon, Dec 01 2020
STATUS
approved