Developing a tetramonohedron with minimum cut length

IF 0.4 4区计算机科学 Q4 MATHEMATICS Computational Geometry-Theory and Applications Pub Date : 2023-01-01 DOI:10.1016/j.comgeo.2022.101903

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

引用次数: 0

Abstract

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

开发具有最小切割长度的四面体

本文研究了给定四面体的展开方法，该四面体是由四个全等三角形组成的四面体。我们的目标是找到一种方法来达到最小的切割长度来开发它。我们首先展示了用最小切割长度展开任意给定四面体的严格方法。接下来，我们关注一个由四个等腰三角形组成的四面体族。对于这个家庭，我们应用我们的结果并调查他们的行为。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Computational Geometry-Theory and Applications 数学-数学

CiteScore

1.60

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems. Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.

期刊最新文献

Editorial Board Largest unit rectangles inscribed in a convex polygon Packing unequal disks in the Euclidean plane Editorial Board Improved approximation for two-dimensional vector multiple knapsack