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

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

We extend the celebrated rigidity of the sharp first spectral gap under $Ric\ge0$ to compact infinitesimally Hilbertian spaces with non-negative (weak, also called synthetic) Ricci curvature and bounded (synthetic) dimension i.e. to…

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…

We consider a spectrum of geometric optimization problems motivated by contexts such as satellite communication and astrophysics. In the problem Minimum Scan Cover with Angular Costs, we are given a graph $G$ that is embedded in Euclidean…

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…

In [C. Xue, C. Yerger: Optimal Pebbling on Grids, Graphs and Combinatorics] the authors conjecture that if every vertex of an infinite square grid is reachable from a pebble distribution, then the covering ratio of this distribution is at…

We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_\Lambda:={\rm span} \{y\mapsto y^\nu \,: \, \nu\in \Lambda\}$ with $\Lambda\subset \mathbb{N}_0^d$ over the…

Let $P$ be a set of $n$ points in the plane. We compute the value of $\theta\in [0,2\pi)$ for which the rectilinear convex hull of $P$, denoted by $\mathcal{RH}_\theta(P)$, has minimum (or maximum) area in optimal $O(n\log n)$ time and…

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed…

We consider online packing problems where we get a stream of axis-parallel rectangles. The rectangles have to be placed in the plane without overlapping, and each rectangle must be placed without knowing the subsequent rectangles. The goal…

We prove that the area of a free boundary minimal surface $\Sigma^2 \subset B^n$, where $B^n$ is a geodesic ball contained in a round hemisphere $\mathbb{S}^n_+$, is at least as big as that of a geodesic disk with the same radius as $B^n$;…

We construct near-optimal coresets for kernel density estimates for points in $\mathbb{R}^d$ when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size $O(\sqrt{d}/\varepsilon\cdot…

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and…

This is the second paper of two in a series under the same title ([CRX]); both study the quantitative volume space form rigidity conjecture: a closed $n$-manifold of Ricci curvature at least $(n-1)H$, $H=\pm 1$ or $0$ is diffeomorphic to a…

The systolic area $\alpha_{sys}$ of a nonsimply connected compact Riemannian surface $(M,g)$ is defined as its area divided by the square of the systole, where the systole is equal to the length of a shortest noncontractible closed curve.…

We study the minimum total weight of a disk triangulation using vertices out of $\{1,\ldots,n\}$, where the boundary is the triangle $(123)$ and the $\binom{n}3$ triangles have independent weights, e.g. $\mathrm{Exp}(1)$ or…

We give a sharp upper bound for the area of a minimal two-sphere in a three-manifold (M,g) with positive scalar curvature. If equality holds, we show that the universal cover of (M,g) is isometric to a cylinder.

We prove a new lower bound on the critical density $\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic…

We prove that the unique least-perimeter way of partitioning the unit 2-dimensional disk into three regions of prescribed areas is by means of the standard graph consisting in three balanced constant geodesic curvature curves meeting…