English
Related papers

Related papers: On optimal $\lambda$-separable packings in the pla…

200 papers

Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points…

Optimization and Control · Mathematics 2012-08-21 Gennadiy Averkov

Consider a general circle packing $\mathcal{P}$ in the complex plane $\mathbb{C}$ invariant under a Kleinian group $\Gamma$. When $\Gamma$ is convex-cocompact or its critical exponent is greater than 1, we obtain an effective…

Dynamical Systems · Mathematics 2017-02-23 Wenyu Pan

We show that, under certain natural assumptions, large random plane bipartite maps with a boundary converge after rescaling to a one-parameter family ($\mathrm{BD}_L$, $0 < L < \infty$) of random metric spaces homeomorphic to the closed…

Probability · Mathematics 2016-02-12 Jérémie Bettinelli , Gregory Miermont

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

Metric Geometry · Mathematics 2026-04-24 Fernando Mário de Oliveira Filho , Andreas Spomer , Frank Vallentin

An open problem of Manuel Abellanas asks whether every set of disjoint closed unit disks in the plane can be connected by a conveyor belt, which means a tight simple closed curve that touches the boundary of each disk, possibly multiple…

A fundamental question is whether one can maintain a maximum independent set in polylogarithmic update time for a dynamic collection of geometric objects in Euclidean space. Already, for a set of intervals, it is known that no dynamic…

Computational Geometry · Computer Science 2023-12-07 Sujoy Bhore , Martin Nöllenburg , Csaba D. Tóth , Jules Wulms

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 investigate the pebble isolation mass for a planet on a fixed eccentric orbit in its protoplanetary disc by conducting a set of 2D hydrodynamical simulations including dust turbulent diffusion. A range of planet eccentricities up to…

Earth and Planetary Astrophysics · Physics 2022-01-19 Raúl O. Chametla , Frédéric S. Masset , Clément Baruteau , Bertram Bitsch

We study subgroups of ${\rm PU}(2,1)$ generated by two non-commuting unipotent maps $A$ and $B$ whose product $AB$ is also unipotent. We call $\mathcal{U}$ the set of conjugacy classes of such groups. We provide a set of coordinates on…

Geometric Topology · Mathematics 2018-03-16 John R. Parker , Pierre Will

We obtain an asymptotic formula for the number of circles of curvature at most T in any given bounded Apollonian circle packing. For an integral packing, we obtain the upper bounds for the number of circles with prime curvature as well as…

Dynamical Systems · Mathematics 2010-12-14 Alex Kontorovich , Hee Oh

Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…

Data Structures and Algorithms · Computer Science 2024-01-09 Arnold Filtser

Here we consider the possible bulk and shear moduli of planar polycrystals built from a single crystal in various orientations. Previous work gave a complete characterization for crystals with orthotropic symmetry. Specifically, bounds were…

Analysis of PDEs · Mathematics 2021-09-22 Graeme W. Milton

We consider a smooth Euclidean solid cone endowed with a smooth homogeneous density function used to weight Euclidean volume and hypersurface area. By assuming convexity of the cone and a curvature-dimension condition we prove that the…

Differential Geometry · Mathematics 2013-04-17 Antonio Cañete , César Rosales

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

Discrete Mathematics · Computer Science 2017-06-01 Valentin Gledel , Aline Parreau

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

Computational Geometry · Computer Science 2011-12-01 Alina Ene , Sariel Har-Peled , Benjamin Raichel

Let $p_0,\ldots,p_n$ be a finite sequence of points in an Euclidean space $\R^d$. Suppose that there is a (pointlike) particle sitting at each point $p_i$. In a ``legal'' move, any one of them can jump over another, landing on the other…

Combinatorics · Mathematics 2025-07-31 Janos Pach , Gabor Tardos

A polygonal curve $P$ with $n$ vertices is $c$-packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius $r$ is at most $cr$, for any $r>0$. Similarly, the concept of $c$-packedness can be…

Computational Geometry · Computer Science 2022-02-04 Sepideh Aghamolaei , Vahideh Keikha , Mohammad Ghodsi , Ali Mohades

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…

Discrete Mathematics · Computer Science 2020-02-11 Thomas Fernique , Amir Hashemi , Olga Sizova

Let $K$ be a convex body in Euclidean space ${\mathbb R}^d$, and let a translation invariant, locally finite Borel measure on the space of hyperplanes in ${\mathbb R}^d$ be given. For $\delta\ge 0$, we consider the set of all points $x$ for…

Metric Geometry · Mathematics 2019-11-21 Rolf Schneider

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

Computational Geometry · Computer Science 2026-02-10 Mirela Damian , Joseph O'Rourke
‹ Prev 1 8 9 10 Next ›