Danzer's problem, effective constructions of dense forests and digital sequences
From MaRDI portal
Publication:6074969
DOI10.1112/mtk.12153zbMath1522.52008arXiv2111.02773OpenAlexW3209553585MaRDI QIDQ6074969
Publication date: 20 September 2023
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.02773
Density, gaps, topology (11B05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Diophantine approximation in probabilistic number theory (11K60)
Related Items (1)
Cites Work
- A set containing rectifiable arcs QC-locally but not QC-globally
- Sequences, discrepancies and applications
- \(\epsilon\)-nets and simplex range queries
- Well dispersed sequences in \([0,1^{d}\)]
- Around the Danzer problem and the construction of dense forests
- On a problem of Danzer
- Dense forests and Danzer sets
- Uniformly Discrete Forests with Poor Visibility
- A Sequence Well Dispersed in the Unit Square
- How Far Can You See in a Forest?
- On Problems of Danzer and Gowers and Dynamics on the Space of Closed Subsets of ${\mathbb{R}}^d$
- On a method of constructing well-dispersed sequences
- Cut‐and‐project quasicrystals, lattices and dense forests
This page was built for publication: Danzer's problem, effective constructions of dense forests and digital sequences
