Related papers: Relaxed Disk Packing
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
We consider generalizations of the familiar fifteen-piece sliding puzzle on the 4 by 4 square grid. On larger grids with more pieces and more holes, asymptotically how fast can we move the puzzle into the solved state? We also give a…
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists no path between any pair of these points that is not…
Rearranging densely packed tabletop objects is challenging when parallel-gripper picks are infeasible without sufficient clearance around an object. This work studies the problem characteristics for practically motivated settings with…
We construct the densest known two-dimensional packings of superdisks in the plane whose shapes are defined by |x^(2p) + y^(2p)| <= 1, which contains both convex-shaped particles (p > 0.5, with the circular-disk case p = 1) and…
Template-based searches for gravitational waves are often limited by the computational cost associated with searching large parameter spaces. The study of efficient template banks, in the sense of using the smallest number of templates, is…
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without overlapping.) We consider the following algorithmic…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
Experimental designs that spread out points apart from each other on projections are important for computer experiments when not necessarily all factors have substantial influence on the response. We provide a theoretical framework to…
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…
We show that every packing of congruent regular pentagons in the Euclidean plane has density at most $(5-\sqrt5)/3$, which is about 0.92. More specifically, this article proves the pentagonal ice-ray conjecture of Henley (1986), and…
In this paper we study the asymptotic properties of point configurations that achieve optimal covering of sets lacking smoothness. Our results include the proofs of the existence of asymptotics of best covering and maximal polarization for…
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…
An extremal $k$-packing is a collection of $k$ mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus $g\ge 3$ containing extremal…
It is commonly believed that the most efficient way to pack a finite number of equal-sized spheres is by arranging them tightly in a cluster. However, mathematicians have conjectured that a linear arrangement may actually result in the…
A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach asked the following question: For n > 3 odd, what is the maximum perimeter…
Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…
In order to study the fundamental limits of network densification, we look at the spatial spectral efficiency gain achieved when densely deployed communication devices embedded in the $d$-dimensional Euclidean space are optimally `matched'…
This paper applies techniques from algebraic and differential geometry to determine how to best pack points in real projective spaces. We present a computer-assisted proof of the optimality of a particular 6-packing in…
Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…