AI Chat AI Image Generator AI Video Text to Speech

Density of Binary Compact Disc Packings

02/17/2020

∙

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).

Thomas Fernique
16 publications
Nicolas Bédaride
2 publications

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 ...

0 Thomas Fernique, et al. ∙

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...

0 Thomas Fernique, et al. ∙

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...

0 Thomas Fernique, et al. ∙

research

∙ 11/05/2022

Density of triangulated ternary disc packings

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

0 Thomas Fernique, et al. ∙

research

∙ 04/26/2021

Compact Packings are not always the Densest

We provide a counterexample to a conjecture by B. Connelly about density...

0 Thomas Fernique, et al. ∙

research

∙ 12/09/2020

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

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

0 Gokhan Serhat, et al. ∙

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...

0 Thomas Fernique, et al. ∙