Efficient folding algorithms for convex polyhedra

DOI10.1007/s00454-022-00415-7WikidataQ114229294 ScholiaQ114229294MaRDI QIDQ6142354

Akira Kadoguchi, Ryuhei Uehara, Takashi Horiyama, Tonan Kamata

Publication date: 21 December 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

stampingpseudo-polynomial time algorithmcomputational origamifolding problemregular polyhedron (platonic solids)

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Discrete geometry (52C99) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Common developments of three incongruent boxes of area 30
• Will It Tile? Try the Conway Criterion!
• Efficient Algorithm for Box Folding
• Tile-Makers and Semi-Tile-Makers

This page was built for publication: Efficient folding algorithms for convex polyhedra