In geometry, a flexible polyhedron is a polyhedral surface without any boundary edges, whose shape can be continuously changed while keeping the shapes of all of its faces unchanged. The Cauchy rigidity theorem shows that in dimension 3 such a polyhedron cannot be convex (this is also true in higher dimensions).
The first examples of flexible polyhedra, now called Bricard octahedra, were discovered by . They are self-intersecting surfaces isometric to an octahedron. The first example of a flexible non-self-intersecting surface in , the Connelly sphere, was discovered by . Steffen's polyhedron is another non-self-intersecting flexible polyhedron derived from Bricard's octahedra.
In the late 1970s Connelly and D. Sullivan formulated the bellows conjecture stating that the volume of a flexible polyhedron is invariant under flexing. This conjecture was proved for polyhedra homeomorphic to a sphere by
using elimination theory, and then proved for general orientable 2-dimensional polyhedral surfaces by . The proof extends Piero della Francesca's formula for the volume of a tetrahedron to a formula for the volume of any polyhedron. The extended formula shows that the volume must be a root of a polynomial whose coefficients depend only on the lengths of the polyhedron's edges. Since the edge lengths cannot change as the polyhedron flexes, the volume must remain at one of the finitely many roots of the polynomial, rather than changing continuously.
Connelly conjectured that the Dehn invariant of a flexible polyhedron is invariant under flexing. This was known as the strong bellows conjecture or (after it was proven in 2018) the strong bellows theorem. Because all configurations of a flexible polyhedron have both the same volume and the same Dehn invariant, they are scissors congruent to each other, meaning that for any two of these configurations it is possible to dissect one of them into polyhedral pieces that can be reassembled to form the other.
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.
The course aims to introduce the basic concepts and results of modern Graph Theory with special emphasis on those topics and techniques that have proved to be applicable in theoretical computer scienc
The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer s
In geometry, a Bricard octahedron is a member of a family of flexible polyhedra constructed by Raoul Bricard in 1897. The overall shape of one of these polyhedron may change in a continuous motion, without any changes to the lengths of its edges nor to the shapes of its faces. These octahedra were the first flexible polyhedra to be discovered. The Bricard octahedra have six vertices, twelve edges, and eight triangular faces, connected in the same way as a regular octahedron.
Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy. It states that convex polytopes in three dimensions with congruent corresponding faces must be congruent to each other. That is, any polyhedral net formed by unfolding the faces of the polyhedron onto a flat surface, together with gluing instructions describing which faces should be connected to each other, uniquely determines the shape of the original polyhedron.
In geometry, an octahedron () is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. A regular octahedron is the dual polyhedron of a cube. It is a rectified tetrahedron. It is a square bipyramid in any of three orthogonal orientations. It is also a triangular antiprism in any of four orientations. An octahedron is the three-dimensional case of the more general concept of a cross polytope.
Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...
A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust met ...
For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...