4.1 Article Proceedings Paper

Ununfoldable polyhedra with convex faces

期刊

出版社

ELSEVIER
DOI: 10.1016/S0925-7721(02)00091-3

关键词

unfolding polyhedra; nets; discrete geometry

向作者/读者索取更多资源

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along edges. We further show that such a polyhedron can indeed be unfolded if cuts are allowed to cross faces. Finally, we prove that open polyhedra with triangular faces may not be unfoldable no matter how they are cut. (C) 2002 Elsevier Science B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.1
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据