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

computational geometryconvex polyhedroncommon developementzero-suppressed binary decision diagrams

Mathematics Subject Classification ID

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

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

(8)

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

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)