Visibility in the plane

DOI10.1016/J.JNT.2009.02.019MaRDI QIDQ838444zbMATH OpenOpenAlexFDO

Authors Sukumar Das Adhikari, Andrew Granville

Publication date 26 August 2009

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jnt.2009.02.019

zbMATH Keywords

visible sets

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06)

Review text

We say that \(a\in \mathbb Z ^D\) is visible from \(b\in \mathbb Z ^D\) if there is no element of \(\mathbb Z ^D\) on the straight segment in-between \(a\) and \(b\). In this paper the authors find the size of the smallest subset of the set of integer lattice points, such that every element of a given rectangular grid is visible from our subset, which in particular answers a question of Paul Erdős et al.

Recommendations

Cites work

Cited in

(19)

This page was built for publication: Visibility in the plane

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