{"title":"Density of triangulated ternary disc packings","authors":"Thomas Fernique , 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>></mo><mi>r</mi><mo>></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 , , 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.
期刊介绍:
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.