Common developments of three incongruent boxes of area 30

DOI10.1016/J.COMGEO.2017.03.001MaRDI QIDQ2398819zbMATH OpenOpenAlexFDO

Authors Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara

Publication date 21 August 2017

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2017.03.001

zbMATH Keywords

common developementcomputational geometryconvex polyhedronzero-suppressed binary decision diagrams

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

The paper is dedicated to the study of a developement/ folding type problem. This is a very important topic in computational geometry. One problem of this kind is the following one: Given a polygon \(P\) and a polyhedra \(Q\), determine whether \(P\) can fold into \(Q\) or not. The authors answer this question. Also, they give an important theorem, where they prove that there are 1080 polyominoes of area 30, that admit to fold. Among the above 1080, the authors prove that nine polyominoes can fold into the box of size \(\sqrt{5}\times \sqrt{5}\times \sqrt{5}\) if admit to fold along diagonal lines. Finally, the authors prove that among these nine polyominoes, one can fold into the third box in two different ways. The authors give also a graphical representation to this theorem and some important algorithms for the paper's topic are presented.

Recommendations

• Common developments of three incongruent boxes of area 30
• Common developments of three incongruent orthogonal boxes
• Folding Polyominoes into (Poly)Cubes
• The foldings of a square to convex polyhedra
• Folding polyominoes with holes into a cube

Cites work

• A Pseudopolynomial Algorithm for Alexandrov’s Theorem
• Bumpy pyramid folding
• Common developments of three incongruent orthogonal boxes
• Common unfolding of regular tetrahedron and Johnson-Zalgaller solid
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
• Geometric folding algorithms. Linkages, origami, polyhedra
• How to fold it. The mathematics of linkages, origami and polyhedra
• Tile-Makers and Semi-Tile-Makers
• Tiling with polyominoes

Cited in

(9)

• Folding polyiamonds into octahedra
• Common developments of three incongruent boxes of area 30
• Common developments of three incongruent orthogonal boxes
• A survey and recent results about commmon developments of two or more boxes
• Efficient Algorithm for Box Folding
• Any Platonic solid can transform to another by O(1) refoldings
• Efficient folding algorithms for convex polyhedra
• Unfolding boxes with local constraints
• Folding polyominoes with holes into a cube

This page was built for publication: Common developments of three incongruent boxes of area 30

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398819)