Skip to main content
Log in

On Visibility Problems with an Infinite Discrete Set of Obstacles

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

This paper deals with visibility problems in Euclidean spaces where the set of obstacles Y is an infinite discrete point set. We prove five independent results. Consider the following problem. Given \(\varepsilon >0\), imagine a forest whose trees have radius \(\varepsilon \) and their locations are given by the set Y. Suppose that a light source is at infinity, and that there are no arbitrarily large clearings in the forest. Then, are there always dark points (namely, points that do not see infinity)? We answer the above question positively. We also examine other visibility problems. In particular we show that there exists a relatively dense subset Y of \({\mathbb {Z}}^d\) such that every point in \({\mathbb {R}}^d\) has a ray to infinity with positive distance from Y. In addition, we derive a number of other results clarifying how the sizes of the sets of obstacles may affect the sets of points that are visible from infinity. We also present a geometric Ramsey type result concerning finding patterns in uniformly separated subsets of the plane, whose growth is faster than linear.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. An undirected, acyclic, connected graph.

  2. Even every arc of every circle.

  3. Note that this is the opposite case to Case 1.

  4. This follows from the term \(-{\beta }/{4N}\) that appears in the definition of the new points \(q'_i\).

  5. Note that \(32\,T>10\pi \!\!\,T\), which is the length of the diameter of \(B(\mathbf{0},5T)\).

References

  1. Adiceam, F.: How far can you see in a forest? Int. Math. Res. Not. IMRN 2016(16), 4867–4881 (2016)

    Article  MathSciNet  Google Scholar 

  2. Allen, T.T.: Pólya’s orchard problem. Am. Math. Mon. 93(2), 98–104 (1986)

    MATH  Google Scholar 

  3. Alon, N.: Uniformly discrete forests with poor visibility. Comb. Probab. Comput. 27(4), 442–448 (2018)

    Article  MathSciNet  Google Scholar 

  4. Beck, J., Chen, W.W.L.: Irregularities of Distribution. Cambridge Tracts in Mathematics, vol. 89. Cambridge University Press, Cambridge (1987)

    Book  Google Scholar 

  5. Bishop, C.J.: A set containing rectifiable arcs QC-locally but not QC-globally. Pure Appl. Math. Q. 7(1), 121–138 (2011)

    Article  MathSciNet  Google Scholar 

  6. Dumitrescu, A.: Approximate Euclidean Ramsey theorems. J. Comput. Geom. 2(1), 16–29 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Dumitrescu, A., Jiang, M.: The forest hiding problem. Discrete Comput. Geom. 45(3), 529–552 (2011)

    Article  MathSciNet  Google Scholar 

  8. Falconer, K.J.: Sets with prescribed projections and Nikodým sets. Proc. Lond. Math. Soc. 53(1), 48–64 (1986)

    Article  Google Scholar 

  9. Hening, A., Kelly, M.: On Pólya’s orchard problem. Rose-Hulman Undergraduate Math. J. 7(2), # 9 (2006)

    Google Scholar 

  10. Kruskal, C.P.: The orchard visibility problem and some variants. J. Comput. System Sci. 74(4), 587–597 (2008)

    Article  MathSciNet  Google Scholar 

  11. Mitchell, J.: Dark points among disks. In: Open Problems. Fall Workshop in Computational Geometry (Hawthorne 2007)

  12. Nikodym, O.: Sur la mesure des ensembles plans dont tous les points sont rectilinéairement accessibles. Fund. Math. 10, 116–168 (1927)

    Article  Google Scholar 

  13. Pólya, G.: Zahlentheoretisches und Wahrscheinlichkeitstheoretisches über die Sichtweite im Walde. Arch. Math. Phys. 27, 135–142 (1918)

    MATH  Google Scholar 

  14. Pólya, G., Szegő, G.: Problems and Theorems in Analysis, vol. 2. Grundlehren der Mathematischen Wissenschaften, vol. 216. Springer, New York (1976)

  15. Solomon, Y., Weiss, B.: Dense forests and Danzer sets. Ann. Sci. Éc. Norm. Supér. 49(5), 1053–1074 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are thankful to the anonymous referees for their insightful comments and corrections.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yaar Solomon.

Additional information

Editor in Charge: János Pach

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boshernitzan, M., Solomon, Y. On Visibility Problems with an Infinite Discrete Set of Obstacles. Discrete Comput Geom 66, 590–612 (2021). https://doi.org/10.1007/s00454-020-00265-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-020-00265-1

Keywords

Mathematics Subject Classification

Navigation