Developing a tetramonohedron with minimum cut length

DOI10.1016/j.comgeo.2022.101903zbMath1502.51010OpenAlexW4281679090WikidataQ114195481 ScholiaQ114195481MaRDI QIDQ2088883

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Publication date: 6 October 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101903

zbMATH Keywords

computational origamiminimum cut developmenttetramonohedron

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Geometric constructions in real or complex geometry (51M15)

Cites Work

• Unnamed Item
• The volume as a metric invariant of polyhedra
• Bumpy pyramid folding
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES

This page was built for publication: Developing a tetramonohedron with minimum cut length