Goldberg polyhedra

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 (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: GPIII(n,m), GPIV(n,m), and GPV(n,m). (Wikipedia).

Goldberg polyhedron
Video thumbnail

What is the difference between convex and concave

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What are four types of polygons

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Robert Fathauer - Walkable Knots & Links - G4G14 Apr 2022

Human-scale walkable structures have been designed, based on fractal curves, spirals, and knots. Traversing such structures in oneโ€™s imagination is entertaining and can provide a deeper understanding of mathematical objects. If some of these structures were built, for example in a public p

From playlist G4G14 Videos

Video thumbnail

What is the difference between convex and concave polygons

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What are the names of different types of polygons based on the number of sides

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is the definition of a regular polygon and how do you find the interior angles

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Ayliean MacDonald - The Pentagon: A Userโ€™s Guide - CoM Oct 2021

Regular pentagons throw a spanner in the works when it comes to tessellation but donโ€™t let that one case tarnish the good name of the pentagon! Come along as we explore the 15 irregular pentagons which do tile the plane, journey through five fold symmetry, make a quick pit stop to look at

From playlist Celebration of Mind 2021

Video thumbnail

What is the difference between a regular and irregular polygon

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Live CEOing Ep 186: Polyhedra in Wolfram Language

Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Polyhedra in the Wolfram Language.

From playlist Behind the Scenes in Real-Life Software Design

Video thumbnail

Hermitian and Non-Hermitian Laplacians and Wave Equaions by Andrey shafarevich

Non-Hermitian Physics - PHHQP XVIII DATE: 04 June 2018 to 13 June 2018 VENUE:Ramanujan Lecture Hall, ICTS Bangalore Non-Hermitian Physics-"Pseudo-Hermitian Hamiltonians in Quantum Physics (PHHQP) XVIII" is the 18th meeting in the series that is being held over the years in Quantum Phys

From playlist Non-Hermitian Physics - PHHQP XVIII

Video thumbnail

Ben Smith: Face structures of tropical polyhedra

Many combinatorial algorithms arise from the interplay between faces of ordinary polyhedra, therefore tropicalizing these algorithms should rely on the face structure of tropical polyhedra. While they have many nice combinatorial properties, the classical definition of a face is flawed whe

From playlist Workshop: Tropical geometry and the geometry of linear programming

Video thumbnail

Introduction Polyhedra Using Euler's Formula

This video introduces polyhedra and how every convex polyhedron can be represented as a planar graph. mathispower4u.com

From playlist Graph Theory (Discrete Math)

Video thumbnail

Interactivity: Building and App in 60 Seconds

With the Wolfram Language and Mathematica, you really can build a useful, interactive app for exploring ideas in just 60 seconds. Starting with the 60-second app, this talk covers the ins and outs of the Wolfram Language function Manipulate, the key to instantly interactive interfaces. You

From playlist Geek Out with Wolfram Virtual Workshop 2014

Video thumbnail

What are convex polygons

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Live CEOing Ep 173: Geometry in Wolfram Language

Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Geometry in the Wolfram Language.

From playlist Behind the Scenes in Real-Life Software Design

Video thumbnail

Lecture 15: General & Edge Unfolding

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with describing polyhedron unfolding for convex and nonconvex polygons. Algorithms for shortest path solutions

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Video thumbnail

Sketch a net from a 3D figure

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Sketch a figure from a net

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

What is a polygon and what is a non example of a one

๐Ÿ‘‰ Learn about polygons and how to classify them. A polygon is a plane shape bounded by a finite chain of straight lines. A polygon can be concave or convex and it can also be regular or irregular. A concave polygon is a polygon in which at least one of its interior angles is greater than 1

From playlist Classify Polygons

Video thumbnail

Lecture 6 | Convex Optimization II (Stanford)

Lecture by Professor Stephen Boyd for Convex Optimization II (EE 364B) in the Stanford Electrical Engineering department. Professor Boyd lectures on the localization and cutting-plane methods and then moves into the Analytic center cutting-plane methods. This course introduces topics su

From playlist Lecture Collection | Convex Optimization

Related pages

Hexagon | Icosahedral symmetry | Chamfer (geometry) | Goldbergโ€“Coxeter construction | List of geodesic polyhedra and Goldberg polyhedra | Face (geometry) | Tetrahedral symmetry | Pentagon | Chess | Truncated octahedron | Vertex (geometry) | Dodecahedron | Euler characteristic | Polyhedral combinatorics | Tetrahedron | Chamfered dodecahedron | Truncated tetrahedron | Mathematics | Octahedral symmetry | Truncated icosahedron | Cube | Polyhedral group | Reflection symmetry | Regular dodecahedron | Edge (geometry) | Conway polyhedron notation | Regular polygon | Dual polyhedron