3,809 research outputs found
Dense forests and Danzer sets
A set that intersects every convex set of volume
is called a Danzer set. It is not known whether there are Danzer sets in
with growth rate . We prove that natural candidates,
such as discrete sets that arise from substitutions and from cut-and-project
constructions, are not Danzer sets. For cut and project sets our proof relies
on the dynamics of homogeneous flows. We consider a weakening of the Danzer
problem, the existence of uniformly discrete dense forests, and we use
homogeneous dynamics (in particular Ratner's theorems on unipotent flows) to
construct such sets. We also prove an equivalence between the above problem and
a well-known combinatorial problem, and deduce the existence of Danzer sets
with growth rate , improving the previous bound of
On a problem of danzer
This article does not have an abstract
On a Problem of Danzer
Let C be a bounded convex object in R^d, and P a set of n points lying outside C. Further let c_p, c_q be two integers with 1 <= c_q <= c_p <= n - floor[d/2], such that every c_p + floor[d/2] points of P contains a subset of size c_q + floor[d/2] whose convex-hull is disjoint from C. Then our main theorem states the existence of a partition of P into a small number of subsets, each of whose convex-hull is disjoint from C. Our proof is constructive and implies that such a partition can be computed in polynomial time.
In particular, our general theorem implies polynomial bounds for Hadwiger-Debrunner (p, q) numbers for balls in R^d. For example, it follows from our theorem that when p > q >= (1+beta) * d/2 for beta > 0, then any set of balls satisfying the HD(p,q) property can be hit by O(q^2 p^{1+1/(beta)} log p) points. This is the first improvement over a nearly 60-year old exponential bound of roughly O(2^d).
Our results also complement the results obtained in a recent work of Keller et al. where, apart from improvements to the bound on HD(p, q) for convex sets in R^d for various ranges of p and q, a polynomial bound is obtained for regions with low union complexity in the plane
Lower Bounds for Pinning Lines by Balls
A line L is a transversal to a family F of convex objects in R^d if it
intersects every member of F. In this paper we show that for every integer d>2
there exists a family of 2d-1 pairwise disjoint unit balls in R^d with the
property that every subfamily of size 2d-2 admits a transversal, yet any line
misses at least one member of the family. This answers a question of Danzer
from 1957
Minimum Convex Partitions and Maximum Empty Polytopes
Let be a set of points in . A Steiner convex partition
is a tiling of with empty convex bodies. For every integer ,
we show that admits a Steiner convex partition with at most tiles. This bound is the best possible for points in general
position in the plane, and it is best possible apart from constant factors in
every fixed dimension . We also give the first constant-factor
approximation algorithm for computing a minimum Steiner convex partition of a
planar point set in general position. Establishing a tight lower bound for the
maximum volume of a tile in a Steiner convex partition of any points in the
unit cube is equivalent to a famous problem of Danzer and Rogers. It is
conjectured that the volume of the largest tile is .
Here we give a -approximation algorithm for computing the
maximum volume of an empty convex body amidst given points in the
-dimensional unit box .Comment: 16 pages, 4 figures; revised write-up with some running times
improve
- …