Uniformly Discrete Forests with Poor Visibility
From MaRDI portal
Recommendations
- Indistinguishability of trees in uniform spanning forests
- Uniform spanning forests
- Indistinguishability of collections of trees in the uniform spanning forest
- Forests in random graphs
- A counterexample to the algorithms for determining opaque minimal forests
- Uniform generation of forests of restricted height
- Uniform spanning forests on biased Euclidean lattices
- scientific article; zbMATH DE number 1123757
Cites work
- A non-linear lower bound for planar epsilon-nets
- A set containing rectifiable arcs QC-locally but not QC-globally
- Dense forests and Danzer sets
- How far can you see in a forest?
- scientific article; zbMATH DE number 3528170 (Why is no real title available?)
- On problems of Danzer and Gowers and dynamics on the space of closed subsets of R^d
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(11)- On visibility problems with an infinite discrete set of obstacles
- Around the Danzer problem and the construction of dense forests
- Visibility properties of spiral sets
- scientific article; zbMATH DE number 1195780 (Why is no real title available?)
- How far can you see in a forest?
- The forest hiding problem, an illumination problem for maximal disk packings
- Dense forests constructed from grids
- Danzer's problem, effective constructions of dense forests and digital sequences
- Cut‐and‐project quasicrystals, lattices and dense forests
- The forest hiding problem
- A new construction of forests with low visibility
This page was built for publication: Uniformly Discrete Forests with Poor Visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177357)
