Developing a tetramonohedron with minimum cut length (Q2088883)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7596912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Developing a tetramonohedron with minimum cut length |
scientific article; zbMATH DE number 7596912 |
Statements
Developing a tetramonohedron with minimum cut length (English)
0 references
6 October 2022
0 references
In this paper, the authors investigate the way of unfolding a given tetramonohedron, which is a tetrahedron that consists of four congruent triangles. Their aim is to find a way that achieve the minimum cut length to develop it. The authors show the rigorous way to unfold any given tetramonohedron with minimum cut length.
0 references
computational origami
0 references
minimum cut development
0 references
tetramonohedron
0 references
0.83135265
0 references
0.8186165
0 references
0.8097112
0 references
0 references
0.80657935
0 references
0.8064862
0 references
