Density of Binary Disc Packings:Lower and Upper Bounds

07/29/2021
by   Thomas Fernique, et al.
0

We provide, for any r∈ (0,1), lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius 1 and r. The lower bounds are mostly folk, but the upper bounds improve the best previously known ones for any r∈[0.11,0.74]. For many values of r, this gives a fairly good idea of the exact maximum density. In particular, we get new intervals for r which does not allow any packing more dense that the hexagonal packing of equal discs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2018

A new lower bound for classic online bin packing

We improve the lower bound on the asymptotic competitive ratio of any on...
research
11/08/2022

Multiple Packing: Lower and Upper Bounds

We study the problem of high-dimensional multiple packing in Euclidean s...
research
11/28/2017

When are epsilon-nets small?

In many interesting situations the size of epsilon-nets depends only on ...
research
07/20/2021

Prior-Free Clock Auctions for Bidders with Interdependent Values

We study the problem of selling a good to a group of bidders with interd...
research
04/27/2016

New Bounds for Hypergeometric Creative Telescoping

Based on a modified version of Abramov-Petkovšek reduction, a new algori...
research
07/01/2020

A survey on stability measure of networks

In this paper, we discuss tenacity and its properties in the stability c...
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...

Please sign up or login with your details

Forgot password? Click here to reset