Folding polyiamonds into octahedra

Eva Stehr,Linda Kleist

Computational Geometry(2023)

引用 0|浏览4
暂无评分
摘要
We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.
更多
查看译文
关键词
Folding,Origami,Octahedron,Polyiamond,Size bound
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要