In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.
In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded 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.
In geometry, a straight skeleton is a method of representing a polygon by a topological skeleton. It is similar in some ways to the medial axis but differs in that the skeleton is composed of straight line segments, while the medial axis of a polygon may involve parabolic curves. However, both are homotopy-equivalent to the underlying polygon.
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. For instance, if six squares are connected in the pattern of a cube, then they must form a cube: there is no convex polyhedron with six square faces connected in the same way that does not have the same shape.
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.
In differential geometry, the cut locus of a point p on a manifold is the closure of the set of all other points on the manifold that are connected to p by two or more distinct shortest geodesics. More generally, the cut locus of a closed set X on the manifold is the closure of the set of all other points on the manifold connected to X by two or more distinct shortest geodesics.
In graph theory, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle. The tree must have at least four vertices, none of which has exactly two neighbors; it should be drawn in the plane so none of its edges cross, and the cycle connects the leaves in their clockwise ordering in this embedding. Thus, the cycle forms the outer face of the Halin graph, with the tree inside it.
In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs.
Rigid origami is a branch of origami which is concerned with folding structures using flat rigid sheets joined by hinges. That is, unlike in traditional origami, the panels of the paper cannot be bent during the folding process; they must remain flat at all times, and the paper only folded along its hinges. A rigid origami model would still be foldable if it was made from glass sheets with hinges in place of its crease lines.
In geometry, a Schönhardt polyhedron is a polyhedron with the same combinatorial structure as a regular octahedron, but with dihedral angles that are non-convex along three disjoint edges. Because it has no interior diagonals, it cannot be triangulated into tetrahedra without adding new vertices. It has the fewest vertices of any polyhedron that cannot be triangulated. It is named after the German mathematician Erich Schönhardt, who described it in 1928, although the artist Karlis Johansons had exhibited a related structure in 1921.
Jessen's icosahedron, sometimes called Jessen's orthogonal icosahedron, is a non-convex polyhedron with the same numbers of vertices, edges, and faces as the regular icosahedron. It is named for Børge Jessen, who studied it in 1967. In 1971, a family of nonconvex polyhedra including this shape was independently discovered and studied by Adrien Douady under the name six-beakedshaddock; later authors have applied variants of this name more specifically to Jessen's icosahedron.
In geometry, a monostatic polytope is a d-polytope which "can stand on only one face". They were described in 1969 by J. H. Conway, M. Goldberg, R. K. Guy and K. C. Knowlton. The monostatic polytope in 3-space constructed independently by Guy and Knowlton has 19 faces. In 2012, Andras Bezdek discovered an 18-face solution, and in 2014, Alex Reshetov published a 14-face object.
The Alexandrov uniqueness theorem is a rigidity theorem in mathematics, describing three-dimensional convex polyhedra in terms of the distances between points on their surfaces. It implies that convex polyhedra with distinct shapes from each other also have distinct metric spaces of surface distances, and it characterizes the metric spaces that come from the surface distances on polyhedra. It is named after Soviet mathematician Aleksandr Danilovich Aleksandrov, who published it in the 1940s.
In geometry, more specifically in polytope theory, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989. It states that every d-dimensional centrally symmetric polytope has at least 3d nonempty faces.
In differential geometry the theorem of the three geodesics, also known as Lyusternik–Schnirelmann theorem, states that every Riemannian manifold with the topology of a sphere has at least three simple closed geodesics. The result can also be extended to quasigeodesics on a convex polyhedron, and to closed geodesics of reversible Finsler 2-spheres. The theorem is sharp: although every Riemannian 2-sphere contains infinitely many distinct closed geodesics, only three of them are guaranteed to have no self-intersections. For example, by a result of Morse if the lengths of three principal axes of an ellipsoid are distinct, but sufficiently close to each other, then the ellipsoid has only three simple closed geodesics.
In geometric graph theory, and the theory of structural rigidity, a parallel redrawing of a graph drawing with straight edges in the Euclidean plane or higher-dimensional Euclidean space is another drawing of the same graph such that all edges of the second drawing are parallel to their corresponding edges in the first drawing. A parallel morph of a graph is a continuous family of drawings, all parallel redrawings of each other.
Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN 978-0-521-85757-4). A Japanese-language translation by Ryuhei Uehara was published in 2009 by the Modern Science Company (ISBN 978-4-7649-0377-7).
In computational geometry, the star unfolding of a convex polyhedron is a net obtained by cutting the polyhedron along geodesics through its faces. It has also been called the inward layout of the polyhedron, or the Alexandrov unfolding after Aleksandr Danilovich Aleksandrov, who first considered it.
In computational geometry, the source unfolding of a convex polyhedron is a net obtained by cutting the polyhedron along the cut locus of a point on the surface of the polyhedron. The cut locus of a point consists of all points on the surface that have two or more shortest geodesics to . For every convex polyhedron, and every choice of the point on its surface, cutting the polyhedron on the cut locus will produce a result that can be unfolded into a flat plane, producing the source unfolding. The resulting net may, however, cut across some of the faces of the polyhedron rather than only cutting along its edges.
In geometry, a common net is a net that can be folded onto several polyhedra. To be a valid common net, there shouldn't exist any non-overlapping sides and the resulting polyhedra must be connected through faces. The research of examples of this particular nets dates back to the end of the 20th century, despite that, not many examples have been found. Two classes, however, have been deeply explored, regular polyhedra and cuboids. The search of common nets is usually made by either extensive search or the overlapping of nets that tile the plane.
