Concept

Grand dirhombidodécaèdre disadouci

In geometry, the great disnub dirhombidodecahedron, also called Skilling's figure, is a degenerate uniform star polyhedron. It was proven in 1970 that there are only 75 uniform polyhedra other than the infinite families of prisms and antiprisms. John Skilling discovered another degenerate example, the great disnub dirhombidodecahedron, by relaxing the condition that edges must be single. More precisely, he allowed any even number of faces to meet at each edge, as long as the set of faces couldn't be separated into two connected sets (Skilling, 1975). Due to its geometric realization having some double edges where 4 faces meet, it is considered a degenerate uniform polyhedron but not strictly a uniform polyhedron. The number of edges is ambiguous, because the underlying abstract polyhedron has 360 edges, but 120 pairs of these have the same image in the geometric realization, so that the geometric realization has 120 single edges and 120 double edges where 4 faces meet, for a total of 240 edges. The Euler characteristic of the abstract polyhedron is −96. If the pairs of coinciding edges in the geometric realization are considered to be single edges, then it has only 240 edges and Euler characteristic 24. The vertex figure has 4 square faces passing through the center of the model. It may be constructed as the exclusive or (blend) of the great dirhombicosidodecahedron and compound of twenty octahedra. It shares the same edge arrangement as the great dirhombicosidodecahedron, but has a different set of triangular faces. The vertices and edges are also shared with the uniform compounds of twenty octahedra or twenty tetrahemihexahedra. 180 of the edges are shared with the great snub dodecicosidodecahedron. The dual of the great disnub dirhombidodecahedron is called the great disnub dirhombidodecacron. It is a nonconvex infinite isohedral polyhedron. Like the visually identical great dirhombicosidodecacron in Magnus Wenninger's Dual Models, it is represented with intersecting infinite prisms passing through the model center, cut off at a certain point that is convenient for the maker.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.