中文
相关论文

相关论文: Density of triangulated ternary disc packings

200 篇论文

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…

离散数学 · 计算机科学 2021-05-04 Nicolas Bédaride , Thomas Fernique

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…

计算几何 · 计算机科学 2019-12-06 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…

度量几何 · 数学 2007-05-23 Tom Kennedy

Discs form a compact packing of the plane if they are interior disjoint and the graph which connects the center of mutually tangent discs is triangulated. There is only one compact packing by discs all of the same size, called hexagonal…

离散数学 · 计算机科学 2018-09-27 Thomas Fernique , Amir Hashemi , Olga Sizova

A compact packing is a set of non-overlapping discs where all the holes between discs are curvilinear triangles. There is only one compact packing by discs of size $1$. There are exactly $9$ values of $r$ which allow a compact packing by…

离散数学 · 计算机科学 2020-02-11 Thomas Fernique , Amir Hashemi , Olga Sizova

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…

度量几何 · 数学 2023-03-21 Robert Connelly , Maurice Pierre

We provide, for any $r\in (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…

度量几何 · 数学 2022-06-07 Thomas Fernique

Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…

度量几何 · 数学 2013-01-08 Robert Connelly , William Dickinson

A compact circle-packing $P$ of the Euclidean plane is a set of circles which bound mutually disjoint open discs with the property that, for every circle $S\in P$, there exists a maximal indexed set $\{A_{0},\ldots,A_{n-1}\}\subseteq P$ so…

度量几何 · 数学 2019-07-30 Miek Messerschmidt

We present the densest known packing of regular tetrahedra with density phi = 4000/4671 = 0.856347... Like the recently discovered packings of Kallus et al. [arXiv:0910.5226] and Torquato-Jiao [arXiv:0912.4210], our packing is crystalline…

统计力学 · 物理学 2010-07-27 Elizabeth R. Chen , Michael Engel , Sharon C. Glotzer

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…

离散数学 · 计算机科学 2022-01-21 Thomas Fernique

We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…

度量几何 · 数学 2008-03-03 Tom Kennedy

Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 disks. We use a new discrete-event simulation algorithm to produce packings for up to 34 disks. For each n in the range 22 =< n =< 34 we…

度量几何 · 数学 2007-05-23 R. L. Graham B. D. Lubachevsky

For each k >= 1 and corresponding hexagonal number h(k) = 3k(k+1)+1, we introduce m(k) = max[(k-1)!/ 2, 1] packings of h(k) equal disks inside a circle which we call "the curved hexagonal packings". The curved hexagonal packing of 7 disks…

度量几何 · 数学 2007-05-23 B. D. Lubachevsky , R. L. Graham

We present our exhaustive exploration of the densest ternary sphere packings (DTSPs) for 45 radius ratios and 237 kinds of compositions, which is a packing problem of three kinds of hard spheres with different radii, under periodic boundary…

计算物理 · 物理学 2021-08-11 Ryotaro Koshoji , Taisuke Ozaki

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…

度量几何 · 数学 2007-05-23 Boris D. Lubachevsky , Ronald Graham

By a compact packing of the plane by discs, $P$, we mean a collection of closed discs in the plane with pairwise disjoint interior so that, for every disc $C\in P$, there exists a sequence of discs $D_{0},\ldots,D_{m-1}\in P$ so that each…

度量几何 · 数学 2023-05-02 Miek Messerschmidt

We identify the maximally dense lattice packings of tangent-disk trimers with fixed bond angles ($\theta = \theta_0$) and contrast them to both their nonmaximally-dense-but-strictly-jammed lattice packings as well as the disordered jammed…

软凝聚态物质 · 物理学 2019-09-04 Austin D. Griffith , Robert S. Hoy

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

度量几何 · 数学 2016-03-04 David de Laat

Packings of equal disks in the plane are known to have density at most $\pi/\sqrt{12}$, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a…

度量几何 · 数学 2016-04-19 Robert Connelly , Matthew Funkhouser , Vivian Kuperberg , Evan Solomonides
‹ 上一页 1 2 3 10 下一页 ›