English
Related papers

Related papers: Relaxed Disk Packing

200 papers

We introduce ordered and unordered configuration spaces of 'clusters' of points in an Euclidean space $\mathbb{R}^d$, where points in each cluster satisfy a 'verticality' condition, depending on a decomposition $d=p+q$. We compute the…

Algebraic Topology · Mathematics 2022-05-03 Andrea Bianchi , Florian Kranhold

The random sequential adsorption of various particle shapes is studied in order to determine the influence of particle anisotropy on the saturated random packing. For all tested particles there is an optimal level of anisotropy which…

Materials Science · Physics 2015-10-28 Michał Cieśla , Grzegorz Pająk , Robert M. Ziff

Circles of a single size can pack together densely in a hexagonal lattice, but adding in size variety disrupts the order of those packings. We conduct simulations which generate dense random packings of circles with specified size…

Computational Physics · Physics 2024-06-18 David J. Meer , Isabela Galoustian , Julio Gabriel de Falco Manuel , Eric R. Weeks

Monodisperse circular disks have been collectively packed in confined geometries using a Monte Carlo method where the compaction is propelled by two- dimensional stochastic agitation. We have found that confinement (i.e., finite-size plus…

Mesoscale and Nanoscale Physics · Physics 2012-02-01 Bjoern Arnold , Ayse Turak , Alejandro Diaz Ortiz

We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…

Soft Condensed Matter · Physics 2015-06-04 A. Mughal , H. K. Chan , D. Weaire , S. Hutzler

Given a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is at most $1$. We consider the problem of computing a maximum…

Computational Geometry · Computer Science 2025-06-30 Anastasiia Tkachenko , Haitao Wang

This paper proposes a Lagrangian approach to find the state equations of a disk rolling on a plane without friction. The approach takes advantage of a symbolic computation to simplify the reasoning.

Numerical Analysis · Mathematics 2023-11-29 Luc Jaulin

We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost…

Probability · Mathematics 2010-12-22 Charles Bordenave , Giovanni Luca Torrisi

We formulate and solve by semi-analytic means the axisymmetric equilibria of relativistic self-similar disks of infinitesimal vertical thickness. These disks are supported in the horizontal directions against their self-gravity by a…

Astrophysics · Physics 2009-11-07 Mike J. Cai , Frank H. Shu

We describe an algorithm that allows one to find dense packing configurations of a number of congruent disks in arbitrary domains in two or more dimensions. We have applied it to a large class of two dimensional domains such as rectangles,…

Computational Geometry · Computer Science 2023-09-01 Paolo Amore , Damian de la Cruz , Valeria Hernandez , Ian Rincon , Ulises Zarate

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…

Combinatorics · Mathematics 2026-04-17 Michael Dougherty , Gina Root

A collection of spherical particles can be packed tightly together into an amorphous packing known as "random close packing" (RCP). This structure is of interest as a model for the arrangement of molecules in simple liquids and glasses, as…

Soft Condensed Matter · Physics 2015-03-13 Rei Kurita , Eric R Weeks

We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…

Optimization and Control · Mathematics 2012-08-29 Carolyn L. Phillips , Joshua A. Anderson , Elizabeth R. Chen , Sharon C. Glotzer

In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…

General Mathematics · Mathematics 2025-05-20 Jianqiang Zhao

The mesoscopic properties of a plasma in a cylindrical magnetic field are investigated from the view point of test-particle dynamics. When the system has enough time and spatial symmetries, a Hamiltonian of a test particle is completely…

Plasma Physics · Physics 2019-09-19 Shun Ogawa , Xavier Leoncini , Alexei Vasiliev , Xavier Garbet

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

Analysis of PDEs · Mathematics 2024-06-19 Francesco Nobili , Matteo Novaga

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…

Soft Condensed Matter · Physics 2015-06-04 Carolyn L. Phillips , Joshua A. Anderson , Greg Huber , Sharon C. Glotzer

We examine a simple hard disc fluid with no long range interactions on the two dimensional space of constant negative Gaussian curvature, the hyperbolic plane. This geometry provides a natural mechanism by which global crystalline order is…

Statistical Mechanics · Physics 2007-12-03 Carl D. Modes , Randall D. Kamien

We study a single-flip dynamics for the monotone surface in (2+1) dimensions obtained from a boxed plane partition. The surface is analyzed as a system of non-intersecting simple paths. When the flips have a non-zero bias we prove that…

Probability · Mathematics 2012-05-15 Pietro Caputo , Fabio Martinelli , Fabio Lucio Toninelli

Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the…

Combinatorics · Mathematics 2012-07-31 Adrian Dumitrescu , Csaba D. Tóth