English
Related papers

Related papers: Packing and covering with balls on Busemann surfac…

200 papers

In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…

Differential Geometry · Mathematics 2023-01-11 Tatsuya Miura

Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…

Computational Geometry · Computer Science 2017-10-09 David Eppstein

Since the set of volumes of hyperbolic 3-manifolds is well ordered, for each fixed g there is a genus-g surface bundle over the circle of minimal volume. Here, we introduce an explicit family of genus-g bundles which we conjecture are the…

Geometric Topology · Mathematics 2014-10-01 John William Aaber , Nathan M. Dunfield

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…

Computational Geometry · Computer Science 2013-11-26 Ivo Vigan

The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…

Optimization and Control · Mathematics 2023-04-28 Ernesto G. Birgin , Antoine Laurain , Rafael Massambone , Arthur G. Santana

Let an $R$-body be the complement of the union of open balls of radius $R$ in $\mathbb{E}^d$. The $R$-hulloid of a closed not empty set $A$, the minimal $R$-body containing $A$, is investigated; if $A$ is the set of the vertices of a…

Analysis of PDEs · Mathematics 2022-10-11 M. Longinetti , P. Manselli , A. Venturi

In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the…

Data Structures and Algorithms · Computer Science 2017-12-13 Sayan Bandyapadhyay , Santanu Bhowmick , Tanmay Inamdar , Kasturi Varadarajan

In this paper we describe the intersection between the balls of maximal symplectic packings of $\P^2$. This analysis shows the existence of singular points for maximal packings of $\P^2$ by more than three equal balls. It also yields a…

Symplectic Geometry · Mathematics 2007-05-23 Emmanuel Opshtein

Let $\mathcal{M}_{g,\epsilon}$ be the $\epsilon$-thick part of the moduli space $\mathcal{M}_g$ of closed genus $g$ surfaces. In this article, we show that the number of balls of radius $r$ needed to cover $\mathcal{M}_{g,\epsilon}$ is…

Geometric Topology · Mathematics 2013-01-29 Alastair Fletcher , Jeremy Kahn , Vladimir Markovic

For Finsler metrics (no reversibility assumed) on closed orientable surfaces of genus greater than one, we study the dynamics of minimal rays and minimal geodesics in the universal cover. We prove in particular, that for almost all…

Dynamical Systems · Mathematics 2014-04-03 Jan Philipp Schröder

Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…

Metric Geometry · Mathematics 2017-06-19 K. Böröczky , A. Heppes , E. Makai

The systoles of a hyperbolic surface {\Sigma} are the shortest closed geodesics. We say that the systoles fill the surface if the set Syst({\Sigma}) of all systoles cuts {\Sigma} into polygons. We refine an idea of Schmutz [15] to construct…

Geometric Topology · Mathematics 2023-10-25 Ingrid Irmer , Olivier Mathieu

If (M^n, g) is a complete Riemannian manifold with filling radius at least R, then we prove that it contains a ball of radius R and volume at least c(n)R^n. If (M^n, hyp) is a closed hyperbolic manifold and if g is another metric on M with…

Differential Geometry · Mathematics 2007-05-23 Larry Guth

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 consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…

Dynamical Systems · Mathematics 2022-03-18 Krzysztof Burdzy , Mauricio Duarte

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

Computational Geometry · Computer Science 2026-04-30 Reilly Browne

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

Probability · Mathematics 2025-09-24 Mathew D. Penrose , Xiaochuan Yang

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi