English
Related papers

Related papers: On exact covering with unit disks

200 papers

For any delta > 1 we construct a periodic and locally finite packing of the plane with ellipses whose delta-enlargement covers the whole plane. This answers a question of Imre B\'ar\'any. On the other hand, we show that if C is a packing in…

Metric Geometry · Mathematics 2007-05-23 Krystyna Kuperberg , Włodzimierz Kuperberg , Jiří Matoušek , Pavel Valtr

In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.

Metric Geometry · Mathematics 2013-07-25 Sibylla Priess-Crampe , Paulo Ribenboim

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter---the total length of all pieces of their boundaries visible from above. We prove that if the centers…

Computational Geometry · Computer Science 2013-09-17 Gabriel Nivasch , János Pach , Gábor Tardos

It is well known that in an exact covering system in $\mathbb{Z}$, the biggest modulus must be repeated. Very recently, Kim gave an analogous result for certain quadratic fields, and Kim also conjectured that it must hold in any algebraic…

Number Theory · Mathematics 2013-01-21 Yupeng Jiang , Yingpu Deng

A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…

We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way…

The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate…

Metric Geometry · Mathematics 2026-04-29 György Dósa , Zsolt Lángi , Zsolt Tuza

In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…

Optimization and Control · Mathematics 2018-11-05 C. O. Lopez , J. E. Beasley

A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…

Computational Geometry · Computer Science 2022-09-07 Oswin Aichholzer , Alan Arroyo , Zuzana Masárová , Irene Parada , Daniel Perz , Alexander Pilz , Josef Tkadlec , Birgit Vogtenhuber

We consider a modification of Winkler's "dots and coins" problem, where we constrain the dots to lie on a square lattice in the plane. We construct packings of "coins" (closed unit disks) using motif patterns.

Combinatorics · Mathematics 2013-10-29 Jeremy F. Alm , Nicholas Hommowun , Elizabeth Manary , Aaron Schneider

We study the completeness and ultracompleteness numbers of a convergence space. In the case of a completely regular topological space, the completeness number is countable if and only if the space is $\v{C}$ech-complete, and the…

General Topology · Mathematics 2020-01-01 Frédéric Mynard

In this survey we present the history and recent progress on several fundamental (quasi)conformal uniformization problems in the complex plane. Uniformization refers to the process of mapping a space to a canonical model by means of a…

Complex Variables · Mathematics 2026-03-17 Dimitrios Ntalampekos

We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…

Computational Geometry · Computer Science 2014-11-26 Dae-Sung Jang , Han-Lim Choi

A well-known result from Brouwer states that any orientation preserving homeomorphism of the plane with no fixed points has an empty non-wandering set. In particular, an invariant compact set implies the existence of a fixed point. In this…

Dynamical Systems · Mathematics 2019-06-11 Alejo García

Every smooth cubic plane curve has 9 flex points and 27 sextatic points. We study the following question asked by Farb: Is it true that the known algebraic structures give all the possible ways to continuously choose $n$ distinct points on…

Algebraic Geometry · Mathematics 2024-11-04 Ishan Banerjee , Weiyan Chen

If every vertex in a map has one out of two face-cycle types, then the map is said to be $2$-semiequivelar. A 2-uniform tiling is an edge-to-edge tiling of regular polygons having $2$ distinct transitivity classes of vertices. Clearly, a…

Combinatorics · Mathematics 2021-05-05 Dipendu Maity

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

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Combinatorics · Mathematics 2017-01-04 Rom Pinchasi , Yuri Rabinovich

We show, in this first part, that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $16$. We produce examples with…

Algebraic Geometry · Mathematics 2022-01-24 Fabrizio Catanese

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
‹ Prev 1 3 4 5 6 7 10 Next ›