Density of triangulated ternary disc packings

IF 0.4 4区 计算机科学 Q4 MATHEMATICS Computational Geometry-Theory and Applications Pub Date : 2023-06-20 DOI:10.1016/j.comgeo.2023.102032
Thomas Fernique , Daria Pchelina
{"title":"Density of triangulated ternary disc packings","authors":"Thomas Fernique ,&nbsp;Daria Pchelina","doi":"10.1016/j.comgeo.2023.102032","DOIUrl":null,"url":null,"abstract":"<div><p>We consider <em>ternary</em> disc packings of the plane, i.e. the packings using discs of three different radii. Packings in which each “hole” is bounded by three pairwise tangent discs are called <em>triangulated</em>. There are 164 pairs <span><math><mo>(</mo><mi>r</mi><mo>,</mo><mi>s</mi><mo>)</mo></math></span>, <span><math><mn>1</mn><mo>&gt;</mo><mi>r</mi><mo>&gt;</mo><mi>s</mi></math></span>, allowing triangulated packings by discs of radii 1, <em>r</em> and <em>s</em>. In this paper, we enhance existing methods of dealing with maximal-density packings in order to find ternary triangulated packings which maximize the density among all the packings with the same disc radii. We showed for 16 pairs that the density is maximized by a triangulated ternary packing; for 16 other pairs, we proved the density to be maximized by a triangulated packing using only two sizes of discs; for 45 pairs, we found non-triangulated packings strictly denser than any triangulated one; finally, we classified the remaining cases where our methods are not applicable.</p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-06-20","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/S0925772123000524","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider ternary disc packings of the plane, i.e. the packings using discs of three different radii. Packings in which each “hole” is bounded by three pairwise tangent discs are called triangulated. There are 164 pairs (r,s), 1>r>s, allowing triangulated packings by discs of radii 1, r and s. In this paper, we enhance existing methods of dealing with maximal-density packings in order to find ternary triangulated packings which maximize the density among all the packings with the same disc radii. We showed for 16 pairs that the density is maximized by a triangulated ternary packing; for 16 other pairs, we proved the density to be maximized by a triangulated packing using only two sizes of discs; for 45 pairs, we found non-triangulated packings strictly denser than any triangulated one; finally, we classified the remaining cases where our methods are not applicable.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
三角形三元圆盘填料的密度
我们考虑平面的三元圆盘填料,即使用三个不同半径圆盘的填料。每个“孔”由三个成对的切圆界定的填料称为三角填料。有164对(r,s),1>;r>;s、 允许半径为1、r和s的圆盘进行三角填料。在本文中,我们改进了现有的处理最大密度填料的方法,以便在具有相同圆盘半径的所有填料中找到最大密度的三元三角填料。我们证明,对于16对,密度通过三角化的三元堆积而最大化;对于另外16对,我们证明了密度通过仅使用两种尺寸的圆盘的三角填充而最大化;对于45对填料,我们发现非三角填料的密度严格高于任何三角填料;最后,我们对我们的方法不适用的剩余情况进行了分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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