English
Related papers

Related papers: Flat Zipper-Unfolding Pairs for Platonic Solids

200 papers

It is well-known that a Riemann surface can be decomposed into the so-called pairs-of-pants. Each pair-of-pants is diffeomorphic to a Riemann sphere minus 3 points. We show that a smooth complex projective hypersurface of arbitrary…

Geometric Topology · Mathematics 2007-05-23 Grigory Mikhalkin

This note proves that every polar zonohedron has an edge-unfolding to a non-overlapping net.

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

An unzipping of a polyhedron P is a cut-path through its vertices that unfolds P to a non-overlapping shape in the plane. It is an open problem to decide if every convex P has an unzipping. Here we show that there are nearly flat convex…

Computational Geometry · Computer Science 2018-02-07 Joseph O'Rourke

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

Combinatorics · Mathematics 2012-10-09 Anthony M. Cutler , Egon Schulte , Jorg M. Wills

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

Regular polytopes, the generalization of the five Platonic solids in 3 space dimensions, exist in arbitrary dimension $n\geq-1$; now in {\rm dim}. 2, 3 and 4 there are \emph{extra} polytopes, while in general dimensions only the…

Mathematical Physics · Physics 2015-06-11 Luis J. Boya , Cristian Rivera

We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…

Geometric Topology · Mathematics 2010-06-10 Felix Effenberger , Wolfgang Kühnel

We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid -- the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of…

Computational Geometry · Computer Science 2022-07-29 Eva Stehr , Linda Kleist

We study the continuous motion of smooth isometric embeddings of a planar surface in three-dimensional Euclidean space, and two related discrete analogues of these embeddings, polygonal embeddings and flat foldings without interior…

Computational Geometry · Computer Science 2023-09-29 David Eppstein

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…

Geometric Topology · Mathematics 2018-02-06 Eugenio Borghini

A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…

Metric Geometry · Mathematics 2023-01-30 Jakob Steininger , Sergey Yurkevich

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke

The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R^3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron…

Computational Geometry · Computer Science 2021-01-07 Joseph O'Rourke

The problem of classifying, upto isometry (or similarity), the orientable spherical, Euclidean and hyperbolic 3-manifolds that arise by identifying the faces of a Platonic solid is formulated in the language of Coxeter groups. In the…

Geometric Topology · Mathematics 2007-06-13 Brent Everitt

We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from…

Computational Geometry · Computer Science 2008-12-15 Jin-ichi Itoh , Joseph O'Rourke , Costin Vîlcu

Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which…

Computational Geometry · Computer Science 2019-08-21 Joseph O'Rourke

This paper proves the following results: Besides parallelograms and centrally symmetric hexagons, there is no other convex domain which can form a two-, three- or four-fold lattice tiling in the Euclidean plane. If a centrally symmetric…

Metric Geometry · Mathematics 2019-11-13 Qi Yang , Chuanming Zong

We show how to edge-unfold a new class of convex polyhedra, specifically a new class of prismatoids (the convex hull of two parallel convex polygons, called the top and base), by constructing a nonoverlapping "petal unfolding" in two new…

Computational Geometry · Computer Science 2021-06-29 Vincent Bian , Erik Demaine , Rachana Madhukara

A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…

General Mathematics · Mathematics 2019-08-08 Alexander S. Prokhoda

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland