English
Related papers

Related papers: On Folding a Polygon to a Polyhedron

200 papers

A result due to Burago and Zalgaller (1960, 1995) states that every orientable polyhedral surface, one that is obtained by gluing Euclidean polygons, has an isometric piecewise linear (PL) embedding into Euclidean space $\mathbb{E}^3$. A…

Computational Geometry · Computer Science 2024-09-02 Francis Lazarus , Florent Tallerie

We explore the practicability of Nash's Embedding Theorem in vision and imaging sciences. In particular, we investigate the relevance of a result of Burago and Zalgaller regarding the existence of isometric embeddings of polyhedral surfaces…

Computer Vision and Pattern Recognition · Computer Science 2010-05-12 Emil Saucan

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 analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs of Platonic solids and prove corresponding lower bounds,…

Computational Geometry · Computer Science 2024-12-20 Lily Chung , Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Jayson Lynch , Chie Nara

We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…

Computational Geometry · Computer Science 2023-05-03 Nattawut Phetmak , Jittat Fakcharoenphol

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

A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.

Combinatorics · Mathematics 2007-05-23 Baris Altunkaynak

Flat-foldability problem of origami is the problem to determine whether a given crease pattern drawn on a piece of paper is possible to fold without any penetration or intrusion of a polygon into any connections among them. It is known from…

Disordered Systems and Neural Networks · Physics 2025-06-17 Chihiro Nakajima

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…

Number Theory · Mathematics 2026-01-28 Elias Dubno

Details for known solutions of some geometric and algebraic problems with the help of origami are presented: two theorems of Haga, the general cubic equation, especially the heptagon equation, doubling the cube as well as the trisection of…

Metric Geometry · Mathematics 2014-09-18 Wolfdieter Lang

A mostly expository account of old questions about the relationship between polyhedra and topological manifolds. Topics are old topological results, new gauge theory results (with speculations about next directions), and history of the…

Geometric Topology · Mathematics 2013-11-13 Frank Quinn

We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…

Computational Geometry · Computer Science 2026-01-21 David Eppstein

The Miura vertex is a versatile origami pattern found in a variety of mechanisms. Previous papers have derived and validated a closed-form solution for the kinematics of a symmetric Miura vertex, but the motion of an asymmetric vertex has…

Applied Physics · Physics 2020-01-22 Soroush Kamrava , Chang Liu , Alec Q. Orlofsky , Ashkan Vaziri , Samuel M. Felton

Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…

Computational Geometry · Computer Science 2014-10-02 Erik D. Demaine , Martin L. Demaine

In this paper we review nine previous proposed and solved problems of elementary 2D geometry, and we extend them either from triangles to polygons or polyhedrons, or from circles to spheres (from 2D-space to 3D-space) and make some…

General Mathematics · Mathematics 2010-04-06 Florentin Smarandache

Haga's fold in paper folding is generalized. Recent generalization of Haga's theorems and problems in Wasan geometry involving Haga's fold are also generalized.

History and Overview · Mathematics 2017-12-27 Hiroshi Okumura

The purpose of this note is to scrutinize the proof of Burago and Zalgaller regarding the existence of $PL$ isometric embeddings of $PL$ compact surfaces into $\mathbb{R}^3$. We conclude that their proof does not admit a direct extension to…

Differential Geometry · Mathematics 2010-09-30 Emil Saucan

We generalize problems in Wasan geometry which involve no folded figures but are related to Haga's fold in origami. Using the tangent circles appeared in those problems we give a parametric representation of the generalized Haga's fold…

History and Overview · Mathematics 2018-02-12 Hiroshi Okumura

We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke
‹ Prev 1 2 3 10 Next ›