English
Related papers

Related papers: Density of binary disc packings: lower and upper b…

200 papers

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…

Discrete Mathematics · Computer Science 2021-05-04 Nicolas Bédaride , Thomas Fernique

We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…

Metric Geometry · Mathematics 2007-05-23 Tom Kennedy

This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…

Metric Geometry · Mathematics 2025-05-21 Thomas Fernique , Daria Pchelina

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Metric Geometry · Mathematics 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi

Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…

Metric Geometry · Mathematics 2023-03-21 Robert Connelly , Maurice Pierre

In the early 1990s, A. Bezdek and W. Kuperberg used a relatively simple argument to show a surprising result: The maximum packing density of circular cylinders of infinite length in $\mathbb{R}^3$ is exactly $\pi/\sqrt{12}$, the planar…

Metric Geometry · Mathematics 2017-09-14 Wöden Kusner

Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…

Metric Geometry · Mathematics 2016-03-04 David de Laat

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

We consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…

Discrete Mathematics · Computer Science 2022-01-21 Thomas Fernique

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Metric Geometry · Mathematics 2019-11-07 Fernando Mário de Oliveira Filho , Frank Vallentin

We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually…

Computational Geometry · Computer Science 2019-12-06 Thomas Fernique

The packing density of the regular cross-polytope in Euclidean $n$-space is unknown except in dimensions $2$ and $4$ where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for $n=3$ the…

Metric Geometry · Mathematics 2026-04-09 G. Fejes Tóth , F. Fodor , V. Vígh

In hyperbolic space density cannot be defined by a limit as we define it in Euclidean space. We describe the local density bounds for sphere packings and we discuss the different attempts to define optimal arrangements in hyperbolic space.

Metric Geometry · Mathematics 2022-02-23 Gábor Fejes Tóth , Lázló Fejes Tóth , Włodzimierz. Kuperberg

We give upper bounds for the density of unit ball packings relative to their outer parallel domains and discuss their connection to contact numbers. Also, packings of soft balls are introduced and upper bounds are given for the fraction of…

Metric Geometry · Mathematics 2015-11-24 Karoly Bezdek , Zsolt Langi

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…

Metric Geometry · Mathematics 2010-11-23 Simon Gravel , Veit Elser , Yoav Kallus

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)$,…

Computational Geometry · Computer Science 2022-11-08 Thomas Fernique , Daria Pchelina

Let $\mathcal{P}$ be a packing of circular disks of radius $\rho>0$ in the Euclidean, spherical, or hyperbolic plane. Let $0\leq\lambda\leq\rho$. We say that $\mathcal{P}$ is a $\lambda$-separable packing of circular disks of radius $\rho$…

Metric Geometry · Mathematics 2025-05-07 Károly Bezdek , Zsolt Lángi

We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area…

Computational Geometry · Computer Science 2019-03-20 Sándor P. Fekete , Phillip Keldenich , Christian Scheffer
‹ Prev 1 2 3 10 Next ›