Danzer's Problem, Effective Constructions of Dense Forests and Digital Sequences

11/04/2021
by   Ioannis Tsokanos, et al.
0

A 1965 problem due to Danzer asks whether there exists a set in Euclidean space with finite density intersecting any convex body of volume one. A recent approach to this problem is concerned with the construction of dense forests and is obtained by a suitable weakening of the volume constraint. A dense forest is a discrete point set of finite density getting uniformly close to long enough line segments. The distribution of points in a dense forest is then quantified in terms of a visibility function. Another way to weaken the assumptions in Danzer's problem is by relaxing the density constraint. In this respect, a new concept is introduced in this paper, namely that of an optical forest. An optical forest in ℝ^d is a point set with optimal visibility but not necessarily with finite density. In the literature, the best constructions of Danzer sets and dense forests lack effectivity. The goal of this paper is to provide constructions of dense and optical forests which yield the best known results in any dimension d ≥ 2 both in terms of visibility and density bounds and effectiveness. Namely, there are three main results in this work: (1) the construction of a dense forest with the best known visibility bound which, furthermore, enjoys the property of being deterministic; (2) the deterministic construction of an optical forest with a density failing to be finite only up to a logarithm and (3) the construction of a planar Peres-type forest (that is, a dense forest obtained from a construction due to Peres) with the best known visibility bound. This is achieved by constructing a deterministic digital sequence satisfying strong dispersion properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2018

On Visibility Problems with an Infinite Discrete, set of Obstacles

This paper studies visibility problems in Euclidean spaces R^d where the...
research
12/10/2020

No Krasnoselskii number for general sets in ℝ^2

For a family ℱ of sets in ℝ^d, the Krasnoselskii number of ℱ is the smal...
research
01/04/2013

The Sum-over-Forests density index: identifying dense regions in a graph

This work introduces a novel nonparametric density index defined on grap...
research
09/22/2020

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition

Given a graph G=(V,E) with arboricity α, we study the problem of decompo...
research
08/15/2023

Another virtue of wavelet forests?

A wavelet forest for a text T [1..n] over an alphabet σ takes n H_0 (T) ...
research
03/14/2021

On Planar Visibility Counting Problem

For a set S of n disjoint line segments in ℝ^2, the visibility counting ...

Please sign up or login with your details

Forgot password? Click here to reset