Density of triangulated ternary disc packings

11/05/2022
by   Thomas Fernique, et al.
0

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 15 other pairs, we proved the density to be maximized by a triangulated packing using only two sizes of discs; for 40 pairs, we found non-triangulated packings strictly denser than any triangulated one; finally, we classified the remaining cases where our methods are not applicable.

READ FULL TEXT

page 2

page 9

page 25

page 33

page 34

page 35

page 36

page 37

research
02/17/2020

Density of Binary Compact Disc Packings

A disc packing in the plane is compact if its contact graph is a triangu...
research
12/04/2019

A Densest ternary circle packing in the plane

We consider circle packings in the plane with circles of sizes 1, r≃ 0.8...
research
05/22/2023

Packing unequal disks in the Euclidean plane

A packing of disks in the plane is a set of disks with disjoint interior...
research
06/25/2020

Density of Binary Disc Packings: Playing with Stoichiometry

We consider the packings in the plane of discs of radius 1 and √(2)-1 wh...
research
08/31/2018

Compact packings of the plane with three sizes of discs

Discs form a compact packing of the plane if they are interior disjoint ...
research
02/16/2018

A Reallocation Algorithm for Online Split Packing of Circles

The Split Packing algorithm is an offline algorithm that packs a set of ...

Please sign up or login with your details

Forgot password? Click here to reset