Around the Danzer problem and the construction of dense forests

DOI10.4171/LEM/1020zbMATH Open1493.52005arXiv2010.06756OpenAlexW4220696821MaRDI QIDQ2154802FDOQ2154802

F. Adiceam

Publication date: 15 July 2022

Published in: L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)

Abstract: A 1965 problem due to Danzer asks whether there exists a set with finite density in Euclidean space intersecting any convex body of volume one. A suitable weakening of the volume constraint leads to the (much more recent) problem of constructing emph{dense forests}. These are discrete point sets getting uniformly close to long enough line segments. Progress towards these problems have so far involved a wide range of ideas surrounding areas as varied as combinatorial and computation geometry, convex geometry, Diophantine approximation, discrepancy theory, the theory of dynamical systems, the theory of exponential sums, Fourier analysis, homogeneous dynamics, the mathematical theory of quasicrystals and probability theory. The goal of this paper is to survey the known results related to the Danzer Problem and to the construction of dense forests, to generalise some of them and to state a number of open problems to make further progress towards a solution to this longstanding question.

Full work available at URL: https://arxiv.org/abs/2010.06756

Recommendations

• Dense forests and Danzer sets
• Danzer's problem, effective constructions of dense forests and digital sequences
• On the Faustmann solution to the forest management problem
• The arborescence-realization problem
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• The Gilbert arborescence problem
• scientific article; zbMATH DE number 1004321
• Dense forests constructed from grids
• A \(\frac{3}{2}\) approximation for a constrained forest problem
• The Steiner forest problem revisited

zbMATH Keywords

metric geometryintegral geometryvisibilityconvex geometryconstruction of dense forests

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Metric geometry (51F99)

Cites Work

• Diophantine approximation
• Title not available (Why is that?)
• Dynamics of self-similar tilings
• Sequences, discrepancies and applications
• \(\epsilon\)-nets and simplex range queries
• Van der Corput's difference theorem: some modern developments
• Aperiodic order. Volume 1. A mathematical invitation
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unsolved problems in geometry
• The growth rate of trajectories of a quadratic differential
• Minimal sets for flows on moduli space
• Translation surfaces and their orbit closures: an introduction for a broad audience
• Dynamical directions in numeration
• Deloné property of the holonomy vectors of translation surfaces
• Directions in Mathematical Quasicrystals
• Asymptotic expansions of finite theta series
• Multiscale substitution tilings
• On Problems of Danzer and Gowers and Dynamics on the Space of Closed Subsets of ${\mathbb{R}}^d$
• Title not available (Why is that?)
• An introduction to Veech surfaces
• Title not available (Why is that?)
• Weak \(\varepsilon\)-nets for points on a hypersphere
• Piercing quasi-rectangles-on a problem of Danzer and Rogers
• Quasi-Monte-Carlo methods and the dispersion of point sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• A set containing rectifiable arcs QC-locally but not QC-globally
• Matrix representation of Husserl's part-whole-foundation theory
• Title not available (Why is that?)
• On visibility problems with an infinite discrete set of obstacles
• Dense forests and Danzer sets
• Uniformly Discrete Forests with Poor Visibility
• How Far Can You See in a Forest?
• Rational approximation and arithmetic progressions
• On a problem of Danzer
• A Danzer set for axis parallel boxes
• Title not available (Why is that?)
• Cut‐and‐project quasicrystals, lattices and dense forests

Cited In (4)

• Danzer's problem, effective constructions of dense forests and digital sequences
• Visibility properties of spiral sets
• A Danzer set for axis parallel boxes
• Dense forests and Danzer sets

This page was built for publication: Around the Danzer problem and the construction of dense forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154802)