In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded (along edges) to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.
An early instance of polyhedral nets appears in the works of Albrecht Dürer, whose 1525 book A Course in the Art of Measurement with Compass and Ruler (Unterweysung der Messung mit dem Zyrkel und Rychtscheyd ) included nets for the Platonic solids and several of the Archimedean solids. These constructions were first called nets in 1543 by Augustin Hirschvogel.
Many different nets can exist for a given polyhedron, depending on the choices of which edges are joined and which are separated. The edges that are cut from a convex polyhedron to form a net must form a spanning tree of the polyhedron, but cutting some spanning trees may cause the polyhedron to self-overlap when unfolded, rather than forming a net. Conversely, a given net may fold into more than one different convex polyhedron, depending on the angles at which its edges are folded and the choice of which edges to glue together. If a net is given together with a pattern for gluing its edges together, such that each vertex of the resulting shape has positive angular defect and such that the sum of these defects is exactly 4pi, then there necessarily exists exactly one polyhedron that can be folded from it; this is Alexandrov's uniqueness theorem. However, the polyhedron formed in this way may have different faces than the ones specified as part of the net: some of the net polygons may have folds across them, and some of the edges between net polygons may remain unfolded. Additionally, the same net may have multiple valid gluing patterns, leading to different folded polyhedra.
In 1975, G. C. Shephard asked whether every convex polyhedron has at least one net, or simple edge-unfolding.
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 toroidal polyhedron is a polyhedron which is also a toroid (a g-holed torus), having a topological genus (g) of 1 or greater. Notable examples include the Császár and Szilassi polyhedra. Toroidal polyhedra are defined as collections of polygons that meet at their edges and vertices, forming a manifold as they do. That is, each edge should be shared by exactly two polygons, and at each vertex the edges and faces that meet at the vertex should be linked together in a single cycle of alternating edges and faces, the link of the vertex.
In geometry, the (angular) defect (or deficit or deficiency) means the failure of some angles to add up to the expected amount of 360° or 180°, when such angles in the Euclidean plane would. The opposite notion is the excess. Classically the defect arises in two ways: the defect of a vertex of a polyhedron; the defect of a hyperbolic triangle; and the excess also arises in two ways: the excess of a toroidal polyhedron.
In geometry, an icosahedron (ˌaɪkɒsəˈhiːdrən,-kə-,-koʊ- or aɪˌkɒsəˈhiːdrən) is a polyhedron with 20 faces. The name comes . The plural can be either "icosahedra" (-drə) or "icosahedrons". There are infinitely many non-similar shapes of icosahedra, some of them being more symmetrical than others. The best known is the (convex, non-stellated) regular icosahedron—one of the Platonic solids—whose faces are 20 equilateral triangles. There are two objects, one convex and one nonconvex, that can both be called regular icosahedra.
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 ...
2020
Superionic phases of bulk anhydrous salts based on large cluster-like polyhedral (carba)borate anions are generally stable only well above room temperature, rendering them unsuitable as solid-state electrolytes in energy-storage devices that typically oper ...
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 ...