Developing a tetramonohedron with minimum cut length
type: Item
instance of: scholarly article
title: Developing a tetramonohedron with minimum cut length
zbMATH Open document ID: 1502.51010
author: Erik D. Demaine
author: Martin L. Demaine
author: Ryuhei Uehara
published in: Computational Geometry
publication date: 2022-10-06T00:00:00Z
review text: 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.
reviewed by: Cătălin Barbu
Mathematics Subject Classification ID: 51M15
Mathematics Subject Classification ID: 52B55
zbMATH DE Number: 7596912
zbMATH Keywords: computational origami
zbMATH Keywords: minimum cut development
zbMATH Keywords: tetramonohedron
MaRDI profile type: Publication
full work available at URL: j.comgeo.2022.101903
OpenAlex ID: W4281679090
Wikidata QID: Q114195481
cites work: Bumpy pyramid folding
cites work: Q4910117
cites work: DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
cites work: The volume as a metric invariant of polyhedra
DOI: 10.1016/J.COMGEO.2022.101903
Recommended article: Minimal tetrahedralizations of a class of polyhedra
Recommended article: Cutting a polytope
Recommended article: Convex developments of a regular tetrahedron
Recommended article: Constructing a Tetrahedron with Prescribed Heights and Widths
Recommended article: On the multiway cut polyhedron
Recommended article: Lengthening a tetrahedron
Recommended article: On the Shape of Tetrahedra from Bisection
Recommended article: Finding equal-diameter tetrahedralizations of polyhedra
description: scientific article; zbMATH DE number 7596912