DeepAI AI Chat
Log In Sign Up

Density of Binary Compact Disc Packings

by   Thomas Fernique, et al.

A disc packing in the plane is compact if its contact graph is a triangulation. There are 9 values of r such that a compact packing by discs of radii 1 and r exists. We prove, for each of these 9 values, that the maximal density over all the packings by discs of radii 1 and r is reached for a compact packing (we give it as well as its density).


Compact packings of the plane with three sizes of discs

Discs form a compact packing of the plane if they are interior disjoint ...

A Densest ternary circle packing in the plane

We consider circle packings in the plane with circles of sizes 1, r≃ 0.8...

Packing unequal disks in the Euclidean plane

A packing of disks in the plane is a set of disks with disjoint interior...

Density of triangulated ternary disc packings

We consider ternary disc packings of the plane, i.e. the packings using ...

COMPACT: Concurrent or Ordered Matrix-based Packing Arrangement Computation Technique

Packing optimization is a prevalent problem that necessitates robust and...

Density of Binary Disc Packings: Playing with Stoichiometry

We consider the packings in the plane of discs of radius 1 and √(2)-1 wh...