Search results
Results from the WOW.Com Content Network
Its convex hull is a regular dodecahedron. It additionally shares its edge arrangement with the small ditrigonal icosidodecahedron (having the pentagrammic faces in common), the great ditrigonal icosidodecahedron (having the pentagonal faces in common), and the regular compound of five cubes.
What links here; Upload file; Special pages; Printable version; Page information; Get shortened URL; Download QR code
A regular dodecahedron or pentagonal dodecahedron [notes 1] is a dodecahedron composed of regular pentagonal faces, three meeting at each vertex. It is an example of Platonic solids, described as cosmic stellation by Plato in his dialogues, and it was used as part of Solar System proposed by Johannes Kepler. However, the regular dodecahedron ...
Uploaded a work by {{own}} from File:Dodecahedron schlegel diagram.png with UploadWizard: File usage. The following 5 pages use this file: 120-cell; Map (graph theory)
The stellation diagram for the regular dodecahedron with the central pentagon highlighted. This diagram represents the dodecahedron face itself. In geometry, a stellation diagram or stellation pattern is a two-dimensional diagram in the plane of some face of a polyhedron, showing lines where other face planes intersect with this one.
In geometry, the rhombic dodecahedron is a convex polyhedron with 12 congruent rhombic faces. It has 24 edges, and 14 vertices of 2 types. As a Catalan solid, it is the dual polyhedron of the cuboctahedron. As a parallelohedron, the rhombic dodecahedron can be used to tesselate its copies in space creating a rhombic dodecahedral honeycomb.
A shape with the same exterior appearance as the dodecadodecahedron can be constructed by folding up these nets: 12 pentagrams and 20 rhombic clusters are necessary. . However, this construction replaces the crossing pentagonal faces of the dodecadodecahedron with non-crossing sets of rhombi, so it does not produce the same internal st
The polyhedral graph formed as the Schlegel diagram of a regular dodecahedron. In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely graph-theoretic terms, the polyhedral graphs are the 3-vertex-connected, planar graphs.