将多胺折叠成八面体

IF 0.4 4区 计算机科学 Q4 MATHEMATICS Computational Geometry-Theory and Applications Pub Date : 2023-01-01 DOI:10.1016/j.comgeo.2022.101917
Eva Stehr, Linda Kleist
{"title":"将多胺折叠成八面体","authors":"Eva Stehr,&nbsp;Linda Kleist","doi":"10.1016/j.comgeo.2022.101917","DOIUrl":null,"url":null,"abstract":"<div><p><span>We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the </span>octahedron<span>. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.</span></p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Folding polyiamonds into octahedra\",\"authors\":\"Eva Stehr,&nbsp;Linda Kleist\",\"doi\":\"10.1016/j.comgeo.2022.101917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the </span>octahedron<span>. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.</span></p></div>\",\"PeriodicalId\":51001,\"journal\":{\"name\":\"Computational Geometry-Theory and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Geometry-Theory and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925772122000608\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925772122000608","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

我们研究了折叠成最小但未经研究的柏拉图式固体——八面体的多角体(由三角形网格产生的多边形)。我们展示了许多结果。首先,我们表征了含有正面积孔的可折叠多胺,即除一个外的每个多胺都是可折叠的。其次,我们证明了一个凸的多胺折叠成八面体,当且仅当它包含五个多胺中的一个。第三,我们提出了一个尖锐的尺寸界限:虽然存在尺寸为14的不可折叠的多胺,但每个尺寸至少为15的多胺都折叠成八面体。这清楚地表明,人们可以在多项式时间内测试给定的多胺是否折叠成八面体。最后,我们证明了对于正整数到面的任何赋值,都存在一个折叠成八面体的多多面体,使得覆盖一个面的三角形的数量等于所赋值的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Folding polyiamonds into octahedra

We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.60
自引率
16.70%
发文量
43
审稿时长
>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
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1