Developing a tetramonohedron with minimum cut length

Computational Geometry(2023)

引用 0|浏览23
暂无评分
摘要
In this paper, we investigate the way of unfolding a given tetramonohedron, which is a tetrahedron that consists of four congruent triangles. Our aim is finding a way that achieves the minimum cut length to develop it. We first show the rigorous way to unfold any given tetramonohedron with minimum cut length. Next, we focus on a family of tetramonohedra that consist of four congruent isosceles triangles. For this family, we apply our result and investigate their behavior. (C) 2022 Elsevier B.V. All rights reserved.
更多
查看译文
关键词
Computational origami,Minimum cut development,Tetramonohedron
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要