Related papers: Worst-Case Optimal Covering of Rectangles by Disks

We prove that the least area of the non-contractible immersed spheres is no more than $4\pi$ in any oriented compact manifold with dimension $n+2\leq 7$ which satisfies $R\geq 2$ and admits a map to $\mathbf S^2\times T^n$ with nonzero…

Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…

We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^*$ is the largest subset of diameter $r$ of $n$ points in the Euclidean…

Given any set of points $S$ in the unit square that contains the origin, does a set of axis aligned rectangles, one for each point in $S$, exist, such that each of them has a point in $S$ as its lower-left corner, they are pairwise interior…

We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an…

Given a finite set of points on the Euclidean sphere, the worst case quadrature error in Sobolev spaces has recently been shown to provide upper bounds on the covering radius of the point set. Moreover, quasi-Monte Carlo integration points…

A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

In this paper, we firstly verify that if $M$ is a complete self-shrinker with polynomial volume growth in $\mathbb{R}^{n+1}$, and if the squared norm of the second fundamental form of $M$ satisfies $0\leq|A|^2-1\leq\frac{1}{18}$, then…

In this paper, we consider a facility location problem to find a minimum-sum coverage of n points by disks centered at a fixed line. The cost of a disk with radius r has a form of a non-decreasing function f(r) = r^a for any a >= 1. The…

An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$…

Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned…

Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…

Let $D$ be a Riemannian 2-disc of area $A$, diameter $d$ and length of the boundary $L$. We prove that it is possible to contract the boundary of $D$ through curves of length $\leq L + 200d\max\{1,\ln {\sqrt{A}\over d} \}$. This answers a…

Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…

Let $(\mathcal{X},\rho)$ be a metric space and $\lambda$ be a Borel measure on this space defined on the $\sigma$-algebra generated by open subsets of $\mathcal{X}$; this measure $\lambda$ defines volumes of Borel subsets of $\mathcal{X}$.…

Forty years ago Schaer and Wetzel showed that a $\frac{1}{\pi}\times\frac {1}{2\pi}\sqrt{\pi^{2}-4}$ rectangle, whose area is about $0.122\,74,$ is the smallest rectangle that is a cover for the family of all closed unit arcs. More recently…

This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…