Goldberg polyhedron

In mathematics, and more specifically in polyhedral combinatorics, a Goldberg polyhedron is a convex polyhedron made from hexagons and pentagons. They were first described in 1937 by Michael Goldberg (1902–1990). They are defined by three properties: each face is either a pentagon or hexagon, exactly three faces meet at each vertex, and they have rotational icosahedral symmetry. They are not necessarily mirror-symmetric; e.g. GP(5,3) and GP(3,5) are enantiomorphs of each other. A Goldberg polyhedron is a dual polyhedron of a geodesic sphere. A consequence of Euler's polyhedron formula is that a Goldberg polyhedron always has exactly twelve pentagonal faces. Icosahedral symmetry ensures that the pentagons are always regular and that there are always 12 of them. If the vertices are not constrained to a sphere, the polyhedron can be constructed with planar equilateral (but not in general equiangular) faces. Simple examples of Goldberg polyhedra include the dodecahedron and truncated icosahedron. Other forms can be described by taking a chess knight move from one pentagon to the next: first take m steps in one direction, then turn 60° to the left and take n steps. Such a polyhedron is denoted GP(m,n). A dodecahedron is GP(1,0) and a truncated icosahedron is GP(1,1). A similar technique can be applied to construct polyhedra with tetrahedral symmetry and octahedral symmetry. These polyhedra will have triangles or squares rather than pentagons. These variations are given Roman numeral subscripts denoting the number of sides on the non-hexagon faces: GP_III(n,m), GP_IV(n,m), and GP_V(n,m). The number of vertices, edges, and faces of GP(m,n) can be computed from m and n, with T = m2 + mn + n2 = (m + n)2 − mn, depending on one of three symmetry systems: The number of non-hexagonal faces can be determined using the Euler characteristic, as demonstrated here. Most Goldberg polyhedra can be constructed using Conway polyhedron notation starting with (T)etrahedron, (C)ube, and (D)odecahedron seeds.

À 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.

Concepts associés (16)

Cours associés (2)

Séances de cours associées (19)

MATH-124: Geometry for architects I

Ce cours entend exposer les fondements de la géométrie à un triple titre : 1/ de technique mathématique essentielle au processus de conception du projet, 2/ d'objet privilégié des logiciels de concept

MATH-261: Discrete optimization

This course is an introduction to linear and discrete optimization. Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to p

In geometry, chamfering or edge-truncation is a topological operator that modifies one polyhedron into another. It is similar to expansion, moving faces apart and outward, but also maintains the original vertices. For polyhedra, this operation adds a new hexagonal face in place of each original edge. In Conway polyhedron notation it is represented by the letter c. A polyhedron with e edges will have a chamfered form containing 2e new vertices, 3e new edges, and e new hexagonal faces.

A geodesic polyhedron is a convex polyhedron made from triangles. They usually have icosahedral symmetry, such that they have 6 triangles at a vertex, except 12 vertices which have 5 triangles. They are the dual of corresponding Goldberg polyhedra with mostly hexagonal faces. Geodesic polyhedra are a good approximation to a sphere for many purposes, and appear in many different contexts. The most well-known may be the geodesic domes, hemispherical architectural structures designed by Buckminster Fuller, which geodesic polyhedra are named after.

Le triacontaèdre rhombique tronqué est un polyèdre convexe obtenu par troncature des 12 sommets du triacontaèdre rhombique où 5 faces se rejoignaient. Les 30 faces rhombiques (losanges) deviennent des hexagones non réguliers, et les 12 sommets tronqués deviennent des pentagones réguliers. Les faces hexagonales peuvent être équilatérales, mais non régulières par une symétrie D2. Pour chaque face hexagonale, les angles aux deux sommets de configuration 6.6.6 valent , et aux quatre sommets restants de configuration 5.

Contraintes linéaires, Dégénérescence MOOC: Optimization: principles and algorithms - Linear optimization

Couvre les contraintes linéaires et la dégénérescence dans les polyèdres, en se concentrant sur les solutions de base et les cas dégénérés.

Contraintes linéaires : Solutions de base MOOC: Optimization: principles and algorithms - Linear optimization

Explore les solutions de base dans les contraintes linéaires et l'équivalence avec les sommets.

Le problème du transbordement : l’unimodularité totale MOOC: Optimization: principles and algorithms - Linear optimization

Couvre le problème de transbordement, les solutions optimales et l'unimodularité totale dans les matrices.