**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Polyhedron

Summary

In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.
A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convex hull of its vertices, and for every finite set of points, not all on the same plane, the convex hull is a convex polyhedron. Cubes and pyramids are examples of convex polyhedra.
A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions.
Convex polyhedra are well-defined, with several equivalent standard definitions. However, the formal mathematical definition of polyhedra that are not required to be convex has been problematic.
Many definitions of "polyhedron" have been given within particular contexts, some more rigorous than others, and there is not universal agreement over which of these to choose.
Some of these definitions exclude shapes that have often been counted as polyhedra (such as the self-crossing polyhedra) or include
shapes that are often not considered as valid polyhedra (such as solids whose boundaries are not manifolds). As Branko Grünbaum observed,
"The Original Sin in the theory of polyhedra goes back to Euclid, and through Kepler, Poinsot, Cauchy and many others ... at each stage ... the writers failed to define what are the polyhedra".
Nevertheless, there is general agreement that a polyhedron is a solid or surface that can be described by its vertices (corner points), edges (line segments connecting certain pairs of vertices),
faces (two-dimensional polygons), and that it sometimes can be said to have a particular three-dimensional interior volume.
One can distinguish among these different definitions according to whether they describe the polyhedron as a solid, whether they describe it as a surface, or whether they describe it more abstractly based on its incidence geometry.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related MOOCs

Loading

Related publications (10)

Related people (3)

Related units

Related courses (20)

Related lectures (187)

Related MOOCs

Related concepts (243)

No results

No results

Loading

Loading

Loading

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

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective.

AR-211: Stereotomy

Dans l'histoire de l'architecture, la stéréotomie est l'art de concevoir et de fabriquer des volumes complexes en 3 dimensions dans les voutes en pierre et les assemblages de charpente en bois. Ce cou

Linear Constraints and Vertices

Explores the significance of vertices in optimization and outlines a method to identify them using linear algebra.

Division in Extreme and Mean Reason: Luca Pacioli's Influence

Delves into the concept of Division in Extreme and Mean Reason (DEMR) and its historical significance in geometry.

Linear Constraints: Basic Solutions

Explores basic solutions in linear constraints and the equivalence with vertices.

Cuboctahedron

A cuboctahedron is a polyhedron with 8 triangular faces and 6 square faces. A cuboctahedron has 12 identical vertices, with 2 triangles and 2 squares meeting at each, and 24 identical edges, each separating a triangle from a square. As such, it is a quasiregular polyhedron, i.e. an Archimedean solid that is not only vertex-transitive but also edge-transitive. It is radially equilateral. Its dual polyhedron is the rhombic dodecahedron.

Bipyramid

A (symmetric) n-gonal bipyramid or dipyramid is a polyhedron formed by joining an n-gonal pyramid and its base-to-base. An n-gonal bipyramid has 2n triangle faces, 3n edges, and 2 + n vertices. The "n-gonal" in the name of a bipyramid does not refer to a face but to the internal polygon base, lying in the mirror plane that connects the two pyramid halves. (If it were a face, then each of its edges would connect three faces instead of two.) A "regular" bipyramid has a regular polygon base.

Platonic solid

In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent (identical in shape and size) regular polygons (all angles congruent and all edges congruent), and the same number of faces meet at each vertex. There are only five such polyhedra: Geometers have studied the Platonic solids for thousands of years. They are named for the ancient Greek philosopher Plato who hypothesized in one of his dialogues, the Timaeus, that the classical elements were made of these regular solids.

Given an integral polyhedron P subset of R-n and a rational polyhedron Q subset of R-n containing the same integer points as P, we investigate how many iterations of the Chvatal-Gomory closure operato

Friedrich Eisenbrand, Thomas Rothvoss, Nicolai Hähnle

We investigate the diameter of a natural abstraction of the 1-skeleton of polyhedra. Even if this abstraction is more general than other abstractions previously studied in the literature, known upper

2010The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is de