Ununfoldable polyhedra with 6 vertices or 6 faces

Computational Geometry(2022)

引用 1|浏览10
暂无评分
摘要
We update the record of the simplest possible topologically convex polyhedron that has no edge unfolding, measuring complexity in terms of number of vertices or number of faces. Specifically, we prove that 6 vertices are sufficient, and that 6 faces are sufficient, for ununfoldability.
更多
查看译文
关键词
Computational origami,Edge unfolding,Topologically convex polyhedron
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要