Duality theories | Polytopes | Self-dual polyhedra | Polyhedra

Dual polyhedron

In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron. Duality preserves the symmetries of a polyhedron. Therefore, for many classes of polyhedra defined by their symmetries, the duals belong to a corresponding symmetry class. For example, the regular polyhedra – the (convex) Platonic solids and (star) Kepler–Poinsot polyhedra – form dual pairs, where the regular tetrahedron is . The dual of an isogonal polyhedron (one in which any two vertices are equivalent under symmetries of the polyhedron) is an isohedral polyhedron (one in which any two faces are equivalent [...]), and vice versa. The dual of an isotoxal polyhedron (one in which any two edges are equivalent [...]) is also isotoxal. Duality is closely related to polar reciprocity, a geometric transformation that, when applied to a convex polyhedron, realizes the dual polyhedron as another convex polyhedron. (Wikipedia).

Dual polyhedron
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 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

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

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

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

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

Video thumbnail

Gerard Cornuejols: Dyadic linear programming

A finite vector is dyadic if each of its entries is a dyadic rational number, i.e. if it has an exact floating point representation. We study the problem of finding a dyadic optimal solution to a linear program, if one exists. This is joint work with Ahmad Abdi, Bertrand Guenin and Levent

From playlist Workshop: Continuous approaches to discrete optimization

Video thumbnail

Thin Groups and Applications - Alex Kontorovich

Analysis and Beyond - Celebrating Jean Bourgain's Work and Impact May 21, 2016 More videos on http://video.ias.edu

From playlist Analysis and Beyond

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

Lecture 12 | Convex Optimization I (Stanford)

Professor Stephen Boyd, of the Stanford University Electrical Engineering department, lectures on geometric problems in the context of electrical engineering and convex optimization for the course, Convex Optimization I (EE 364A). Convex Optimization I concentrates on recognizing and so

From playlist Lecture Collection | Convex Optimization

Video thumbnail

Classifying a polygon in two different ways ex 4

👉 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 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 the difference between a regular and irregular 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

Nonlinear algebra, Lecture 11: "Semidefinite Programming", by Bernd Sturmfels

This is the eleventh lecture in the IMPRS Ringvorlesung, the advanced graduate course at the Max Planck Institute for Mathematics in the Sciences.

From playlist IMPRS Ringvorlesung - Introduction to Nonlinear Algebra

Video thumbnail

Combinatorics and Geometry to Arithmetic of Circle Packings - Nakamura

Speaker: Kei Nakamura (Rutgers) Title: Combinatorics and Geometry to Arithmetic of Circle Packings Abstract: The Koebe-Andreev-Thurston/Schramm theorem assigns a conformally rigid fi-nite circle packing to a convex polyhedron, and then successive inversions yield a conformally rigid infin

From playlist Mathematics

Video thumbnail

Geometry and arithmetic of sphere packings - Alex Kontorovich

Members' Seminar Topic: Geometry and arithmetic of sphere packings Speaker: A nearly optimal lower bound on the approximate degree of AC00 Speaker:Alex Kontorovich Affiliation: Rutgers University Date: October 23, 2017 For more videos, please visit http://video.ias.edu

From playlist Mathematics

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

Lecture 16: Vertex & Orthogonal 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 continues with open problems involving general unfoldings of polyhedra and proof of vertex unfolding using constructi

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Video thumbnail

What is the difference between concave and 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

Related pages

Polytope | Dual graph | Duality (projective geometry) | Elongated triangular pyramid | Grand stellated 120-cell | Order-5 dodecahedral honeycomb | Dual uniform polyhedron | Partially ordered set | Symmetry | Face (geometry) | Platonic solid | Harmonices Mundi | Discrete Mathematics (journal) | Vertex figure | Square pyramid | Dot product | Isohedral figure | 24-cell | Schlegel diagram | 4-polytope | Schläfli symbol | Vertex (geometry) | Elongated pyramid | Dodecahedron | Isogonal figure | Uniform polytope | Pyramid (geometry) | Tetrahedron | Simplex | Honeycomb (geometry) | Abstract polytope | Dual polygon | Hasse diagram | Order-4 square tiling honeycomb | 5-polytope | Graph theory | N-skeleton | Regular polytope | Triangular tiling honeycomb | Icosahedral honeycomb | Infinite-order apeirogonal tiling | Isotoxal figure | Prism (geometry) | Regular icosahedron | Order-5 pentagonal tiling | Polyhedron | Order-5 120-cell honeycomb | Order-6 hexagonal tiling | Euclidean space | Hexagonal pyramid | Hypercubic honeycomb | Square tiling | 120-cell | Elongated pentagonal pyramid | Uniform polyhedron | 600-cell | Conway polyhedron notation | Pentagonal pyramid | Projective geometry | Geometry | Regular polygon | Apeirogon | Elongated square pyramid | Order-6 hexagonal tiling honeycomb | Cubic honeycomb | Midsphere | Great 120-cell