English
Related papers

Related papers: Flat Zipper-Unfolding Pairs for Platonic Solids

200 papers

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

We show that several classes of polyhedra are joined by a sequence of O(1) refolding steps, where each refolding step unfolds the current polyhedron (allowing cuts anywhere on the surface and allowing overlap) and folds that unfolding into…

Computational Geometry · Computer Science 2023-10-27 Erik D. Demaine , Martin L. Demaine , Jenny Diomidova , Tonan Kamata , Ryuhei Uehara , Hanyu Alice Zhang

It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.

Computational Geometry · Computer Science 2011-06-09 Joseph O'Rourke

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

In this paper we try to find examples of integrable natural Hamiltonian systems on the sphere $S^2$ with the symmetries of each Platonic polyhedra. Although some of these systems are known, their expression is extremely complicated; we try…

Mathematical Physics · Physics 2014-01-28 Giovanni Rastelli

Extending previous results on a characterization of all equilateral triangle in space having vertices with integer coordinates ("in $\mathbb Z^3$"), we look at the problem of characterizing all regular polyhedra (Platonic Solids) with the…

Number Theory · Mathematics 2009-10-12 Eugen J. Ionascu , Andrei Markov

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

Combinatorics · Mathematics 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

We consider a new treatment for making polyhedron nets referred to as ``apple peel unfolding'': drawing the nets as if we were peeling off appleskins. We define apple peel unfolding strictly and implement a program that derives the…

Computational Geometry · Computer Science 2026-04-20 Takashi Yoshino , Supanut Chaidee

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Computational Geometry · Computer Science 2021-06-01 Tonan Kamata , Akira Kadoguchi , Takashi Horiyama , Ryuhei Uehara

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

Metric Geometry · Mathematics 2017-12-05 A. J. Kanel-Belov , A. V. Dyskin , Y. Estrin , E. Pasternak , I. A. Ivanov-Pogodaev

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

Computational Geometry · Computer Science 2011-12-21 Mirela Damian , Erik Demaine , Robin Flatland

This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic…

Metric Geometry · Mathematics 2016-11-26 Marzena Szajewska

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We study the translation surfaces obtained by considering the unfoldings of the surfaces of Platonic solids. We show that they are all lattice surfaces and we compute the topology of the associated Teichm\"uller curves. Using an algorithm…

Geometric Topology · Mathematics 2019-12-24 Jayadev S. Athreya , David Aulicino , W. Patrick Hooper

We borrow a classical construction from the study of rational billiards in dynamical systems known as the "unfolding construction" and show that it can be used to study the automorphism group of a Platonic surface. More precisely, the…

Geometric Topology · Mathematics 2020-05-13 David Aulicino

We prove that, for any two polyhedral manifolds $\mathcal P, \mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P, \mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

Computational Geometry · Computer Science 2025-10-08 Lily Chung , Erik D. Demaine , Jenny Diomidova , Tonan Kamata , Jayson Lynch , Ryuhei Uehara , Hanyu Alice Zhang

We prove that, for any two polyhedral manifolds $\mathcal P,\mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P,\mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

Computational Geometry · Computer Science 2025-11-18 Lily Chung , Erik D. Demaine , Jenny Diomidova , Tonan Kamata , Jayson Lynch , Ryuhei Uehara , Hanyu Alice Zhang

We address the unsolved problem of unfolding prismatoids in a new context, viewing a "topless prismatoid" as a convex patch---a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural…

Computational Geometry · Computer Science 2012-05-10 Joseph O'Rourke
‹ Prev 1 2 3 10 Next ›